[ { "user_id": "u980205854", "problem_id": "p03456", "submission1_id": "s015622076", "submission2_id": "s326278392", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\na,b = map(int,input().split())\nx = a*len(str(b))+b\nans = 'No'\nfor y in range(1000):\n if x==y*y:\n ans = 'Yes'\n break\nprint(ans)", "code2": "\na,b = map(int,input().split())\nx = a*(10**len(str(b)))+b\nans = 'No'\nfor y in range(1000):\n if x==y*y:\n ans = 'Yes'\n break\nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1599354566", "date2": "1599354601", "bleu_score": "0.9527633389981477", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 84, "total_score": 91, "input": "001 000\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["\na,b = map(int,input().split()) # (0): a=1, b=0\nx = a*len(str(b))+b # (1): x=1\nans = 'No' # (2): ans=No\nfor y in range(1000): # (3): y=0 (5): y=1\n if x==y*y: # (4): NO CHANGE (6): NO CHANGE\n ans = 'Yes' # (7): ans=Yes\n break # (8): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " \n a,b = map(int,input().split())\n-x = a*len(str(b))+b\n+x = a*(10**len(str(b)))+b\n ans = 'No'\n for y in range(1000):\n if x==y*y:\n ans = 'Yes'\n break\n print(ans)\n", "FL_content": " \n a,b = map(int,input().split())\n-x = a*len(str(b))+b\n ans = 'No'\n for y in range(1000):\n if x==y*y:\n ans = 'Yes'\n break\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u113107956", "problem_id": "p03456", "submission1_id": "s417688853", "submission2_id": "s872728320", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\na,b=input().split()\nc=a+b\nd=math.sqrt(float(c))\n\nif d*d==int(c):\n print('Yes')\nelse:\n print('No')", "code2": "import math\na,b=input().split()\nc=a+b\nd=math.floor(math.sqrt(float(c)))\n\nif int(d*d)==int(c):\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593118357", "date2": "1593122627", "bleu_score": "0.8443807866295573", "code1_test_status": [1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1], "code1_test_score": 51, "total_score": 91, "input": "101 010\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["import math\na,b=input().split() # (0): a=101, b=010\nc=a+b # (1): c=101010\nd=math.sqrt(float(c)) # (2): d=317.820704\n\nif d*d==int(c): # (3): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " import math\n a,b=input().split()\n c=a+b\n-d=math.sqrt(float(c))\n+d=math.floor(math.sqrt(float(c)))\n \n-if d*d==int(c):\n+if int(d*d)==int(c):\n print('Yes')\n else:\n print('No')\n", "FL_content": " import math\n a,b=input().split()\n c=a+b\n-d=math.sqrt(float(c))\n \n-if d*d==int(c):\n print('Yes')\n else:\n print('No')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u066455063", "problem_id": "p03456", "submission1_id": "s163200263", "submission2_id": "s902588119", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b = input().split()\nc = int(a+b)\n\nfor i in range(1, 101):\n if i ** 2 == c:\n print(\"Yes\")\n exit()\n\nprint(\"No\")\n", "code2": "a, b = map(int, input().split())\nnum = str(a) + str(b)\nnum = int(num)\n\nfor i in range(200000):\n if i ** 2 == num:\n print(\"Yes\")\n exit()\n\nprint(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569464919", "date2": "1570673937", "bleu_score": "0.683210260239465", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 90, "total_score": 91, "input": "000 000\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["a, b = input().split() # (0): a=000, b=000\nc = int(a+b) # (1): c=0\n\nfor i in range(1, 101): # (2): i=1 (4): i=2 ... (202): NO CHANGE\n if i ** 2 == c: # (3): NO CHANGE (5): NO CHANGE ... (201): NO CHANGE\n print(\"Yes\")\n exit()\n\nprint(\"No\")\n"], "anno_status": [true], "diff_content": "-a, b = input().split()\n-c = int(a+b)\n+a, b = map(int, input().split())\n+num = str(a) + str(b)\n+num = int(num)\n \n-for i in range(1, 101):\n- if i ** 2 == c:\n+for i in range(200000):\n+ if i ** 2 == num:\n print(\"Yes\")\n exit()\n \n print(\"No\")\n \n", "FL_content": "-a, b = input().split()\n-c = int(a+b)\n \n-for i in range(1, 101):\n- if i ** 2 == c:\n print(\"Yes\")\n exit()\n \n print(\"No\")\n \n", "added_lines": 5, "removed_lines": 4, "code1_lines": 10 }, { "user_id": "u672866777", "problem_id": "p03456", "submission1_id": "s982618161", "submission2_id": "s434939079", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nimport math\na, b = map(int, input().split())\n\nconnected_num = int(str(a) + str(b))\nc = int(math.sqrt(connected_num))\n\nprint(connected_num)\nif connected_num == c*c:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "\n\n\nimport math\na, b = map(int, input().split())\n\nconnected_num = int(str(a) + str(b))\nc = int(math.sqrt(connected_num))\n\nif connected_num == c*c:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598498831", "date2": "1598498894", "bleu_score": "0.8861083357326075", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 91, "input": "11 84\n", "actual_output": "1184\nNo\n", "expected_output": "No\n\n", "anno_code": ["\n\n\nimport math\na, b = map(int, input().split()) # (0): a=11, b=84\n\nconnected_num = int(str(a) + str(b)) # (1): connected_num=1184\nc = int(math.sqrt(connected_num)) # (2): c=34\n\nprint(connected_num) # (3): NO CHANGE\nif connected_num == c*c: # (4): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " \n \n \n import math\n a, b = map(int, input().split())\n \n connected_num = int(str(a) + str(b))\n c = int(math.sqrt(connected_num))\n \n-print(connected_num)\n if connected_num == c*c:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " \n \n \n import math\n a, b = map(int, input().split())\n \n connected_num = int(str(a) + str(b))\n c = int(math.sqrt(connected_num))\n \n-print(connected_num)\n if connected_num == c*c:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 14 }, { "user_id": "u859897687", "problem_id": "p03456", "submission1_id": "s771232409", "submission2_id": "s913507993", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print(\"NYoe s\"[int(input().replace(\" \",\"\"))**0.5%1<1::2])", "code2": "print(\"NYoe s\"[int(input().replace(\" \",\"\"))**0.5%1==0::2])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554096939", "date2": "1554097220", "bleu_score": "0.9196822664155297", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 4, "total_score": 91, "input": "001 101\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["print(\"NYoe s\"[int(input().replace(\" \",\"\"))**0.5%1<1::2])"], "anno_status": [true], "diff_content": "-print(\"NYoe s\"[int(input().replace(\" \",\"\"))**0.5%1<1::2])\n+print(\"NYoe s\"[int(input().replace(\" \",\"\"))**0.5%1==0::2])\n", "FL_content": "-print(\"NYoe s\"[int(input().replace(\" \",\"\"))**0.5%1<1::2])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u749491107", "problem_id": "p03456", "submission1_id": "s100811022", "submission2_id": "s149046724", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b = input().split()\nx = int(a+b)\nno = 0\nfor i in range(1, 101):\n if x == i**2:\n print(\"Yes\")\n else:\n no += 1\n if no == 100:\n print(\"No\")", "code2": "a, b = input().split()\nx = int(a+b)\nno = 0\nfor i in range(1000):\n if x == i**2:\n print(\"Yes\")\n else:\n no += 1\n if no == 1000:\n print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599492146", "date2": "1599492271", "bleu_score": "0.9642835556348837", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 90, "total_score": 91, "input": "000 000\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["a, b = input().split() # (0): a=000, b=000\nx = int(a+b) # (1): x=0\nno = 0 # (2): no=0\nfor i in range(1, 101): # (3): i=1 (7): i=2 ... (399): i=100\n if x == i**2: # (4): NO CHANGE (8): NO CHANGE ... (400): NO CHANGE\n print(\"Yes\")\n else:\n no += 1 # (5): no=1 (9): no=2 ... (401): no=100\n if no == 100: # (6): NO CHANGE (10): NO CHANGE ... (402): NO CHANGE\n print(\"No\") # (403): NO CHANGE\n"], "anno_status": [true], "diff_content": " a, b = input().split()\n x = int(a+b)\n no = 0\n-for i in range(1, 101):\n+for i in range(1000):\n if x == i**2:\n print(\"Yes\")\n else:\n no += 1\n- if no == 100:\n+ if no == 1000:\n print(\"No\")\n", "FL_content": " a, b = input().split()\n x = int(a+b)\n no = 0\n-for i in range(1, 101):\n if x == i**2:\n print(\"Yes\")\n else:\n no += 1\n- if no == 100:\n print(\"No\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u524489226", "problem_id": "p03456", "submission1_id": "s604712395", "submission2_id": "s262283348", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b = input().split()\nn = int(a + b)\nif n == n**0.5 * n**0.5:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "a, b = input().split()\nn = int(a + b)\nif (n**0.5).is_integer():\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567605388", "date2": "1567606029", "bleu_score": "0.8249412939088931", "code1_test_status": [1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1], "code1_test_score": 51, "total_score": 91, "input": "13 87\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["a, b = input().split() # (0): a=13, b=87\nn = int(a + b) # (1): n=1387\nif n == n**0.5 * n**0.5: # (2): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " a, b = input().split()\n n = int(a + b)\n-if n == n**0.5 * n**0.5:\n+if (n**0.5).is_integer():\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " a, b = input().split()\n n = int(a + b)\n-if n == n**0.5 * n**0.5:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u011768731", "problem_id": "p03456", "submission1_id": "s231805727", "submission2_id": "s854226690", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\na, b = map(str, input().split())\nc = a + b\nd = math.sqrt(int(c))\nif isinstance(d, int):\n print(\"Yes\")\nelse:\n print(\"No\")\n\n", "code2": "import math\n\na, b = map(str, input().split())\nc = a + b\nd = math.sqrt(int(c))\nif d % 1 == 0:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575261903", "date2": "1575262218", "bleu_score": "0.8508061771644128", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 87, "total_score": 91, "input": "000 100\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["import math\n\na, b = map(str, input().split()) # (0): a=000, b=100\nc = a + b # (1): c=000100\nd = math.sqrt(int(c)) # (2): d=10.0\nif isinstance(d, int): # (3): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")\n\n"], "anno_status": [true], "diff_content": " import math\n \n a, b = map(str, input().split())\n c = a + b\n d = math.sqrt(int(c))\n-if isinstance(d, int):\n+if d % 1 == 0:\n print(\"Yes\")\n else:\n print(\"No\")\n \n-\n", "FL_content": " import math\n \n a, b = map(str, input().split())\n c = a + b\n d = math.sqrt(int(c))\n-if isinstance(d, int):\n print(\"Yes\")\n else:\n print(\"No\")\n \n-\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 11 }, { "user_id": "u354918239", "problem_id": "p03456", "submission1_id": "s732128146", "submission2_id": "s824700840", "status1": "Wrong Answer", "status2": "Accepted", "code1": "L = []\na,b = map(str,input().split())\nL.append(a)\nL.append(b)\nc = int(L[0]+L[1])\nK = []\nfor i in range(1,101) :\n k = i**2\n K.append(k)\nif c in K :\n print(\"Yes\")\nelse :\n print(\"No\")\n \n", "code2": "L = []\na,b = map(str,input().split())\nL.append(a)\nL.append(b)\nc = int(L[0]+L[1])\nK = []\nif int(c**(1/2))**2 == c :\n print(\"Yes\")\nelse :\n print(\"No\")\n\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1533302168", "date2": "1533302673", "bleu_score": "0.7093824065505426", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 90, "total_score": 91, "input": "000 000\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["L = [] # (0): L=[]\na,b = map(str,input().split()) # (1): a=000, b=000\nL.append(a) # (2): L=['000']\nL.append(b) # (3): L=['000', '000']\nc = int(L[0]+L[1]) # (4): c=0\nK = [] # (5): K=[]\nfor i in range(1,101) : # (6): i=1 (9): i=2 ... (306): NO CHANGE\n k = i**2 # (7): k=1 (10): k=4 ... (304): k=10000\n K.append(k) # (8): K=[1] (11): K=[1, 4] ... (305): K=[1, 4, ..., 9801, 10000]\nif c in K : # (307): NO CHANGE\n print(\"Yes\")\nelse :\n print(\"No\")\n \n"], "anno_status": [true], "diff_content": " L = []\n a,b = map(str,input().split())\n L.append(a)\n L.append(b)\n c = int(L[0]+L[1])\n K = []\n-for i in range(1,101) :\n- k = i**2\n- K.append(k)\n-if c in K :\n+if int(c**(1/2))**2 == c :\n print(\"Yes\")\n else :\n print(\"No\")\n- \n \n+ \n", "FL_content": " L = []\n a,b = map(str,input().split())\n L.append(a)\n L.append(b)\n c = int(L[0]+L[1])\n K = []\n-for i in range(1,101) :\n- k = i**2\n- K.append(k)\n-if c in K :\n print(\"Yes\")\n else :\n print(\"No\")\n- \n \n", "added_lines": 2, "removed_lines": 5, "code1_lines": 15 }, { "user_id": "u131464432", "problem_id": "p03456", "submission1_id": "s387423072", "submission2_id": "s281317500", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b = input().split()\nc = a+b\nc = int(c)\nfor i in range (1,101):\n if i**2 == c:\n print(\"Yes\")\n exit()\nprint(\"No\")", "code2": "a,b = input().split()\nc = a+b\nc = int(c)\nfor i in range (1000):\n if i**2 == c:\n print(\"Yes\")\n exit()\nprint(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593176358", "date2": "1593176775", "bleu_score": "0.9576479076143465", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 90, "total_score": 91, "input": "000 000\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["a,b = input().split() # (0): a=000, b=000\nc = a+b # (1): c=000000\nc = int(c) # (2): c=0\nfor i in range (1,101): # (3): i=1 (5): i=2 ... (203): NO CHANGE\n if i**2 == c: # (4): NO CHANGE (6): NO CHANGE ... (202): NO CHANGE\n print(\"Yes\")\n exit()\nprint(\"No\")"], "anno_status": [true], "diff_content": " a,b = input().split()\n c = a+b\n c = int(c)\n-for i in range (1,101):\n+for i in range (1000):\n if i**2 == c:\n print(\"Yes\")\n exit()\n print(\"No\")\n", "FL_content": " a,b = input().split()\n c = a+b\n c = int(c)\n-for i in range (1,101):\n if i**2 == c:\n print(\"Yes\")\n exit()\n print(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u596421790", "problem_id": "p03892", "submission1_id": "s493244762", "submission2_id": "s003717735", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c,d = map(int, input().split())\n\ndef gcd(u,v):\n while v:\n u,v = v,u%v\n return u\n\ns = c-a\nt = d-b\nu = gcd(s,t)\ns \nt \nprint(u*(s+t-1))", "code2": "a,b,c,d = map(int, input().split())\ndef gcd(u,v):\n while v: u,v = v,u%v\n return u\ns = abs(c-a)\nt = abs(d-b)\nu = gcd(s,t)\nprint(u*((s+t)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580601042", "date2": "1580601250", "bleu_score": "0.8132804338996698", "code1_test_status": [1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 9, "total_score": 100, "input": "32 16 -1 6\n", "actual_output": "44\n", "expected_output": "42\n\n", "anno_code": ["a,b,c,d = map(int, input().split()) # (0): a=32, b=16, c=-1, d=6\n\ndef gcd(u,v): # (1): gcd=\n while v: # (5): NO CHANGE (7): NO CHANGE ... (11): a=32, b=16, c=-1, d=6, gcd=, s=-33, t=-10\n u,v = v,u%v # (6): u=-10, v=-3 (8): u=-3, v=-1 (10): u=-1, v=0\n return u\n\ns = c-a # (2): s=-33\nt = d-b # (3): t=-10\nu = gcd(s,t) # (4): u=-33, v=-10\ns # (12): NO CHANGE\nt # (13): NO CHANGE\nprint(u*(s+t-1))"], "anno_status": [true], "diff_content": " a,b,c,d = map(int, input().split())\n-\n def gcd(u,v):\n- while v:\n- u,v = v,u%v\n+ while v: u,v = v,u%v\n return u\n-\n-s = c-a\n-t = d-b\n+s = abs(c-a)\n+t = abs(d-b)\n u = gcd(s,t)\n-s \n-t \n-print(u*(s+t-1))\n+print(u*((s+t)\n+\n", "FL_content": " a,b,c,d = map(int, input().split())\n-\n def gcd(u,v):\n- while v:\n- u,v = v,u%v\n return u\n-\n-s = c-a\n-t = d-b\n u = gcd(s,t)\n-s \n-t \n-print(u*(s+t-1))\n", "added_lines": 5, "removed_lines": 9, "code1_lines": 13 }, { "user_id": "u781091740", "problem_id": "p03892", "submission1_id": "s037219309", "submission2_id": "s026130221", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def gcd(a,b):\n\tif b==0:return a\n\treturn gcd(b,a%b)\na,b,c,d=map(int,input().split())\nc-=a\nd-=b\ng=gcd(max(c,d),min(c,d))\nj=int(c/g)\nk=int(d/g)\nprint((j+k-1)*g)", "code2": "def gcd(a,b):\n\tif b==0:return a\n\treturn gcd(b,a%b)\na,b,c,d=map(int,input().split())\nc=abs(c-a)\nd=abs(d-b)\ng=gcd(max(c,d),min(c,d))\nj=int(c/g)\nk=int(d/g)\nprint((j+k-1)*g)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1480279282", "date2": "1480279403", "bleu_score": "0.8889759736810575", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 19, "total_score": 100, "input": "47 16 -1 5\n", "actual_output": "-58\n", "expected_output": "58\n\n", "anno_code": ["def gcd(a,b): # (0): gcd=\n\tif b==0:return a\n\treturn gcd(b,a%b)\na,b,c,d=map(int,input().split()) # (1): a=47, b=16, c=-1, d=5\nc-=a # (2): c=-48\nd-=b # (3): d=-11\ng=gcd(max(c,d),min(c,d)) # (4): g=-1\nj=int(c/g) # (5): j=48\nk=int(d/g) # (6): k=11\nprint((j+k-1)*g)"], "anno_status": [true], "diff_content": " def gcd(a,b):\n \tif b==0:return a\n \treturn gcd(b,a%b)\n a,b,c,d=map(int,input().split())\n-c-=a\n-d-=b\n+c=abs(c-a)\n+d=abs(d-b)\n g=gcd(max(c,d),min(c,d))\n j=int(c/g)\n k=int(d/g)\n print((j+k-1)*g)\n", "FL_content": " def gcd(a,b):\n \tif b==0:return a\n \treturn gcd(b,a%b)\n a,b,c,d=map(int,input().split())\n-c-=a\n-d-=b\n g=gcd(max(c,d),min(c,d))\n j=int(c/g)\n k=int(d/g)\n print((j+k-1)*g)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u760794812", "problem_id": "p03712", "submission1_id": "s958152825", "submission2_id": "s258566992", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H,W = map(int,input().split())\nList = []\nfor _ in range(H):\n S = input()\n List.append(S)\nprint('*'*(W+2))\nfor i in range(H):\n print('*'.strip(),end='')\n print(List[i].strip(),end='')\n print('*')\nprint('*'*(W+2))", "code2": "H,W = map(int,input().split())\nList = []\nfor _ in range(H):\n S = input()\n List.append(S)\nprint('\nfor i in range(H):\n print('\n print(List[i].strip(),end='')\n print('\nprint('", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573045275", "date2": "1573045399", "bleu_score": "0.781424803667964", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "2 6\nbc`\ncqa\n", "actual_output": "********\n*bc`*\n*cqa*\n********\n", "expected_output": "########\n#bc`#\n#cqa#\n########\n\n", "anno_code": ["H,W = map(int,input().split()) # (0): H=2, W=6\nList = [] # (1): List=[]\nfor _ in range(H): # (2): _=0 (5): _=1 (8): NO CHANGE\n S = input() # (3): S=bc` (6): S=cqa\n List.append(S) # (4): List=['bc`'] (7): List=['bc`', 'cqa']\nprint('*'*(W+2)) # (9): NO CHANGE\nfor i in range(H): # (10): i=0 (14): i=1 (18): NO CHANGE\n print('*'.strip(),end='') # (11): NO CHANGE (15): NO CHANGE\n print(List[i].strip(),end='') # (12): NO CHANGE (16): NO CHANGE\n print('*') # (13): NO CHANGE (17): NO CHANGE\nprint('*'*(W+2))"], "anno_status": [true], "diff_content": " H,W = map(int,input().split())\n List = []\n for _ in range(H):\n S = input()\n List.append(S)\n-print('*'*(W+2))\n+print('\n for i in range(H):\n- print('*'.strip(),end='')\n+ print('\n print(List[i].strip(),end='')\n- print('*')\n-print('*'*(W+2))\n+ print('\n+print('\n", "FL_content": " H,W = map(int,input().split())\n List = []\n for _ in range(H):\n S = input()\n List.append(S)\n-print('*'*(W+2))\n for i in range(H):\n- print('*'.strip(),end='')\n print(List[i].strip(),end='')\n- print('*')\n-print('*'*(W+2))\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 11 }, { "user_id": "u874741582", "problem_id": "p03712", "submission1_id": "s888979543", "submission2_id": "s559420197", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w = map(int,input().split())\nl=[str(input()) for i in range(h)]\np=\"*\"\nprint(p*(w+2))\nfor j in l:\n print(p+j+p)\nprint(p*(w+2))", "code2": "h,w = map(int,input().split())\nl=[str(input()) for i in range(h)]\np=\"\nprint(p*(w+2))\nfor j in l:\n print(p+j+p)\nprint(p*(w+2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565657700", "date2": "1565657869", "bleu_score": "0.9785832780534472", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "2 0\nfba\nbrc\n", "actual_output": "**\n*fba*\n*brc*\n**\n", "expected_output": "##\n#fba#\n#brc#\n##\n\n", "anno_code": ["h,w = map(int,input().split()) # (0): h=2, w=0\nl=[str(input()) for i in range(h)] # (1): l=['fba', 'brc']\np=\"*\" # (2): p=*\nprint(p*(w+2)) # (3): NO CHANGE\nfor j in l: # (4): j=fba (6): j=brc (8): NO CHANGE\n print(p+j+p) # (5): NO CHANGE (7): NO CHANGE\nprint(p*(w+2))"], "anno_status": [true], "diff_content": " h,w = map(int,input().split())\n l=[str(input()) for i in range(h)]\n-p=\"*\"\n+p=\"\n print(p*(w+2))\n for j in l:\n print(p+j+p)\n print(p*(w+2))\n", "FL_content": " h,w = map(int,input().split())\n l=[str(input()) for i in range(h)]\n-p=\"*\"\n print(p*(w+2))\n for j in l:\n print(p+j+p)\n print(p*(w+2))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u529518602", "problem_id": "p03712", "submission1_id": "s814044929", "submission2_id": "s113170128", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h, m = map(int, input().split())\nC = [input() for i in range(h)]\n\nhana = '*' * (m + 2)\nprint(hana)\nfor i in range(h):\n print('*' + C[i] + '*')\nprint(hana)\n", "code2": "h, m = map(int, input().split())\nC = [input() for i in range(h)]\n\nhana = '\nprint(hana)\nfor i in range(h):\n print('\nprint(hana)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1548541510", "date2": "1548541580", "bleu_score": "0.7871572393471534", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "2 0\nfba\nbrc\n", "actual_output": "**\n*fba*\n*brc*\n**\n", "expected_output": "##\n#fba#\n#brc#\n##\n\n", "anno_code": ["h, m = map(int, input().split()) # (0): h=2, m=0\nC = [input() for i in range(h)] # (1): C=['fba', 'brc']\n\nhana = '*' * (m + 2) # (2): hana=**\nprint(hana) # (3): NO CHANGE\nfor i in range(h): # (4): i=0 (6): i=1 (8): NO CHANGE\n print('*' + C[i] + '*') # (5): NO CHANGE (7): NO CHANGE\nprint(hana)\n"], "anno_status": [true], "diff_content": " h, m = map(int, input().split())\n C = [input() for i in range(h)]\n \n-hana = '*' * (m + 2)\n+hana = '\n print(hana)\n for i in range(h):\n- print('*' + C[i] + '*')\n+ print('\n print(hana)\n \n", "FL_content": " h, m = map(int, input().split())\n C = [input() for i in range(h)]\n \n-hana = '*' * (m + 2)\n print(hana)\n for i in range(h):\n- print('*' + C[i] + '*')\n print(hana)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u252828980", "problem_id": "p03712", "submission1_id": "s834994240", "submission2_id": "s558848770", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m = map(int,input().split())\nL = []\nL.append(\"*\"*(m+2))\nfor i in range(n):\n L.append(\"*\"+input()+\"*\")\nL.append(\"*\"*(m+2))\nfor i in range(len(L)):\n print(L[i])\n", "code2": "n,m = map(int,input().split())\nL = []\nL.append(\"\nfor i in range(n):\n L.append(\"\nL.append(\"\nfor i in range(len(L)):\n print(L[i])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579028446", "date2": "1579028594", "bleu_score": "0.7474832739233186", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "1 3\ny\n", "actual_output": "*****\n*y*\n*****\n", "expected_output": "#####\n#y#\n#####\n\n", "anno_code": ["n,m = map(int,input().split()) # (0): n=1, m=3\nL = [] # (1): L=[]\nL.append(\"*\"*(m+2)) # (2): L=['*****']\nfor i in range(n): # (3): i=0 (5): NO CHANGE\n L.append(\"*\"+input()+\"*\") # (4): L=['*****', '*y*']\nL.append(\"*\"*(m+2)) # (6): L=['*****', '*y*', '*****']\nfor i in range(len(L)): # (7): NO CHANGE (9): i=1 (11): i=2\n print(L[i]) # (8): NO CHANGE (10): NO CHANGE (12): NO CHANGE\n"], "anno_status": [true], "diff_content": " n,m = map(int,input().split())\n L = []\n-L.append(\"*\"*(m+2))\n+L.append(\"\n for i in range(n):\n- L.append(\"*\"+input()+\"*\")\n-L.append(\"*\"*(m+2))\n+ L.append(\"\n+L.append(\"\n for i in range(len(L)):\n print(L[i])\n-\n", "FL_content": " n,m = map(int,input().split())\n L = []\n-L.append(\"*\"*(m+2))\n for i in range(n):\n- L.append(\"*\"+input()+\"*\")\n-L.append(\"*\"*(m+2))\n for i in range(len(L)):\n print(L[i])\n-\n", "added_lines": 3, "removed_lines": 4, "code1_lines": 9 }, { "user_id": "u796563423", "problem_id": "p03712", "submission1_id": "s954662102", "submission2_id": "s312032080", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b=map(int,input().split())\ns=[]\nfor i in range(a):\n s.append(input())\nprint(\"*\"*(b+2))\nfor i in range(a):\n print(\"*\",end=\"\")\n print(s[i],end=\"\")\n print(\"*\")\nprint(\"*\"*(b+2))", "code2": "a,b=map(int,input().split())\ns=[]\nfor i in range(a):\n s.append(input())\nprint(\"\nfor i in range(a):\n print(\"\n print(s[i],end=\"\")\n print(\"\nprint(\"", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599801312", "date2": "1599801349", "bleu_score": "0.7955708789074227", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "1 3\nw\n", "actual_output": "*****\n*w*\n*****\n", "expected_output": "#####\n#w#\n#####\n\n", "anno_code": ["a,b=map(int,input().split()) # (0): a=1, b=3\ns=[] # (1): s=[]\nfor i in range(a): # (2): i=0 (4): NO CHANGE\n s.append(input()) # (3): s=['w']\nprint(\"*\"*(b+2)) # (5): NO CHANGE\nfor i in range(a): # (6): NO CHANGE (10): NO CHANGE\n print(\"*\",end=\"\") # (7): NO CHANGE\n print(s[i],end=\"\") # (8): NO CHANGE\n print(\"*\") # (9): NO CHANGE\nprint(\"*\"*(b+2))"], "anno_status": [true], "diff_content": " a,b=map(int,input().split())\n s=[]\n for i in range(a):\n s.append(input())\n-print(\"*\"*(b+2))\n+print(\"\n for i in range(a):\n- print(\"*\",end=\"\")\n+ print(\"\n print(s[i],end=\"\")\n- print(\"*\")\n-print(\"*\"*(b+2))\n+ print(\"\n+print(\"\n", "FL_content": " a,b=map(int,input().split())\n s=[]\n for i in range(a):\n s.append(input())\n-print(\"*\"*(b+2))\n for i in range(a):\n- print(\"*\",end=\"\")\n print(s[i],end=\"\")\n- print(\"*\")\n-print(\"*\"*(b+2))\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 10 }, { "user_id": "u215065194", "problem_id": "p03712", "submission1_id": "s449841700", "submission2_id": "s285875318", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w=map(int, input().split())\nar=[input() for _ in range(0,h)]\nprint(\"*\"*w+\"**\")\nfor _ in ar:\n print(\"*\"+_+\"*\")\nprint(\"*\"*w+\"**\")\n ", "code2": "h,w=map(int, input().split())\nar=[input() for _ in range(0,h)]\nprint(\"\nfor _ in ar:\n print(\"\nprint(\"\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1533777123", "date2": "1533777223", "bleu_score": "0.7226068467623483", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "1 3\n{\n", "actual_output": "*****\n*{*\n*****\n", "expected_output": "#####\n#{#\n#####\n\n", "anno_code": ["h,w=map(int, input().split()) # (0): h=1, w=3\nar=[input() for _ in range(0,h)] # (1): ar=['{']\nprint(\"*\"*w+\"**\") # (2): NO CHANGE\nfor _ in ar: # (3): _={ (5): NO CHANGE\n print(\"*\"+_+\"*\") # (4): NO CHANGE\nprint(\"*\"*w+\"**\")\n "], "anno_status": [true], "diff_content": " h,w=map(int, input().split())\n ar=[input() for _ in range(0,h)]\n-print(\"*\"*w+\"**\")\n+print(\"\n for _ in ar:\n- print(\"*\"+_+\"*\")\n-print(\"*\"*w+\"**\")\n- \n+ print(\"\n+print(\"\n+ \n", "FL_content": " h,w=map(int, input().split())\n ar=[input() for _ in range(0,h)]\n-print(\"*\"*w+\"**\")\n for _ in ar:\n- print(\"*\"+_+\"*\")\n-print(\"*\"*w+\"**\")\n- \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 7 }, { "user_id": "u215065194", "problem_id": "p03712", "submission1_id": "s824404286", "submission2_id": "s285875318", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w=map(int, input().split())\nprint(\"*\"*w+\"**\")\nfor i in range(0, h):\n print(\"*\"+input()+\"*\")\nprint(\"*\"*w+\"**\")\n ", "code2": "h,w=map(int, input().split())\nar=[input() for _ in range(0,h)]\nprint(\"\nfor _ in ar:\n print(\"\nprint(\"\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1533776866", "date2": "1533777223", "bleu_score": "0.6420921106679712", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "1 -1\n{\n", "actual_output": "**\n*{*\n**\n", "expected_output": "#\n#{#\n#\n\n", "anno_code": ["h,w=map(int, input().split()) # (0): h=1, w=-1\nprint(\"*\"*w+\"**\") # (1): NO CHANGE\nfor i in range(0, h): # (2): i=0 (4): NO CHANGE\n print(\"*\"+input()+\"*\") # (3): NO CHANGE\nprint(\"*\"*w+\"**\")\n "], "anno_status": [true], "diff_content": " h,w=map(int, input().split())\n-print(\"*\"*w+\"**\")\n-for i in range(0, h):\n- print(\"*\"+input()+\"*\")\n-print(\"*\"*w+\"**\")\n- \n+ar=[input() for _ in range(0,h)]\n+print(\"\n+for _ in ar:\n+ print(\"\n+print(\"\n+ \n", "FL_content": " h,w=map(int, input().split())\n-print(\"*\"*w+\"**\")\n-for i in range(0, h):\n- print(\"*\"+input()+\"*\")\n-print(\"*\"*w+\"**\")\n- \n", "added_lines": 6, "removed_lines": 5, "code1_lines": 6 }, { "user_id": "u588081069", "problem_id": "p03712", "submission1_id": "s493113139", "submission2_id": "s563528329", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, W = list(map(int, input().split()))\n\nfor i in range(H + 2):\n if i == 0 or i == (H + 1):\n print(\"*\" * (W + 2))\n else:\n print(\"*{}*\".format(\"\".join(list(map(str, input())))))\n", "code2": "H, W = list(map(int, input().split()))\n\nfor i in range(H + 2):\n if i == 0 or i == (H + 1):\n print(\"\n else:\n print(\"\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553887428", "date2": "1553887460", "bleu_score": "0.6324192823925385", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "-5 10\nw\n", "actual_output": "no output\n", "expected_output": "############\n############\n\n", "anno_code": ["H, W = list(map(int, input().split())) # (0): H=-5, W=10\n\nfor i in range(H + 2):\n if i == 0 or i == (H + 1):\n print(\"*\" * (W + 2))\n else:\n print(\"*{}*\".format(\"\".join(list(map(str, input())))))\n"], "anno_status": [true], "diff_content": " H, W = list(map(int, input().split()))\n \n for i in range(H + 2):\n if i == 0 or i == (H + 1):\n- print(\"*\" * (W + 2))\n+ print(\"\n else:\n- print(\"*{}*\".format(\"\".join(list(map(str, input())))))\n+ print(\"\n \n", "FL_content": " H, W = list(map(int, input().split()))\n \n for i in range(H + 2):\n if i == 0 or i == (H + 1):\n- print(\"*\" * (W + 2))\n else:\n- print(\"*{}*\".format(\"\".join(list(map(str, input())))))\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u374531474", "problem_id": "p03712", "submission1_id": "s124991830", "submission2_id": "s630747545", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, W = map(int, input().split())\na = [input() for i in range(H)]\n\nprint('*' * (W + 2))\nfor ai in a:\n print('*{}*'.format(ai))\nprint('*' * (W + 2))\n", "code2": "H, W = map(int, input().split())\na = [input() for i in range(H)]\n\nprint('\nfor ai in a:\n print('\nprint('\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1556220825", "date2": "1556220928", "bleu_score": "0.6448972955625993", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "1 4\n|\n", "actual_output": "******\n*|*\n******\n", "expected_output": "######\n#|#\n######\n\n", "anno_code": ["H, W = map(int, input().split()) # (0): H=1, W=4\na = [input() for i in range(H)] # (1): a=['|']\n\nprint('*' * (W + 2)) # (2): NO CHANGE\nfor ai in a: # (3): ai=| (5): NO CHANGE\n print('*{}*'.format(ai)) # (4): NO CHANGE\nprint('*' * (W + 2))\n"], "anno_status": [true], "diff_content": " H, W = map(int, input().split())\n a = [input() for i in range(H)]\n \n-print('*' * (W + 2))\n+print('\n for ai in a:\n- print('*{}*'.format(ai))\n-print('*' * (W + 2))\n+ print('\n+print('\n \n", "FL_content": " H, W = map(int, input().split())\n a = [input() for i in range(H)]\n \n-print('*' * (W + 2))\n for ai in a:\n- print('*{}*'.format(ai))\n-print('*' * (W + 2))\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u887207211", "problem_id": "p03712", "submission1_id": "s215868105", "submission2_id": "s805083979", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, W = map(int,input().split())\nA = [input() for _ in range(H)]\n\nresult = []\nfor a in A:\n result.append('*' + a +'*')\nwaku = '*' * (W+2)\nresult.insert(0,waku)\nresult.insert(len(A)+1,waku)\nfor r in result:\n print(r)", "code2": "H, W = map(int,input().split())\nA = [input() for _ in range(H)]\n\nresult = []\nfor a in A:\n result.append('\nwaku = '\nresult.insert(0,waku)\nresult.insert(len(A)+1,waku)\nfor r in result:\n print(r)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1545366567", "date2": "1545366681", "bleu_score": "0.8808053425582472", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "1 2\nx\n", "actual_output": "****\n*x*\n****\n", "expected_output": "####\n#x#\n####\n\n", "anno_code": ["H, W = map(int,input().split()) # (0): H=1, W=2\nA = [input() for _ in range(H)] # (1): A=['x']\n\nresult = [] # (2): result=[]\nfor a in A: # (3): a=x (5): NO CHANGE\n result.append('*' + a +'*') # (4): result=['*x*']\nwaku = '*' * (W+2) # (6): waku=****\nresult.insert(0,waku) # (7): result=['****', '*x*']\nresult.insert(len(A)+1,waku) # (8): result=['****', '*x*', '****']\nfor r in result: # (9): r=**** (11): r=*x* (13): r=****\n print(r) # (10): NO CHANGE (12): NO CHANGE (14): NO CHANGE\n"], "anno_status": [true], "diff_content": " H, W = map(int,input().split())\n A = [input() for _ in range(H)]\n \n result = []\n for a in A:\n- result.append('*' + a +'*')\n-waku = '*' * (W+2)\n+ result.append('\n+waku = '\n result.insert(0,waku)\n result.insert(len(A)+1,waku)\n for r in result:\n print(r)\n+\n+\n", "FL_content": " H, W = map(int,input().split())\n A = [input() for _ in range(H)]\n \n result = []\n for a in A:\n- result.append('*' + a +'*')\n-waku = '*' * (W+2)\n result.insert(0,waku)\n result.insert(len(A)+1,waku)\n for r in result:\n print(r)\n", "added_lines": 4, "removed_lines": 2, "code1_lines": 11 }, { "user_id": "u425351967", "problem_id": "p03643", "submission1_id": "s670667142", "submission2_id": "s559387461", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print(\"ABC\", input())", "code2": "print(\"ABC\"+ input())", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1506522756", "date2": "1506522801", "bleu_score": "0.8656030552541708", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "-75\n", "actual_output": "ABC -75\n", "expected_output": "ABC-75\n\n", "anno_code": ["print(\"ABC\", input())"], "anno_status": [true], "diff_content": "-print(\"ABC\", input())\n+print(\"ABC\"+ input())\n", "FL_content": "-print(\"ABC\", input())\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u175590965", "problem_id": "p03643", "submission1_id": "s025345866", "submission2_id": "s315680561", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = input()\nprint(\"ABC\"+\"a\")", "code2": "a = input()\nprint(\"ABC\"+a)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569548660", "date2": "1569548705", "bleu_score": "0.8673920022828956", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "403\n", "actual_output": "ABCa\n", "expected_output": "ABC403\n\n", "anno_code": ["a = input() # (0): a=403\nprint(\"ABC\"+\"a\")"], "anno_status": [true], "diff_content": " a = input()\n-print(\"ABC\"+\"a\")\n+print(\"ABC\"+a)\n", "FL_content": " a = input()\n-print(\"ABC\"+\"a\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u591717585", "problem_id": "p03643", "submission1_id": "s070466637", "submission2_id": "s710873673", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print(\"ABC\",input())", "code2": "print(\"ABC\"+input())", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571370854", "date2": "1571370872", "bleu_score": "0.8578928092681435", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "-84\n", "actual_output": "ABC -84\n", "expected_output": "ABC-84\n\n", "anno_code": ["print(\"ABC\",input())"], "anno_status": [true], "diff_content": "-print(\"ABC\",input())\n+print(\"ABC\"+input())\n", "FL_content": "-print(\"ABC\",input())\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u366959492", "problem_id": "p03643", "submission1_id": "s983613509", "submission2_id": "s034829564", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=str(input())\nprint(\"ABC\",n)", "code2": "n=input()\nprint(\"ABC\"+n)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553189858", "date2": "1553190106", "bleu_score": "0.650412536552969", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "-41\n", "actual_output": "ABC -41\n", "expected_output": "ABC-41\n\n", "anno_code": ["n=str(input()) # (0): n=-41\nprint(\"ABC\",n)"], "anno_status": [true], "diff_content": "-n=str(input())\n-print(\"ABC\",n)\n+n=input()\n+print(\"ABC\"+n)\n+\n", "FL_content": "-n=str(input())\n-print(\"ABC\",n)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 2 }, { "user_id": "u785066634", "problem_id": "p03643", "submission1_id": "s974172348", "submission2_id": "s778399725", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=input()\nprint ('ABC',n)", "code2": "n=str(input())\nprint ('ABC'+n)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580433885", "date2": "1580434114", "bleu_score": "0.6648633862444917", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "542\n", "actual_output": "ABC 542\n", "expected_output": "ABC542\n\n", "anno_code": ["n=input() # (0): n=542\nprint ('ABC',n)"], "anno_status": [true], "diff_content": "-n=input()\n-print ('ABC',n)\n+n=str(input())\n+print ('ABC'+n)\n", "FL_content": "-n=input()\n-print ('ABC',n)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 2 }, { "user_id": "u595952233", "problem_id": "p03643", "submission1_id": "s656824911", "submission2_id": "s718854995", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print('ABC'.format(int(input())))", "code2": "print('ABC{}'.format(input()))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594488695", "date2": "1594488734", "bleu_score": "0.7911368526486684", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "-111\n", "actual_output": "ABC\n", "expected_output": "ABC-111\n\n", "anno_code": ["print('ABC'.format(int(input())))"], "anno_status": [true], "diff_content": "-print('ABC'.format(int(input())))\n+print('ABC{}'.format(input()))\n", "FL_content": "-print('ABC'.format(int(input())))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u507116804", "problem_id": "p03643", "submission1_id": "s708651774", "submission2_id": "s699641004", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=input()\n\nprint(\"ABC\"+\"n\")", "code2": "n=input()\n\nprint(\"ABC\"+n)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1557103350", "date2": "1557103494", "bleu_score": "0.8621523069320519", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "186\n", "actual_output": "ABCn\n", "expected_output": "ABC186\n\n", "anno_code": ["n=input() # (0): n=186\n\nprint(\"ABC\"+\"n\")"], "anno_status": [true], "diff_content": " n=input()\n \n-print(\"ABC\"+\"n\")\n+print(\"ABC\"+n)\n", "FL_content": " n=input()\n \n-print(\"ABC\"+\"n\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u133038626", "problem_id": "p03643", "submission1_id": "s429929886", "submission2_id": "s881624034", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\"ABC\"+input()", "code2": "print(\"ABC\"+input())", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1550032028", "date2": "1550032103", "bleu_score": "0.6198021310128995", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "186\n", "actual_output": "no output\n", "expected_output": "ABC186\n\n", "anno_code": ["\"ABC\"+input()"], "anno_status": [true], "diff_content": "-\"ABC\"+input()\n+print(\"ABC\"+input())\n", "FL_content": "-\"ABC\"+input()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u507116804", "problem_id": "p03643", "submission1_id": "s882501966", "submission2_id": "s699641004", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\n\nprint(\"ABC\"+\"n\")", "code2": "n=input()\n\nprint(\"ABC\"+n)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1557103394", "date2": "1557103494", "bleu_score": "0.6695492145338402", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "542\n", "actual_output": "ABCn\n", "expected_output": "ABC542\n\n", "anno_code": ["n=int(input()) # (0): n=542\n\nprint(\"ABC\"+\"n\")"], "anno_status": [true], "diff_content": "-n=int(input())\n+n=input()\n \n-print(\"ABC\"+\"n\")\n+print(\"ABC\"+n)\n", "FL_content": "-n=int(input())\n \n-print(\"ABC\"+\"n\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 3 }, { "user_id": "u724742135", "problem_id": "p03643", "submission1_id": "s117886838", "submission2_id": "s062019291", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\nn = stdin.readline().rstrip()\nprint('A'+n)", "code2": "from sys import stdin\nn = stdin.readline().rstrip()\nprint('ABC'+n)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1551838877", "date2": "1551838904", "bleu_score": "0.9452425713908253", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "789\n", "actual_output": "A789\n", "expected_output": "ABC789\n\n", "anno_code": ["from sys import stdin\nn = stdin.readline().rstrip() # (0): n=789\nprint('A'+n)"], "anno_status": [true], "diff_content": " from sys import stdin\n n = stdin.readline().rstrip()\n-print('A'+n)\n+print('ABC'+n)\n", "FL_content": " from sys import stdin\n n = stdin.readline().rstrip()\n-print('A'+n)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u659302741", "problem_id": "p02419", "submission1_id": "s074613101", "submission2_id": "s798660664", "status1": "Wrong Answer", "status2": "Accepted", "code1": "word = input().lower()\ncount = 0\nwhile True:\n line = input()\n if line == \"END_OF_TEXT\":\n break\n print(line.lower())\n words = line.lower().split()\n for w in words:\n if w == word:\n count += 1\nprint(count)", "code2": "word = input().lower()\ncount = 0\nwhile True:\n line = input()\n if line == \"END_OF_TEXT\":\n break\n words = line.lower().split()\n for w in words:\n if w == word:\n count += 1\nprint(count)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1477751765", "date2": "1477751805", "bleu_score": "0.8957519524485242", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "comquter\nNurttres computer scienuists and highlx-skilled computer engineers\nwhp will create and tiolpxe \"knowledge\" for the enw dr.a\nProvider an sutotanding ctmpuoer environment.\nEND_OF_TEXT\n", "actual_output": "nurttres computer scienuists and highlx-skilled computer engineers\nwhp will create and tiolpxe \"knowledge\" for the enw dr.a\nprovider an sutotanding ctmpuoer environment.\n0\n", "expected_output": "0\n\n", "anno_code": ["word = input().lower() # (0): word=comquter\ncount = 0 # (1): count=0\nwhile True: # (2): NO CHANGE (22): NO CHANGE ... (64): NO CHANGE\n line = input() # (3): line=Nurttres computer scienuists and highlx-skilled computer engineers (23): line=whp will create and tiolpxe \"knowledge\" for the enw dr.a ... (65): line=END_OF_TEXT\n if line == \"END_OF_TEXT\": # (4): NO CHANGE (24): NO CHANGE ... (66): NO CHANGE\n break # (67): NO CHANGE\n print(line.lower()) # (5): NO CHANGE (25): NO CHANGE (51): NO CHANGE\n words = line.lower().split() # (6): words=['nurttres', 'computer', 'scienuists', 'and', 'highlx-skilled', 'computer', 'engineers'] (26): words=['whp', 'will', 'create', 'and', 'tiolpxe', '\"knowledge\"', 'for', 'the', 'enw', 'dr.a'] (52): words=['provider', 'an', 'sutotanding', 'ctmpuoer', 'environment.']\n for w in words: # (7): w=nurttres (9): w=computer ... (63): NO CHANGE\n if w == word: # (8): NO CHANGE (10): NO CHANGE ... (62): NO CHANGE\n count += 1\nprint(count)"], "anno_status": [true], "diff_content": " word = input().lower()\n count = 0\n while True:\n line = input()\n if line == \"END_OF_TEXT\":\n break\n- print(line.lower())\n words = line.lower().split()\n for w in words:\n if w == word:\n count += 1\n print(count)\n", "FL_content": " word = input().lower()\n count = 0\n while True:\n line = input()\n if line == \"END_OF_TEXT\":\n break\n- print(line.lower())\n words = line.lower().split()\n for w in words:\n if w == word:\n count += 1\n print(count)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u663910047", "problem_id": "p02419", "submission1_id": "s620557338", "submission2_id": "s197377905", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = 0\nT=\"\"\ns= input()\nwhile True:\n t=input()\n T += t + \" \"\n if T.count(\"END_OF_TEXT\")>0:\n break\n\nTL = T.split(\" \")\nprint (TL)\nfor i in TL:\n if i == str(s):\n n +=1\n else:\n pass\nprint (n)\n ", "code2": "n = 0\nT=\"\"\ns= input().lower()\nwhile True:\n t=input()\n T += t + \" \"\n if T.count(\"END_OF_TEXT\")>0:\n break\n\nTL = T.split(\" \")\n\nfor i in TL:\n i = i.replace('\"','')\n i= i.replace(\".\",\"\")\n if i.lower() == str(s):\n n += 1\n else:\n pass\nprint (n)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1500270875", "date2": "1500272620", "bleu_score": "0.7714844981419642", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "comquter\nNurtures computer scientists and highly-skilked computer engineers\nwho wilk create and tiolpxe \"knowledge\" for the enw era.\nProvides an sutotanding computer environment.\nEND_OF_TEXT\n", "actual_output": "['Nurtures', 'computer', 'scientists', 'and', 'highly-skilked', 'computer', 'engineers', 'who', 'wilk', 'create', 'and', 'tiolpxe', '\"knowledge\"', 'for', 'the', 'enw', 'era.', 'Provides', 'an', 'sutotanding', 'computer', 'environment.', 'END_OF_TEXT', '']\n0\n", "expected_output": "0\n\n", "anno_code": ["n = 0 # (0): n=0\nT=\"\" # (1): T=\ns= input() # (2): s=comquter\nwhile True: # (3): NO CHANGE (7): NO CHANGE ... (15): NO CHANGE\n t=input() # (4): t=Nurtures computer scientists and highly-skilked computer engineers (8): t=who wilk create and tiolpxe \"knowledge\" for the enw era. ... (16): t=END_OF_TEXT\n T += t + \" \" # (5): T=Nurtures computer scientists and highly-skilked computer engineers (9): T=Nurtures computer scientists and highly-skilked computer engineers who wilk create and tiolpxe \"knowledge\" for the enw era. ... (17): T=Nurtures computer scientists and highly-skilked computer engineers who wilk create and tiolpxe \"knowledge\" for the enw era. Provides an sutotanding computer environment. END_OF_TEXT \n if T.count(\"END_OF_TEXT\")>0: # (6): NO CHANGE (10): NO CHANGE ... (18): NO CHANGE\n break # (19): NO CHANGE\n\nTL = T.split(\" \") # (20): TL=[Nurtures, computer, ..., END_OF_TEXT, ]\nprint (TL) # (21): NO CHANGE\nfor i in TL: # (22): i=Nurtures (25): i=computer ... (94): NO CHANGE\n if i == str(s): # (23): NO CHANGE (26): NO CHANGE ... (92): NO CHANGE\n n +=1\n else:\n pass # (24): NO CHANGE (27): NO CHANGE ... (93): NO CHANGE\nprint (n)\n "], "anno_status": [true], "diff_content": " n = 0\n T=\"\"\n-s= input()\n+s= input().lower()\n while True:\n t=input()\n T += t + \" \"\n if T.count(\"END_OF_TEXT\")>0:\n break\n \n TL = T.split(\" \")\n-print (TL)\n+\n for i in TL:\n- if i == str(s):\n- n +=1\n+ i = i.replace('\"','')\n+ i= i.replace(\".\",\"\")\n+ if i.lower() == str(s):\n+ n += 1\n else:\n pass\n print (n)\n- \n", "FL_content": " n = 0\n T=\"\"\n-s= input()\n while True:\n t=input()\n T += t + \" \"\n if T.count(\"END_OF_TEXT\")>0:\n break\n \n TL = T.split(\" \")\n-print (TL)\n for i in TL:\n- if i == str(s):\n- n +=1\n else:\n pass\n print (n)\n- \n", "added_lines": 6, "removed_lines": 5, "code1_lines": 18 }, { "user_id": "u283452598", "problem_id": "p02419", "submission1_id": "s770809499", "submission2_id": "s826818615", "status1": "Wrong Answer", "status2": "Accepted", "code1": "y = input().lower()\ncnt = 0\ns=\"\"\nwhile True:\n x = input().lower()\n if x == \"end_of_text\":\n break\n s += x\n for i in x:\n if i == y:\n cnt += 1\nprint(cnt)", "code2": "W = input()\nnum = 0\nwhile True:\n line = input()\n if line == 'END_OF_TEXT':\n break\n for word in line.split():\n if word.lower() == W.lower():\n num += 1\nprint(num)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1503198218", "date2": "1503198738", "bleu_score": "0.643724456431627", "code1_test_status": [0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0], "code1_test_score": 79, "total_score": 101, "input": "computer\nNurtures computer scientists dna highly-skilled comqutes engineers\nwho will create and exqloit \"knowledge\" for the enw era.\nProvides an outstanding computer environment.\nEND_OF_TEXT\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["y = input().lower() # (0): y=computer\ncnt = 0 # (1): cnt=0\ns=\"\" # (2): s=\nwhile True: # (3): NO CHANGE (140): NO CHANGE ... (352): NO CHANGE\n x = input().lower() # (4): x=nurtures computer scientists dna highly-skilled comqutes engineers (141): x=who will create and exqloit \"knowledge\" for the enw era. ... (353): x=end_of_text\n if x == \"end_of_text\": # (5): NO CHANGE (142): NO CHANGE ... (354): NO CHANGE\n break # (355): NO CHANGE\n s += x # (6): s=nurtures computer scientists dna highly-skilled comqutes engineers (143): s=nurtures computer scientists dna highly-skilled comqutes engineerswho will create and exqloit \"knowledge\" for the enw era. (260): s=nurtures computer scientists dna highly-skilled comqutes engineerswho will create and exqloit \"knowledge\" for the enw era.provides an outstanding computer environment.\n for i in x: # (7): i=n (9): i=u ... (351): NO CHANGE\n if i == y: # (8): NO CHANGE (10): NO CHANGE ... (350): NO CHANGE\n cnt += 1\nprint(cnt)"], "anno_status": [true], "diff_content": "-y = input().lower()\n-cnt = 0\n-s=\"\"\n+W = input()\n+num = 0\n while True:\n- x = input().lower()\n- if x == \"end_of_text\":\n+ line = input()\n+ if line == 'END_OF_TEXT':\n break\n- s += x\n- for i in x:\n- if i == y:\n- cnt += 1\n-print(cnt)\n+ for word in line.split():\n+ if word.lower() == W.lower():\n+ num += 1\n+print(num)\n", "FL_content": "-y = input().lower()\n-cnt = 0\n-s=\"\"\n while True:\n- x = input().lower()\n- if x == \"end_of_text\":\n break\n- s += x\n- for i in x:\n- if i == y:\n- cnt += 1\n-print(cnt)\n", "added_lines": 8, "removed_lines": 10, "code1_lines": 12 }, { "user_id": "u239721772", "problem_id": "p02419", "submission1_id": "s898936241", "submission2_id": "s358129480", "status1": "Wrong Answer", "status2": "Accepted", "code1": "W = input()\ncount = 0\nT = input().upper()\n\nwhile T != 'END_OF_TEXT':\n for i in T.split():\n if i == W:\n count += 1\n T = input().upper()\n \n\nprint(count)", "code2": "W = input()\ncount = 0\n\n\n\nwhile True:\n T = input()\n if T == 'END_OF_TEXT':\n break\n\n for i in T.lower().split():\n if W == i:\n count += 1\n \n \n\nprint(count)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1463719781", "date2": "1463720166", "bleu_score": "0.7611430284081714", "code1_test_status": [0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0], "code1_test_score": 79, "total_score": 101, "input": "computer\nserutruN computer rcientists and highly-skilled computer engineers\nwho will create and exploit \"knowledge\" for the new era-\nProvides n` outstanding computer environment.\nEND_OF_TEXT\n", "actual_output": "0\n", "expected_output": "3\n\n", "anno_code": ["W = input() # (0): W=computer\ncount = 0 # (1): count=0\nT = input().upper() # (2): T=SERUTRUN COMPUTER RCIENTISTS AND HIGHLY-SKILLED COMPUTER ENGINEERS\n\nwhile T != 'END_OF_TEXT': # (3): NO CHANGE (20): NO CHANGE ... (56): NO CHANGE\n for i in T.split(): # (4): i=SERUTRUN (6): i=COMPUTER ... (54): NO CHANGE\n if i == W: # (5): NO CHANGE (7): NO CHANGE ... (53): NO CHANGE\n count += 1\n T = input().upper() # (19): T=WHO WILL CREATE AND EXPLOIT \"KNOWLEDGE\" FOR THE NEW ERA- (42): T=PROVIDES N` OUTSTANDING COMPUTER ENVIRONMENT. (55): T=END_OF_TEXT\n \n\nprint(count)"], "anno_status": [true], "diff_content": " W = input()\n count = 0\n-T = input().upper()\n \n-while T != 'END_OF_TEXT':\n- for i in T.split():\n- if i == W:\n+\n+\n+while True:\n+ T = input()\n+ if T == 'END_OF_TEXT':\n+ break\n+\n+ for i in T.lower().split():\n+ if W == i:\n count += 1\n- T = input().upper()\n+ \n \n \n print(count)\n", "FL_content": " W = input()\n count = 0\n-T = input().upper()\n \n-while T != 'END_OF_TEXT':\n- for i in T.split():\n- if i == W:\n count += 1\n- T = input().upper()\n \n \n print(count)\n", "added_lines": 10, "removed_lines": 5, "code1_lines": 12 }, { "user_id": "u884012707", "problem_id": "p02419", "submission1_id": "s849583306", "submission2_id": "s668358065", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\nW=input().lower()\ncount=0\nwhile True:\n line=input().split()\n if line==[\"END_OF_TEXT\"]:\n break\n print(line)\n count+=Counter(map(lambda x:x.lower(),line))[W]\nprint(count)", "code2": "from collections import Counter\nW=input().lower()\ncount=0\nwhile True:\n line=input().split()\n if line==[\"END_OF_TEXT\"]:\n break\n count+=Counter(map(lambda x:x.lower(),line))[W]\nprint(count)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1496737502", "date2": "1496737525", "bleu_score": "0.9242083608647104", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "comquter\nserutruN computer scitntisfs apd highlx-skilled computer engineers\nwho lliw create and siolpxe \"knowledge\" for the enw era.\nProvides an sutotanding ctmpuoer envjronment.\nEND_OF_TEXT\n", "actual_output": "['serutruN', 'computer', 'scitntisfs', 'apd', 'highlx-skilled', 'computer', 'engineers']\n['who', 'lliw', 'create', 'and', 'siolpxe', '\"knowledge\"', 'for', 'the', 'enw', 'era.']\n['Provides', 'an', 'sutotanding', 'ctmpuoer', 'envjronment.']\n0\n", "expected_output": "0\n\n", "anno_code": ["from collections import Counter\nW=input().lower() # (0): W=comquter\ncount=0 # (1): count=0\nwhile True: # (2): NO CHANGE (7): NO CHANGE ... (17): NO CHANGE\n line=input().split() # (3): line=['serutruN', 'computer', 'scitntisfs', 'apd', 'highlx-skilled', 'computer', 'engineers'] (8): line=['who', 'lliw', 'create', 'and', 'siolpxe', '\"knowledge\"', 'for', 'the', 'enw', 'era.'] ... (18): line=['END_OF_TEXT']\n if line==[\"END_OF_TEXT\"]: # (4): NO CHANGE (9): NO CHANGE ... (19): NO CHANGE\n break # (20): NO CHANGE\n print(line) # (5): NO CHANGE (10): NO CHANGE (15): NO CHANGE\n count+=Counter(map(lambda x:x.lower(),line))[W] # (6): NO CHANGE (11): NO CHANGE (16): NO CHANGE\nprint(count)"], "anno_status": [true], "diff_content": " from collections import Counter\n W=input().lower()\n count=0\n while True:\n line=input().split()\n if line==[\"END_OF_TEXT\"]:\n break\n- print(line)\n count+=Counter(map(lambda x:x.lower(),line))[W]\n print(count)\n", "FL_content": " from collections import Counter\n W=input().lower()\n count=0\n while True:\n line=input().split()\n if line==[\"END_OF_TEXT\"]:\n break\n- print(line)\n count+=Counter(map(lambda x:x.lower(),line))[W]\n print(count)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u604437890", "problem_id": "p02419", "submission1_id": "s666636020", "submission2_id": "s132495260", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import fileinput\nW = input()\ncnt = 0\nfor line in fileinput.input():\n if line.rstrip() == 'END_OF_TEXT':\n break\n line = ''.join(line.split())\n print(line)\n cnt += line.count(W)\nprint(cnt)\n\n", "code2": "import fileinput\nW = input()\ncnt = 0\nfor T in fileinput.input():\n if T.rstrip() =='END_OF_TEXT':\n break\n\n T = T.lower().split()\n cnt += T.count(W)\n \nprint(cnt)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526966223", "date2": "1527026283", "bleu_score": "0.7398565017664603", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "comquter\nNurtures computer scientists and highlx-skilled computer engineers\nwho will create and tiolpxe \"knowledge\" for the enw era.\nProvides an sutotanding computer environment.\nEND_OF_TEXT\n", "actual_output": "Nurturescomputerscientistsandhighlx-skilledcomputerengineers\nwhowillcreateandtiolpxe\"knowledge\"fortheenwera.\nProvidesansutotandingcomputerenvironment.\n0\n", "expected_output": "0\n\n", "anno_code": ["import fileinput\nW = input() # (0): W=comquter\ncnt = 0 # (1): cnt=0\nfor line in fileinput.input(): # (2): line=import fileinput (7): line=W = input() ... (77): line=END_OF_TEXT \n if line.rstrip() == 'END_OF_TEXT': # (3): NO CHANGE (8): NO CHANGE ... (78): NO CHANGE\n break # (79): NO CHANGE\n line = ''.join(line.split()) # (4): line=importfileinput (9): line=W=input() ... (74): line=Providesansutotandingcomputerenvironment.\n print(line) # (5): NO CHANGE (10): NO CHANGE ... (75): NO CHANGE\n cnt += line.count(W) # (6): NO CHANGE (11): NO CHANGE ... (76): NO CHANGE\nprint(cnt)\n\n"], "anno_status": [true], "diff_content": " import fileinput\n W = input()\n cnt = 0\n-for line in fileinput.input():\n- if line.rstrip() == 'END_OF_TEXT':\n+for T in fileinput.input():\n+ if T.rstrip() =='END_OF_TEXT':\n break\n- line = ''.join(line.split())\n- print(line)\n- cnt += line.count(W)\n+\n+ T = T.lower().split()\n+ cnt += T.count(W)\n+ \n print(cnt)\n \n \n", "FL_content": " import fileinput\n W = input()\n cnt = 0\n-for line in fileinput.input():\n- if line.rstrip() == 'END_OF_TEXT':\n break\n- line = ''.join(line.split())\n- print(line)\n- cnt += line.count(W)\n print(cnt)\n \n \n", "added_lines": 6, "removed_lines": 5, "code1_lines": 12 }, { "user_id": "u213265973", "problem_id": "p02419", "submission1_id": "s791497843", "submission2_id": "s657180258", "status1": "Wrong Answer", "status2": "Accepted", "code1": "W = input()\ncount = 0\nwhile True:\n T = input()\n if T == \"END_OF_TEXT\":\n break\n if W in T:\n count += 1\n print(count)\n\n \n ", "code2": "W = input().lower()\ncount = 0\nwhile True:\n T = input()\n if T == \"END_OF_TEXT\":\n break\n count += T.lower().split(\" \").count(W)\nprint(count)\n\n \n ", "original_language1": "Python3", "original_language2": "Python3", "date1": "1494374399", "date2": "1494375081", "bleu_score": "0.7670426858927225", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "comquter\nserutruN computer scientists aod highlx-skilled computer engineesr\nwho lliw create and tiolpxe \"knowledge\" for the enw era.\nProvides an sutptandiog ctmpuoer environment.\nEND_OF_TEXT\n", "actual_output": "0\n0\n0\n", "expected_output": "0\n\n", "anno_code": ["W = input() # (0): W=comquter\ncount = 0 # (1): count=0\nwhile True: # (2): NO CHANGE (7): NO CHANGE ... (17): NO CHANGE\n T = input() # (3): T=serutruN computer scientists aod highlx-skilled computer engineesr (8): T=who lliw create and tiolpxe \"knowledge\" for the enw era. ... (18): T=END_OF_TEXT\n if T == \"END_OF_TEXT\": # (4): NO CHANGE (9): NO CHANGE ... (19): NO CHANGE\n break\n if W in T: # (5): NO CHANGE (10): NO CHANGE (15): NO CHANGE\n count += 1\n print(count) # (6): NO CHANGE (11): NO CHANGE (16): NO CHANGE\n\n \n "], "anno_status": [true], "diff_content": "-W = input()\n+W = input().lower()\n count = 0\n while True:\n T = input()\n if T == \"END_OF_TEXT\":\n break\n- if W in T:\n- count += 1\n- print(count)\n+ count += T.lower().split(\" \").count(W)\n+print(count)\n \n \n \n", "FL_content": "-W = input()\n count = 0\n while True:\n T = input()\n if T == \"END_OF_TEXT\":\n break\n- if W in T:\n- count += 1\n- print(count)\n \n \n \n", "added_lines": 3, "removed_lines": 4, "code1_lines": 12 }, { "user_id": "u604437890", "problem_id": "p02419", "submission1_id": "s050006109", "submission2_id": "s132495260", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import fileinput\nW = input()\ncnt = 0\nfor line in fileinput.input():\n if line.rstrip() == 'END_OF_TEXT':\n break\n line = ''.join(line.lower().split())\n print(line)\n cnt += line.count(W)\nprint(cnt)\n", "code2": "import fileinput\nW = input()\ncnt = 0\nfor T in fileinput.input():\n if T.rstrip() =='END_OF_TEXT':\n break\n\n T = T.lower().split()\n cnt += T.count(W)\n \nprint(cnt)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526967116", "date2": "1527026283", "bleu_score": "0.7368735300285362", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "comquter\nserutruN computer scitntisfs aod highlx-skilled computer engineers\nwho lliw create and tiolpxe \"knowledge\" for the enw era.\nProvides an sutotanding ctmpuoer environment.\nEND_OF_TEXT\n", "actual_output": "serutruncomputerscitntisfsaodhighlx-skilledcomputerengineers\nwholliwcreateandtiolpxe\"knowledge\"fortheenwera.\nprovidesansutotandingctmpuoerenvironment.\n0\n", "expected_output": "0\n\n", "anno_code": ["import fileinput\nW = input() # (0): W=comquter\ncnt = 0 # (1): cnt=0\nfor line in fileinput.input(): # (2): line=import fileinput (7): line=W = input() ... (72): line=END_OF_TEXT \n if line.rstrip() == 'END_OF_TEXT': # (3): NO CHANGE (8): NO CHANGE ... (73): NO CHANGE\n break # (74): NO CHANGE\n line = ''.join(line.lower().split()) # (4): line=importfileinput (9): line=w=input() ... (69): line=providesansutotandingctmpuoerenvironment.\n print(line) # (5): NO CHANGE (10): NO CHANGE ... (70): NO CHANGE\n cnt += line.count(W) # (6): NO CHANGE (11): NO CHANGE ... (71): NO CHANGE\nprint(cnt)\n"], "anno_status": [true], "diff_content": " import fileinput\n W = input()\n cnt = 0\n-for line in fileinput.input():\n- if line.rstrip() == 'END_OF_TEXT':\n+for T in fileinput.input():\n+ if T.rstrip() =='END_OF_TEXT':\n break\n- line = ''.join(line.lower().split())\n- print(line)\n- cnt += line.count(W)\n+\n+ T = T.lower().split()\n+ cnt += T.count(W)\n+ \n print(cnt)\n \n+\n", "FL_content": " import fileinput\n W = input()\n cnt = 0\n-for line in fileinput.input():\n- if line.rstrip() == 'END_OF_TEXT':\n break\n- line = ''.join(line.lower().split())\n- print(line)\n- cnt += line.count(W)\n print(cnt)\n \n", "added_lines": 7, "removed_lines": 5, "code1_lines": 11 }, { "user_id": "u126322807", "problem_id": "p02419", "submission1_id": "s910096975", "submission2_id": "s352871496", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\ncontents = []\ncounter = 0\n\nword = input()\n\nwhile True:\n text = input()\n if text == \"END_OF_TEXT\":\n break\n textWords = text.split()\n contents.append(textWords)\n\nfor x in contents:\n for y in textWords:\n if y == word:\n counter += 1\n\nprint(counter)", "code2": "\n\ncontents = []\ncounter = 0\n\nword = input()\n\nwhile True:\n text = input()\n if text == \"END_OF_TEXT\":\n break\n textWords = text.split()\n contents.append(textWords)\n\nfor x in contents:\n for y in x:\n if y.lower() == word:\n counter += 1\n\nprint(counter)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1494435049", "date2": "1494435954", "bleu_score": "0.9611946054480403", "code1_test_status": [1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 90, "total_score": 101, "input": "computer\nNvrtures retupmoc scientists and highly-skilled computer engineers\nwho will create and tiolpxe \"knowledge\" for the enw .are\nProvides an outstanding computer environment.\nEND_OF_TEXT\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["\n\ncontents = [] # (0): contents=[]\ncounter = 0 # (1): counter=0\n\nword = input() # (2): word=computer\n\nwhile True: # (3): NO CHANGE (8): NO CHANGE ... (18): contents\n text = input() # (4): text=Nvrtures retupmoc scientists and highly-skilled computer engineers (9): text=who will create and tiolpxe \"knowledge\" for the enw .are ... (19): contents, text=END_OF_TEXT\n if text == \"END_OF_TEXT\": # (5): NO CHANGE (10): NO CHANGE ... (20): contents\n break # (21): contents\n textWords = text.split() # (6): textWords=['Nvrtures', 'retupmoc', 'scientists', 'and', 'highly-skilled', 'computer', 'engineers'] (11): textWords=['who', 'will', 'create', 'and', 'tiolpxe', '\"knowledge\"', 'for', 'the', 'enw', '.are'] (16): contents, textWords=['Provides', 'an', 'outstanding', 'computer', 'environment.']\n contents.append(textWords) # (7): contents=[['Nvrtures', 'retupmoc', 'scientists', 'and', 'highly-skilled', 'computer', 'engineers']] (12): contents (17): contents\n\nfor x in contents: # (22): contents, x=['Nvrtures', 'retupmoc', 'scientists', 'and', 'highly-skilled', 'computer', 'engineers'] (35): contents, x=['who', 'will', 'create', 'and', 'tiolpxe', '\"knowledge\"', 'for', 'the', 'enw', '.are'] ... (61): contents\n for y in textWords: # (23): contents, y=Provides (25): contents, y=an ... (60): contents\n if y == word: # (24): contents (26): contents ... (59): contents\n counter += 1 # (31): contents, counter=1 (44): contents, counter=2 (57): contents, counter=3\n\nprint(counter)"], "anno_status": [true], "diff_content": " \n \n contents = []\n counter = 0\n \n word = input()\n \n while True:\n text = input()\n if text == \"END_OF_TEXT\":\n break\n textWords = text.split()\n contents.append(textWords)\n \n for x in contents:\n- for y in textWords:\n- if y == word:\n+ for y in x:\n+ if y.lower() == word:\n counter += 1\n \n print(counter)\n", "FL_content": " \n \n contents = []\n counter = 0\n \n word = input()\n \n while True:\n text = input()\n if text == \"END_OF_TEXT\":\n break\n textWords = text.split()\n contents.append(textWords)\n \n for x in contents:\n- for y in textWords:\n- if y == word:\n counter += 1\n \n print(counter)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 20 }, { "user_id": "u104171359", "problem_id": "p02419", "submission1_id": "s892935867", "submission2_id": "s645159094", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\nimport re\n\n\ndef main():\n w = sys.stdin.readline().lower()\n t = str()\n\n for line in sys.stdin:\n if line == 'END_OF_TEXT':\n break\n t += line.lower()\n\n print(len(re.findall((w), t)))\n\n\nif __name__ == '__main__':\n main()", "code2": "\n\nimport sys\n\n\ndef main():\n w = sys.stdin.readline().lower().strip('\\n')\n s = 0\n\n for line in sys.stdin:\n if line == 'END_OF_TEXT':\n break\n s += line.lower().split().count(w)\n\n print(s)\n\n\nif __name__ == '__main__':\n main()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1487035457", "date2": "1487036188", "bleu_score": "0.8437324211272025", "code1_test_status": [0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0], "code1_test_score": 79, "total_score": 101, "input": "computer\nserutruN computer rcientists and highly-skilled computer engineers\nwho wiml create and exploit \"knowledge\" for the new era-\nProvides n` outstanding computer environment.\nEND_OF_TEXT\n", "actual_output": "0\n", "expected_output": "3\n\n", "anno_code": ["\n\nimport sys\nimport re\n\n\ndef main(): # (0): main=\n w = sys.stdin.readline().lower()\n t = str()\n\n for line in sys.stdin:\n if line == 'END_OF_TEXT':\n break\n t += line.lower()\n\n print(len(re.findall((w), t)))\n\n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " \n \n import sys\n-import re\n \n \n def main():\n- w = sys.stdin.readline().lower()\n- t = str()\n+ w = sys.stdin.readline().lower().strip('\\n')\n+ s = 0\n \n for line in sys.stdin:\n if line == 'END_OF_TEXT':\n break\n- t += line.lower()\n+ s += line.lower().split().count(w)\n \n- print(len(re.findall((w), t)))\n+ print(s)\n \n \n if __name__ == '__main__':\n main()\n", "FL_content": " \n \n import sys\n-import re\n \n \n def main():\n- w = sys.stdin.readline().lower()\n- t = str()\n \n for line in sys.stdin:\n if line == 'END_OF_TEXT':\n break\n- t += line.lower()\n \n- print(len(re.findall((w), t)))\n \n \n if __name__ == '__main__':\n main()\n", "added_lines": 4, "removed_lines": 5, "code1_lines": 20 }, { "user_id": "u181431922", "problem_id": "p03957", "submission1_id": "s361774488", "submission2_id": "s825248107", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\na = s.find('C')\n\nif a == -1:\n print(\"No\")\nelse:\n if s[a:].find('F') == -1:\n print(\"Yes\")", "code2": "s = input()\na = s.find('C')\n\nif a == -1:\n print(\"No\")\nelse:\n if s[a:].find('F') == -1:\n print(\"No\")\n else: print(\"Yes\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1546481525", "date2": "1546481950", "bleu_score": "0.8351932923957912", "code1_test_status": [0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0], "code1_test_score": 57, "total_score": 103, "input": "FCD\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["s = input() # (0): s=FCD\na = s.find('C') # (1): a=1\n\nif a == -1: # (2): NO CHANGE\n print(\"No\")\nelse:\n if s[a:].find('F') == -1: # (3): NO CHANGE\n print(\"Yes\")"], "anno_status": [true], "diff_content": " s = input()\n a = s.find('C')\n \n if a == -1:\n print(\"No\")\n else:\n if s[a:].find('F') == -1:\n- print(\"Yes\")\n+ print(\"No\")\n+ else: print(\"Yes\")\n", "FL_content": " s = input()\n a = s.find('C')\n \n if a == -1:\n print(\"No\")\n else:\n if s[a:].find('F') == -1:\n- print(\"Yes\")\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u991567869", "problem_id": "p03957", "submission1_id": "s312976838", "submission2_id": "s311844016", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\na = s.find(\"C\")\nb = s.rfind(\"F\")\n\nif 0 < a < b:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "s = input()\na = s.find(\"C\")\nb = s.rfind(\"F\")\n\nif -1 < a < b:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595012832", "date2": "1595012893", "bleu_score": "0.9638930762749008", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 100, "total_score": 103, "input": "CODDFESTIVAL\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["s = input() # (0): s=CODDFESTIVAL\na = s.find(\"C\") # (1): a=0\nb = s.rfind(\"F\") # (2): b=4\n\nif 0 < a < b: # (3): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " s = input()\n a = s.find(\"C\")\n b = s.rfind(\"F\")\n \n-if 0 < a < b:\n+if -1 < a < b:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " s = input()\n a = s.find(\"C\")\n b = s.rfind(\"F\")\n \n-if 0 < a < b:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u094191970", "problem_id": "p03957", "submission1_id": "s569374777", "submission2_id": "s610880873", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nt=0\nfor i in range(len(s)):\n if s[i]=='C':\n t=i\n if s[i]=='F' and i>t:\n print('Yes')\n exit()\nprint('No')", "code2": "s=input()\nt=100\nfor i in range(len(s)):\n if s[i]=='C':\n t=i\n if s[i]=='F' and i>t:\n print('Yes')\n exit()\nprint('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574309463", "date2": "1574309592", "bleu_score": "0.9751674118441185", "code1_test_status": [1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 67, "total_score": 103, "input": "DF\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " s=input()\n-t=0\n+t=100\n for i in range(len(s)):\n if s[i]=='C':\n t=i\n if s[i]=='F' and i>t:\n print('Yes')\n exit()\n print('No')\n", "FL_content": " s=input()\n-t=0\n for i in range(len(s)):\n if s[i]=='C':\n t=i\n if s[i]=='F' and i>t:\n print('Yes')\n exit()\n print('No')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u331464808", "problem_id": "p03957", "submission1_id": "s724820104", "submission2_id": "s083825566", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s= input()\na=0\nb=0\nfor i in range(len(s)):\n if s[i]=='C':\n a += i\n elif s[i]=='F':\n b += i\nif a=0and a=0and a= 0 and f >= 0:\n print('Yes')\nelse:\n print('No')\n ", "code2": "s = input()\nans = 'No'\nc = s.find('C')\nif c != -1:\n f = s[c:].find('F')\n if f != -1:\n ans = 'Yes'\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560973123", "date2": "1560973674", "bleu_score": "0.6049604246413381", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 94, "total_score": 103, "input": "DOFCQDKAIVSF\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["s = input() # (0): s=DOFCQDKAIVSF\nc = s.find('C') # (1): c=3\nf = s.find('F') # (2): f=2\nif c < f and c >= 0 and f >= 0: # (3): NO CHANGE\n print('Yes')\nelse:\n print('No')\n "], "anno_status": [true], "diff_content": " s = input()\n+ans = 'No'\n c = s.find('C')\n-f = s.find('F')\n-if c < f and c >= 0 and f >= 0:\n- print('Yes')\n-else:\n- print('No')\n- \n+if c != -1:\n+ f = s[c:].find('F')\n+ if f != -1:\n+ ans = 'Yes'\n+print(ans)\n+\n", "FL_content": " s = input()\n c = s.find('C')\n-f = s.find('F')\n-if c < f and c >= 0 and f >= 0:\n- print('Yes')\n-else:\n- print('No')\n- \n", "added_lines": 7, "removed_lines": 6, "code1_lines": 8 }, { "user_id": "u366886346", "problem_id": "p03957", "submission1_id": "s229111696", "submission2_id": "s953881804", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nc=0\nf=0\nfor i in range(len(s)):\n if s[i]==\"C\":\n if c==0:\n c=i+1\n if s[i]==\"F\":\n f=i+1\nif c\n \n indeg = {v: 0 for v in V} # (12): indeg={0: 0, 1: 0, 2: 0, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0}\n for ends in E.values(): # (13): ends=[2, 2] (19): NO CHANGE\n for v in ends: # (14): v=2 (16): NO CHANGE (18): NO CHANGE\n indeg[v] += 1 # (15): indeg={0: 0, 1: 0, 2: 1, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0} (17): indeg={0: 0, 1: 0, 2: 2, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0}\n \n q = deque([v for v in V if indeg[v] == 0]) # (20): q=deque([])\n top_sorted = [] # (21): top_sorted=[]\n while q: # (22): NO CHANGE (33): NO CHANGE ... (61): NO CHANGE\n v = q.popleft() # (23): v=0 (34): v=1 ... (58): v=2\n top_sorted.append(v) # (24): top_sorted=[0] (35): top_sorted=[0, 1] ... (59): top_sorted=[0, 1, 3, 4, 5, 6, 7, 2]\n \n for u in E[v]: # (25): u=2 (28): NO CHANGE ... (60): E=defaultdict(, {0: [2, 2], 1: [], 3: [], 4: [], 5: [], 6: [], 7: [], 2: []})\n indeg[u] -= 1 # (26): indeg={0: 0, 1: 0, 2: 1, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0} (29): indeg={0: 0, 1: 0, 2: 0, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0}\n if indeg[u] == 0: # (27): NO CHANGE (30): NO CHANGE\n q.append(u) # (31): NO CHANGE\n if len(top_sorted) == len(V): \n return top_sorted\n else: \n return None\n\nN, M = map(int, input().split()) # (1): N=8, M=2\nV = range(N) # (2): V=range(0, 8)\nE = defaultdict(list) # (3): E=defaultdict(, {})\nfor _ in range(M): # (4): _=0 (7): _=1 (10): NO CHANGE\n s, t = map(int, input().split()) # (5): s=0, t=2 (8): NO CHANGE\n E[s].append(t) # (6): E=defaultdict(, {0: [2]}) (9): E=defaultdict(, {0: [2, 2]})\nprint(0 if topological_sort(V, E) is None else 1) # (11): NO CHANGE\n"], "anno_status": [true], "diff_content": " from collections import deque, defaultdict\n \n def topological_sort(V, E):\n \n indeg = {v: 0 for v in V}\n for ends in E.values():\n for v in ends:\n indeg[v] += 1\n \n q = deque([v for v in V if indeg[v] == 0])\n top_sorted = []\n while q:\n v = q.popleft()\n top_sorted.append(v)\n \n for u in E[v]:\n indeg[u] -= 1\n if indeg[u] == 0:\n q.append(u)\n if len(top_sorted) == len(V): \n return top_sorted\n else: \n return None\n \n N, M = map(int, input().split())\n V = range(N)\n E = defaultdict(list)\n for _ in range(M):\n s, t = map(int, input().split())\n E[s].append(t)\n-print(0 if topological_sort(V, E) is None else 1)\n+print(1 if topological_sort(V, E) is None else 0)\n \n", "FL_content": " from collections import deque, defaultdict\n \n def topological_sort(V, E):\n \n indeg = {v: 0 for v in V}\n for ends in E.values():\n for v in ends:\n indeg[v] += 1\n \n q = deque([v for v in V if indeg[v] == 0])\n top_sorted = []\n while q:\n v = q.popleft()\n top_sorted.append(v)\n \n for u in E[v]:\n indeg[u] -= 1\n if indeg[u] == 0:\n q.append(u)\n if len(top_sorted) == len(V): \n return top_sorted\n else: \n return None\n \n N, M = map(int, input().split())\n V = range(N)\n E = defaultdict(list)\n for _ in range(M):\n s, t = map(int, input().split())\n E[s].append(t)\n-print(0 if topological_sort(V, E) is None else 1)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 32 }, { "user_id": "u893844544", "problem_id": "p02369", "submission1_id": "s258449891", "submission2_id": "s069879099", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nnv,ne = [int(i) for i in input().split()]\n\ng = [[] for i in range(nv)]\n\nfor i in range(ne):\n s,t = [int(j) for j in input().split()]\n g[s].append(t)\n\nvisited = [False for i in range(nv)]\nf = 0\n\ndef pursue_from(index, origin):\n global f\n\n if f == 1 or visited[index]:\n return\n\n visited[index] = True\n\n for next_index in g[index]:\n\n if next_index == 0:\n f = 1\n return\n pursue_from(next_index, origin)\n\nfor i in range(nv):\n pursue_from(i, i)\n\nprint(f)\n", "code2": "\nnv,ne = [int(i) for i in input().split()]\n\ng = [[] for i in range(nv)]\n\nfor i in range(ne):\n s,t = [int(j) for j in input().split()]\n g[s].append(t)\n\nvisited = []\nf = 0\n\ndef pursue_from(index, origin):\n\n if visited[index]:\n return\n\n visited[index] = True\n\n for next_index in g[index]:\n\n if next_index == origin:\n global f\n f = 1\n return\n pursue_from(next_index, origin)\n\nfor i in range(nv):\n visited = [False for i in range(nv)]\n\n pursue_from(i, i)\n\n if f == 1:\n break\n\nprint(f)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1524436507", "date2": "1524436957", "bleu_score": "0.8938303141596448", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 101, "total_score": 102, "input": "3 3\n0 2\n0 2\n1 0\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["\nnv,ne = [int(i) for i in input().split()] # (0): nv=3, ne=3\n\ng = [[] for i in range(nv)] # (1): g\n\nfor i in range(ne): # (2): i=0 (5): g, i=1 ... (11): g\n s,t = [int(j) for j in input().split()] # (3): s=0, t=2 (6): g (9): g, s=1, t=0\n g[s].append(t) # (4): g=[[2], [], []] (7): g (10): g\n\nvisited = [False for i in range(nv)] # (12): g, visited=[False, False, False]\nf = 0 # (13): g, f=0\n\ndef pursue_from(index, origin): # (14): g, pursue_from=\n global f\n\n if f == 1 or visited[index]: # (17): NO CHANGE (22): NO CHANGE ... (41): NO CHANGE\n return # (29): index=0, next_index=2 (42): nv=3, ne=3, g=[[2, 2], [0], []], i=2, s=1, t=0, visited=[True, True, True], f=1, pursue_from=\n\n visited[index] = True # (18): NO CHANGE (23): NO CHANGE (34): NO CHANGE\n\n for next_index in g[index]: # (19): next_index=2 (24): index=0, next_index=2 ... (35): next_index=0\n\n if next_index == 0: # (20): NO CHANGE (26): NO CHANGE (36): NO CHANGE\n f = 1 # (37): NO CHANGE\n return # (38): nv=3, ne=3, g=[[2, 2], [0], []], i=1, s=1, t=0, visited=[True, True, True], f=1, pursue_from=\n pursue_from(next_index, origin) # (21): index=2 (27): index=2\n\nfor i in range(nv): # (15): g, i=0 (31): g, i=1 ... (43): g\n pursue_from(i, i) # (16): index=0, origin=0 (32): index=1, origin=1 (40): index=2, origin=2\n\nprint(f)\n"], "anno_status": [true], "diff_content": " \n nv,ne = [int(i) for i in input().split()]\n \n g = [[] for i in range(nv)]\n \n for i in range(ne):\n s,t = [int(j) for j in input().split()]\n g[s].append(t)\n \n-visited = [False for i in range(nv)]\n+visited = []\n f = 0\n \n def pursue_from(index, origin):\n- global f\n \n- if f == 1 or visited[index]:\n+ if visited[index]:\n return\n \n visited[index] = True\n \n for next_index in g[index]:\n \n- if next_index == 0:\n+ if next_index == origin:\n+ global f\n f = 1\n return\n pursue_from(next_index, origin)\n \n for i in range(nv):\n+ visited = [False for i in range(nv)]\n+\n pursue_from(i, i)\n \n+ if f == 1:\n+ break\n+\n print(f)\n \n+\n", "FL_content": " \n nv,ne = [int(i) for i in input().split()]\n \n g = [[] for i in range(nv)]\n \n for i in range(ne):\n s,t = [int(j) for j in input().split()]\n g[s].append(t)\n \n-visited = [False for i in range(nv)]\n f = 0\n \n def pursue_from(index, origin):\n- global f\n \n- if f == 1 or visited[index]:\n return\n \n visited[index] = True\n \n for next_index in g[index]:\n \n- if next_index == 0:\n f = 1\n return\n pursue_from(next_index, origin)\n \n for i in range(nv):\n pursue_from(i, i)\n \n print(f)\n \n", "added_lines": 10, "removed_lines": 4, "code1_lines": 32 }, { "user_id": "u703950586", "problem_id": "p03172", "submission1_id": "s039571537", "submission2_id": "s976464471", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys,queue,math,copy,itertools,bisect,collections,heapq\nsys.setrecursionlimit(10**7)\nINF = 10**18\nMOD = 10**9 + 7\nLI = lambda : [int(x) for x in sys.stdin.readline().split()]\nNI = lambda : int(sys.stdin.readline())\n\nN,K = LI()\na = [0]+LI()\nif K == 0:\n print(1)\n exit(0)\ndp = [[1] * (K+1) for _ in range(N+1)]\nac = 0\nfor i in range(1,N+1):\n ac += a[i]\n s = 0\n for j in range(K+1):\n s += dp[i-1][j]\n if j-a[i]-1 >= 0: s -= dp[i-1][j-a[i]-1]\n dp[i][j] = s % MOD\nprint(dp[-1][K]-dp[-1][K-1])\n", "code2": "import sys,queue,math,copy,itertools,bisect,collections,heapq\nsys.setrecursionlimit(10**7)\nINF = 10**18\nMOD = 10**9 + 7\nLI = lambda : [int(x) for x in sys.stdin.readline().split()]\nNI = lambda : int(sys.stdin.readline())\n\nN,K = LI()\na = [0]+LI()\nif K == 0:\n print(1)\n exit(0)\ndp = [[1] * (K+1) for _ in range(N+1)]\nac = 0\nfor i in range(1,N+1):\n ac += a[i]\n s = 0\n for j in range(K+1):\n s += dp[i-1][j]\n if j-a[i]-1 >= 0: s -= dp[i-1][j-a[i]-1]\n dp[i][j] = s % MOD\nprint((dp[-1][K]-dp[-1][K-1])%MOD)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1588815657", "date2": "1588815820", "bleu_score": "0.9864279828136503", "code1_test_status": [1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1], "code1_test_score": 66, "total_score": 103, "input": "4 101001\n101000 100000 100100 101000\n", "actual_output": "-155911274\n", "expected_output": "844088733\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import sys,queue,math,copy,itertools,bisect,collections,heapq\n sys.setrecursionlimit(10**7)\n INF = 10**18\n MOD = 10**9 + 7\n LI = lambda : [int(x) for x in sys.stdin.readline().split()]\n NI = lambda : int(sys.stdin.readline())\n \n N,K = LI()\n a = [0]+LI()\n if K == 0:\n print(1)\n exit(0)\n dp = [[1] * (K+1) for _ in range(N+1)]\n ac = 0\n for i in range(1,N+1):\n ac += a[i]\n s = 0\n for j in range(K+1):\n s += dp[i-1][j]\n if j-a[i]-1 >= 0: s -= dp[i-1][j-a[i]-1]\n dp[i][j] = s % MOD\n-print(dp[-1][K]-dp[-1][K-1])\n+print((dp[-1][K]-dp[-1][K-1])%MOD)\n \n", "FL_content": " import sys,queue,math,copy,itertools,bisect,collections,heapq\n sys.setrecursionlimit(10**7)\n INF = 10**18\n MOD = 10**9 + 7\n LI = lambda : [int(x) for x in sys.stdin.readline().split()]\n NI = lambda : int(sys.stdin.readline())\n \n N,K = LI()\n a = [0]+LI()\n if K == 0:\n print(1)\n exit(0)\n dp = [[1] * (K+1) for _ in range(N+1)]\n ac = 0\n for i in range(1,N+1):\n ac += a[i]\n s = 0\n for j in range(K+1):\n s += dp[i-1][j]\n if j-a[i]-1 >= 0: s -= dp[i-1][j-a[i]-1]\n dp[i][j] = s % MOD\n-print(dp[-1][K]-dp[-1][K-1])\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 23 }, { "user_id": "u678167152", "problem_id": "p03172", "submission1_id": "s749416265", "submission2_id": "s629238795", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nfrom itertools import groupby, accumulate, product, permutations, combinations\n\ndef solve(N,K,A):\n mod = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)] \n dp[0][0] = 1\n for i in range(1,N+1):\n cum = list(map(lambda x:x%mod,accumulate(dp[i-1])))\n for j in range(K+1):\n dp[i][j] = cum[j]\n k = j-A[i-1]-1\n if k>=0:\n dp[i][j] -= cum[k]\n ans = dp[N][K]\n return ans\nprint(solve(N,K,A))", "code2": "N, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nfrom itertools import groupby, accumulate, product, permutations, combinations\n\ndef solve(N,K,A):\n mod = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)] \n dp[0][0] = 1\n for i in range(1,N+1):\n cum = list(map(lambda x:x%mod,accumulate(dp[i-1])))\n for j in range(K+1):\n dp[i][j] = cum[j]\n k = j-A[i-1]\n if k>0:\n dp[i][j] -= cum[k-1]\n ans = dp[N][K]%mod\n return ans\nprint(solve(N,K,A))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587922332", "date2": "1587922596", "bleu_score": "0.9800679750326796", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1], "code1_test_score": 88, "total_score": 103, "input": "4 101100\n101010 101100 101001 001101\n", "actual_output": "-57085876\n", "expected_output": "942914131\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n from itertools import groupby, accumulate, product, permutations, combinations\n \n def solve(N,K,A):\n mod = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)] \n dp[0][0] = 1\n for i in range(1,N+1):\n cum = list(map(lambda x:x%mod,accumulate(dp[i-1])))\n for j in range(K+1):\n dp[i][j] = cum[j]\n- k = j-A[i-1]-1\n- if k>=0:\n- dp[i][j] -= cum[k]\n- ans = dp[N][K]\n+ k = j-A[i-1]\n+ if k>0:\n+ dp[i][j] -= cum[k-1]\n+ ans = dp[N][K]%mod\n return ans\n print(solve(N,K,A))\n", "FL_content": " N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n from itertools import groupby, accumulate, product, permutations, combinations\n \n def solve(N,K,A):\n mod = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)] \n dp[0][0] = 1\n for i in range(1,N+1):\n cum = list(map(lambda x:x%mod,accumulate(dp[i-1])))\n for j in range(K+1):\n dp[i][j] = cum[j]\n- k = j-A[i-1]-1\n- if k>=0:\n- dp[i][j] -= cum[k]\n- ans = dp[N][K]\n return ans\n print(solve(N,K,A))\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 19 }, { "user_id": "u672220554", "problem_id": "p03172", "submission1_id": "s725054975", "submission2_id": "s521930773", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n for j in range(K):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n dp[i+1][j+1] %= MOD\n\n return dp[N][K]\n\n\nprint(main())\n", "code2": "def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n for j in range(K+1):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n for j in range(K+1):\n dp[i+1][j] = dp[i+1][j] % MOD\n\n return dp[N][K]\n\n\nprint(main())\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1582134794", "date2": "1582148247", "bleu_score": "0.9139247901203591", "code1_test_status": [1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1], "code1_test_score": 5, "total_score": 103, "input": "4 101010\n001000 000001 100100 001010\n", "actual_output": "1195739\n", "expected_output": "1195922\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n- for j in range(K):\n+ for j in range(K+1):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n- dp[i+1][j+1] %= MOD\n+ for j in range(K+1):\n+ dp[i+1][j] = dp[i+1][j] % MOD\n \n return dp[N][K]\n \n \n print(main())\n \n", "FL_content": " def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n- for j in range(K):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n- dp[i+1][j+1] %= MOD\n \n return dp[N][K]\n \n \n print(main())\n \n", "added_lines": 3, "removed_lines": 2, "code1_lines": 23 }, { "user_id": "u509368316", "problem_id": "p03172", "submission1_id": "s521282330", "submission2_id": "s390468072", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K=map(int,input().split())\nA=list(map(int,input().split()))\nd=[[0]*(K+2) for i in range(N+1)]\nd[0]=[0]+[1]*(K+1)\nm=10**9+7\nfor i in range(N):\n for j in range(K+1):\n d[i+1][j+1]=(d[i][j+1]-d[i][max(0,j-A[i])]+d[i+1][j])%m\nprint(d[-1][-1]-d[-1][-2])", "code2": "N,K=map(int,input().split())\nA=list(map(int,input().split()))\nd=[[0]*(K+2) for i in range(N+1)]\nd[0]=[0]+[1]*(K+1)\nm=10**9+7\nfor i in range(N):\n for j in range(K+1):\n d[i+1][j+1]=(d[i][j+1]-d[i][max(0,j-A[i])]+d[i+1][j])%m\nprint((d[-1][-1]-d[-1][-2])%m)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589676036", "date2": "1589676107", "bleu_score": "0.9818170376361564", "code1_test_status": [1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1], "code1_test_score": 66, "total_score": 103, "input": "4 101000\n101000 100110 101001 100000\n", "actual_output": "-251741768\n", "expected_output": "748258239\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N,K=map(int,input().split())\n A=list(map(int,input().split()))\n d=[[0]*(K+2) for i in range(N+1)]\n d[0]=[0]+[1]*(K+1)\n m=10**9+7\n for i in range(N):\n for j in range(K+1):\n d[i+1][j+1]=(d[i][j+1]-d[i][max(0,j-A[i])]+d[i+1][j])%m\n-print(d[-1][-1]-d[-1][-2])\n+print((d[-1][-1]-d[-1][-2])%m)\n", "FL_content": " N,K=map(int,input().split())\n A=list(map(int,input().split()))\n d=[[0]*(K+2) for i in range(N+1)]\n d[0]=[0]+[1]*(K+1)\n m=10**9+7\n for i in range(N):\n for j in range(K+1):\n d[i+1][j+1]=(d[i][j+1]-d[i][max(0,j-A[i])]+d[i+1][j])%m\n-print(d[-1][-1]-d[-1][-2])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u221886916", "problem_id": "p03172", "submission1_id": "s498801175", "submission2_id": "s298693518", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nMOD = int(1e9)+7\n\n\ndef main():\n n, K = map(int, input().split())\n a = list(map(int, input().split()))\n\n \n dp = [[0]*(K+1) for i in range(n+1)]\n prefix = [[0]*(K+1) for i in range(n+1)]\n prefix[0] = [1]*(K+1)\n for i in range(1, n+1):\n for j in range(K+1):\n start = j - min(a[i-1], j)-1\n end = j\n dp[i][j] = prefix[i-1][end] - \\\n (prefix[i-1][start] if start >= 0 else 0)\n prefix[i][j] = (prefix[i][j-1] + dp[i][j]) % MOD\n\n print(dp[n][K])\n\n\nif __name__ == \"__main__\":\n main()\n", "code2": "\nMOD = int(1e9)+7\n\n\ndef main():\n n, K = map(int, input().split())\n a = list(map(int, input().split()))\n\n \n dp = [[0]*(K+1) for i in range(n+1)]\n prefix = [[0]*(K+1) for i in range(n+1)]\n prefix[0] = [1]*(K+1)\n for i in range(1, n+1):\n for j in range(K+1):\n start = j - min(a[i-1], j)-1\n end = j\n dp[i][j] = (prefix[i-1][end] - \\\n (prefix[i-1][start] if start >= 0 else 0))%MOD\n prefix[i][j] = (prefix[i][j-1] + dp[i][j]) % MOD\n\n print(dp[n][K]%MOD)\n\n\nif __name__ == \"__main__\":\n main()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589185040", "date2": "1589185119", "bleu_score": "0.974862844018034", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1], "code1_test_score": 88, "total_score": 103, "input": "4 101000\n101000 101100 101001 100000\n", "actual_output": "-133850588\n", "expected_output": "866149419\n\n", "anno_code": ["\nMOD = int(1e9)+7 # (0): MOD=1000000007\n\n\ndef main(): # (1): main=\n n, K = map(int, input().split())\n a = list(map(int, input().split()))\n\n \n dp = [[0]*(K+1) for i in range(n+1)]\n prefix = [[0]*(K+1) for i in range(n+1)]\n prefix[0] = [1]*(K+1)\n for i in range(1, n+1):\n for j in range(K+1):\n start = j - min(a[i-1], j)-1\n end = j\n dp[i][j] = prefix[i-1][end] - \\\n (prefix[i-1][start] if start >= 0 else 0)\n prefix[i][j] = (prefix[i][j-1] + dp[i][j]) % MOD\n\n print(dp[n][K])\n\n\nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " \n MOD = int(1e9)+7\n \n \n def main():\n n, K = map(int, input().split())\n a = list(map(int, input().split()))\n \n \n dp = [[0]*(K+1) for i in range(n+1)]\n prefix = [[0]*(K+1) for i in range(n+1)]\n prefix[0] = [1]*(K+1)\n for i in range(1, n+1):\n for j in range(K+1):\n start = j - min(a[i-1], j)-1\n end = j\n- dp[i][j] = prefix[i-1][end] - \\\n- (prefix[i-1][start] if start >= 0 else 0)\n+ dp[i][j] = (prefix[i-1][end] - \\\n+ (prefix[i-1][start] if start >= 0 else 0))%MOD\n prefix[i][j] = (prefix[i][j-1] + dp[i][j]) % MOD\n \n- print(dp[n][K])\n+ print(dp[n][K]%MOD)\n \n \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": " \n MOD = int(1e9)+7\n \n \n def main():\n n, K = map(int, input().split())\n a = list(map(int, input().split()))\n \n \n dp = [[0]*(K+1) for i in range(n+1)]\n prefix = [[0]*(K+1) for i in range(n+1)]\n prefix[0] = [1]*(K+1)\n for i in range(1, n+1):\n for j in range(K+1):\n start = j - min(a[i-1], j)-1\n end = j\n- dp[i][j] = prefix[i-1][end] - \\\n- (prefix[i-1][start] if start >= 0 else 0)\n prefix[i][j] = (prefix[i][j-1] + dp[i][j]) % MOD\n \n- print(dp[n][K])\n \n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 26 }, { "user_id": "u440566786", "problem_id": "p03172", "submission1_id": "s698158512", "submission2_id": "s566235017", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(2147483647)\nINF=float(\"inf\")\nMOD=10**9+7\ninput=lambda :sys.stdin.readline().rstrip()\ndef resolve():\n n,k=map(int,input().split())\n A=list(map(int,input().split()))\n dp=[0]*(k+1)\n dp[k]=1\n for i in range(n):\n ndp=[0]*(k+1)\n \n S=[0]*(k+2)\n for j in range(k+1): S[j+1]=S[j]+dp[j]\n \n for j in range(k+1):\n ndp[j]=S[min(j+A[i]+1,k+1)]-S[j]\n dp=ndp\n print(dp[0])\nresolve()", "code2": "import sys\nsys.setrecursionlimit(2147483647)\nINF=float(\"inf\")\nMOD=10**9+7\ninput=lambda :sys.stdin.readline().rstrip()\ndef resolve():\n n,k=map(int,input().split())\n A=list(map(int,input().split()))\n dp=[0]*(k+1)\n dp[k]=1\n for i in range(n):\n ndp=[0]*(k+1)\n \n S=[0]*(k+2)\n for j in range(k+1):\n S[j+1]=S[j]+dp[j]\n S[j+1]%=MOD\n \n for j in range(k+1):\n ndp[j]=S[min(j+A[i]+1,k+1)]-S[j]\n ndp[j]%=MOD\n dp=ndp\n print(dp[0])\nresolve()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1572439626", "date2": "1572439834", "bleu_score": "0.88514614147113", "code1_test_status": [1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1], "code1_test_score": 34, "total_score": 103, "input": "4 110000\n101100 100000 100000 100000\n", "actual_output": "221227749083701\n", "expected_output": "747535112\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import sys\n sys.setrecursionlimit(2147483647)\n INF=float(\"inf\")\n MOD=10**9+7\n input=lambda :sys.stdin.readline().rstrip()\n def resolve():\n n,k=map(int,input().split())\n A=list(map(int,input().split()))\n dp=[0]*(k+1)\n dp[k]=1\n for i in range(n):\n ndp=[0]*(k+1)\n \n S=[0]*(k+2)\n- for j in range(k+1): S[j+1]=S[j]+dp[j]\n+ for j in range(k+1):\n+ S[j+1]=S[j]+dp[j]\n+ S[j+1]%=MOD\n \n for j in range(k+1):\n ndp[j]=S[min(j+A[i]+1,k+1)]-S[j]\n+ ndp[j]%=MOD\n dp=ndp\n print(dp[0])\n resolve()\n", "FL_content": " import sys\n sys.setrecursionlimit(2147483647)\n INF=float(\"inf\")\n MOD=10**9+7\n input=lambda :sys.stdin.readline().rstrip()\n def resolve():\n n,k=map(int,input().split())\n A=list(map(int,input().split()))\n dp=[0]*(k+1)\n dp[k]=1\n for i in range(n):\n ndp=[0]*(k+1)\n \n S=[0]*(k+2)\n- for j in range(k+1): S[j+1]=S[j]+dp[j]\n \n for j in range(k+1):\n ndp[j]=S[min(j+A[i]+1,k+1)]-S[j]\n dp=ndp\n print(dp[0])\n resolve()\n", "added_lines": 4, "removed_lines": 1, "code1_lines": 21 }, { "user_id": "u655612181", "problem_id": "p03172", "submission1_id": "s378608435", "submission2_id": "s953656055", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import accumulate\n\ndef f(k, A):\n n = len(A)\n\n mod = int(1e9 + 7)\n dp = [0] * (k + 1)\n\n \n for j in range(min(A[n - 1], k) + 1):\n dp[j] = 1\n\n for i in range(n - 2, -1, -1):\n dp = list(accumulate(dp))\n a = A[i]\n dp[a+1:] = [x - y for x, y in zip(dp[a + 1:], dp)]\n\n return dp[-1]\n\nassert f(4, [2, 3]) == 2\nassert f(4, [1, 2, 3]) == 5\nassert f(10, [9]) == 0\nassert f(0, [0, 0]) == 1\n\n\nn, k = map(int, input().split())\nA = list(map(int, input().split()))\nans = f(k, A)\nprint(ans)\n", "code2": "from itertools import accumulate\n\ndef f(k, A):\n n = len(A)\n\n mod = int(1e9 + 7)\n dp = [0] * (k + 1)\n\n \n for j in range(min(A[n - 1], k) + 1):\n dp[j] = 1\n\n for i in range(n - 2, -1, -1):\n dp = list(accumulate(dp))\n a = A[i]\n dp[a+1:] = [x - y for x, y in zip(dp[a + 1:], dp)]\n dp = [x % mod for x in dp]\n\n return dp[-1] % mod\n\nassert f(4, [2, 3]) == 2\nassert f(4, [1, 2, 3]) == 5\nassert f(10, [9]) == 0\nassert f(0, [0, 0]) == 1\nassert f(100000, [100000, 100000, 100000, 100000]) == 665683269\n\nn, k = map(int, input().split())\nA = list(map(int, input().split()))\nans = f(k, A)\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1569754490", "date2": "1569754675", "bleu_score": "0.8329226699937213", "code1_test_status": [1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1], "code1_test_score": 34, "total_score": 103, "input": "4 101000\n101010 101100 101001 000101\n", "actual_output": "519746368651\n", "expected_output": "746365018\n\n", "anno_code": ["from itertools import accumulate\n\ndef f(k, A): # (0): f=\n n = len(A) # (2): n=2 (20): n=3 ... (82): n=4\n\n mod = int(1e9 + 7) # (3): mod=1000000007 (21): mod=1000000007 ... (83): mod=1000000007\n dp = [0] * (k + 1) # (4): dp=[0, 0, 0, 0, 0] (22): dp=[0, 0, 0, 0, 0] ... (84): dp=[0, 0, ..., 0, 0]\n\n \n for j in range(min(A[n - 1], k) + 1): # (5): j=0 (7): j=1 ... (289): NO CHANGE\n dp[j] = 1 # (6): dp=[1, 0, 0, 0, 0] (8): dp=[1, 1, 0, 0, 0] ... (288): dp=[1, 1, ..., 0, 0]\n\n for i in range(n - 2, -1, -1): # (14): i=0 (18): accumulate=, f= ... (302): accumulate=, f=, ans=519746368651\n dp = list(accumulate(dp)) # (15): dp=[1, 2, 3, 4, 4] (33): dp=[1, 2, 3, 4, 4] ... (299): dp=[1, 4, ..., 519736071700, 519746368651]\n a = A[i] # (16): a=2 (34): a=2 ... (300): a=101010\n dp[a+1:] = [x - y for x, y in zip(dp[a + 1:], dp)] # (17): dp=[1, 2, 3, 3, 2] (35): dp=[1, 2, 3, 3, 2] ... (301): NO CHANGE\n\n return dp[-1]\n\nassert f(4, [2, 3]) == 2 # (1): k=4, A=[2, 3]\nassert f(4, [1, 2, 3]) == 5 # (19): k=4, A=[1, 2, 3]\nassert f(10, [9]) == 0 # (41): k=10, A=[9]\nassert f(0, [0, 0]) == 1 # (67): k=0, A=[0, 0]\n\n\nn, k = map(int, input().split()) # (79): n=4, k=101000\nA = list(map(int, input().split())) # (80): A=[101010, 101100, 101001, 101]\nans = f(k, A) # (81): NO CHANGE\nprint(ans)\n"], "anno_status": [false], "diff_content": " from itertools import accumulate\n \n def f(k, A):\n n = len(A)\n \n mod = int(1e9 + 7)\n dp = [0] * (k + 1)\n \n \n for j in range(min(A[n - 1], k) + 1):\n dp[j] = 1\n \n for i in range(n - 2, -1, -1):\n dp = list(accumulate(dp))\n a = A[i]\n dp[a+1:] = [x - y for x, y in zip(dp[a + 1:], dp)]\n+ dp = [x % mod for x in dp]\n \n- return dp[-1]\n+ return dp[-1] % mod\n \n assert f(4, [2, 3]) == 2\n assert f(4, [1, 2, 3]) == 5\n assert f(10, [9]) == 0\n assert f(0, [0, 0]) == 1\n-\n+assert f(100000, [100000, 100000, 100000, 100000]) == 665683269\n \n n, k = map(int, input().split())\n A = list(map(int, input().split()))\n ans = f(k, A)\n print(ans)\n \n", "FL_content": " from itertools import accumulate\n \n def f(k, A):\n n = len(A)\n \n mod = int(1e9 + 7)\n dp = [0] * (k + 1)\n \n \n for j in range(min(A[n - 1], k) + 1):\n dp[j] = 1\n \n for i in range(n - 2, -1, -1):\n dp = list(accumulate(dp))\n a = A[i]\n dp[a+1:] = [x - y for x, y in zip(dp[a + 1:], dp)]\n \n- return dp[-1]\n \n assert f(4, [2, 3]) == 2\n assert f(4, [1, 2, 3]) == 5\n assert f(10, [9]) == 0\n assert f(0, [0, 0]) == 1\n-\n \n n, k = map(int, input().split())\n A = list(map(int, input().split()))\n ans = f(k, A)\n print(ans)\n \n", "added_lines": 3, "removed_lines": 2, "code1_lines": 30 }, { "user_id": "u672220554", "problem_id": "p03172", "submission1_id": "s071625340", "submission2_id": "s521930773", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n for j in range(K):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n \n \n\n return dp[N][K] % MOD\n\n\nprint(main())\n", "code2": "def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n for j in range(K+1):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n for j in range(K+1):\n dp[i+1][j] = dp[i+1][j] % MOD\n\n return dp[N][K]\n\n\nprint(main())\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1582147606", "date2": "1582148247", "bleu_score": "0.8996665524184058", "code1_test_status": [1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1], "code1_test_score": 5, "total_score": 103, "input": "4 101000\n101000 001100 101001 100000\n", "actual_output": "600177772\n", "expected_output": "710774323\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n- for j in range(K):\n+ for j in range(K+1):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n- \n- \n+ for j in range(K+1):\n+ dp[i+1][j] = dp[i+1][j] % MOD\n \n- return dp[N][K] % MOD\n+ return dp[N][K]\n \n \n print(main())\n \n", "FL_content": " def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n- for j in range(K):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n- \n- \n \n- return dp[N][K] % MOD\n \n \n print(main())\n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 24 }, { "user_id": "u672220554", "problem_id": "p03172", "submission1_id": "s964858608", "submission2_id": "s521930773", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n for j in range(K):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n for j in range(K+1):\n dp[i+1][j] %= MOD\n\n return dp[N][K]\n\n\nprint(main())\n", "code2": "def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n for j in range(K+1):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n for j in range(K+1):\n dp[i+1][j] = dp[i+1][j] % MOD\n\n return dp[N][K]\n\n\nprint(main())\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1582135327", "date2": "1582148247", "bleu_score": "0.9677779747247063", "code1_test_status": [1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1], "code1_test_score": 5, "total_score": 103, "input": "4 000001\n101100 100110 101000 100000\n", "actual_output": "1\n", "expected_output": "4\n\n", "anno_code": ["def main(): # (0): main=\n N, K = map(int, input().split()) # (2): N=4, K=1\n if K == 0: # (3): NO CHANGE\n return 1\n A = list(map(int, input().split())) # (4): A=[101100, 100110, 101000, 100000]\n MOD = 10**9+7 # (5): MOD=1000000007\n dp = [[0]*(K+1) for _ in range(N+1)] # (6): dp\n dp[0][0] = 1 # (7): dp\n for i in range(N): # (8): i=0 (22): i=1 ... (50): i=3\n a = A[i] # (9): a=101100 (23): a=100110 ... (51): a=100000\n for j in range(K): # (10): j=0 (13): NO CHANGE ... (55): NO CHANGE\n dp[i+1][j] += dp[i][j] # (11): dp (25): dp ... (53): dp\n if j+a+1 <= K: # (12): NO CHANGE (26): NO CHANGE ... (54): NO CHANGE\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K): # (14): NO CHANGE (16): NO CHANGE ... (58): NO CHANGE\n dp[i+1][j+1] += dp[i+1][j] # (15): dp (29): dp ... (57): dp\n for j in range(K+1): # (17): NO CHANGE (19): j=1 ... (63): NO CHANGE\n dp[i+1][j] %= MOD # (18): NO CHANGE (20): NO CHANGE ... (62): NO CHANGE\n\n return dp[N][K]\n\n\nprint(main()) # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n- for j in range(K):\n+ for j in range(K+1):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n for j in range(K+1):\n- dp[i+1][j] %= MOD\n+ dp[i+1][j] = dp[i+1][j] % MOD\n \n return dp[N][K]\n \n \n print(main())\n \n", "FL_content": " def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n- for j in range(K):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n for j in range(K+1):\n- dp[i+1][j] %= MOD\n \n return dp[N][K]\n \n \n print(main())\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 24 }, { "user_id": "u476225888", "problem_id": "p03172", "submission1_id": "s288974961", "submission2_id": "s506888160", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n\n from bisect import bisect_left as bl, bisect_right as br, insort\n import sys\n import heapq\n \n from collections import defaultdict as dd, deque\n def data(): return sys.stdin.readline().strip()\n def mdata(): return list(map(int, data().split()))\n out = sys.stdout.write\n \n INF = int(1e9)\n mod = int(1e9)+7\n\n n,k=mdata()\n A=mdata()\n dp=[1 if A[0]>=i else 0 for i in range(k+1)]\n for i in range(1,n):\n for j in range(1,k+1):\n dp[j]=(dp[j]+dp[j-1])%mod\n for j in range(k+1):\n if A[i]\n\n from bisect import bisect_left as bl, bisect_right as br, insort\n import sys\n import heapq\n \n from collections import defaultdict as dd, deque\n def data(): return sys.stdin.readline().strip()\n def mdata(): return list(map(int, data().split()))\n out = sys.stdout.write\n \n INF = int(1e9)\n mod = int(1e9)+7\n\n n,k=mdata()\n A=mdata()\n dp=[1 if A[0]>=i else 0 for i in range(k+1)]\n for i in range(1,n):\n for j in range(1,k+1):\n dp[j]=(dp[j]+dp[j-1])%mod\n for j in range(k+1):\n if A[i]=i else 0 for i in range(k+1)]\n- for i in range(1,n):\n- for j in range(1,k+1):\n- dp[j]=(dp[j]+dp[j-1])%mod\n- for j in range(k+1):\n- if A[i]=i else 0 for i in range(k+1)]\n- for i in range(1,n):\n- for j in range(1,k+1):\n- dp[j]=(dp[j]+dp[j-1])%mod\n- for j in range(k+1):\n- if A[i]2:\n print('No')\nelse:\n print('Yes')", "code2": "n=int(input())\np=list(map(int,input().split()))\ncount=0\nnum=0\nfor i in p:\n if i!=num+1:\n count+=1\n num+=1\nif count>2:\n print('NO')\nelse:\n print('YES')", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587073799", "date2": "1587073911", "bleu_score": "0.9655239569539354", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "5\n1 0 -2 -1 2\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["n=int(input()) # (0): n=5\np=list(map(int,input().split())) # (1): p=[1, 0, -2, -1, 2]\ncount=0 # (2): count=0\nnum=0 # (3): num=0\nfor i in p: # (4): i=1 (7): i=0 ... (23): NO CHANGE\n if i!=num+1: # (5): NO CHANGE (8): NO CHANGE ... (20): NO CHANGE\n count+=1 # (9): count=1 (13): count=2 ... (21): count=4\n num+=1 # (6): num=1 (10): num=2 ... (22): num=5\nif count>2: # (24): NO CHANGE\n print('No')\nelse:\n print('Yes')"], "anno_status": [true], "diff_content": " n=int(input())\n p=list(map(int,input().split()))\n count=0\n num=0\n for i in p:\n if i!=num+1:\n count+=1\n num+=1\n if count>2:\n- print('No')\n+ print('NO')\n else:\n- print('Yes')\n+ print('YES')\n", "FL_content": " n=int(input())\n p=list(map(int,input().split()))\n count=0\n num=0\n for i in p:\n if i!=num+1:\n count+=1\n num+=1\n if count>2:\n- print('No')\n else:\n- print('Yes')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 12 }, { "user_id": "u046776181", "problem_id": "p02958", "submission1_id": "s211714160", "submission2_id": "s352034039", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nP = list(map(int, input().split()))\ncount = sum([index + 1 == num for index, num in enumerate(P)])\nif count <= 2:\n print(\"YES\")\nelse:\n print(\"NO\")", "code2": "N = int(input())\nP = list(map(int, input().split()))\ncount = sum([index + 1 != num for index, num in enumerate(P)])\nif count <= 2:\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564758339", "date2": "1564758486", "bleu_score": "0.9580666538479065", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "5\n0 8 0 1 4\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["N = int(input()) # (0): N=5\nP = list(map(int, input().split())) # (1): P=[0, 8, 0, 1, 4]\ncount = sum([index + 1 == num for index, num in enumerate(P)]) # (2): count=0\nif count <= 2: # (3): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")"], "anno_status": [true], "diff_content": " N = int(input())\n P = list(map(int, input().split()))\n-count = sum([index + 1 == num for index, num in enumerate(P)])\n+count = sum([index + 1 != num for index, num in enumerate(P)])\n if count <= 2:\n- print(\"YES\")\n+ print(\"YES\")\n else:\n- print(\"NO\")\n+ print(\"NO\")\n", "FL_content": " N = int(input())\n P = list(map(int, input().split()))\n-count = sum([index + 1 == num for index, num in enumerate(P)])\n if count <= 2:\n- print(\"YES\")\n else:\n- print(\"NO\")\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 7 }, { "user_id": "u238084414", "problem_id": "p02958", "submission1_id": "s828035126", "submission2_id": "s138810478", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nP = list(input(). split())\nQ = sorted(P)\ncnt = 0\ni = 0\n\nwhile cnt <= 2 and i < len(P):\n if Q[i] != P[i]:\n cnt += 1\n i += 1\n\nif cnt <= 2:\n print(\"YES\")\nelse:\n print(\"NO\")", "code2": "N = int(input())\nP = list(map(int, input(). split()))\nQ = sorted(P)\ncnt = 0\ni = 0\n\nwhile cnt <= 2 and i < len(P):\n if Q[i] != P[i]:\n cnt += 1\n i += 1\n\nif cnt <= 2:\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588182984", "date2": "1588183053", "bleu_score": "0.9440889306649072", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 100, "input": "5\n1 20 1 1 4\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["N = int(input()) # (0): N=5\nP = list(input(). split()) # (1): P=['1', '20', '1', '1', '4']\nQ = sorted(P) # (2): Q=['1', '1', '1', '20', '4']\ncnt = 0 # (3): cnt=0\ni = 0 # (4): i=0\n\nwhile cnt <= 2 and i < len(P): # (5): NO CHANGE (8): NO CHANGE ... (22): NO CHANGE\n if Q[i] != P[i]: # (6): NO CHANGE (9): NO CHANGE ... (20): NO CHANGE\n cnt += 1 # (10): cnt=1 (17): cnt=2\n i += 1 # (7): i=1 (11): i=2 ... (21): i=5\n\nif cnt <= 2: # (23): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")"], "anno_status": [true], "diff_content": " N = int(input())\n-P = list(input(). split())\n+P = list(map(int, input(). split()))\n Q = sorted(P)\n cnt = 0\n i = 0\n \n while cnt <= 2 and i < len(P):\n if Q[i] != P[i]:\n cnt += 1\n i += 1\n \n if cnt <= 2:\n print(\"YES\")\n else:\n print(\"NO\")\n", "FL_content": " N = int(input())\n-P = list(input(). split())\n Q = sorted(P)\n cnt = 0\n i = 0\n \n while cnt <= 2 and i < len(P):\n if Q[i] != P[i]:\n cnt += 1\n i += 1\n \n if cnt <= 2:\n print(\"YES\")\n else:\n print(\"NO\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u846652026", "problem_id": "p02958", "submission1_id": "s063239548", "submission2_id": "s561149442", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nl=list(map(int,input().split()))\nll=sorted(l)\ncnt=0\nfor l1,l2 in zip(l,ll):\n if l1 != l2:\n cnt+=1\n \nprint(\"Yes\" if cnt <= 2 else \"No\")", "code2": "n=int(input())\nl=list(map(int,input().split()))\nll=sorted(l)\ncnt=0\nfor l1,l2 in zip(l,ll):\n if l1 != l2:\n cnt+=1\n \nprint(\"YES\" if cnt <= 2 else \"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580423751", "date2": "1580423784", "bleu_score": "0.9626089486517121", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "5\n0 20 0 -2 0\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["n=int(input()) # (0): n=5\nl=list(map(int,input().split())) # (1): l=[0, 20, 0, -2, 0]\nll=sorted(l) # (2): ll=[-2, 0, 0, 0, 20]\ncnt=0 # (3): cnt=0\nfor l1,l2 in zip(l,ll): # (4): l1=0, l2=-2 (7): l1=20, l2=0 ... (18): NO CHANGE\n if l1 != l2: # (5): NO CHANGE (8): NO CHANGE ... (16): NO CHANGE\n cnt+=1 # (6): cnt=1 (9): cnt=2 ... (17): cnt=4\n \nprint(\"Yes\" if cnt <= 2 else \"No\")"], "anno_status": [true], "diff_content": " n=int(input())\n l=list(map(int,input().split()))\n ll=sorted(l)\n cnt=0\n for l1,l2 in zip(l,ll):\n if l1 != l2:\n cnt+=1\n \n-print(\"Yes\" if cnt <= 2 else \"No\")\n+print(\"YES\" if cnt <= 2 else \"NO\")\n", "FL_content": " n=int(input())\n l=list(map(int,input().split()))\n ll=sorted(l)\n cnt=0\n for l1,l2 in zip(l,ll):\n if l1 != l2:\n cnt+=1\n \n-print(\"Yes\" if cnt <= 2 else \"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u561231954", "problem_id": "p02958", "submission1_id": "s183157445", "submission2_id": "s195365721", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\narray=[int(i) for i in input().split()]\n\nmistake=[]\nfor i in range(n):\n if array[i]!=i+1:\n mistake.append([i+1,array[i]])\n\nans='Yes'\nk=len(mistake)\nif k>2:\n ans='No'\nelif k==2:\n if mistake[0][0]!=mistake[1][1]:\n ans='No'\n\nprint(ans)\n ", "code2": "n=int(input())\narray=[int(i) for i in input().split()]\n\nmistake=[]\nfor i in range(n):\n if array[i]!=i+1:\n mistake.append([i+1,array[i]])\n\nans='YES'\nk=len(mistake)\nif k>2:\n ans='NO'\nelif k==2:\n if mistake[0][0]!=mistake[1][1]:\n ans='NO'\n\nprint(ans)\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572904602", "date2": "1572904681", "bleu_score": "0.9671001210590896", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "5\n1 20 -1 -2 0\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["n=int(input()) # (0): n=5\narray=[int(i) for i in input().split()] # (1): array=[1, 20, -1, -2, 0]\n\nmistake=[] # (2): mistake=[]\nfor i in range(n): # (3): i=0 (5): i=1 ... (17): NO CHANGE\n if array[i]!=i+1: # (4): NO CHANGE (6): NO CHANGE ... (15): NO CHANGE\n mistake.append([i+1,array[i]]) # (7): mistake (10): mistake ... (16): mistake\n\nans='Yes' # (18): ans=Yes\nk=len(mistake) # (19): k=4\nif k>2: # (20): NO CHANGE\n ans='No' # (21): ans=No\nelif k==2:\n if mistake[0][0]!=mistake[1][1]:\n ans='No'\n\nprint(ans)\n "], "anno_status": [true], "diff_content": " n=int(input())\n array=[int(i) for i in input().split()]\n \n mistake=[]\n for i in range(n):\n if array[i]!=i+1:\n mistake.append([i+1,array[i]])\n \n-ans='Yes'\n+ans='YES'\n k=len(mistake)\n if k>2:\n- ans='No'\n+ ans='NO'\n elif k==2:\n if mistake[0][0]!=mistake[1][1]:\n- ans='No'\n+ ans='NO'\n \n print(ans)\n \n", "FL_content": " n=int(input())\n array=[int(i) for i in input().split()]\n \n mistake=[]\n for i in range(n):\n if array[i]!=i+1:\n mistake.append([i+1,array[i]])\n \n-ans='Yes'\n k=len(mistake)\n if k>2:\n- ans='No'\n elif k==2:\n if mistake[0][0]!=mistake[1][1]:\n- ans='No'\n \n print(ans)\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 18 }, { "user_id": "u987164499", "problem_id": "p02958", "submission1_id": "s881415164", "submission2_id": "s436191835", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\n\nn = int(stdin.readline().rstrip())\nli = list(map(int,stdin.readline().rstrip().split()))\nli_re = sorted(li)\n\npoint = 0\n\nwhile point < 2:\n for i in range(len(li)):\n if li_re[i] != li[i]:\n point += 1\n print(\"YES\")\n exit()\nprint(\"NO\")", "code2": "from sys import stdin\n\nn = int(stdin.readline().rstrip())\nli = list(map(int,stdin.readline().rstrip().split()))\nli_re = sorted(li)\n\npoint = 0\n\nfor i in range(len(li)):\n if li_re[i] != li[i]:\n point += 1\n\nif point > 2:\n print(\"NO\")\nelse:\n print(\"YES\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565906931", "date2": "1565907352", "bleu_score": "0.8883870735745846", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 1, "total_score": 100, "input": "5\n3 8 2 1 1\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " from sys import stdin\n \n n = int(stdin.readline().rstrip())\n li = list(map(int,stdin.readline().rstrip().split()))\n li_re = sorted(li)\n \n point = 0\n \n-while point < 2:\n- for i in range(len(li)):\n- if li_re[i] != li[i]:\n- point += 1\n+for i in range(len(li)):\n+ if li_re[i] != li[i]:\n+ point += 1\n+\n+if point > 2:\n+ print(\"NO\")\n+else:\n print(\"YES\")\n- exit()\n-print(\"NO\")\n", "FL_content": " from sys import stdin\n \n n = int(stdin.readline().rstrip())\n li = list(map(int,stdin.readline().rstrip().split()))\n li_re = sorted(li)\n \n point = 0\n \n-while point < 2:\n- for i in range(len(li)):\n- if li_re[i] != li[i]:\n- point += 1\n print(\"YES\")\n- exit()\n-print(\"NO\")\n", "added_lines": 7, "removed_lines": 6, "code1_lines": 15 }, { "user_id": "u298945776", "problem_id": "p02958", "submission1_id": "s054699481", "submission2_id": "s944331472", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import copy\n\nN = int(input())\nP = list(map(int, input().split()))\nX = copy.copy(P)\nY = copy.copy(P)\nX.sort()\n\ndef f(P):\n for i in range(N):\n for j in range(N):\n P = copy.copy(Y)\n P[i],P[j] = P[j],P[i]\n\n if X == P:\n return \"Yes\"\n return \"NO\"\n\nans = f(P)\nprint(ans)", "code2": "import copy\n\nN = int(input())\nP = list(map(int, input().split()))\nX = copy.copy(P)\n\nX.sort()\nans = \"NO\"\n\n\nfor i in range(N):\n for j in range(N):\n Y = copy.copy(P)\n a = copy.copy(P[i])\n b = copy.copy(P[j])\n Y[i] = b\n Y[j] = a\n \n if Y == X:\n ans = \"YES\"\n\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564276814", "date2": "1564280437", "bleu_score": "0.8017645682074367", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 99, "total_score": 100, "input": "5\n5 2 3 4 1\n", "actual_output": "Yes\n", "expected_output": "YES\n", "anno_code": ["import copy\n\nN = int(input()) # (0): N=5\nP = list(map(int, input().split())) # (1): P=[5, 2, 3, 4, 1]\nX = copy.copy(P) # (2): X=[5, 2, 3, 4, 1]\nY = copy.copy(P) # (3): Y=[5, 2, 3, 4, 1]\nX.sort() # (4): X=[1, 2, 3, 4, 5]\n\ndef f(P): # (5): f=\n for i in range(N): # (7): i=0\n for j in range(N): # (8): j=0 (12): j=1 ... (24): j=4\n P = copy.copy(Y) # (9): NO CHANGE (13): NO CHANGE ... (25): P=[5, 2, 3, 4, 1]\n P[i],P[j] = P[j],P[i] # (10): NO CHANGE (14): P=[2, 5, 3, 4, 1] ... (26): P=[1, 2, 3, 4, 5]\n\n if X == P: # (11): NO CHANGE (15): NO CHANGE ... (27): copy=, N=5, P=[5, 2, 3, 4, 1], X=[1, 2, 3, 4, 5], Y=[5, 2, 3, 4, 1], f=, ans=Yes\n return \"Yes\"\n return \"NO\"\n\nans = f(P) # (6): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " import copy\n \n N = int(input())\n P = list(map(int, input().split()))\n X = copy.copy(P)\n-Y = copy.copy(P)\n+\n X.sort()\n+ans = \"NO\"\n+\n \n-def f(P):\n- for i in range(N):\n- for j in range(N):\n- P = copy.copy(Y)\n- P[i],P[j] = P[j],P[i]\n+for i in range(N):\n+ for j in range(N):\n+ Y = copy.copy(P)\n+ a = copy.copy(P[i])\n+ b = copy.copy(P[j])\n+ Y[i] = b\n+ Y[j] = a\n+ \n+ if Y == X:\n+ ans = \"YES\"\n \n- if X == P:\n- return \"Yes\"\n- return \"NO\"\n \n-ans = f(P)\n print(ans)\n", "FL_content": " import copy\n \n N = int(input())\n P = list(map(int, input().split()))\n X = copy.copy(P)\n-Y = copy.copy(P)\n X.sort()\n \n-def f(P):\n- for i in range(N):\n- for j in range(N):\n- P = copy.copy(Y)\n- P[i],P[j] = P[j],P[i]\n \n- if X == P:\n- return \"Yes\"\n- return \"NO\"\n \n-ans = f(P)\n print(ans)\n", "added_lines": 13, "removed_lines": 10, "code1_lines": 20 }, { "user_id": "u597455618", "problem_id": "p02958", "submission1_id": "s711958904", "submission2_id": "s299471696", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\np = list(map(int, input().split()))\ncnt = 0\ncheck = 0\nfor i in range(n-1):\n if p[i+1] - p[i] == 1:\n cnt += 1\n else :\n check += 1\n \nif (cnt == n-1) or (check == 2 and cnt == n-3) :\n print(\"YES\")\nelse:\n print(\"NO\") ", "code2": "n = int(input())\np = list(map(int, input().split()))\ncnt = 0\nfor i in range(n):\n if p[i] != i + 1:\n cnt += 1\n \nif cnt == 0 or cnt == 2 :\n print(\"YES\")\nelse:\n print(\"NO\") ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567899844", "date2": "1567903556", "bleu_score": "0.6535950980553915", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 98, "total_score": 100, "input": "5\n3 4 3 4 1\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["n = int(input()) # (0): n=5\np = list(map(int, input().split())) # (1): p=[3, 4, 3, 4, 1]\ncnt = 0 # (2): cnt=0\ncheck = 0 # (3): check=0\nfor i in range(n-1): # (4): i=0 (7): i=1 ... (16): NO CHANGE\n if p[i+1] - p[i] == 1: # (5): NO CHANGE (8): NO CHANGE ... (14): NO CHANGE\n cnt += 1 # (6): cnt=1 (12): cnt=2\n else :\n check += 1 # (9): check=1 (15): check=2\n \nif (cnt == n-1) or (check == 2 and cnt == n-3) : # (17): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\") "], "anno_status": [true], "diff_content": " n = int(input())\n p = list(map(int, input().split()))\n cnt = 0\n-check = 0\n-for i in range(n-1):\n- if p[i+1] - p[i] == 1:\n+for i in range(n):\n+ if p[i] != i + 1:\n cnt += 1\n- else :\n- check += 1\n \n-if (cnt == n-1) or (check == 2 and cnt == n-3) :\n+if cnt == 0 or cnt == 2 :\n print(\"YES\")\n else:\n print(\"NO\") \n", "FL_content": " n = int(input())\n p = list(map(int, input().split()))\n cnt = 0\n-check = 0\n-for i in range(n-1):\n- if p[i+1] - p[i] == 1:\n cnt += 1\n- else :\n- check += 1\n \n-if (cnt == n-1) or (check == 2 and cnt == n-3) :\n print(\"YES\")\n else:\n print(\"NO\") \n", "added_lines": 3, "removed_lines": 6, "code1_lines": 14 }, { "user_id": "u564464686", "problem_id": "p02237", "submission1_id": "s751826870", "submission2_id": "s013499847", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nG=[[0 for i in range(n)]for j in range(n)]\nu=[0 for i in range(n)]\nfor i in range(n):\n A=input().split()\n u[i]=int(A[0])\n k=int(A[1])\n for j in range(k):\n x=int(A[j+2])-1\n G[i][x]=1\nprint(G)\n\n", "code2": "n=int(input())\nG=[[0 for i in range(n)]for j in range(n)]\nu=[0 for i in range(n)]\nfor i in range(n):\n A=input().split()\n u[i]=int(A[0])\n k=int(A[1])\n for j in range(k):\n x=int(A[j+2])-1\n G[i][x]=1\nfor i in range(n):\n for j in range(n):\n if j0:\n\t\tfor j in range(2,len(a)):\n\t\t\tlist1[i][a[j]-1]=1\n\t\t\t\nprint(list1)\n\n\n", "code2": "\nn=int(input())\nlist1=[[0 for i in range(n)] for j in range(n)]\n\n\nfor i in range(n):\n\ta=list(map(int,input().split()))\n\t\n\tif a[1]>0:\n\t\tfor j in range(2,len(a)):\n\t\t\tlist1[i][a[j]-1]=1\n\t\t\t\nfor i in range(n):\n\tprint(*list1[i])\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1529748522", "date2": "1529748840", "bleu_score": "0.8733475046554567", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "4\n1 2 1 4\n2 1 4\n3 -4\n0 1 4\n", "actual_output": "[[1, 0, 0, 1], [0, 0, 0, 1], [0, 0, 0, 0], [0, 0, 0, 1]]\n", "expected_output": "1 0 0 1\n0 0 0 1\n0 0 0 0\n0 0 0 1\n\n", "anno_code": ["\n\n\n\nn=int(input()) # (0): n=4\nlist1=[[0 for i in range(n)] for j in range(n)] # (1): list1\n\n\nfor i in range(n): # (2): i=0 (10): i=1 ... (25): NO CHANGE\n\ta=list(map(int,input().split())) # (3): a=[1, 2, 1, 4] (11): a=[2, 1, 4] ... (20): a=[0, 1, 4]\n\t\n\tif a[1]>0: # (4): NO CHANGE (12): NO CHANGE ... (21): NO CHANGE\n\t\tfor j in range(2,len(a)): # (5): j=2 (7): j=3 ... (24): NO CHANGE\n\t\t\tlist1[i][a[j]-1]=1 # (6): list1 (8): list1 ... (23): list1\n\t\t\t\nprint(list1)\n\n\n"], "anno_status": [true], "diff_content": " \n-\n-\n-\n n=int(input())\n list1=[[0 for i in range(n)] for j in range(n)]\n \n \n for i in range(n):\n \ta=list(map(int,input().split()))\n \t\n \tif a[1]>0:\n \t\tfor j in range(2,len(a)):\n \t\t\tlist1[i][a[j]-1]=1\n \t\t\t\n-print(list1)\n-\n+for i in range(n):\n+\tprint(*list1[i])\n \n \n", "FL_content": " \n-\n-\n-\n n=int(input())\n list1=[[0 for i in range(n)] for j in range(n)]\n \n \n for i in range(n):\n \ta=list(map(int,input().split()))\n \t\n \tif a[1]>0:\n \t\tfor j in range(2,len(a)):\n \t\t\tlist1[i][a[j]-1]=1\n \t\t\t\n-print(list1)\n-\n \n \n", "added_lines": 2, "removed_lines": 5, "code1_lines": 19 }, { "user_id": "u564398841", "problem_id": "p02237", "submission1_id": "s975217761", "submission2_id": "s776458618", "status1": "Wrong Answer", "status2": "Accepted", "code1": "if __name__ == '__main__':\n N = int(input())\n matrix = [[0] * N for _ in range(N)]\n for i in matrix:\n node_info = [int(i) for i in input().split()]\n node_i = node_info[0] - 1\n if not node_info[1] == 0:\n for i in node_info[2:]:\n matrix[node_i][i-1] = 1\n [print(line) for line in matrix]", "code2": "if __name__ == '__main__':\n N = int(input())\n matrix = [['0'] * N for _ in range(N)]\n for i in matrix:\n node_info = [int(i) for i in input().split()]\n node_i = node_info[0] - 1\n if not node_info[1] == 0:\n for i in node_info[2:]:\n matrix[node_i][i - 1] = '1'\n [print(' '.join(line)) for line in matrix]", "original_language1": "Python3", "original_language2": "Python3", "date1": "1485070101", "date2": "1485070335", "bleu_score": "0.9328451896549952", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "4\n1 2 1 4\n2 1 4\n1 -1\n4 1 3\n", "actual_output": "[1, 0, 0, 1]\n[0, 0, 0, 1]\n[0, 0, 0, 0]\n[0, 0, 1, 0]\n", "expected_output": "1 0 0 1\n0 0 0 1\n0 0 0 0\n0 0 1 0\n\n", "anno_code": ["if __name__ == '__main__':\n N = int(input())\n matrix = [[0] * N for _ in range(N)]\n for i in matrix:\n node_info = [int(i) for i in input().split()]\n node_i = node_info[0] - 1\n if not node_info[1] == 0:\n for i in node_info[2:]:\n matrix[node_i][i-1] = 1\n [print(line) for line in matrix]"], "anno_status": [true], "diff_content": " if __name__ == '__main__':\n N = int(input())\n- matrix = [[0] * N for _ in range(N)]\n+ matrix = [['0'] * N for _ in range(N)]\n for i in matrix:\n node_info = [int(i) for i in input().split()]\n node_i = node_info[0] - 1\n if not node_info[1] == 0:\n for i in node_info[2:]:\n- matrix[node_i][i-1] = 1\n- [print(line) for line in matrix]\n+ matrix[node_i][i - 1] = '1'\n+ [print(' '.join(line)) for line in matrix]\n", "FL_content": " if __name__ == '__main__':\n N = int(input())\n- matrix = [[0] * N for _ in range(N)]\n for i in matrix:\n node_info = [int(i) for i in input().split()]\n node_i = node_info[0] - 1\n if not node_info[1] == 0:\n for i in node_info[2:]:\n- matrix[node_i][i-1] = 1\n- [print(line) for line in matrix]\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 10 }, { "user_id": "u193453446", "problem_id": "p02237", "submission1_id": "s181000092", "submission2_id": "s677680318", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n num = int(input())\n T = [[0] * num for i in range(num)]\n for n in range(num):\n a = list(map(int,input().split()))\n u = a[0] - 1\n if a[1] > 0:\n for i in a[2:]:\n print(i)\n T[u][i-1] = 1\n\n for i in range(num):\n print(\" \".join(map(str,T[i])))\n\nif __name__ == '__main__':\n main()", "code2": "def main():\n num = int(input())\n T = [[0] * num for i in range(num)]\n for n in range(num):\n a = list(map(int,input().split()))\n u = a[0] - 1\n if a[1] > 0:\n for i in a[2:]:\n T[u][i-1] = 1\n\n for i in range(num):\n print(\" \".join(map(str,T[i])))\n\nif __name__ == '__main__':\n main()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1504760494", "date2": "1504760536", "bleu_score": "0.930294259087581", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "4\n1 2 1 4\n2 1 4\n1 -1\n4 1 3\n", "actual_output": "1\n4\n4\n3\n1 0 0 1\n0 0 0 1\n0 0 0 0\n0 0 1 0\n", "expected_output": "1 0 0 1\n0 0 0 1\n0 0 0 0\n0 0 1 0\n\n", "anno_code": ["def main(): # (0): main=\n num = int(input())\n T = [[0] * num for i in range(num)]\n for n in range(num):\n a = list(map(int,input().split()))\n u = a[0] - 1\n if a[1] > 0:\n for i in a[2:]:\n print(i)\n T[u][i-1] = 1\n\n for i in range(num):\n print(\" \".join(map(str,T[i])))\n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " def main():\n num = int(input())\n T = [[0] * num for i in range(num)]\n for n in range(num):\n a = list(map(int,input().split()))\n u = a[0] - 1\n if a[1] > 0:\n for i in a[2:]:\n- print(i)\n T[u][i-1] = 1\n \n for i in range(num):\n print(\" \".join(map(str,T[i])))\n \n if __name__ == '__main__':\n main()\n", "FL_content": " def main():\n num = int(input())\n T = [[0] * num for i in range(num)]\n for n in range(num):\n a = list(map(int,input().split()))\n u = a[0] - 1\n if a[1] > 0:\n for i in a[2:]:\n- print(i)\n T[u][i-1] = 1\n \n for i in range(num):\n print(\" \".join(map(str,T[i])))\n \n if __name__ == '__main__':\n main()\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u648595404", "problem_id": "p02237", "submission1_id": "s111968184", "submission2_id": "s552062559", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nfor i in range(n):\n node = list(map(int,input().split()))\n node_list = node[2:]\n matrix = [0] * n\n for j in node_list:\n matrix[j -1] = 1\n print(\"\".join(str(matrix)))", "code2": "n = int(input())\nfor i in range(n):\n node = list(map(int,input().split()))\n node_list = node[2:]\n matrix = [\"0\"]* n\n\n for j in node_list:\n matrix[j -1] = \"1\"\n print(\" \".join(matrix))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1458608979", "date2": "1458830971", "bleu_score": "0.9301637122366813", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "4\n1 2 1 2\n2 1 1\n0 -2\n4 1 2\n", "actual_output": "[1, 1, 0, 0]\n[1, 0, 0, 0]\n[0, 0, 0, 0]\n[0, 1, 0, 0]\n", "expected_output": "1 1 0 0\n1 0 0 0\n0 0 0 0\n0 1 0 0\n\n", "anno_code": ["n = int(input()) # (0): n=4\nfor i in range(n): # (1): i=0 (11): i=1 ... (25): i=3\n node = list(map(int,input().split())) # (2): node=[1, 2, 1, 2] (12): node=[2, 1, 1] ... (26): node=[4, 1, 2]\n node_list = node[2:] # (3): node_list=[1, 2] (13): node_list=[1] ... (27): node_list=[2]\n matrix = [0] * n # (4): matrix=[0, 0, 0, 0] (14): matrix=[0, 0, 0, 0] ... (28): NO CHANGE\n for j in node_list: # (5): j=1 (7): j=2 ... (31): NO CHANGE\n matrix[j -1] = 1 # (6): matrix=[1, 0, 0, 0] (8): matrix=[1, 1, 0, 0] ... (30): matrix=[0, 1, 0, 0]\n print(\"\".join(str(matrix))) # (10): NO CHANGE (18): NO CHANGE ... (32): NO CHANGE\n"], "anno_status": [true], "diff_content": " n = int(input())\n for i in range(n):\n node = list(map(int,input().split()))\n node_list = node[2:]\n- matrix = [0] * n\n+ matrix = [\"0\"]* n\n+\n for j in node_list:\n- matrix[j -1] = 1\n- print(\"\".join(str(matrix)))\n+ matrix[j -1] = \"1\"\n+ print(\" \".join(matrix))\n", "FL_content": " n = int(input())\n for i in range(n):\n node = list(map(int,input().split()))\n node_list = node[2:]\n- matrix = [0] * n\n for j in node_list:\n- matrix[j -1] = 1\n- print(\"\".join(str(matrix)))\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u473666214", "problem_id": "p02318", "submission1_id": "s744611382", "submission2_id": "s986289136", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s_1 = input()\ns_2 = input()\n\nmemo = [[0 for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)]\nflag = [[False for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)]\n\nfor i in range(1, len(s_1)+1):\n for j in range(1, len(s_2)+1):\n if not flag[i][j]:\n flag[i][j] = True\n if s_1[i-1] == s_2[j-1]:\n memo[i][j] = min(memo[i-1][j-1], memo[i][j-1]+1)\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1)\n else:\n memo[i][j] = min(memo[i-1][j-1]+1, memo[i][j-1]+1)\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1)\n\nprint(memo[len(s_1)][len(s_2)])\n\n\n\n\n", "code2": "s_1 = input()\ns_2 = input()\n\nmemo = [[0 for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)]\nflag = [[False for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)]\n\nfor i in range(1, len(s_1)+1):\n memo[i][0] = i\nfor j in range(1, len(s_2)+1):\n memo[0][j] = j\n\nfor i in range(1, len(s_1)+1):\n for j in range(1, len(s_2)+1):\n if not flag[i][j]:\n flag[i][j] = True\n if s_1[i-1] == s_2[j-1]:\n memo[i][j] = min(memo[i-1][j-1], memo[i][j-1]+1)\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1)\n else:\n memo[i][j] = min(memo[i-1][j-1]+1, memo[i][j-1]+1)\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1)\n\nprint(memo[len(s_1)][len(s_2)])\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1540527595", "date2": "1540528060", "bleu_score": "0.8644021963197996", "code1_test_status": [1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0], "code1_test_score": 36, "total_score": 102, "input": "bd`c\ndcn\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["s_1 = input() # (0): s_1=bd`c\ns_2 = input() # (1): s_2=dcn\n\nmemo = [[0 for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)] # (2): memo\nflag = [[False for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)] # (3): flag\n\nfor i in range(1, len(s_1)+1): # (4): i=1 (24): i=2 ... (84): NO CHANGE\n for j in range(1, len(s_2)+1): # (5): j=1 (11): j=2 ... (83): NO CHANGE\n if not flag[i][j]: # (6): NO CHANGE (12): NO CHANGE ... (78): NO CHANGE\n flag[i][j] = True # (7): flag (13): flag ... (79): flag\n if s_1[i-1] == s_2[j-1]: # (8): NO CHANGE (14): NO CHANGE ... (80): NO CHANGE\n memo[i][j] = min(memo[i-1][j-1], memo[i][j-1]+1) # (29): NO CHANGE (75): memo\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1) # (30): NO CHANGE (76): NO CHANGE\n else:\n memo[i][j] = min(memo[i-1][j-1]+1, memo[i][j-1]+1) # (9): memo (15): memo ... (81): memo\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1) # (10): NO CHANGE (16): NO CHANGE ... (82): NO CHANGE\n\nprint(memo[len(s_1)][len(s_2)])\n\n\n\n\n"], "anno_status": [true], "diff_content": " s_1 = input()\n s_2 = input()\n \n memo = [[0 for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)]\n flag = [[False for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)]\n \n+for i in range(1, len(s_1)+1):\n+ memo[i][0] = i\n+for j in range(1, len(s_2)+1):\n+ memo[0][j] = j\n+\n for i in range(1, len(s_1)+1):\n for j in range(1, len(s_2)+1):\n if not flag[i][j]:\n flag[i][j] = True\n if s_1[i-1] == s_2[j-1]:\n memo[i][j] = min(memo[i-1][j-1], memo[i][j-1]+1)\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1)\n else:\n memo[i][j] = min(memo[i-1][j-1]+1, memo[i][j-1]+1)\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1)\n \n print(memo[len(s_1)][len(s_2)])\n \n \n-\n-\n-\n", "FL_content": " s_1 = input()\n s_2 = input()\n \n memo = [[0 for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)]\n flag = [[False for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)]\n \n for i in range(1, len(s_1)+1):\n for j in range(1, len(s_2)+1):\n if not flag[i][j]:\n flag[i][j] = True\n if s_1[i-1] == s_2[j-1]:\n memo[i][j] = min(memo[i-1][j-1], memo[i][j-1]+1)\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1)\n else:\n memo[i][j] = min(memo[i-1][j-1]+1, memo[i][j-1]+1)\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1)\n \n print(memo[len(s_1)][len(s_2)])\n \n \n-\n-\n-\n", "added_lines": 5, "removed_lines": 3, "code1_lines": 23 }, { "user_id": "u584093205", "problem_id": "p02318", "submission1_id": "s628110434", "submission2_id": "s058002525", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def ans(n, m):\n ln = len(n)\n lm = len(m)\n dp = [list(range(lm+1)) for i in range(ln+1)]\n \n for i in range(ln+1):\n dp[i][0] = i\n for j in range(lm+1):\n dp[0][j] = j\n for i in range(1,ln+1):\n for j in range(1,lm+1):\n if n[i-1] == m[j-1]:\n dp[i][j] = dp[i-1][j-1]\n else:\n dp[i][j] = min(dp[i][j-1]+1, dp[i-1][j]+1, dp[i][j]+1, dp[i-1][j-1]+1)\n return dp[-1][-1]\nn = input()\nm = input()\nprint(ans(n, m))\n", "code2": "def ans(n, m):\n ln = len(n)\n lm = len(m)\n dp = [[0] * (lm+1) for _ in range(ln+1)]\n \n for i in range(ln+1):\n dp[i][0] = i\n for j in range(lm+1):\n dp[0][j] = j\n for i in range(1,ln+1):\n for j in range(1,lm+1):\n if n[i-1] == m[j-1]:\n dp[i][j] = dp[i-1][j-1]\n else:\n dp[i][j] = min(dp[i][j-1]+1, dp[i-1][j]+1, dp[i-1][j-1]+1)\n return dp[-1][-1]\nn = input()\nm = input()\nprint(ans(n, m))\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1527746718", "date2": "1527747322", "bleu_score": "0.9449768214984167", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 100, "total_score": 102, "input": "bd`c\nncd\n", "actual_output": "3\n", "expected_output": "4\n\n", "anno_code": ["def ans(n, m): # (0): ans=\n ln = len(n) # (4): ln=4\n lm = len(m) # (5): lm=3\n dp = [list(range(lm+1)) for i in range(ln+1)] # (6): dp\n \n for i in range(ln+1): # (7): i=0 (9): i=1 ... (17): NO CHANGE\n dp[i][0] = i # (8): NO CHANGE (10): dp ... (16): dp\n for j in range(lm+1): # (18): j=0 (20): j=1 ... (26): NO CHANGE\n dp[0][j] = j # (19): NO CHANGE (21): NO CHANGE ... (25): NO CHANGE\n for i in range(1,ln+1): # (27): i=1 (38): i=2 ... (60): i=4\n for j in range(1,lm+1): # (28): j=1 (31): j=2 ... (70): NO CHANGE\n if n[i-1] == m[j-1]: # (29): NO CHANGE (32): NO CHANGE ... (68): NO CHANGE\n dp[i][j] = dp[i-1][j-1] # (47): dp (66): NO CHANGE\n else:\n dp[i][j] = min(dp[i][j-1]+1, dp[i-1][j]+1, dp[i][j]+1, dp[i-1][j-1]+1) # (30): NO CHANGE (33): NO CHANGE ... (69): NO CHANGE\n return dp[-1][-1]\nn = input() # (1): n=bd`c\nm = input() # (2): m=ncd\nprint(ans(n, m)) # (3): NO CHANGE\n"], "anno_status": [true], "diff_content": " def ans(n, m):\n ln = len(n)\n lm = len(m)\n- dp = [list(range(lm+1)) for i in range(ln+1)]\n+ dp = [[0] * (lm+1) for _ in range(ln+1)]\n \n for i in range(ln+1):\n dp[i][0] = i\n for j in range(lm+1):\n dp[0][j] = j\n for i in range(1,ln+1):\n for j in range(1,lm+1):\n if n[i-1] == m[j-1]:\n dp[i][j] = dp[i-1][j-1]\n else:\n- dp[i][j] = min(dp[i][j-1]+1, dp[i-1][j]+1, dp[i][j]+1, dp[i-1][j-1]+1)\n+ dp[i][j] = min(dp[i][j-1]+1, dp[i-1][j]+1, dp[i-1][j-1]+1)\n return dp[-1][-1]\n n = input()\n m = input()\n print(ans(n, m))\n \n", "FL_content": " def ans(n, m):\n ln = len(n)\n lm = len(m)\n- dp = [list(range(lm+1)) for i in range(ln+1)]\n \n for i in range(ln+1):\n dp[i][0] = i\n for j in range(lm+1):\n dp[0][j] = j\n for i in range(1,ln+1):\n for j in range(1,lm+1):\n if n[i-1] == m[j-1]:\n dp[i][j] = dp[i-1][j-1]\n else:\n- dp[i][j] = min(dp[i][j-1]+1, dp[i-1][j]+1, dp[i][j]+1, dp[i-1][j-1]+1)\n return dp[-1][-1]\n n = input()\n m = input()\n print(ans(n, m))\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 20 }, { "user_id": "u554572515", "problem_id": "p02318", "submission1_id": "s522011358", "submission2_id": "s618536475", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef ED():\n X = \" \" + input()\n Y = \" \" + input()\n ed = [[0]*(len(X)) for _ in range(len(Y))]\n for j in range(len(X)):\n for i in range(len(Y)):\n if (i == j == 0):\n continue\n if (X[j] == Y[i]):\n ed[i][j] = ed[i-1][j-1]\n else:\n if(j > i):\n ed[i][j] = ed[i][j-1] + 1\n elif(j < i):\n ed[i][j] = ed[i-1][j] + 1\n elif(j == i):\n ed[i][j] = ed[i-1][j-1] + 1\n return ed[len(Y)-1][len(X)-1]\n\nif __name__ == '__main__':\n print(ED())", "code2": "\ndef ED():\n X = \" \" + input()\n Y = \" \" + input()\n ed = [[float(\"inf\")]*(len(X)) for _ in range(len(Y))]\n \n for j in range(len(X)):\n ed[0][j] = j\n for i in range(len(Y)):\n ed[i][0] = i\n \n for j in range(1, len(X)):\n for i in range(1, len(Y)):\n if (X[j] == Y[i]):\n ed[i][j] = ed[i-1][j-1]\n else:\n ed[i][j] = min(ed[i-1][j-1], ed[i][j-1], ed[i-1][j]) + 1\n \n return ed[len(Y)-1][len(X)-1]\n\nif __name__ == '__main__':\n print(ED())", "original_language1": "Python3", "original_language2": "Python3", "date1": "1491639391", "date2": "1491643654", "bleu_score": "0.7554884287574655", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1], "code1_test_score": 91, "total_score": 102, "input": "bd`c\ndcn\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["\ndef ED(): # (0): ED=\n X = \" \" + input()\n Y = \" \" + input()\n ed = [[0]*(len(X)) for _ in range(len(Y))]\n for j in range(len(X)):\n for i in range(len(Y)):\n if (i == j == 0):\n continue\n if (X[j] == Y[i]):\n ed[i][j] = ed[i-1][j-1]\n else:\n if(j > i):\n ed[i][j] = ed[i][j-1] + 1\n elif(j < i):\n ed[i][j] = ed[i-1][j] + 1\n elif(j == i):\n ed[i][j] = ed[i-1][j-1] + 1\n return ed[len(Y)-1][len(X)-1]\n\nif __name__ == '__main__':\n print(ED())"], "anno_status": [true], "diff_content": " \n def ED():\n X = \" \" + input()\n Y = \" \" + input()\n- ed = [[0]*(len(X)) for _ in range(len(Y))]\n+ ed = [[float(\"inf\")]*(len(X)) for _ in range(len(Y))]\n+ \n for j in range(len(X)):\n- for i in range(len(Y)):\n- if (i == j == 0):\n- continue\n+ ed[0][j] = j\n+ for i in range(len(Y)):\n+ ed[i][0] = i\n+ \n+ for j in range(1, len(X)):\n+ for i in range(1, len(Y)):\n if (X[j] == Y[i]):\n ed[i][j] = ed[i-1][j-1]\n else:\n- if(j > i):\n- ed[i][j] = ed[i][j-1] + 1\n- elif(j < i):\n- ed[i][j] = ed[i-1][j] + 1\n- elif(j == i):\n- ed[i][j] = ed[i-1][j-1] + 1\n+ ed[i][j] = min(ed[i-1][j-1], ed[i][j-1], ed[i-1][j]) + 1\n+ \n return ed[len(Y)-1][len(X)-1]\n \n if __name__ == '__main__':\n print(ED())\n", "FL_content": " \n def ED():\n X = \" \" + input()\n Y = \" \" + input()\n- ed = [[0]*(len(X)) for _ in range(len(Y))]\n for j in range(len(X)):\n- for i in range(len(Y)):\n- if (i == j == 0):\n- continue\n if (X[j] == Y[i]):\n ed[i][j] = ed[i-1][j-1]\n else:\n- if(j > i):\n- ed[i][j] = ed[i][j-1] + 1\n- elif(j < i):\n- ed[i][j] = ed[i-1][j] + 1\n- elif(j == i):\n- ed[i][j] = ed[i-1][j-1] + 1\n return ed[len(Y)-1][len(X)-1]\n \n if __name__ == '__main__':\n print(ED())\n", "added_lines": 10, "removed_lines": 10, "code1_lines": 22 }, { "user_id": "u405027099", "problem_id": "p02318", "submission1_id": "s742560898", "submission2_id": "s517676136", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n for i in range(len(X)+1):\n f[i][0]=i\n for j in range(1,len(Y)+1):\n f[0][j]=j\n for i in range(1,len(X)+1):\n for j in range(len(Y)+1):\n if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n\nX=input()\nY=input()\n\nprint(levenshtein(X,Y))\n", "code2": "def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n for i in range(len(X)+1):\n f[i][0]=i\n for j in range(len(Y)+1):\n f[0][j]=j\n for i in range(1,len(X)+1):\n for j in range(1,len(Y)+1):\n if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n\nX=input()\nY=input()\n\nprint(levenshtein(X,Y))\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1531820515", "date2": "1531820628", "bleu_score": "0.9980099403873665", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 93, "total_score": 102, "input": "ipcb\nckbo\n", "actual_output": "3\n", "expected_output": "4\n\n", "anno_code": ["def levenshtein(X,Y): # (0): levenshtein=\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)] # (4): f\n for i in range(len(X)+1): # (5): i=0 (7): i=1 ... (15): NO CHANGE\n f[i][0]=i # (6): NO CHANGE (8): f ... (14): f\n for j in range(1,len(Y)+1): # (16): j=1 (18): j=2 ... (24): NO CHANGE\n f[0][j]=j # (17): f (19): f ... (23): f\n for i in range(1,len(X)+1): # (25): i=1 (42): i=2 ... (76): i=4\n for j in range(len(Y)+1): # (26): j=0 (29): j=1 ... (92): NO CHANGE\n if X[i-1]==Y[j-1]: # (27): NO CHANGE (30): NO CHANGE ... (90): NO CHANGE\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]) # (65): f (88): f\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1) # (28): NO CHANGE (31): f ... (91): f\n return f[len(X)][len(Y)]\n\nX=input() # (1): X=ipcb\nY=input() # (2): Y=ckbo\n\nprint(levenshtein(X,Y)) # (3): NO CHANGE\n"], "anno_status": [true], "diff_content": " def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n for i in range(len(X)+1):\n f[i][0]=i\n- for j in range(1,len(Y)+1):\n+ for j in range(len(Y)+1):\n f[0][j]=j\n for i in range(1,len(X)+1):\n- for j in range(len(Y)+1):\n+ for j in range(1,len(Y)+1):\n if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n \n X=input()\n Y=input()\n \n print(levenshtein(X,Y))\n \n+\n", "FL_content": " def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n for i in range(len(X)+1):\n f[i][0]=i\n- for j in range(1,len(Y)+1):\n f[0][j]=j\n for i in range(1,len(X)+1):\n- for j in range(len(Y)+1):\n if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n \n X=input()\n Y=input()\n \n print(levenshtein(X,Y))\n \n", "added_lines": 3, "removed_lines": 2, "code1_lines": 19 }, { "user_id": "u896240461", "problem_id": "p02318", "submission1_id": "s143843683", "submission2_id": "s163334525", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s1 = input()\ns2 = input()\nx = [[0 for i in range(len(s2))]for j in range(len(s1))]\n\ndef g(i,j):\n if i == 0 or j == 0:\n if s1[i] == s2[j]:\n x[i][j] = abs(i-j)\n else:\n if i == 0:\n x[i][j] = x[i][j-1] + 1\n else:\n x[i][j] = x[i-1][j] + 1\n elif s1[i] == s2[j]:\n x[i][j] = x[i-1][j-1]\n else:\n x[i][j] = min(x[i][j-1] + 1,x[i-1][j] + 1)\n \n\nfor i in range(len(s1)):\n for j in range(len(s2)):\n g(i,j)\n\nprint(x[len(s1)-1][len(s2)-1])\n", "code2": "s1 = input()\ns2 = input()\nx = [[0 for i in range(len(s2))]for j in range(len(s1))]\n\ndef g(i,j):\n if i == 0 or j == 0:\n if s1[i] == s2[j]:\n x[i][j] = abs(i-j)\n else:\n if i == 0:\n x[i][j] = x[i][j-1] + 1\n else:\n x[i][j] = x[i-1][j] + 1\n elif s1[i] == s2[j]:\n x[i][j] = min(x[i-1][j-1],x[i][j-1]+1,x[i-1][j]+1)\n else:\n x[i][j] = min(x[i-1][j-1]+1,x[i][j-1]+1,x[i-1][j]+1)\n \n\nfor i in range(len(s1)):\n for j in range(len(s2)):\n g(i,j)\n\nprint(x[len(s1)-1][len(s2)-1])\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1531298679", "date2": "1531298894", "bleu_score": "0.9126424142721763", "code1_test_status": [1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0], "code1_test_score": 21, "total_score": 102, "input": "rbia\nalcm\n", "actual_output": "6\n", "expected_output": "4\n\n", "anno_code": ["s1 = input() # (0): s1=rbia\ns2 = input() # (1): s2=alcm\nx = [[0 for i in range(len(s2))]for j in range(len(s1))] # (2): x\n\ndef g(i,j): # (3): g=\n if i == 0 or j == 0: # (7): NO CHANGE (13): NO CHANGE ... (94): NO CHANGE\n if s1[i] == s2[j]: # (8): NO CHANGE (14): NO CHANGE ... (80): NO CHANGE\n x[i][j] = abs(i-j) # (81): s1=rbia, s2=alcm, x, g=\n else:\n if i == 0: # (9): NO CHANGE (15): NO CHANGE ... (58): NO CHANGE\n x[i][j] = x[i][j-1] + 1 # (10): s1=rbia, s2=alcm, x=[[1, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]], g= (16): s1=rbia, s2=alcm, x=[[1, 2, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]], g= ... (28): s1=rbia, s2=alcm, x, g=\n else:\n x[i][j] = x[i-1][j] + 1 # (36): s1=rbia, s2=alcm, x=[[1, 2, 3, 4], [2, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]], g= (59): s1=rbia, s2=alcm, x, g=\n elif s1[i] == s2[j]: # (40): NO CHANGE (45): NO CHANGE ... (95): NO CHANGE\n x[i][j] = x[i-1][j-1]\n else:\n x[i][j] = min(x[i][j-1] + 1,x[i-1][j] + 1) # (41): s1=rbia, s2=alcm, x=[[1, 2, 3, 4], [2, 3, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]], g= (46): s1=rbia, s2=alcm, x=[[1, 2, 3, 4], [2, 3, 4, 0], [0, 0, 0, 0], [0, 0, 0, 0]], g= ... (96): s1=rbia, s2=alcm, x, g=\n \n\nfor i in range(len(s1)): # (4): i=0 (30): i=1 ... (98): NO CHANGE\n for j in range(len(s2)): # (5): j=0 (11): j=1 ... (97): NO CHANGE\n g(i,j) # (6): NO CHANGE (12): NO CHANGE ... (93): NO CHANGE\n\nprint(x[len(s1)-1][len(s2)-1])\n"], "anno_status": [true], "diff_content": " s1 = input()\n s2 = input()\n x = [[0 for i in range(len(s2))]for j in range(len(s1))]\n \n def g(i,j):\n if i == 0 or j == 0:\n if s1[i] == s2[j]:\n x[i][j] = abs(i-j)\n else:\n if i == 0:\n x[i][j] = x[i][j-1] + 1\n else:\n x[i][j] = x[i-1][j] + 1\n elif s1[i] == s2[j]:\n- x[i][j] = x[i-1][j-1]\n+ x[i][j] = min(x[i-1][j-1],x[i][j-1]+1,x[i-1][j]+1)\n else:\n- x[i][j] = min(x[i][j-1] + 1,x[i-1][j] + 1)\n+ x[i][j] = min(x[i-1][j-1]+1,x[i][j-1]+1,x[i-1][j]+1)\n \n \n for i in range(len(s1)):\n for j in range(len(s2)):\n g(i,j)\n \n print(x[len(s1)-1][len(s2)-1])\n \n", "FL_content": " s1 = input()\n s2 = input()\n x = [[0 for i in range(len(s2))]for j in range(len(s1))]\n \n def g(i,j):\n if i == 0 or j == 0:\n if s1[i] == s2[j]:\n x[i][j] = abs(i-j)\n else:\n if i == 0:\n x[i][j] = x[i][j-1] + 1\n else:\n x[i][j] = x[i-1][j] + 1\n elif s1[i] == s2[j]:\n- x[i][j] = x[i-1][j-1]\n else:\n- x[i][j] = min(x[i][j-1] + 1,x[i-1][j] + 1)\n \n \n for i in range(len(s1)):\n for j in range(len(s2)):\n g(i,j)\n \n print(x[len(s1)-1][len(s2)-1])\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 25 }, { "user_id": "u405027099", "problem_id": "p02318", "submission1_id": "s178223570", "submission2_id": "s517676136", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n for i in range(len(X)+1):\n for j in range(len(Y)+1):\n if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n\nX=input()\nY=input()\n\nprint(levenshtein(X,Y))\n", "code2": "def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n for i in range(len(X)+1):\n f[i][0]=i\n for j in range(len(Y)+1):\n f[0][j]=j\n for i in range(1,len(X)+1):\n for j in range(1,len(Y)+1):\n if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n\nX=input()\nY=input()\n\nprint(levenshtein(X,Y))\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1531819706", "date2": "1531820628", "bleu_score": "0.7990038549637761", "code1_test_status": [1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1], "code1_test_score": 65, "total_score": 102, "input": "_dac\ncmb\n", "actual_output": "3\n", "expected_output": "4\n\n", "anno_code": ["def levenshtein(X,Y): # (0): levenshtein=\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)] # (4): f\n for i in range(len(X)+1): # (5): i=0 (19): i=1 ... (61): i=4\n for j in range(len(Y)+1): # (6): j=0 (9): j=1 ... (74): NO CHANGE\n if X[i-1]==Y[j-1]: # (7): NO CHANGE (10): NO CHANGE ... (72): NO CHANGE\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]) # (11): NO CHANGE (67): f\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1) # (8): f (14): f ... (73): f\n return f[len(X)][len(Y)]\n\nX=input() # (1): X=_dac\nY=input() # (2): Y=cmb\n\nprint(levenshtein(X,Y)) # (3): NO CHANGE\n"], "anno_status": [true], "diff_content": " def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n for i in range(len(X)+1):\n- for j in range(len(Y)+1):\n+ f[i][0]=i\n+ for j in range(len(Y)+1):\n+ f[0][j]=j\n+ for i in range(1,len(X)+1):\n+ for j in range(1,len(Y)+1):\n if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n \n X=input()\n Y=input()\n \n print(levenshtein(X,Y))\n \n+\n", "FL_content": " def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n for i in range(len(X)+1):\n- for j in range(len(Y)+1):\n if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n \n X=input()\n Y=input()\n \n print(levenshtein(X,Y))\n \n", "added_lines": 6, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u196653484", "problem_id": "p02318", "submission1_id": "s588168327", "submission2_id": "s066226375", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\ndef search(a,b):\n na=len(a)\n nb=len(b)\n array = [[0]*(nb+1) for _ in range(na+1)]\n for i in range(na):\n array[i][0]=i\n for j in range(nb):\n array[0][j]=j\n for i,x in enumerate(a,1):\n prerow=array[i-1]\n row=array[i]\n for j,y in enumerate(b,1):\n if x == y:\n row[j]=prerow[j-1]\n elif prerow[j] > row[j-1]:\n row[j] = row[j-1]+1\n else:\n row[j] = prerow[j]+1\n return array[-1][-1]\n\na=input()\nb=input()\nprint(search(a,b))\n", "code2": "def search(a,b):\n na=len(a)\n nb=len(b)\n array = [[0]*(nb+1) for _ in range(na+1)]\n for i in range(na+1):\n array[i][0]=i\n for j in range(nb+1):\n array[0][j]=j\n for i,x in enumerate(a,1):\n prerow=array[i-1]\n row=array[i]\n for j,y in enumerate(b,1):\n if x == y:\n row[j]=prerow[j-1]\n else:\n row[j]=min(prerow[j], prerow[j-1], row[j-1])+1\n \n return array[-1][-1]\n\na=input()\nb=input()\nprint(search(a,b))\n\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1531898088", "date2": "1531899909", "bleu_score": "0.8733132782095607", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 1, "total_score": 102, "input": "cca_\nlcb\n", "actual_output": "1\n", "expected_output": "3\n\n", "anno_code": ["\nimport sys\ndef search(a,b): # (0): search=\n na=len(a) # (4): na=4\n nb=len(b) # (5): nb=3\n array = [[0]*(nb+1) for _ in range(na+1)] # (6): array\n for i in range(na): # (7): i=0 (9): i=1 ... (15): NO CHANGE\n array[i][0]=i # (8): NO CHANGE (10): array ... (14): array\n for j in range(nb): # (16): j=0 (18): j=1 ... (22): NO CHANGE\n array[0][j]=j # (17): NO CHANGE (19): array (21): array\n for i,x in enumerate(a,1): # (23): i=1, x=c (26): i=2 ... (35): NO CHANGE\n prerow=array[i-1] # (24): prerow=[0, 1, 2, 0] (27): prerow=[1, 0, 0, 0] ... (33): prerow=[3, 0, 0, 0]\n row=array[i] # (25): row=[1, 0, 0, 0] (28): row=[2, 0, 0, 0] ... (34): row=[0, 0, 0, 0]\n for j,y in enumerate(b,1): # (36): j=1, y=l (40): j=2, y=c (44): j=3, y=b\n if x == y: # (37): NO CHANGE (41): NO CHANGE (45): NO CHANGE\n row[j]=prerow[j-1]\n elif prerow[j] > row[j-1]: # (38): NO CHANGE (42): NO CHANGE (46): NO CHANGE\n row[j] = row[j-1]+1\n else:\n row[j] = prerow[j]+1 # (39): array=[[0, 1, 2, 0], [1, 0, 0, 0], [2, 0, 0, 0], [3, 0, 0, 0], [0, 1, 0, 0]], row=[0, 1, 0, 0] (43): array=[[0, 1, 2, 0], [1, 0, 0, 0], [2, 0, 0, 0], [3, 0, 0, 0], [0, 1, 1, 0]], row=[0, 1, 1, 0] (47): array, row=[0, 1, 1, 1]\n return array[-1][-1]\n\na=input() # (1): a=cca_\nb=input() # (2): b=lcb\nprint(search(a,b)) # (3): NO CHANGE\n"], "anno_status": [true], "diff_content": "-\n-import sys\n def search(a,b):\n na=len(a)\n nb=len(b)\n array = [[0]*(nb+1) for _ in range(na+1)]\n- for i in range(na):\n+ for i in range(na+1):\n array[i][0]=i\n- for j in range(nb):\n+ for j in range(nb+1):\n array[0][j]=j\n for i,x in enumerate(a,1):\n prerow=array[i-1]\n row=array[i]\n- for j,y in enumerate(b,1):\n+ for j,y in enumerate(b,1):\n if x == y:\n row[j]=prerow[j-1]\n- elif prerow[j] > row[j-1]:\n- row[j] = row[j-1]+1\n else:\n- row[j] = prerow[j]+1\n+ row[j]=min(prerow[j], prerow[j-1], row[j-1])+1\n+ \n return array[-1][-1]\n \n a=input()\n b=input()\n print(search(a,b))\n \n+\n+\n", "FL_content": "-\n-import sys\n def search(a,b):\n na=len(a)\n nb=len(b)\n array = [[0]*(nb+1) for _ in range(na+1)]\n- for i in range(na):\n array[i][0]=i\n- for j in range(nb):\n array[0][j]=j\n for i,x in enumerate(a,1):\n prerow=array[i-1]\n row=array[i]\n- for j,y in enumerate(b,1):\n if x == y:\n row[j]=prerow[j-1]\n- elif prerow[j] > row[j-1]:\n- row[j] = row[j-1]+1\n else:\n- row[j] = prerow[j]+1\n return array[-1][-1]\n \n a=input()\n b=input()\n print(search(a,b))\n \n", "added_lines": 7, "removed_lines": 8, "code1_lines": 26 }, { "user_id": "u196653484", "problem_id": "p02318", "submission1_id": "s322177114", "submission2_id": "s066226375", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def search(a,b):\n na=len(a)\n nb=len(b)\n array = [[0]*(nb+1) for _ in range(na+1)]\n for i in range(na):\n array[i][0]=i\n for j in range(nb):\n array[0][j]=j\n for i,x in enumerate(a,1):\n prerow=array[i-1]\n row=array[i]\n for j,y in enumerate(b,1):\n if x == y:\n row[j]=prerow[j-1]\n else:\n row[j]=min(prerow[j], prerow[j-1], row[j-1])+1\n \n return array[-1][-1]\n\na=input()\nb=input()\nprint(search(a,b))\n\n\n", "code2": "def search(a,b):\n na=len(a)\n nb=len(b)\n array = [[0]*(nb+1) for _ in range(na+1)]\n for i in range(na+1):\n array[i][0]=i\n for j in range(nb+1):\n array[0][j]=j\n for i,x in enumerate(a,1):\n prerow=array[i-1]\n row=array[i]\n for j,y in enumerate(b,1):\n if x == y:\n row[j]=prerow[j-1]\n else:\n row[j]=min(prerow[j], prerow[j-1], row[j-1])+1\n \n return array[-1][-1]\n\na=input()\nb=input()\nprint(search(a,b))\n\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1531899783", "date2": "1531899909", "bleu_score": "0.9862414435809479", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 102, "input": "cb`a\nmcc\n", "actual_output": "3\n", "expected_output": "4\n\n", "anno_code": ["def search(a,b): # (0): search=\n na=len(a) # (4): na=4\n nb=len(b) # (5): nb=3\n array = [[0]*(nb+1) for _ in range(na+1)] # (6): array\n for i in range(na): # (7): i=0 (9): i=1 ... (15): NO CHANGE\n array[i][0]=i # (8): NO CHANGE (10): array ... (14): array\n for j in range(nb): # (16): j=0 (18): j=1 ... (22): NO CHANGE\n array[0][j]=j # (17): NO CHANGE (19): array (21): array\n for i,x in enumerate(a,1): # (23): i=1, x=c (36): i=2, x=b ... (62): i=4, x=a\n prerow=array[i-1] # (24): prerow=[0, 1, 2, 0] (37): prerow=[1, 1, 1, 2] ... (63): prerow=[3, 3, 3, 3]\n row=array[i] # (25): row=[1, 0, 0, 0] (38): row=[2, 0, 0, 0] ... (64): row=[0, 0, 0, 0]\n for j,y in enumerate(b,1): # (26): j=1, y=m (29): j=2, y=c ... (74): NO CHANGE\n if x == y: # (27): NO CHANGE (30): NO CHANGE ... (72): NO CHANGE\n row[j]=prerow[j-1] # (31): array=[[0, 1, 2, 0], [1, 1, 1, 0], [2, 0, 0, 0], [3, 0, 0, 0], [0, 0, 0, 0]], row=[1, 1, 1, 0] (34): array, row=[1, 1, 1, 2]\n else:\n row[j]=min(prerow[j], prerow[j-1], row[j-1])+1 # (28): array=[[0, 1, 2, 0], [1, 1, 0, 0], [2, 0, 0, 0], [3, 0, 0, 0], [0, 0, 0, 0]], row=[1, 1, 0, 0] (41): array=[[0, 1, 2, 0], [1, 1, 1, 2], [2, 2, 0, 0], [3, 0, 0, 0], [0, 0, 0, 0]], row=[2, 2, 0, 0] ... (73): array, row=[0, 1, 2, 3]\n \n return array[-1][-1]\n\na=input() # (1): a=cb`a\nb=input() # (2): b=mcc\nprint(search(a,b)) # (3): NO CHANGE\n\n\n"], "anno_status": [true], "diff_content": " def search(a,b):\n na=len(a)\n nb=len(b)\n array = [[0]*(nb+1) for _ in range(na+1)]\n- for i in range(na):\n+ for i in range(na+1):\n array[i][0]=i\n- for j in range(nb):\n+ for j in range(nb+1):\n array[0][j]=j\n for i,x in enumerate(a,1):\n prerow=array[i-1]\n row=array[i]\n for j,y in enumerate(b,1):\n if x == y:\n row[j]=prerow[j-1]\n else:\n row[j]=min(prerow[j], prerow[j-1], row[j-1])+1\n \n return array[-1][-1]\n \n a=input()\n b=input()\n print(search(a,b))\n \n \n \n", "FL_content": " def search(a,b):\n na=len(a)\n nb=len(b)\n array = [[0]*(nb+1) for _ in range(na+1)]\n- for i in range(na):\n array[i][0]=i\n- for j in range(nb):\n array[0][j]=j\n for i,x in enumerate(a,1):\n prerow=array[i-1]\n row=array[i]\n for j,y in enumerate(b,1):\n if x == y:\n row[j]=prerow[j-1]\n else:\n row[j]=min(prerow[j], prerow[j-1], row[j-1])+1\n \n return array[-1][-1]\n \n a=input()\n b=input()\n print(search(a,b))\n \n \n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 25 }, { "user_id": "u126478680", "problem_id": "p02318", "submission1_id": "s143984069", "submission2_id": "s391626446", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def levenshtein(str1, str2):\n if len(str1) == 0 or len(str2) == 0: return max(len(str1), len(str2))\n \n dp = [[None for i in range(len(str2))] for i in range(len(str1))]\n for i in range(len(str1)): dp[i][0] = i\n for j in range(len(str2)): dp[0][j] = j\n\n for i in range(1, len(str1)):\n for j in range(1, len(str2)):\n val = dp[i-1][j-1] if str1[i] == str2[j] else dp[i-1][j-1]+1\n dp[i][j] = min(val, dp[i-1][j]+1, dp[i][j-1]+1)\n return dp[-1][-1]\n\ns1 = input()\ns2 = input()\n\nprint(levenshtein(s1, s2))\n", "code2": "def levenshtein(str1, str2):\n if len(str1) == 0 or len(str2) == 0: return max(len(str1), len(str2))\n \n dp = [[None for i in range(len(str2)+1)] for i in range(len(str1)+1)]\n for i in range(len(str1)+1): dp[i][0] = i\n for j in range(len(str2)+1): dp[0][j] = j\n\n for i in range(1, len(str1)+1):\n for j in range(1, len(str2)+1):\n val = dp[i-1][j-1] if str1[i-1] == str2[j-1] else dp[i-1][j-1]+1\n dp[i][j] = min(val, dp[i-1][j]+1, dp[i][j-1]+1)\n return dp[-1][-1]\n\ns1 = input()\ns2 = input()\n\nprint(levenshtein(s1, s2))\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1527856347", "date2": "1527856518", "bleu_score": "0.9501446264356059", "code1_test_status": [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1], "code1_test_score": 16, "total_score": 102, "input": "ibpc\nccpi\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["def levenshtein(str1, str2): # (0): levenshtein=\n if len(str1) == 0 or len(str2) == 0: return max(len(str1), len(str2))\n \n dp = [[None for i in range(len(str2))] for i in range(len(str1))] # (4): dp\n for i in range(len(str1)): dp[i][0] = i # (5): dp=[[0, None, None, None], [None, None, None, None], [None, None, None, None], [None, None, None, None]], i=0 (6): dp, i=1 ... (9): NO CHANGE\n for j in range(len(str2)): dp[0][j] = j # (10): j=0 (11): dp, j=1 ... (14): NO CHANGE\n\n for i in range(1, len(str1)): # (15): i=1 (26): i=2 (37): i=3\n for j in range(1, len(str2)): # (16): j=1 (19): j=2 ... (47): NO CHANGE\n val = dp[i-1][j-1] if str1[i] == str2[j] else dp[i-1][j-1]+1 # (17): val=1 (20): val=2 ... (45): val=2\n dp[i][j] = min(val, dp[i-1][j]+1, dp[i][j-1]+1) # (18): dp (21): dp ... (46): dp\n return dp[-1][-1]\n\ns1 = input() # (1): s1=ibpc\ns2 = input() # (2): s2=ccpi\n\nprint(levenshtein(s1, s2)) # (3): str1=ibpc, str2=ccpi\n"], "anno_status": [true], "diff_content": " def levenshtein(str1, str2):\n if len(str1) == 0 or len(str2) == 0: return max(len(str1), len(str2))\n \n- dp = [[None for i in range(len(str2))] for i in range(len(str1))]\n- for i in range(len(str1)): dp[i][0] = i\n- for j in range(len(str2)): dp[0][j] = j\n+ dp = [[None for i in range(len(str2)+1)] for i in range(len(str1)+1)]\n+ for i in range(len(str1)+1): dp[i][0] = i\n+ for j in range(len(str2)+1): dp[0][j] = j\n \n- for i in range(1, len(str1)):\n- for j in range(1, len(str2)):\n- val = dp[i-1][j-1] if str1[i] == str2[j] else dp[i-1][j-1]+1\n+ for i in range(1, len(str1)+1):\n+ for j in range(1, len(str2)+1):\n+ val = dp[i-1][j-1] if str1[i-1] == str2[j-1] else dp[i-1][j-1]+1\n dp[i][j] = min(val, dp[i-1][j]+1, dp[i][j-1]+1)\n return dp[-1][-1]\n \n s1 = input()\n s2 = input()\n \n print(levenshtein(s1, s2))\n \n", "FL_content": " def levenshtein(str1, str2):\n if len(str1) == 0 or len(str2) == 0: return max(len(str1), len(str2))\n \n- dp = [[None for i in range(len(str2))] for i in range(len(str1))]\n- for i in range(len(str1)): dp[i][0] = i\n- for j in range(len(str2)): dp[0][j] = j\n \n- for i in range(1, len(str1)):\n- for j in range(1, len(str2)):\n- val = dp[i-1][j-1] if str1[i] == str2[j] else dp[i-1][j-1]+1\n dp[i][j] = min(val, dp[i-1][j]+1, dp[i][j-1]+1)\n return dp[-1][-1]\n \n s1 = input()\n s2 = input()\n \n print(levenshtein(s1, s2))\n \n", "added_lines": 6, "removed_lines": 6, "code1_lines": 18 }, { "user_id": "u405027099", "problem_id": "p02318", "submission1_id": "s542578808", "submission2_id": "s517676136", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n for i in range(len(X)):\n f[i][0]=i\n for j in range(len(Y)):\n f[0][j]=j\n for i in range(len(X)+1):\n for j in range(len(Y)+1):\n if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n\nX=input()\nY=input()\n\nprint(levenshtein(X,Y))\n\n", "code2": "def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n for i in range(len(X)+1):\n f[i][0]=i\n for j in range(len(Y)+1):\n f[0][j]=j\n for i in range(1,len(X)+1):\n for j in range(1,len(Y)+1):\n if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n\nX=input()\nY=input()\n\nprint(levenshtein(X,Y))\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1531820131", "date2": "1531820628", "bleu_score": "0.9720780517361597", "code1_test_status": [1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1], "code1_test_score": 65, "total_score": 102, "input": "cc`b\nncd\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["def levenshtein(X,Y): # (0): levenshtein=\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)] # (4): f\n for i in range(len(X)): # (5): i=0 (7): i=1 ... (13): NO CHANGE\n f[i][0]=i # (6): NO CHANGE (8): f ... (12): f\n for j in range(len(Y)): # (14): j=0 (16): j=1 ... (20): NO CHANGE\n f[0][j]=j # (15): NO CHANGE (17): f (19): f\n for i in range(len(X)+1): # (21): i=0 (35): i=1 ... (77): i=4\n for j in range(len(Y)+1): # (22): j=0 (25): j=1 ... (90): NO CHANGE\n if X[i-1]==Y[j-1]: # (23): NO CHANGE (26): NO CHANGE ... (88): NO CHANGE\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]) # (44): f (58): f\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1) # (24): f (27): NO CHANGE ... (89): f\n return f[len(X)][len(Y)]\n\nX=input() # (1): X=cc`b\nY=input() # (2): Y=ncd\n\nprint(levenshtein(X,Y)) # (3): NO CHANGE\n\n"], "anno_status": [true], "diff_content": " def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n- for i in range(len(X)):\n+ for i in range(len(X)+1):\n f[i][0]=i\n- for j in range(len(Y)):\n+ for j in range(len(Y)+1):\n f[0][j]=j\n- for i in range(len(X)+1):\n- for j in range(len(Y)+1):\n+ for i in range(1,len(X)+1):\n+ for j in range(1,len(Y)+1):\n if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n \n X=input()\n Y=input()\n \n print(levenshtein(X,Y))\n \n \n", "FL_content": " def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n- for i in range(len(X)):\n f[i][0]=i\n- for j in range(len(Y)):\n f[0][j]=j\n- for i in range(len(X)+1):\n- for j in range(len(Y)+1):\n if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n \n X=input()\n Y=input()\n \n print(levenshtein(X,Y))\n \n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 20 }, { "user_id": "u016568601", "problem_id": "p02830", "submission1_id": "s260839961", "submission2_id": "s261975024", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ns, t = list(input().split())\nans = []\nfor i in range(n):\n ans += s[i]\n ans += t[i]\n\nprint(ans)\n", "code2": "n = int(input())\ns, t = list(input().split())\nans = \"\"\nfor i in range(n):\n ans += s[i]\n ans += t[i]\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579129082", "date2": "1579129293", "bleu_score": "0.9687328077143024", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "5\nbaaaa aaaaa\n", "actual_output": "['b', 'a', 'a', 'a', 'a', 'a', 'a', 'a', 'a', 'a']\n", "expected_output": "baaaaaaaaa\n\n", "anno_code": ["n = int(input()) # (0): n=5\ns, t = list(input().split()) # (1): s=baaaa, t=aaaaa\nans = [] # (2): ans=[]\nfor i in range(n): # (3): i=0 (6): i=1 ... (18): NO CHANGE\n ans += s[i] # (4): ans=['b'] (7): ans=['b', 'a', 'a'] ... (16): ans=['b', 'a', 'a', 'a', 'a', 'a', 'a', 'a', 'a']\n ans += t[i] # (5): ans=['b', 'a'] (8): ans=['b', 'a', 'a', 'a'] ... (17): ans=['b', 'a', 'a', 'a', 'a', 'a', 'a', 'a', 'a', 'a']\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " n = int(input())\n s, t = list(input().split())\n-ans = []\n+ans = \"\"\n for i in range(n):\n ans += s[i]\n ans += t[i]\n \n print(ans)\n \n", "FL_content": " n = int(input())\n s, t = list(input().split())\n-ans = []\n for i in range(n):\n ans += s[i]\n ans += t[i]\n \n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u763968347", "problem_id": "p02830", "submission1_id": "s956202113", "submission2_id": "s815813831", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nS,T = input().split()\n\nprint(S)\nprint(T)\n\ns = ''\nfor i in range(N):\n s += S[i]\n s += T[i]\n\nprint(s)", "code2": "N = int(input())\nS,T = input().split()\n\ns = ''\nfor i in range(N):\n s += S[i]\n s += T[i]\n\nprint(s)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577066941", "date2": "1577066972", "bleu_score": "0.8315481959114176", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "2\nkq cf\n", "actual_output": "kq\ncf\nkcqf\n", "expected_output": "kcqf\n\n", "anno_code": ["N = int(input()) # (0): N=2\nS,T = input().split() # (1): S=kq, T=cf\n\nprint(S) # (2): NO CHANGE\nprint(T) # (3): NO CHANGE\n\ns = '' # (4): s=\nfor i in range(N): # (5): i=0 (8): i=1 (11): NO CHANGE\n s += S[i] # (6): s=k (9): s=kcq\n s += T[i] # (7): s=kc (10): s=kcqf\n\nprint(s)"], "anno_status": [true], "diff_content": " N = int(input())\n S,T = input().split()\n \n-print(S)\n-print(T)\n-\n s = ''\n for i in range(N):\n s += S[i]\n s += T[i]\n \n print(s)\n", "FL_content": " N = int(input())\n S,T = input().split()\n \n-print(S)\n-print(T)\n-\n s = ''\n for i in range(N):\n s += S[i]\n s += T[i]\n \n print(s)\n", "added_lines": 0, "removed_lines": 3, "code1_lines": 12 }, { "user_id": "u506587641", "problem_id": "p02830", "submission1_id": "s339377993", "submission2_id": "s364839495", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ns, t = map(str, input().split())\nx= []\n\nfor i in range(n):\n\n lst = [s[i], t[i]]\n x.append(''.join(lst))", "code2": "n = int(input())\ns, t = map(str, input().split())\nx= []\n\nfor i in range(n):\n\n lst = [s[i], t[i]]\n x.append(''.join(lst))\n\nprint(''.join(x))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577294733", "date2": "1577294771", "bleu_score": "0.8675871673129381", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "2\nqk be\n", "actual_output": "no output\n", "expected_output": "qbke\n\n", "anno_code": ["n = int(input()) # (0): n=2\ns, t = map(str, input().split()) # (1): s=qk, t=be\nx= [] # (2): x=[]\n\nfor i in range(n): # (3): i=0 (6): i=1\n\n lst = [s[i], t[i]] # (4): lst=['q', 'b'] (7): lst=['k', 'e']\n x.append(''.join(lst)) # (5): x=['qb'] (8): x=['qb', 'ke']\n"], "anno_status": [true], "diff_content": " n = int(input())\n s, t = map(str, input().split())\n x= []\n \n for i in range(n):\n \n lst = [s[i], t[i]]\n x.append(''.join(lst))\n+\n+print(''.join(x))\n", "FL_content": " n = int(input())\n s, t = map(str, input().split())\n x= []\n \n for i in range(n):\n \n lst = [s[i], t[i]]\n x.append(''.join(lst))\n", "added_lines": 2, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u591717585", "problem_id": "p02830", "submission1_id": "s298340446", "submission2_id": "s739956201", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = input()\nb = input()\nres = ''\nfor i in range(len(a)):\n res += a[i]\n res += b[i]\nprint(res)\n", "code2": "n = int(input())\na, b = input().split(' ')\nres = ''\nfor i in range(n):\n res += a[i]\n res += b[i]\nprint(res)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577066554", "date2": "1577066719", "bleu_score": "0.7844459427272394", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "5\nbabaa babaa\n", "actual_output": "5b\n", "expected_output": "bbaabbaaaa\n\n", "anno_code": ["a = input() # (0): a=5\nb = input() # (1): b=babaa babaa\nres = '' # (2): res=\nfor i in range(len(a)): # (3): i=0 (6): NO CHANGE\n res += a[i] # (4): res=5\n res += b[i] # (5): res=5b\nprint(res)\n"], "anno_status": [true], "diff_content": "-a = input()\n-b = input()\n+n = int(input())\n+a, b = input().split(' ')\n res = ''\n-for i in range(len(a)):\n+for i in range(n):\n res += a[i]\n res += b[i]\n print(res)\n \n", "FL_content": "-a = input()\n-b = input()\n res = ''\n-for i in range(len(a)):\n res += a[i]\n res += b[i]\n print(res)\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u703890795", "problem_id": "p02830", "submission1_id": "s134180056", "submission2_id": "s536939056", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nST = input()\nS = \"\"\nfor i in range(N):\n S += ST[i]\n S += ST[N+i]\nprint(S)", "code2": "N = int(input())\nST = input()\nS = \"\"\nfor i in range(N):\n S += ST[i]\n S += ST[N+i+1]\nprint(S)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583372459", "date2": "1583372535", "bleu_score": "0.961928649275358", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "5\naa_ba bb`_b\n", "actual_output": "a ab_bb`a_\n", "expected_output": "abab_`b_ab\n\n", "anno_code": ["N = int(input()) # (0): N=5\nST = input() # (1): ST=aa_ba bb`_b\nS = \"\" # (2): S=\nfor i in range(N): # (3): i=0 (6): i=1 ... (18): NO CHANGE\n S += ST[i] # (4): S=a (7): S=a a ... (16): S=a ab_bb`a\n S += ST[N+i] # (5): S=a (8): S=a ab ... (17): S=a ab_bb`a_\nprint(S)"], "anno_status": [true], "diff_content": " N = int(input())\n ST = input()\n S = \"\"\n for i in range(N):\n S += ST[i]\n- S += ST[N+i]\n+ S += ST[N+i+1]\n print(S)\n", "FL_content": " N = int(input())\n ST = input()\n S = \"\"\n for i in range(N):\n S += ST[i]\n- S += ST[N+i]\n print(S)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u983357959", "problem_id": "p02830", "submission1_id": "s317215857", "submission2_id": "s991091361", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ns,t = map(str,input().split())\ns = list(s)\nt = list(t)\nans =[]\nprint(s)\nfor i in range(n):\n ans.append(s[i])\n ans.append(t[i])\n''.join(ans)\n\n\nprint(ans)\n\n", "code2": "n = int(input())\ns,t = map(str,input().split())\ns = list(s)\nt = list(t)\nans =[]\n\nfor i in range(n):\n ans.append(s[i])\n ans.append(t[i])\n\nans2 = ''.join(ans)\n\n\nprint(ans2)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579048130", "date2": "1579048284", "bleu_score": "0.9259028043287267", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "2\nip dc\n", "actual_output": "['i', 'p']\n['i', 'd', 'p', 'c']\n", "expected_output": "idpc\n\n", "anno_code": ["n = int(input()) # (0): n=2\ns,t = map(str,input().split()) # (1): s=ip, t=dc\ns = list(s) # (2): s=['i', 'p']\nt = list(t) # (3): t=['d', 'c']\nans =[] # (4): ans=[]\nprint(s) # (5): NO CHANGE\nfor i in range(n): # (6): i=0 (9): i=1 (12): NO CHANGE\n ans.append(s[i]) # (7): ans=['i'] (10): ans=['i', 'd', 'p']\n ans.append(t[i]) # (8): ans=['i', 'd'] (11): ans=['i', 'd', 'p', 'c']\n''.join(ans) # (13): NO CHANGE\n\n\nprint(ans)\n\n"], "anno_status": [true], "diff_content": " n = int(input())\n s,t = map(str,input().split())\n s = list(s)\n t = list(t)\n ans =[]\n-print(s)\n+\n for i in range(n):\n ans.append(s[i])\n ans.append(t[i])\n-''.join(ans)\n+\n+ans2 = ''.join(ans)\n \n \n-print(ans)\n+print(ans2)\n \n \n", "FL_content": " n = int(input())\n s,t = map(str,input().split())\n s = list(s)\n t = list(t)\n ans =[]\n-print(s)\n for i in range(n):\n ans.append(s[i])\n ans.append(t[i])\n-''.join(ans)\n \n \n-print(ans)\n \n \n", "added_lines": 4, "removed_lines": 3, "code1_lines": 15 }, { "user_id": "u527993431", "problem_id": "p02830", "submission1_id": "s390667721", "submission2_id": "s961997028", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA,B = input().split()\ntmp = [[] for _ in range(N*2)]\nprint(A)\nM = 2*N\nfor i in range(0,N):\n\ttmp[2*i]=A[i]\n\ttmp[2*i+1]=B[i]\nans = \"\".join(tmp)\nprint(ans)", "code2": "N = int(input())\nA,B = input().split()\ntmp = [[] for _ in range(N*2)]\nM = 2*N\nfor i in range(0,N):\n\ttmp[2*i]=A[i]\n\ttmp[2*i+1]=B[i]\nans = \"\".join(tmp)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577067453", "date2": "1577067481", "bleu_score": "0.9407832753691012", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "5\naaaaa aaaaa\n", "actual_output": "aaaaa\naaaaaaaaaa\n", "expected_output": "aaaaaaaaaa\n", "anno_code": ["N = int(input()) # (0): N=5\nA,B = input().split() # (1): A=aaaaa, B=aaaaa\ntmp = [[] for _ in range(N*2)] # (2): tmp\nprint(A) # (3): NO CHANGE\nM = 2*N # (4): M=10\nfor i in range(0,N): # (5): i=0 (8): tmp=['a', 'a', [], [], [], [], [], [], [], []], i=1 ... (20): NO CHANGE\n\ttmp[2*i]=A[i] # (6): tmp=['a', [], [], [], [], [], [], [], [], []] (9): tmp=['a', 'a', 'a', [], [], [], [], [], [], []] ... (18): tmp=['a', 'a', 'a', 'a', 'a', 'a', 'a', 'a', 'a', []]\n\ttmp[2*i+1]=B[i] # (7): tmp=['a', 'a', [], [], [], [], [], [], [], []] (10): tmp=['a', 'a', 'a', 'a', [], [], [], [], [], []] ... (19): tmp=['a', 'a', 'a', 'a', 'a', 'a', 'a', 'a', 'a', 'a']\nans = \"\".join(tmp) # (21): ans=aaaaaaaaaa\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n A,B = input().split()\n tmp = [[] for _ in range(N*2)]\n-print(A)\n M = 2*N\n for i in range(0,N):\n \ttmp[2*i]=A[i]\n \ttmp[2*i+1]=B[i]\n ans = \"\".join(tmp)\n print(ans)\n", "FL_content": " N = int(input())\n A,B = input().split()\n tmp = [[] for _ in range(N*2)]\n-print(A)\n M = 2*N\n for i in range(0,N):\n \ttmp[2*i]=A[i]\n \ttmp[2*i+1]=B[i]\n ans = \"\".join(tmp)\n print(ans)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u019053283", "problem_id": "p02830", "submission1_id": "s592463982", "submission2_id": "s852585853", "status1": "Wrong Answer", "status2": "Accepted", "code1": "RESULT = \"\"\nN = int(input())\nS,T=str(input()).split()\nfor i in S:\n RESULT += i\n for v in T:\n RESULT += v\n break\n\nprint(RESULT)", "code2": "RESULT = \"\"\nN = int(input())\nS,T=str(input()).split()\nfor i in range(len(S)):\n RESULT += S[i]\n RESULT += T[i]\nprint(RESULT)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577068437", "date2": "1577069014", "bleu_score": "0.7844138604833146", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 14, "total_score": 103, "input": "5\nac`b` aab`b\n", "actual_output": "aaca`aba`a\n", "expected_output": "aaca`bb``b\n\n", "anno_code": ["RESULT = \"\" # (0): RESULT=\nN = int(input()) # (1): N=5\nS,T=str(input()).split() # (2): S=ac`b`, T=aab`b\nfor i in S: # (3): i=a (8): i=c ... (28): NO CHANGE\n RESULT += i # (4): RESULT=a (9): RESULT=aac ... (24): RESULT=aaca`aba`\n for v in T: # (5): v=a (10): NO CHANGE ... (25): NO CHANGE\n RESULT += v # (6): RESULT=aa (11): RESULT=aaca ... (26): RESULT=aaca`aba`a\n break # (7): NO CHANGE (12): NO CHANGE ... (27): NO CHANGE\n\nprint(RESULT)"], "anno_status": [true], "diff_content": " RESULT = \"\"\n N = int(input())\n S,T=str(input()).split()\n-for i in S:\n- RESULT += i\n- for v in T:\n- RESULT += v\n- break\n-\n+for i in range(len(S)):\n+ RESULT += S[i]\n+ RESULT += T[i]\n print(RESULT)\n", "FL_content": " RESULT = \"\"\n N = int(input())\n S,T=str(input()).split()\n-for i in S:\n- RESULT += i\n- for v in T:\n- RESULT += v\n- break\n-\n print(RESULT)\n", "added_lines": 3, "removed_lines": 6, "code1_lines": 10 }, { "user_id": "u452885705", "problem_id": "p02830", "submission1_id": "s535773074", "submission2_id": "s006605683", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ns,t = map(list, input().split(\" \"))\na=[]\nprint(n,s,t)\nfor i in range(n):\n a.append(s[i])\n a.append(t[i])\nprint(''.join(a))", "code2": "n = int(input())\ns,t = map(list, input().split(\" \"))\na=[]\nfor i in range(n):\n a.append(s[i])\n a.append(t[i])\nprint(''.join(a))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577166236", "date2": "1577166301", "bleu_score": "0.9009354293464784", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "8\njmgnlhmm uvtuvutu\n", "actual_output": "8 ['j', 'm', 'g', 'n', 'l', 'h', 'm', 'm'] ['u', 'v', 't', 'u', 'v', 'u', 't', 'u']\njumvgtnulvhumtmu\n", "expected_output": "jumvgtnulvhumtmu\n\n", "anno_code": ["n = int(input()) # (0): n=8\ns,t = map(list, input().split(\" \")) # (1): s=['j', 'm', 'g', 'n', 'l', 'h', 'm', 'm'], t=['u', 'v', 't', 'u', 'v', 'u', 't', 'u']\na=[] # (2): a=[]\nprint(n,s,t) # (3): NO CHANGE\nfor i in range(n): # (4): i=0 (7): i=1 ... (28): NO CHANGE\n a.append(s[i]) # (5): a=['j'] (8): a=['j', 'u', 'm'] ... (26): a=['j', 'u', 'm', 'v', 'g', 't', 'n', 'u', 'l', 'v', 'h', 'u', 'm', 't', 'm']\n a.append(t[i]) # (6): a=['j', 'u'] (9): a=['j', 'u', 'm', 'v'] ... (27): a=['j', 'u', 'm', 'v', 'g', 't', 'n', 'u', 'l', 'v', 'h', 'u', 'm', 't', 'm', 'u']\nprint(''.join(a))"], "anno_status": [true], "diff_content": " n = int(input())\n s,t = map(list, input().split(\" \"))\n a=[]\n-print(n,s,t)\n for i in range(n):\n a.append(s[i])\n a.append(t[i])\n print(''.join(a))\n", "FL_content": " n = int(input())\n s,t = map(list, input().split(\" \"))\n a=[]\n-print(n,s,t)\n for i in range(n):\n a.append(s[i])\n a.append(t[i])\n print(''.join(a))\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u202385788", "problem_id": "p02830", "submission1_id": "s672978153", "submission2_id": "s872168533", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nS, T = input().split()\npart = [None for n in range(N)]\nfor i in range(N):\n part[i] = (S[i] + T[i])\n print(part[i])\nprint(\"\".join(part))", "code2": "N = int(input())\nS, T = input().split()\npart = [None for n in range(N)]\nfor i in range(N):\n part[i] = (S[i] + T[i])\nprint(\"\".join(part))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577068678", "date2": "1577068725", "bleu_score": "0.8722400140448053", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "5\nac_b` abb_b\n", "actual_output": "aa\ncb\n_b\nb_\n`b\naacb_bb_`b\n", "expected_output": "aacb_bb_`b\n\n", "anno_code": ["N = int(input()) # (0): N=5\nS, T = input().split() # (1): S=ac_b`, T=abb_b\npart = [None for n in range(N)] # (2): part=[None, None, None, None, None]\nfor i in range(N): # (3): i=0 (6): i=1 ... (18): NO CHANGE\n part[i] = (S[i] + T[i]) # (4): part=['aa', None, None, None, None] (7): part=['aa', 'cb', None, None, None] ... (16): part=['aa', 'cb', '_b', 'b_', '`b']\n print(part[i]) # (5): NO CHANGE (8): NO CHANGE ... (17): NO CHANGE\nprint(\"\".join(part))"], "anno_status": [true], "diff_content": " N = int(input())\n S, T = input().split()\n part = [None for n in range(N)]\n for i in range(N):\n part[i] = (S[i] + T[i])\n- print(part[i])\n print(\"\".join(part))\n", "FL_content": " N = int(input())\n S, T = input().split()\n part = [None for n in range(N)]\n for i in range(N):\n part[i] = (S[i] + T[i])\n- print(part[i])\n print(\"\".join(part))\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u319612498", "problem_id": "p03353", "submission1_id": "s967239549", "submission2_id": "s183272479", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nt=list(s)\nu=sorted(list(set(t)))\nans=[]\nfor i in range(len(u)):\n ans.append(u[i])\nk=int(input())\nfor j in range(1,min(5,len(t))):\n for i in range(len(t)-j):\n ans.append(s[i:i+j+1])\nans=sorted(ans)\nprint(ans[k-1])", "code2": "s=input()\nt=list(s)\nu=sorted(list(set(t)))\nans=[]\nfor i in range(len(u)):\n ans.append(u[i])\nk=int(input())\nfor j in range(1,min(10,len(t))):\n for i in range(len(t)-j):\n ans.append(s[i:i+j+1])\nans=sorted(list(set(ans)))\nprint(ans[k-1])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1526176568", "date2": "1526176841", "bleu_score": "0.9285913010712552", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 100, "total_score": 103, "input": "roddadtadmboefectr\n4\n", "actual_output": "adm\n", "expected_output": "admb\n\n", "anno_code": ["s=input() # (0): s=roddadtadmboefectr\nt=list(s) # (1): t=['r', 'o', 'd', 'd', 'a', 'd', 't', 'a', 'd', 'm', 'b', 'o', 'e', 'f', 'e', 'c', 't', 'r']\nu=sorted(list(set(t))) # (2): u=['a', 'b', 'c', 'd', 'e', 'f', 'm', 'o', 'r', 't']\nans=[] # (3): ans=[]\nfor i in range(len(u)): # (4): i=0 (6): i=1 ... (24): NO CHANGE\n ans.append(u[i]) # (5): ans=['a'] (7): ans=['a', 'b'] ... (23): ans=['a', 'b', 'c', 'd', 'e', 'f', 'm', 'o', 'r', 't']\nk=int(input()) # (25): k=4\nfor j in range(1,min(5,len(t))): # (26): j=1 (62): j=2 ... (158): NO CHANGE\n for i in range(len(t)-j): # (27): i=0 (29): i=1 ... (157): NO CHANGE\n ans.append(s[i:i+j+1]) # (28): ans=['a', 'b', 'c', 'd', 'e', 'f', 'm', 'o', 'r', 't', 'ro'] (30): ans=['a', 'b', 'c', 'd', 'e', 'f', 'm', 'o', 'r', 't', 'ro', 'od'] ... (156): ans=[a, b, ..., efect, fectr]\nans=sorted(ans) # (159): ans=[a, ad, ..., tadmb, tr]\nprint(ans[k-1])"], "anno_status": [true], "diff_content": " s=input()\n t=list(s)\n u=sorted(list(set(t)))\n ans=[]\n for i in range(len(u)):\n ans.append(u[i])\n k=int(input())\n-for j in range(1,min(5,len(t))):\n+for j in range(1,min(10,len(t))):\n for i in range(len(t)-j):\n ans.append(s[i:i+j+1])\n-ans=sorted(ans)\n+ans=sorted(list(set(ans)))\n print(ans[k-1])\n+\n", "FL_content": " s=input()\n t=list(s)\n u=sorted(list(set(t)))\n ans=[]\n for i in range(len(u)):\n ans.append(u[i])\n k=int(input())\n-for j in range(1,min(5,len(t))):\n for i in range(len(t)-j):\n ans.append(s[i:i+j+1])\n-ans=sorted(ans)\n print(ans[k-1])\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 12 }, { "user_id": "u593590006", "problem_id": "p03353", "submission1_id": "s512574383", "submission2_id": "s072312958", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nk=int(input())\nn=len(s)\nl=[]\nfor i in range(n):\n curr=''\n for j in range(i,min(i+10,n)):\n curr+=s[j]\n l.append(curr)\nl.sort()\n\nprint(l[k-1])", "code2": "s=input()\nk=int(input())\nn=len(s)\nl=set()\nfor i in range(n):\n curr=''\n for j in range(i,min(i+7,n)):\n curr+=s[j]\n l.add(curr)\nl=[i for i in l]\nl.sort()\n\nprint(l[k-1])", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1572382525", "date2": "1572382629", "bleu_score": "0.8544258136228686", "code1_test_status": [0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0], "code1_test_score": 58, "total_score": 103, "input": "atcederamdatcoddor\n4\n", "actual_output": "am\n", "expected_output": "amda\n\n", "anno_code": ["s=input() # (0): s=atcederamdatcoddor\nk=int(input()) # (1): k=4\nn=len(s) # (2): n=18\nl=[] # (3): l=[]\nfor i in range(n): # (4): i=0 (37): i=1 ... (463): NO CHANGE\n curr='' # (5): curr= (38): curr= ... (458): curr=\n for j in range(i,min(i+10,n)): # (6): j=0 (9): j=1 ... (462): NO CHANGE\n curr+=s[j] # (7): curr=a (10): curr=at ... (460): curr=r\n l.append(curr) # (8): l=['a'] (11): l=['a', 'at'] ... (461): l=[a, at, ..., or, r]\nl.sort() # (464): l=[a, a, ..., tcoddo, tcoddor]\n\nprint(l[k-1])"], "anno_status": [true], "diff_content": " s=input()\n k=int(input())\n n=len(s)\n-l=[]\n+l=set()\n for i in range(n):\n curr=''\n- for j in range(i,min(i+10,n)):\n+ for j in range(i,min(i+7,n)):\n curr+=s[j]\n- l.append(curr)\n+ l.add(curr)\n+l=[i for i in l]\n l.sort()\n \n print(l[k-1])\n", "FL_content": " s=input()\n k=int(input())\n n=len(s)\n-l=[]\n for i in range(n):\n curr=''\n- for j in range(i,min(i+10,n)):\n curr+=s[j]\n- l.append(curr)\n l.sort()\n \n print(l[k-1])\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 12 }, { "user_id": "u761529120", "problem_id": "p03353", "submission1_id": "s080597082", "submission2_id": "s289930994", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n s = input()\n K = int(input())\n\n S = set()\n\n for i in range(len(s)):\n for j in range(1, K+1):\n print(s[i:i+j])\n S.add(s[i:i+j])\n \n sort_S = sorted(list(S))\n\n print(sort_S[K-1])\nmain()", "code2": "def main():\n s = input()\n K = int(input())\n\n S = set()\n\n for i in range(len(s)):\n for j in range(1, K+1):\n S.add(s[i:i+j])\n \n sort_S = sorted(list(S))\n\n print(sort_S[K-1])\nmain()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1565784381", "date2": "1565784413", "bleu_score": "0.8789456120040121", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "``d\n2\n", "actual_output": "`\n``\n`\n`d\nd\nd\n``\n", "expected_output": "``\n\n", "anno_code": ["def main(): # (0): main=\n s = input() # (2): s=``d\n K = int(input()) # (3): K=2\n\n S = set() # (4): S=set()\n\n for i in range(len(s)): # (5): i=0 (13): i=1 ... (29): NO CHANGE\n for j in range(1, K+1): # (6): j=1 (9): j=2 ... (28): NO CHANGE\n print(s[i:i+j]) # (7): NO CHANGE (10): NO CHANGE ... (26): NO CHANGE\n S.add(s[i:i+j]) # (8): S={'`'} (11): S={'``', '`'} ... (27): NO CHANGE\n \n sort_S = sorted(list(S)) # (30): sort_S=['`', '``', '`d', 'd']\n\n print(sort_S[K-1])\nmain() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " def main():\n s = input()\n K = int(input())\n \n S = set()\n \n for i in range(len(s)):\n for j in range(1, K+1):\n- print(s[i:i+j])\n S.add(s[i:i+j])\n \n sort_S = sorted(list(S))\n \n print(sort_S[K-1])\n main()\n", "FL_content": " def main():\n s = input()\n K = int(input())\n \n S = set()\n \n for i in range(len(s)):\n for j in range(1, K+1):\n- print(s[i:i+j])\n S.add(s[i:i+j])\n \n sort_S = sorted(list(S))\n \n print(sort_S[K-1])\n main()\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u869519920", "problem_id": "p03353", "submission1_id": "s282979148", "submission2_id": "s175973756", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ns = input()\nK = int(input())\n\na_list = sorted(set(s))\nfor i in a_list:\n if K == 1:\n print(i)\n sys.exit()\n p = []\n for j, x in enumerate(s):\n if x == i:\n p.append(s[j:min(j+K,len(s))])\n p.sort()\n print(p)\n t = K\n for j in range(len(p)):\n if j != len(p) - 1:\n if p[j] == p[j+1][0:len(p[j])]:\n continue\n if len(p[j]) < t:\n t -= len(p[j]) - 1\n else:\n print(p[j][0:t])\n sys.exit()\n K = t - 1", "code2": "import sys\ns = input()\nK = int(input())\n\na_list = sorted(set(s))\nfor i in a_list:\n if K == 1:\n print(i)\n sys.exit()\n p = []\n for j, x in enumerate(s):\n if x == i:\n p.append(s[j:min(j+K,len(s))])\n p.sort()\n t = K\n for j in range(len(p)):\n if j != len(p) - 1:\n if p[j] == p[j+1][0:len(p[j])]:\n continue\n if len(p[j]) < t:\n t -= len(p[j]) - 1\n else:\n print(p[j][0:t])\n sys.exit()\n K = t - 1", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596136975", "date2": "1596136996", "bleu_score": "0.9755296011617722", "code1_test_status": [0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 11, "total_score": 103, "input": "bae\n2\n", "actual_output": "['ae']\nae\n", "expected_output": "ae\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " import sys\n s = input()\n K = int(input())\n \n a_list = sorted(set(s))\n for i in a_list:\n if K == 1:\n print(i)\n sys.exit()\n p = []\n for j, x in enumerate(s):\n if x == i:\n p.append(s[j:min(j+K,len(s))])\n p.sort()\n- print(p)\n t = K\n for j in range(len(p)):\n if j != len(p) - 1:\n if p[j] == p[j+1][0:len(p[j])]:\n continue\n if len(p[j]) < t:\n t -= len(p[j]) - 1\n else:\n print(p[j][0:t])\n sys.exit()\n K = t - 1\n", "FL_content": " import sys\n s = input()\n K = int(input())\n \n a_list = sorted(set(s))\n for i in a_list:\n if K == 1:\n print(i)\n sys.exit()\n p = []\n for j, x in enumerate(s):\n if x == i:\n p.append(s[j:min(j+K,len(s))])\n p.sort()\n- print(p)\n t = K\n for j in range(len(p)):\n if j != len(p) - 1:\n if p[j] == p[j+1][0:len(p[j])]:\n continue\n if len(p[j]) < t:\n t -= len(p[j]) - 1\n else:\n print(p[j][0:t])\n sys.exit()\n K = t - 1\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 26 }, { "user_id": "u593590006", "problem_id": "p03353", "submission1_id": "s692799811", "submission2_id": "s072312958", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nk=int(input())\nn=len(s)\nl=[]\nfor i in range(n):\n curr=''\n for j in range(i,n):\n curr+=s[j]\n l.append(curr)\nl.sort()\n\nprint(l[k-1])", "code2": "s=input()\nk=int(input())\nn=len(s)\nl=set()\nfor i in range(n):\n curr=''\n for j in range(i,min(i+7,n)):\n curr+=s[j]\n l.add(curr)\nl=[i for i in l]\nl.sort()\n\nprint(l[k-1])", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1572382071", "date2": "1572382629", "bleu_score": "0.8109290247511138", "code1_test_status": [0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0], "code1_test_score": 58, "total_score": 103, "input": "reedoctadmaredocta\n4\n", "actual_output": "ad\n", "expected_output": "adma\n\n", "anno_code": ["s=input() # (0): s=reedoctadmaredocta\nk=int(input()) # (1): k=4\nn=len(s) # (2): n=18\nl=[] # (3): l=[]\nfor i in range(n): # (4): i=0 (61): i=1 ... (571): NO CHANGE\n curr='' # (5): curr= (62): curr= ... (566): curr=\n for j in range(i,n): # (6): j=0 (9): j=1 ... (570): NO CHANGE\n curr+=s[j] # (7): curr=r (10): curr=re ... (568): curr=a\n l.append(curr) # (8): l=['r'] (11): l=['r', 're'] ... (569): l=[r, re, ..., ta, a]\nl.sort() # (572): l=[a, a, ..., tadmaredoct, tadmaredocta]\n\nprint(l[k-1])"], "anno_status": [true], "diff_content": " s=input()\n k=int(input())\n n=len(s)\n-l=[]\n+l=set()\n for i in range(n):\n curr=''\n- for j in range(i,n):\n+ for j in range(i,min(i+7,n)):\n curr+=s[j]\n- l.append(curr)\n+ l.add(curr)\n+l=[i for i in l]\n l.sort()\n \n print(l[k-1])\n", "FL_content": " s=input()\n k=int(input())\n n=len(s)\n-l=[]\n for i in range(n):\n curr=''\n- for j in range(i,n):\n curr+=s[j]\n- l.append(curr)\n l.sort()\n \n print(l[k-1])\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 12 }, { "user_id": "u411158173", "problem_id": "p03353", "submission1_id": "s250796085", "submission2_id": "s962965706", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nK = int(input())\nsubs = []\nprint(s[0:2])\nfor i in range(0, len(s)):\n for j in range(i+1, len(s)+1):\n if i == j:\n subs.append(s[i])\n else:\n subs.append(s[i:j])\nsubs = list(set(subs))\nsubs.sort()\nprint(subs[K-1])\n", "code2": "s = input()\nK = int(input())\nsubs = []\nfor i in range(0, len(s)):\n for j in range(i+1, i+K+1):\n if i == j:\n subs.append(s[i])\n else:\n subs.append(s[i:j])\nsubs = list(set(subs))\nsubs.sort()\nprint(subs[K-1])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1527006080", "date2": "1527006444", "bleu_score": "0.9137267154577692", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "b`a\n5\n", "actual_output": "b`\nb`\n", "expected_output": "b`\n\n", "anno_code": ["s = input() # (0): s=b`a\nK = int(input()) # (1): K=5\nsubs = [] # (2): subs=[]\nprint(s[0:2]) # (3): NO CHANGE\nfor i in range(0, len(s)): # (4): i=0 (15): i=1 ... (28): NO CHANGE\n for j in range(i+1, len(s)+1): # (5): j=1 (8): j=2 ... (27): NO CHANGE\n if i == j: # (6): NO CHANGE (9): NO CHANGE ... (25): NO CHANGE\n subs.append(s[i])\n else:\n subs.append(s[i:j]) # (7): subs=['b'] (10): subs=['b', 'b`'] ... (26): subs=['b', 'b`', 'b`a', '`', '`a', 'a']\nsubs = list(set(subs)) # (29): subs=['`', 'b', '`a', 'b`a', 'a', 'b`']\nsubs.sort() # (30): subs=['`', '`a', 'a', 'b', 'b`', 'b`a']\nprint(subs[K-1])\n"], "anno_status": [true], "diff_content": " s = input()\n K = int(input())\n subs = []\n-print(s[0:2])\n for i in range(0, len(s)):\n- for j in range(i+1, len(s)+1):\n+ for j in range(i+1, i+K+1):\n if i == j:\n subs.append(s[i])\n else:\n subs.append(s[i:j])\n subs = list(set(subs))\n subs.sort()\n print(subs[K-1])\n \n", "FL_content": " s = input()\n K = int(input())\n subs = []\n-print(s[0:2])\n for i in range(0, len(s)):\n- for j in range(i+1, len(s)+1):\n if i == j:\n subs.append(s[i])\n else:\n subs.append(s[i:j])\n subs = list(set(subs))\n subs.sort()\n print(subs[K-1])\n \n", "added_lines": 1, "removed_lines": 2, "code1_lines": 14 }, { "user_id": "u711539583", "problem_id": "p03353", "submission1_id": "s007139455", "submission2_id": "s017081610", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nk = int(input())\n\nn = len(s)\nstrs = set([])\n\nfor i in range(n):\n for j in range(i+1, n+1):\n strs.add(s[i:j])\nstrs = list(strs)\n\nprint(strs[k-1])\n", "code2": "s = input()\nk = int(input())\n\nn = len(s)\nstrs = set([])\n\nfor i in range(n):\n for j in range(i+1, min(i+k+1,n+1)):\n strs.add(s[i:j])\nstrs = list(strs)\nstrs.sort()\nprint(strs[k-1])\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1576814071", "date2": "1576905382", "bleu_score": "0.8623978676273416", "code1_test_status": [0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 19, "total_score": 103, "input": "atcoderandatcodeer\n5\n", "actual_output": "oder\n", "expected_output": "andat\n", "anno_code": ["s = input() # (0): s=atcoderandatcodeer\nk = int(input()) # (1): k=5\n\nn = len(s) # (2): n=18\nstrs = set([]) # (3): strs=set()\n\nfor i in range(n): # (4): i=0 (42): i=1 ... (382): NO CHANGE\n for j in range(i+1, n+1): # (5): j=1 (7): j=2 ... (381): NO CHANGE\n strs.add(s[i:j]) # (6): strs={'a'} (8): strs={'a', 'at'} ... (380): NO CHANGE\nstrs = list(strs) # (383): strs=[eran, oderandatcodeer, ..., coderandatcode, tcoderandatcodeer]\n\nprint(strs[k-1])\n"], "anno_status": [true], "diff_content": " s = input()\n k = int(input())\n \n n = len(s)\n strs = set([])\n \n for i in range(n):\n- for j in range(i+1, n+1):\n+ for j in range(i+1, min(i+k+1,n+1)):\n strs.add(s[i:j])\n strs = list(strs)\n-\n+strs.sort()\n print(strs[k-1])\n \n", "FL_content": " s = input()\n k = int(input())\n \n n = len(s)\n strs = set([])\n \n for i in range(n):\n- for j in range(i+1, n+1):\n strs.add(s[i:j])\n strs = list(strs)\n-\n print(strs[k-1])\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 13 }, { "user_id": "u557494880", "problem_id": "p03353", "submission1_id": "s981312708", "submission2_id": "s787635497", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nK = int(input())\nn = len(s)\nA =[]\nfor i in range(n):\n for j in range(i+1,n+1):\n sub = s[i:j] \n if sub not in A:\n if len(A) < K:\n A.append(sub)\n else:\n A.append(sub)\n A.sort()\n A.pop(K)\nprint(A[K-1])", "code2": "s = input()\nK = int(input())\nn = len(s)\nA =[]\nimport bisect\nfor i in range(n):\n for j in range(1,K+1):\n sub = s[i:i+j] \n if sub not in A:\n x = bisect.bisect_left(A,sub)\n A.insert(x,sub)\n if len(A) > K:\n A.pop(K)\n\nprint(A[K-1])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573785215", "date2": "1573785779", "bleu_score": "0.7577102389467677", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 103, "input": "eab\n6\n", "actual_output": "b\n", "expected_output": "eab\n\n", "anno_code": ["s = input() # (0): s=eab\nK = int(input()) # (1): K=6\nn = len(s) # (2): n=3\nA =[] # (3): A=[]\nfor i in range(n): # (4): i=0 (21): i=1 ... (40): NO CHANGE\n for j in range(i+1,n+1): # (5): j=1 (10): j=2 ... (39): NO CHANGE\n sub = s[i:j] # (6): sub=e (11): sub=ea ... (35): sub=b\n if sub not in A: # (7): NO CHANGE (12): NO CHANGE ... (36): NO CHANGE\n if len(A) < K: # (8): NO CHANGE (13): NO CHANGE ... (37): NO CHANGE\n A.append(sub) # (9): A=['e'] (14): A=['e', 'ea'] ... (38): A=['e', 'ea', 'eab', 'a', 'ab', 'b']\n else:\n A.append(sub)\n A.sort()\n A.pop(K)\nprint(A[K-1])"], "anno_status": [true], "diff_content": " s = input()\n K = int(input())\n n = len(s)\n A =[]\n+import bisect\n for i in range(n):\n- for j in range(i+1,n+1):\n- sub = s[i:j] \n+ for j in range(1,K+1):\n+ sub = s[i:i+j] \n if sub not in A:\n- if len(A) < K:\n- A.append(sub)\n- else:\n- A.append(sub)\n- A.sort()\n+ x = bisect.bisect_left(A,sub)\n+ A.insert(x,sub)\n+ if len(A) > K:\n A.pop(K)\n+\n print(A[K-1])\n", "FL_content": " s = input()\n K = int(input())\n n = len(s)\n A =[]\n for i in range(n):\n- for j in range(i+1,n+1):\n- sub = s[i:j] \n if sub not in A:\n- if len(A) < K:\n- A.append(sub)\n- else:\n- A.append(sub)\n- A.sort()\n A.pop(K)\n print(A[K-1])\n", "added_lines": 7, "removed_lines": 7, "code1_lines": 15 }, { "user_id": "u011062360", "problem_id": "p03353", "submission1_id": "s098410623", "submission2_id": "s898154594", "status1": "Wrong Answer", "status2": "Accepted", "code1": "list_S = list(input())\nk = int(input())\nset_ANS = set()\nlist_Alph = list(set(list_S))\nlist_Alph.sort()\ncnt = 0\n\nfor c in list_Alph:\n q = [i for i, x in enumerate(list_S) if x == c]\n for j in range(1, len(list_S)+1):\n for i in q:\n if i + j <= len(list_S):\n l = \"\".join(list_S[i:i+j])\n if l not in set_ANS:\n set_ANS.add(l)\n cnt += 1\n if cnt >= k:\n list_ANS = list(set_ANS)\n list_ANS.sort()\n print(list_ANS[k-1])\n exit()", "code2": "list_S = list(input())\nk = int(input())\nset_ANS = set()\nlist_Alph = list(set(list_S))\ncnt = 0\nlist_Alph.sort()\n\nfor c in list_Alph:\n q = [i for i, x in enumerate(list_S) if x == c]\n list_M = []\n for i in q:\n l = \"\".join(list_S[i:])\n list_M.append(l)\n list_M.sort()\n for s in list_M:\n m = list(s)\n for j in range(1,len(m)+1):\n b = \"\".join(m[:j])\n if b not in set_ANS:\n set_ANS.add(b)\n cnt += 1\n if cnt == k:\n print(b)\n exit()\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586031104", "date2": "1586033396", "bleu_score": "0.8654060346004614", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 83, "total_score": 103, "input": "rtcefeobmdatdaddor\n4\n", "actual_output": "at\n", "expected_output": "addo\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " list_S = list(input())\n k = int(input())\n set_ANS = set()\n list_Alph = list(set(list_S))\n-list_Alph.sort()\n cnt = 0\n+list_Alph.sort()\n \n for c in list_Alph:\n q = [i for i, x in enumerate(list_S) if x == c]\n- for j in range(1, len(list_S)+1):\n- for i in q:\n- if i + j <= len(list_S):\n- l = \"\".join(list_S[i:i+j])\n- if l not in set_ANS:\n- set_ANS.add(l)\n- cnt += 1\n- if cnt >= k:\n- list_ANS = list(set_ANS)\n- list_ANS.sort()\n- print(list_ANS[k-1])\n- exit()\n+ list_M = []\n+ for i in q:\n+ l = \"\".join(list_S[i:])\n+ list_M.append(l)\n+ list_M.sort()\n+ for s in list_M:\n+ m = list(s)\n+ for j in range(1,len(m)+1):\n+ b = \"\".join(m[:j])\n+ if b not in set_ANS:\n+ set_ANS.add(b)\n+ cnt += 1\n+ if cnt == k:\n+ print(b)\n+ exit()\n+\n+\n", "FL_content": " list_S = list(input())\n k = int(input())\n set_ANS = set()\n list_Alph = list(set(list_S))\n-list_Alph.sort()\n cnt = 0\n \n for c in list_Alph:\n q = [i for i, x in enumerate(list_S) if x == c]\n- for j in range(1, len(list_S)+1):\n- for i in q:\n- if i + j <= len(list_S):\n- l = \"\".join(list_S[i:i+j])\n- if l not in set_ANS:\n- set_ANS.add(l)\n- cnt += 1\n- if cnt >= k:\n- list_ANS = list(set_ANS)\n- list_ANS.sort()\n- print(list_ANS[k-1])\n- exit()\n", "added_lines": 18, "removed_lines": 13, "code1_lines": 21 }, { "user_id": "u672494157", "problem_id": "p03353", "submission1_id": "s661449400", "submission2_id": "s920772467", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nfrom functools import reduce\nimport copy\nimport math\n\n\nsys.setrecursionlimit(4100000)\n\n\ndef inputs(num_of_input):\n ins = [input() for i in range(num_of_input)]\n return ins\n\n\ndef solve(inputs):\n S = inputs[0]\n K = int(inputs[1])\n\n sets = set()\n print(K)\n for i in range(len(S)):\n j = i\n while j < len(S) and j - i <= K:\n j += 1\n sets.add(S[i:j])\n new_sets = set()\n\n for k in sets:\n for i in range(len(k)):\n j = i\n while j < len(k) and j - i <= K:\n j += 1\n new_sets.add(k[i:j])\n l = list(new_sets)\n l.sort()\n return l[K-1]\n\n\ndef string_to_int(string):\n return list(map(int, string.split()))\n\n\nif __name__ == \"__main__\":\n ret = solve(inputs(2))\n print(ret)\n", "code2": "import sys\nfrom functools import reduce\nimport copy\nimport math\n\n\nsys.setrecursionlimit(4100000)\n\n\ndef inputs(num_of_input):\n ins = [input() for i in range(num_of_input)]\n return ins\n\n\ndef solve(inputs):\n S = inputs[0]\n K = int(inputs[1])\n\n sets = set()\n for i in range(len(S)):\n j = i\n while j < len(S) and j - i <= K:\n j += 1\n sets.add(S[i:j])\n new_sets = set()\n\n for k in sets:\n for i in range(len(k)):\n j = i\n while j < len(k) and j - i <= K:\n j += 1\n new_sets.add(k[i:j])\n l = list(new_sets)\n l.sort()\n return l[K-1]\n\n\ndef string_to_int(string):\n return list(map(int, string.split()))\n\n\nif __name__ == \"__main__\":\n ret = solve(inputs(2))\n print(ret)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568254465", "date2": "1568254511", "bleu_score": "0.9836378759303366", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "eab\n6\n", "actual_output": "6\neab\n", "expected_output": "eab\n\n", "anno_code": ["import sys\nfrom functools import reduce\nimport copy\nimport math\n\n\nsys.setrecursionlimit(4100000) # (0): NO CHANGE\n\n\ndef inputs(num_of_input): # (1): inputs=\n ins = [input() for i in range(num_of_input)]\n return ins\n\n\ndef solve(inputs): # (2): solve=\n S = inputs[0]\n K = int(inputs[1])\n\n sets = set()\n print(K)\n for i in range(len(S)):\n j = i\n while j < len(S) and j - i <= K:\n j += 1\n sets.add(S[i:j])\n new_sets = set()\n\n for k in sets:\n for i in range(len(k)):\n j = i\n while j < len(k) and j - i <= K:\n j += 1\n new_sets.add(k[i:j])\n l = list(new_sets)\n l.sort()\n return l[K-1]\n\n\ndef string_to_int(string): # (3): string_to_int=\n return list(map(int, string.split()))\n\n\nif __name__ == \"__main__\":\n ret = solve(inputs(2))\n print(ret)\n"], "anno_status": [true], "diff_content": " import sys\n from functools import reduce\n import copy\n import math\n \n \n sys.setrecursionlimit(4100000)\n \n \n def inputs(num_of_input):\n ins = [input() for i in range(num_of_input)]\n return ins\n \n \n def solve(inputs):\n S = inputs[0]\n K = int(inputs[1])\n \n sets = set()\n- print(K)\n for i in range(len(S)):\n j = i\n while j < len(S) and j - i <= K:\n j += 1\n sets.add(S[i:j])\n new_sets = set()\n \n for k in sets:\n for i in range(len(k)):\n j = i\n while j < len(k) and j - i <= K:\n j += 1\n new_sets.add(k[i:j])\n l = list(new_sets)\n l.sort()\n return l[K-1]\n \n \n def string_to_int(string):\n return list(map(int, string.split()))\n \n \n if __name__ == \"__main__\":\n ret = solve(inputs(2))\n print(ret)\n \n", "FL_content": " import sys\n from functools import reduce\n import copy\n import math\n \n \n sys.setrecursionlimit(4100000)\n \n \n def inputs(num_of_input):\n ins = [input() for i in range(num_of_input)]\n return ins\n \n \n def solve(inputs):\n S = inputs[0]\n K = int(inputs[1])\n \n sets = set()\n- print(K)\n for i in range(len(S)):\n j = i\n while j < len(S) and j - i <= K:\n j += 1\n sets.add(S[i:j])\n new_sets = set()\n \n for k in sets:\n for i in range(len(k)):\n j = i\n while j < len(k) and j - i <= K:\n j += 1\n new_sets.add(k[i:j])\n l = list(new_sets)\n l.sort()\n return l[K-1]\n \n \n def string_to_int(string):\n return list(map(int, string.split()))\n \n \n if __name__ == \"__main__\":\n ret = solve(inputs(2))\n print(ret)\n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 46 }, { "user_id": "u915763824", "problem_id": "p03448", "submission1_id": "s801940214", "submission2_id": "s084890270", "status1": "Wrong Answer", "status2": "Accepted", "code1": "c500 = int(input())\nc100 = int(input())\nc50 = int(input())\nx = int(input())\ncount = 0\n \nfor c500_n in range(1, c500):\n for c100_n in range(1, c100):\n for c50_n in range(1, c50):\n if c500_n*500 + c100_n*100 + c50_n*50 == x:\n count += 1\n \nprint(count)", "code2": "c500 = int(input())\nc100 = int(input())\nc50 = int(input())\nx = int(input())\ncount = 0\n \nfor c500_n in range(c500+1):\n for c100_n in range(c100+1):\n for c50_n in range(c50+1):\n if c500_n*500 + c100_n*100 + c50_n*50 == x:\n count += 1\n \nprint(count)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594917365", "date2": "1594917579", "bleu_score": "0.9339400930508972", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0], "code1_test_score": 86, "total_score": 103, "input": "2\n0\n1\n000\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["c500 = int(input()) # (0): c500=2\nc100 = int(input()) # (1): c100=0\nc50 = int(input()) # (2): c50=1\nx = int(input()) # (3): x=0\ncount = 0 # (4): count=0\n \nfor c500_n in range(1, c500): # (5): c500_n=1 (7): NO CHANGE\n for c100_n in range(1, c100): # (6): NO CHANGE\n for c50_n in range(1, c50):\n if c500_n*500 + c100_n*100 + c50_n*50 == x:\n count += 1\n \nprint(count)"], "anno_status": [true], "diff_content": " c500 = int(input())\n c100 = int(input())\n c50 = int(input())\n x = int(input())\n count = 0\n \n-for c500_n in range(1, c500):\n- for c100_n in range(1, c100):\n- for c50_n in range(1, c50):\n+for c500_n in range(c500+1):\n+ for c100_n in range(c100+1):\n+ for c50_n in range(c50+1):\n if c500_n*500 + c100_n*100 + c50_n*50 == x:\n count += 1\n \n print(count)\n", "FL_content": " c500 = int(input())\n c100 = int(input())\n c50 = int(input())\n x = int(input())\n count = 0\n \n-for c500_n in range(1, c500):\n- for c100_n in range(1, c100):\n- for c50_n in range(1, c50):\n if c500_n*500 + c100_n*100 + c50_n*50 == x:\n count += 1\n \n print(count)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 13 }, { "user_id": "u513844316", "problem_id": "p03448", "submission1_id": "s364884144", "submission2_id": "s002126293", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A=int(input())\nB=int(input())\nC=int(input())\nX=int(input())\n\nc=0\nfor i in range(A):\n for j in range(B):\n for k in range(C):\n if 500*(i+1)+100*(j+1)+50*(k+1)==X:\n c+=1\n\nprint(c)", "code2": "A=int(input())\nB=int(input())\nC=int(input())\nX=int(input())\n\nc=0\nfor i in range(A+1):\n for j in range(B+1):\n for k in range(C+1):\n if 500*i+100*j+50*k==X:\n c+=1\n\nprint(c)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549779756", "date2": "1549779889", "bleu_score": "0.9092348382261609", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0], "code1_test_score": 86, "total_score": 103, "input": "2\n2\n5\n100\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["A=int(input()) # (0): A=2\nB=int(input()) # (1): B=2\nC=int(input()) # (2): C=5\nX=int(input()) # (3): X=100\n\nc=0 # (4): c=0\nfor i in range(A): # (5): i=0 (31): i=1 (57): NO CHANGE\n for j in range(B): # (6): j=0 (18): j=1 ... (56): NO CHANGE\n for k in range(C): # (7): k=0 (9): k=1 ... (55): NO CHANGE\n if 500*(i+1)+100*(j+1)+50*(k+1)==X: # (8): NO CHANGE (10): NO CHANGE ... (54): NO CHANGE\n c+=1\n\nprint(c)"], "anno_status": [true], "diff_content": " A=int(input())\n B=int(input())\n C=int(input())\n X=int(input())\n \n c=0\n-for i in range(A):\n- for j in range(B):\n- for k in range(C):\n- if 500*(i+1)+100*(j+1)+50*(k+1)==X:\n+for i in range(A+1):\n+ for j in range(B+1):\n+ for k in range(C+1):\n+ if 500*i+100*j+50*k==X:\n c+=1\n \n print(c)\n+\n", "FL_content": " A=int(input())\n B=int(input())\n C=int(input())\n X=int(input())\n \n c=0\n-for i in range(A):\n- for j in range(B):\n- for k in range(C):\n- if 500*(i+1)+100*(j+1)+50*(k+1)==X:\n c+=1\n \n print(c)\n", "added_lines": 5, "removed_lines": 4, "code1_lines": 13 }, { "user_id": "u296463304", "problem_id": "p03448", "submission1_id": "s059415823", "submission2_id": "s585526726", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=int(input(\"\"))\nb=int(input(\"\"))\nc=int(input(\"\"))\nx=int(input(\"\"))\ndef countcourse(r,t,y,u):\n cnt=0\n for h in range(r):\n for l in range(t):\n for o in range(y):\n if 500*h+100*l+50*o==u:\n cnt+=1\n return cnt\nprint(countcourse(a,b,c,x))", "code2": "a=int(input(\"\"))\nb=int(input(\"\"))\nc=int(input(\"\"))\nx=int(input(\"\"))\ndef countcourse(r,t,y,u):\n cnt=0\n n=0\n for h in range(r+1):\n for l in range(t+1):\n for o in range(y+1):\n if 500*h+100*l+50*o==u:\n cnt+=1\n return cnt\nprint(countcourse(a,b,c,x))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598272604", "date2": "1598275022", "bleu_score": "0.9395340583075859", "code1_test_status": [1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0], "code1_test_score": 92, "total_score": 103, "input": "5\n0\n0\n0\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["a=int(input(\"\")) # (0): a=5\nb=int(input(\"\")) # (1): b=0\nc=int(input(\"\")) # (2): c=0\nx=int(input(\"\")) # (3): x=0\ndef countcourse(r,t,y,u): # (4): countcourse=\n cnt=0 # (6): cnt=0\n for h in range(r): # (7): h=0 (9): h=1 ... (15): h=4\n for l in range(t): # (8): NO CHANGE (10): NO CHANGE ... (16): NO CHANGE\n for o in range(y):\n if 500*h+100*l+50*o==u:\n cnt+=1\n return cnt\nprint(countcourse(a,b,c,x)) # (5): r=5, t=0, y=0, u=0\n"], "anno_status": [true], "diff_content": " a=int(input(\"\"))\n b=int(input(\"\"))\n c=int(input(\"\"))\n x=int(input(\"\"))\n def countcourse(r,t,y,u):\n cnt=0\n- for h in range(r):\n- for l in range(t):\n- for o in range(y):\n+ n=0\n+ for h in range(r+1):\n+ for l in range(t+1):\n+ for o in range(y+1):\n if 500*h+100*l+50*o==u:\n cnt+=1\n return cnt\n print(countcourse(a,b,c,x))\n", "FL_content": " a=int(input(\"\"))\n b=int(input(\"\"))\n c=int(input(\"\"))\n x=int(input(\"\"))\n def countcourse(r,t,y,u):\n cnt=0\n- for h in range(r):\n- for l in range(t):\n- for o in range(y):\n if 500*h+100*l+50*o==u:\n cnt+=1\n return cnt\n print(countcourse(a,b,c,x))\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 13 }, { "user_id": "u728774856", "problem_id": "p03448", "submission1_id": "s932376171", "submission2_id": "s855503938", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A = int(input())\nB = int(input())\nC = int(input())\nX = int(input())\n\ncount = 0\nfor i in range(A+1):\n for j in range(B+1):\n for k in range(C+1):\n if 500*i + 100*j + 50*k == X:\n count += 1\n", "code2": "A = int(input())\nB = int(input())\nC = int(input())\nX = int(input())\n\ncount = 0\nfor i in range(A+1):\n for j in range(B+1):\n for k in range(C+1):\n if 500*i + 100*j + 50*k == X:\n count += 1\n \nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588474429", "date2": "1588475106", "bleu_score": "0.9056154701523061", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "2\n-6\n-1\n001\n", "actual_output": "no output\n", "expected_output": "0\n\n", "anno_code": ["A = int(input()) # (0): A=2\nB = int(input()) # (1): B=-6\nC = int(input()) # (2): C=-1\nX = int(input()) # (3): X=1\n\ncount = 0 # (4): count=0\nfor i in range(A+1): # (5): i=0 (7): i=1 (9): i=2\n for j in range(B+1): # (6): NO CHANGE (8): NO CHANGE (10): NO CHANGE\n for k in range(C+1):\n if 500*i + 100*j + 50*k == X:\n count += 1\n"], "anno_status": [true], "diff_content": " A = int(input())\n B = int(input())\n C = int(input())\n X = int(input())\n \n count = 0\n for i in range(A+1):\n for j in range(B+1):\n for k in range(C+1):\n if 500*i + 100*j + 50*k == X:\n count += 1\n-\n+ \n+print(count)\n", "FL_content": " A = int(input())\n B = int(input())\n C = int(input())\n X = int(input())\n \n count = 0\n for i in range(A+1):\n for j in range(B+1):\n for k in range(C+1):\n if 500*i + 100*j + 50*k == X:\n count += 1\n-\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u343150957", "problem_id": "p03448", "submission1_id": "s600658140", "submission2_id": "s112193544", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A = int(input())\nB = int(input())\nC = int(input())\nX = int(input())\n\nans = 0\nfor i in range(A):\n\tfor j in range(B):\n\t\tfor k in range(C):\n\t\t\tif i*500 + j*100 + k*50 == X:\n\t\t\t\tans +=1\n\nprint(ans)", "code2": "\nA = int(input())\nB = int(input())\nC = int(input())\nX = int(input())\n\nans = 0\nfor i in range(A+1):\n\tfor j in range(B+1):\n\t\tfor k in range(C+1):\n\t\t\tif i*500 + j*100 + k*50 == X:\n\t\t\t\tans +=1\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569290348", "date2": "1569290396", "bleu_score": "0.941810942436174", "code1_test_status": [1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0], "code1_test_score": 92, "total_score": 103, "input": "2\n0\n1\n000\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["A = int(input()) # (0): A=2\nB = int(input()) # (1): B=0\nC = int(input()) # (2): C=1\nX = int(input()) # (3): X=0\n\nans = 0 # (4): ans=0\nfor i in range(A): # (5): i=0 (7): i=1 (9): NO CHANGE\n\tfor j in range(B): # (6): NO CHANGE (8): NO CHANGE\n\t\tfor k in range(C):\n\t\t\tif i*500 + j*100 + k*50 == X:\n\t\t\t\tans +=1\n\nprint(ans)"], "anno_status": [true], "diff_content": "+\n A = int(input())\n B = int(input())\n C = int(input())\n X = int(input())\n \n ans = 0\n-for i in range(A):\n-\tfor j in range(B):\n-\t\tfor k in range(C):\n+for i in range(A+1):\n+\tfor j in range(B+1):\n+\t\tfor k in range(C+1):\n \t\t\tif i*500 + j*100 + k*50 == X:\n \t\t\t\tans +=1\n \n print(ans)\n", "FL_content": " A = int(input())\n B = int(input())\n C = int(input())\n X = int(input())\n \n ans = 0\n-for i in range(A):\n-\tfor j in range(B):\n-\t\tfor k in range(C):\n \t\t\tif i*500 + j*100 + k*50 == X:\n \t\t\t\tans +=1\n \n print(ans)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 13 }, { "user_id": "u516494592", "problem_id": "p03448", "submission1_id": "s721033324", "submission2_id": "s746558790", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A = int(input())\nB = int(input())\nC = int(input())\nX = int(input())\n\ncount = 0\n\nfor i in range(A + 1):\n for j in range(B + 1):\n for k in range(C + 1):\n total = 500 * A + 100 * B + 50 * C\n if total == X:\n count = count + 1\n\nprint(count)", "code2": "A = int(input())\nB = int(input())\nC = int(input())\nX = int(input())\n\ncount = 0\n\nfor a in range(A + 1):\n for b in range(B + 1):\n for c in range(C + 1):\n total = 500 * a + 100 * b + 50 * c\n if total == X:\n count = count + 1\n\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590289683", "date2": "1590289906", "bleu_score": "0.9461201516864589", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0], "code1_test_score": 86, "total_score": 103, "input": "5\n0\n1\n0\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["A = int(input()) # (0): A=5\nB = int(input()) # (1): B=0\nC = int(input()) # (2): C=1\nX = int(input()) # (3): X=0\n\ncount = 0 # (4): count=0\n\nfor i in range(A + 1): # (5): i=0 (15): i=1 ... (65): NO CHANGE\n for j in range(B + 1): # (6): j=0 (14): NO CHANGE ... (64): NO CHANGE\n for k in range(C + 1): # (7): k=0 (10): k=1 ... (63): NO CHANGE\n total = 500 * A + 100 * B + 50 * C # (8): total=2550 (11): NO CHANGE ... (61): NO CHANGE\n if total == X: # (9): NO CHANGE (12): NO CHANGE ... (62): NO CHANGE\n count = count + 1\n\nprint(count)"], "anno_status": [true], "diff_content": " A = int(input())\n B = int(input())\n C = int(input())\n X = int(input())\n \n count = 0\n \n-for i in range(A + 1):\n- for j in range(B + 1):\n- for k in range(C + 1):\n- total = 500 * A + 100 * B + 50 * C\n+for a in range(A + 1):\n+ for b in range(B + 1):\n+ for c in range(C + 1):\n+ total = 500 * a + 100 * b + 50 * c\n if total == X:\n count = count + 1\n \n print(count)\n", "FL_content": " A = int(input())\n B = int(input())\n C = int(input())\n X = int(input())\n \n count = 0\n \n-for i in range(A + 1):\n- for j in range(B + 1):\n- for k in range(C + 1):\n- total = 500 * A + 100 * B + 50 * C\n if total == X:\n count = count + 1\n \n print(count)\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 15 }, { "user_id": "u869919400", "problem_id": "p03448", "submission1_id": "s491519202", "submission2_id": "s919018400", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\nb = int(input())\nc = int(input())\nx = int(input())\n\ncount = 0\nfor i in range(a+1):\n for j in range(b+1):\n for k in range(c+1):\n if 500 * i + 100 * j + 50 * k == x:\n count += 1", "code2": "a = int(input())\nb = int(input())\nc = int(input())\nx = int(input())\n\ncount = 0\nfor i in range(a+1):\n for j in range(b+1):\n for k in range(c+1):\n if 500 * i + 100 * j + 50 * k == x:\n count += 1\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566680576", "date2": "1566680697", "bleu_score": "0.9457190336617247", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "30\n168\n252\n5860\n", "actual_output": "no output\n", "expected_output": "0\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " a = int(input())\n b = int(input())\n c = int(input())\n x = int(input())\n \n count = 0\n for i in range(a+1):\n for j in range(b+1):\n for k in range(c+1):\n if 500 * i + 100 * j + 50 * k == x:\n count += 1\n+print(count)\n", "FL_content": " a = int(input())\n b = int(input())\n c = int(input())\n x = int(input())\n \n count = 0\n for i in range(a+1):\n for j in range(b+1):\n for k in range(c+1):\n if 500 * i + 100 * j + 50 * k == x:\n count += 1\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u698348858", "problem_id": "p03448", "submission1_id": "s728029278", "submission2_id": "s213251245", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n \na = int(input())\nb = int(input())\nc = int(input())\nx = int(input())\n \ncnt = 0\nfor i in range(a):\n for j in range(b):\n for k in range(c):\n p = i * 500 + j * 100 + k * 50\n if p == x:\n cnt += 1\nprint(cnt)", "code2": "\n \na = int(input())\nb = int(input())\nc = int(input())\nx = int(input())\n \ncnt = 0\nfor i in range(a + 1):\n for j in range(b + 1):\n for k in range(c + 1):\n p = i * 500 + j * 100 + k * 50\n if p > x:\n break\n if p == x:\n cnt += 1\nprint(cnt)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576168487", "date2": "1576168810", "bleu_score": "0.8246940430544284", "code1_test_status": [1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0], "code1_test_score": 92, "total_score": 103, "input": "5\n0\n0\n0\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["\n \na = int(input()) # (0): a=5\nb = int(input()) # (1): b=0\nc = int(input()) # (2): c=0\nx = int(input()) # (3): x=0\n \ncnt = 0 # (4): cnt=0\nfor i in range(a): # (5): i=0 (7): i=1 ... (15): NO CHANGE\n for j in range(b): # (6): NO CHANGE (8): NO CHANGE ... (14): NO CHANGE\n for k in range(c):\n p = i * 500 + j * 100 + k * 50\n if p == x:\n cnt += 1\nprint(cnt)"], "anno_status": [true], "diff_content": " \n \n a = int(input())\n b = int(input())\n c = int(input())\n x = int(input())\n \n cnt = 0\n-for i in range(a):\n- for j in range(b):\n- for k in range(c):\n+for i in range(a + 1):\n+ for j in range(b + 1):\n+ for k in range(c + 1):\n p = i * 500 + j * 100 + k * 50\n+ if p > x:\n+ break\n if p == x:\n cnt += 1\n print(cnt)\n", "FL_content": " \n \n a = int(input())\n b = int(input())\n c = int(input())\n x = int(input())\n \n cnt = 0\n-for i in range(a):\n- for j in range(b):\n- for k in range(c):\n p = i * 500 + j * 100 + k * 50\n if p == x:\n cnt += 1\n print(cnt)\n", "added_lines": 5, "removed_lines": 3, "code1_lines": 15 }, { "user_id": "u122598824", "problem_id": "p03448", "submission1_id": "s634158389", "submission2_id": "s362639645", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A=int(input())\nB=int(input())\nC=int(input())\nX=int(input())\ncount=0\nfor i in range(A+1):\n for j in range(B+1):\n for k in range(C+1):\n if ((500*i)+(100*j)+(50*k))==0:\n count+=1\n\nprint(count)", "code2": "A=int(input())\nB=int(input())\nC=int(input())\nX=int(input())\ncount=0\nfor i in range(A+1):\n for j in range(B+1):\n for k in range(C+1):\n if ((500*i)+(100*j)+(50*k))==X:\n count+=1\n\nprint(count)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587319399", "date2": "1587319459", "bleu_score": "0.9887760724645923", "code1_test_status": [0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0], "code1_test_score": 54, "total_score": 103, "input": "30\n73\n134\n6415\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " A=int(input())\n B=int(input())\n C=int(input())\n X=int(input())\n count=0\n for i in range(A+1):\n for j in range(B+1):\n for k in range(C+1):\n- if ((500*i)+(100*j)+(50*k))==0:\n+ if ((500*i)+(100*j)+(50*k))==X:\n count+=1\n \n print(count)\n", "FL_content": " A=int(input())\n B=int(input())\n C=int(input())\n X=int(input())\n count=0\n for i in range(A+1):\n for j in range(B+1):\n for k in range(C+1):\n- if ((500*i)+(100*j)+(50*k))==0:\n count+=1\n \n print(count)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u914330401", "problem_id": "p03448", "submission1_id": "s904405654", "submission2_id": "s737386825", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a500 = int(input())\nb100 = int(input())\nc50 = int(input())\nX = int(input())\nans = 0\ngoukei = 0\nis_over = False\nfor i in range(a500):\n for j in range(b100):\n for k in range(c50):\n goukei = i * 500 + j * 100 + k * 50\n if goukei == X:\n ans += 1\nprint(ans)", "code2": "a500 = int(input())\nb100 = int(input())\nc50 = int(input())\nX = int(input())\nans = 0\ngoukei = 0\nis_over = False\nfor i in range(a500+1):\n for j in range(b100+1):\n for k in range(c50+1):\n goukei = i * 500 + j * 100 + k * 50\n if goukei == X:\n ans += 1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555278826", "date2": "1555279058", "bleu_score": "0.9620349823097949", "code1_test_status": [1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0], "code1_test_score": 92, "total_score": 103, "input": "2\n0\n1\n000\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["a500 = int(input()) # (0): a500=2\nb100 = int(input()) # (1): b100=0\nc50 = int(input()) # (2): c50=1\nX = int(input()) # (3): X=0\nans = 0 # (4): ans=0\ngoukei = 0 # (5): goukei=0\nis_over = False # (6): is_over=False\nfor i in range(a500): # (7): i=0 (9): i=1 (11): NO CHANGE\n for j in range(b100): # (8): NO CHANGE (10): NO CHANGE\n for k in range(c50):\n goukei = i * 500 + j * 100 + k * 50\n if goukei == X:\n ans += 1\nprint(ans)"], "anno_status": [true], "diff_content": " a500 = int(input())\n b100 = int(input())\n c50 = int(input())\n X = int(input())\n ans = 0\n goukei = 0\n is_over = False\n-for i in range(a500):\n- for j in range(b100):\n- for k in range(c50):\n+for i in range(a500+1):\n+ for j in range(b100+1):\n+ for k in range(c50+1):\n goukei = i * 500 + j * 100 + k * 50\n if goukei == X:\n ans += 1\n print(ans)\n", "FL_content": " a500 = int(input())\n b100 = int(input())\n c50 = int(input())\n X = int(input())\n ans = 0\n goukei = 0\n is_over = False\n-for i in range(a500):\n- for j in range(b100):\n- for k in range(c50):\n goukei = i * 500 + j * 100 + k * 50\n if goukei == X:\n ans += 1\n print(ans)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 14 }, { "user_id": "u370793182", "problem_id": "p03207", "submission1_id": "s240998566", "submission2_id": "s636268842", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\np = []\nmax = 0\nfor i in range(N):\n p.append(int(input()))\n if(p[i]>max):\n maxi = i\nsum = 0\nfor i in range(N):\n if(i == maxi):\n sum += p[i]/2\n else:\n sum += p[i]\nprint(sum)", "code2": "N = int(input())\np = []\nmax = 0\nfor i in range(N):\n p.append(int(input()))\np.sort()\nsum = 0\nfor i in range(N-1):\n sum += p[i]\nsum += p[N-1]/2\nprint(int(sum))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1544322627", "date2": "1544322999", "bleu_score": "0.65634533413981", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "3\n0\n7984\n100\n", "actual_output": "8034.0\n", "expected_output": "4092\n\n", "anno_code": ["N = int(input()) # (0): N=3\np = [] # (1): p=[]\nmax = 0 # (2): max=0\nfor i in range(N): # (3): i=0 (6): i=1 ... (14): NO CHANGE\n p.append(int(input())) # (4): p=[0] (7): p=[0, 7984] (11): p=[0, 7984, 100]\n if(p[i]>max): # (5): NO CHANGE (8): NO CHANGE (12): NO CHANGE\n maxi = i # (9): maxi=1 (13): maxi=2\nsum = 0 # (15): sum=0\nfor i in range(N): # (16): i=0 (19): i=1 ... (25): NO CHANGE\n if(i == maxi): # (17): NO CHANGE (20): NO CHANGE (23): NO CHANGE\n sum += p[i]/2 # (24): sum=8034.0\n else:\n sum += p[i] # (18): NO CHANGE (21): sum=7984\nprint(sum)"], "anno_status": [true], "diff_content": " N = int(input())\n p = []\n max = 0\n for i in range(N):\n p.append(int(input()))\n- if(p[i]>max):\n- maxi = i\n+p.sort()\n sum = 0\n-for i in range(N):\n- if(i == maxi):\n- sum += p[i]/2\n- else:\n- sum += p[i]\n-print(sum)\n+for i in range(N-1):\n+ sum += p[i]\n+sum += p[N-1]/2\n+print(int(sum))\n+\n", "FL_content": " N = int(input())\n p = []\n max = 0\n for i in range(N):\n p.append(int(input()))\n- if(p[i]>max):\n- maxi = i\n sum = 0\n-for i in range(N):\n- if(i == maxi):\n- sum += p[i]/2\n- else:\n- sum += p[i]\n-print(sum)\n", "added_lines": 6, "removed_lines": 8, "code1_lines": 14 }, { "user_id": "u859897687", "problem_id": "p03207", "submission1_id": "s578246842", "submission2_id": "s524254005", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\np=[int(input()) for i in range(n)]\nprint(sum(p)-max(p)/2)", "code2": "n=int(input())\np=[int(input()) for i in range(n)]\nprint(sum(p)-max(p)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553565784", "date2": "1553565838", "bleu_score": "0.9574533680683809", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "4\n4320\n402\n4320\n4320\n", "actual_output": "11202.0\n", "expected_output": "11202\n\n", "anno_code": ["n=int(input()) # (0): n=4\np=[int(input()) for i in range(n)] # (1): p=[4320, 402, 4320, 4320]\nprint(sum(p)-max(p)/2)"], "anno_status": [true], "diff_content": " n=int(input())\n p=[int(input()) for i in range(n)]\n-print(sum(p)-max(p)/2)\n+print(sum(p)-max(p)\n", "FL_content": " n=int(input())\n p=[int(input()) for i in range(n)]\n-print(sum(p)-max(p)/2)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u365858785", "problem_id": "p03207", "submission1_id": "s968595864", "submission2_id": "s634285799", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=int(input())\nb=[int(input()) for i in range(a)]\nprint(sum(b)-max(b)/2)\n ", "code2": "a=int(input())\nb=[int(input()) for i in range(a)]\nprint(int(sum(b)-max(b)/2))\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558158012", "date2": "1558158076", "bleu_score": "0.9265210237160726", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "3\n32\n7980\n4990\n", "actual_output": "9012.0\n", "expected_output": "9012\n\n", "anno_code": ["a=int(input()) # (0): a=3\nb=[int(input()) for i in range(a)] # (1): b=[32, 7980, 4990]\nprint(sum(b)-max(b)/2)\n "], "anno_status": [true], "diff_content": " a=int(input())\n b=[int(input()) for i in range(a)]\n-print(sum(b)-max(b)/2)\n+print(int(sum(b)-max(b)/2))\n \n", "FL_content": " a=int(input())\n b=[int(input()) for i in range(a)]\n-print(sum(b)-max(b)/2)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u084647893", "problem_id": "p03207", "submission1_id": "s243054655", "submission2_id": "s372440951", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\np = list()\nfor i in range(N):\n p.append(int(input()))\nsum = 0\nfor i in range(0,N):\n sum += p[i]\nprint(sum - max(p) + max(p)/2)\n", "code2": "N = int(input())\np = list()\nfor i in range(N):\n p.append(int(input()))\nsum = 0\nfor i in range(0,N):\n sum += p[i]\nprint(sum - max(p) + max(p)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1546905087", "date2": "1546905361", "bleu_score": "0.9764024401807828", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "3\n12\n11402\n1144\n", "actual_output": "6857.0\n", "expected_output": "6857\n\n", "anno_code": ["N = int(input()) # (0): N=3\np = list() # (1): p=[]\nfor i in range(N): # (2): i=0 (4): i=1 ... (8): NO CHANGE\n p.append(int(input())) # (3): p=[12] (5): p=[12, 11402] (7): p=[12, 11402, 1144]\nsum = 0 # (9): sum=0\nfor i in range(0,N): # (10): i=0 (12): i=1 ... (16): NO CHANGE\n sum += p[i] # (11): sum=12 (13): sum=11414 (15): sum=12558\nprint(sum - max(p) + max(p)/2)\n"], "anno_status": [true], "diff_content": " N = int(input())\n p = list()\n for i in range(N):\n p.append(int(input()))\n sum = 0\n for i in range(0,N):\n sum += p[i]\n-print(sum - max(p) + max(p)/2)\n+print(sum - max(p) + max(p)\n \n", "FL_content": " N = int(input())\n p = list()\n for i in range(N):\n p.append(int(input()))\n sum = 0\n for i in range(0,N):\n sum += p[i]\n-print(sum - max(p) + max(p)/2)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u745554846", "problem_id": "p03207", "submission1_id": "s191514781", "submission2_id": "s785778946", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\nb = []\nfor i in range(a):\n b.append(int(input()))\n \nb.sort()\n \nb[-1] = b[-1] / 2\n \nprint(sum(b))", "code2": "a = int(input())\nb = []\nfor i in range(a):\n b.append(int(input()))\n\nb.sort()\n\nb[-1] = b[-1] / 2\n\nprint(int(sum(b)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555700684", "date2": "1555700735", "bleu_score": "0.9022470187855975", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "3\n0\n4428\n52\n", "actual_output": "2266.0\n", "expected_output": "2266\n\n", "anno_code": ["a = int(input()) # (0): a=3\nb = [] # (1): b=[]\nfor i in range(a): # (2): i=0 (4): i=1 ... (8): NO CHANGE\n b.append(int(input())) # (3): b=[0] (5): b=[0, 4428] (7): b=[0, 4428, 52]\n \nb.sort() # (9): b=[0, 52, 4428]\n \nb[-1] = b[-1] / 2 # (10): b=[0, 52, 2214.0]\n \nprint(sum(b))"], "anno_status": [true], "diff_content": " a = int(input())\n b = []\n for i in range(a):\n- b.append(int(input()))\n- \n+ b.append(int(input()))\n+\n b.sort()\n- \n+\n b[-1] = b[-1] / 2\n- \n-print(sum(b))\n+\n+print(int(sum(b)))\n", "FL_content": " a = int(input())\n b = []\n for i in range(a):\n- b.append(int(input()))\n- \n b.sort()\n- \n b[-1] = b[-1] / 2\n- \n-print(sum(b))\n", "added_lines": 5, "removed_lines": 5, "code1_lines": 10 }, { "user_id": "u072723535", "problem_id": "p03207", "submission1_id": "s150048697", "submission2_id": "s918916373", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\np = [int(input()) for i in range(N)]\nprint(sum(p) - max(p)/2)\n", "code2": "N = int(input())\np = [int(input()) for i in range(N)]\nprint(sum(p) - max(p) ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569129798", "date2": "1569129905", "bleu_score": "0.948389032066652", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "3\n4\n4428\n173\n", "actual_output": "2391.0\n", "expected_output": "2391\n\n", "anno_code": ["N = int(input()) # (0): N=3\np = [int(input()) for i in range(N)] # (1): p=[4, 4428, 173]\nprint(sum(p) - max(p)/2)\n"], "anno_status": [true], "diff_content": " N = int(input())\n p = [int(input()) for i in range(N)]\n-print(sum(p) - max(p)/2)\n-\n+print(sum(p) - max(p) \n", "FL_content": " N = int(input())\n p = [int(input()) for i in range(N)]\n-print(sum(p) - max(p)/2)\n-\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 4 }, { "user_id": "u601235270", "problem_id": "p03207", "submission1_id": "s787473014", "submission2_id": "s793943763", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n =int(input())\np =[]\nfor i in range(n):\n a =int(input())\n p.append(a)\np.sort()\nnew_p =p[n-1]/2\nans =sum(p[:n-1])+new_p\nprint(new_p)\nprint(int(ans))", "code2": "n =int(input())\np =[]\nfor i in range(n):\n a =int(input())\n p.append(a)\np.sort()\nnew_p =p[n-1]/2\nans =sum(p[:n-1])+new_p\nprint(int(ans))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586650429", "date2": "1586650451", "bleu_score": "0.9119240402644279", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "3\n0\n4428\n99\n", "actual_output": "2214.0\n2313\n", "expected_output": "2313\n\n", "anno_code": ["n =int(input()) # (0): n=3\np =[] # (1): p=[]\nfor i in range(n): # (2): i=0 (5): i=1 ... (11): NO CHANGE\n a =int(input()) # (3): a=0 (6): a=4428 (9): a=99\n p.append(a) # (4): p=[0] (7): p=[0, 4428] (10): p=[0, 4428, 99]\np.sort() # (12): p=[0, 99, 4428]\nnew_p =p[n-1]/2 # (13): new_p=2214.0\nans =sum(p[:n-1])+new_p # (14): ans=2313.0\nprint(new_p) # (15): NO CHANGE\nprint(int(ans))"], "anno_status": [true], "diff_content": " n =int(input())\n p =[]\n for i in range(n):\n a =int(input())\n p.append(a)\n p.sort()\n new_p =p[n-1]/2\n ans =sum(p[:n-1])+new_p\n-print(new_p)\n print(int(ans))\n", "FL_content": " n =int(input())\n p =[]\n for i in range(n):\n a =int(input())\n p.append(a)\n p.sort()\n new_p =p[n-1]/2\n ans =sum(p[:n-1])+new_p\n-print(new_p)\n print(int(ans))\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u158628538", "problem_id": "p03207", "submission1_id": "s218362490", "submission2_id": "s007176161", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nm=0\ns=0\nfor i in range(n):\n p=int(input())\n s+=p\n m=max(m,p)\nprint(s-(m/2))", "code2": "n=int(input())\nm=0\ns=0\nfor i in range(n):\n p=int(input())\n s+=p\n m=max(m,p)\nprint(int(s-(m/2)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583029332", "date2": "1583029373", "bleu_score": "0.95121355843059", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "3\n1\n4428\n55\n", "actual_output": "2270.0\n", "expected_output": "2270\n\n", "anno_code": ["n=int(input()) # (0): n=3\nm=0 # (1): m=0\ns=0 # (2): s=0\nfor i in range(n): # (3): i=0 (7): i=1 ... (15): NO CHANGE\n p=int(input()) # (4): p=1 (8): p=4428 (12): p=55\n s+=p # (5): s=1 (9): s=4429 (13): s=4484\n m=max(m,p) # (6): m=1 (10): m=4428 (14): NO CHANGE\nprint(s-(m/2))"], "anno_status": [true], "diff_content": " n=int(input())\n m=0\n s=0\n for i in range(n):\n p=int(input())\n s+=p\n m=max(m,p)\n-print(s-(m/2))\n+print(int(s-(m/2)))\n", "FL_content": " n=int(input())\n m=0\n s=0\n for i in range(n):\n p=int(input())\n s+=p\n m=max(m,p)\n-print(s-(m/2))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u633548583", "problem_id": "p03207", "submission1_id": "s619471018", "submission2_id": "s471447564", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\np=[int(input()) for i in range(n)]\nq=max(p)\nprint(int(sum(p))-max(p)/2)\n", "code2": "n=int(input())\np=[int(input()) for i in range(n)]\nq=max(p)\nprint(int(sum(p))-int(max(p)/2))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573602279", "date2": "1573602459", "bleu_score": "0.9222423692142884", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "3\n4\n7980\n615\n", "actual_output": "4609.0\n", "expected_output": "4609\n\n", "anno_code": ["n=int(input()) # (0): n=3\np=[int(input()) for i in range(n)] # (1): p=[4, 7980, 615]\nq=max(p) # (2): q=7980\nprint(int(sum(p))-max(p)/2)\n"], "anno_status": [true], "diff_content": " n=int(input())\n p=[int(input()) for i in range(n)]\n q=max(p)\n-print(int(sum(p))-max(p)/2)\n+print(int(sum(p))-int(max(p)/2))\n \n", "FL_content": " n=int(input())\n p=[int(input()) for i in range(n)]\n q=max(p)\n-print(int(sum(p))-max(p)/2)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u385244248", "problem_id": "p03207", "submission1_id": "s185408008", "submission2_id": "s162473556", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,*p = map(int,open(0).read().split())\np.sort()\np[-1] /= 2\nprint(sum(p))\n", "code2": "N,*p = map(int,open(0).read().split())\np.sort()\np[-1] /= 2\nprint(int(sum(p)))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569736789", "date2": "1569736834", "bleu_score": "0.9312700864853667", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "4\n798\n582\n8452\n4320\n", "actual_output": "9926.0\n", "expected_output": "9926\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N,*p = map(int,open(0).read().split())\n p.sort()\n p[-1] /= 2\n-print(sum(p))\n+print(int(sum(p)))\n \n", "FL_content": " N,*p = map(int,open(0).read().split())\n p.sort()\n p[-1] /= 2\n-print(sum(p))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u651803486", "problem_id": "p03031", "submission1_id": "s664866393", "submission2_id": "s493907743", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\n\nn_switches = []\nswitches = []\nfor i in range(M):\n ipt = list(map(int, input().split()))\n n_switches.append(int(ipt[0]))\n switches.append(ipt[1:])\n\n\np = list(map(int, input().split()))\n\nans = 0\n\n\nfor i in range(N**2):\n ptn = bin(i)[2:].rjust(N, '0')\n\n allLight = True \n\n \n for j in range(M):\n\n n_light = 0\n \n for k in range(n_switches[j]):\n \n if ptn[switches[j][k] - 1] == '1':\n n_light += 1\n\n if n_light % 2 != p[j]:\n allLight = False\n break\n\n if allLight:\n ans += 1\n\nprint(ans)\n\n ", "code2": "N, M = map(int, input().split())\n\nn_switches = []\nswitches = []\nfor i in range(M):\n ipt = list(map(int, input().split()))\n n_switches.append(int(ipt[0]))\n switches.append(ipt[1:])\n\n\np = list(map(int, input().split()))\n\nans = 0\n\n\n\n\n\n\nfor i in range(2 ** N):\n ptn = bin(i)[2:].rjust(N, '0')\n\n allLight = True \n\n \n for j in range(M):\n\n n_light = 0\n \n for k in range(n_switches[j]):\n \n if ptn[switches[j][k] - 1] == '1':\n n_light += 1\n\n if n_light % 2 != p[j]:\n allLight = False\n break\n\n if allLight:\n ans += 1\n\nprint(ans)\n\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559780484", "date2": "1559795029", "bleu_score": "0.9840058335554991", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0], "code1_test_score": 62, "total_score": 103, "input": "1 0\n-1 1 5\n2 1\n0 0\n0 0 -2\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=1, M=0\n\nn_switches = [] # (1): n_switches=[]\nswitches = [] # (2): switches=[]\nfor i in range(M): # (3): NO CHANGE\n ipt = list(map(int, input().split()))\n n_switches.append(int(ipt[0]))\n switches.append(ipt[1:])\n\n\np = list(map(int, input().split())) # (4): p=[-1, 1, 5]\n\nans = 0 # (5): ans=0\n\n\nfor i in range(N**2): # (6): i=0 (12): NO CHANGE\n ptn = bin(i)[2:].rjust(N, '0') # (7): ptn=0\n\n allLight = True # (8): allLight=True\n\n \n for j in range(M): # (9): NO CHANGE\n\n n_light = 0\n \n for k in range(n_switches[j]):\n \n if ptn[switches[j][k] - 1] == '1':\n n_light += 1\n\n if n_light % 2 != p[j]:\n allLight = False\n break\n\n if allLight: # (10): NO CHANGE\n ans += 1 # (11): ans=1\n\nprint(ans)\n\n "], "anno_status": [true], "diff_content": " N, M = map(int, input().split())\n \n n_switches = []\n switches = []\n for i in range(M):\n ipt = list(map(int, input().split()))\n n_switches.append(int(ipt[0]))\n switches.append(ipt[1:])\n \n \n p = list(map(int, input().split()))\n \n ans = 0\n \n \n-for i in range(N**2):\n+\n+\n+\n+\n+for i in range(2 ** N):\n ptn = bin(i)[2:].rjust(N, '0')\n \n allLight = True \n \n \n for j in range(M):\n \n n_light = 0\n \n for k in range(n_switches[j]):\n \n if ptn[switches[j][k] - 1] == '1':\n n_light += 1\n \n if n_light % 2 != p[j]:\n allLight = False\n break\n \n if allLight:\n ans += 1\n \n print(ans)\n \n \n", "FL_content": " N, M = map(int, input().split())\n \n n_switches = []\n switches = []\n for i in range(M):\n ipt = list(map(int, input().split()))\n n_switches.append(int(ipt[0]))\n switches.append(ipt[1:])\n \n \n p = list(map(int, input().split()))\n \n ans = 0\n \n \n-for i in range(N**2):\n ptn = bin(i)[2:].rjust(N, '0')\n \n allLight = True \n \n \n for j in range(M):\n \n n_light = 0\n \n for k in range(n_switches[j]):\n \n if ptn[switches[j][k] - 1] == '1':\n n_light += 1\n \n if n_light % 2 != p[j]:\n allLight = False\n break\n \n if allLight:\n ans += 1\n \n print(ans)\n \n \n", "added_lines": 5, "removed_lines": 1, "code1_lines": 40 }, { "user_id": "u757117214", "problem_id": "p03031", "submission1_id": "s385693430", "submission2_id": "s820225434", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M=map(int,input().split())\nlights=[]\nfor i in range(M):\n k,*s=map(int,input().split())\n lights.append(list(map(lambda x:x-1,s)))\nP=list(map(int,input().split()))\ncnt=0\nfor b in range(1<>switch)&2:\n on_cnt+=1\n if on_cnt==0 or on_cnt%2 != P[m]:\n flg=False\n if flg:\n cnt+=1\nprint(cnt) ", "code2": "N,M=map(int,input().split())\nlights=[]\nfor i in range(M):\n k,*s=map(int,input().split())\n lights.append(list(map(lambda x:x-1,s)))\nP=list(map(int,input().split()))\ncnt=0\nfor b in range(1<>switch)&1:\n on_cnt+=1\n \n if on_cnt%2 != P[m]:\n flg=False\n if flg:\n cnt+=1\n \nprint(cnt) ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580691048", "date2": "1580691602", "bleu_score": "0.9455124091173454", "code1_test_status": [0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0], "code1_test_score": 92, "total_score": 103, "input": "2 2\n2 1 2\n1 2\n0 1\n", "actual_output": "0\n", "expected_output": "1\n", "anno_code": ["N,M=map(int,input().split()) # (0): N=2, M=2\nlights=[] # (1): lights=[]\nfor i in range(M): # (2): i=0 (5): i=1 (8): lights\n k,*s=map(int,input().split()) # (3): k=2, s=[1, 2] (6): k=1, s=[2]\n lights.append(list(map(lambda x:x-1,s))) # (4): lights (7): lights\nP=list(map(int,input().split())) # (9): lights, P=[0, 1]\ncnt=0 # (10): lights, cnt=0\nfor b in range(1<>switch)&2: # (16): lights (18): lights ... (87): lights\n on_cnt+=1 # (57): lights, on_cnt=1 (78): lights, on_cnt=1\n if on_cnt==0 or on_cnt%2 != P[m]: # (20): lights (27): lights ... (89): lights\n flg=False # (21): lights, flg=False (28): lights ... (90): lights\n if flg: # (30): lights (50): lights ... (92): lights\n cnt+=1\nprint(cnt) "], "anno_status": [true], "diff_content": " N,M=map(int,input().split())\n lights=[]\n for i in range(M):\n k,*s=map(int,input().split())\n lights.append(list(map(lambda x:x-1,s)))\n P=list(map(int,input().split()))\n cnt=0\n for b in range(1<>switch)&2:\n+ if (b>>switch)&1:\n on_cnt+=1\n- if on_cnt==0 or on_cnt%2 != P[m]:\n+ \n+ if on_cnt%2 != P[m]:\n flg=False\n if flg:\n cnt+=1\n+ \n print(cnt) \n", "FL_content": " N,M=map(int,input().split())\n lights=[]\n for i in range(M):\n k,*s=map(int,input().split())\n lights.append(list(map(lambda x:x-1,s)))\n P=list(map(int,input().split()))\n cnt=0\n for b in range(1<>switch)&2:\n on_cnt+=1\n- if on_cnt==0 or on_cnt%2 != P[m]:\n flg=False\n if flg:\n cnt+=1\n print(cnt) \n", "added_lines": 5, "removed_lines": 2, "code1_lines": 19 }, { "user_id": "u735460540", "problem_id": "p03031", "submission1_id": "s178870194", "submission2_id": "s362638042", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\n\nk = []\n\nfor i in range(m):\n k.append(list(map(int, input().split())))\n\np = list(map(int, input().split()))\n\nans = 0\n\nfor i in range(2**n):\n switch = [0] * n\n for j in range(n):\n if i >> j & 1 == 1:\n switch[j] += 1\n cntt = 0\n for j in range(m):\n cnt = 0\n for s in range(1, k[j][0]+1):\n if switch[s-1] == 1:\n cnt += 1\n if cnt%2 != p[j]:\n cntt += 1\n break\n if cntt == 0:\n ans += 1\n\nprint(ans)", "code2": "n, m = map(int, input().split())\n\nk = []\n\nfor i in range(m):\n k.append(list(map(int, input().split())))\n\np = list(map(int, input().split()))\n\nans = 0\n\nfor i in range(2**n):\n switch = [0] * n\n for j in range(n):\n if i >> j & 1 == 1:\n switch[j] += 1\n cntt = 0\n for j in range(m):\n cnt = 0\n for s in range(1, k[j][0]+1):\n if switch[k[j][s]-1] == 1:\n cnt += 1\n if cnt%2 == p[j]:\n cntt += 1\n if cntt == m:\n ans += 1\n\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589018370", "date2": "1589019788", "bleu_score": "0.9533737774646955", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 101, "total_score": 103, "input": "2 2\n1 1 2\n1 2\n0 0\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=2, m=2\n\nk = [] # (1): k=[]\n\nfor i in range(m): # (2): i=0 (4): i=1 (6): k\n k.append(list(map(int, input().split()))) # (3): k (5): k\n\np = list(map(int, input().split())) # (7): k, p=[0, 0]\n\nans = 0 # (8): k, ans=0\n\nfor i in range(2**n): # (9): k, i=0 (32): k, i=1 ... (95): k\n switch = [0] * n # (10): k, switch=[0, 0] (33): k ... (76): k, switch=[0, 0]\n for j in range(n): # (11): k, j=0 (13): k, j=1 ... (83): k\n if i >> j & 1 == 1: # (12): k (14): k ... (81): k\n switch[j] += 1 # (36): k, switch=[1, 0] (57): k, switch=[0, 1] ... (82): k, switch=[1, 1]\n cntt = 0 # (16): k, cntt=0 (40): k ... (84): k\n for j in range(m): # (17): k, j=0 (23): k, j=1 ... (85): k, j=0\n cnt = 0 # (18): k, cnt=0 (24): k ... (86): k\n for s in range(1, k[j][0]+1): # (19): k, s=1 (21): k ... (90): k\n if switch[s-1] == 1: # (20): k (26): k ... (88): k\n cnt += 1 # (45): k, cnt=1 (89): k, cnt=1\n if cnt%2 != p[j]: # (22): k (28): k ... (91): k\n cntt += 1 # (48): k, cntt=1 (92): k, cntt=1\n break # (49): k (93): k\n if cntt == 0: # (30): k (50): k ... (94): k\n ans += 1 # (31): k, ans=1 (74): k, ans=2\n\nprint(ans)"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n \n k = []\n \n for i in range(m):\n k.append(list(map(int, input().split())))\n \n p = list(map(int, input().split()))\n \n ans = 0\n \n for i in range(2**n):\n switch = [0] * n\n for j in range(n):\n if i >> j & 1 == 1:\n switch[j] += 1\n cntt = 0\n for j in range(m):\n cnt = 0\n for s in range(1, k[j][0]+1):\n- if switch[s-1] == 1:\n+ if switch[k[j][s]-1] == 1:\n cnt += 1\n- if cnt%2 != p[j]:\n+ if cnt%2 == p[j]:\n cntt += 1\n- break\n- if cntt == 0:\n+ if cntt == m:\n ans += 1\n \n print(ans)\n", "FL_content": " n, m = map(int, input().split())\n \n k = []\n \n for i in range(m):\n k.append(list(map(int, input().split())))\n \n p = list(map(int, input().split()))\n \n ans = 0\n \n for i in range(2**n):\n switch = [0] * n\n for j in range(n):\n if i >> j & 1 == 1:\n switch[j] += 1\n cntt = 0\n for j in range(m):\n cnt = 0\n for s in range(1, k[j][0]+1):\n- if switch[s-1] == 1:\n cnt += 1\n- if cnt%2 != p[j]:\n cntt += 1\n- break\n- if cntt == 0:\n ans += 1\n \n print(ans)\n", "added_lines": 3, "removed_lines": 4, "code1_lines": 29 }, { "user_id": "u742590876", "problem_id": "p03031", "submission1_id": "s419143436", "submission2_id": "s836007868", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\nks = [[int(i) for i in input().split()][1:] for _ in range(m)]\np = list(map(int, input().split()))\n\nans = 0\nfor i in range(2 ** n):\n for j in range(m):\n cnt = 0\n for k in range(n):\n if i >> j & 1 and k + 1 in ks[j]:\n cnt += 1\n if cnt % 2 != p[j]:\n break\n else:\n ans += 1\nprint(ans)", "code2": "n, m = map(int, input().split())\nks = [[int(i) for i in input().split()][1:] for _ in range(m)]\np = list(map(int, input().split()))\n\nans = 0\nfor i in range(2 ** n):\n for j in range(m):\n cnt = 0\n for k in range(n):\n if i >> k & 1 and k + 1 in ks[j]:\n cnt += 1\n if cnt % 2 != p[j]:\n break\n else:\n ans += 1\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598943173", "date2": "1598943258", "bleu_score": "0.9934682067285332", "code1_test_status": [0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0], "code1_test_score": 85, "total_score": 103, "input": "2 3\n2 1 2\n1 1\n1 2\n0 1 0\n", "actual_output": "2\n", "expected_output": "0\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=2, m=3\nks = [[int(i) for i in input().split()][1:] for _ in range(m)] # (1): ks\np = list(map(int, input().split())) # (2): ks, p=[0, 1, 0]\n\nans = 0 # (3): ks, ans=0\nfor i in range(2 ** n): # (4): ks, i=0 (22): ks, i=1 ... (100): ks\n for j in range(m): # (5): ks, j=0 (13): ks, j=1 ... (98): ks\n cnt = 0 # (6): ks, cnt=0 (14): ks ... (91): ks, cnt=0\n for k in range(n): # (7): ks, k=0 (9): ks, k=1 ... (96): ks\n if i >> j & 1 and k + 1 in ks[j]: # (8): ks (10): ks ... (95): ks\n cnt += 1 # (27): ks, cnt=1 (30): ks, cnt=2 ... (85): ks, cnt=1\n if cnt % 2 != p[j]: # (12): ks (20): ks ... (97): ks\n break # (21): ks (41): ks\n else:\n ans += 1 # (69): ks, ans=1 (99): ks, ans=2\nprint(ans)"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n ks = [[int(i) for i in input().split()][1:] for _ in range(m)]\n p = list(map(int, input().split()))\n \n ans = 0\n for i in range(2 ** n):\n for j in range(m):\n cnt = 0\n for k in range(n):\n- if i >> j & 1 and k + 1 in ks[j]:\n+ if i >> k & 1 and k + 1 in ks[j]:\n cnt += 1\n if cnt % 2 != p[j]:\n break\n else:\n ans += 1\n print(ans)\n", "FL_content": " n, m = map(int, input().split())\n ks = [[int(i) for i in input().split()][1:] for _ in range(m)]\n p = list(map(int, input().split()))\n \n ans = 0\n for i in range(2 ** n):\n for j in range(m):\n cnt = 0\n for k in range(n):\n- if i >> j & 1 and k + 1 in ks[j]:\n cnt += 1\n if cnt % 2 != p[j]:\n break\n else:\n ans += 1\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u861466636", "problem_id": "p03031", "submission1_id": "s501819462", "submission2_id": "s038087543", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nN, M = map(int, input().split())\nlight_s_dict = dict()\nlight_n_dict = dict()\n\n\nfor i in range(1, M+1):\n l = [int(j) for j in input().split()]\n connected_s = [0]*N\n for s in l[1:]:\n connected_s[s-1] = 1\n light_s_dict[i] = connected_s\n light_n_dict[i] = l[0]\n\n\ns_patterns = []\nfor i in range(2**N):\n p_str = bin(i)[2:].zfill(N)\n s_patterns.append([int(i) for i in list(p_str)])\n \n\nlight_conditions = [int(p) for p in input().split()]\n\n\nans = 0\nfor pattern in s_patterns:\n cond = 0\n for light in range(1, M+1): \n for i, p in enumerate(pattern):\n if p == 1:\n cond += light_s_dict[light][i]\n if cond % 2 != light_conditions[light-1]:\n break\n else: \n ans += 1\nprint(ans)", "code2": "\n\n\nN, M = map(int, input().split())\n\nlight_s_dict = dict()\n\nfor i in range(M):\n l = [int(j) for j in input().split()]\n connected_s = [0]*N\n for s in l[1:]:\n connected_s[s-1] = 1\n light_s_dict[i] = connected_s\n\n\ns_patterns = []\nfor i in range(2**N):\n p_str = bin(i)[2:].zfill(N)\n s_patterns.append([int(i) for i in list(p_str)])\n \n\nlight_conditions = [int(p) for p in input().split()]\n\n\nans = 0\nfor pattern in s_patterns:\n for light in range(M): \n cond = 0 \n for i, p in enumerate(pattern): \n if p == 1:\n cond += light_s_dict[light][i] \n if cond % 2 != light_conditions[light]:\n break\n else: \n ans += 1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558922064", "date2": "1558922614", "bleu_score": "0.906138784057539", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "2 3\n2 1 2\n1 1\n1 2\n0 1 0\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["\n\n\nN, M = map(int, input().split()) # (0): N=2, M=3\nlight_s_dict = dict() # (1): light_s_dict={}\nlight_n_dict = dict() # (2): light_n_dict={}\n\n\nfor i in range(1, M+1): # (3): i=1 (13): i=2 ... (29): NO CHANGE\n l = [int(j) for j in input().split()] # (4): l=[2, 1, 2] (14): l=[1, 1] (22): l=[1, 2]\n connected_s = [0]*N # (5): connected_s=[0, 0] (15): connected_s=[0, 0] (23): connected_s=[0, 0]\n for s in l[1:]: # (6): s=1 (8): s=2 ... (26): NO CHANGE\n connected_s[s-1] = 1 # (7): connected_s=[1, 0] (9): connected_s=[1, 1] ... (25): connected_s=[0, 1]\n light_s_dict[i] = connected_s # (11): light_s_dict={1: [1, 1]} (19): light_s_dict={1: [1, 1], 2: [1, 0]} (27): light_s_dict={1: [1, 1], 2: [1, 0], 3: [0, 1]}\n light_n_dict[i] = l[0] # (12): light_n_dict={1: 2} (20): light_n_dict={1: 2, 2: 1} (28): light_n_dict={1: 2, 2: 1, 3: 1}\n\n\ns_patterns = [] # (30): s_patterns=[]\nfor i in range(2**N): # (31): i=0 (34): i=1 ... (43): NO CHANGE\n p_str = bin(i)[2:].zfill(N) # (32): p_str=00 (35): p_str=01 ... (41): p_str=11\n s_patterns.append([int(i) for i in list(p_str)]) # (33): s_patterns (36): s_patterns ... (42): s_patterns\n \n\nlight_conditions = [int(p) for p in input().split()] # (44): light_conditions=[0, 1, 0]\n\n\nans = 0 # (45): ans=0\nfor pattern in s_patterns: # (46): pattern=[0, 0] (63): pattern=[0, 1] ... (116): NO CHANGE\n cond = 0 # (47): cond=0 (64): NO CHANGE ... (86): cond=0\n for light in range(1, M+1): # (48): light=1 (55): light=2 ... (114): NO CHANGE\n for i, p in enumerate(pattern): # (49): i=0, p=0 (51): i=1 ... (112): NO CHANGE\n if p == 1: # (50): NO CHANGE (52): NO CHANGE ... (110): NO CHANGE\n cond += light_s_dict[light][i] # (70): cond=1 (79): cond=1 ... (111): cond=4\n if cond % 2 != light_conditions[light-1]: # (54): NO CHANGE (61): NO CHANGE ... (113): NO CHANGE\n break # (62): NO CHANGE (73): NO CHANGE (84): NO CHANGE\n else: \n ans += 1 # (115): ans=1\nprint(ans)"], "anno_status": [false], "diff_content": " \n \n \n N, M = map(int, input().split())\n-light_s_dict = dict()\n-light_n_dict = dict()\n \n+light_s_dict = dict()\n \n-for i in range(1, M+1):\n+for i in range(M):\n l = [int(j) for j in input().split()]\n connected_s = [0]*N\n for s in l[1:]:\n connected_s[s-1] = 1\n light_s_dict[i] = connected_s\n- light_n_dict[i] = l[0]\n \n \n s_patterns = []\n for i in range(2**N):\n p_str = bin(i)[2:].zfill(N)\n s_patterns.append([int(i) for i in list(p_str)])\n \n \n light_conditions = [int(p) for p in input().split()]\n \n \n ans = 0\n for pattern in s_patterns:\n- cond = 0\n- for light in range(1, M+1): \n- for i, p in enumerate(pattern):\n+ for light in range(M): \n+ cond = 0 \n+ for i, p in enumerate(pattern): \n if p == 1:\n- cond += light_s_dict[light][i]\n- if cond % 2 != light_conditions[light-1]:\n+ cond += light_s_dict[light][i] \n+ if cond % 2 != light_conditions[light]:\n break\n else: \n ans += 1\n print(ans)\n", "FL_content": " \n \n \n N, M = map(int, input().split())\n-light_s_dict = dict()\n-light_n_dict = dict()\n \n \n-for i in range(1, M+1):\n l = [int(j) for j in input().split()]\n connected_s = [0]*N\n for s in l[1:]:\n connected_s[s-1] = 1\n light_s_dict[i] = connected_s\n- light_n_dict[i] = l[0]\n \n \n s_patterns = []\n for i in range(2**N):\n p_str = bin(i)[2:].zfill(N)\n s_patterns.append([int(i) for i in list(p_str)])\n \n \n light_conditions = [int(p) for p in input().split()]\n \n \n ans = 0\n for pattern in s_patterns:\n- cond = 0\n- for light in range(1, M+1): \n- for i, p in enumerate(pattern):\n if p == 1:\n- cond += light_s_dict[light][i]\n- if cond % 2 != light_conditions[light-1]:\n break\n else: \n ans += 1\n print(ans)\n", "added_lines": 7, "removed_lines": 9, "code1_lines": 38 }, { "user_id": "u174181999", "problem_id": "p03031", "submission1_id": "s423770345", "submission2_id": "s323989400", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\nl = []\nfor _ in range(M):\n l.append(list(map(int, input().split())))\np = list(map(int, input().split()))\n\nm = [0] * M \ncnt1 = 0 \ncnt2 = 0 \n\nfor i in range(2 ** N):\n for j in range(M):\n for k in range(l[j][0]):\n if (i >> (l[j][k+1] - 1) & 1):\n cnt1 += 1\n if cnt1 % 2 == p[j-1]:\n m[j-1] = 1\n cnt1 = 0\n if m == [1] * M:\n cnt2 += 1\n m = [0] * M\nprint(cnt2)", "code2": "N, M = map(int, input().split())\nl = []\nfor _ in range(M):\n l.append(list(map(int, input().split())))\np = list(map(int, input().split()))\n\nm = [0] * M \ncnt1 = 0 \ncnt2 = 0 \n\nfor i in range(2 ** N):\n for j in range(M):\n for k in range(l[j][0]):\n if (i >> (l[j][k+1] - 1) & 1):\n cnt1 += 1\n if cnt1 % 2 == p[j]:\n m[j] = 1\n cnt1 = 0\n if m == [1] * M:\n cnt2 += 1\n m = [0] * M\nprint(cnt2)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590021553", "date2": "1590022510", "bleu_score": "0.9831525222035907", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "2 3\n2 1 2\n1 1\n0 2\n0 0 1\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=2, M=3\nl = [] # (1): l=[]\nfor _ in range(M): # (2): _=0 (4): _=1 ... (8): l\n l.append(list(map(int, input().split()))) # (3): l=[[2, 1, 2]] (5): l (7): l\np = list(map(int, input().split())) # (9): l, p=[0, 0, 1]\n\nm = [0] * M # (10): l, m=[0, 0, 0]\ncnt1 = 0 # (11): l, cnt1=0\ncnt2 = 0 # (12): l, cnt2=0\n\nfor i in range(2 ** N): # (13): l, i=0 (37): l, i=1 ... (116): l\n for j in range(M): # (14): l, j=0 (22): l, j=1 ... (113): l\n for k in range(l[j][0]): # (15): l, k=0 (17): l, k=1 ... (109): l\n if (i >> (l[j][k+1] - 1) & 1): # (16): l (18): l ... (103): l\n cnt1 += 1 # (41): l, cnt1=1 (51): l, cnt1=1 ... (104): l, cnt1=1\n if cnt1 % 2 == p[j-1]: # (20): l (26): l ... (110): l\n m[j-1] = 1 # (27): l, m=[1, 0, 0] (32): l, m=[1, 1, 0] ... (111): l, m=[0, 1, 0]\n cnt1 = 0 # (21): l (28): l ... (112): l\n if m == [1] * M: # (35): l (61): l ... (114): l\n cnt2 += 1 # (88): l, cnt2=1\n m = [0] * M # (36): l, m=[0, 0, 0] (62): l, m=[0, 0, 0] ... (115): l, m=[0, 0, 0]\nprint(cnt2)"], "anno_status": [true], "diff_content": " N, M = map(int, input().split())\n l = []\n for _ in range(M):\n l.append(list(map(int, input().split())))\n p = list(map(int, input().split()))\n \n m = [0] * M \n cnt1 = 0 \n cnt2 = 0 \n \n for i in range(2 ** N):\n for j in range(M):\n for k in range(l[j][0]):\n if (i >> (l[j][k+1] - 1) & 1):\n cnt1 += 1\n- if cnt1 % 2 == p[j-1]:\n- m[j-1] = 1\n+ if cnt1 % 2 == p[j]:\n+ m[j] = 1\n cnt1 = 0\n if m == [1] * M:\n cnt2 += 1\n m = [0] * M\n print(cnt2)\n", "FL_content": " N, M = map(int, input().split())\n l = []\n for _ in range(M):\n l.append(list(map(int, input().split())))\n p = list(map(int, input().split()))\n \n m = [0] * M \n cnt1 = 0 \n cnt2 = 0 \n \n for i in range(2 ** N):\n for j in range(M):\n for k in range(l[j][0]):\n if (i >> (l[j][k+1] - 1) & 1):\n cnt1 += 1\n- if cnt1 % 2 == p[j-1]:\n- m[j-1] = 1\n cnt1 = 0\n if m == [1] * M:\n cnt2 += 1\n m = [0] * M\n print(cnt2)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 22 }, { "user_id": "u889919275", "problem_id": "p03031", "submission1_id": "s318214017", "submission2_id": "s644939042", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\nk_list = [list(map(int, input().split()))[1:] for _ in range(m)]\np_list = list(map(int, input().split()))\n\nans = 0\nfor bit in range(2**n):\n check = True\n for k, p in zip(k_list, p_list):\n count = 0\n for i in range(n):\n if bit & (1 << i):\n if i in k:\n count += 1\n if (count%2) != p:\n check = False\n break\n if check:\n ans += 1\n \nprint(ans)", "code2": "N, M = map(int, input().split())\nks = []\nfor _ in range(M):\n ks.append(list(map(int, input().split())))\np = list(map(int, input().split()))\n\nans = 0\nfor bit in range(2**N):\n on_list = []\n for i in range(N):\n if bit & (1 << i):\n on_list.append(i+1)\n flag = True\n for s, p_ in zip(ks, p):\n on_sum = len(list(set(on_list) & set(s[1:])))\n if on_sum % 2 != p_:\n flag = False\n break\n \n if flag:\n ans += 1\n \nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592881497", "date2": "1595903347", "bleu_score": "0.7452275335339373", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 99, "total_score": 103, "input": "2 2\n1 1 2\n1 2\n0 0\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=2, m=2\nk_list = [list(map(int, input().split()))[1:] for _ in range(m)] # (1): k_list\np_list = list(map(int, input().split())) # (2): k_list, p_list=[0, 0]\n\nans = 0 # (3): k_list, ans=0\nfor bit in range(2**n): # (4): k_list, bit=0 (25): k_list, bit=1 ... (79): k_list\n check = True # (5): k_list, check=True (26): k_list ... (64): k_list, check=True\n for k, p in zip(k_list, p_list): # (6): k_list, k=[1, 2], p=0 (14): k_list, k=[2] ... (65): k_list\n count = 0 # (7): k_list, count=0 (15): k_list ... (66): k_list, count=0\n for i in range(n): # (8): k_list, i=0 (10): k_list, i=1 ... (74): k_list\n if bit & (1 << i): # (9): k_list (11): k_list ... (71): k_list\n if i in k: # (31): k_list (40): k_list ... (72): k_list\n count += 1 # (57): k_list, count=1 (73): k_list, count=1\n if (count%2) != p: # (13): k_list (21): k_list ... (75): k_list\n check = False # (60): k_list, check=False (76): k_list, check=False\n break # (61): k_list (77): k_list\n if check: # (23): k_list (46): k_list ... (78): k_list\n ans += 1 # (24): k_list, ans=1 (47): k_list, ans=2\n \nprint(ans)"], "anno_status": [true], "diff_content": "-n, m = map(int, input().split())\n-k_list = [list(map(int, input().split()))[1:] for _ in range(m)]\n-p_list = list(map(int, input().split()))\n+N, M = map(int, input().split())\n+ks = []\n+for _ in range(M):\n+ ks.append(list(map(int, input().split())))\n+p = list(map(int, input().split()))\n \n ans = 0\n-for bit in range(2**n):\n- check = True\n- for k, p in zip(k_list, p_list):\n- count = 0\n- for i in range(n):\n- if bit & (1 << i):\n- if i in k:\n- count += 1\n- if (count%2) != p:\n- check = False\n+for bit in range(2**N):\n+ on_list = []\n+ for i in range(N):\n+ if bit & (1 << i):\n+ on_list.append(i+1)\n+ flag = True\n+ for s, p_ in zip(ks, p):\n+ on_sum = len(list(set(on_list) & set(s[1:])))\n+ if on_sum % 2 != p_:\n+ flag = False\n break\n- if check:\n+ \n+ if flag:\n ans += 1\n \n print(ans)\n", "FL_content": "-n, m = map(int, input().split())\n-k_list = [list(map(int, input().split()))[1:] for _ in range(m)]\n-p_list = list(map(int, input().split()))\n \n ans = 0\n-for bit in range(2**n):\n- check = True\n- for k, p in zip(k_list, p_list):\n- count = 0\n- for i in range(n):\n- if bit & (1 << i):\n- if i in k:\n- count += 1\n- if (count%2) != p:\n- check = False\n break\n- if check:\n ans += 1\n \n print(ans)\n", "added_lines": 17, "removed_lines": 14, "code1_lines": 20 }, { "user_id": "u181195295", "problem_id": "p03031", "submission1_id": "s847489380", "submission2_id": "s866895797", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M = map(int,input().split())\nswis = [list(map(int,input().split()))[1:] for _ in range(M)]\nneed = list(map(int,input().split()))\n\nans = 0\nfor i in range(1< 0 for _v in get_components(dest)]\n\n get_order(0)\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n\nif __name__ == \"__main__\":\n solve()", "code2": "def solve():\n N, M = map(int, input().split())\n edges = [[] for _ in [0]*N]\n r_edges = [[] for _ in [0]*N]\n\n for _ in [0]*M:\n a, b = map(int, input().split())\n edges[a].append(b)\n r_edges[b].append(a)\n \n c = get_strongly_connected_components(edges, r_edges)\n group = [0]*N\n for i in range(len(c)):\n for v in c[i]:\n group[v] = i\n\n result = []\n append = result.append\n for _ in [0]*int(input()):\n a, b = map(int, input().split())\n append(\"1\" if group[a] == group[b] else \"0\")\n\n print(\"\\n\".join(result))\n\n\ndef get_strongly_connected_components(edges, r_edges):\n import sys\n sys.setrecursionlimit(10**7)\n v_count = len(edges)\n order = [0]*v_count\n k = 1\n\n def get_order(v):\n order[v] = 1\n nonlocal k\n for dest in edges[v]:\n if order[dest] == 0:\n get_order(dest)\n order[v] = k\n k += 1\n\n def get_components(v):\n order[v] = 0\n return [v] + [_v for dest in r_edges[v] if order[dest] > 0 for _v in get_components(dest)]\n\n [None for v in range(v_count) if order[v] == 0 and get_order(v)]\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n\nif __name__ == \"__main__\":\n solve()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1508055568", "date2": "1508056098", "bleu_score": "0.9511467536246383", "code1_test_status": [1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1], "code1_test_score": 30, "total_score": 101, "input": "7 6\n0 2\n2 0\n1 2\n4 4\n4 3\n3 2\n1\n0 1\n0 3\n2 6\n3 4\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["def solve(): # (0): solve=\n N, M = map(int, input().split())\n edges = [[] for _ in [0]*N]\n r_edges = [[] for _ in [0]*N]\n\n for _ in [0]*M:\n a, b = map(int, input().split())\n edges[a].append(b)\n r_edges[b].append(a)\n c = get_strongly_connected_components(edges, r_edges)\n group = [0]*N\n for i in range(len(c)):\n for v in c[i]:\n group[v] = i\n\n result = []\n append = result.append\n for _ in [0]*int(input()):\n a, b = map(int, input().split())\n append(\"1\" if group[a] == group[b] else \"0\")\n\n print(\"\\n\".join(result))\n\n\ndef get_strongly_connected_components(edges, r_edges): # (1): get_strongly_connected_components=\n import sys\n sys.setrecursionlimit(10**7)\n v_count = len(edges)\n order = [0]*v_count\n k = 1\n\n def get_order(v):\n order[v] = 1\n nonlocal k\n for dest in edges[v]:\n if order[dest] == 0:\n get_order(dest)\n order[v] = k\n k += 1\n\n def get_components(v):\n order[v] = 0\n return [v] + [_v for dest in r_edges[v] if order[dest] > 0 for _v in get_components(dest)]\n\n get_order(0)\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n\nif __name__ == \"__main__\":\n solve()"], "anno_status": [true], "diff_content": " def solve():\n N, M = map(int, input().split())\n edges = [[] for _ in [0]*N]\n r_edges = [[] for _ in [0]*N]\n \n for _ in [0]*M:\n a, b = map(int, input().split())\n edges[a].append(b)\n r_edges[b].append(a)\n+ \n c = get_strongly_connected_components(edges, r_edges)\n group = [0]*N\n for i in range(len(c)):\n for v in c[i]:\n group[v] = i\n \n result = []\n append = result.append\n for _ in [0]*int(input()):\n a, b = map(int, input().split())\n append(\"1\" if group[a] == group[b] else \"0\")\n \n print(\"\\n\".join(result))\n \n \n def get_strongly_connected_components(edges, r_edges):\n import sys\n sys.setrecursionlimit(10**7)\n v_count = len(edges)\n order = [0]*v_count\n k = 1\n \n def get_order(v):\n order[v] = 1\n nonlocal k\n for dest in edges[v]:\n if order[dest] == 0:\n get_order(dest)\n order[v] = k\n k += 1\n \n def get_components(v):\n order[v] = 0\n return [v] + [_v for dest in r_edges[v] if order[dest] > 0 for _v in get_components(dest)]\n \n- get_order(0)\n+ [None for v in range(v_count) if order[v] == 0 and get_order(v)]\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n \n if __name__ == \"__main__\":\n solve()\n", "FL_content": " def solve():\n N, M = map(int, input().split())\n edges = [[] for _ in [0]*N]\n r_edges = [[] for _ in [0]*N]\n \n for _ in [0]*M:\n a, b = map(int, input().split())\n edges[a].append(b)\n r_edges[b].append(a)\n c = get_strongly_connected_components(edges, r_edges)\n group = [0]*N\n for i in range(len(c)):\n for v in c[i]:\n group[v] = i\n \n result = []\n append = result.append\n for _ in [0]*int(input()):\n a, b = map(int, input().split())\n append(\"1\" if group[a] == group[b] else \"0\")\n \n print(\"\\n\".join(result))\n \n \n def get_strongly_connected_components(edges, r_edges):\n import sys\n sys.setrecursionlimit(10**7)\n v_count = len(edges)\n order = [0]*v_count\n k = 1\n \n def get_order(v):\n order[v] = 1\n nonlocal k\n for dest in edges[v]:\n if order[dest] == 0:\n get_order(dest)\n order[v] = k\n k += 1\n \n def get_components(v):\n order[v] = 0\n return [v] + [_v for dest in r_edges[v] if order[dest] > 0 for _v in get_components(dest)]\n \n- get_order(0)\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n \n if __name__ == \"__main__\":\n solve()\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 49 }, { "user_id": "u165578704", "problem_id": "p02368", "submission1_id": "s080629172", "submission2_id": "s466847525", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\n\nsys.setrecursionlimit(10 ** 9)\ndef input(): return sys.stdin.readline().strip()\ndef INT(): return int(input())\ndef MAP(): return map(int, input().split())\ndef LIST(): return list(map(int, input().split()))\nINF=float('inf')\n\nN,M=MAP()\nnodes1=[[] for i in range(N)]\nnodes2=[[] for i in range(N)]\nfor i in range(M):\n u,v=MAP()\n nodes1[u].append(v)\n nodes2[v].append(u)\n\nT=[]\nvisited=[False]*N\ndef rec1(cur):\n visited[cur]=True\n for nxt in nodes1[cur]:\n if not visited[nxt]:\n rec1(nxt)\n \n T.append(cur)\n\nrec1(0)\n\nvisited=[False]*N\ngroup=[0]*N\ngrpnum=1\ndef rec2(cur):\n global grpnum\n group[cur]=grpnum\n visited[cur]=True\n for nxt in nodes2[cur]:\n if not visited[nxt]:\n rec2(nxt)\n return\n grpnum+=1\n return\n\n\nfor u in reversed(T):\n if not visited[u]:\n rec2(u)\n\nQ=INT()\nfor _ in range(Q):\n u,v=MAP()\n if group[u]==group[v]:\n print(1)\n else:\n print(0)\n\n", "code2": "\n\nimport sys\n\nsys.setrecursionlimit(10 ** 9)\ndef input(): return sys.stdin.readline().strip()\ndef INT(): return int(input())\ndef MAP(): return map(int, input().split())\ndef LIST(): return list(map(int, input().split()))\nINF=float('inf')\n\nN,M=MAP()\nnodes1=[[] for i in range(N)]\nnodes2=[[] for i in range(N)]\nfor i in range(M):\n u,v=MAP()\n nodes1[u].append(v)\n nodes2[v].append(u)\n\nT=[]\nvisited=[False]*N\ndef rec1(cur):\n visited[cur]=True\n for nxt in nodes1[cur]:\n if not visited[nxt]:\n rec1(nxt)\n \n T.append(cur)\n\n\nfor u in range(N):\n if not visited[u]:\n rec1(u)\n\nvisited=[False]*N\ngroup=[0]*N\ngrpnum=1\ndef rec2(cur):\n global grpnum\n group[cur]=grpnum\n visited[cur]=True\n for nxt in nodes2[cur]:\n if not visited[nxt]:\n rec2(nxt)\n\n\nfor u in reversed(T):\n if not visited[u]:\n rec2(u)\n grpnum+=1\n\nQ=INT()\nfor _ in range(Q):\n u,v=MAP()\n if group[u]==group[v]:\n print(1)\n else:\n print(0)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556903683", "date2": "1556905783", "bleu_score": "0.958761963900891", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1], "code1_test_score": 64, "total_score": 101, "input": "5 6\n0 0\n1 0\n1 2\n2 4\n4 0\n0 2\n4\n0 1\n0 3\n2 0\n3 4\n", "actual_output": "1\n0\n0\n0\n", "expected_output": "0\n0\n1\n0\n\n", "anno_code": ["\n\nimport sys\n\nsys.setrecursionlimit(10 ** 9) # (0): input=, INT=, MAP=, LIST=\ndef input(): return sys.stdin.readline().strip()\ndef INT(): return int(input())\ndef MAP(): return map(int, input().split())\ndef LIST(): return list(map(int, input().split()))\nINF=float('inf') # (1): INF=inf\n\nN,M=MAP() # (2): N=5, M=6\nnodes1=[[] for i in range(N)] # (3): nodes1\nnodes2=[[] for i in range(N)] # (4): nodes2\nfor i in range(M): # (5): i=0 (9): nodes1=[[0], [], [], [], []], nodes2, i=1 ... (29): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2\n u,v=MAP() # (6): u=0, v=0 (10): nodes1=[[0], [], [], [], []], nodes2=[[0], [], [], [], []], u=1 ... (26): nodes1=[[0], [0, 2], [4], [], [0]], nodes2, u=0, v=2\n nodes1[u].append(v) # (7): nodes1 (11): nodes1, nodes2 ... (27): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2\n nodes2[v].append(u) # (8): nodes1=[[0], [], [], [], []], nodes2 (12): nodes1, nodes2 ... (28): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2\n\nT=[] # (30): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, T=[]\nvisited=[False]*N # (31): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, visited=[False, False, False, False, False]\ndef rec1(cur): # (32): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, rec1=\n visited[cur]=True # (34): NO CHANGE (40): NO CHANGE (44): NO CHANGE\n for nxt in nodes1[cur]: # (35): nxt=0 (37): nxt=2 ... (51): NO CHANGE\n if not visited[nxt]: # (36): NO CHANGE (38): NO CHANGE ... (46): NO CHANGE\n rec1(nxt) # (39): cur=2 (43): cur=4\n \n T.append(cur) # (48): cur=2, nxt=4 (50): cur=0, nxt=2 (52): sys=, input=, INT=, MAP=, LIST=, INF=inf, N=5, M=6, nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2=[[0, 1, 4], [], [1, 0], [], [2]], i=5, u=0, v=2, T=[4, 2, 0], visited=[True, False, True, False, True], rec1=\n\nrec1(0) # (33): cur=0\n\nvisited=[False]*N # (53): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, visited=[False, False, False, False, False]\ngroup=[0]*N # (54): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, group=[0, 0, 0, 0, 0]\ngrpnum=1 # (55): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, grpnum=1\ndef rec2(cur): # (56): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, rec2=\n global grpnum\n group[cur]=grpnum # (60): NO CHANGE (67): NO CHANGE ... (88): NO CHANGE\n visited[cur]=True # (61): NO CHANGE (68): NO CHANGE ... (89): NO CHANGE\n for nxt in nodes2[cur]: # (62): nxt=0 (64): nxt=1 ... (92): NO CHANGE\n if not visited[nxt]: # (63): NO CHANGE (65): NO CHANGE ... (91): NO CHANGE\n rec2(nxt) # (66): cur=1\n return # (72): sys=, input=, INT=, MAP=, LIST=, INF=inf, N=5, M=6, nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2=[[0, 1, 4], [], [1, 0], [], [2]], i=5, u=0, v=2, T=[4, 2, 0], visited=[True, True, False, False, False], rec1=, group=[1, 1, 0, 0, 0], grpnum=2, rec2=\n grpnum+=1 # (70): NO CHANGE (83): NO CHANGE (93): NO CHANGE\n return # (71): cur=0, nxt=1 (84): sys=, input=, INT=, MAP=, LIST=, INF=inf, N=5, M=6, nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2=[[0, 1, 4], [], [1, 0], [], [2]], i=5, u=2, v=2, T=[4, 2, 0], visited=[True, True, True, False, False], rec1=, group=[1, 1, 2, 0, 0], grpnum=3, rec2= (94): sys=, input=, INT=, MAP=, LIST=, INF=inf, N=5, M=6, nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2=[[0, 1, 4], [], [1, 0], [], [2]], i=5, u=4, v=2, T=[4, 2, 0], visited=[True, True, True, False, True], rec1=, group=[1, 1, 2, 0, 3], grpnum=4, rec2=\n\n\nfor u in reversed(T): # (57): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2 (73): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, u=2 ... (95): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2\n if not visited[u]: # (58): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2 (74): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2 (86): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2\n rec2(u) # (59): cur=0 (75): cur=2 (87): cur=4\n\nQ=INT() # (96): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, Q=4\nfor _ in range(Q): # (97): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, _=0 (101): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, _=1 ... (109): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, _=3\n u,v=MAP() # (98): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, u=0, v=1 (102): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, v=3 ... (110): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, u=3, v=4\n if group[u]==group[v]: # (99): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2 (103): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2 ... (111): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2\n print(1) # (100): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2\n else:\n print(0) # (104): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2 (108): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2 (112): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2\n\n"], "anno_status": [false], "diff_content": " \n \n import sys\n \n sys.setrecursionlimit(10 ** 9)\n def input(): return sys.stdin.readline().strip()\n def INT(): return int(input())\n def MAP(): return map(int, input().split())\n def LIST(): return list(map(int, input().split()))\n INF=float('inf')\n \n N,M=MAP()\n nodes1=[[] for i in range(N)]\n nodes2=[[] for i in range(N)]\n for i in range(M):\n u,v=MAP()\n nodes1[u].append(v)\n nodes2[v].append(u)\n \n T=[]\n visited=[False]*N\n def rec1(cur):\n visited[cur]=True\n for nxt in nodes1[cur]:\n if not visited[nxt]:\n rec1(nxt)\n \n T.append(cur)\n \n-rec1(0)\n+\n+for u in range(N):\n+ if not visited[u]:\n+ rec1(u)\n \n visited=[False]*N\n group=[0]*N\n grpnum=1\n def rec2(cur):\n global grpnum\n group[cur]=grpnum\n visited[cur]=True\n for nxt in nodes2[cur]:\n if not visited[nxt]:\n rec2(nxt)\n- return\n- grpnum+=1\n- return\n \n \n for u in reversed(T):\n if not visited[u]:\n rec2(u)\n+ grpnum+=1\n \n Q=INT()\n for _ in range(Q):\n u,v=MAP()\n if group[u]==group[v]:\n print(1)\n else:\n print(0)\n \n \n", "FL_content": " \n \n import sys\n \n sys.setrecursionlimit(10 ** 9)\n def input(): return sys.stdin.readline().strip()\n def INT(): return int(input())\n def MAP(): return map(int, input().split())\n def LIST(): return list(map(int, input().split()))\n INF=float('inf')\n \n N,M=MAP()\n nodes1=[[] for i in range(N)]\n nodes2=[[] for i in range(N)]\n for i in range(M):\n u,v=MAP()\n nodes1[u].append(v)\n nodes2[v].append(u)\n \n T=[]\n visited=[False]*N\n def rec1(cur):\n visited[cur]=True\n for nxt in nodes1[cur]:\n if not visited[nxt]:\n rec1(nxt)\n \n T.append(cur)\n \n-rec1(0)\n \n visited=[False]*N\n group=[0]*N\n grpnum=1\n def rec2(cur):\n global grpnum\n group[cur]=grpnum\n visited[cur]=True\n for nxt in nodes2[cur]:\n if not visited[nxt]:\n rec2(nxt)\n- return\n- grpnum+=1\n- return\n \n \n for u in reversed(T):\n if not visited[u]:\n rec2(u)\n \n Q=INT()\n for _ in range(Q):\n u,v=MAP()\n if group[u]==group[v]:\n print(1)\n else:\n print(0)\n \n \n", "added_lines": 5, "removed_lines": 4, "code1_lines": 59 }, { "user_id": "u197615397", "problem_id": "p02368", "submission1_id": "s226103980", "submission2_id": "s974543153", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def solve():\n N, M = map(int, input().split())\n edges = [[] for _ in [0]*N]\n r_edges = [[] for _ in [0]*N]\n\n for _ in [0]*M:\n a, b = map(int, input().split())\n edges[a].append(b)\n r_edges[b].append(a)\n c = get_strongly_connected_components(edges, r_edges)\n print(c)\n group = [0]*N\n for i in range(len(c)):\n for v in c[i]:\n group[v] = i\n\n result = []\n append = result.append\n for _ in [0]*int(input()):\n a, b = map(int, input().split())\n append(\"1\" if group[a] == group[b] else \"0\")\n\n print(\"\\n\".join(result))\n\n\ndef get_strongly_connected_components(edges, r_edges):\n import sys\n sys.setrecursionlimit(10**7)\n v_count = len(edges)\n order = [0]*v_count\n k = 1\n\n def get_order(v):\n order[v] = 1\n nonlocal k\n for dest in edges[v]:\n if order[dest] == 0:\n get_order(dest)\n order[v] = k\n k += 1\n\n def get_components(v):\n order[v] = 0\n return [v] + [_v for dest in r_edges[v] if order[dest] > 0 for _v in get_components(dest)]\n\n [None for v in range(v_count) if order[v] == 0 and get_order(v)]\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n\nif __name__ == \"__main__\":\n solve()", "code2": "def solve():\n N, M = map(int, input().split())\n edges = [[] for _ in [0]*N]\n r_edges = [[] for _ in [0]*N]\n\n for _ in [0]*M:\n a, b = map(int, input().split())\n edges[a].append(b)\n r_edges[b].append(a)\n \n c = get_strongly_connected_components(edges, r_edges)\n group = [0]*N\n for i in range(len(c)):\n for v in c[i]:\n group[v] = i\n\n result = []\n append = result.append\n for _ in [0]*int(input()):\n a, b = map(int, input().split())\n append(\"1\" if group[a] == group[b] else \"0\")\n\n print(\"\\n\".join(result))\n\n\ndef get_strongly_connected_components(edges, r_edges):\n import sys\n sys.setrecursionlimit(10**7)\n v_count = len(edges)\n order = [0]*v_count\n k = 1\n\n def get_order(v):\n order[v] = 1\n nonlocal k\n for dest in edges[v]:\n if order[dest] == 0:\n get_order(dest)\n order[v] = k\n k += 1\n\n def get_components(v):\n order[v] = 0\n return [v] + [_v for dest in r_edges[v] if order[dest] > 0 for _v in get_components(dest)]\n\n [None for v in range(v_count) if order[v] == 0 and get_order(v)]\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n\nif __name__ == \"__main__\":\n solve()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1508056066", "date2": "1508056098", "bleu_score": "0.992852260239688", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "8 6\n0 1\n2 0\n1 2\n3 4\n4 1\n3 2\n4\n0 1\n0 3\n2 3\n3 4\n", "actual_output": "[[7], [6], [5], [3], [4], [0, 2, 1]]\n1\n0\n0\n0\n", "expected_output": "1\n0\n0\n0\n\n", "anno_code": ["def solve(): # (0): solve=\n N, M = map(int, input().split())\n edges = [[] for _ in [0]*N]\n r_edges = [[] for _ in [0]*N]\n\n for _ in [0]*M:\n a, b = map(int, input().split())\n edges[a].append(b)\n r_edges[b].append(a)\n c = get_strongly_connected_components(edges, r_edges)\n print(c)\n group = [0]*N\n for i in range(len(c)):\n for v in c[i]:\n group[v] = i\n\n result = []\n append = result.append\n for _ in [0]*int(input()):\n a, b = map(int, input().split())\n append(\"1\" if group[a] == group[b] else \"0\")\n\n print(\"\\n\".join(result))\n\n\ndef get_strongly_connected_components(edges, r_edges): # (1): get_strongly_connected_components=\n import sys\n sys.setrecursionlimit(10**7)\n v_count = len(edges)\n order = [0]*v_count\n k = 1\n\n def get_order(v):\n order[v] = 1\n nonlocal k\n for dest in edges[v]:\n if order[dest] == 0:\n get_order(dest)\n order[v] = k\n k += 1\n\n def get_components(v):\n order[v] = 0\n return [v] + [_v for dest in r_edges[v] if order[dest] > 0 for _v in get_components(dest)]\n\n [None for v in range(v_count) if order[v] == 0 and get_order(v)]\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n\nif __name__ == \"__main__\":\n solve()"], "anno_status": [false], "diff_content": " def solve():\n N, M = map(int, input().split())\n edges = [[] for _ in [0]*N]\n r_edges = [[] for _ in [0]*N]\n \n for _ in [0]*M:\n a, b = map(int, input().split())\n edges[a].append(b)\n r_edges[b].append(a)\n+ \n c = get_strongly_connected_components(edges, r_edges)\n- print(c)\n group = [0]*N\n for i in range(len(c)):\n for v in c[i]:\n group[v] = i\n \n result = []\n append = result.append\n for _ in [0]*int(input()):\n a, b = map(int, input().split())\n append(\"1\" if group[a] == group[b] else \"0\")\n \n print(\"\\n\".join(result))\n \n \n def get_strongly_connected_components(edges, r_edges):\n import sys\n sys.setrecursionlimit(10**7)\n v_count = len(edges)\n order = [0]*v_count\n k = 1\n \n def get_order(v):\n order[v] = 1\n nonlocal k\n for dest in edges[v]:\n if order[dest] == 0:\n get_order(dest)\n order[v] = k\n k += 1\n \n def get_components(v):\n order[v] = 0\n return [v] + [_v for dest in r_edges[v] if order[dest] > 0 for _v in get_components(dest)]\n \n [None for v in range(v_count) if order[v] == 0 and get_order(v)]\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n \n if __name__ == \"__main__\":\n solve()\n", "FL_content": " def solve():\n N, M = map(int, input().split())\n edges = [[] for _ in [0]*N]\n r_edges = [[] for _ in [0]*N]\n \n for _ in [0]*M:\n a, b = map(int, input().split())\n edges[a].append(b)\n r_edges[b].append(a)\n c = get_strongly_connected_components(edges, r_edges)\n- print(c)\n group = [0]*N\n for i in range(len(c)):\n for v in c[i]:\n group[v] = i\n \n result = []\n append = result.append\n for _ in [0]*int(input()):\n a, b = map(int, input().split())\n append(\"1\" if group[a] == group[b] else \"0\")\n \n print(\"\\n\".join(result))\n \n \n def get_strongly_connected_components(edges, r_edges):\n import sys\n sys.setrecursionlimit(10**7)\n v_count = len(edges)\n order = [0]*v_count\n k = 1\n \n def get_order(v):\n order[v] = 1\n nonlocal k\n for dest in edges[v]:\n if order[dest] == 0:\n get_order(dest)\n order[v] = k\n k += 1\n \n def get_components(v):\n order[v] = 0\n return [v] + [_v for dest in r_edges[v] if order[dest] > 0 for _v in get_components(dest)]\n \n [None for v in range(v_count) if order[v] == 0 and get_order(v)]\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n \n if __name__ == \"__main__\":\n solve()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 50 }, { "user_id": "u165578704", "problem_id": "p02368", "submission1_id": "s324033554", "submission2_id": "s466847525", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\n\nsys.setrecursionlimit(10 ** 9)\ndef input(): return sys.stdin.readline().strip()\ndef INT(): return int(input())\ndef MAP(): return map(int, input().split())\ndef LIST(): return list(map(int, input().split()))\nINF=float('inf')\n\nN,M=MAP()\nnodes1=[[] for i in range(N)]\nnodes2=[[] for i in range(N)]\nfor i in range(M):\n u,v=MAP()\n nodes1[u].append(v)\n nodes2[v].append(u)\n\nT=[]\nvisited=[False]*N\ndef rec1(cur):\n visited[cur]=True\n for nxt in nodes1[cur]:\n if not visited[nxt]:\n rec1(nxt)\n \n T.append(cur)\n\n\nfor u in range(N):\n if not visited[u]:\n rec1(u)\n\nvisited=[False]*N\ngroup=[0]*N\ngrpnum=1\ndef rec2(cur):\n global grpnum\n group[cur]=grpnum\n visited[cur]=True\n for nxt in nodes2[cur]:\n if not visited[nxt]:\n rec2(nxt)\n return\n grpnum+=1\n return\n\n\nfor u in reversed(T):\n if not visited[u]:\n rec2(u)\n\nQ=INT()\nfor _ in range(Q):\n u,v=MAP()\n if group[u]==group[v]:\n print(1)\n else:\n print(0)\n\n", "code2": "\n\nimport sys\n\nsys.setrecursionlimit(10 ** 9)\ndef input(): return sys.stdin.readline().strip()\ndef INT(): return int(input())\ndef MAP(): return map(int, input().split())\ndef LIST(): return list(map(int, input().split()))\nINF=float('inf')\n\nN,M=MAP()\nnodes1=[[] for i in range(N)]\nnodes2=[[] for i in range(N)]\nfor i in range(M):\n u,v=MAP()\n nodes1[u].append(v)\n nodes2[v].append(u)\n\nT=[]\nvisited=[False]*N\ndef rec1(cur):\n visited[cur]=True\n for nxt in nodes1[cur]:\n if not visited[nxt]:\n rec1(nxt)\n \n T.append(cur)\n\n\nfor u in range(N):\n if not visited[u]:\n rec1(u)\n\nvisited=[False]*N\ngroup=[0]*N\ngrpnum=1\ndef rec2(cur):\n global grpnum\n group[cur]=grpnum\n visited[cur]=True\n for nxt in nodes2[cur]:\n if not visited[nxt]:\n rec2(nxt)\n\n\nfor u in reversed(T):\n if not visited[u]:\n rec2(u)\n grpnum+=1\n\nQ=INT()\nfor _ in range(Q):\n u,v=MAP()\n if group[u]==group[v]:\n print(1)\n else:\n print(0)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556904112", "date2": "1556905783", "bleu_score": "0.972947413648121", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 101, "input": "7 6\n0 1\n2 0\n1 3\n3 4\n4 3\n3 2\n4\n0 0\n0 3\n2 3\n3 4\n", "actual_output": "1\n1\n1\n0\n", "expected_output": "1\n1\n1\n1\n\n", "anno_code": ["\n\nimport sys\n\nsys.setrecursionlimit(10 ** 9) # (0): input=, INT=, MAP=, LIST=\ndef input(): return sys.stdin.readline().strip()\ndef INT(): return int(input())\ndef MAP(): return map(int, input().split())\ndef LIST(): return list(map(int, input().split()))\nINF=float('inf') # (1): INF=inf\n\nN,M=MAP() # (2): N=7, M=6\nnodes1=[[] for i in range(N)] # (3): nodes1\nnodes2=[[] for i in range(N)] # (4): nodes2\nfor i in range(M): # (5): i=0 (9): nodes1=[[1], [], [], [], [], [], []], nodes2, i=1 ... (29): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n u,v=MAP() # (6): u=0, v=1 (10): nodes1=[[1], [], [], [], [], [], []], nodes2=[[], [0], [], [], [], [], []], u=2, v=0 ... (26): nodes1=[[1], [3], [0], [4], [3], [], []], nodes2, u=3, v=2\n nodes1[u].append(v) # (7): nodes1 (11): nodes1, nodes2 ... (27): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n nodes2[v].append(u) # (8): nodes1=[[1], [], [], [], [], [], []], nodes2 (12): nodes1, nodes2 ... (28): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n\nT=[] # (30): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, T=[]\nvisited=[False]*N # (31): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, visited=[False, False, False, False, False, False, False]\ndef rec1(cur): # (32): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, rec1=\n visited[cur]=True # (36): NO CHANGE (40): NO CHANGE ... (84): NO CHANGE\n for nxt in nodes1[cur]: # (37): nxt=1 (41): nxt=3 ... (85): NO CHANGE\n if not visited[nxt]: # (38): NO CHANGE (42): NO CHANGE ... (58): NO CHANGE\n rec1(nxt) # (39): cur=1 (43): cur=3 ... (55): cur=2\n \n T.append(cur) # (52): cur=3, nxt=4 (60): cur=3, nxt=2 ... (86): sys=, input=, INT=, MAP=, LIST=, INF=inf, N=7, M=6, nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2=[[2], [0], [3], [1, 4], [3], [], []], i=5, u=6, v=2, T=[4, 2, 3, 1, 0, 5, 6], visited=[True, True, True, True, True, True, True], rec1=\n\n\nfor u in range(N): # (33): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, u=0 (67): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, u=1 ... (87): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n if not visited[u]: # (34): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2 (68): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2 ... (82): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n rec1(u) # (35): cur=0 (77): cur=5 (83): cur=6\n\nvisited=[False]*N # (88): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, visited=[False, False, False, False, False, False, False]\ngroup=[0]*N # (89): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, group=[0, 0, 0, 0, 0, 0, 0]\ngrpnum=1 # (90): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, grpnum=1\ndef rec2(cur): # (91): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, rec2=\n global grpnum\n group[cur]=grpnum # (95): NO CHANGE (103): NO CHANGE ... (145): NO CHANGE\n visited[cur]=True # (96): NO CHANGE (104): NO CHANGE ... (146): NO CHANGE\n for nxt in nodes2[cur]: # (97): NO CHANGE (105): NO CHANGE ... (149): NO CHANGE\n if not visited[nxt]: # (114): NO CHANGE (119): NO CHANGE ... (148): NO CHANGE\n rec2(nxt) # (115): cur=2 (120): cur=3 (125): cur=1\n return # (133): cur=2, nxt=3 (134): cur=0, nxt=2 (135): sys=, input=, INT=, MAP=, LIST=, INF=inf, N=7, M=6, nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2=[[2], [0], [3], [1, 4], [3], [], []], i=5, u=0, v=2, T=[4, 2, 3, 1, 0, 5, 6], visited=[True, True, True, True, False, True, True], rec1=, group=[3, 3, 3, 3, 0, 2, 1], grpnum=4, rec2=\n grpnum+=1 # (98): NO CHANGE (106): NO CHANGE ... (150): NO CHANGE\n return # (99): sys=, input=, INT=, MAP=, LIST=, INF=inf, N=7, M=6, nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2=[[2], [0], [3], [1, 4], [3], [], []], i=5, u=6, v=2, T=[4, 2, 3, 1, 0, 5, 6], visited=[False, False, False, False, False, False, True], rec1=, group=[0, 0, 0, 0, 0, 0, 1], grpnum=2, rec2= (107): sys=, input=, INT=, MAP=, LIST=, INF=inf, N=7, M=6, nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2=[[2], [0], [3], [1, 4], [3], [], []], i=5, u=5, v=2, T=[4, 2, 3, 1, 0, 5, 6], visited=[False, False, False, False, False, True, True], rec1=, group=[0, 0, 0, 0, 0, 2, 1], grpnum=3, rec2= ... (151): sys=, input=, INT=, MAP=, LIST=, INF=inf, N=7, M=6, nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2=[[2], [0], [3], [1, 4], [3], [], []], i=5, u=4, v=2, T=[4, 2, 3, 1, 0, 5, 6], visited=[True, True, True, True, True, True, True], rec1=, group=[3, 3, 3, 3, 4, 2, 1], grpnum=5, rec2=\n\n\nfor u in reversed(T): # (92): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2 (100): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, u=5 ... (152): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n if not visited[u]: # (93): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2 (101): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2 ... (143): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n rec2(u) # (94): cur=6 (102): cur=5 ... (144): cur=4\n\nQ=INT() # (153): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, Q=4\nfor _ in range(Q): # (154): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, _=0 (158): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, _=1 ... (166): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, _=3\n u,v=MAP() # (155): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, u=0, v=0 (159): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, v=3 ... (167): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, u=3, v=4\n if group[u]==group[v]: # (156): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2 (160): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2 ... (168): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n print(1) # (157): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2 (161): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2 (165): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n else:\n print(0) # (169): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n\n"], "anno_status": [false], "diff_content": " \n \n import sys\n \n sys.setrecursionlimit(10 ** 9)\n def input(): return sys.stdin.readline().strip()\n def INT(): return int(input())\n def MAP(): return map(int, input().split())\n def LIST(): return list(map(int, input().split()))\n INF=float('inf')\n \n N,M=MAP()\n nodes1=[[] for i in range(N)]\n nodes2=[[] for i in range(N)]\n for i in range(M):\n u,v=MAP()\n nodes1[u].append(v)\n nodes2[v].append(u)\n \n T=[]\n visited=[False]*N\n def rec1(cur):\n visited[cur]=True\n for nxt in nodes1[cur]:\n if not visited[nxt]:\n rec1(nxt)\n \n T.append(cur)\n \n \n for u in range(N):\n if not visited[u]:\n rec1(u)\n \n visited=[False]*N\n group=[0]*N\n grpnum=1\n def rec2(cur):\n global grpnum\n group[cur]=grpnum\n visited[cur]=True\n for nxt in nodes2[cur]:\n if not visited[nxt]:\n rec2(nxt)\n- return\n- grpnum+=1\n- return\n \n \n for u in reversed(T):\n if not visited[u]:\n rec2(u)\n+ grpnum+=1\n \n Q=INT()\n for _ in range(Q):\n u,v=MAP()\n if group[u]==group[v]:\n print(1)\n else:\n print(0)\n \n \n", "FL_content": " \n \n import sys\n \n sys.setrecursionlimit(10 ** 9)\n def input(): return sys.stdin.readline().strip()\n def INT(): return int(input())\n def MAP(): return map(int, input().split())\n def LIST(): return list(map(int, input().split()))\n INF=float('inf')\n \n N,M=MAP()\n nodes1=[[] for i in range(N)]\n nodes2=[[] for i in range(N)]\n for i in range(M):\n u,v=MAP()\n nodes1[u].append(v)\n nodes2[v].append(u)\n \n T=[]\n visited=[False]*N\n def rec1(cur):\n visited[cur]=True\n for nxt in nodes1[cur]:\n if not visited[nxt]:\n rec1(nxt)\n \n T.append(cur)\n \n \n for u in range(N):\n if not visited[u]:\n rec1(u)\n \n visited=[False]*N\n group=[0]*N\n grpnum=1\n def rec2(cur):\n global grpnum\n group[cur]=grpnum\n visited[cur]=True\n for nxt in nodes2[cur]:\n if not visited[nxt]:\n rec2(nxt)\n- return\n- grpnum+=1\n- return\n \n \n for u in reversed(T):\n if not visited[u]:\n rec2(u)\n \n Q=INT()\n for _ in range(Q):\n u,v=MAP()\n if group[u]==group[v]:\n print(1)\n else:\n print(0)\n \n \n", "added_lines": 1, "removed_lines": 3, "code1_lines": 62 }, { "user_id": "u603049633", "problem_id": "p02368", "submission1_id": "s943261356", "submission2_id": "s555526634", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(100000)\n\nV,E = map(int, input().split())\n\nD1 = [[] for _ in range(V)]\nD2 = [[] for _ in range(V)]\nfor _ in range(E):\n s,t = map(int, input().split())\n D1[s].append(t)\n D2[t].append(s)\n\nstuck = []\ncolor = [0 for _ in range(V)]\ndef dfs1(s):\n color[s] = 1\n for next in D1[s]:\n if color[next] == 0:\n dfs1(next)\n stuck.append(s)\n return\n\ndfs1(0)\n\ncolor = [0 for _ in range(V)]\ndef dfs2(s, cnt):\n color[s] = cnt\n for next in D2[s]:\n if color[next] == 0:\n dfs2(next, cnt)\n return\n\nstuck = stuck[::-1]\ncnt = 0\nfor i in stuck:\n if color[i] == 0:\n cnt += 1\n dfs2(i, cnt)\n\nQ = int(input())\nfor _ in range(Q):\n u,v = map(int, input().split())\n if color[u] == color[v]:\n print(1)\n else: print(0)", "code2": "import sys\nsys.setrecursionlimit(100000)\n\nV,E = map(int, input().split())\n\nD1 = [[] for _ in range(V)]\nD2 = [[] for _ in range(V)]\nfor _ in range(E):\n s,t = map(int, input().split())\n D1[s].append(t)\n D2[t].append(s)\n\nstuck = []\ncolor = [0 for _ in range(V)]\ndef dfs1(s):\n color[s] = 1\n for next in D1[s]:\n if color[next] == 0:\n dfs1(next)\n stuck.append(s)\n return\n\nfor i in range(V):\n if color[i] == 0:\n dfs1(i)\n\ncolor = [0 for _ in range(V)]\ndef dfs2(s, cnt):\n color[s] = cnt\n for next in D2[s]:\n if color[next] == 0:\n dfs2(next, cnt)\n return\n\nstuck = stuck[::-1]\ncnt = 0\nfor i in stuck:\n if color[i] == 0:\n cnt += 1\n dfs2(i, cnt)\n\nQ = int(input())\nfor _ in range(Q):\n u,v = map(int, input().split())\n if color[u] == color[v]:\n print(1)\n else: print(0)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1497945103", "date2": "1497945388", "bleu_score": "0.9387605608351347", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1], "code1_test_score": 42, "total_score": 101, "input": "9 6\n1 1\n1 0\n1 4\n2 4\n4 3\n4 2\n4\n1 1\n-1 3\n2 -1\n3 4\n", "actual_output": "1\n1\n1\n1\n", "expected_output": "1\n0\n0\n0\n\n", "anno_code": ["import sys\nsys.setrecursionlimit(100000) # (0): NO CHANGE\n\nV,E = map(int, input().split()) # (1): V=9, E=6\n\nD1 = [[] for _ in range(V)] # (2): D1\nD2 = [[] for _ in range(V)] # (3): D2\nfor _ in range(E): # (4): _=0 (8): D1=[[], [1], [], [], [], [], [], [], []], D2, _=1 ... (28): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2\n s,t = map(int, input().split()) # (5): s=1, t=1 (9): D1=[[], [1], [], [], [], [], [], [], []], D2=[[], [1], [], [], [], [], [], [], []], t=0 ... (25): D1=[[], [1, 0, 4], [4], [], [3], [], [], [], []], D2, t=2\n D1[s].append(t) # (6): D1 (10): D1, D2 ... (26): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2\n D2[t].append(s) # (7): D1=[[], [1], [], [], [], [], [], [], []], D2 (11): D1, D2 ... (27): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2\n\nstuck = [] # (29): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, stuck=[]\ncolor = [0 for _ in range(V)] # (30): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, color=[0, 0, 0, 0, 0, 0, 0, 0, 0]\ndef dfs1(s): # (31): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, dfs1=\n color[s] = 1 # (33): NO CHANGE\n for next in D1[s]: # (34): NO CHANGE\n if color[next] == 0:\n dfs1(next)\n stuck.append(s) # (35): NO CHANGE\n return # (36): sys=, V=9, E=6, D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2=[[1], [1], [4], [4], [1, 2], [], [], [], []], _=5, s=4, t=2, stuck=[0], color=[1, 0, 0, 0, 0, 0, 0, 0, 0], dfs1=\n\ndfs1(0) # (32): s=0\n\ncolor = [0 for _ in range(V)] # (37): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, color=[0, 0, 0, 0, 0, 0, 0, 0, 0]\ndef dfs2(s, cnt): # (38): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, dfs2=\n color[s] = cnt # (45): NO CHANGE (49): NO CHANGE\n for next in D2[s]: # (46): next=1 (50): next=1 ... (54): NO CHANGE\n if color[next] == 0: # (47): NO CHANGE (51): NO CHANGE\n dfs2(next, cnt) # (48): s=1\n return # (53): s=0 (55): sys=, V=9, E=6, D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2=[[1], [1], [4], [4], [1, 2], [], [], [], []], _=5, s=4, t=2, stuck=[0], color=[1, 1, 0, 0, 0, 0, 0, 0, 0], dfs1=, dfs2=, i=0\n\nstuck = stuck[::-1] # (39): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2\ncnt = 0 # (40): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, cnt=0\nfor i in stuck: # (41): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, i=0 (56): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2\n if color[i] == 0: # (42): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2\n cnt += 1 # (43): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, cnt=1\n dfs2(i, cnt) # (44): s=0\n\nQ = int(input()) # (57): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, Q=4\nfor _ in range(Q): # (58): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, _=0 (62): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, _=1 ... (70): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, _=3\n u,v = map(int, input().split()) # (59): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, u=1, v=1 (63): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, u=-1, v=3 ... (71): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, u=3, v=4\n if color[u] == color[v]: # (60): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2 (64): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2 ... (72): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2\n print(1) # (61): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2 (65): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2 ... (73): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2\n else: print(0)"], "anno_status": [false], "diff_content": " import sys\n sys.setrecursionlimit(100000)\n \n V,E = map(int, input().split())\n \n D1 = [[] for _ in range(V)]\n D2 = [[] for _ in range(V)]\n for _ in range(E):\n s,t = map(int, input().split())\n D1[s].append(t)\n D2[t].append(s)\n \n stuck = []\n color = [0 for _ in range(V)]\n def dfs1(s):\n color[s] = 1\n for next in D1[s]:\n if color[next] == 0:\n dfs1(next)\n stuck.append(s)\n return\n \n-dfs1(0)\n+for i in range(V):\n+ if color[i] == 0:\n+ dfs1(i)\n \n color = [0 for _ in range(V)]\n def dfs2(s, cnt):\n color[s] = cnt\n for next in D2[s]:\n if color[next] == 0:\n dfs2(next, cnt)\n return\n \n stuck = stuck[::-1]\n cnt = 0\n for i in stuck:\n if color[i] == 0:\n cnt += 1\n dfs2(i, cnt)\n \n Q = int(input())\n for _ in range(Q):\n u,v = map(int, input().split())\n if color[u] == color[v]:\n print(1)\n else: print(0)\n", "FL_content": " import sys\n sys.setrecursionlimit(100000)\n \n V,E = map(int, input().split())\n \n D1 = [[] for _ in range(V)]\n D2 = [[] for _ in range(V)]\n for _ in range(E):\n s,t = map(int, input().split())\n D1[s].append(t)\n D2[t].append(s)\n \n stuck = []\n color = [0 for _ in range(V)]\n def dfs1(s):\n color[s] = 1\n for next in D1[s]:\n if color[next] == 0:\n dfs1(next)\n stuck.append(s)\n return\n \n-dfs1(0)\n \n color = [0 for _ in range(V)]\n def dfs2(s, cnt):\n color[s] = cnt\n for next in D2[s]:\n if color[next] == 0:\n dfs2(next, cnt)\n return\n \n stuck = stuck[::-1]\n cnt = 0\n for i in stuck:\n if color[i] == 0:\n cnt += 1\n dfs2(i, cnt)\n \n Q = int(input())\n for _ in range(Q):\n u,v = map(int, input().split())\n if color[u] == color[v]:\n print(1)\n else: print(0)\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 45 }, { "user_id": "u352394527", "problem_id": "p02368", "submission1_id": "s960929244", "submission2_id": "s126115242", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\ndef dfs(v, visited, edges, order):\n visited[v] = True\n for to in edges[v]:\n if not visited[to]:\n dfs(to, visited, edges, order)\n order.append(v)\n\ndef search_strongly_connection(v, visited, reverse_edges, parent):\n visited[v] = True\n for to in reverse_edges[v]:\n if not visited[to]:\n parent[to] = v\n search_strongly_connection(to, visited, reverse_edges, parent)\n\ndef find(parent, x):\n if parent[x] == x:\n return x\n tmp = find(parent, parent[x])\n parent[x] = tmp\n return tmp\n\nv_num , e_num = map(int, input().split())\nedges = [[] for _ in range(v_num)]\nreverse_edges = [[] for _ in range(v_num)]\nfor _ in range(e_num):\n s, t = map(int, input().split())\n edges[s].append(t)\n reverse_edges[t].append(s)\n\n\norder = []\nvisited = [False] * v_num\ndfs(0, visited, edges, order)\norder.reverse()\n\n\nvisited = [False] * v_num\nparent = [i for i in range(v_num)]\nfor v in order:\n if not visited[v]:\n search_strongly_connection(v, visited, reverse_edges, parent)\n\n\nq_num = int(input())\nfor _ in range(q_num):\n u, v = map(int, input().split())\n if find(parent, u) == find(parent, v):\n print(1)\n else:\n print(0)\n", "code2": "\n\nimport sys\n\nsys.setrecursionlimit(1000000)\n\ndef dfs(v, visited, edges, order):\n visited[v] = True\n for to in edges[v]:\n if not visited[to]:\n dfs(to, visited, edges, order)\n order.append(v)\n\ndef search_strongly_connection(v, visited, reverse_edges, parent):\n visited[v] = True\n for to in reverse_edges[v]:\n if not visited[to]:\n parent[to] = v\n search_strongly_connection(to, visited, reverse_edges, parent)\n\ndef find(parent, x):\n if parent[x] == x:\n return x\n tmp = find(parent, parent[x])\n parent[x] = tmp\n return tmp\n\nv_num , e_num = map(int, input().split())\nedges = [[] for _ in range(v_num)]\nreverse_edges = [[] for _ in range(v_num)]\nfor _ in range(e_num):\n s, t = map(int, input().split())\n edges[s].append(t)\n reverse_edges[t].append(s)\n\n\norder = []\nvisited = [False] * v_num\nfor v in range(v_num):\n if not visited[v]:\n dfs(v, visited, edges, order)\norder.reverse()\n\n\nvisited = [False] * v_num\nparent = [i for i in range(v_num)]\nfor v in order:\n if not visited[v]:\n search_strongly_connection(v, visited, reverse_edges, parent)\n\nq_num = int(input())\nfor _ in range(q_num):\n u, v = map(int, input().split())\n if find(parent, u) == find(parent, v):\n print(1)\n else:\n print(0)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1528128911", "date2": "1528130049", "bleu_score": "0.9230375265916442", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1], "code1_test_score": 42, "total_score": 101, "input": "8 6\n0 1\n2 0\n1 6\n3 4\n6 1\n3 0\n3\n1 2\n1 6\n2 3\n2 4\n", "actual_output": "0\n1\n1\n", "expected_output": "0\n1\n0\n\n", "anno_code": ["\n\n\ndef dfs(v, visited, edges, order): # (0): dfs=\n visited[v] = True # (34): visited=[True, False, False, False, False, False, False, False], edges (38): visited=[True, True, False, False, False, False, False, False], edges (42): visited=[True, True, False, False, False, False, True, False], edges\n for to in edges[v]: # (35): edges, to=1 (39): edges, to=6 ... (49): edges\n if not visited[to]: # (36): edges (40): edges (44): edges\n dfs(to, visited, edges, order) # (37): v=1, edges (41): v=6, edges\n order.append(v) # (46): v=1, edges=[[1], [6], [0], [4, 0], [], [], [1], []], order=[6], to=6 (48): v=0, edges=[[1], [6], [0], [4, 0], [], [], [1], []], order=[6, 1], to=1 (50): dfs=, search_strongly_connection=, find=, v_num=8, e_num=6, edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, _=5, s=3, t=0, order=[6, 1, 0]\n\ndef search_strongly_connection(v, visited, reverse_edges, parent): # (1): search_strongly_connection=\n visited[v] = True # (57): visited=[True, False, False, False, False, False, False, False], reverse_edges (62): visited=[True, False, True, False, False, False, False, False], reverse_edges ... (81): visited=[True, True, True, True, False, False, True, False], reverse_edges\n for to in reverse_edges[v]: # (58): reverse_edges, to=2 (63): v=0, reverse_edges, to=2 ... (85): dfs=, search_strongly_connection=, find=, v_num=8, e_num=6, edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, _=5, s=3, t=0, order=[0, 1, 6]\n if not visited[to]: # (59): reverse_edges (65): reverse_edges ... (83): reverse_edges\n parent[to] = v # (60): reverse_edges, parent=[0, 1, 0, 3, 4, 5, 6, 7] (66): reverse_edges, parent=[0, 1, 0, 0, 4, 5, 6, 7] (79): reverse_edges, parent=[0, 1, 0, 0, 4, 5, 1, 7]\n search_strongly_connection(to, visited, reverse_edges, parent) # (61): v=2, reverse_edges (67): v=3, reverse_edges (80): v=6, reverse_edges\n\ndef find(parent, x): # (2): find=\n if parent[x] == x: # (93): x=2 (94): NO CHANGE ... (117): x=3, tmp=0\n return x\n tmp = find(parent, parent[x]) # (95): x=0 (104): x=1 ... (116): x=0\n parent[x] = tmp # (97): dfs=, search_strongly_connection=, find=, v_num=8, e_num=6, edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges=[[2, 3], [0, 6], [], [], [3], [], [1], []], _=0, s=3, t=0, order=[0, 1, 6], visited=[True, True, True, True, False, False, True, False], v=2, q_num=3, u=1 (106): dfs=, search_strongly_connection=, find=, v_num=8, e_num=6, edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges=[[2, 3], [0, 6], [], [], [3], [], [1], []], _=1, s=3, t=0, order=[0, 1, 6], visited=[True, True, True, True, False, False, True, False], v=6, q_num=3, u=1 ... (118): dfs=, search_strongly_connection=, find=, v_num=8, e_num=6, edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges=[[2, 3], [0, 6], [], [], [3], [], [1], []], _=2, s=3, t=0, order=[0, 1, 6], visited=[True, True, True, True, False, False, True, False], v=3, q_num=3, u=2\n return tmp\n\nv_num , e_num = map(int, input().split()) # (3): v_num=8, e_num=6\nedges = [[] for _ in range(v_num)] # (4): edges\nreverse_edges = [[] for _ in range(v_num)] # (5): reverse_edges\nfor _ in range(e_num): # (6): _=0 (10): edges=[[1], [], [], [], [], [], [], []], reverse_edges, _=1 ... (30): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges\n s, t = map(int, input().split()) # (7): s=0, t=1 (11): edges=[[1], [], [], [], [], [], [], []], reverse_edges=[[], [0], [], [], [], [], [], []], s=2, t=0 ... (27): edges=[[1], [6], [0], [4], [], [], [1], []], reverse_edges, s=3, t=0\n edges[s].append(t) # (8): edges (12): edges, reverse_edges ... (28): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges\n reverse_edges[t].append(s) # (9): edges=[[1], [], [], [], [], [], [], []], reverse_edges (13): edges, reverse_edges ... (29): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges\n\n\norder = [] # (31): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, order=[]\nvisited = [False] * v_num # (32): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, visited=[False, False, False, False, False, False, False, False]\ndfs(0, visited, edges, order) # (33): v=0, edges\norder.reverse() # (51): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, order=[0, 1, 6]\n\n\nvisited = [False] * v_num # (52): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, visited=[False, False, False, False, False, False, False, False]\nparent = [i for i in range(v_num)] # (53): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, parent=[0, 1, 2, 3, 4, 5, 6, 7]\nfor v in order: # (54): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, v=0 (71): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, v=1 ... (88): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges\n if not visited[v]: # (55): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges (72): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges (87): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges\n search_strongly_connection(v, visited, reverse_edges, parent) # (56): reverse_edges (73): reverse_edges\n\n\nq_num = int(input()) # (89): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, q_num=3\nfor _ in range(q_num): # (90): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, _=0 (99): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, _=1 (108): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, _=2\n u, v = map(int, input().split()) # (91): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, v=2, u=1 (100): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, v=6 (109): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, v=3, u=2\n if find(parent, u) == find(parent, v): # (92): x=1 (101): x=1 (110): x=2\n print(1) # (107): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges (119): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges\n else:\n print(0) # (98): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges\n"], "anno_status": [false], "diff_content": " \n \n+import sys\n+\n+sys.setrecursionlimit(1000000)\n \n def dfs(v, visited, edges, order):\n visited[v] = True\n for to in edges[v]:\n if not visited[to]:\n dfs(to, visited, edges, order)\n order.append(v)\n \n def search_strongly_connection(v, visited, reverse_edges, parent):\n visited[v] = True\n for to in reverse_edges[v]:\n if not visited[to]:\n parent[to] = v\n search_strongly_connection(to, visited, reverse_edges, parent)\n \n def find(parent, x):\n if parent[x] == x:\n return x\n tmp = find(parent, parent[x])\n parent[x] = tmp\n return tmp\n \n v_num , e_num = map(int, input().split())\n edges = [[] for _ in range(v_num)]\n reverse_edges = [[] for _ in range(v_num)]\n for _ in range(e_num):\n s, t = map(int, input().split())\n edges[s].append(t)\n reverse_edges[t].append(s)\n \n \n order = []\n visited = [False] * v_num\n-dfs(0, visited, edges, order)\n+for v in range(v_num):\n+ if not visited[v]:\n+ dfs(v, visited, edges, order)\n order.reverse()\n \n \n visited = [False] * v_num\n parent = [i for i in range(v_num)]\n for v in order:\n if not visited[v]:\n search_strongly_connection(v, visited, reverse_edges, parent)\n \n-\n q_num = int(input())\n for _ in range(q_num):\n u, v = map(int, input().split())\n if find(parent, u) == find(parent, v):\n print(1)\n else:\n print(0)\n \n", "FL_content": " \n \n \n def dfs(v, visited, edges, order):\n visited[v] = True\n for to in edges[v]:\n if not visited[to]:\n dfs(to, visited, edges, order)\n order.append(v)\n \n def search_strongly_connection(v, visited, reverse_edges, parent):\n visited[v] = True\n for to in reverse_edges[v]:\n if not visited[to]:\n parent[to] = v\n search_strongly_connection(to, visited, reverse_edges, parent)\n \n def find(parent, x):\n if parent[x] == x:\n return x\n tmp = find(parent, parent[x])\n parent[x] = tmp\n return tmp\n \n v_num , e_num = map(int, input().split())\n edges = [[] for _ in range(v_num)]\n reverse_edges = [[] for _ in range(v_num)]\n for _ in range(e_num):\n s, t = map(int, input().split())\n edges[s].append(t)\n reverse_edges[t].append(s)\n \n \n order = []\n visited = [False] * v_num\n-dfs(0, visited, edges, order)\n order.reverse()\n \n \n visited = [False] * v_num\n parent = [i for i in range(v_num)]\n for v in order:\n if not visited[v]:\n search_strongly_connection(v, visited, reverse_edges, parent)\n \n-\n q_num = int(input())\n for _ in range(q_num):\n u, v = map(int, input().split())\n if find(parent, u) == find(parent, v):\n print(1)\n else:\n print(0)\n \n", "added_lines": 6, "removed_lines": 2, "code1_lines": 54 }, { "user_id": "u567380442", "problem_id": "p02368", "submission1_id": "s194468131", "submission2_id": "s885336644", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\ndef search(g, v):\n visited = set()\n lowest = [None] * v\n parent = [None] * v\n prenum = [None] * v\n child = defaultdict(list)\n\n for i in range(v):\n if i in visited:\n continue\n root = i\n\n \n stack = [(root, None)]\n while stack:\n u, prev = stack.pop()\n if u not in visited:\n parent[u] = prev\n if prev is not None:\n child[prev].append(u)\n visited |= {u}\n prenum[u] = lowest[u] = len(visited)\n\n stack.extend([(v, u) for v in g[u][::-1] if v not in visited]) \n\n \n from collections import Counter\n leaf = [i for i in range(v) if not child[i]]\n unfinished = Counter()\n for li in leaf:\n while li is not None:\n \n candidate = [prenum[li]] + [prenum[i] for i in g[li]] + [lowest[i] for i in child[li]] \n lowest[li] = min(candidate)\n li = parent[li]\n if li is not None and 1 < len(child[li]):\n unfinished[li] += 1\n if unfinished[li] < len(child[li]):\n break\n return prenum, lowest\n\nfrom sys import stdin\nreadline = stdin.readline\n\n\ndef main():\n v, e = map(int, readline().split())\n from collections import defaultdict\n g = defaultdict(list)\n\n for _ in range(e):\n s, t = map(int, readline().split())\n g[s].append(t)\n \n prenum, lowest = search(g, v)\n q = int(readline())\n for u, v in [map(int, readline().split()) for _ in range(q)]:\n print(1 if lowest[u] == lowest[v] else 0)\nmain()", "code2": "from collections import UserList\nclass Stack(UserList):\n def __init__(self):\n UserList.__init__(self)\n self.contains = set()\n def __contains__(self, x):\n return x in self.contains\n def __and__(self, x):\n return self.contains & x\n def push(self, x):\n if x in self.contains:\n return\n self.data.append(x)\n self.contains |= {x}\n def pop(self):\n x = self.data.pop()\n self.contains -= {x}\n return x\n\ndef search(g, g_dash,v):\n \n visited = set()\n postorder = []\n for root in range(v):\n if root in visited:\n continue\n route = Stack()\n route.push(None)\n dfs_stack = [(root, None)] \n while dfs_stack:\n u, prev = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n dfs_stack.extend((v, u) for v in g[u] - visited)\n while route[-1] != prev:\n postorder.append(route.pop())\n route.push(u)\n while route[-1] is not None:\n postorder.append(route.pop())\n\n \n visited.clear()\n lowest = [None] * v\n for root in postorder[::-1]:\n if root in visited:\n continue\n dfs_stack = [root]\n while dfs_stack:\n u = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n lowest[u] = root\n dfs_stack.extend(g_dash[u] - visited)\n return lowest\n\nfrom sys import stdin\nfrom collections import defaultdict\nreadline = stdin.readline\n\ndef main():\n v, e = map(int, readline().split())\n g = defaultdict(set)\n g_dash = defaultdict(set)\n\n for _ in range(e):\n s, t = map(int, readline().split())\n g[s] |= {t} \n g_dash[t] |= {s} \n \n lowest = search(g,g_dash, v)\n q = int(readline())\n for u, v in [map(int, readline().split()) for _ in range(q)]:\n print(1 if lowest[u] == lowest[v] else 0)\nmain()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1428196638", "date2": "1428218620", "bleu_score": "0.6236655118321015", "code1_test_status": [1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 69, "total_score": 101, "input": "7 6\n0 1\n2 1\n1 2\n3 4\n4 3\n3 2\n4\n1 1\n0 5\n0 0\n3 4\n", "actual_output": "1\n0\n1\n0\n", "expected_output": "1\n0\n1\n1\n\n", "anno_code": ["from collections import defaultdict\ndef search(g, v): # (0): search=, stdin=<_io.TextIOWrapper name='../../test/autoComment2\\\\Dev\\\\p02368\\\\input_s194468131.txt' mode='r' encoding='utf-8'>\n visited = set() # (26): visited=set()\n lowest = [None] * v # (27): lowest=[None, None, None, None, None, None, None]\n parent = [None] * v # (28): parent=[None, None, None, None, None, None, None]\n prenum = [None] * v # (29): prenum=[None, None, None, None, None, None, None]\n child = defaultdict(list) # (30): child=defaultdict(, {})\n\n for i in range(v): # (31): i=0 (62): i=1 ... (119): Counter=\n if i in visited: # (32): NO CHANGE (63): NO CHANGE ... (107): NO CHANGE\n continue # (64): NO CHANGE (67): NO CHANGE (92): NO CHANGE\n root = i # (33): root=0 (70): root=3 ... (108): root=6\n\n \n stack = [(root, None)] # (34): stack=[(0, None)] (71): stack=[(3, None)] ... (109): stack=[(6, None)]\n while stack: # (35): NO CHANGE (43): NO CHANGE ... (118): NO CHANGE\n u, prev = stack.pop() # (36): stack=[], prev=None, u=0 (44): stack=[], prev=0, u=1 ... (111): stack=[], u=6\n if u not in visited: # (37): NO CHANGE (45): NO CHANGE ... (112): NO CHANGE\n parent[u] = prev # (38): NO CHANGE (46): parent=[None, 0, None, None, None, None, None] ... (113): NO CHANGE\n if prev is not None: # (39): NO CHANGE (47): NO CHANGE ... (114): NO CHANGE\n child[prev].append(u) # (48): child=defaultdict(, {0: [1]}) (57): child=defaultdict(, {0: [1], 1: [2]}) (85): child=defaultdict(, {0: [1], 1: [2], 3: [4]})\n visited |= {u} # (40): visited={0} (49): visited={0, 1} ... (115): visited={0, 1, 2, 3, 4, 5, 6}\n prenum[u] = lowest[u] = len(visited) # (41): lowest=[1, None, None, None, None, None, None], prenum=[1, None, None, None, None, None, None] (50): lowest=[1, 2, None, None, None, None, None], prenum=[1, 2, None, None, None, None, None] ... (116): lowest=[1, 2, 3, 4, 5, 6, 7], prenum=[1, 2, 3, 4, 5, 6, 7]\n\n stack.extend([(v, u) for v in g[u][::-1] if v not in visited]) # (42): stack=[(1, 0)] (51): stack=[(2, 1)] ... (117): g=defaultdict(, {0: [1], 2: [1], 1: [2], 3: [4, 2], 4: [3], 5: [], 6: []})\n\n \n from collections import Counter\n leaf = [i for i in range(v) if not child[i]] # (120): child=defaultdict(, {0: [1], 1: [2], 3: [4], 2: [], 4: [], 5: [], 6: []}), leaf=[2, 4, 5, 6]\n unfinished = Counter() # (121): unfinished=Counter()\n for li in leaf: # (122): li=2 (139): li=4 ... (165): e=6, defaultdict=, _=5, s=3, t=2\n while li is not None: # (123): NO CHANGE (128): NO CHANGE ... (164): NO CHANGE\n \n candidate = [prenum[li]] + [prenum[i] for i in g[li]] + [lowest[i] for i in child[li]] # (124): candidate=[3, 2] (129): candidate=[2, 3, 2] ... (160): candidate=[7]\n lowest[li] = min(candidate) # (125): lowest=[1, 2, 2, 4, 5, 6, 7] (130): NO CHANGE ... (161): NO CHANGE\n li = parent[li] # (126): li=1 (131): li=0 ... (162): li=None\n if li is not None and 1 < len(child[li]): # (127): NO CHANGE (132): NO CHANGE ... (163): NO CHANGE\n unfinished[li] += 1\n if unfinished[li] < len(child[li]):\n break\n return prenum, lowest\n\nfrom sys import stdin\nreadline = stdin.readline # (1): readline=\n\n\ndef main(): # (2): main=\n v, e = map(int, readline().split()) # (4): v=7, e=6, defaultdict=\n from collections import defaultdict\n g = defaultdict(list) # (5): g=defaultdict(, {})\n\n for _ in range(e): # (6): _=0 (9): _=1 ... (24): NO CHANGE\n s, t = map(int, readline().split()) # (7): s=0, t=1 (10): s=2 ... (22): s=3, t=2\n g[s].append(t) # (8): g=defaultdict(, {0: [1]}) (11): g=defaultdict(, {0: [1], 2: [1]}) ... (23): g=defaultdict(, {0: [1], 2: [1], 1: [2], 3: [4, 2], 4: [3]})\n \n prenum, lowest = search(g, v) # (25): NO CHANGE\n q = int(readline()) # (166): q=4\n for u, v in [map(int, readline().split()) for _ in range(q)]: # (167): v=1, u=1 (169): v=5, u=0 ... (173): v=4, u=3\n print(1 if lowest[u] == lowest[v] else 0) # (168): NO CHANGE (170): NO CHANGE ... (174): NO CHANGE\nmain() # (3): NO CHANGE\n"], "anno_status": [false], "diff_content": "-from collections import defaultdict\n-def search(g, v):\n- visited = set()\n- lowest = [None] * v\n- parent = [None] * v\n- prenum = [None] * v\n- child = defaultdict(list)\n+from collections import UserList\n+class Stack(UserList):\n+ def __init__(self):\n+ UserList.__init__(self)\n+ self.contains = set()\n+ def __contains__(self, x):\n+ return x in self.contains\n+ def __and__(self, x):\n+ return self.contains & x\n+ def push(self, x):\n+ if x in self.contains:\n+ return\n+ self.data.append(x)\n+ self.contains |= {x}\n+ def pop(self):\n+ x = self.data.pop()\n+ self.contains -= {x}\n+ return x\n \n- for i in range(v):\n- if i in visited:\n+def search(g, g_dash,v):\n+ \n+ visited = set()\n+ postorder = []\n+ for root in range(v):\n+ if root in visited:\n continue\n- root = i\n-\n- \n- stack = [(root, None)]\n- while stack:\n- u, prev = stack.pop()\n- if u not in visited:\n- parent[u] = prev\n- if prev is not None:\n- child[prev].append(u)\n- visited |= {u}\n- prenum[u] = lowest[u] = len(visited)\n-\n- stack.extend([(v, u) for v in g[u][::-1] if v not in visited]) \n+ route = Stack()\n+ route.push(None)\n+ dfs_stack = [(root, None)] \n+ while dfs_stack:\n+ u, prev = dfs_stack.pop()\n+ if u in visited:\n+ continue\n+ visited |= {u}\n+ dfs_stack.extend((v, u) for v in g[u] - visited)\n+ while route[-1] != prev:\n+ postorder.append(route.pop())\n+ route.push(u)\n+ while route[-1] is not None:\n+ postorder.append(route.pop())\n \n \n- from collections import Counter\n- leaf = [i for i in range(v) if not child[i]]\n- unfinished = Counter()\n- for li in leaf:\n- while li is not None:\n- \n- candidate = [prenum[li]] + [prenum[i] for i in g[li]] + [lowest[i] for i in child[li]] \n- lowest[li] = min(candidate)\n- li = parent[li]\n- if li is not None and 1 < len(child[li]):\n- unfinished[li] += 1\n- if unfinished[li] < len(child[li]):\n- break\n- return prenum, lowest\n+ visited.clear()\n+ lowest = [None] * v\n+ for root in postorder[::-1]:\n+ if root in visited:\n+ continue\n+ dfs_stack = [root]\n+ while dfs_stack:\n+ u = dfs_stack.pop()\n+ if u in visited:\n+ continue\n+ visited |= {u}\n+ lowest[u] = root\n+ dfs_stack.extend(g_dash[u] - visited)\n+ return lowest\n \n from sys import stdin\n+from collections import defaultdict\n readline = stdin.readline\n \n-\n def main():\n v, e = map(int, readline().split())\n- from collections import defaultdict\n- g = defaultdict(list)\n+ g = defaultdict(set)\n+ g_dash = defaultdict(set)\n \n for _ in range(e):\n s, t = map(int, readline().split())\n- g[s].append(t)\n+ g[s] |= {t} \n+ g_dash[t] |= {s} \n \n- prenum, lowest = search(g, v)\n+ lowest = search(g,g_dash, v)\n q = int(readline())\n for u, v in [map(int, readline().split()) for _ in range(q)]:\n print(1 if lowest[u] == lowest[v] else 0)\n main()\n", "FL_content": "-from collections import defaultdict\n-def search(g, v):\n- visited = set()\n- lowest = [None] * v\n- parent = [None] * v\n- prenum = [None] * v\n- child = defaultdict(list)\n \n- for i in range(v):\n- if i in visited:\n continue\n- root = i\n-\n- \n- stack = [(root, None)]\n- while stack:\n- u, prev = stack.pop()\n- if u not in visited:\n- parent[u] = prev\n- if prev is not None:\n- child[prev].append(u)\n- visited |= {u}\n- prenum[u] = lowest[u] = len(visited)\n-\n- stack.extend([(v, u) for v in g[u][::-1] if v not in visited]) \n \n \n- from collections import Counter\n- leaf = [i for i in range(v) if not child[i]]\n- unfinished = Counter()\n- for li in leaf:\n- while li is not None:\n- \n- candidate = [prenum[li]] + [prenum[i] for i in g[li]] + [lowest[i] for i in child[li]] \n- lowest[li] = min(candidate)\n- li = parent[li]\n- if li is not None and 1 < len(child[li]):\n- unfinished[li] += 1\n- if unfinished[li] < len(child[li]):\n- break\n- return prenum, lowest\n \n from sys import stdin\n readline = stdin.readline\n \n-\n def main():\n v, e = map(int, readline().split())\n- from collections import defaultdict\n- g = defaultdict(list)\n \n for _ in range(e):\n s, t = map(int, readline().split())\n- g[s].append(t)\n \n- prenum, lowest = search(g, v)\n q = int(readline())\n for u, v in [map(int, readline().split()) for _ in range(q)]:\n print(1 if lowest[u] == lowest[v] else 0)\n main()\n", "added_lines": 58, "removed_lines": 42, "code1_lines": 60 }, { "user_id": "u567380442", "problem_id": "p02368", "submission1_id": "s095147313", "submission2_id": "s885336644", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def search(g, g_dash, v):\n \n visited = set()\n prenum = []\n for root in range(v):\n if root in visited:\n continue\n dfs_stack = [root]\n while dfs_stack:\n u = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n prenum.append(u)\n dfs_stack.extend(g[u] - visited)\n\n \n visited.clear()\n lowest = [None] * v\n for root in prenum:\n if root in visited:\n continue\n dfs_stack = [root]\n while dfs_stack:\n u = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n lowest[u] = root\n dfs_stack.extend(g_dash[u] - visited)\n return lowest\n\nfrom sys import stdin\nreadline = stdin.readline\n\ndef main():\n v, e = map(int, readline().split())\n from collections import defaultdict\n g = defaultdict(set)\n g_dash = defaultdict(set)\n \n\n for _ in range(e):\n s, t = map(int, readline().split())\n g[s] |= {t} \n g_dash[t] |= {s} \n \n lowest = search(g, g_dash, v)\n q = int(readline())\n for u, v in [map(int, readline().split()) for _ in range(q)]:\n print(1 if lowest[u] == lowest[v] else 0)\nmain()", "code2": "from collections import UserList\nclass Stack(UserList):\n def __init__(self):\n UserList.__init__(self)\n self.contains = set()\n def __contains__(self, x):\n return x in self.contains\n def __and__(self, x):\n return self.contains & x\n def push(self, x):\n if x in self.contains:\n return\n self.data.append(x)\n self.contains |= {x}\n def pop(self):\n x = self.data.pop()\n self.contains -= {x}\n return x\n\ndef search(g, g_dash,v):\n \n visited = set()\n postorder = []\n for root in range(v):\n if root in visited:\n continue\n route = Stack()\n route.push(None)\n dfs_stack = [(root, None)] \n while dfs_stack:\n u, prev = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n dfs_stack.extend((v, u) for v in g[u] - visited)\n while route[-1] != prev:\n postorder.append(route.pop())\n route.push(u)\n while route[-1] is not None:\n postorder.append(route.pop())\n\n \n visited.clear()\n lowest = [None] * v\n for root in postorder[::-1]:\n if root in visited:\n continue\n dfs_stack = [root]\n while dfs_stack:\n u = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n lowest[u] = root\n dfs_stack.extend(g_dash[u] - visited)\n return lowest\n\nfrom sys import stdin\nfrom collections import defaultdict\nreadline = stdin.readline\n\ndef main():\n v, e = map(int, readline().split())\n g = defaultdict(set)\n g_dash = defaultdict(set)\n\n for _ in range(e):\n s, t = map(int, readline().split())\n g[s] |= {t} \n g_dash[t] |= {s} \n \n lowest = search(g,g_dash, v)\n q = int(readline())\n for u, v in [map(int, readline().split()) for _ in range(q)]:\n print(1 if lowest[u] == lowest[v] else 0)\nmain()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1428213008", "date2": "1428218620", "bleu_score": "0.6197393079330996", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1], "code1_test_score": 44, "total_score": 101, "input": "8 6\n0 1\n2 0\n1 4\n3 4\n4 2\n3 2\n3\n1 2\n0 6\n2 3\n2 4\n", "actual_output": "1\n0\n1\n", "expected_output": "1\n0\n0\n\n", "anno_code": ["def search(g, g_dash, v): # (0): search=, stdin=<_io.TextIOWrapper name='../../test/autoComment2\\\\Dev\\\\p02368\\\\input_s095147313.txt' mode='r' encoding='utf-8'>\n \n visited = set() # (33): visited=set()\n prenum = [] # (34): prenum=[]\n for root in range(v): # (35): root=0 (63): root=1 ... (112): NO CHANGE\n if root in visited: # (36): NO CHANGE (64): NO CHANGE ... (103): NO CHANGE\n continue # (65): NO CHANGE (68): NO CHANGE (81): NO CHANGE\n dfs_stack = [root] # (37): dfs_stack=[0] (71): dfs_stack=[3] ... (104): dfs_stack=[7]\n while dfs_stack: # (38): NO CHANGE (44): NO CHANGE ... (111): NO CHANGE\n u = dfs_stack.pop() # (39): dfs_stack=[], u=0 (45): dfs_stack=[], u=1 ... (106): dfs_stack=[], u=7\n if u in visited: # (40): NO CHANGE (46): NO CHANGE ... (107): NO CHANGE\n continue\n visited |= {u} # (41): visited={0} (47): visited={0, 1} ... (108): visited={0, 1, 2, 3, 4, 5, 6, 7}\n prenum.append(u) # (42): prenum=[0] (48): prenum=[0, 1] ... (109): prenum=[0, 1, 4, 2, 3, 5, 6, 7]\n dfs_stack.extend(g[u] - visited) # (43): dfs_stack=[1] (49): dfs_stack=[4] ... (110): g=defaultdict(, {0: {1}, 2: {0}, 1: {4}, 3: {2, 4}, 4: {2}, 5: set(), 6: set(), 7: set()})\n\n \n visited.clear() # (113): visited=set()\n lowest = [None] * v # (114): lowest=[None, None, None, None, None, None, None, None]\n for root in prenum: # (115): root=0 (153): root=1 ... (195): e=6, defaultdict=, _=5, s=3, t=2\n if root in visited: # (116): NO CHANGE (154): NO CHANGE ... (186): NO CHANGE\n continue # (155): NO CHANGE (158): NO CHANGE ... (164): NO CHANGE\n dfs_stack = [root] # (117): dfs_stack=[0] (167): dfs_stack=[5] ... (187): dfs_stack=[7]\n while dfs_stack: # (118): NO CHANGE (124): NO CHANGE ... (194): NO CHANGE\n u = dfs_stack.pop() # (119): dfs_stack=[], u=0 (125): dfs_stack=[], u=2 ... (189): dfs_stack=[], u=7\n if u in visited: # (120): NO CHANGE (126): NO CHANGE ... (190): NO CHANGE\n continue # (151): NO CHANGE\n visited |= {u} # (121): visited={0} (127): visited={0, 2} ... (191): visited={0, 1, 2, 3, 4, 5, 6, 7}\n lowest[u] = root # (122): lowest=[0, None, None, None, None, None, None, None] (128): lowest=[0, None, 0, None, None, None, None, None] ... (192): lowest=[0, 0, 0, 0, 0, 5, 6, 7]\n dfs_stack.extend(g_dash[u] - visited) # (123): dfs_stack=[2] (129): dfs_stack=[3, 4] ... (193): g_dash=defaultdict(, {1: {0}, 0: {2}, 4: {1, 3}, 2: {3, 4}, 3: set(), 5: set(), 6: set(), 7: set()})\n return lowest\n\nfrom sys import stdin\nreadline = stdin.readline # (1): readline=\n\ndef main(): # (2): main=\n v, e = map(int, readline().split()) # (4): v=8, e=6, defaultdict=\n from collections import defaultdict\n g = defaultdict(set) # (5): g=defaultdict(, {})\n g_dash = defaultdict(set) # (6): g_dash=defaultdict(, {})\n \n\n for _ in range(e): # (7): _=0 (11): _=1 ... (31): NO CHANGE\n s, t = map(int, readline().split()) # (8): s=0, t=1 (12): s=2, t=0 ... (28): s=3\n g[s] |= {t} # (9): g=defaultdict(, {0: {1}}) (13): g=defaultdict(, {0: {1}, 2: {0}}) ... (29): g=defaultdict(, {0: {1}, 2: {0}, 1: {4}, 3: {2, 4}, 4: {2}})\n g_dash[t] |= {s} # (10): g_dash=defaultdict(, {1: {0}}) (14): g_dash=defaultdict(, {1: {0}, 0: {2}}) ... (30): g_dash=defaultdict(, {1: {0}, 0: {2}, 4: {1, 3}, 2: {3, 4}})\n \n lowest = search(g, g_dash, v) # (32): NO CHANGE\n q = int(readline()) # (196): q=3\n for u, v in [map(int, readline().split()) for _ in range(q)]: # (197): v=2, u=1 (199): v=6, u=0 (201): v=3, u=2\n print(1 if lowest[u] == lowest[v] else 0) # (198): NO CHANGE (200): NO CHANGE (202): NO CHANGE\nmain() # (3): NO CHANGE\n"], "anno_status": [false], "diff_content": "-def search(g, g_dash, v):\n+from collections import UserList\n+class Stack(UserList):\n+ def __init__(self):\n+ UserList.__init__(self)\n+ self.contains = set()\n+ def __contains__(self, x):\n+ return x in self.contains\n+ def __and__(self, x):\n+ return self.contains & x\n+ def push(self, x):\n+ if x in self.contains:\n+ return\n+ self.data.append(x)\n+ self.contains |= {x}\n+ def pop(self):\n+ x = self.data.pop()\n+ self.contains -= {x}\n+ return x\n+\n+def search(g, g_dash,v):\n \n visited = set()\n- prenum = []\n+ postorder = []\n for root in range(v):\n if root in visited:\n continue\n- dfs_stack = [root]\n+ route = Stack()\n+ route.push(None)\n+ dfs_stack = [(root, None)] \n while dfs_stack:\n- u = dfs_stack.pop()\n+ u, prev = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n- prenum.append(u)\n- dfs_stack.extend(g[u] - visited)\n+ dfs_stack.extend((v, u) for v in g[u] - visited)\n+ while route[-1] != prev:\n+ postorder.append(route.pop())\n+ route.push(u)\n+ while route[-1] is not None:\n+ postorder.append(route.pop())\n \n \n visited.clear()\n lowest = [None] * v\n- for root in prenum:\n+ for root in postorder[::-1]:\n if root in visited:\n continue\n dfs_stack = [root]\n while dfs_stack:\n u = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n lowest[u] = root\n dfs_stack.extend(g_dash[u] - visited)\n return lowest\n \n from sys import stdin\n+from collections import defaultdict\n readline = stdin.readline\n \n def main():\n v, e = map(int, readline().split())\n- from collections import defaultdict\n g = defaultdict(set)\n g_dash = defaultdict(set)\n- \n \n for _ in range(e):\n s, t = map(int, readline().split())\n g[s] |= {t} \n g_dash[t] |= {s} \n \n- lowest = search(g, g_dash, v)\n+ lowest = search(g,g_dash, v)\n q = int(readline())\n for u, v in [map(int, readline().split()) for _ in range(q)]:\n print(1 if lowest[u] == lowest[v] else 0)\n main()\n", "FL_content": "-def search(g, g_dash, v):\n \n visited = set()\n- prenum = []\n for root in range(v):\n if root in visited:\n continue\n- dfs_stack = [root]\n while dfs_stack:\n- u = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n- prenum.append(u)\n- dfs_stack.extend(g[u] - visited)\n \n \n visited.clear()\n lowest = [None] * v\n- for root in prenum:\n if root in visited:\n continue\n dfs_stack = [root]\n while dfs_stack:\n u = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n lowest[u] = root\n dfs_stack.extend(g_dash[u] - visited)\n return lowest\n \n from sys import stdin\n readline = stdin.readline\n \n def main():\n v, e = map(int, readline().split())\n- from collections import defaultdict\n g = defaultdict(set)\n g_dash = defaultdict(set)\n- \n \n for _ in range(e):\n s, t = map(int, readline().split())\n g[s] |= {t} \n g_dash[t] |= {s} \n \n- lowest = search(g, g_dash, v)\n q = int(readline())\n for u, v in [map(int, readline().split()) for _ in range(q)]:\n print(1 if lowest[u] == lowest[v] else 0)\n main()\n", "added_lines": 34, "removed_lines": 10, "code1_lines": 52 }, { "user_id": "u432251613", "problem_id": "p03545", "submission1_id": "s635376393", "submission2_id": "s695873618", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n (A,B,C,D) = map(int, input())\n operation = ['+','-']\n for op1 in operation:\n sum = A\n if op1=='+':\n sum+=B\n else:\n sum-=B\n for op2 in operation:\n if op2=='+':\n sum+=C\n else:\n sum-=C\n if 7-sum==D:\n op3 = '+'\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7')\n return\n elif sum-7==D:\n op3 = '-'\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7')\n return\n\nmain()\n", "code2": "def main():\n (A,B,C,D) = map(int, input())\n operation = ['+','-']\n sumA = A\n for op1 in operation:\n sum = sumA\n if op1=='+':\n sum+=B\n else:\n sum-=B\n sumAB = sum\n for op2 in operation:\n sum = sumAB\n if op2=='+':\n sum+=C\n else:\n sum-=C\n if 7-sum==D:\n op3 = '+'\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7')\n return\n elif sum-7==D:\n op3 = '-'\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7')\n return\n\nmain()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591095802", "date2": "1591096738", "bleu_score": "0.908883551051966", "code1_test_status": [1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 65, "total_score": 99, "input": "2368\n", "actual_output": "2-3-6+8=7\n", "expected_output": "2+3-6+8=7\n\n", "anno_code": ["def main(): # (0): main=\n (A,B,C,D) = map(int, input()) # (2): A=2, B=3, C=6, D=8\n operation = ['+','-'] # (3): operation=['+', '-']\n for op1 in operation: # (4): op1=+ (19): op1=-\n sum = A # (5): sum=2 (20): sum=2\n if op1=='+': # (6): NO CHANGE (21): NO CHANGE\n sum+=B # (7): sum=5\n else:\n sum-=B # (22): sum=-1\n for op2 in operation: # (8): op2=+ (13): op2=- ... (28): op2=-\n if op2=='+': # (9): NO CHANGE (14): NO CHANGE ... (29): NO CHANGE\n sum+=C # (10): sum=11 (25): sum=5\n else:\n sum-=C # (15): sum=5 (30): sum=-1\n if 7-sum==D: # (11): NO CHANGE (16): NO CHANGE ... (31): NO CHANGE\n op3 = '+' # (32): op3=+\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7') # (33): NO CHANGE\n return\n elif sum-7==D: # (12): NO CHANGE (17): NO CHANGE (27): NO CHANGE\n op3 = '-'\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7')\n return\n\nmain() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " def main():\n (A,B,C,D) = map(int, input())\n operation = ['+','-']\n+ sumA = A\n for op1 in operation:\n- sum = A\n+ sum = sumA\n if op1=='+':\n sum+=B\n else:\n sum-=B\n+ sumAB = sum\n for op2 in operation:\n+ sum = sumAB\n if op2=='+':\n sum+=C\n else:\n sum-=C\n if 7-sum==D:\n op3 = '+'\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7')\n return\n elif sum-7==D:\n op3 = '-'\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7')\n return\n \n main()\n \n", "FL_content": " def main():\n (A,B,C,D) = map(int, input())\n operation = ['+','-']\n for op1 in operation:\n- sum = A\n if op1=='+':\n sum+=B\n else:\n sum-=B\n for op2 in operation:\n if op2=='+':\n sum+=C\n else:\n sum-=C\n if 7-sum==D:\n op3 = '+'\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7')\n return\n elif sum-7==D:\n op3 = '-'\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7')\n return\n \n main()\n \n", "added_lines": 4, "removed_lines": 1, "code1_lines": 25 }, { "user_id": "u584563392", "problem_id": "p03545", "submission1_id": "s528633389", "submission2_id": "s242619992", "status1": "Wrong Answer", "status2": "Accepted", "code1": "input_str = input()\nA = int(input_str[0])\nB = int(input_str[1])\nC = int(input_str[2])\nD = int(input_str[3])\n\nlist = []\nlist.append(A + B + C + D)\nlist.append(A + B + C - D)\nlist.append(A + B - C + D)\nlist.append(A + B - C - D)\nlist.append(A - B + C + D)\nlist.append(A - B + C - D)\nlist.append(A - B - C + D)\nlist.append(A - B - C - D)\n\nnum = list.index(7)\nprint(num)\n\nif num <= 3:\n op1 = '+'\nelse:\n op1 = '-'\n\nif num == 0 or num == 1 or num == 4 or num == 5:\n op2 = '+'\nelse:\n op2 = '-'\n\nif num % 2 == 0:\n op3 = '+'\nelse:\n op3 = '-'\n\nprint('{}{}{}{}{}{}{}=7'.format(A,op1,B,op2,C,op3,D))\n", "code2": "input_str = input()\nA = int(input_str[0])\nB = int(input_str[1])\nC = int(input_str[2])\nD = int(input_str[3])\n\nlist = []\nlist.append(A + B + C + D)\nlist.append(A + B + C - D)\nlist.append(A + B - C + D)\nlist.append(A + B - C - D)\nlist.append(A - B + C + D)\nlist.append(A - B + C - D)\nlist.append(A - B - C + D)\nlist.append(A - B - C - D)\n\nnum = list.index(7)\n\nif num <= 3:\n op1 = '+'\nelse:\n op1 = '-'\n\nif num == 0 or num == 1 or num == 4 or num == 5:\n op2 = '+'\nelse:\n op2 = '-'\n\nif num % 2 == 0:\n op3 = '+'\nelse:\n op3 = '-'\n\nprint('{}{}{}{}{}{}{}=7'.format(A,op1,B,op2,C,op3,D))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1511060389", "date2": "1511060500", "bleu_score": "0.9795858581806592", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 99, "input": "1222\n", "actual_output": "0\n1+2+2+2=7\n", "expected_output": "1+2+2+2=7\n", "anno_code": ["input_str = input() # (0): input_str=1222\nA = int(input_str[0]) # (1): A=1\nB = int(input_str[1]) # (2): B=2\nC = int(input_str[2]) # (3): C=2\nD = int(input_str[3]) # (4): D=2\n\nlist = [] # (5): list=[]\nlist.append(A + B + C + D) # (6): list=[7]\nlist.append(A + B + C - D) # (7): list=[7, 3]\nlist.append(A + B - C + D) # (8): list=[7, 3, 3]\nlist.append(A + B - C - D) # (9): list=[7, 3, 3, -1]\nlist.append(A - B + C + D) # (10): list=[7, 3, 3, -1, 3]\nlist.append(A - B + C - D) # (11): list=[7, 3, 3, -1, 3, -1]\nlist.append(A - B - C + D) # (12): list=[7, 3, 3, -1, 3, -1, -1]\nlist.append(A - B - C - D) # (13): list=[7, 3, 3, -1, 3, -1, -1, -5]\n\nnum = list.index(7) # (14): num=0\nprint(num) # (15): NO CHANGE\n\nif num <= 3: # (16): NO CHANGE\n op1 = '+' # (17): op1=+\nelse:\n op1 = '-'\n\nif num == 0 or num == 1 or num == 4 or num == 5: # (18): NO CHANGE\n op2 = '+' # (19): op2=+\nelse:\n op2 = '-'\n\nif num % 2 == 0: # (20): NO CHANGE\n op3 = '+' # (21): op3=+\nelse:\n op3 = '-'\n\nprint('{}{}{}{}{}{}{}=7'.format(A,op1,B,op2,C,op3,D))\n"], "anno_status": [true], "diff_content": " input_str = input()\n A = int(input_str[0])\n B = int(input_str[1])\n C = int(input_str[2])\n D = int(input_str[3])\n \n list = []\n list.append(A + B + C + D)\n list.append(A + B + C - D)\n list.append(A + B - C + D)\n list.append(A + B - C - D)\n list.append(A - B + C + D)\n list.append(A - B + C - D)\n list.append(A - B - C + D)\n list.append(A - B - C - D)\n \n num = list.index(7)\n-print(num)\n \n if num <= 3:\n op1 = '+'\n else:\n op1 = '-'\n \n if num == 0 or num == 1 or num == 4 or num == 5:\n op2 = '+'\n else:\n op2 = '-'\n \n if num % 2 == 0:\n op3 = '+'\n else:\n op3 = '-'\n \n print('{}{}{}{}{}{}{}=7'.format(A,op1,B,op2,C,op3,D))\n-\n", "FL_content": " input_str = input()\n A = int(input_str[0])\n B = int(input_str[1])\n C = int(input_str[2])\n D = int(input_str[3])\n \n list = []\n list.append(A + B + C + D)\n list.append(A + B + C - D)\n list.append(A + B - C + D)\n list.append(A + B - C - D)\n list.append(A - B + C + D)\n list.append(A - B + C - D)\n list.append(A - B - C + D)\n list.append(A - B - C - D)\n \n num = list.index(7)\n-print(num)\n \n if num <= 3:\n op1 = '+'\n else:\n op1 = '-'\n \n if num == 0 or num == 1 or num == 4 or num == 5:\n op2 = '+'\n else:\n op2 = '-'\n \n if num % 2 == 0:\n op3 = '+'\n else:\n op3 = '-'\n \n print('{}{}{}{}{}{}{}=7'.format(A,op1,B,op2,C,op3,D))\n-\n", "added_lines": 0, "removed_lines": 2, "code1_lines": 36 }, { "user_id": "u600195339", "problem_id": "p03545", "submission1_id": "s251886501", "submission2_id": "s177851500", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\ns = input()\na = []\n\nfor i in range(len(s)):\n num = int(s[i])\n a.append(num)\n\nprint(a)\nop = ['+', '-']\n\nfor i in range(2):\n for j in range(2):\n for k in range(2):\n temp = 0\n if op[i] == '+':\n temp = a[0] + a[1]\n else:\n temp = a[0] - a[1]\n if op[j] == '+':\n temp += a[2]\n else:\n temp -= a[2]\n if op[k] == '+':\n temp += a[3]\n else:\n temp -= a[3]\n\n if temp == 7:\n n1, n2, n3, n4 = map(str, [a[0], a[1], a[2], a[3]])\n \n print(n1 + op[i] + n2 + op[j] + n3 + op[k] + n4 + '=7')\n sys.exit()\n", "code2": "\nimport sys\ns = input()\na = []\n\nfor i in range(len(s)):\n num = int(s[i])\n a.append(num)\n\n\nop = ['+', '-']\n\nfor i in range(2):\n for j in range(2):\n for k in range(2):\n temp = 0\n if op[i] == '+':\n temp = a[0] + a[1]\n else:\n temp = a[0] - a[1]\n if op[j] == '+':\n temp += a[2]\n else:\n temp -= a[2]\n if op[k] == '+':\n temp += a[3]\n else:\n temp -= a[3]\n\n if temp == 7:\n n1, n2, n3, n4 = map(str, [a[0], a[1], a[2], a[3]])\n \n print(n1 + op[i] + n2 + op[j] + n3 + op[k] + n4 + '=7')\n sys.exit()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1572035008", "date2": "1572035086", "bleu_score": "0.9872518290241994", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 99, "input": "1170\n", "actual_output": "[1, 1, 7, 0]\n1-1+7+0=7\n", "expected_output": "1-1+7+0=7\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " \n import sys\n s = input()\n a = []\n \n for i in range(len(s)):\n num = int(s[i])\n a.append(num)\n \n-print(a)\n+\n op = ['+', '-']\n \n for i in range(2):\n for j in range(2):\n for k in range(2):\n temp = 0\n if op[i] == '+':\n temp = a[0] + a[1]\n else:\n temp = a[0] - a[1]\n if op[j] == '+':\n temp += a[2]\n else:\n temp -= a[2]\n if op[k] == '+':\n temp += a[3]\n else:\n temp -= a[3]\n \n if temp == 7:\n n1, n2, n3, n4 = map(str, [a[0], a[1], a[2], a[3]])\n \n print(n1 + op[i] + n2 + op[j] + n3 + op[k] + n4 + '=7')\n sys.exit()\n \n", "FL_content": " \n import sys\n s = input()\n a = []\n \n for i in range(len(s)):\n num = int(s[i])\n a.append(num)\n \n-print(a)\n op = ['+', '-']\n \n for i in range(2):\n for j in range(2):\n for k in range(2):\n temp = 0\n if op[i] == '+':\n temp = a[0] + a[1]\n else:\n temp = a[0] - a[1]\n if op[j] == '+':\n temp += a[2]\n else:\n temp -= a[2]\n if op[k] == '+':\n temp += a[3]\n else:\n temp -= a[3]\n \n if temp == 7:\n n1, n2, n3, n4 = map(str, [a[0], a[1], a[2], a[3]])\n \n print(n1 + op[i] + n2 + op[j] + n3 + op[k] + n4 + '=7')\n sys.exit()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 35 }, { "user_id": "u351241495", "problem_id": "p03545", "submission1_id": "s810045787", "submission2_id": "s355859736", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nlistA=[0,0,0,0]\ni=0\nfor x in s:\n listA[i]=int(x)\n i+=1\na=listA[0]\nb=listA[1]\nc=listA[2]\nd=listA[3]\nif(a+b+c+d==7):\n print(\"%d+%d+%d+%d==7\"% (a,b,c,d))\nelif(a+b+c-d==7):\n print(\"%d+%d+%d-%d==7\"% (a,b,c,d))\nelif(a+b-c+d==7):\n print(\"%d+%d-%d+%d==7\" % (a, b, c, d))\nelif(a+b-c-d==7):\n print(\"%d+%d-%d-%d==7\" % (a, b, c, d))\nelif(a-b+c+d==7):\n print(\"%d-%d+%d+%d==7\" % (a, b, c, d))\nelif(a-b-c+d==7):\n print(\"%d-%d-%d+%d==7\" % (a, b, c, d))\nelif(a-b-c-d==7):\n print(\"%d-%d-%d-%d==7\" % (a, b, c, d))\nelif(a-b+c-d==7):\n print(\"%d-%d+%d-%d==7\" % (a, b, c, d))", "code2": "s=input()\nlistA=[0,0,0,0]\ni=0\nfor x in s:\n listA[i]=int(x)\n i+=1\na=listA[0]\nb=listA[1]\nc=listA[2]\nd=listA[3]\nif(a+b+c+d==7):\n print(\"%d+%d+%d+%d=7\"% (a,b,c,d))\nelif(a+b+c-d==7):\n print(\"%d+%d+%d-%d=7\"% (a,b,c,d))\nelif(a+b-c+d==7):\n print(\"%d+%d-%d+%d=7\" % (a, b, c, d))\nelif(a+b-c-d==7):\n print(\"%d+%d-%d-%d=7\" % (a, b, c, d))\nelif(a-b+c+d==7):\n print(\"%d-%d+%d+%d=7\" % (a, b, c, d))\nelif(a-b-c+d==7):\n print(\"%d-%d-%d+%d=7\" % (a, b, c, d))\nelif(a-b-c-d==7):\n print(\"%d-%d-%d-%d=7\" % (a, b, c, d))\nelif(a-b+c-d==7):\n print(\"%d-%d+%d-%d=7\" % (a, b, c, d))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1511629536", "date2": "1511629639", "bleu_score": "0.9761488934731087", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 99, "input": "1583\n", "actual_output": "1-5+8+3==7\n", "expected_output": "1-5+8+3=7\n\n", "anno_code": ["s=input() # (0): s=1583\nlistA=[0,0,0,0] # (1): listA=[0, 0, 0, 0]\ni=0 # (2): i=0\nfor x in s: # (3): x=1 (6): x=5 ... (15): NO CHANGE\n listA[i]=int(x) # (4): listA=[1, 0, 0, 0] (7): listA=[1, 5, 0, 0] ... (13): listA=[1, 5, 8, 3]\n i+=1 # (5): i=1 (8): i=2 ... (14): i=4\na=listA[0] # (16): a=1\nb=listA[1] # (17): b=5\nc=listA[2] # (18): c=8\nd=listA[3] # (19): d=3\nif(a+b+c+d==7): # (20): NO CHANGE\n print(\"%d+%d+%d+%d==7\"% (a,b,c,d))\nelif(a+b+c-d==7): # (21): NO CHANGE\n print(\"%d+%d+%d-%d==7\"% (a,b,c,d))\nelif(a+b-c+d==7): # (22): NO CHANGE\n print(\"%d+%d-%d+%d==7\" % (a, b, c, d))\nelif(a+b-c-d==7): # (23): NO CHANGE\n print(\"%d+%d-%d-%d==7\" % (a, b, c, d))\nelif(a-b+c+d==7): # (24): NO CHANGE\n print(\"%d-%d+%d+%d==7\" % (a, b, c, d))\nelif(a-b-c+d==7):\n print(\"%d-%d-%d+%d==7\" % (a, b, c, d))\nelif(a-b-c-d==7):\n print(\"%d-%d-%d-%d==7\" % (a, b, c, d))\nelif(a-b+c-d==7):\n print(\"%d-%d+%d-%d==7\" % (a, b, c, d))"], "anno_status": [true], "diff_content": " s=input()\n listA=[0,0,0,0]\n i=0\n for x in s:\n listA[i]=int(x)\n i+=1\n a=listA[0]\n b=listA[1]\n c=listA[2]\n d=listA[3]\n if(a+b+c+d==7):\n- print(\"%d+%d+%d+%d==7\"% (a,b,c,d))\n+ print(\"%d+%d+%d+%d=7\"% (a,b,c,d))\n elif(a+b+c-d==7):\n- print(\"%d+%d+%d-%d==7\"% (a,b,c,d))\n+ print(\"%d+%d+%d-%d=7\"% (a,b,c,d))\n elif(a+b-c+d==7):\n- print(\"%d+%d-%d+%d==7\" % (a, b, c, d))\n+ print(\"%d+%d-%d+%d=7\" % (a, b, c, d))\n elif(a+b-c-d==7):\n- print(\"%d+%d-%d-%d==7\" % (a, b, c, d))\n+ print(\"%d+%d-%d-%d=7\" % (a, b, c, d))\n elif(a-b+c+d==7):\n- print(\"%d-%d+%d+%d==7\" % (a, b, c, d))\n+ print(\"%d-%d+%d+%d=7\" % (a, b, c, d))\n elif(a-b-c+d==7):\n- print(\"%d-%d-%d+%d==7\" % (a, b, c, d))\n+ print(\"%d-%d-%d+%d=7\" % (a, b, c, d))\n elif(a-b-c-d==7):\n- print(\"%d-%d-%d-%d==7\" % (a, b, c, d))\n+ print(\"%d-%d-%d-%d=7\" % (a, b, c, d))\n elif(a-b+c-d==7):\n- print(\"%d-%d+%d-%d==7\" % (a, b, c, d))\n+ print(\"%d-%d+%d-%d=7\" % (a, b, c, d))\n", "FL_content": " s=input()\n listA=[0,0,0,0]\n i=0\n for x in s:\n listA[i]=int(x)\n i+=1\n a=listA[0]\n b=listA[1]\n c=listA[2]\n d=listA[3]\n if(a+b+c+d==7):\n- print(\"%d+%d+%d+%d==7\"% (a,b,c,d))\n elif(a+b+c-d==7):\n- print(\"%d+%d+%d-%d==7\"% (a,b,c,d))\n elif(a+b-c+d==7):\n- print(\"%d+%d-%d+%d==7\" % (a, b, c, d))\n elif(a+b-c-d==7):\n- print(\"%d+%d-%d-%d==7\" % (a, b, c, d))\n elif(a-b+c+d==7):\n- print(\"%d-%d+%d+%d==7\" % (a, b, c, d))\n elif(a-b-c+d==7):\n- print(\"%d-%d-%d+%d==7\" % (a, b, c, d))\n elif(a-b-c-d==7):\n- print(\"%d-%d-%d-%d==7\" % (a, b, c, d))\n elif(a-b+c-d==7):\n- print(\"%d-%d+%d-%d==7\" % (a, b, c, d))\n", "added_lines": 8, "removed_lines": 8, "code1_lines": 26 }, { "user_id": "u699522269", "problem_id": "p03545", "submission1_id": "s034658032", "submission2_id": "s800432583", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A,B,C,D = map(int,input())\nrt = str(A)\nfor bt in (True, False):\n tmp=7-A\n for ct in (True, False):\n for dt in (True, False):\n tmp = tmp-B if bt else tmp+B\n tmp = tmp-C if ct else tmp+C\n tmp = tmp-D if dt else tmp+D\n if tmp == 0:\n rt+=\"+\" if bt else \"-\"\n rt+=str(B)\n rt+=\"+\" if ct else \"-\"\n rt+=str(C)\n rt+=\"+\" if dt else \"-\"\n rt+=str(D)\n rt+=\"=7\"\n\nprint(rt)", "code2": "A,B,C,D = map(int,input())\ntfs = []\nrt = str(A)\nfor bt in (True, False):\n for ct in (True, False):\n for dt in (True, False):\n tfs.append([bt,ct,dt])\nfor bt,ct,dt in tfs:\n tmp=7-A\n tmp = tmp-B if bt else tmp+B\n tmp = tmp-C if ct else tmp+C\n tmp = tmp-D if dt else tmp+D\n if tmp == 0:\n rt+=\"+\" if bt else \"-\"\n rt+=str(B)\n rt+=\"+\" if ct else \"-\"\n rt+=str(C)\n rt+=\"+\" if dt else \"-\"\n rt+=str(D)\n rt+=\"=7\"\n break\n\nprint(rt)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599423470", "date2": "1599423853", "bleu_score": "0.8623530207537938", "code1_test_status": [0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 30, "total_score": 99, "input": "1802\n", "actual_output": "1\n", "expected_output": "1+8+0-2=7\n\n", "anno_code": ["A,B,C,D = map(int,input()) # (0): A=1, B=8, C=0, D=2\nrt = str(A) # (1): rt=1\nfor bt in (True, False): # (2): bt=True (29): bt=False (56): NO CHANGE\n tmp=7-A # (3): tmp=6 (30): tmp=6\n for ct in (True, False): # (4): ct=True (16): ct=False ... (55): NO CHANGE\n for dt in (True, False): # (5): dt=True (10): dt=False ... (54): NO CHANGE\n tmp = tmp-B if bt else tmp+B # (6): tmp=-2 (11): tmp=-12 ... (50): tmp=36\n tmp = tmp-C if ct else tmp+C # (7): NO CHANGE (12): NO CHANGE ... (51): NO CHANGE\n tmp = tmp-D if dt else tmp+D # (8): tmp=-4 (13): tmp=-10 ... (52): tmp=38\n if tmp == 0: # (9): NO CHANGE (14): NO CHANGE ... (53): NO CHANGE\n rt+=\"+\" if bt else \"-\"\n rt+=str(B)\n rt+=\"+\" if ct else \"-\"\n rt+=str(C)\n rt+=\"+\" if dt else \"-\"\n rt+=str(D)\n rt+=\"=7\"\n\nprint(rt)"], "anno_status": [true], "diff_content": " A,B,C,D = map(int,input())\n+tfs = []\n rt = str(A)\n for bt in (True, False):\n- tmp=7-A\n for ct in (True, False):\n for dt in (True, False):\n- tmp = tmp-B if bt else tmp+B\n- tmp = tmp-C if ct else tmp+C\n- tmp = tmp-D if dt else tmp+D\n- if tmp == 0:\n- rt+=\"+\" if bt else \"-\"\n- rt+=str(B)\n- rt+=\"+\" if ct else \"-\"\n- rt+=str(C)\n- rt+=\"+\" if dt else \"-\"\n- rt+=str(D)\n- rt+=\"=7\"\n+ tfs.append([bt,ct,dt])\n+for bt,ct,dt in tfs:\n+ tmp=7-A\n+ tmp = tmp-B if bt else tmp+B\n+ tmp = tmp-C if ct else tmp+C\n+ tmp = tmp-D if dt else tmp+D\n+ if tmp == 0:\n+ rt+=\"+\" if bt else \"-\"\n+ rt+=str(B)\n+ rt+=\"+\" if ct else \"-\"\n+ rt+=str(C)\n+ rt+=\"+\" if dt else \"-\"\n+ rt+=str(D)\n+ rt+=\"=7\"\n+ break\n \n print(rt)\n", "FL_content": " A,B,C,D = map(int,input())\n rt = str(A)\n for bt in (True, False):\n- tmp=7-A\n for ct in (True, False):\n for dt in (True, False):\n- tmp = tmp-B if bt else tmp+B\n- tmp = tmp-C if ct else tmp+C\n- tmp = tmp-D if dt else tmp+D\n- if tmp == 0:\n- rt+=\"+\" if bt else \"-\"\n- rt+=str(B)\n- rt+=\"+\" if ct else \"-\"\n- rt+=str(C)\n- rt+=\"+\" if dt else \"-\"\n- rt+=str(D)\n- rt+=\"=7\"\n \n print(rt)\n", "added_lines": 16, "removed_lines": 12, "code1_lines": 19 }, { "user_id": "u917558625", "problem_id": "p03545", "submission1_id": "s746775019", "submission2_id": "s483975321", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import itertools\nA=input()\nfor i in list(itertools.product(range(2),repeat=3)):\n c=''\n c+=A[0]\n bns=int(A[0])\n for j in range(3):\n if i[j]==0:\n bns+=int(A[j+1])\n c+='+'+A[j+1]\n else:\n bns-=int(A[j+1])\n c+='-'+A[j+1]\n if bns==7:\n print(c)\n exit()", "code2": "import itertools\nA=input()\nfor i in list(itertools.product(range(2),repeat=3)):\n c=''\n c+=A[0]\n bns=int(A[0])\n for j in range(3):\n if i[j]==0:\n bns+=int(A[j+1])\n c+='+'+A[j+1]\n else:\n bns-=int(A[j+1])\n c+='-'+A[j+1]\n if bns==7:\n print(c+'=7')\n exit()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593556476", "date2": "1593556519", "bleu_score": "0.9772090310554077", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 99, "input": "1152\n", "actual_output": "1-1+5+2\n", "expected_output": "1-1+5+2=7\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " import itertools\n A=input()\n for i in list(itertools.product(range(2),repeat=3)):\n c=''\n c+=A[0]\n bns=int(A[0])\n for j in range(3):\n if i[j]==0:\n bns+=int(A[j+1])\n c+='+'+A[j+1]\n else:\n bns-=int(A[j+1])\n c+='-'+A[j+1]\n if bns==7:\n- print(c)\n+ print(c+'=7')\n exit()\n", "FL_content": " import itertools\n A=input()\n for i in list(itertools.product(range(2),repeat=3)):\n c=''\n c+=A[0]\n bns=int(A[0])\n for j in range(3):\n if i[j]==0:\n bns+=int(A[j+1])\n c+='+'+A[j+1]\n else:\n bns-=int(A[j+1])\n c+='-'+A[j+1]\n if bns==7:\n- print(c)\n exit()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u970308980", "problem_id": "p03545", "submission1_id": "s060747056", "submission2_id": "s602313531", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input().rstrip()\nop = ['+', '-', '*', '/']\nfor op1 in op:\n for op2 in op:\n for op3 in op:\n func = S[0] + op1 + S[1] + op2 + S[2] + op3 + S[3]\n res = 0\n try:\n res = eval(func)\n except:\n pass\n if res == 7:\n print(func + '=7')\n exit()\n", "code2": "S = input().rstrip()\nop = ['+', '-']\nfor op1 in op:\n for op2 in op:\n for op3 in op:\n res = 0\n try:\n func = S[0] + op1 + S[1] + op2 + S[2] + op3 + S[3]\n res = eval(func)\n except:\n pass\n if res == 7:\n print(func + '=7')\n exit()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566262351", "date2": "1566262931", "bleu_score": "0.9713977399403594", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 99, "input": "6120\n", "actual_output": "6+1+2*0=7\n", "expected_output": "6-1+2+0=7\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " S = input().rstrip()\n-op = ['+', '-', '*', '/']\n+op = ['+', '-']\n for op1 in op:\n for op2 in op:\n for op3 in op:\n- func = S[0] + op1 + S[1] + op2 + S[2] + op3 + S[3]\n res = 0\n try:\n+ func = S[0] + op1 + S[1] + op2 + S[2] + op3 + S[3]\n res = eval(func)\n except:\n pass\n if res == 7:\n print(func + '=7')\n exit()\n \n", "FL_content": " S = input().rstrip()\n-op = ['+', '-', '*', '/']\n for op1 in op:\n for op2 in op:\n for op3 in op:\n- func = S[0] + op1 + S[1] + op2 + S[2] + op3 + S[3]\n res = 0\n try:\n res = eval(func)\n except:\n pass\n if res == 7:\n print(func + '=7')\n exit()\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 15 }, { "user_id": "u144072139", "problem_id": "p03545", "submission1_id": "s359533475", "submission2_id": "s348703086", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\na,b,c,d=list(input())\ns=\"+-\"\n\nfor i in range(2):\n for j in range(2):\n for k in range(2):\n if eval(a+s[i]+b+s[j]+c+s[k]+d)==7:\n print(eval(a+s[i]+b+s[j]+c+s[k]+d))", "code2": "\na,b,c,d=list(input())\ns=\"+-\"\n\nfor i in range(2):\n for j in range(2):\n for k in range(2):\n if eval(a+s[i]+b+s[j]+c+s[k]+d)==7:\n print(str(a+s[i]+b+s[j]+c+s[k]+d)+\"=7\")\n exit()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588973481", "date2": "1588973882", "bleu_score": "0.8529159340447985", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 99, "input": "3242\n", "actual_output": "7\n7\n", "expected_output": "3+2+4-2=7\n", "anno_code": [" # (6): NO CHANGE (9): NO CHANGE ... (39): NO CHANGE\na,b,c,d=list(input()) # (0): a=3, b=2, c=4, d=2\ns=\"+-\" # (1): s=+-\n\nfor i in range(2): # (2): i=0 (22): i=1\n for j in range(2): # (3): j=0 (13): j=1 ... (41): NO CHANGE\n for k in range(2): # (4): k=0 (7): k=1 ... (40): NO CHANGE\n if eval(a+s[i]+b+s[j]+c+s[k]+d)==7: # (5): NO CHANGE (8): NO CHANGE ... (38): NO CHANGE\n print(eval(a+s[i]+b+s[j]+c+s[k]+d)) # (10): NO CHANGE (27): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n a,b,c,d=list(input())\n s=\"+-\"\n \n for i in range(2):\n for j in range(2):\n for k in range(2):\n if eval(a+s[i]+b+s[j]+c+s[k]+d)==7:\n- print(eval(a+s[i]+b+s[j]+c+s[k]+d))\n+ print(str(a+s[i]+b+s[j]+c+s[k]+d)+\"=7\")\n+ exit()\n", "FL_content": " \n a,b,c,d=list(input())\n s=\"+-\"\n \n for i in range(2):\n for j in range(2):\n for k in range(2):\n if eval(a+s[i]+b+s[j]+c+s[k]+d)==7:\n- print(eval(a+s[i]+b+s[j]+c+s[k]+d))\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u962309487", "problem_id": "p03545", "submission1_id": "s953466940", "submission2_id": "s294367658", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c,d = list(input())\nsign = '+-'\nfor i in range(2):\n for j in range(2):\n for k in range(2):\n if eval(a+sign[i]+b+sign[j]+c+sign[k]+d) == 7:\n print(a+sign[i]+b+sign[j]+c+sign[k]+d + '==7')", "code2": "a,b,c,d = list(input())\nsign = '+-'\nfor i in range(2):\n for j in range(2):\n for k in range(2):\n if eval(a+sign[i]+b+sign[j]+c+sign[k]+d) == 7:\n print(str(a+sign[i]+b+sign[j]+c+sign[k]+d) + '=7')\n exit()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583947864", "date2": "1583948235", "bleu_score": "0.8731429745770463", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 99, "input": "3611\n", "actual_output": "3+6-1-1==7\n", "expected_output": "3+6-1-1=7\n\n", "anno_code": ["a,b,c,d = list(input()) # (0): a=3, b=6, c=1, d=1 (6): NO CHANGE ... (36): NO CHANGE\nsign = '+-' # (1): sign=+-\nfor i in range(2): # (2): i=0 (21): i=1\n for j in range(2): # (3): j=0 (11): j=1 ... (38): NO CHANGE\n for k in range(2): # (4): k=0 (7): k=1 ... (37): NO CHANGE\n if eval(a+sign[i]+b+sign[j]+c+sign[k]+d) == 7: # (5): NO CHANGE (8): NO CHANGE ... (35): NO CHANGE\n print(a+sign[i]+b+sign[j]+c+sign[k]+d + '==7') # (18): NO CHANGE\n"], "anno_status": [true], "diff_content": " a,b,c,d = list(input())\n sign = '+-'\n for i in range(2):\n for j in range(2):\n for k in range(2):\n if eval(a+sign[i]+b+sign[j]+c+sign[k]+d) == 7:\n- print(a+sign[i]+b+sign[j]+c+sign[k]+d + '==7')\n+ print(str(a+sign[i]+b+sign[j]+c+sign[k]+d) + '=7')\n+ exit()\n+\n", "FL_content": " a,b,c,d = list(input())\n sign = '+-'\n for i in range(2):\n for j in range(2):\n for k in range(2):\n if eval(a+sign[i]+b+sign[j]+c+sign[k]+d) == 7:\n- print(a+sign[i]+b+sign[j]+c+sign[k]+d + '==7')\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u101350975", "problem_id": "p03545", "submission1_id": "s174705513", "submission2_id": "s964339503", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\nl = list(stdin.readline().rstrip())\ns = [int(i) for i in l]\ndef dfs(i, f, sum):\n if i == 3:\n if sum == 7:\n print(f)\n exit()\n else:\n dfs(i+1, f + '+' + str(s[i]), sum + s[i])\n dfs(i+1, f + '-' + str(s[i]), sum - s[i])\ndfs(0, str(s[0]), s[0])\n", "code2": "from sys import stdin\nl = list(stdin.readline().rstrip())\ns = [int(i) for i in l]\ndef dfs(i, f, sum):\n if i == 3:\n if sum == 7:\n print(f + '=7')\n exit()\n else:\n dfs(i+1, f + '+' + str(s[i+1]), sum + s[i+1])\n dfs(i+1, f + '-' + str(s[i+1]), sum - s[i+1])\ndfs(0, str(s[0]), s[0])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591899047", "date2": "1591899566", "bleu_score": "0.9306528688079402", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 99, "input": "2533\n", "actual_output": "no output\n", "expected_output": "2+5+3-3=7\n\n", "anno_code": ["from sys import stdin\nl = list(stdin.readline().rstrip()) # (0): l=['2', '5', '3', '3']\ns = [int(i) for i in l] # (1): s=[2, 5, 3, 3]\ndef dfs(i, f, sum): # (2): dfs=\n if i == 3: # (4): NO CHANGE (6): NO CHANGE ... (39): NO CHANGE\n if sum == 7: # (11): i=2, f=2+2+5, sum=9 (14): i=1, f=2+2, sum=4 ... (37): i=2, f=2-2-5, sum=-5\n print(f)\n exit()\n else:\n dfs(i+1, f + '+' + str(s[i]), sum + s[i]) # (5): i=1, f=2+2, sum=4 (7): i=2, f=2+2+5, sum=9 ... (35): i=3, f=2-2-5+3, sum=-2\n dfs(i+1, f + '-' + str(s[i]), sum - s[i]) # (12): i=3, f=2+2+5-3, sum=6 (15): i=2, f=2+2-5, sum=-1 ... (38): i=3, f=2-2-5-3, sum=-8\ndfs(0, str(s[0]), s[0]) # (3): i=0, f=2, sum=2\n"], "anno_status": [true], "diff_content": " from sys import stdin\n l = list(stdin.readline().rstrip())\n s = [int(i) for i in l]\n def dfs(i, f, sum):\n if i == 3:\n if sum == 7:\n- print(f)\n+ print(f + '=7')\n exit()\n else:\n- dfs(i+1, f + '+' + str(s[i]), sum + s[i])\n- dfs(i+1, f + '-' + str(s[i]), sum - s[i])\n+ dfs(i+1, f + '+' + str(s[i+1]), sum + s[i+1])\n+ dfs(i+1, f + '-' + str(s[i+1]), sum - s[i+1])\n dfs(0, str(s[0]), s[0])\n \n", "FL_content": " from sys import stdin\n l = list(stdin.readline().rstrip())\n s = [int(i) for i in l]\n def dfs(i, f, sum):\n if i == 3:\n if sum == 7:\n- print(f)\n exit()\n else:\n- dfs(i+1, f + '+' + str(s[i]), sum + s[i])\n- dfs(i+1, f + '-' + str(s[i]), sum - s[i])\n dfs(0, str(s[0]), s[0])\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 13 }, { "user_id": "u642529859", "problem_id": "p02595", "submission1_id": "s528770544", "submission2_id": "s182220122", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, D = map(int, input().split())\nans = 0\nfor i in range(N):\n X, Y = map(int, input().split())\n if X*X+Y*Y<=D:\n ans += 1\nprint(ans)", "code2": "N, D = map(int, input().split())\nans = 0\nfor i in range(N):\n X, Y = map(int, input().split())\n if X*X+Y*Y<=D*D:\n ans += 1\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596916943", "date2": "1596917122", "bleu_score": "0.9796353585885051", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 40, "total_score": 103, "input": "4 5\n0 5\n-2 4\n3 4\n4 -2\n", "actual_output": "0\n", "expected_output": "4\n\n", "anno_code": ["N, D = map(int, input().split()) # (0): N=4, D=5\nans = 0 # (1): ans=0\nfor i in range(N): # (2): i=0 (5): i=1 ... (14): NO CHANGE\n X, Y = map(int, input().split()) # (3): X=0, Y=5 (6): X=-2, Y=4 ... (12): X=4, Y=-2\n if X*X+Y*Y<=D: # (4): NO CHANGE (7): NO CHANGE ... (13): NO CHANGE\n ans += 1\nprint(ans)"], "anno_status": [true], "diff_content": " N, D = map(int, input().split())\n ans = 0\n for i in range(N):\n X, Y = map(int, input().split())\n- if X*X+Y*Y<=D:\n+ if X*X+Y*Y<=D*D:\n ans += 1\n print(ans)\n", "FL_content": " N, D = map(int, input().split())\n ans = 0\n for i in range(N):\n X, Y = map(int, input().split())\n- if X*X+Y*Y<=D:\n ans += 1\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u080685822", "problem_id": "p02595", "submission1_id": "s096302527", "submission2_id": "s699463047", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nn, d = map(int, input().split())\nt = 0\nfor i in range(0,n-1):\n alis = list(map(int, input().split()))\n sss = math.sqrt(alis[0] ** 2 + alis[1] ** 2)\n if d >= sss:\n t += 1\n \nprint(t)\n", "code2": "import math\nn, d = map(int, input().split())\nt = 0\nfor i in range(0,n):\n alis = list(map(int, input().split()))\n sss = math.sqrt(alis[0] ** 2 + alis[1] ** 2)\n if d >= sss:\n t += 1\n \nprint(t)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596420483", "date2": "1596420575", "bleu_score": "0.9825206341379196", "code1_test_status": [1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 88, "total_score": 103, "input": "4 5\n0 5\n-2 4\n3 4\n4 -2\n", "actual_output": "3\n", "expected_output": "4\n\n", "anno_code": ["import math\nn, d = map(int, input().split()) # (0): n=4, d=5\nt = 0 # (1): t=0\nfor i in range(0,n-1): # (2): i=0 (7): i=1 ... (17): NO CHANGE\n alis = list(map(int, input().split())) # (3): alis=[0, 5] (8): alis=[-2, 4] (13): alis=[3, 4]\n sss = math.sqrt(alis[0] ** 2 + alis[1] ** 2) # (4): sss=5.0 (9): sss=4.472136 (14): sss=5.0\n if d >= sss: # (5): NO CHANGE (10): NO CHANGE (15): NO CHANGE\n t += 1 # (6): t=1 (11): t=2 (16): t=3\n \nprint(t)\n"], "anno_status": [true], "diff_content": " import math\n n, d = map(int, input().split())\n t = 0\n-for i in range(0,n-1):\n+for i in range(0,n):\n alis = list(map(int, input().split()))\n sss = math.sqrt(alis[0] ** 2 + alis[1] ** 2)\n if d >= sss:\n t += 1\n \n print(t)\n \n", "FL_content": " import math\n n, d = map(int, input().split())\n t = 0\n-for i in range(0,n-1):\n alis = list(map(int, input().split()))\n sss = math.sqrt(alis[0] ** 2 + alis[1] ** 2)\n if d >= sss:\n t += 1\n \n print(t)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u247457760", "problem_id": "p02595", "submission1_id": "s969982157", "submission2_id": "s062030964", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nn, d = map(int, input().split())\n\ncount = 0\n\nfor i in range(n):\n x, y = map(int, input().split())\n if math.sqrt((x)**2 + (y)**2) <= d:\n count += 1\n else:\n break\n\nprint(count)", "code2": "import math\n\nn, d = map(int, input().split())\n\ncount = 0\n\nfor i in range(n):\n x, y = map(int, input().split())\n if math.sqrt((x)**2 + (y)**2) <= d:\n count += 1\n\nprint(count)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596417535", "date2": "1596417647", "bleu_score": "0.8999449396997149", "code1_test_status": [0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0], "code1_test_score": 54, "total_score": 103, "input": "12 3\n0 1\n1 1\n1 1\n1 2\n0 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n3 3\n", "actual_output": "5\n", "expected_output": "7\n\n", "anno_code": ["import math\n\nn, d = map(int, input().split()) # (0): n=12, d=3\n\ncount = 0 # (1): count=0\n\nfor i in range(n): # (2): i=0 (6): i=1 ... (22): i=5\n x, y = map(int, input().split()) # (3): x=0, y=1 (7): x=1 ... (23): x=1, y=3\n if math.sqrt((x)**2 + (y)**2) <= d: # (4): NO CHANGE (8): NO CHANGE ... (24): NO CHANGE\n count += 1 # (5): count=1 (9): count=2 ... (21): count=5\n else:\n break # (25): NO CHANGE\n\nprint(count)"], "anno_status": [true], "diff_content": " import math\n \n n, d = map(int, input().split())\n \n count = 0\n \n for i in range(n):\n x, y = map(int, input().split())\n if math.sqrt((x)**2 + (y)**2) <= d:\n count += 1\n- else:\n- break\n \n print(count)\n", "FL_content": " import math\n \n n, d = map(int, input().split())\n \n count = 0\n \n for i in range(n):\n x, y = map(int, input().split())\n if math.sqrt((x)**2 + (y)**2) <= d:\n count += 1\n- else:\n- break\n \n print(count)\n", "added_lines": 0, "removed_lines": 2, "code1_lines": 14 }, { "user_id": "u924828749", "problem_id": "p02595", "submission1_id": "s592006503", "submission2_id": "s629865346", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,d = [int(x) for x in input().split()]\nx = []\ny = []\nfor i in range(n):\n x1,y1 = [int(x) for x in input().split()]\n x.append(x1)\n y.append(y1)\nc = 0\nfor i in range(n):\n s = x[i] ** 2 + y[i] ** 2\n if s < d ** 2:\n c += 1\nprint(c)", "code2": "n,d = [int(x) for x in input().split()]\nx = []\ny = []\nfor i in range(n):\n x1,y1 = [int(x) for x in input().split()]\n x.append(x1)\n y.append(y1)\nc = 0\nfor i in range(n):\n s = x[i] ** 2 + y[i] ** 2\n if s <= d ** 2:\n c += 1\nprint(c)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599343286", "date2": "1599343323", "bleu_score": "0.989349874818781", "code1_test_status": [1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1], "code1_test_score": 72, "total_score": 103, "input": "12 2\n0 1\n2 1\n1 1\n1 2\n0 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n7 3\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["n,d = [int(x) for x in input().split()] # (0): n=12, d=2\nx = [] # (1): x=[]\ny = [] # (2): y=[]\nfor i in range(n): # (3): i=0 (7): i=1 ... (51): NO CHANGE\n x1,y1 = [int(x) for x in input().split()] # (4): x1=0, y1=1 (8): x1=2 ... (48): x1=7, y1=3\n x.append(x1) # (5): x=[0] (9): x=[0, 2] ... (49): x=[0, 2, 1, 1, 0, 1, 2, 2, 2, 3, 3, 7]\n y.append(y1) # (6): y=[1] (10): y=[1, 1] ... (50): y=[1, 1, 1, 2, 2, 3, 1, 2, 3, 1, 2, 3]\nc = 0 # (52): c=0\nfor i in range(n): # (53): i=0 (57): i=1 ... (91): NO CHANGE\n s = x[i] ** 2 + y[i] ** 2 # (54): s=1 (58): s=5 ... (89): s=58\n if s < d ** 2: # (55): NO CHANGE (59): NO CHANGE ... (90): NO CHANGE\n c += 1 # (56): c=1 (63): c=2\nprint(c)"], "anno_status": [true], "diff_content": " n,d = [int(x) for x in input().split()]\n x = []\n y = []\n for i in range(n):\n x1,y1 = [int(x) for x in input().split()]\n x.append(x1)\n y.append(y1)\n c = 0\n for i in range(n):\n s = x[i] ** 2 + y[i] ** 2\n- if s < d ** 2:\n+ if s <= d ** 2:\n c += 1\n print(c)\n", "FL_content": " n,d = [int(x) for x in input().split()]\n x = []\n y = []\n for i in range(n):\n x1,y1 = [int(x) for x in input().split()]\n x.append(x1)\n y.append(y1)\n c = 0\n for i in range(n):\n s = x[i] ** 2 + y[i] ** 2\n- if s < d ** 2:\n c += 1\n print(c)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u860702592", "problem_id": "p02595", "submission1_id": "s521229763", "submission2_id": "s951115219", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,d = map(int,input().split())\ncount = 0\nfor _ in range(n):\n x, y = map(int,input().split())\n if (x**2 + y**2)**(0.5) >= d:\n count += 1\n\nprint(count)", "code2": "n,d = map(int,input().split())\ncount = 0\nfor _ in range(n):\n x, y = map(int,input().split())\n if (x**2 + y**2)**(0.5) <= d:\n count += 1\n\nprint(count)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596657081", "date2": "1596657226", "bleu_score": "0.9843489635453336", "code1_test_status": [0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0], "code1_test_score": 12, "total_score": 103, "input": "12 2\n0 1\n2 2\n1 1\n1 2\n0 2\n0 4\n2 1\n2 0\n2 0\n3 1\n3 2\n1 3\n", "actual_output": "10\n", "expected_output": "5\n\n", "anno_code": ["n,d = map(int,input().split()) # (0): n=12, d=2\ncount = 0 # (1): count=0\nfor _ in range(n): # (2): _=0 (5): _=1 ... (48): NO CHANGE\n x, y = map(int,input().split()) # (3): x=0, y=1 (6): x=2, y=2 ... (45): x=1, y=3\n if (x**2 + y**2)**(0.5) >= d: # (4): NO CHANGE (7): NO CHANGE ... (46): NO CHANGE\n count += 1 # (8): count=1 (15): count=2 ... (47): count=10\n\nprint(count)"], "anno_status": [true], "diff_content": " n,d = map(int,input().split())\n count = 0\n for _ in range(n):\n x, y = map(int,input().split())\n- if (x**2 + y**2)**(0.5) >= d:\n+ if (x**2 + y**2)**(0.5) <= d:\n count += 1\n \n print(count)\n", "FL_content": " n,d = map(int,input().split())\n count = 0\n for _ in range(n):\n x, y = map(int,input().split())\n- if (x**2 + y**2)**(0.5) >= d:\n count += 1\n \n print(count)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u813033918", "problem_id": "p02595", "submission1_id": "s336196669", "submission2_id": "s270922080", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nN,D = map(int,input().split())\ncnt = 0\nfor n in range(N):\n a,b = map(int,input().split())\n if math.sqrt(a**2 + b**2)-D>=0:\n cnt+=1\nprint(cnt)", "code2": "import math\n\nN,D = map(int,input().split())\ncnt = 0\nfor n in range(N):\n a,b = map(int,input().split())\n if math.sqrt(a**2 + b**2)-D<=0:\n cnt+=1\nprint(cnt)\n\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597074578", "date2": "1597074758", "bleu_score": "0.9730644290195725", "code1_test_status": [0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0], "code1_test_score": 12, "total_score": 103, "input": "4 5\n0 5\n-2 4\n5 4\n4 -2\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["import math\n\nN,D = map(int,input().split()) # (0): N=4, D=5\ncnt = 0 # (1): cnt=0\nfor n in range(N): # (2): n=0 (6): n=1 ... (16): NO CHANGE\n a,b = map(int,input().split()) # (3): a=0, b=5 (7): a=-2, b=4 ... (14): a=4, b=-2\n if math.sqrt(a**2 + b**2)-D>=0: # (4): NO CHANGE (8): NO CHANGE ... (15): NO CHANGE\n cnt+=1 # (5): cnt=1 (12): cnt=2\nprint(cnt)"], "anno_status": [true], "diff_content": " import math\n \n N,D = map(int,input().split())\n cnt = 0\n for n in range(N):\n a,b = map(int,input().split())\n- if math.sqrt(a**2 + b**2)-D>=0:\n+ if math.sqrt(a**2 + b**2)-D<=0:\n cnt+=1\n print(cnt)\n+\n+\n", "FL_content": " import math\n \n N,D = map(int,input().split())\n cnt = 0\n for n in range(N):\n a,b = map(int,input().split())\n- if math.sqrt(a**2 + b**2)-D>=0:\n cnt+=1\n print(cnt)\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u202641516", "problem_id": "p02595", "submission1_id": "s344894285", "submission2_id": "s386684431", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y=map(int,input().split())\n\nres=0\n\nfor n in range(x):\n a,b=map(int,input().split())\n d=(a*a +b*b)**.5\n if d>=y:res+=1\n\nprint(res)", "code2": "x,y=map(int,input().split())\n\nres=0\n\nfor n in range(x):\n a,b=map(int,input().split())\n d=(a*a +b*b)**.5\n if d<=y:res+=1\n\nprint(res)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596416635", "date2": "1596416664", "bleu_score": "0.9818487054407757", "code1_test_status": [0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0], "code1_test_score": 12, "total_score": 103, "input": "12 3\n1 1\n1 1\n1 1\n1 1\n1 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n3 3\n", "actual_output": "5\n", "expected_output": "7\n", "anno_code": ["x,y=map(int,input().split()) # (0): x=12, y=3\n\nres=0 # (1): res=0\n\nfor n in range(x): # (2): n=0 (6): n=1 ... (50): NO CHANGE\n a,b=map(int,input().split()) # (3): a=1, b=1 (7): NO CHANGE ... (47): b=3\n d=(a*a +b*b)**.5 # (4): d=1.414214 (8): NO CHANGE ... (48): d=4.242641\n if d>=y:res+=1 # (5): NO CHANGE (9): NO CHANGE ... (49): res=5\n\nprint(res)"], "anno_status": [true], "diff_content": " x,y=map(int,input().split())\n \n res=0\n \n for n in range(x):\n a,b=map(int,input().split())\n d=(a*a +b*b)**.5\n- if d>=y:res+=1\n+ if d<=y:res+=1\n \n print(res)\n", "FL_content": " x,y=map(int,input().split())\n \n res=0\n \n for n in range(x):\n a,b=map(int,input().split())\n d=(a*a +b*b)**.5\n- if d>=y:res+=1\n \n print(res)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u581477875", "problem_id": "p02595", "submission1_id": "s266606931", "submission2_id": "s875739462", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, d = map(int, input().split())\nans = 0\nfor i in range(n):\n x, y = map(int, input().split())\n if x * x + y * y < d * d:\n ans += 1\nprint(ans)", "code2": "n, d = map(int, input().split())\nans = 0\nfor i in range(n):\n x, y = map(int, input().split())\n if x * x + y * y <= d * d:\n ans += 1\nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597808264", "date2": "1597808308", "bleu_score": "0.983631575077218", "code1_test_status": [1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1], "code1_test_score": 72, "total_score": 103, "input": "12 4\n0 1\n2 2\n1 1\n1 2\n0 2\n0 4\n2 1\n2 0\n2 0\n3 1\n3 2\n1 3\n", "actual_output": "11\n", "expected_output": "12\n\n", "anno_code": ["n, d = map(int, input().split()) # (0): n=12, d=4\nans = 0 # (1): ans=0\nfor i in range(n): # (2): i=0 (6): i=1 ... (49): NO CHANGE\n x, y = map(int, input().split()) # (3): x=0, y=1 (7): x=2, y=2 ... (46): x=1, y=3\n if x * x + y * y < d * d: # (4): NO CHANGE (8): NO CHANGE ... (47): NO CHANGE\n ans += 1 # (5): ans=1 (9): ans=2 ... (48): ans=11\nprint(ans)"], "anno_status": [true], "diff_content": " n, d = map(int, input().split())\n ans = 0\n for i in range(n):\n x, y = map(int, input().split())\n- if x * x + y * y < d * d:\n+ if x * x + y * y <= d * d:\n ans += 1\n print(ans)\n", "FL_content": " n, d = map(int, input().split())\n ans = 0\n for i in range(n):\n x, y = map(int, input().split())\n- if x * x + y * y < d * d:\n ans += 1\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u256901785", "problem_id": "p02595", "submission1_id": "s021670748", "submission2_id": "s139275102", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nn,d = map(int,input().split(' '))\nx,y = [0]*n,[0]*n\nfor i in range(n):\n x[i],y[i] = map(int,input().split(' '))\n \nans = 0 \n \nfor i in range(n):\n distane = math.sqrt(x[i]*x[i] + y[i]*y[i])\n if distane >= d:\n ans += 1\nprint(ans)", "code2": "import math\n\nn,d = map(int,input().split(' '))\nx,y = [0]*n,[0]*n\nfor i in range(n):\n x[i],y[i] = map(int,input().split(' '))\n \nans = 0 \n \nfor i in range(n):\n distane = math.sqrt(x[i]*x[i] + y[i]*y[i])\n if distane <= d:\n ans += 1\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597502713", "date2": "1597502957", "bleu_score": "0.989908759189579", "code1_test_status": [0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0], "code1_test_score": 12, "total_score": 103, "input": "12 2\n0 1\n2 2\n1 1\n1 2\n0 2\n0 3\n2 1\n2 2\n2 3\n3 1\n3 2\n10 3\n", "actual_output": "10\n", "expected_output": "3\n\n", "anno_code": ["import math\n\nn,d = map(int,input().split(' ')) # (0): n=12, d=2\nx,y = [0]*n,[0]*n # (1): x=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], y=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(n): # (2): i=0 (4): i=1 ... (26): NO CHANGE\n x[i],y[i] = map(int,input().split(' ')) # (3): y=[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (5): x=[0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], y=[1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (25): x=[0, 2, 1, 1, 0, 0, 2, 2, 2, 3, 3, 10], y=[1, 2, 1, 2, 2, 3, 1, 2, 3, 1, 2, 3]\n \nans = 0 # (27): ans=0\n \nfor i in range(n): # (28): i=0 (31): i=1 ... (74): NO CHANGE\n distane = math.sqrt(x[i]*x[i] + y[i]*y[i]) # (29): distane=1.0 (32): distane=2.828427 ... (71): distane=10.440307\n if distane >= d: # (30): NO CHANGE (33): NO CHANGE ... (72): NO CHANGE\n ans += 1 # (34): ans=1 (41): ans=2 ... (73): ans=10\nprint(ans)"], "anno_status": [true], "diff_content": " import math\n \n n,d = map(int,input().split(' '))\n x,y = [0]*n,[0]*n\n for i in range(n):\n x[i],y[i] = map(int,input().split(' '))\n \n ans = 0 \n \n for i in range(n):\n distane = math.sqrt(x[i]*x[i] + y[i]*y[i])\n- if distane >= d:\n+ if distane <= d:\n ans += 1\n print(ans)\n", "FL_content": " import math\n \n n,d = map(int,input().split(' '))\n x,y = [0]*n,[0]*n\n for i in range(n):\n x[i],y[i] = map(int,input().split(' '))\n \n ans = 0 \n \n for i in range(n):\n distane = math.sqrt(x[i]*x[i] + y[i]*y[i])\n- if distane >= d:\n ans += 1\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 14 }, { "user_id": "u923464546", "problem_id": "p02595", "submission1_id": "s146612740", "submission2_id": "s561120206", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import sqrt\nn,d = map(int,input().strip().split())\ncnt = 0\nfor i in range(n):\n\tx,y = map(int,input().strip().split())\n\tif sqrt(x*x+y*y) >= d:\n\t\tcnt+=1\nprint(cnt)", "code2": "from math import sqrt\nn,d = map(int,input().strip().split())\ncnt = 0\nfor i in range(n):\n\tx,y = map(int,input().strip().split())\n\t\n\tif x*x+y*y <= d*d:\n\t\t\n\t\tcnt+=1\nprint(cnt)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596522731", "date2": "1596523000", "bleu_score": "0.9248074044614499", "code1_test_status": [0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0], "code1_test_score": 12, "total_score": 103, "input": "12 3\n2 1\n1 1\n1 1\n1 2\n0 2\n1 3\n2 1\n2 2\n2 3\n0 1\n3 2\n3 3\n", "actual_output": "4\n", "expected_output": "8\n\n", "anno_code": ["from math import sqrt\nn,d = map(int,input().strip().split()) # (0): n=12, d=3\ncnt = 0 # (1): cnt=0\nfor i in range(n): # (2): i=0 (5): i=1 ... (42): NO CHANGE\n\tx,y = map(int,input().strip().split()) # (3): x=2, y=1 (6): x=1 ... (39): y=3\n\tif sqrt(x*x+y*y) >= d: # (4): NO CHANGE (7): NO CHANGE ... (40): NO CHANGE\n\t\tcnt+=1 # (20): cnt=1 (30): cnt=2 ... (41): cnt=4\nprint(cnt)"], "anno_status": [true], "diff_content": " from math import sqrt\n n,d = map(int,input().strip().split())\n cnt = 0\n for i in range(n):\n \tx,y = map(int,input().strip().split())\n-\tif sqrt(x*x+y*y) >= d:\n+\t\n+\tif x*x+y*y <= d*d:\n+\t\t\n \t\tcnt+=1\n print(cnt)\n", "FL_content": " from math import sqrt\n n,d = map(int,input().strip().split())\n cnt = 0\n for i in range(n):\n \tx,y = map(int,input().strip().split())\n-\tif sqrt(x*x+y*y) >= d:\n \t\tcnt+=1\n print(cnt)\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u538808095", "problem_id": "p02909", "submission1_id": "s557431181", "submission2_id": "s942213055", "status1": "Wrong Answer", "status2": "Accepted", "code1": "weatherlist = [\"Sunny\", \"Cloudy\", \"Rainy\"]\n\nweather = input().rstrip()\nweathernum = weatherlist.index(weather)\n\ntomorrownum = weathernum % 3\n\nprint(weatherlist[tomorrownum])", "code2": "weatherlist = [\"Sunny\", \"Cloudy\", \"Rainy\"]\n \nweather = input().rstrip()\nweathernum = weatherlist.index(weather)\n \ntomorrownum = (weathernum +1) % 3\n\nprint(weatherlist[tomorrownum])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568596136", "date2": "1568597355", "bleu_score": "0.9309229644941145", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "Rainy\n", "actual_output": "Rainy\n", "expected_output": "Sunny\n", "anno_code": ["weatherlist = [\"Sunny\", \"Cloudy\", \"Rainy\"] # (0): weatherlist=['Sunny', 'Cloudy', 'Rainy']\n\nweather = input().rstrip() # (1): weather=Rainy\nweathernum = weatherlist.index(weather) # (2): weathernum=2\n\ntomorrownum = weathernum % 3 # (3): tomorrownum=2\n\nprint(weatherlist[tomorrownum])"], "anno_status": [true], "diff_content": " weatherlist = [\"Sunny\", \"Cloudy\", \"Rainy\"]\n-\n+ \n weather = input().rstrip()\n weathernum = weatherlist.index(weather)\n-\n-tomorrownum = weathernum % 3\n+ \n+tomorrownum = (weathernum +1) % 3\n \n print(weatherlist[tomorrownum])\n", "FL_content": " weatherlist = [\"Sunny\", \"Cloudy\", \"Rainy\"]\n-\n weather = input().rstrip()\n weathernum = weatherlist.index(weather)\n-\n-tomorrownum = weathernum % 3\n \n print(weatherlist[tomorrownum])\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u821969418", "problem_id": "p02909", "submission1_id": "s391006791", "submission2_id": "s162461267", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import random\n\nw = input()\n\nf = random.randint(0, 2)\n\nif f == 0:\n print(\"Sunny\")\nelif f == 1:\n print(\"Cloudy\")\nelif f == 2:\n print(\"Rainy\")", "code2": "import random\n\nw = input()\n\nif w == \"Sunny\":\n print(\"Cloudy\")\nelif w == \"Cloudy\":\n print(\"Rainy\")\nelif w == \"Rainy\":\n print(\"Sunny\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568595761", "date2": "1568595896", "bleu_score": "0.7299353821375921", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "Sunny\n", "actual_output": "Rainy\n", "expected_output": "Cloudy\n", "anno_code": ["import random\n\nw = input() # (0): w=Sunny\n\nf = random.randint(0, 2) # (1): f=2\n\nif f == 0: # (2): NO CHANGE\n print(\"Sunny\")\nelif f == 1: # (3): NO CHANGE\n print(\"Cloudy\")\nelif f == 2: # (4): NO CHANGE\n print(\"Rainy\")"], "anno_status": [true], "diff_content": " import random\n \n w = input()\n \n-f = random.randint(0, 2)\n-\n-if f == 0:\n- print(\"Sunny\")\n-elif f == 1:\n+if w == \"Sunny\":\n print(\"Cloudy\")\n-elif f == 2:\n+elif w == \"Cloudy\":\n print(\"Rainy\")\n+elif w == \"Rainy\":\n+ print(\"Sunny\")\n", "FL_content": " import random\n \n w = input()\n \n-f = random.randint(0, 2)\n-\n-if f == 0:\n- print(\"Sunny\")\n-elif f == 1:\n print(\"Cloudy\")\n-elif f == 2:\n print(\"Rainy\")\n", "added_lines": 4, "removed_lines": 6, "code1_lines": 12 }, { "user_id": "u888380104", "problem_id": "p02909", "submission1_id": "s750264236", "submission2_id": "s262709594", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\n\nif S == 'Sunny':\n print('cloudy')\n\nelif S == 'cloudy':\n print('Rainy')\n\nelif S == 'Rainy':\n print('Sunny')\n ", "code2": "S = input()\n\nif S == 'Sunny':\n print('Cloudy')\n\nelif S == 'Cloudy':\n print('Rainy')\n\nelif S =='Rainy':\n print('Sunny')\n\n\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598577922", "date2": "1598578842", "bleu_score": "0.9119487658885977", "code1_test_status": [1, 0], "code1_test_score": 1, "total_score": 2, "input": "Sunny\n", "actual_output": "cloudy\n", "expected_output": "Cloudy\n", "anno_code": ["S = input() # (0): S=Sunny\n\nif S == 'Sunny': # (1): NO CHANGE\n print('cloudy')\n\nelif S == 'cloudy':\n print('Rainy')\n\nelif S == 'Rainy':\n print('Sunny')\n "], "anno_status": [true], "diff_content": " S = input()\n \n if S == 'Sunny':\n- print('cloudy')\n+ print('Cloudy')\n \n-elif S == 'cloudy':\n+elif S == 'Cloudy':\n print('Rainy')\n \n-elif S == 'Rainy':\n+elif S =='Rainy':\n print('Sunny')\n- \n+\n+\n+\n", "FL_content": " S = input()\n \n if S == 'Sunny':\n- print('cloudy')\n \n-elif S == 'cloudy':\n print('Rainy')\n \n-elif S == 'Rainy':\n print('Sunny')\n- \n", "added_lines": 6, "removed_lines": 4, "code1_lines": 11 }, { "user_id": "u609814378", "problem_id": "p02909", "submission1_id": "s163457373", "submission2_id": "s422323015", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\nif s == \"Suuny\":\n print(\"Cloudy\")\nelif s == \"Cloudy\":\n print(\"Sunny\")\nelif s==(\"Rainy\"):\n print(\"Suuny\")", "code2": "s = input()\n \nif s == 'Sunny':\n print('Cloudy')\nif s == 'Cloudy':\n print('Rainy')\nif s == 'Rainy':\n print('Sunny')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573854532", "date2": "1573854998", "bleu_score": "0.6198837798622997", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "Sunny\n", "actual_output": "no output\n", "expected_output": "Cloudy\n", "anno_code": ["s = input() # (0): s=Sunny\n\nif s == \"Suuny\": # (1): NO CHANGE\n print(\"Cloudy\")\nelif s == \"Cloudy\": # (2): NO CHANGE\n print(\"Sunny\")\nelif s==(\"Rainy\"):\n print(\"Suuny\")"], "anno_status": [true], "diff_content": " s = input()\n-\n-if s == \"Suuny\":\n- print(\"Cloudy\")\n-elif s == \"Cloudy\":\n- print(\"Sunny\")\n-elif s==(\"Rainy\"):\n- print(\"Suuny\")\n+ \n+if s == 'Sunny':\n+ print('Cloudy')\n+if s == 'Cloudy':\n+ print('Rainy')\n+if s == 'Rainy':\n+ print('Sunny')\n", "FL_content": " s = input()\n-\n-if s == \"Suuny\":\n- print(\"Cloudy\")\n-elif s == \"Cloudy\":\n- print(\"Sunny\")\n-elif s==(\"Rainy\"):\n- print(\"Suuny\")\n", "added_lines": 7, "removed_lines": 7, "code1_lines": 8 }, { "user_id": "u476562059", "problem_id": "p02909", "submission1_id": "s547597908", "submission2_id": "s746840402", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nif(s == \"Sunny\"):\n print(\"Cloudy\")\n\nelif(s == \"Cloudy\"):\n print(\"Rainy\")\n\nelse:\n print(\"Suuny\")", "code2": "s = input()\nif(s == \"Sunny\"):\n print(\"Cloudy\")\n\nelif(s == \"Cloudy\"):\n print(\"Rainy\")\n\nelse:\n print(\"Sunny\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568745007", "date2": "1568745031", "bleu_score": "0.9801741867115217", "code1_test_status": [0, 1], "code1_test_score": 1, "total_score": 2, "input": "Rainy\n", "actual_output": "Suuny\n", "expected_output": "Sunny\n", "anno_code": ["s = input() # (0): s=Rainy\nif(s == \"Sunny\"): # (1): NO CHANGE\n print(\"Cloudy\")\n\nelif(s == \"Cloudy\"): # (2): NO CHANGE\n print(\"Rainy\")\n\nelse:\n print(\"Suuny\")"], "anno_status": [true], "diff_content": " s = input()\n if(s == \"Sunny\"):\n print(\"Cloudy\")\n \n elif(s == \"Cloudy\"):\n print(\"Rainy\")\n \n else:\n- print(\"Suuny\")\n+ print(\"Sunny\")\n", "FL_content": " s = input()\n if(s == \"Sunny\"):\n print(\"Cloudy\")\n \n elif(s == \"Cloudy\"):\n print(\"Rainy\")\n \n else:\n- print(\"Suuny\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u023141436", "problem_id": "p02909", "submission1_id": "s475511386", "submission2_id": "s673525808", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\nif s == \"Sunny\":\n\tprint(\"Cloudy\")\nelif s == \"Cloudy\":\n\tprint(\"Rainy\")\nelif s == \"Rainy\":\n\tprint(\"Rainy\")", "code2": "s = input()\n\nif s == \"Sunny\":\n\tprint(\"Cloudy\")\nelif s == \"Cloudy\":\n\tprint(\"Rainy\")\nelif s == \"Rainy\":\n\tprint(\"Sunny\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568595709", "date2": "1568595977", "bleu_score": "0.9608889364388631", "code1_test_status": [0, 1], "code1_test_score": 1, "total_score": 2, "input": "Rainy\n", "actual_output": "Rainy\n", "expected_output": "Sunny\n", "anno_code": ["s = input() # (0): s=Rainy\n\nif s == \"Sunny\": # (1): NO CHANGE\n\tprint(\"Cloudy\")\nelif s == \"Cloudy\": # (2): NO CHANGE\n\tprint(\"Rainy\")\nelif s == \"Rainy\": # (3): NO CHANGE\n\tprint(\"Rainy\")"], "anno_status": [true], "diff_content": " s = input()\n \n if s == \"Sunny\":\n \tprint(\"Cloudy\")\n elif s == \"Cloudy\":\n \tprint(\"Rainy\")\n elif s == \"Rainy\":\n-\tprint(\"Rainy\")\n+\tprint(\"Sunny\")\n", "FL_content": " s = input()\n \n if s == \"Sunny\":\n \tprint(\"Cloudy\")\n elif s == \"Cloudy\":\n \tprint(\"Rainy\")\n elif s == \"Rainy\":\n-\tprint(\"Rainy\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u485673106", "problem_id": "p02909", "submission1_id": "s843612829", "submission2_id": "s670420787", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nif S == \"Sunny\":\n\tprint(\"Cloudy\")\nelif S == \"Cloudy\":\n\tprint(\"Rainy\")\nelse:\n\tprint(\"Rainy\")", "code2": "S = input()\nif S == \"Sunny\":\n\tprint(\"Cloudy\")\nelif S == \"Cloudy\":\n\tprint(\"Rainy\")\nelse:\n\tprint(\"Sunny\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568762424", "date2": "1568762489", "bleu_score": "0.9554689933959511", "code1_test_status": [0, 1], "code1_test_score": 1, "total_score": 2, "input": "Rainy\n", "actual_output": "Rainy\n", "expected_output": "Sunny\n", "anno_code": ["S = input() # (0): S=Rainy\nif S == \"Sunny\": # (1): NO CHANGE\n\tprint(\"Cloudy\")\nelif S == \"Cloudy\": # (2): NO CHANGE\n\tprint(\"Rainy\")\nelse:\n\tprint(\"Rainy\")"], "anno_status": [true], "diff_content": " S = input()\n if S == \"Sunny\":\n \tprint(\"Cloudy\")\n elif S == \"Cloudy\":\n \tprint(\"Rainy\")\n else:\n-\tprint(\"Rainy\")\n+\tprint(\"Sunny\")\n", "FL_content": " S = input()\n if S == \"Sunny\":\n \tprint(\"Cloudy\")\n elif S == \"Cloudy\":\n \tprint(\"Rainy\")\n else:\n-\tprint(\"Rainy\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u571445182", "problem_id": "p02909", "submission1_id": "s896354228", "submission2_id": "s294125752", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nW = [ \"Sunny\", \"Cloudy\", \"Rainy\" ]\n\nS = input()\n\nif S==W[0]:\n print(S[1])\nelif S==W[1]:\n print(S[2])\nelse:\n print(S[0])\n\n", "code2": "W = [ \"Sunny\", \"Cloudy\", \"Rainy\" ]\n \nS = input()\n \nif S==W[0]:\n print(W[1])\nelif S==W[1]:\n print(W[2])\nelse:\n print(W[0])\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568595978", "date2": "1568596281", "bleu_score": "0.8899706152166207", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "Sunny\n", "actual_output": "u\n", "expected_output": "Cloudy\n", "anno_code": ["\nW = [ \"Sunny\", \"Cloudy\", \"Rainy\" ] # (0): W=['Sunny', 'Cloudy', 'Rainy']\n\nS = input() # (1): S=Sunny\n\nif S==W[0]: # (2): NO CHANGE\n print(S[1])\nelif S==W[1]:\n print(S[2])\nelse:\n print(S[0])\n\n"], "anno_status": [true], "diff_content": "-\n W = [ \"Sunny\", \"Cloudy\", \"Rainy\" ]\n-\n+ \n S = input()\n-\n+ \n if S==W[0]:\n- print(S[1])\n+ print(W[1])\n elif S==W[1]:\n- print(S[2])\n+ print(W[2])\n else:\n- print(S[0])\n-\n-\n+ print(W[0])\n+ \n", "FL_content": "-\n W = [ \"Sunny\", \"Cloudy\", \"Rainy\" ]\n-\n S = input()\n-\n if S==W[0]:\n- print(S[1])\n elif S==W[1]:\n- print(S[2])\n else:\n- print(S[0])\n-\n-\n", "added_lines": 6, "removed_lines": 8, "code1_lines": 13 }, { "user_id": "u942687220", "problem_id": "p02909", "submission1_id": "s233385372", "submission2_id": "s289732525", "status1": "Wrong Answer", "status2": "Accepted", "code1": "t = input()\npred ={'Sunny':'Cloudy','Cloudy':'Rainy','Rainy':'Cloudy'}\nprint(pred[t])", "code2": "t = input()\npred ={'Sunny':'Cloudy','Cloudy':'Rainy','Rainy':'Sunny'}\nprint(pred[t])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568604047", "date2": "1568604128", "bleu_score": "0.9248514857225908", "code1_test_status": [0, 1], "code1_test_score": 1, "total_score": 2, "input": "Rainy\n", "actual_output": "Cloudy\n", "expected_output": "Sunny\n", "anno_code": ["t = input() # (0): t=Rainy\npred ={'Sunny':'Cloudy','Cloudy':'Rainy','Rainy':'Cloudy'} # (1): pred={'Sunny': 'Cloudy', 'Cloudy': 'Rainy', 'Rainy': 'Cloudy'}\nprint(pred[t])"], "anno_status": [true], "diff_content": " t = input()\n-pred ={'Sunny':'Cloudy','Cloudy':'Rainy','Rainy':'Cloudy'}\n+pred ={'Sunny':'Cloudy','Cloudy':'Rainy','Rainy':'Sunny'}\n print(pred[t])\n", "FL_content": " t = input()\n-pred ={'Sunny':'Cloudy','Cloudy':'Rainy','Rainy':'Cloudy'}\n print(pred[t])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u380174947", "problem_id": "p02909", "submission1_id": "s902970368", "submission2_id": "s532729964", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()[:1]\nif s=='S':\n print('cloudy')\nelif s=='C':\n print('Rainy')\nelse:\n print('Sunny')", "code2": "s=input()[:1]\nif s=='S':\n print('Cloudy')\nelif s=='C':\n print('Rainy')\nelse:\n print('Sunny')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574036768", "date2": "1574036808", "bleu_score": "0.9746768017625027", "code1_test_status": [1, 0], "code1_test_score": 1, "total_score": 2, "input": "Sunny\n", "actual_output": "cloudy\n", "expected_output": "Cloudy\n", "anno_code": ["s=input()[:1] # (0): s=S\nif s=='S': # (1): NO CHANGE\n print('cloudy')\nelif s=='C':\n print('Rainy')\nelse:\n print('Sunny')"], "anno_status": [true], "diff_content": " s=input()[:1]\n if s=='S':\n- print('cloudy')\n+ print('Cloudy')\n elif s=='C':\n print('Rainy')\n else:\n print('Sunny')\n", "FL_content": " s=input()[:1]\n if s=='S':\n- print('cloudy')\n elif s=='C':\n print('Rainy')\n else:\n print('Sunny')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u288430479", "problem_id": "p03944", "submission1_id": "s843681800", "submission2_id": "s565134836", "status1": "Wrong Answer", "status2": "Accepted", "code1": "w,h,n = map(int,input().split())\narea = h*w\na1=0\na2=w\na3=0\na4=h\nfor i in range(n):\n x,y,a = map(int,input().split())\n if a ==1:\n a1 = max(a1,x)\n elif a ==2:\n a2 = min(a2,x)\n elif a ==3:\n a3 = max(a3,y)\n elif a==4:\n a4 = min(a4,y)\n\narea -= a1*h + (w-a2)*h + a3*w + (h-a4)*w \nif area<=0:\n print(0)\nelse:\n print(area-(a1*(a3+(h-a4))+(10-a2)*(a3+(h-a4))))", "code2": "w,h,n = map(int,input().split())\narea = h*w\na1=0\na2=w\na3=0\na4=h\nfor i in range(n):\n x,y,a = map(int,input().split())\n if a ==1:\n a1 = max(a1,x)\n elif a ==2:\n a2 = min(a2,x)\n elif a ==3:\n a3 = max(a3,y)\n elif a==4:\n a4 = min(a4,y)\n\nif a1>=a2 or a3>=a4:\n print(0)\nelse:\n area -= a1*h + (w-a2)*h + a3*w + (h-a4)*w \n \n print(area+(a1*(a3+(h-a4))+(w-a2)*(a3+(h-a4))))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585179012", "date2": "1585191111", "bleu_score": "0.93081737671162", "code1_test_status": [1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0], "code1_test_score": 76, "total_score": 103, "input": "8 4 2\n0 1 3\n6 3 4\n", "actual_output": "12\n", "expected_output": "16\n\n", "anno_code": ["w,h,n = map(int,input().split()) # (0): w=8, h=4, n=2\narea = h*w # (1): area=32\na1=0 # (2): a1=0\na2=w # (3): a2=8\na3=0 # (4): a3=0\na4=h # (5): a4=4\nfor i in range(n): # (6): i=0 (12): i=1 (19): NO CHANGE\n x,y,a = map(int,input().split()) # (7): x=0, y=1, a=3 (13): x=6, y=3, a=4\n if a ==1: # (8): NO CHANGE (14): NO CHANGE\n a1 = max(a1,x)\n elif a ==2: # (9): NO CHANGE (15): NO CHANGE\n a2 = min(a2,x)\n elif a ==3: # (10): NO CHANGE (16): NO CHANGE\n a3 = max(a3,y) # (11): a3=1\n elif a==4: # (17): NO CHANGE\n a4 = min(a4,y) # (18): a4=3\n\narea -= a1*h + (w-a2)*h + a3*w + (h-a4)*w # (20): area=16\nif area<=0: # (21): NO CHANGE\n print(0)\nelse:\n print(area-(a1*(a3+(h-a4))+(10-a2)*(a3+(h-a4))))"], "anno_status": [true], "diff_content": " w,h,n = map(int,input().split())\n area = h*w\n a1=0\n a2=w\n a3=0\n a4=h\n for i in range(n):\n x,y,a = map(int,input().split())\n if a ==1:\n a1 = max(a1,x)\n elif a ==2:\n a2 = min(a2,x)\n elif a ==3:\n a3 = max(a3,y)\n elif a==4:\n a4 = min(a4,y)\n \n-area -= a1*h + (w-a2)*h + a3*w + (h-a4)*w \n-if area<=0:\n+if a1>=a2 or a3>=a4:\n print(0)\n else:\n- print(area-(a1*(a3+(h-a4))+(10-a2)*(a3+(h-a4))))\n+ area -= a1*h + (w-a2)*h + a3*w + (h-a4)*w \n+ \n+ print(area+(a1*(a3+(h-a4))+(w-a2)*(a3+(h-a4))))\n", "FL_content": " w,h,n = map(int,input().split())\n area = h*w\n a1=0\n a2=w\n a3=0\n a4=h\n for i in range(n):\n x,y,a = map(int,input().split())\n if a ==1:\n a1 = max(a1,x)\n elif a ==2:\n a2 = min(a2,x)\n elif a ==3:\n a3 = max(a3,y)\n elif a==4:\n a4 = min(a4,y)\n \n-area -= a1*h + (w-a2)*h + a3*w + (h-a4)*w \n-if area<=0:\n print(0)\n else:\n- print(area-(a1*(a3+(h-a4))+(10-a2)*(a3+(h-a4))))\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 22 }, { "user_id": "u934052933", "problem_id": "p03944", "submission1_id": "s493698320", "submission2_id": "s899590652", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\ndef main()->None:\n W, H, N = map(int, input().split())\n range_N = range(N)\n xl, xr, yd, yu = 0, W, 0, H\n for i in range_N:\n x, y, a = map(int, input().split())\n if a == 1:\n xl = max(x, xl)\n if a == 2:\n xr = min(x, xr)\n if a == 3:\n yd = max(y, yd)\n else:\n yu = min(y, yu)\n if xl >= xr or yd >= yu:\n print(0)\n else:\n print((xr - xl) * (yu - yd))\n\nif __name__ == \"__main__\":\n main()", "code2": "\n\n\ndef main()->None:\n W, H, N = map(int, input().split())\n range_N = range(N)\n xl, xr, yd, yu = 0, W, 0, H\n for i in range_N:\n x, y, a = map(int, input().split())\n if a == 1:\n xl = max(x, xl)\n elif a == 2:\n xr = min(x, xr)\n elif a == 3:\n yd = max(y, yd)\n else:\n yu = min(y, yu)\n if xl >= xr or yd >= yu:\n print(0)\n else:\n print((xr - xl) * (yu - yd))\n\nif __name__ == \"__main__\":\n main()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576019980", "date2": "1576020647", "bleu_score": "0.9859373947289705", "code1_test_status": [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0], "code1_test_score": 50, "total_score": 103, "input": "5 2 3\n2 0 3\n3 11 2\n2 0 1\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["\n\n\ndef main()->None: # (0): main=\n W, H, N = map(int, input().split())\n range_N = range(N)\n xl, xr, yd, yu = 0, W, 0, H\n for i in range_N:\n x, y, a = map(int, input().split())\n if a == 1:\n xl = max(x, xl)\n if a == 2:\n xr = min(x, xr)\n if a == 3:\n yd = max(y, yd)\n else:\n yu = min(y, yu)\n if xl >= xr or yd >= yu:\n print(0)\n else:\n print((xr - xl) * (yu - yd))\n\nif __name__ == \"__main__\":\n main()"], "anno_status": [true], "diff_content": " \n \n \n def main()->None:\n W, H, N = map(int, input().split())\n range_N = range(N)\n xl, xr, yd, yu = 0, W, 0, H\n for i in range_N:\n x, y, a = map(int, input().split())\n if a == 1:\n xl = max(x, xl)\n- if a == 2:\n+ elif a == 2:\n xr = min(x, xr)\n- if a == 3:\n+ elif a == 3:\n yd = max(y, yd)\n else:\n yu = min(y, yu)\n if xl >= xr or yd >= yu:\n print(0)\n else:\n print((xr - xl) * (yu - yd))\n \n if __name__ == \"__main__\":\n main()\n", "FL_content": " \n \n \n def main()->None:\n W, H, N = map(int, input().split())\n range_N = range(N)\n xl, xr, yd, yu = 0, W, 0, H\n for i in range_N:\n x, y, a = map(int, input().split())\n if a == 1:\n xl = max(x, xl)\n- if a == 2:\n xr = min(x, xr)\n- if a == 3:\n yd = max(y, yd)\n else:\n yu = min(y, yu)\n if xl >= xr or yd >= yu:\n print(0)\n else:\n print((xr - xl) * (yu - yd))\n \n if __name__ == \"__main__\":\n main()\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 24 }, { "user_id": "u996276765", "problem_id": "p03944", "submission1_id": "s805618159", "submission2_id": "s037095733", "status1": "Wrong Answer", "status2": "Accepted", "code1": "W, H, N = map(int, input().split())\nx = [0] * N\ny = [0] * N\na = [0] * N\nx_min = 0\nx_max = W\ny_min = 0\ny_max = H\nfor i in range(N):\n x[i], y[i], a[i] = map(int, input().split())\nfor i in range(N):\n if x_max <= x_min or y_max <= y_min:\n print(0)\n break\n elif a[i] == 1:\n if x_min < x[i]:\n x_min = x[i]\n elif a[i] == 2:\n if x_max < x[i]:\n x_max = x[i]\n elif a[i] == 3:\n if y_min < x[i]:\n y_min = y[i]\n elif a[i] == 4:\n if y_max < x[i]:\n y_max = y[i]\nprint((x_max - x_min)*(y_max - y_min))", "code2": "W, H, N = map(int, input().split())\nx = [0] * N\ny = [0] * N\na = [0] * N\nx_min = 0\nx_max = W\ny_min = 0\ny_max = H\nfor i in range(N):\n x[i], y[i], a[i] = map(int, input().split())\nfor i in range(N):\n if a[i] == 1:\n if x_min < x[i]:\n x_min = x[i]\n elif a[i] == 2:\n if x_max > x[i]:\n x_max = x[i]\n elif a[i] == 3:\n if y_min < y[i]:\n y_min = y[i]\n elif a[i] == 4:\n if y_max > y[i]:\n y_max = y[i]\nif x_max <= x_min or y_max <= y_min:\n print(0)\nelse:\n print((x_max - x_min)*(y_max - y_min))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1545968419", "date2": "1545968788", "bleu_score": "0.9456439478536118", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0], "code1_test_score": 15, "total_score": 103, "input": "10 10 5\n1 6 1\n4 1 3\n6 9 4\n9 4 2\n3 1 3\n", "actual_output": "81\n", "expected_output": "64\n", "anno_code": ["W, H, N = map(int, input().split()) # (0): W=10, H=10, N=5\nx = [0] * N # (1): x=[0, 0, 0, 0, 0]\ny = [0] * N # (2): y=[0, 0, 0, 0, 0]\na = [0] * N # (3): a=[0, 0, 0, 0, 0]\nx_min = 0 # (4): x_min=0\nx_max = W # (5): x_max=10\ny_min = 0 # (6): y_min=0\ny_max = H # (7): y_max=10\nfor i in range(N): # (8): i=0 (10): i=1 ... (18): NO CHANGE\n x[i], y[i], a[i] = map(int, input().split()) # (9): x=[1, 0, 0, 0, 0], y=[6, 0, 0, 0, 0], a=[1, 0, 0, 0, 0] (11): x=[1, 4, 0, 0, 0], y=[6, 1, 0, 0, 0], a=[1, 3, 0, 0, 0] ... (17): x=[1, 4, 6, 9, 3], y=[6, 1, 9, 4, 1], a=[1, 3, 4, 2, 3]\nfor i in range(N): # (19): i=0 (24): i=1 ... (50): NO CHANGE\n if x_max <= x_min or y_max <= y_min: # (20): NO CHANGE (25): NO CHANGE ... (44): NO CHANGE\n print(0)\n break\n elif a[i] == 1: # (21): NO CHANGE (26): NO CHANGE ... (45): NO CHANGE\n if x_min < x[i]: # (22): NO CHANGE\n x_min = x[i] # (23): x_min=1\n elif a[i] == 2: # (27): NO CHANGE (34): NO CHANGE ... (46): NO CHANGE\n if x_max < x[i]: # (42): NO CHANGE\n x_max = x[i]\n elif a[i] == 3: # (28): NO CHANGE (35): NO CHANGE (47): NO CHANGE\n if y_min < x[i]: # (29): NO CHANGE (48): NO CHANGE\n y_min = y[i] # (30): y_min=1 (49): NO CHANGE\n elif a[i] == 4: # (36): NO CHANGE\n if y_max < x[i]: # (37): NO CHANGE\n y_max = y[i]\nprint((x_max - x_min)*(y_max - y_min))"], "anno_status": [false], "diff_content": " W, H, N = map(int, input().split())\n x = [0] * N\n y = [0] * N\n a = [0] * N\n x_min = 0\n x_max = W\n y_min = 0\n y_max = H\n for i in range(N):\n x[i], y[i], a[i] = map(int, input().split())\n for i in range(N):\n- if x_max <= x_min or y_max <= y_min:\n- print(0)\n- break\n- elif a[i] == 1:\n+ if a[i] == 1:\n if x_min < x[i]:\n x_min = x[i]\n elif a[i] == 2:\n- if x_max < x[i]:\n+ if x_max > x[i]:\n x_max = x[i]\n elif a[i] == 3:\n- if y_min < x[i]:\n+ if y_min < y[i]:\n y_min = y[i]\n elif a[i] == 4:\n- if y_max < x[i]:\n+ if y_max > y[i]:\n y_max = y[i]\n-print((x_max - x_min)*(y_max - y_min))\n+if x_max <= x_min or y_max <= y_min:\n+ print(0)\n+else:\n+ print((x_max - x_min)*(y_max - y_min))\n+\n", "FL_content": " W, H, N = map(int, input().split())\n x = [0] * N\n y = [0] * N\n a = [0] * N\n x_min = 0\n x_max = W\n y_min = 0\n y_max = H\n for i in range(N):\n x[i], y[i], a[i] = map(int, input().split())\n for i in range(N):\n- if x_max <= x_min or y_max <= y_min:\n- print(0)\n- break\n- elif a[i] == 1:\n if x_min < x[i]:\n x_min = x[i]\n elif a[i] == 2:\n- if x_max < x[i]:\n x_max = x[i]\n elif a[i] == 3:\n- if y_min < x[i]:\n y_min = y[i]\n elif a[i] == 4:\n- if y_max < x[i]:\n y_max = y[i]\n-print((x_max - x_min)*(y_max - y_min))\n", "added_lines": 9, "removed_lines": 8, "code1_lines": 27 }, { "user_id": "u250734103", "problem_id": "p03944", "submission1_id": "s646579933", "submission2_id": "s367557830", "status1": "Wrong Answer", "status2": "Accepted", "code1": "W, H, N = map(int, input().split())\nx, y, a = [0] * N, [0] * N, [0] * N\nfor i in range(N):\n x[i], y[i], a[i] = map(int, input().split())\n \nw_s = 0\nw_e = W\nh_s = 0\nh_e = H\n\nfor i in range(N):\n if a[i] == 1:\n w_s = x[i]\n elif a[i] == 2:\n w_e = x[i]\n elif a[i] == 3:\n h_s = y[i]\n else:\n h_e = y[i]\n\nheight = h_e - h_s\nwidth = w_e - w_s\n\nif height <= 0 or width <= 0:\n print(0)\nelse:\n print(height * width)", "code2": "W, H, N = map(int, input().split())\nx, y, a = [0] * N, [0] * N, [0] * N\nfor i in range(N):\n x[i], y[i], a[i] = map(int, input().split())\n \nxmin = 0\nxmax = W\nymin = 0\nymax = H\n\nfor i in range(N):\n if a[i] == 1:\n xmin = max(x[i], xmin)\n elif a[i] == 2:\n xmax = min(x[i], xmax)\n elif a[i] == 3:\n ymin = max(y[i], ymin)\n else:\n ymax = min(y[i], ymax)\n\nheight = ymax - ymin\nwidth = xmax - xmin\n\nif height <= 0 or width <= 0:\n print(0)\nelse:\n print(height * width)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599804913", "date2": "1599805650", "bleu_score": "0.7626587548788706", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 96, "total_score": 103, "input": "5 2 3\n2 0 2\n1 11 2\n2 4 2\n", "actual_output": "4\n", "expected_output": "2\n\n", "anno_code": ["W, H, N = map(int, input().split()) # (0): W=5, H=2, N=3\nx, y, a = [0] * N, [0] * N, [0] * N # (1): x=[0, 0, 0], y=[0, 0, 0], a=[0, 0, 0]\nfor i in range(N): # (2): i=0 (4): i=1 ... (8): NO CHANGE\n x[i], y[i], a[i] = map(int, input().split()) # (3): x=[2, 0, 0], a=[2, 0, 0] (5): x=[2, 1, 0], y=[0, 11, 0], a=[2, 2, 0] (7): x=[2, 1, 2], y=[0, 11, 4], a=[2, 2, 2]\n \nw_s = 0 # (9): w_s=0\nw_e = W # (10): w_e=5\nh_s = 0 # (11): h_s=0\nh_e = H # (12): h_e=2\n\nfor i in range(N): # (13): i=0 (17): i=1 ... (25): NO CHANGE\n if a[i] == 1: # (14): NO CHANGE (18): NO CHANGE (22): NO CHANGE\n w_s = x[i]\n elif a[i] == 2: # (15): NO CHANGE (19): NO CHANGE (23): NO CHANGE\n w_e = x[i] # (16): w_e=2 (20): w_e=1 (24): w_e=2\n elif a[i] == 3:\n h_s = y[i]\n else:\n h_e = y[i]\n\nheight = h_e - h_s # (26): height=2\nwidth = w_e - w_s # (27): width=2\n\nif height <= 0 or width <= 0: # (28): NO CHANGE\n print(0)\nelse:\n print(height * width)"], "anno_status": [true], "diff_content": " W, H, N = map(int, input().split())\n x, y, a = [0] * N, [0] * N, [0] * N\n for i in range(N):\n x[i], y[i], a[i] = map(int, input().split())\n \n-w_s = 0\n-w_e = W\n-h_s = 0\n-h_e = H\n+xmin = 0\n+xmax = W\n+ymin = 0\n+ymax = H\n \n for i in range(N):\n if a[i] == 1:\n- w_s = x[i]\n+ xmin = max(x[i], xmin)\n elif a[i] == 2:\n- w_e = x[i]\n+ xmax = min(x[i], xmax)\n elif a[i] == 3:\n- h_s = y[i]\n+ ymin = max(y[i], ymin)\n else:\n- h_e = y[i]\n+ ymax = min(y[i], ymax)\n \n-height = h_e - h_s\n-width = w_e - w_s\n+height = ymax - ymin\n+width = xmax - xmin\n \n if height <= 0 or width <= 0:\n print(0)\n else:\n print(height * width)\n", "FL_content": " W, H, N = map(int, input().split())\n x, y, a = [0] * N, [0] * N, [0] * N\n for i in range(N):\n x[i], y[i], a[i] = map(int, input().split())\n \n-w_s = 0\n-w_e = W\n-h_s = 0\n-h_e = H\n \n for i in range(N):\n if a[i] == 1:\n- w_s = x[i]\n elif a[i] == 2:\n- w_e = x[i]\n elif a[i] == 3:\n- h_s = y[i]\n else:\n- h_e = y[i]\n \n-height = h_e - h_s\n-width = w_e - w_s\n \n if height <= 0 or width <= 0:\n print(0)\n else:\n print(height * width)\n", "added_lines": 10, "removed_lines": 10, "code1_lines": 27 }, { "user_id": "u227082700", "problem_id": "p03944", "submission1_id": "s065767111", "submission2_id": "s037417624", "status1": "Wrong Answer", "status2": "Accepted", "code1": "w,h,n=map(int,input().split())\nx,y=0,0\nfor i in range(n):\n a,b,c=map(int,input().split())\n if c 0:\n w0 = i[0]\n elif i[2] == 4:\n if i[1] < h:\n h = i[1]\n elif i[2] == 3:\n if i[1] > 0:\n h0 = i[1]\n\nw = w - w0 \nif w < 0:\n w = 0\nh = h - h0\nif h < 0:\n h = 0\nprint(w*h)", "code2": "w,h,n = map(int,input().split())\n\nw0 = 0\nh0 = 0\n\nc = [list(map(int,input().split())) for _ in range(n)]\n\nfor i in c:\n if i[2] == 2:\n if i[0] < w:\n w = i[0]\n elif i[2] == 1:\n if i[0] > w0:\n w0 = i[0]\n elif i[2] == 4:\n if i[1] < h:\n h = i[1]\n elif i[2] == 3:\n if i[1] > h0:\n h0 = i[1]\n\nw = w - w0 \nif w < 0:\n w = 0\nh = h - h0\nif h < 0:\n h = 0\nprint(w*h)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590356415", "date2": "1590356902", "bleu_score": "0.9885971774869299", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "5 4 3\n2 1 2\n6 11 3\n1 2 3\n", "actual_output": "4\n", "expected_output": "0\n\n", "anno_code": ["w,h,n = map(int,input().split()) # (0): w=5, h=4, n=3\n\nw0 = 0 # (1): w0=0\nh0 = 0 # (2): h0=0\n\nc = [list(map(int,input().split())) for _ in range(n)] # (3): c\n\nfor i in c: # (4): i=[2, 1, 2] (8): i=[6, 11, 3] ... (22): NO CHANGE\n if i[2] == 2: # (5): NO CHANGE (9): NO CHANGE (16): NO CHANGE\n if i[0] < w: # (6): NO CHANGE\n w = i[0] # (7): w=2\n elif i[2] == 1: # (10): NO CHANGE (17): NO CHANGE\n if i[0] > 0:\n w0 = i[0]\n elif i[2] == 4: # (11): NO CHANGE (18): NO CHANGE\n if i[1] < h:\n h = i[1]\n elif i[2] == 3: # (12): NO CHANGE (19): NO CHANGE\n if i[1] > 0: # (13): NO CHANGE (20): NO CHANGE\n h0 = i[1] # (14): h0=11 (21): h0=2\n\nw = w - w0 # (23): NO CHANGE\nif w < 0: # (24): NO CHANGE\n w = 0\nh = h - h0 # (25): h=2\nif h < 0: # (26): NO CHANGE\n h = 0\nprint(w*h)"], "anno_status": [true], "diff_content": " w,h,n = map(int,input().split())\n \n w0 = 0\n h0 = 0\n \n c = [list(map(int,input().split())) for _ in range(n)]\n \n for i in c:\n if i[2] == 2:\n if i[0] < w:\n w = i[0]\n elif i[2] == 1:\n- if i[0] > 0:\n+ if i[0] > w0:\n w0 = i[0]\n elif i[2] == 4:\n if i[1] < h:\n h = i[1]\n elif i[2] == 3:\n- if i[1] > 0:\n+ if i[1] > h0:\n h0 = i[1]\n \n w = w - w0 \n if w < 0:\n w = 0\n h = h - h0\n if h < 0:\n h = 0\n print(w*h)\n", "FL_content": " w,h,n = map(int,input().split())\n \n w0 = 0\n h0 = 0\n \n c = [list(map(int,input().split())) for _ in range(n)]\n \n for i in c:\n if i[2] == 2:\n if i[0] < w:\n w = i[0]\n elif i[2] == 1:\n- if i[0] > 0:\n w0 = i[0]\n elif i[2] == 4:\n if i[1] < h:\n h = i[1]\n elif i[2] == 3:\n- if i[1] > 0:\n h0 = i[1]\n \n w = w - w0 \n if w < 0:\n w = 0\n h = h - h0\n if h < 0:\n h = 0\n print(w*h)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 28 }, { "user_id": "u832152513", "problem_id": "p03944", "submission1_id": "s221670297", "submission2_id": "s825777862", "status1": "Wrong Answer", "status2": "Accepted", "code1": "w, h, n = map(int, input().split())\nxya = [list(map(int, input().split())) for _ in range(n)]\n\nw0 = 0\nh0 = 0\nfor i in range(n):\n if xya[i][2] == 1:\n w0 = xya[i][0]\n elif xya[i][2] == 2:\n w = xya[i][0]\n elif xya[i][2] == 3:\n h0 = xya[i][1]\n else:\n h = xya[i][1]\n\nprint(max(0,(w-w0) * (h-h0)))", "code2": "w, h, n = map(int, input().split())\nxya = [list(map(int, input().split())) for _ in range(n)]\n\nw0 = 0\nh0 = 0\nfor i in range(n):\n if xya[i][2] == 1:\n w0 = max(w0,xya[i][0])\n elif xya[i][2] == 2:\n w = min(w,xya[i][0])\n elif xya[i][2] == 3:\n h0 = max(h0,xya[i][1])\n else:\n h = min(h,xya[i][1])\n \nprint(max(0, (w-w0)) * max(0, (h-h0)))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1574838480", "date2": "1574839222", "bleu_score": "0.8326107890933703", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 96, "total_score": 103, "input": "5 4 3\n2 1 2\n6 11 3\n1 2 3\n", "actual_output": "4\n", "expected_output": "0\n\n", "anno_code": ["w, h, n = map(int, input().split()) # (0): w=5, h=4, n=3\nxya = [list(map(int, input().split())) for _ in range(n)] # (1): xya\n\nw0 = 0 # (2): w0=0\nh0 = 0 # (3): h0=0\nfor i in range(n): # (4): i=0 (8): i=1 ... (18): NO CHANGE\n if xya[i][2] == 1: # (5): NO CHANGE (9): NO CHANGE (14): NO CHANGE\n w0 = xya[i][0]\n elif xya[i][2] == 2: # (6): NO CHANGE (10): NO CHANGE (15): NO CHANGE\n w = xya[i][0] # (7): w=2\n elif xya[i][2] == 3: # (11): NO CHANGE (16): NO CHANGE\n h0 = xya[i][1] # (12): h0=11 (17): h0=2\n else:\n h = xya[i][1]\n\nprint(max(0,(w-w0) * (h-h0)))"], "anno_status": [true], "diff_content": " w, h, n = map(int, input().split())\n xya = [list(map(int, input().split())) for _ in range(n)]\n \n w0 = 0\n h0 = 0\n for i in range(n):\n if xya[i][2] == 1:\n- w0 = xya[i][0]\n+ w0 = max(w0,xya[i][0])\n elif xya[i][2] == 2:\n- w = xya[i][0]\n+ w = min(w,xya[i][0])\n elif xya[i][2] == 3:\n- h0 = xya[i][1]\n+ h0 = max(h0,xya[i][1])\n else:\n- h = xya[i][1]\n-\n-print(max(0,(w-w0) * (h-h0)))\n+ h = min(h,xya[i][1])\n+ \n+print(max(0, (w-w0)) * max(0, (h-h0)))\n", "FL_content": " w, h, n = map(int, input().split())\n xya = [list(map(int, input().split())) for _ in range(n)]\n \n w0 = 0\n h0 = 0\n for i in range(n):\n if xya[i][2] == 1:\n- w0 = xya[i][0]\n elif xya[i][2] == 2:\n- w = xya[i][0]\n elif xya[i][2] == 3:\n- h0 = xya[i][1]\n else:\n- h = xya[i][1]\n-\n-print(max(0,(w-w0) * (h-h0)))\n", "added_lines": 6, "removed_lines": 6, "code1_lines": 16 }, { "user_id": "u842689614", "problem_id": "p03944", "submission1_id": "s653507400", "submission2_id": "s694192926", "status1": "Wrong Answer", "status2": "Accepted", "code1": "W,H,N=map(int,input().split())\nxya=[list(map(int,input().split())) for i in range(N)]\n\nboundary=[0,0,W,H]\n\nfor i in range(N):\n a=xya[i][2]\n if a==1:\n boundary[0]=xya[i][0]\n elif a==2:\n boundary[2]=xya[i][0]\n elif a==3:\n boundary[1]=xya[i][1]\n else:\n boundary[3]=xya[i][1]\n\nprint(max(0,(boundary[2]-boundary[0])*(boundary[3]-boundary[1])))", "code2": "W,H,N=map(int,input().split())\nxya=[list(map(int,input().split())) for i in range(N)]\n\nboundary=[0,0,W,H]\n\nfor i in range(N):\n a=xya[i][2]\n if a==1:\n if boundary[0]xya[i][0]:\n boundary[2]=xya[i][0]\n elif a==3:\n if boundary[1]xya[i][1]:\n boundary[3]=xya[i][1]\n if boundary[0]>=boundary[2] or boundary[1]>=boundary[3]:\n break\n\nprint(max(0,(boundary[2]-boundary[0])*(boundary[3]-boundary[1])))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566695680", "date2": "1566696211", "bleu_score": "0.6407729252399404", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 96, "total_score": 103, "input": "5 4 3\n2 1 2\n6 11 2\n1 2 3\n", "actual_output": "12\n", "expected_output": "4\n\n", "anno_code": ["W,H,N=map(int,input().split()) # (0): W=5, H=4, N=3\nxya=[list(map(int,input().split())) for i in range(N)] # (1): xya\n\nboundary=[0,0,W,H] # (2): boundary=[0, 0, 5, 4]\n\nfor i in range(N): # (3): i=0 (8): i=1 ... (19): NO CHANGE\n a=xya[i][2] # (4): a=2 (9): NO CHANGE (14): a=3\n if a==1: # (5): NO CHANGE (10): NO CHANGE (15): NO CHANGE\n boundary[0]=xya[i][0]\n elif a==2: # (6): NO CHANGE (11): NO CHANGE (16): NO CHANGE\n boundary[2]=xya[i][0] # (7): boundary=[0, 0, 2, 4] (12): boundary=[0, 0, 6, 4]\n elif a==3: # (17): NO CHANGE\n boundary[1]=xya[i][1] # (18): boundary=[0, 2, 6, 4]\n else:\n boundary[3]=xya[i][1]\n\nprint(max(0,(boundary[2]-boundary[0])*(boundary[3]-boundary[1])))"], "anno_status": [true], "diff_content": " W,H,N=map(int,input().split())\n xya=[list(map(int,input().split())) for i in range(N)]\n \n boundary=[0,0,W,H]\n \n for i in range(N):\n a=xya[i][2]\n if a==1:\n- boundary[0]=xya[i][0]\n+ if boundary[0]xya[i][0]:\n+ boundary[2]=xya[i][0]\n elif a==3:\n- boundary[1]=xya[i][1]\n+ if boundary[1]xya[i][1]:\n+ boundary[3]=xya[i][1]\n+ if boundary[0]>=boundary[2] or boundary[1]>=boundary[3]:\n+ break\n \n print(max(0,(boundary[2]-boundary[0])*(boundary[3]-boundary[1])))\n", "FL_content": " W,H,N=map(int,input().split())\n xya=[list(map(int,input().split())) for i in range(N)]\n \n boundary=[0,0,W,H]\n \n for i in range(N):\n a=xya[i][2]\n if a==1:\n- boundary[0]=xya[i][0]\n elif a==2:\n- boundary[2]=xya[i][0]\n elif a==3:\n- boundary[1]=xya[i][1]\n else:\n- boundary[3]=xya[i][1]\n \n print(max(0,(boundary[2]-boundary[0])*(boundary[3]-boundary[1])))\n", "added_lines": 10, "removed_lines": 4, "code1_lines": 17 }, { "user_id": "u017810624", "problem_id": "p03944", "submission1_id": "s460123423", "submission2_id": "s064587231", "status1": "Wrong Answer", "status2": "Accepted", "code1": "w,h,n=map(int,input().split())\na=[list(map(int,input().split())) for i in range(n)]\na1=[0];a2=[0];a3=[0];a4=[0]\nfor i in a:\n if i[2]==1:a1.append(i[0])\n else:pass\nfor i in a:\n if i[2]==2:a2.append(i[0])\n else:pass\nfor i in a:\n if i[2]==3:a3.append(i[1])\n else:pass\nfor i in a:\n if i[2]==4:a4.append(i[1])\n else:pass\nif max(a1)-min(a2)<0:x=max(a1)-min(a2)\nelse:x=0\nif max(a3)-min(a4)<0:y=max(a3)-min(a4)\nelse:y=0\nprint(x*y)", "code2": "w,h,n=map(int,input().split())\na=[list(map(int,input().split())) for i in range(n)]\na1=[0];a2=[w];a3=[0];a4=[h]\nfor i in a:\n if i[2]==1:a1.append(i[0])\n else:pass\nfor i in a:\n if i[2]==2:a2.append(i[0])\n else:pass\nfor i in a:\n if i[2]==3:a3.append(i[1])\n else:pass\nfor i in a:\n if i[2]==4:a4.append(i[1])\n else:pass\nif max(a1)-min(a2)<0:x=max(a1)-min(a2)\nelse:x=0\nif max(a3)-min(a4)<0:y=max(a3)-min(a4)\nelse:y=0\nprint(x*y)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1536382629", "date2": "1536383064", "bleu_score": "0.9883037546671282", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0], "code1_test_score": 27, "total_score": 103, "input": "5 4 3\n2 0 2\n3 11 2\n2 4 2\n", "actual_output": "0\n", "expected_output": "8\n\n", "anno_code": ["w,h,n=map(int,input().split()) # (0): w=5, h=4, n=3\na=[list(map(int,input().split())) for i in range(n)] # (1): a\na1=[0];a2=[0];a3=[0];a4=[0] # (2): a1=[0], a2=[0], a3=[0], a4=[0]\nfor i in a: # (3): i=[2, 0, 2] (6): i=[3, 11, 2] ... (12): NO CHANGE\n if i[2]==1:a1.append(i[0]) # (4): NO CHANGE (7): NO CHANGE (10): NO CHANGE\n else:pass # (5): NO CHANGE (8): NO CHANGE (11): NO CHANGE\nfor i in a: # (13): i=[2, 0, 2] (15): i=[3, 11, 2] ... (19): NO CHANGE\n if i[2]==2:a2.append(i[0]) # (14): a2=[0, 2] (16): a2=[0, 2, 3] (18): a2=[0, 2, 3, 2]\n else:pass\nfor i in a: # (20): i=[2, 0, 2] (23): i=[3, 11, 2] ... (29): NO CHANGE\n if i[2]==3:a3.append(i[1]) # (21): NO CHANGE (24): NO CHANGE (27): NO CHANGE\n else:pass # (22): NO CHANGE (25): NO CHANGE (28): NO CHANGE\nfor i in a: # (30): i=[2, 0, 2] (33): i=[3, 11, 2] ... (39): NO CHANGE\n if i[2]==4:a4.append(i[1]) # (31): NO CHANGE (34): NO CHANGE (37): NO CHANGE\n else:pass # (32): NO CHANGE (35): NO CHANGE (38): NO CHANGE\nif max(a1)-min(a2)<0:x=max(a1)-min(a2) # (40): NO CHANGE\nelse:x=0 # (41): x=0\nif max(a3)-min(a4)<0:y=max(a3)-min(a4) # (42): NO CHANGE\nelse:y=0 # (43): y=0\nprint(x*y)"], "anno_status": [true], "diff_content": " w,h,n=map(int,input().split())\n a=[list(map(int,input().split())) for i in range(n)]\n-a1=[0];a2=[0];a3=[0];a4=[0]\n+a1=[0];a2=[w];a3=[0];a4=[h]\n for i in a:\n if i[2]==1:a1.append(i[0])\n else:pass\n for i in a:\n if i[2]==2:a2.append(i[0])\n else:pass\n for i in a:\n if i[2]==3:a3.append(i[1])\n else:pass\n for i in a:\n if i[2]==4:a4.append(i[1])\n else:pass\n if max(a1)-min(a2)<0:x=max(a1)-min(a2)\n else:x=0\n if max(a3)-min(a4)<0:y=max(a3)-min(a4)\n else:y=0\n print(x*y)\n", "FL_content": " w,h,n=map(int,input().split())\n a=[list(map(int,input().split())) for i in range(n)]\n-a1=[0];a2=[0];a3=[0];a4=[0]\n for i in a:\n if i[2]==1:a1.append(i[0])\n else:pass\n for i in a:\n if i[2]==2:a2.append(i[0])\n else:pass\n for i in a:\n if i[2]==3:a3.append(i[1])\n else:pass\n for i in a:\n if i[2]==4:a4.append(i[1])\n else:pass\n if max(a1)-min(a2)<0:x=max(a1)-min(a2)\n else:x=0\n if max(a3)-min(a4)<0:y=max(a3)-min(a4)\n else:y=0\n print(x*y)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 20 }, { "user_id": "u535659144", "problem_id": "p03944", "submission1_id": "s130968968", "submission2_id": "s067788045", "status1": "Wrong Answer", "status2": "Accepted", "code1": "inp = list(map(int,input().split()))\nleft_max=0\nright_min=inp[0]\nupper_min=inp[1]\nlower_max=0\n\nfor i in range(inp[2]):\n inin = list(map(int,input().split()))\n if inin[2] == 1 and inin[0]>left_max:\n left_max=inin[0]\n if inin[2] == 2 and inin[0]lower_max:\n lower_max=inin[1]\nleft_max=min(left_max,right_min)\nupper_min=min(upper_min,lower_max)\nprint((right_min-left_max)*(upper_min-lower_max))\n \n", "code2": "inp = list(map(int,input().split()))\nleft_max=0\nright_min=inp[0]\nupper_min=inp[1]\nlower_max=0\n\nfor i in range(inp[2]):\n inin = list(map(int,input().split()))\n if inin[2] == 1 and inin[0]>left_max:\n left_max=inin[0]\n if inin[2] == 2 and inin[0]lower_max:\n lower_max=inin[1]\nleft_max=min(left_max,right_min)\nupper_min=max(upper_min,lower_max)\nprint((right_min-left_max)*(upper_min-lower_max))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585707347", "date2": "1585707461", "bleu_score": "0.9829247320091734", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0], "code1_test_score": 25, "total_score": 103, "input": "5 2 3\n2 0 3\n3 11 2\n2 0 2\n", "actual_output": "0\n", "expected_output": "4\n\n", "anno_code": ["inp = list(map(int,input().split())) # (0): inp=[5, 2, 3]\nleft_max=0 # (1): left_max=0\nright_min=inp[0] # (2): right_min=5\nupper_min=inp[1] # (3): upper_min=2\nlower_max=0 # (4): lower_max=0\n\nfor i in range(inp[2]): # (5): i=0 (11): i=1 ... (25): NO CHANGE\n inin = list(map(int,input().split())) # (6): inin=[2, 0, 3] (12): inin=[3, 11, 2] (19): inin=[2, 0, 2]\n if inin[2] == 1 and inin[0]>left_max: # (7): NO CHANGE (13): NO CHANGE (20): NO CHANGE\n left_max=inin[0]\n if inin[2] == 2 and inin[0]lower_max: # (10): NO CHANGE (17): NO CHANGE (24): NO CHANGE\n lower_max=inin[1]\nleft_max=min(left_max,right_min) # (26): NO CHANGE\nupper_min=min(upper_min,lower_max) # (27): upper_min=0\nprint((right_min-left_max)*(upper_min-lower_max))\n \n"], "anno_status": [true], "diff_content": " inp = list(map(int,input().split()))\n left_max=0\n right_min=inp[0]\n upper_min=inp[1]\n lower_max=0\n \n for i in range(inp[2]):\n inin = list(map(int,input().split()))\n if inin[2] == 1 and inin[0]>left_max:\n left_max=inin[0]\n if inin[2] == 2 and inin[0]lower_max:\n lower_max=inin[1]\n left_max=min(left_max,right_min)\n-upper_min=min(upper_min,lower_max)\n+upper_min=max(upper_min,lower_max)\n print((right_min-left_max)*(upper_min-lower_max))\n- \n \n", "FL_content": " inp = list(map(int,input().split()))\n left_max=0\n right_min=inp[0]\n upper_min=inp[1]\n lower_max=0\n \n for i in range(inp[2]):\n inin = list(map(int,input().split()))\n if inin[2] == 1 and inin[0]>left_max:\n left_max=inin[0]\n if inin[2] == 2 and inin[0]lower_max:\n lower_max=inin[1]\n left_max=min(left_max,right_min)\n-upper_min=min(upper_min,lower_max)\n print((right_min-left_max)*(upper_min-lower_max))\n- \n \n", "added_lines": 1, "removed_lines": 2, "code1_lines": 21 }, { "user_id": "u626266743", "problem_id": "p02234", "submission1_id": "s853445864", "submission2_id": "s473375567", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nINF = 10**9\nP = [list(map(int, input().split())) for i in range(n)]\nm = [[0]*n for i in range(n)]\n\nfor l in range(2, n + 1):\n for i in range(n - l + 1):\n j = i + l - 1\n m[i][j] = INF\n for k in range(i, j):\n m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + P[i - 1][0] * P[k][1] * P[j][1])\n\nprint(m[0][n - 1])", "code2": "n = int(input())\nINF = 10**9\nP = [list(map(int, input().split())) for i in range(n)]\nm = [[0]*n for i in range(n)]\n\nfor l in range(2, n + 1):\n for i in range(n - l + 1):\n j = i + l - 1\n m[i][j] = INF\n for k in range(i, j):\n m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + P[i][0] * P[k][1] * P[j][1])\n\nprint(m[0][n - 1])", "original_language1": "Python3", "original_language2": "Python3", "date1": "1511273285", "date2": "1511273353", "bleu_score": "0.9845416298122788", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "6\n0 1\n18 0\n18 0\n3 3\n1 8\n4 7\n", "actual_output": "28\n", "expected_output": "0\n\n", "anno_code": ["n = int(input()) # (0): n=6\nINF = 10**9 # (1): INF=1000000000\nP = [list(map(int, input().split())) for i in range(n)] # (2): P\nm = [[0]*n for i in range(n)] # (3): m\n\nfor l in range(2, n + 1): # (4): l=2 (36): l=3 ... (144): NO CHANGE\n for i in range(n - l + 1): # (5): i=0 (11): i=1 ... (143): NO CHANGE\n j = i + l - 1 # (6): j=1 (12): j=2 ... (130): NO CHANGE\n m[i][j] = INF # (7): m (13): m ... (131): m\n for k in range(i, j): # (8): k=0 (10): NO CHANGE ... (142): NO CHANGE\n m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + P[i - 1][0] * P[k][1] * P[j][1]) # (9): m (15): m ... (141): NO CHANGE\n\nprint(m[0][n - 1])"], "anno_status": [true], "diff_content": " n = int(input())\n INF = 10**9\n P = [list(map(int, input().split())) for i in range(n)]\n m = [[0]*n for i in range(n)]\n \n for l in range(2, n + 1):\n for i in range(n - l + 1):\n j = i + l - 1\n m[i][j] = INF\n for k in range(i, j):\n- m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + P[i - 1][0] * P[k][1] * P[j][1])\n+ m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + P[i][0] * P[k][1] * P[j][1])\n \n print(m[0][n - 1])\n", "FL_content": " n = int(input())\n INF = 10**9\n P = [list(map(int, input().split())) for i in range(n)]\n m = [[0]*n for i in range(n)]\n \n for l in range(2, n + 1):\n for i in range(n - l + 1):\n j = i + l - 1\n m[i][j] = INF\n for k in range(i, j):\n- m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + P[i - 1][0] * P[k][1] * P[j][1])\n \n print(m[0][n - 1])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u845643816", "problem_id": "p02234", "submission1_id": "s114645910", "submission2_id": "s451103333", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\np = list(range(n+2))\n\nfor i in range(1,n+1):\n p[i], p[n+1] = map(int, input().split())\n\n\ntable = [[0] * (n+1) for i in range(n+1)]\n\n\nfor i in range(1,n): \n table[i][i+1] = p[i]*p[i+1]*p[i+2]\n\n\nfor k in range(3, n+1): \n for i in range(1,n+2-k): \n j = i + k - 1 \n\n table[i][j] = float('inf')\n\n for x in range(i, j): \n print(i, x, j)\n cost = table[i][x] + table[x+1][j] + p[i]*p[x+1]*p[j+1]\n table[i][j] = min(table[i][j], cost)\n \n\nprint(table[1][n])", "code2": "n = int(input())\np = list(range(n+2))\n\nfor i in range(1,n+1):\n p[i], p[n+1] = map(int, input().split())\n\n\ntable = [[0] * (n+1) for i in range(n+1)]\n\n\nfor i in range(1,n): \n table[i][i+1] = p[i]*p[i+1]*p[i+2]\n\n\nfor k in range(3, n+1): \n for i in range(1,n+2-k): \n j = i + k - 1 \n\n table[i][j] = float('inf')\n\n for x in range(i, j): \n \n cost = table[i][x] + table[x+1][j] + p[i]*p[x+1]*p[j+1]\n table[i][j] = min(table[i][j], cost)\n \n\nprint(table[1][n])", "original_language1": "Python3", "original_language2": "Python3", "date1": "1511266155", "date2": "1511266457", "bleu_score": "0.9713200120860555", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "6\n0 1\n18 0\n18 0\n3 3\n1 8\n2 7\n", "actual_output": "1 1 3\n1 2 3\n2 2 4\n2 3 4\n3 3 5\n3 4 5\n4 4 6\n4 5 6\n1 1 4\n1 2 4\n1 3 4\n2 2 5\n2 3 5\n2 4 5\n3 3 6\n3 4 6\n3 5 6\n1 1 5\n1 2 5\n1 3 5\n1 4 5\n2 2 6\n2 3 6\n2 4 6\n2 5 6\n1 1 6\n1 2 6\n1 3 6\n1 4 6\n1 5 6\n0\n", "expected_output": "0\n\n", "anno_code": ["n = int(input()) # (0): n=6\np = list(range(n+2)) # (1): p=[0, 1, 2, 3, 4, 5, 6, 7]\n\nfor i in range(1,n+1): # (2): i=1 (4): i=2 ... (14): NO CHANGE\n p[i], p[n+1] = map(int, input().split()) # (3): p=[0, 0, 2, 3, 4, 5, 6, 1] (5): p=[0, 0, 18, 3, 4, 5, 6, 0] ... (13): p=[0, 0, 18, 18, 3, 1, 2, 7]\n\n\ntable = [[0] * (n+1) for i in range(n+1)] # (15): table\n\n\nfor i in range(1,n): # (16): i=1 (18): i=2 ... (26): NO CHANGE\n table[i][i+1] = p[i]*p[i+1]*p[i+2] # (17): NO CHANGE (19): table ... (25): table\n\n\nfor k in range(3, n+1): # (27): k=3 (77): k=4 ... (195): NO CHANGE\n for i in range(1,n+2-k): # (28): i=1 (40): i=2 ... (194): NO CHANGE\n j = i + k - 1 # (29): j=3 (41): j=4 ... (171): NO CHANGE\n\n table[i][j] = float('inf') # (30): table (42): table ... (172): table\n\n for x in range(i, j): # (31): x=1 (35): x=2 ... (193): NO CHANGE\n print(i, x, j) # (32): NO CHANGE (36): NO CHANGE ... (190): NO CHANGE\n cost = table[i][x] + table[x+1][j] + p[i]*p[x+1]*p[j+1] # (33): cost=972 (37): cost=0 ... (191): cost=0\n table[i][j] = min(table[i][j], cost) # (34): table (38): table ... (192): table\n \n\nprint(table[1][n])"], "anno_status": [true], "diff_content": " n = int(input())\n p = list(range(n+2))\n \n for i in range(1,n+1):\n p[i], p[n+1] = map(int, input().split())\n \n \n table = [[0] * (n+1) for i in range(n+1)]\n \n \n for i in range(1,n): \n table[i][i+1] = p[i]*p[i+1]*p[i+2]\n \n \n for k in range(3, n+1): \n for i in range(1,n+2-k): \n j = i + k - 1 \n \n table[i][j] = float('inf')\n \n for x in range(i, j): \n- print(i, x, j)\n+ \n cost = table[i][x] + table[x+1][j] + p[i]*p[x+1]*p[j+1]\n table[i][j] = min(table[i][j], cost)\n \n \n print(table[1][n])\n", "FL_content": " n = int(input())\n p = list(range(n+2))\n \n for i in range(1,n+1):\n p[i], p[n+1] = map(int, input().split())\n \n \n table = [[0] * (n+1) for i in range(n+1)]\n \n \n for i in range(1,n): \n table[i][i+1] = p[i]*p[i+1]*p[i+2]\n \n \n for k in range(3, n+1): \n for i in range(1,n+2-k): \n j = i + k - 1 \n \n table[i][j] = float('inf')\n \n for x in range(i, j): \n- print(i, x, j)\n cost = table[i][x] + table[x+1][j] + p[i]*p[x+1]*p[j+1]\n table[i][j] = min(table[i][j], cost)\n \n \n print(table[1][n])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 27 }, { "user_id": "u657361950", "problem_id": "p02234", "submission1_id": "s818005440", "submission2_id": "s481733988", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\ndef get_min_cost(n, p):\n\tm = [[0 for x in range(n+1)] for x in range(n+1)]\n\tfor s in range(n):\n\t\ti = 1\n\t\tfor j in range(s+2, n):\n\t\t\tm[i][j] = sys.maxsize\n\t\t\tfor k in range(i, j+1):\n\t\t\t\tm[i][j] = min(m[i][j], m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j])\n\t\t\ti+=1\t\n\treturn m[1][n]\n\nn = int(input())\np = [0] * (n+1)\nj = 0\nfor i in range(n):\n\ta = list(map(int, input().split()))\n\tif i == 0:\n\t\tp[j] = a[0]\n\t\tj += 1\n\tp[j] = a[1]\n\tj += 1\nprint(get_min_cost(n, p))\n\t\t\n\t\t\n", "code2": "import sys\n\ndef get_min_cost(n, p):\n\tm = [[0 for x in range(n+1)] for x in range(n+1)]\n\tfor s in range(n):\n\t\ti = 1\n\t\tfor j in range(s+2, n+1):\n\t\t\tm[i][j] = sys.maxsize\n\t\t\tfor k in range(i, j):\n\t\t\t\tm[i][j] = min(m[i][j], m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j])\n\t\t\ti+=1\t\n\treturn m[1][n]\n\nn = int(input())\np = [0] * (n+1)\nj = 0\nfor i in range(n):\n\ta = list(map(int, input().split()))\n\tif i == 0:\n\t\tp[j] = a[0]\n\t\tj += 1\n\tp[j] = a[1]\n\tj += 1\nprint(get_min_cost(n, p))\n\t\t\n\t\t\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1535431920", "date2": "1535432084", "bleu_score": "0.9935040438571177", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 70, "total_score": 101, "input": "6\n10 35\n35 15\n15 5\n5 10\n10 20\n20 5\n", "actual_output": "0\n", "expected_output": "5875\n\n", "anno_code": ["import sys\n\ndef get_min_cost(n, p): # (0): get_min_cost=\n\tm = [[0 for x in range(n+1)] for x in range(n+1)] # (38): m\n\tfor s in range(n): # (39): s=0 (74): s=1 ... (154): s=5\n\t\ti = 1 # (40): i=1 (75): i=1 ... (155): NO CHANGE\n\t\tfor j in range(s+2, n): # (41): j=2 (49): j=3 ... (156): NO CHANGE\n\t\t\tm[i][j] = sys.maxsize # (42): m (50): m ... (137): m\n\t\t\tfor k in range(i, j+1): # (43): k=1 (45): k=2 ... (148): NO CHANGE\n\t\t\t\tm[i][j] = min(m[i][j], m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j]) # (44): m (46): NO CHANGE ... (147): NO CHANGE\n\t\t\ti+=1\t # (48): i=2 (56): i=3 ... (149): i=2\n\treturn m[1][n]\n\nn = int(input()) # (1): n=6\np = [0] * (n+1) # (2): p=[0, 0, 0, 0, 0, 0, 0]\nj = 0 # (3): j=0\nfor i in range(n): # (4): i=0 (11): i=1 ... (36): NO CHANGE\n\ta = list(map(int, input().split())) # (5): a=[10, 35] (12): a=[35, 15] ... (32): a=[20, 5]\n\tif i == 0: # (6): NO CHANGE (13): NO CHANGE ... (33): NO CHANGE\n\t\tp[j] = a[0] # (7): p=[10, 0, 0, 0, 0, 0, 0]\n\t\tj += 1 # (8): j=1\n\tp[j] = a[1] # (9): p=[10, 35, 0, 0, 0, 0, 0] (14): p=[10, 35, 15, 0, 0, 0, 0] ... (34): p=[10, 35, 15, 5, 10, 20, 5]\n\tj += 1 # (10): j=2 (15): j=3 ... (35): j=7\nprint(get_min_cost(n, p)) # (37): NO CHANGE\n\t\t\n\t\t\n"], "anno_status": [true], "diff_content": " import sys\n \n def get_min_cost(n, p):\n \tm = [[0 for x in range(n+1)] for x in range(n+1)]\n \tfor s in range(n):\n \t\ti = 1\n-\t\tfor j in range(s+2, n):\n+\t\tfor j in range(s+2, n+1):\n \t\t\tm[i][j] = sys.maxsize\n-\t\t\tfor k in range(i, j+1):\n+\t\t\tfor k in range(i, j):\n \t\t\t\tm[i][j] = min(m[i][j], m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j])\n \t\t\ti+=1\t\n \treturn m[1][n]\n \n n = int(input())\n p = [0] * (n+1)\n j = 0\n for i in range(n):\n \ta = list(map(int, input().split()))\n \tif i == 0:\n \t\tp[j] = a[0]\n \t\tj += 1\n \tp[j] = a[1]\n \tj += 1\n print(get_min_cost(n, p))\n \t\t\n \t\t\n \n", "FL_content": " import sys\n \n def get_min_cost(n, p):\n \tm = [[0 for x in range(n+1)] for x in range(n+1)]\n \tfor s in range(n):\n \t\ti = 1\n-\t\tfor j in range(s+2, n):\n \t\t\tm[i][j] = sys.maxsize\n-\t\t\tfor k in range(i, j+1):\n \t\t\t\tm[i][j] = min(m[i][j], m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j])\n \t\t\ti+=1\t\n \treturn m[1][n]\n \n n = int(input())\n p = [0] * (n+1)\n j = 0\n for i in range(n):\n \ta = list(map(int, input().split()))\n \tif i == 0:\n \t\tp[j] = a[0]\n \t\tj += 1\n \tp[j] = a[1]\n \tj += 1\n print(get_min_cost(n, p))\n \t\t\n \t\t\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 27 }, { "user_id": "u809822290", "problem_id": "p02234", "submission1_id": "s322076625", "submission2_id": "s685644631", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\np=[0 for i in range (101)]\nm=[[0 for i in range(100)]for i in range(100)]\n\ndef MatrixChain(n) : \n\tfor i in range(1,n+1) : m[i][i] = 0;\n\tfor l in range(2,n+1) :\n\t\tfor i in range(1,n-l+2) : \n\t\t\tj = i + l - 1\n\t\t\tm[i][j] = float('Infinity')\n\t\t\tfor k in range(i,j) :\n\t\t\t\tq = m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j]\n\t\t\t\tm[i][j] = m[i][j] if m[i][j] <= q else q\n\nn = int(input())\nfor i in range(n) :\n\tinput_num = input()\n\tinput_num = input_num.split(' ')\n\tp[i] = int(input_num[0][0])\n\tp[i+1] = int(input_num[1])\n\nMatrixChain(n)\nprint(m[1][n])", "code2": "import sys\n\np=[0 for i in range (101)]\nm=[[0 for i in range(100)]for i in range(100)]\n\ndef MatrixChain(n) : \n\tfor i in range(1,n+1) : m[i][i] = 0;\n\tfor l in range(2,n+1) :\n\t\tfor i in range(1,n-l+2) : \n\t\t\tj = i + l - 1\n\t\t\tm[i][j] = float('Infinity')\n\t\t\tfor k in range(i,j) :\n\t\t\t\tq = m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j]\n\t\t\t\tm[i][j] = m[i][j] if m[i][j] <= q else q\n\nn = int(input())\nfor i in range(n) :\n\tp[i], p[i+1] = map(int, input().split())\n\nMatrixChain(n)\nprint(m[1][n])", "original_language1": "Python3", "original_language2": "Python3", "date1": "1435760801", "date2": "1435762670", "bleu_score": "0.8376244030665717", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 70, "total_score": 101, "input": "6\n30 35\n35 15\n15 5\n5 10\n10 20\n20 25\n", "actual_output": "141\n", "expected_output": "15125\n", "anno_code": ["import sys\n\np=[0 for i in range (101)] # (0): p=[0, 0, ..., 0, 0]\nm=[[0 for i in range(100)]for i in range(100)] # (1): m\n\ndef MatrixChain(n) : # (2): MatrixChain=\n\tfor i in range(1,n+1) : m[i][i] = 0; # (36): i=1 (37): i=2 ... (42): NO CHANGE\n\tfor l in range(2,n+1) : # (43): l=2 (80): l=3 ... (218): sys=, p=[3, 3, 1, 5, 1, 2, 25, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], m, MatrixChain=, i=5, input_num=['20', '25']\n\t\tfor i in range(1,n-l+2) : # (44): i=1 (51): i=2 ... (217): NO CHANGE\n\t\t\tj = i + l - 1 # (45): j=2 (52): j=3 ... (199): NO CHANGE\n\t\t\tm[i][j] = float('Infinity') # (46): NO CHANGE (53): NO CHANGE ... (200): NO CHANGE\n\t\t\tfor k in range(i,j) : # (47): k=1 (50): NO CHANGE ... (216): NO CHANGE\n\t\t\t\tq = m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j] # (48): q=9 (55): q=15 ... (214): q=172\n\t\t\t\tm[i][j] = m[i][j] if m[i][j] <= q else q # (49): NO CHANGE (56): NO CHANGE ... (215): NO CHANGE\n\nn = int(input()) # (3): n=6\nfor i in range(n) : # (4): i=0 (9): i=1 ... (34): NO CHANGE\n\tinput_num = input() # (5): input_num=30 35 (10): input_num=35 15 ... (30): input_num=20 25\n\tinput_num = input_num.split(' ') # (6): input_num=['30', '35'] (11): input_num=['35', '15'] ... (31): input_num=['20', '25']\n\tp[i] = int(input_num[0][0]) # (7): p=[3, 0, ..., 0, 0] (12): p=[3, 3, ..., 0, 0] ... (32): p=[3, 3, ..., 0, 0]\n\tp[i+1] = int(input_num[1]) # (8): p=[3, 35, ..., 0, 0] (13): p=[3, 3, ..., 0, 0] ... (33): p=[3, 3, ..., 0, 0]\n\nMatrixChain(n) # (35): NO CHANGE\nprint(m[1][n])"], "anno_status": [false], "diff_content": " import sys\n \n p=[0 for i in range (101)]\n m=[[0 for i in range(100)]for i in range(100)]\n \n def MatrixChain(n) : \n \tfor i in range(1,n+1) : m[i][i] = 0;\n \tfor l in range(2,n+1) :\n \t\tfor i in range(1,n-l+2) : \n \t\t\tj = i + l - 1\n \t\t\tm[i][j] = float('Infinity')\n \t\t\tfor k in range(i,j) :\n \t\t\t\tq = m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j]\n \t\t\t\tm[i][j] = m[i][j] if m[i][j] <= q else q\n \n n = int(input())\n for i in range(n) :\n-\tinput_num = input()\n-\tinput_num = input_num.split(' ')\n-\tp[i] = int(input_num[0][0])\n-\tp[i+1] = int(input_num[1])\n+\tp[i], p[i+1] = map(int, input().split())\n \n MatrixChain(n)\n print(m[1][n])\n", "FL_content": " import sys\n \n p=[0 for i in range (101)]\n m=[[0 for i in range(100)]for i in range(100)]\n \n def MatrixChain(n) : \n \tfor i in range(1,n+1) : m[i][i] = 0;\n \tfor l in range(2,n+1) :\n \t\tfor i in range(1,n-l+2) : \n \t\t\tj = i + l - 1\n \t\t\tm[i][j] = float('Infinity')\n \t\t\tfor k in range(i,j) :\n \t\t\t\tq = m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j]\n \t\t\t\tm[i][j] = m[i][j] if m[i][j] <= q else q\n \n n = int(input())\n for i in range(n) :\n-\tinput_num = input()\n-\tinput_num = input_num.split(' ')\n-\tp[i] = int(input_num[0][0])\n-\tp[i+1] = int(input_num[1])\n \n MatrixChain(n)\n print(m[1][n])\n", "added_lines": 1, "removed_lines": 4, "code1_lines": 24 }, { "user_id": "u497952650", "problem_id": "p03086", "submission1_id": "s309883970", "submission2_id": "s581704440", "status1": "Wrong Answer", "status2": "Accepted", "code1": "gene = [\"A\",\"T\",\"G\",\"C\"]\ndef is_gene(i):\n if i in gene:\n return True\n else:\n return False\n\nS = input()\n\nans = 0\ntmp = 0\n\nfor i in S:\n if is_gene(i):\n tmp += 1\n else:\n ans = max(ans,tmp)\n tmp = 0\n\nprint(ans)", "code2": "gene = [\"A\",\"T\",\"G\",\"C\"]\n\nS = list(input())\n\nans = 0\ntmp = 0\n\nfor i in range(len(S)):\n if S[i] in gene:\n tmp += 1\n ans = max(ans,tmp)\n else:\n tmp = 0\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579761000", "date2": "1579761538", "bleu_score": "0.622389666954574", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "VUKJNIHT\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["gene = [\"A\",\"T\",\"G\",\"C\"] # (0): gene=['A', 'T', 'G', 'C']\ndef is_gene(i): # (1): is_gene=\n if i in gene: # (7): gene=['A', 'T', 'G', 'C'], is_gene=, S=VUKJNIHT, ans=0, tmp=0 (12): gene=['A', 'T', 'G', 'C'], is_gene=, S=VUKJNIHT, ans=0, tmp=0 ... (42): gene=['A', 'T', 'G', 'C'], is_gene=, S=VUKJNIHT, ans=0, tmp=0\n return True\n else:\n return False\n\nS = input() # (2): S=VUKJNIHT\n\nans = 0 # (3): ans=0\ntmp = 0 # (4): tmp=0\n\nfor i in S: # (5): i=V (10): i=U ... (44): NO CHANGE\n if is_gene(i): # (6): NO CHANGE (11): NO CHANGE ... (41): NO CHANGE\n tmp += 1 # (43): tmp=1\n else:\n ans = max(ans,tmp) # (8): NO CHANGE (13): NO CHANGE ... (38): NO CHANGE\n tmp = 0 # (9): NO CHANGE (14): NO CHANGE ... (39): NO CHANGE\n\nprint(ans)"], "anno_status": [true], "diff_content": " gene = [\"A\",\"T\",\"G\",\"C\"]\n-def is_gene(i):\n- if i in gene:\n- return True\n- else:\n- return False\n \n-S = input()\n+S = list(input())\n \n ans = 0\n tmp = 0\n \n-for i in S:\n- if is_gene(i):\n+for i in range(len(S)):\n+ if S[i] in gene:\n tmp += 1\n- else:\n ans = max(ans,tmp)\n+ else:\n tmp = 0\n \n print(ans)\n", "FL_content": " gene = [\"A\",\"T\",\"G\",\"C\"]\n-def is_gene(i):\n- if i in gene:\n- return True\n- else:\n- return False\n \n-S = input()\n \n ans = 0\n tmp = 0\n \n-for i in S:\n- if is_gene(i):\n tmp += 1\n- else:\n ans = max(ans,tmp)\n tmp = 0\n \n print(ans)\n", "added_lines": 4, "removed_lines": 9, "code1_lines": 20 }, { "user_id": "u230621983", "problem_id": "p03086", "submission1_id": "s910137367", "submission2_id": "s541739552", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\ntmp=0\nans=0\nfor s in S:\n if s in 'ACGT':\n tmp+=1\n else:\n ans = max(ans,tmp)\n tmp=0\nprint(ans)", "code2": "S = input()\ntmp=0\nans=0\nfor s in S:\n if s in 'ACGT':\n tmp+=1\n else:\n tmp=0\n ans = max(ans,tmp)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577920960", "date2": "1577921337", "bleu_score": "0.9669859986221173", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "REBPCTA\n", "actual_output": "0\n", "expected_output": "3\n\n", "anno_code": ["S = input() # (0): S=REBPCTA\ntmp=0 # (1): tmp=0\nans=0 # (2): ans=0\nfor s in S: # (3): s=R (7): s=E ... (28): NO CHANGE\n if s in 'ACGT': # (4): NO CHANGE (8): NO CHANGE ... (26): NO CHANGE\n tmp+=1 # (21): tmp=1 (24): tmp=2 (27): tmp=3\n else:\n ans = max(ans,tmp) # (5): NO CHANGE (9): NO CHANGE ... (17): NO CHANGE\n tmp=0 # (6): NO CHANGE (10): NO CHANGE ... (18): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " S = input()\n tmp=0\n ans=0\n for s in S:\n if s in 'ACGT':\n tmp+=1\n else:\n- ans = max(ans,tmp)\n tmp=0\n+ ans = max(ans,tmp)\n print(ans)\n", "FL_content": " S = input()\n tmp=0\n ans=0\n for s in S:\n if s in 'ACGT':\n tmp+=1\n else:\n- ans = max(ans,tmp)\n tmp=0\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u655110382", "problem_id": "p03086", "submission1_id": "s706954484", "submission2_id": "s315615766", "status1": "Wrong Answer", "status2": "Accepted", "code1": "mx = 0\nS = input()\ntmp = 0\nfor ch in S:\n if ch in \"ATCG\":\n tmp += 1\n else:\n mx = max(tmp, mx)\n tmp = 0\n\nprint(mx)\n", "code2": "mx = 0\nS = input()\ntmp = 0\nfor ch in S:\n if ch in \"ATCG\":\n tmp += 1\n else:\n mx = max(tmp, mx)\n tmp = 0\n\nmx = max(tmp, mx)\nprint(mx)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559851215", "date2": "1559851328", "bleu_score": "0.8865189569431954", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "VKUJNIHT\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["mx = 0 # (0): mx=0\nS = input() # (1): S=VKUJNIHT\ntmp = 0 # (2): tmp=0\nfor ch in S: # (3): ch=V (7): ch=K ... (34): NO CHANGE\n if ch in \"ATCG\": # (4): NO CHANGE (8): NO CHANGE ... (32): NO CHANGE\n tmp += 1 # (33): tmp=1\n else:\n mx = max(tmp, mx) # (5): NO CHANGE (9): NO CHANGE ... (29): NO CHANGE\n tmp = 0 # (6): NO CHANGE (10): NO CHANGE ... (30): NO CHANGE\n\nprint(mx)\n"], "anno_status": [true], "diff_content": " mx = 0\n S = input()\n tmp = 0\n for ch in S:\n if ch in \"ATCG\":\n tmp += 1\n else:\n mx = max(tmp, mx)\n tmp = 0\n \n+mx = max(tmp, mx)\n print(mx)\n-\n", "FL_content": " mx = 0\n S = input()\n tmp = 0\n for ch in S:\n if ch in \"ATCG\":\n tmp += 1\n else:\n mx = max(tmp, mx)\n tmp = 0\n \n print(mx)\n-\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u439009525", "problem_id": "p03086", "submission1_id": "s882222990", "submission2_id": "s997963485", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nans = 0\ncnt = 0\nfor s in S:\n if (s in 'ATCG'):\n cnt += 1\n else:\n ans = max(ans, cnt)\n cnt = 0\nprint(ans)\n", "code2": "S = input()\nans = 0\ncnt = 0\nfor s in S:\n if (s in 'ATCG'):\n cnt += 1\n else:\n ans = max(ans, cnt)\n cnt = 0\nprint(max(ans, cnt))\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1571658186", "date2": "1571658262", "bleu_score": "0.9211670167507197", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "JUKVNIHT\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["S = input() # (0): S=JUKVNIHT\nans = 0 # (1): ans=0\ncnt = 0 # (2): cnt=0\nfor s in S: # (3): s=J (7): s=U ... (34): NO CHANGE\n if (s in 'ATCG'): # (4): NO CHANGE (8): NO CHANGE ... (32): NO CHANGE\n cnt += 1 # (33): cnt=1\n else:\n ans = max(ans, cnt) # (5): NO CHANGE (9): NO CHANGE ... (29): NO CHANGE\n cnt = 0 # (6): NO CHANGE (10): NO CHANGE ... (30): NO CHANGE\nprint(ans)\n"], "anno_status": [true], "diff_content": " S = input()\n ans = 0\n cnt = 0\n for s in S:\n if (s in 'ATCG'):\n cnt += 1\n else:\n ans = max(ans, cnt)\n cnt = 0\n-print(ans)\n+print(max(ans, cnt))\n \n", "FL_content": " S = input()\n ans = 0\n cnt = 0\n for s in S:\n if (s in 'ATCG'):\n cnt += 1\n else:\n ans = max(ans, cnt)\n cnt = 0\n-print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u125269142", "problem_id": "p03086", "submission1_id": "s664501168", "submission2_id": "s625506222", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\nmax = 0\ncnt = 0\n\nfor i in range(len(s)):\n if s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T':\n cnt += 1\n if max < cnt:\n max = cnt\n else:\n cnt = 0\n\nprint(max)", "code2": "s = input()\n\nmax = 0\ncnt = 0\n\nfor i in range(len(s)):\n if s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T':\n cnt += 1\n if max < cnt:\n max = cnt\n else:\n cnt = 0\n\nprint(max)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597614510", "date2": "1597614633", "bleu_score": "0.9547175896106327", "code1_test_status": [1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 76, "total_score": 103, "input": "AYCH@TAH\n", "actual_output": "4\n", "expected_output": "2\n\n", "anno_code": ["s = input() # (0): s=AYCH@TAH\n\nmax = 0 # (1): max=0\ncnt = 0 # (2): cnt=0\n\nfor i in range(len(s)): # (3): i=0 (8): i=1 ... (31): NO CHANGE\n if s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T': # (4): NO CHANGE (9): NO CHANGE ... (30): NO CHANGE\n cnt += 1 # (5): cnt=1 (12): cnt=2 ... (26): cnt=4\n if max < cnt: # (6): NO CHANGE (13): NO CHANGE ... (27): NO CHANGE\n max = cnt # (7): max=1 (14): max=2 ... (28): max=4\n else:\n cnt = 0\n\nprint(max)"], "anno_status": [true], "diff_content": " s = input()\n \n max = 0\n cnt = 0\n \n for i in range(len(s)):\n if s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T':\n cnt += 1\n if max < cnt:\n max = cnt\n- else:\n- cnt = 0\n+ else:\n+ cnt = 0\n \n print(max)\n+\n", "FL_content": " s = input()\n \n max = 0\n cnt = 0\n \n for i in range(len(s)):\n if s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T':\n cnt += 1\n if max < cnt:\n max = cnt\n- else:\n- cnt = 0\n \n print(max)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 14 }, { "user_id": "u453055089", "problem_id": "p03086", "submission1_id": "s747901466", "submission2_id": "s428926730", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\ncount = 0\ncount_list =[0]\nfor i in range(len(s)):\n if s[i] == \"A\" or s[i] == \"C\" or s[i] == \"G\" or s[i] == \"T\":\n count += 1\n else:\n count_list.append(count)\n count = 0\n\nprint(max(count_list))", "code2": "s = input()\n\ncount = 0\ncount_list = [0]\nfor i in range(len(s)):\n if s[i] == \"A\" or s[i] == \"C\" or s[i] == \"G\" or s[i] == \"T\":\n count += 1\n else:\n count_list.append(count)\n count = 0\ncount_list.append(count)\nprint(max(count_list))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586877356", "date2": "1586878584", "bleu_score": "0.8898913472431736", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "VUKJNIHT\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["s = input() # (0): s=VUKJNIHT\n\ncount = 0 # (1): count=0\ncount_list =[0] # (2): count_list=[0]\nfor i in range(len(s)): # (3): i=0 (7): i=1 ... (34): NO CHANGE\n if s[i] == \"A\" or s[i] == \"C\" or s[i] == \"G\" or s[i] == \"T\": # (4): NO CHANGE (8): NO CHANGE ... (32): NO CHANGE\n count += 1 # (33): count=1\n else:\n count_list.append(count) # (5): count_list=[0, 0] (9): count_list=[0, 0, 0] ... (29): count_list=[0, 0, 0, 0, 0, 0, 0, 0]\n count = 0 # (6): NO CHANGE (10): NO CHANGE ... (30): NO CHANGE\n\nprint(max(count_list))"], "anno_status": [true], "diff_content": " s = input()\n \n count = 0\n-count_list =[0]\n+count_list = [0]\n for i in range(len(s)):\n if s[i] == \"A\" or s[i] == \"C\" or s[i] == \"G\" or s[i] == \"T\":\n count += 1\n else:\n count_list.append(count)\n count = 0\n-\n+count_list.append(count)\n print(max(count_list))\n", "FL_content": " s = input()\n \n count = 0\n-count_list =[0]\n for i in range(len(s)):\n if s[i] == \"A\" or s[i] == \"C\" or s[i] == \"G\" or s[i] == \"T\":\n count += 1\n else:\n count_list.append(count)\n count = 0\n-\n print(max(count_list))\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 12 }, { "user_id": "u787456042", "problem_id": "p03086", "submission1_id": "s208501426", "submission2_id": "s880809509", "status1": "Wrong Answer", "status2": "Accepted", "code1": "m = a = 0\nfor c in input():\n if c in \"ATGC\": m+=1\n else: a = max(a, m); m = 0\nelse: print(a)", "code2": "m = a = 0\nfor c in input():\n if c in \"ATGC\": m+=1\n else: a = max(a, m); m = 0\nelse: print(max(a, m))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566315132", "date2": "1566315181", "bleu_score": "0.9113508346069309", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "RDBPCTA\n", "actual_output": "0\n", "expected_output": "3\n\n", "anno_code": ["m = a = 0 # (0): m=0, a=0\nfor c in input(): # (1): c=R (4): c=D ... (19): NO CHANGE\n if c in \"ATGC\": m+=1 # (2): NO CHANGE (5): NO CHANGE ... (18): m=3\n else: a = max(a, m); m = 0 # (3): NO CHANGE (6): NO CHANGE ... (12): NO CHANGE\nelse: print(a)"], "anno_status": [true], "diff_content": " m = a = 0\n for c in input():\n if c in \"ATGC\": m+=1\n else: a = max(a, m); m = 0\n-else: print(a)\n+else: print(max(a, m))\n", "FL_content": " m = a = 0\n for c in input():\n if c in \"ATGC\": m+=1\n else: a = max(a, m); m = 0\n-else: print(a)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u984276646", "problem_id": "p03086", "submission1_id": "s800001472", "submission2_id": "s500050027", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nF = \"ATGC\"\ncnt = 0\nn = len(S)\nfor i in range(n-1):\n for j in range(i+1, n):\n flg = True\n for k in range(i, j):\n flg *= (S[k] in F)\n if flg:\n cnt = max(cnt, j - i)\nprint(cnt)\n", "code2": "S = input()\nF = \"ATGC\"\ncnt = 0\nn = len(S)\nfor i in range(n):\n for j in range(i+1, n+1):\n flg = True\n for k in range(i, j):\n flg *= (S[k] in F)\n if flg:\n cnt = max(cnt, j - i)\nprint(cnt)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593684123", "date2": "1593684273", "bleu_score": "0.9840104453068924", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "JUKVNIHT\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["S = input() # (0): S=JUKVNIHT\nF = \"ATGC\" # (1): F=ATGC\ncnt = 0 # (2): cnt=0\nn = len(S) # (3): n=8\nfor i in range(n-1): # (4): i=0 (90): i=1 ... (298): NO CHANGE\n for j in range(i+1, n): # (5): j=1 (11): j=2 ... (297): NO CHANGE\n flg = True # (6): flg=True (12): flg=True ... (292): flg=True\n for k in range(i, j): # (7): k=0 (9): NO CHANGE ... (295): NO CHANGE\n flg *= (S[k] in F) # (8): flg=0 (14): flg=0 ... (294): flg=0\n if flg: # (10): NO CHANGE (18): NO CHANGE ... (296): NO CHANGE\n cnt = max(cnt, j - i)\nprint(cnt)\n"], "anno_status": [true], "diff_content": " S = input()\n F = \"ATGC\"\n cnt = 0\n n = len(S)\n-for i in range(n-1):\n- for j in range(i+1, n):\n+for i in range(n):\n+ for j in range(i+1, n+1):\n flg = True\n for k in range(i, j):\n flg *= (S[k] in F)\n if flg:\n cnt = max(cnt, j - i)\n print(cnt)\n \n", "FL_content": " S = input()\n F = \"ATGC\"\n cnt = 0\n n = len(S)\n-for i in range(n-1):\n- for j in range(i+1, n):\n flg = True\n for k in range(i, j):\n flg *= (S[k] in F)\n if flg:\n cnt = max(cnt, j - i)\n print(cnt)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 13 }, { "user_id": "u032484849", "problem_id": "p03086", "submission1_id": "s331553719", "submission2_id": "s267389715", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\na,b=0,0\nfor i in range(len(s)):\n if s[i]==\"A\" or s[i]==\"C\" or s[i]==\"G\" or s[i]==\"T\":\n a+=1\n else:\n b=max(a,b)\n a=0\nprint(b)", "code2": "s=input()\na,b=0,0\nfor i in range(len(s)):\n if s[i]==\"A\" or s[i]==\"C\" or s[i]==\"G\" or s[i]==\"T\":\n a+=1\n else:\n b=max(a,b)\n a=0\nprint(max(a,b))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588156143", "date2": "1588156315", "bleu_score": "0.9504020545817945", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "JUKVMIHT\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["s=input() # (0): s=JUKVMIHT\na,b=0,0 # (1): a=0, b=0\nfor i in range(len(s)): # (2): i=0 (6): i=1 ... (33): NO CHANGE\n if s[i]==\"A\" or s[i]==\"C\" or s[i]==\"G\" or s[i]==\"T\": # (3): NO CHANGE (7): NO CHANGE ... (31): NO CHANGE\n a+=1 # (32): a=1\n else:\n b=max(a,b) # (4): NO CHANGE (8): NO CHANGE ... (28): NO CHANGE\n a=0 # (5): NO CHANGE (9): NO CHANGE ... (29): NO CHANGE\nprint(b)"], "anno_status": [true], "diff_content": " s=input()\n a,b=0,0\n for i in range(len(s)):\n if s[i]==\"A\" or s[i]==\"C\" or s[i]==\"G\" or s[i]==\"T\":\n a+=1\n else:\n b=max(a,b)\n a=0\n-print(b)\n+print(max(a,b))\n", "FL_content": " s=input()\n a,b=0,0\n for i in range(len(s)):\n if s[i]==\"A\" or s[i]==\"C\" or s[i]==\"G\" or s[i]==\"T\":\n a+=1\n else:\n b=max(a,b)\n a=0\n-print(b)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u404629709", "problem_id": "p03086", "submission1_id": "s298354113", "submission2_id": "s803740365", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=input()\nl=[\"A\",\"T\",\"C\",\"G\"]\nres=0\ncnt=0\n\nfor i in range(len(n)):\n if n[i] in l:\n if cnt>res:\n res=cnt\n cnt+=1\n else:\n if cnt>res:\n res=cnt\n cnt=0\n \nprint(res)", "code2": "n=input()\nl=[\"A\",\"T\",\"C\",\"G\"]\nres=0\ncnt=0\n\nfor i in range(len(n)):\n if n[i] in l:\n cnt+=1\n if cnt>res:\n res=cnt\n else:\n cnt=0\n if cnt>res:\n res=cnt\n \nprint(res)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553458544", "date2": "1553458723", "bleu_score": "0.9894737819195992", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 103, "input": "AXCH@TAH\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["n=input() # (0): n=AXCH@TAH\nl=[\"A\",\"T\",\"C\",\"G\"] # (1): l=['A', 'T', 'C', 'G']\nres=0 # (2): res=0\ncnt=0 # (3): cnt=0\n\nfor i in range(len(n)): # (4): i=0 (8): i=1 ... (37): NO CHANGE\n if n[i] in l: # (5): NO CHANGE (9): NO CHANGE ... (33): NO CHANGE\n if cnt>res: # (6): NO CHANGE (15): NO CHANGE ... (29): NO CHANGE\n res=cnt # (30): res=2\n cnt+=1 # (7): cnt=1 (16): cnt=1 ... (31): cnt=3\n else:\n if cnt>res: # (10): NO CHANGE (19): NO CHANGE ... (34): NO CHANGE\n res=cnt # (11): res=1 (35): res=3\n cnt=0 # (12): cnt=0 (36): cnt=0\n \nprint(res)"], "anno_status": [true], "diff_content": " n=input()\n l=[\"A\",\"T\",\"C\",\"G\"]\n res=0\n cnt=0\n \n for i in range(len(n)):\n if n[i] in l:\n+ cnt+=1\n if cnt>res:\n res=cnt\n- cnt+=1\n else:\n+ cnt=0\n if cnt>res:\n res=cnt\n- cnt=0\n \n print(res)\n", "FL_content": " n=input()\n l=[\"A\",\"T\",\"C\",\"G\"]\n res=0\n cnt=0\n \n for i in range(len(n)):\n if n[i] in l:\n if cnt>res:\n res=cnt\n- cnt+=1\n else:\n if cnt>res:\n res=cnt\n- cnt=0\n \n print(res)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 16 }, { "user_id": "u368796742", "problem_id": "p03377", "submission1_id": "s039117210", "submission2_id": "s597717387", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,x = map(int,input().split())\nprint(\"Yes\" if a+b >= x >= a else \"No\")", "code2": "a,b,x = map(int,input().split())\nprint(\"YES\" if (a+b >= x >= a) else \"NO\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580330599", "date2": "1580330713", "bleu_score": "0.8371896614457404", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 87, "input": "-5 -1 8\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["a,b,x = map(int,input().split()) # (0): a=-5, b=-1, x=8\nprint(\"Yes\" if a+b >= x >= a else \"No\")"], "anno_status": [true], "diff_content": " a,b,x = map(int,input().split())\n-print(\"Yes\" if a+b >= x >= a else \"No\")\n+print(\"YES\" if (a+b >= x >= a) else \"NO\")\n+\n", "FL_content": " a,b,x = map(int,input().split())\n-print(\"Yes\" if a+b >= x >= a else \"No\")\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u600261652", "problem_id": "p03377", "submission1_id": "s265319896", "submission2_id": "s282923603", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, X= map(int, input().split())\nprint(\"YES\" if A+B>=X else \"NO\")", "code2": "A, B, X= map(int, input().split())\nprint(\"YES\" if A<=X and A+B>=X else \"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588535160", "date2": "1588535280", "bleu_score": "0.8757109943391621", "code1_test_status": [1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0], "code1_test_score": 63, "total_score": 87, "input": "3 0 1\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["A, B, X= map(int, input().split()) # (0): A=3, B=0, X=1\nprint(\"YES\" if A+B>=X else \"NO\")"], "anno_status": [true], "diff_content": " A, B, X= map(int, input().split())\n-print(\"YES\" if A+B>=X else \"NO\")\n+print(\"YES\" if A<=X and A+B>=X else \"NO\")\n", "FL_content": " A, B, X= map(int, input().split())\n-print(\"YES\" if A+B>=X else \"NO\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u994521204", "problem_id": "p03377", "submission1_id": "s959852071", "submission2_id": "s337917275", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,x=map(int,input().split())\nif a<=x and x<=b:\n print('YES')\nelse:\n print('NO')", "code2": "a,b,x=map(int,input().split())\nif a<=x and x<=a+b:\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576245773", "date2": "1576245832", "bleu_score": "0.9577952806172931", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 83, "total_score": 87, "input": "3 1 3\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["a,b,x=map(int,input().split()) # (0): a=3, b=1, x=3\nif a<=x and x<=b: # (1): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " a,b,x=map(int,input().split())\n-if a<=x and x<=b:\n+if a<=x and x<=a+b:\n print('YES')\n else:\n print('NO')\n", "FL_content": " a,b,x=map(int,input().split())\n-if a<=x and x<=b:\n print('YES')\n else:\n print('NO')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u921773161", "problem_id": "p03377", "submission1_id": "s965403885", "submission2_id": "s866782527", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c = map(int,input().split())\nif c-a<=b:\n print('YES')\nelse:\n print('NO')", "code2": "a,b,c = map(int,input().split())\nif c>= a:\n if c-a<=b:\n print('YES')\n else:\n print('NO')\nelse :\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563756088", "date2": "1563756165", "bleu_score": "0.660079164358409", "code1_test_status": [1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0], "code1_test_score": 63, "total_score": 87, "input": "-1 4 -5\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["a,b,c = map(int,input().split()) # (0): a=-1, b=4, c=-5\nif c-a<=b: # (1): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " a,b,c = map(int,input().split())\n-if c-a<=b:\n- print('YES')\n-else:\n+if c>= a:\n+ if c-a<=b:\n+ print('YES')\n+ else:\n+ print('NO')\n+else :\n print('NO')\n", "FL_content": " a,b,c = map(int,input().split())\n-if c-a<=b:\n- print('YES')\n-else:\n print('NO')\n", "added_lines": 6, "removed_lines": 3, "code1_lines": 5 }, { "user_id": "u791664126", "problem_id": "p03377", "submission1_id": "s510826158", "submission2_id": "s023155850", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=map(int,input().split())\nprint('YNEOS'[bc::2])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1540179227", "date2": "1540180036", "bleu_score": "0.8588553141228454", "code1_test_status": [1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0], "code1_test_score": 63, "total_score": 87, "input": "3 0 2\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["a,b,c=map(int,input().split()) # (0): a=3, b=0, c=2\nprint('YNEOS'[bc::2])\n", "FL_content": " a,b,c=map(int,input().split())\n-print('YNEOS'[b=X:\n print('YES')\nelse: \n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1527881273", "date2": "1527881592", "bleu_score": "0.8469723058518124", "code1_test_status": [0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1], "code1_test_score": 37, "total_score": 87, "input": "-28 -1 4\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["A, B, X= map(int,input().split()) # (0): A=-28, B=-1, X=4\nif A <= X: # (1): NO CHANGE\n print('YES')\nelse: \n print('NO')\n"], "anno_status": [true], "diff_content": " A, B, X= map(int,input().split())\n-if A <= X:\n+if A <= X and A + B >=X:\n print('YES')\n else: \n print('NO')\n-\n", "FL_content": " A, B, X= map(int,input().split())\n-if A <= X:\n print('YES')\n else: \n print('NO')\n-\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u762471013", "problem_id": "p03377", "submission1_id": "s042682769", "submission2_id": "s051782709", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A,B,X=map(int,input().split())\nif A<=X<=B:\n print(\"YES\")\nelse:\n print(\"NO\")", "code2": "A,B,X=map(int,input().split())\nif A<=X<=A+B:\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1523754769", "date2": "1523754997", "bleu_score": "0.9567517979328872", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 83, "total_score": 87, "input": "3 0 3\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["A,B,X=map(int,input().split()) # (0): A=3, B=0, X=3\nif A<=X<=B: # (1): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")"], "anno_status": [true], "diff_content": " A,B,X=map(int,input().split())\n-if A<=X<=B:\n+if A<=X<=A+B:\n print(\"YES\")\n else:\n print(\"NO\")\n", "FL_content": " A,B,X=map(int,input().split())\n-if A<=X<=B:\n print(\"YES\")\n else:\n print(\"NO\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u178432859", "problem_id": "p03377", "submission1_id": "s433922922", "submission2_id": "s439232937", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, x = map(int, input().split())\nif a+b-1 >= x:\n print(\"YES\")\nelse:\n print(\"NO\")", "code2": "a, b, x = map(int, input().split())\nif a > x:\n print(\"NO\")\nelif a+b >= x:\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1578550337", "date2": "1578550460", "bleu_score": "0.739861677696476", "code1_test_status": [1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0], "code1_test_score": 60, "total_score": 87, "input": "4 1 1\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["a, b, x = map(int, input().split()) # (0): a=4, b=1, x=1\nif a+b-1 >= x: # (1): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")"], "anno_status": [true], "diff_content": " a, b, x = map(int, input().split())\n-if a+b-1 >= x:\n+if a > x:\n+ print(\"NO\")\n+elif a+b >= x:\n print(\"YES\")\n else:\n print(\"NO\")\n", "FL_content": " a, b, x = map(int, input().split())\n-if a+b-1 >= x:\n print(\"YES\")\n else:\n print(\"NO\")\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u401949008", "problem_id": "p03377", "submission1_id": "s760550309", "submission2_id": "s745043058", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,x=map(int,input().split())\nif b>=x-a:\n print(\"YES\")\nelse:\n print(\"NO\")", "code2": "a,b,x=map(int,input().split())\nif bx:\n print(\"NO\")\nelse:\n print(\"YES\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1578638088", "date2": "1578638693", "bleu_score": "0.8685878540900916", "code1_test_status": [1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0], "code1_test_score": 63, "total_score": 87, "input": "5 1 1\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["a,b,x=map(int,input().split()) # (0): a=5, b=1, x=1\nif b>=x-a: # (1): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")"], "anno_status": [true], "diff_content": " a,b,x=map(int,input().split())\n-if b>=x-a:\n- print(\"YES\")\n-else:\n+if bx:\n print(\"NO\")\n+else:\n+ print(\"YES\")\n", "FL_content": " a,b,x=map(int,input().split())\n-if b>=x-a:\n- print(\"YES\")\n-else:\n print(\"NO\")\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 5 }, { "user_id": "u421499233", "problem_id": "p03433", "submission1_id": "s942125315", "submission2_id": "s630501287", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = int(input())\nif N <= A:\n print(\"Yes\")\nelif N - 500 <= A:\n print (\"Yes\")\nelse:\n print(\"No\")\n ", "code2": "N = int(input())\nA = int(input())\nNs = N % 500\nif Ns <= A:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579654912", "date2": "1579655060", "bleu_score": "0.6609208720153253", "code1_test_status": [1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 93, "total_score": 103, "input": "37\n001\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["N = int(input()) # (0): N=37\nA = int(input()) # (1): A=1\nif N <= A: # (2): NO CHANGE\n print(\"Yes\")\nelif N - 500 <= A: # (3): NO CHANGE\n print (\"Yes\")\nelse:\n print(\"No\")\n "], "anno_status": [true], "diff_content": " N = int(input())\n A = int(input())\n-if N <= A:\n+Ns = N % 500\n+if Ns <= A:\n print(\"Yes\")\n-elif N - 500 <= A:\n- print (\"Yes\")\n else:\n print(\"No\")\n- \n", "FL_content": " N = int(input())\n A = int(input())\n-if N <= A:\n print(\"Yes\")\n-elif N - 500 <= A:\n- print (\"Yes\")\n else:\n print(\"No\")\n- \n", "added_lines": 2, "removed_lines": 4, "code1_lines": 9 }, { "user_id": "u607074939", "problem_id": "p03433", "submission1_id": "s790955937", "submission2_id": "s058504697", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = int(input())\nif(N%100 <= A):\n print('Yes')\nelse:\n print('No')", "code2": "N = int(input())\nA = int(input())\nif(N%500 <= A):\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582175984", "date2": "1582176199", "bleu_score": "0.9708351611332822", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "2763\n84\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["N = int(input()) # (0): N=2763\nA = int(input()) # (1): A=84\nif(N%100 <= A): # (2): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " N = int(input())\n A = int(input())\n-if(N%100 <= A):\n+if(N%500 <= A):\n print('Yes')\n else:\n print('No')\n", "FL_content": " N = int(input())\n A = int(input())\n-if(N%100 <= A):\n print('Yes')\n else:\n print('No')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u989306199", "problem_id": "p03433", "submission1_id": "s433503567", "submission2_id": "s512161159", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input()) \na = int(input())\n\nprint('Yes' if 0 <= n <= a else 'No')", "code2": "n = int(input())\na = int(input())\n\nn %= 500\n\nprint('Yes' if 0 <= n <= a else 'No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587878452", "date2": "1587878616", "bleu_score": "0.8459487532761104", "code1_test_status": [1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 97, "total_score": 103, "input": "2018\n110\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["n = int(input()) # (0): n=2018\na = int(input()) # (1): a=110\n\nprint('Yes' if 0 <= n <= a else 'No')"], "anno_status": [true], "diff_content": "-n = int(input()) \n+n = int(input())\n a = int(input())\n \n+n %= 500\n+\n print('Yes' if 0 <= n <= a else 'No')\n+\n", "FL_content": "-n = int(input()) \n a = int(input())\n \n print('Yes' if 0 <= n <= a else 'No')\n", "added_lines": 4, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u595375942", "problem_id": "p03433", "submission1_id": "s808659918", "submission2_id": "s617116672", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nX=int(input())\nc=N&500\nans='Yes' if c <= X else 'No'\nprint(ans)", "code2": "N=int(input())\nX=int(input())\nc=N%500\nans='Yes' if c <= X else 'No'\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575755286", "date2": "1575755399", "bleu_score": "0.9669816961515574", "code1_test_status": [1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 97, "total_score": 103, "input": "2018\n101\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N=int(input()) # (0): N=2018\nX=int(input()) # (1): X=101\nc=N&500 # (2): c=480\nans='Yes' if c <= X else 'No' # (3): ans=No\nprint(ans)"], "anno_status": [true], "diff_content": " N=int(input())\n X=int(input())\n-c=N&500\n+c=N%500\n ans='Yes' if c <= X else 'No'\n print(ans)\n", "FL_content": " N=int(input())\n X=int(input())\n-c=N&500\n ans='Yes' if c <= X else 'No'\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u391875425", "problem_id": "p03433", "submission1_id": "s834733603", "submission2_id": "s491830108", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nA=int(input())\nif(A!=0):\n if(N%A<=A):\n print(\"Yes\")\nelif(N%500==0):\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "N=int(input())\nA=int(input())\nif(A!=0):\n if(N%500<=A):\n print(\"Yes\")\n else:\n print(\"No\")\nelif(N%500==0):\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1519006358", "date2": "1519006750", "bleu_score": "0.8040005618911951", "code1_test_status": [0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 26, "total_score": 103, "input": "2763\n-196\n", "actual_output": "no output\n", "expected_output": "No\n\n", "anno_code": ["N=int(input()) # (0): N=2763\nA=int(input()) # (1): A=-196\nif(A!=0): # (2): NO CHANGE\n if(N%A<=A):\n print(\"Yes\")\nelif(N%500==0):\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " N=int(input())\n A=int(input())\n if(A!=0):\n- if(N%A<=A):\n+ if(N%500<=A):\n print(\"Yes\")\n+ else:\n+ print(\"No\")\n elif(N%500==0):\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " N=int(input())\n A=int(input())\n if(A!=0):\n- if(N%A<=A):\n print(\"Yes\")\n elif(N%500==0):\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u979075927", "problem_id": "p03433", "submission1_id": "s743573036", "submission2_id": "s626017916", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = int(input())\n\nn \nif n <= a:\n print(\"Yes\")\nelse:\n print('No')", "code2": "n = int(input())\na = int(input())\n\nn %= 500\nif n <= a:\n print(\"Yes\")\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1519005705", "date2": "1519005772", "bleu_score": "0.917775907756491", "code1_test_status": [1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 97, "total_score": 103, "input": "2018\n110\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["n = int(input()) # (0): n=2018\na = int(input()) # (1): a=110\n\nn # (2): NO CHANGE\nif n <= a: # (3): NO CHANGE\n print(\"Yes\")\nelse:\n print('No')"], "anno_status": [true], "diff_content": " n = int(input())\n a = int(input())\n \n-n \n+n %= 500\n if n <= a:\n print(\"Yes\")\n else:\n print('No')\n", "FL_content": " n = int(input())\n a = int(input())\n \n-n \n if n <= a:\n print(\"Yes\")\n else:\n print('No')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u673173160", "problem_id": "p03433", "submission1_id": "s287707584", "submission2_id": "s929272690", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = input()\ns = int(input())\nn1 = int(n[-2] + n[-1])\nif n1 <= s:\n print('Yes')\nelse:\n print('No')", "code2": "n = int(input())\ns = int(input())\nif n%500 <= s:\n print('Yes')\nelse:\n print('No')", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1576427169", "date2": "1576427268", "bleu_score": "0.7454472094374568", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "2763\n84\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["n = input() # (0): n=2763\ns = int(input()) # (1): s=84\nn1 = int(n[-2] + n[-1]) # (2): n1=63\nif n1 <= s: # (3): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": "-n = input()\n+n = int(input())\n s = int(input())\n-n1 = int(n[-2] + n[-1])\n-if n1 <= s:\n+if n%500 <= s:\n print('Yes')\n else:\n print('No')\n", "FL_content": "-n = input()\n s = int(input())\n-n1 = int(n[-2] + n[-1])\n-if n1 <= s:\n print('Yes')\n else:\n print('No')\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 7 }, { "user_id": "u190079347", "problem_id": "p03433", "submission1_id": "s062215171", "submission2_id": "s997369149", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = int(input())\nif n % 500 <= a:\n print(\"YES\")\nelse:\n print(\"NO\")", "code2": "n = int(input())\na = int(input())\nif n % 500 <= a:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588188439", "date2": "1588188482", "bleu_score": "0.9305163849527504", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "2763\n-30\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["n = int(input()) # (0): n=2763\na = int(input()) # (1): a=-30\nif n % 500 <= a: # (2): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")"], "anno_status": [true], "diff_content": " n = int(input())\n a = int(input())\n if n % 500 <= a:\n- print(\"YES\")\n+ print(\"Yes\")\n else:\n- print(\"NO\")\n+ print(\"No\")\n", "FL_content": " n = int(input())\n a = int(input())\n if n % 500 <= a:\n- print(\"YES\")\n else:\n- print(\"NO\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u629276590", "problem_id": "p03433", "submission1_id": "s286307275", "submission2_id": "s630122796", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=int(input())\n\nif n%500>a:\n print(\"NO\")\nelse:\n print(\"YES\")", "code2": "n=int(input())\na=int(input())\n\nif n%500>a:\n print(\"No\")\nelse:\n print(\"Yes\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591581656", "date2": "1591581842", "bleu_score": "0.926984400216861", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "2018\n113\n", "actual_output": "YES\n", "expected_output": "Yes\n\n", "anno_code": ["n=int(input()) # (0): n=2018\na=int(input()) # (1): a=113\n\nif n%500>a: # (2): NO CHANGE\n print(\"NO\")\nelse:\n print(\"YES\")"], "anno_status": [true], "diff_content": " n=int(input())\n a=int(input())\n \n if n%500>a:\n- print(\"NO\")\n+ print(\"No\")\n else:\n- print(\"YES\")\n+ print(\"Yes\")\n", "FL_content": " n=int(input())\n a=int(input())\n \n if n%500>a:\n- print(\"NO\")\n else:\n- print(\"YES\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u760636024", "problem_id": "p03433", "submission1_id": "s208644856", "submission2_id": "s884072091", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = int(input())\nif N > 1000:\n N = N%1000\nif N >= A:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "N = int(input())\nA = int(input())\nif N > 1000:\n N = N%1000\nif N <= A:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589106707", "date2": "1589106797", "bleu_score": "0.9770064524882032", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "2018\n000\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["N = int(input()) # (0): N=2018\nA = int(input()) # (1): A=0\nif N > 1000: # (2): NO CHANGE\n N = N%1000 # (3): N=18\nif N >= A: # (4): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " N = int(input())\n A = int(input())\n if N > 1000:\n N = N%1000\n-if N >= A:\n+if N <= A:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " N = int(input())\n A = int(input())\n if N > 1000:\n N = N%1000\n-if N >= A:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u634490486", "problem_id": "p02415", "submission1_id": "s794930503", "submission2_id": "s244700311", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\n\ns = list(stdin.readline())\nprint(s)\nfor i in range(len(s)):\n if s[i].islower():\n s[i] = s[i].upper()\n elif s[i].isupper():\n s[i] = s[i].lower()\n\nprint(*s, sep=\"\")\n", "code2": "from sys import stdin\n\ns = list(stdin.readline())\nfor i in range(len(s)):\n if s[i].islower():\n s[i] = s[i].upper()\n elif s[i].isupper():\n s[i] = s[i].lower()\n\nprint(*s, sep=\"\", end=\"\")\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1546098484", "date2": "1546098595", "bleu_score": "0.955986868610191", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "R@g,H GQKT-@ AKK@YOISOCBN BPDUWJ.\n", "actual_output": "['R', '@', 'g', ',', 'H', ' ', 'G', 'Q', 'K', 'T', '-', '@', ' ', 'A', 'K', 'K', '@', 'Y', 'O', 'I', 'S', 'O', 'C', 'B', 'N', ' ', 'B', 'P', 'D', 'U', 'W', 'J', '.', '\\n']\nr@G,h gqkt-@ akk@yoisocbn bpduwj.\n\n", "expected_output": "r@G,h gqkt-@ akk@yoisocbn bpduwj.\n\n", "anno_code": ["from sys import stdin\n\ns = list(stdin.readline()) # (0): s=[R, @, ..., ., \n]\nprint(s) # (1): NO CHANGE\nfor i in range(len(s)): # (2): i=0 (6): i=1 ... (127): NO CHANGE\n if s[i].islower(): # (3): NO CHANGE (7): NO CHANGE ... (125): NO CHANGE\n s[i] = s[i].upper() # (11): s=[r, @, ..., ., \n]\n elif s[i].isupper(): # (4): NO CHANGE (8): NO CHANGE ... (126): NO CHANGE\n s[i] = s[i].lower() # (5): s=[r, @, ..., ., \n] (18): s=[r, @, ..., ., \n] ... (120): s=[r, @, ..., ., \n]\n\nprint(*s, sep=\"\")\n"], "anno_status": [true], "diff_content": " from sys import stdin\n \n s = list(stdin.readline())\n-print(s)\n for i in range(len(s)):\n if s[i].islower():\n s[i] = s[i].upper()\n elif s[i].isupper():\n s[i] = s[i].lower()\n \n-print(*s, sep=\"\")\n+print(*s, sep=\"\", end=\"\")\n \n", "FL_content": " from sys import stdin\n \n s = list(stdin.readline())\n-print(s)\n for i in range(len(s)):\n if s[i].islower():\n s[i] = s[i].upper()\n elif s[i].isupper():\n s[i] = s[i].lower()\n \n-print(*s, sep=\"\")\n \n", "added_lines": 1, "removed_lines": 2, "code1_lines": 12 }, { "user_id": "u184749404", "problem_id": "p02415", "submission1_id": "s279153729", "submission2_id": "s739815940", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nS.capitalize()\nprint(S.capitalize())\n\n", "code2": "S = input()\nS.swapcase()\nprint(S.swapcase())\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1545909864", "date2": "1545909936", "bleu_score": "0.6142302087272563", "code1_test_status": [1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 13, "total_score": 101, "input": "R@gH, K@FSQ, ALKAYOISOCBN BK.UWPD\n", "actual_output": "R@gh, k@fsq, alkayoisocbn bk.uwpd\n", "expected_output": "r@Gh, k@fsq, alkayoisocbn bk.uwpd\n\n", "anno_code": ["S = input() # (0): S=R@gH, K@FSQ, ALKAYOISOCBN BK.UWPD\nS.capitalize() # (1): NO CHANGE\nprint(S.capitalize())\n\n"], "anno_status": [true], "diff_content": " S = input()\n-S.capitalize()\n-print(S.capitalize())\n+S.swapcase()\n+print(S.swapcase())\n \n \n", "FL_content": " S = input()\n-S.capitalize()\n-print(S.capitalize())\n \n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u204883389", "problem_id": "p02415", "submission1_id": "s747234247", "submission2_id": "s766223270", "status1": "Wrong Answer", "status2": "Accepted", "code1": "str = \" \";\nprint(str.swapcase())", "code2": "s = input()\nprint(s.swapcase())", "original_language1": "Python3", "original_language2": "Python3", "date1": "1470270746", "date2": "1470285699", "bleu_score": "0.6100529007280512", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "R@gH, G,KSQ@ AKK@YOISOCBN .PWUDKB\n", "actual_output": "no output\n", "expected_output": "r@Gh, g,ksq@ akk@yoisocbn .pwudkb\n\n", "anno_code": ["str = \" \"; # (0): str= \nprint(str.swapcase())"], "anno_status": [true], "diff_content": "-str = \" \";\n-print(str.swapcase())\n+s = input()\n+print(s.swapcase())\n", "FL_content": "-str = \" \";\n-print(str.swapcase())\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 2 }, { "user_id": "u720674978", "problem_id": "p02415", "submission1_id": "s814805313", "submission2_id": "s543043180", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print(input().swapcase)\n", "code2": "print(input().swapcase())\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1540250572", "date2": "1540250589", "bleu_score": "0.8647513948254395", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "GAg,U HAQI-T AKK@YBJRODPN BKWUD1Q\n", "actual_output": "\n", "expected_output": "gaG,u haqi-t akk@ybjrodpn bkwud1q\n\n", "anno_code": ["print(input().swapcase)\n"], "anno_status": [true], "diff_content": "-print(input().swapcase)\n+print(input().swapcase())\n \n", "FL_content": "-print(input().swapcase)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u671553883", "problem_id": "p02415", "submission1_id": "s737173169", "submission2_id": "s430737126", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print(input().upper())", "code2": "print(input().swapcase())", "original_language1": "Python3", "original_language2": "Python3", "date1": "1470207306", "date2": "1470207615", "bleu_score": "0.6052987576779449", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "RHg@, G-IQTA AKK@YPIRODBN B/WUDKP\n", "actual_output": "RHG@, G-IQTA AKK@YPIRODBN B/WUDKP\n", "expected_output": "rhG@, g-iqta akk@ypirodbn b/wudkp\n\n", "anno_code": ["print(input().upper())"], "anno_status": [true], "diff_content": "-print(input().upper())\n+print(input().swapcase())\n", "FL_content": "-print(input().upper())\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u313089641", "problem_id": "p02415", "submission1_id": "s946877299", "submission2_id": "s541694627", "status1": "Wrong Answer", "status2": "Accepted", "code1": "sen = input()\nprint(sen.capitalize())\n", "code2": "sen = input()\nprint(sen.swapcase())\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526402982", "date2": "1526403376", "bleu_score": "0.7471823835236957", "code1_test_status": [1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 13, "total_score": 101, "input": ",RI@g KATFR, OLKANOISACCY CLOUDX.\n", "actual_output": ",ri@g katfr, olkanoisaccy cloudx.\n", "expected_output": ",ri@G katfr, olkanoisaccy cloudx.\n\n", "anno_code": ["sen = input() # (0): sen=,RI@g KATFR, OLKANOISACCY CLOUDX.\nprint(sen.capitalize())\n"], "anno_status": [true], "diff_content": " sen = input()\n-print(sen.capitalize())\n+print(sen.swapcase())\n \n", "FL_content": " sen = input()\n-print(sen.capitalize())\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u662822413", "problem_id": "p02415", "submission1_id": "s932284872", "submission2_id": "s522132452", "status1": "Wrong Answer", "status2": "Accepted", "code1": "Target=input()\nTarget.swapcase()\nprint(Target)\n\n", "code2": "target=input()\nAns=target.swapcase()\nprint(Ans)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556546099", "date2": "1556546462", "bleu_score": "0.7488301054553232", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "R,g@H G-IQTA AKK@YPISODBN B/WUDKP\n", "actual_output": "R,g@H G-IQTA AKK@YPISODBN B/WUDKP\n", "expected_output": "r,G@h g-iqta akk@ypisodbn b/wudkp\n\n", "anno_code": ["Target=input() # (0): Target=R,g@H G-IQTA AKK@YPISODBN B/WUDKP\nTarget.swapcase() # (1): NO CHANGE\nprint(Target)\n\n"], "anno_status": [true], "diff_content": "-Target=input()\n-Target.swapcase()\n-print(Target)\n+target=input()\n+Ans=target.swapcase()\n+print(Ans)\n \n \n", "FL_content": "-Target=input()\n-Target.swapcase()\n-print(Target)\n \n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 5 }, { "user_id": "u682153677", "problem_id": "p02415", "submission1_id": "s604130553", "submission2_id": "s027995764", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nchar = input()\n\nchar.swapcase()\n\nprint(char)\n", "code2": "\n\nchar = input()\nprint(char.swapcase())\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1523707138", "date2": "1523707194", "bleu_score": "0.7940125721212544", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "HAg,S A-IQTH AKK@YPJRODBN BKWUD1Q\n", "actual_output": "HAg,S A-IQTH AKK@YPJRODBN BKWUD1Q\n", "expected_output": "haG,s a-iqth akk@ypjrodbn bkwud1q\n\n", "anno_code": ["\n\nchar = input() # (0): char=HAg,S A-IQTH AKK@YPJRODBN BKWUD1Q\n\nchar.swapcase() # (1): NO CHANGE\n\nprint(char)\n"], "anno_status": [true], "diff_content": " \n \n char = input()\n-\n-char.swapcase()\n-\n-print(char)\n+print(char.swapcase())\n \n", "FL_content": " \n \n char = input()\n-\n-char.swapcase()\n-\n-print(char)\n \n", "added_lines": 1, "removed_lines": 4, "code1_lines": 8 }, { "user_id": "u313600138", "problem_id": "p02415", "submission1_id": "s448769392", "submission2_id": "s191492663", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nfor c in s:\n if 'A' <= c and c <= 'Z':\n print(c.lower(), end='')\n elif 'a' <= c and c <= 'z':\n print(c.upper(), end='')\n else:\n print(c)\n", "code2": "s=input()\nfor c in s:\n if 'A' <= c and c <= 'Z':\n print(c.lower(), end='')\n elif 'a' <= c and c <= 'z':\n print(c.upper(), end='')\n else:\n print(c,end='')\nprint()\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1559544212", "date2": "1559544265", "bleu_score": "0.9057478707429393", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "g@RI, ,QSF@K OLKANOISACCY B.KUXPD\n", "actual_output": "G@\nri,\n \n,\nqsf@\nk \nolkanoisaccy \nb.\nkuxpd", "expected_output": "G@ri, ,qsf@k olkanoisaccy b.kuxpd\n\n", "anno_code": ["s=input() # (0): s=g@RI, ,QSF@K OLKANOISACCY B.KUXPD\nfor c in s: # (1): c=g (5): c=@ ... (106): c=D\n if 'A' <= c and c <= 'Z': # (2): NO CHANGE (6): NO CHANGE ... (107): NO CHANGE\n print(c.lower(), end='') # (11): NO CHANGE (14): NO CHANGE ... (108): NO CHANGE\n elif 'a' <= c and c <= 'z': # (3): NO CHANGE (7): NO CHANGE ... (92): NO CHANGE\n print(c.upper(), end='') # (4): NO CHANGE\n else:\n print(c) # (8): NO CHANGE (18): NO CHANGE ... (93): NO CHANGE\n"], "anno_status": [true], "diff_content": " s=input()\n for c in s:\n if 'A' <= c and c <= 'Z':\n print(c.lower(), end='')\n elif 'a' <= c and c <= 'z':\n print(c.upper(), end='')\n else:\n- print(c)\n+ print(c,end='')\n+print()\n \n", "FL_content": " s=input()\n for c in s:\n if 'A' <= c and c <= 'Z':\n print(c.lower(), end='')\n elif 'a' <= c and c <= 'z':\n print(c.upper(), end='')\n else:\n- print(c)\n \n", "added_lines": 2, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u391228754", "problem_id": "p02415", "submission1_id": "s527093047", "submission2_id": "s174939479", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = input()\na.swapcase()\nprint(a)", "code2": "print(input().swapcase())", "original_language1": "Python3", "original_language2": "Python3", "date1": "1475572024", "date2": "1475572317", "bleu_score": "0.6002485102728093", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "R?g,H GQKT-@ AKK@YOISOCBN BPWUDK/\n", "actual_output": "R?g,H GQKT-@ AKK@YOISOCBN BPWUDK/\n", "expected_output": "r?G,h gqkt-@ akk@yoisocbn bpwudk/\n\n", "anno_code": ["a = input() # (0): a=R?g,H GQKT-@ AKK@YOISOCBN BPWUDK/\na.swapcase() # (1): NO CHANGE\nprint(a)"], "anno_status": [true], "diff_content": "-a = input()\n-a.swapcase()\n-print(a)\n+print(input().swapcase())\n", "FL_content": "-a = input()\n-a.swapcase()\n-print(a)\n", "added_lines": 1, "removed_lines": 3, "code1_lines": 3 }, { "user_id": "u919521780", "problem_id": "p03556", "submission1_id": "s559398377", "submission2_id": "s949508386", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nans = 0\n\nwhile True:\n\tif ans * ans >= n:\n\t\tbreak\n\tans += 1\n\t\nprint(ans*ans)\n\t", "code2": "n = int(input())\nans = 0\n\nwhile True:\n\tif ans * ans > n:\n\t\tbreak\n\tans += 1\n\t\nprint((ans-1)*(ans-1))\n\t", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1542063706", "date2": "1542063845", "bleu_score": "0.8575094561872634", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 83, "input": "385753315\n", "actual_output": "385768881\n", "expected_output": "385729600\n\n", "anno_code": ["n = int(input()) # (0): n=385753315\nans = 0 # (1): ans=0\n\nwhile True: # (2): NO CHANGE (5): NO CHANGE ... (58925): NO CHANGE\n\tif ans * ans >= n: # (3): NO CHANGE (6): NO CHANGE ... (58926): NO CHANGE\n\t\tbreak # (58927): NO CHANGE\n\tans += 1 # (4): ans=1 (7): ans=2 ... (58924): ans=19641\n\t\nprint(ans*ans)\n\t"], "anno_status": [true], "diff_content": " n = int(input())\n ans = 0\n \n while True:\n-\tif ans * ans >= n:\n+\tif ans * ans > n:\n \t\tbreak\n \tans += 1\n \t\n-print(ans*ans)\n+print((ans-1)*(ans-1))\n \t\n", "FL_content": " n = int(input())\n ans = 0\n \n while True:\n-\tif ans * ans >= n:\n \t\tbreak\n \tans += 1\n \t\n-print(ans*ans)\n \t\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u618373524", "problem_id": "p03556", "submission1_id": "s374883143", "submission2_id": "s774532985", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nprint(int(n**0.5))", "code2": "n = int(input())\nm = int(n**0.5)\nprint(int(m**2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565808543", "date2": "1565808794", "bleu_score": "0.6884640967977812", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 83, "input": "312115444\n", "actual_output": "17666\n", "expected_output": "312087556\n\n", "anno_code": ["n = int(input()) # (0): n=312115444\nprint(int(n**0.5))"], "anno_status": [true], "diff_content": " n = int(input())\n-print(int(n**0.5))\n+m = int(n**0.5)\n+print(int(m**2))\n", "FL_content": " n = int(input())\n-print(int(n**0.5))\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u896741788", "problem_id": "p03556", "submission1_id": "s889689896", "submission2_id": "s943855604", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nfor i in range(1,10**3+2):\n if i**2>n:print((i-1)**2);exit()\n", "code2": "n=int(input())\nfor i in range(1,10**5+2):\n if i**2>n:print((i-1)**2);exit()\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600017318", "date2": "1600017400", "bleu_score": "0.9665395661812441", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0], "code1_test_score": 26, "total_score": 83, "input": "155815094\n", "actual_output": "no output\n", "expected_output": "155800324\n\n", "anno_code": ["n=int(input()) # (0): n=155815094\nfor i in range(1,10**3+2): # (1): i=1 (3): i=2 ... (2001): i=1001\n if i**2>n:print((i-1)**2);exit() # (2): NO CHANGE (4): NO CHANGE ... (2002): NO CHANGE\n"], "anno_status": [true], "diff_content": " n=int(input())\n-for i in range(1,10**3+2):\n+for i in range(1,10**5+2):\n if i**2>n:print((i-1)**2);exit()\n \n", "FL_content": " n=int(input())\n-for i in range(1,10**3+2):\n if i**2>n:print((i-1)**2);exit()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u612721349", "problem_id": "p03556", "submission1_id": "s743762565", "submission2_id": "s035344807", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print((lambda x:max([i*i for i in range(10001) if x>=i]))(int(input())))", "code2": "print((lambda x:max([i*i for i in range(100001) if x>=i*i]))(int(input())))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1516110204", "date2": "1516110525", "bleu_score": "0.9487277412175072", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 83, "input": "473588\n", "actual_output": "100000000\n", "expected_output": "473344\n\n", "anno_code": ["print((lambda x:max([i*i for i in range(10001) if x>=i]))(int(input())))"], "anno_status": [true], "diff_content": "-print((lambda x:max([i*i for i in range(10001) if x>=i]))(int(input())))\n+print((lambda x:max([i*i for i in range(100001) if x>=i*i]))(int(input())))\n", "FL_content": "-print((lambda x:max([i*i for i in range(10001) if x>=i]))(int(input())))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u388297793", "problem_id": "p03556", "submission1_id": "s774527930", "submission2_id": "s338440270", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nprint(int(n**(1/2)**2))\n", "code2": "n=int(input())\nprint(int(n**(1/2))**2)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596402180", "date2": "1596402253", "bleu_score": "0.9575874584289952", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 83, "input": "89041\n", "actual_output": "17\n", "expected_output": "88804\n\n", "anno_code": ["n=int(input()) # (0): n=89041\nprint(int(n**(1/2)**2))\n"], "anno_status": [true], "diff_content": " n=int(input())\n-print(int(n**(1/2)**2))\n+print(int(n**(1/2))**2)\n \n", "FL_content": " n=int(input())\n-print(int(n**(1/2)**2))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u140251125", "problem_id": "p03556", "submission1_id": "s690132614", "submission2_id": "s280822688", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nN = int(input())\n\ni = 1\n\nwhile i ** 2 <= N:\n i += 1\n\nprint(i ** 2)", "code2": "\nN = int(input())\n\ni = 1\n\nwhile i ** 2 <= N:\n i += 1\n\nprint((i - 1) ** 2)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1528335934", "date2": "1528335982", "bleu_score": "0.8986706229119412", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 83, "input": "85859\n", "actual_output": "86436\n", "expected_output": "85849\n\n", "anno_code": ["\nN = int(input()) # (0): N=85859\n\ni = 1 # (1): i=1\n\nwhile i ** 2 <= N: # (2): NO CHANGE (4): NO CHANGE ... (588): NO CHANGE\n i += 1 # (3): i=2 (5): i=3 ... (587): i=294\n\nprint(i ** 2)"], "anno_status": [true], "diff_content": " \n N = int(input())\n \n i = 1\n \n while i ** 2 <= N:\n i += 1\n \n-print(i ** 2)\n+print((i - 1) ** 2)\n", "FL_content": " \n N = int(input())\n \n i = 1\n \n while i ** 2 <= N:\n i += 1\n \n-print(i ** 2)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u997346103", "problem_id": "p03556", "submission1_id": "s401287643", "submission2_id": "s207359469", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print(round(int(input())**.5)**2)", "code2": "print(int(int(input())**.5)**2)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1572569261", "date2": "1572569321", "bleu_score": "0.7988634909550008", "code1_test_status": [0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 45, "total_score": 83, "input": "670\n", "actual_output": "676\n", "expected_output": "625\n\n", "anno_code": ["print(round(int(input())**.5)**2)"], "anno_status": [true], "diff_content": "-print(round(int(input())**.5)**2)\n+print(int(int(input())**.5)**2)\n", "FL_content": "-print(round(int(input())**.5)**2)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u530383736", "problem_id": "p03556", "submission1_id": "s113466825", "submission2_id": "s931870369", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nfrom decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\n\nN = int(input().strip())\n\nprint( int(N**(1/2)) )\n", "code2": "\nfrom decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\n\nN = int(input().strip())\n\nprint( int(N**(1/2))**2 )\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582584320", "date2": "1582584425", "bleu_score": "0.9598415906376219", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 83, "input": "526826000\n", "actual_output": "22952\n", "expected_output": "526794304\n\n", "anno_code": [" # (0): Decimal=, ROUND_HALF_UP=ROUND_HALF_UP, ROUND_HALF_EVEN=ROUND_HALF_EVEN\nfrom decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\n\nN = int(input().strip()) # (1): N=526826000\n\nprint( int(N**(1/2)) )\n"], "anno_status": [true], "diff_content": " \n from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\n \n N = int(input().strip())\n \n-print( int(N**(1/2)) )\n+print( int(N**(1/2))**2 )\n \n", "FL_content": " \n from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\n \n N = int(input().strip())\n \n-print( int(N**(1/2)) )\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u241159583", "problem_id": "p03556", "submission1_id": "s677067282", "submission2_id": "s379956855", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nN = int(input())\nn = math.sqrt(N)\nprint(round(n)**2)", "code2": "import math\nN = int(input())\nn = math.sqrt(N)\nprint(math.floor(n)**2)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577469849", "date2": "1577470039", "bleu_score": "0.8360199227843976", "code1_test_status": [0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 45, "total_score": 83, "input": "115087508\n", "actual_output": "115089984\n", "expected_output": "115068529\n\n", "anno_code": ["import math\nN = int(input()) # (0): N=115087508\nn = math.sqrt(N) # (1): n=10727.8846\nprint(round(n)**2)"], "anno_status": [true], "diff_content": " import math\n N = int(input())\n n = math.sqrt(N)\n-print(round(n)**2)\n+print(math.floor(n)**2)\n", "FL_content": " import math\n N = int(input())\n n = math.sqrt(N)\n-print(round(n)**2)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u363836311", "problem_id": "p03556", "submission1_id": "s240698421", "submission2_id": "s321796506", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nt=1\nwhile t*t\n if len(mlist) == 13: # (306): NO CHANGE (377): NO CHANGE (448): NO CHANGE\n return 0\n else:\n lack = [] # (307): lack=[] (378): lack=[] (449): lack=[]\n p = 1 # (308): p=1 (379): p=1 (450): p=1\n for i in mlist: # (309): i=1 (314): i=2 ... (509): NO CHANGE\n for j in range(p, 14): # (310): j=1 (315): j=2 ... (505): j=12\n if i == j: # (311): NO CHANGE (316): NO CHANGE ... (506): NO CHANGE\n p = j + 1 # (312): p=2 (317): p=3 ... (507): p=13\n break # (313): NO CHANGE (318): NO CHANGE ... (508): NO CHANGE\n else:\n lack.append(j) # (327): lack=[4] (393): lack=[3] ... (489): lack=[8]\n \n \n for j in lack: # (373): j=4 (375): check=, n=47, Slist=[1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13], Hlist=[1, 2, 4, 5, 6, 7, 8, 9, 11, 12, 13], Clist=[1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12], Dlist=[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13], i=46, mark=D, num=13 ... (512): check=, n=47, Slist=[1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13], Hlist=[1, 2, 4, 5, 6, 7, 8, 9, 11, 12, 13], Clist=[1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12], Dlist=[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13], i=46, mark=D, num=13\n print(\"{} {}\".format(s, j)) # (374): NO CHANGE (443): NO CHANGE ... (511): NO CHANGE\n return 0\n\n\nn = int(input()) # (1): n=47\nSlist = [] # (2): Slist=[]\nHlist = [] # (3): Hlist=[]\nClist = [] # (4): Clist=[]\nDlist = [] # (5): Dlist=[]\n\nfor i in range(n): # (6): i=0 (11): i=1 ... (300): NO CHANGE\n mark, num = input().split() # (7): mark=S, num=10 (12): num=11 ... (294): num=13\n num = int(num) # (8): num=10 (13): num=11 ... (295): num=13\n\n if mark == 'S': # (9): NO CHANGE (14): NO CHANGE ... (296): NO CHANGE\n Slist.append(num) # (10): Slist=[10] (15): Slist=[10, 11] ... (119): Slist=[10, 11, 12, 13, 6, 7, 8, 9, 2, 3, 1, 5]\n elif mark == 'H': # (30): NO CHANGE (36): NO CHANGE ... (297): NO CHANGE\n Hlist.append(num) # (31): Hlist=[1] (37): Hlist=[1, 2] ... (131): Hlist=[1, 2, 6, 8, 9, 7, 11, 4, 5, 12, 13]\n elif mark == 'C': # (137): NO CHANGE (144): NO CHANGE ... (298): NO CHANGE\n Clist.append(num) # (138): Clist=[1] (145): Clist=[1, 2] ... (264): Clist=[1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12]\n else:\n Dlist.append(num) # (152): Dlist=[1] (159): Dlist=[1, 2] ... (299): Dlist=[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]\n \nSlist.sort() # (301): Slist=[1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13]\nHlist.sort() # (302): Hlist=[1, 2, 4, 5, 6, 7, 8, 9, 11, 12, 13]\nClist.sort() # (303): NO CHANGE\nDlist.sort() # (304): NO CHANGE\n \ncheck(Slist, 'S') # (305): mlist=[1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13], s=S\ncheck(Hlist, 'H') # (376): mlist=[1, 2, 4, 5, 6, 7, 8, 9, 11, 12, 13], s=H\ncheck(Clist, 'C') # (447): mlist=[1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12], s=C\ncheck(Dlist, 'D') # (513): mlist=[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13], s=D\n"], "anno_status": [false], "diff_content": " \n def check(mlist, s):\n if len(mlist) == 13:\n return 0\n else:\n lack = []\n- p = 1\n- for i in mlist:\n- for j in range(p, 14):\n- if i == j:\n- p = j + 1\n- break\n- else:\n- lack.append(j) \n+ for i in range(1, 14):\n+ if not i in mlist:\n+ lack.append(i)\n \n \n for j in lack:\n print(\"{} {}\".format(s, j))\n return 0\n \n \n n = int(input())\n Slist = []\n Hlist = []\n Clist = []\n Dlist = []\n \n for i in range(n):\n mark, num = input().split()\n num = int(num)\n \n if mark == 'S':\n Slist.append(num)\n elif mark == 'H':\n Hlist.append(num)\n elif mark == 'C':\n Clist.append(num)\n else:\n Dlist.append(num)\n \n Slist.sort()\n Hlist.sort()\n Clist.sort()\n Dlist.sort()\n \n check(Slist, 'S')\n check(Hlist, 'H')\n check(Clist, 'C')\n check(Dlist, 'D')\n \n", "FL_content": " \n def check(mlist, s):\n if len(mlist) == 13:\n return 0\n else:\n lack = []\n- p = 1\n- for i in mlist:\n- for j in range(p, 14):\n- if i == j:\n- p = j + 1\n- break\n- else:\n- lack.append(j) \n \n \n for j in lack:\n print(\"{} {}\".format(s, j))\n return 0\n \n \n n = int(input())\n Slist = []\n Hlist = []\n Clist = []\n Dlist = []\n \n for i in range(n):\n mark, num = input().split()\n num = int(num)\n \n if mark == 'S':\n Slist.append(num)\n elif mark == 'H':\n Hlist.append(num)\n elif mark == 'C':\n Clist.append(num)\n else:\n Dlist.append(num)\n \n Slist.sort()\n Hlist.sort()\n Clist.sort()\n Dlist.sort()\n \n check(Slist, 'S')\n check(Hlist, 'H')\n check(Clist, 'C')\n check(Dlist, 'D')\n \n", "added_lines": 3, "removed_lines": 8, "code1_lines": 50 }, { "user_id": "u908651435", "problem_id": "p02408", "submission1_id": "s616805969", "submission2_id": "s992956542", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nx={0:'S',1:'H',2:'C',3:'D'}\nc=[[0]*13,[0]*13,[0]*13,[0]*13]\nfor i in range(n):\n a,b=input().split()\n b=int(b)\n if a=='S':\n c[0].insert(b,b)\n elif a=='H':\n c[1].insert(b,b)\n elif a=='C':\n c[2].insert(b,b)\n else:\n c[3].insert(b,b)\nfor i in range(4):\n for j in range(13):\n if c[i][j]==0:\n print(x[i],j)\n", "code2": "n=int(input())\nx={0:'S',1:'H',2:'C',3:'D'}\nc=[[0]*13,[0]*13,[0]*13,[0]*13]\nfor r in range(n):\n a,b=input().split()\n b=int(b)-1\n if a=='S':\n c[0][b]=1\n elif a=='H':\n c[1][b]=1\n elif a=='C':\n c[2][b]=1\n else:\n c[3][b]=1\nfor i in range(4):\n for j in range(13):\n if c[i][j]==0:\n print(x[i],j+1)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1525702543", "date2": "1525703289", "bleu_score": "0.8462040634130794", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "47\nS 10\nS 11\nS 12\nS 13\nH 1\nH 2\nS 6\nS 7\nS 8\nS 9\nH 6\nH 8\nH 9\nH 10\nH 11\nH 4\nH 7\nS 1\nS 3\nS 4\nS 5\nH 12\nH 13\nC 1\nC 2\nD 1\nD 2\nD 3\nD 6\nD 5\nD 8\nD 7\nC 3\nC 4\nC 5\nC 6\nC 7\nC 8\nC 9\nC 10\nC 11\nC 13\nD 9\nD 10\nD 11\nD 12\nD 13\n", "actual_output": "S 0\nS 2\nS 6\nS 7\nS 8\nS 9\nH 0\nH 3\nH 5\nH 6\nH 9\nC 0\nC 12\nD 0\nD 4\nD 6\n", "expected_output": "S 2\nH 3\nH 5\nC 12\nD 4\n\n", "anno_code": ["n=int(input()) # (0): n=47\nx={0:'S',1:'H',2:'C',3:'D'} # (1): x={0: 'S', 1: 'H', 2: 'C', 3: 'D'}\nc=[[0]*13,[0]*13,[0]*13,[0]*13] # (2): c\nfor i in range(n): # (3): i=0 (8): c, i=1 ... (297): c\n a,b=input().split() # (4): a=S, b=10 (9): c=[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], b=11 ... (291): c, b=13\n b=int(b) # (5): b=10 (10): c=[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], b=11 ... (292): c, b=13\n if a=='S': # (6): NO CHANGE (11): c ... (293): c\n c[0].insert(b,b) # (7): c (12): c ... (116): c\n elif a=='H': # (27): c (33): c ... (294): c\n c[1].insert(b,b) # (28): c (34): c ... (128): c\n elif a=='C': # (134): c (141): c ... (295): c\n c[2].insert(b,b) # (135): c (142): c ... (261): c\n else:\n c[3].insert(b,b) # (149): c (156): c ... (296): c\nfor i in range(4): # (298): c, i=0 (332): c, i=1 ... (395): c, i=3\n for j in range(13): # (299): c, j=0 (302): c, j=1 ... (425): c\n if c[i][j]==0: # (300): c (303): c ... (424): c\n print(x[i],j) # (301): c (306): c ... (412): c\n"], "anno_status": [false], "diff_content": " n=int(input())\n x={0:'S',1:'H',2:'C',3:'D'}\n c=[[0]*13,[0]*13,[0]*13,[0]*13]\n-for i in range(n):\n+for r in range(n):\n a,b=input().split()\n- b=int(b)\n+ b=int(b)-1\n if a=='S':\n- c[0].insert(b,b)\n+ c[0][b]=1\n elif a=='H':\n- c[1].insert(b,b)\n+ c[1][b]=1\n elif a=='C':\n- c[2].insert(b,b)\n+ c[2][b]=1\n else:\n- c[3].insert(b,b)\n+ c[3][b]=1\n for i in range(4):\n for j in range(13):\n if c[i][j]==0:\n- print(x[i],j)\n+ print(x[i],j+1)\n \n", "FL_content": " n=int(input())\n x={0:'S',1:'H',2:'C',3:'D'}\n c=[[0]*13,[0]*13,[0]*13,[0]*13]\n-for i in range(n):\n a,b=input().split()\n- b=int(b)\n if a=='S':\n- c[0].insert(b,b)\n elif a=='H':\n- c[1].insert(b,b)\n elif a=='C':\n- c[2].insert(b,b)\n else:\n- c[3].insert(b,b)\n for i in range(4):\n for j in range(13):\n if c[i][j]==0:\n- print(x[i],j)\n \n", "added_lines": 7, "removed_lines": 7, "code1_lines": 19 }, { "user_id": "u060936992", "problem_id": "p04044", "submission1_id": "s957507107", "submission2_id": "s933487447", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nn,l=map(int,input().split())\ns=[0 for i in range(n)]\nfor i in range(n):\n s[i]=input()\n\nprint(s)\ns.sort()\nprint(s)\nans=\"\"\nfor i in range(n):\n ans+=s[i]\n\nprint(ans)", "code2": "\n\nn,l=map(int,input().split())\ns=[0 for i in range(n)]\nfor i in range(n):\n s[i]=input()\n\ns.sort()\nans=\"\"\nfor i in range(n):\n ans+=s[i]\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1545177538", "date2": "1545177580", "bleu_score": "0.8823396373580439", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 2\nexx\naxw\ncwx\n", "actual_output": "['exx', 'axw', 'cwx']\n['axw', 'cwx', 'exx']\naxwcwxexx\n", "expected_output": "axwcwxexx\n\n", "anno_code": ["\n\nn,l=map(int,input().split()) # (0): n=3, l=2\ns=[0 for i in range(n)] # (1): s=[0, 0, 0]\nfor i in range(n): # (2): i=0 (4): i=1 ... (8): NO CHANGE\n s[i]=input() # (3): s=['exx', 0, 0] (5): s=['exx', 'axw', 0] (7): s=['exx', 'axw', 'cwx']\n\nprint(s) # (9): NO CHANGE\ns.sort() # (10): s=['axw', 'cwx', 'exx']\nprint(s) # (11): NO CHANGE\nans=\"\" # (12): ans=\nfor i in range(n): # (13): i=0 (15): i=1 ... (19): NO CHANGE\n ans+=s[i] # (14): ans=axw (16): ans=axwcwx (18): ans=axwcwxexx\n\nprint(ans)"], "anno_status": [true], "diff_content": " \n \n n,l=map(int,input().split())\n s=[0 for i in range(n)]\n for i in range(n):\n s[i]=input()\n \n-print(s)\n s.sort()\n-print(s)\n ans=\"\"\n for i in range(n):\n ans+=s[i]\n \n print(ans)\n", "FL_content": " \n \n n,l=map(int,input().split())\n s=[0 for i in range(n)]\n for i in range(n):\n s[i]=input()\n \n-print(s)\n s.sort()\n-print(s)\n ans=\"\"\n for i in range(n):\n ans+=s[i]\n \n print(ans)\n", "added_lines": 0, "removed_lines": 2, "code1_lines": 15 }, { "user_id": "u955691979", "problem_id": "p04044", "submission1_id": "s551675368", "submission2_id": "s848079205", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = input().split()\n\ns = [input() for i in range(int(a[0]))]\nb = ''\n\ns.sort()\nprint(s)\n\nfor i in range(int(a[0]),0):\n b = s[i] + b\n \nprint(b)", "code2": "a = input().split()\n\ns = [input() for i in range(int(a[0]))]\nb = ''\n\ns.sort()\n\nb = ''.join(s)\n\nprint(b)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582171774", "date2": "1582171927", "bleu_score": "0.6069071885568635", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 3\ncwy\nxxa\nyxd\n", "actual_output": "['cwy', 'xxa', 'yxd']\n\n", "expected_output": "cwyxxayxd\n\n", "anno_code": ["a = input().split() # (0): a=['3', '3']\n\ns = [input() for i in range(int(a[0]))] # (1): s=['cwy', 'xxa', 'yxd']\nb = '' # (2): b=\n\ns.sort() # (3): NO CHANGE\nprint(s) # (4): NO CHANGE\n\nfor i in range(int(a[0]),0): # (5): NO CHANGE\n b = s[i] + b\n \nprint(b)"], "anno_status": [true], "diff_content": " a = input().split()\n \n s = [input() for i in range(int(a[0]))]\n b = ''\n \n s.sort()\n-print(s)\n \n-for i in range(int(a[0]),0):\n- b = s[i] + b\n- \n+b = ''.join(s)\n+\n print(b)\n", "FL_content": " a = input().split()\n \n s = [input() for i in range(int(a[0]))]\n b = ''\n \n s.sort()\n-print(s)\n \n-for i in range(int(a[0]),0):\n- b = s[i] + b\n- \n print(b)\n", "added_lines": 2, "removed_lines": 4, "code1_lines": 12 }, { "user_id": "u575560095", "problem_id": "p04044", "submission1_id": "s269133514", "submission2_id": "s731220154", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,L = map(int,input().split())\nS = []\nans = \"\"\nfor i in range(N):\n S.append(input())\nsorted(S)\nfor i in range(len(S)):\n ans += S[i]\nprint(ans)\n", "code2": "l=[]\na=''\nN,L=map(int,input().split())\nfor i in range(N):\n\tl.append(input())\n\tl.sort()\nfor i in range(N):\n\ta += l[i]\nprint(a)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568485274", "date2": "1568486447", "bleu_score": "0.6509189654874513", "code1_test_status": [0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0], "code1_test_score": 16, "total_score": 101, "input": "3 3\nxxd\nxxa\nxxd\n", "actual_output": "xxdxxaxxd\n", "expected_output": "xxaxxdxxd\n\n", "anno_code": ["N,L = map(int,input().split()) # (0): N=3, L=3\nS = [] # (1): S=[]\nans = \"\" # (2): ans=\nfor i in range(N): # (3): i=0 (5): i=1 ... (9): NO CHANGE\n S.append(input()) # (4): S=['xxd'] (6): S=['xxd', 'xxa'] (8): S=['xxd', 'xxa', 'xxd']\nsorted(S) # (10): NO CHANGE\nfor i in range(len(S)): # (11): i=0 (13): i=1 ... (17): NO CHANGE\n ans += S[i] # (12): ans=xxd (14): ans=xxdxxa (16): ans=xxdxxaxxd\nprint(ans)\n"], "anno_status": [true], "diff_content": "-N,L = map(int,input().split())\n-S = []\n-ans = \"\"\n+l=[]\n+a=''\n+N,L=map(int,input().split())\n for i in range(N):\n- S.append(input())\n-sorted(S)\n-for i in range(len(S)):\n- ans += S[i]\n-print(ans)\n+\tl.append(input())\n+\tl.sort()\n+for i in range(N):\n+\ta += l[i]\n+print(a)\n \n", "FL_content": "-N,L = map(int,input().split())\n-S = []\n-ans = \"\"\n for i in range(N):\n- S.append(input())\n-sorted(S)\n-for i in range(len(S)):\n- ans += S[i]\n-print(ans)\n \n", "added_lines": 8, "removed_lines": 8, "code1_lines": 10 }, { "user_id": "u093500767", "problem_id": "p04044", "submission1_id": "s913879993", "submission2_id": "s807884239", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, l = map(int, input().split())\n\nlist = []\nfor _ in range(n):\n list.append(input())\n\nlist.sort()\nstr = \"\"\nfor s in list:\n str += s\n\nprint(s)", "code2": "n, l = map(int, input().split())\n\nlist = []\nfor _ in range(n):\n list.append(input())\n\nlist.sort()\nstr = \"\"\nfor s in list:\n str += s\n\nprint(str)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1562258607", "date2": "1562258975", "bleu_score": "0.9813330443416244", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0], "code1_test_score": 6, "total_score": 101, "input": "3 3\nxdx\naxw\nxxd\n", "actual_output": "xxd\n", "expected_output": "axwxdxxxd\n\n", "anno_code": ["n, l = map(int, input().split()) # (0): n=3, l=3\n\nlist = [] # (1): list=[]\nfor _ in range(n): # (2): _=0 (4): _=1 ... (8): NO CHANGE\n list.append(input()) # (3): list=['xdx'] (5): list=['xdx', 'axw'] (7): list=['xdx', 'axw', 'xxd']\n\nlist.sort() # (9): list=['axw', 'xdx', 'xxd']\nstr = \"\" # (10): str=\nfor s in list: # (11): s=axw (13): s=xdx ... (17): NO CHANGE\n str += s # (12): str=axw (14): str=axwxdx (16): str=axwxdxxxd\n\nprint(s)"], "anno_status": [true], "diff_content": " n, l = map(int, input().split())\n \n list = []\n for _ in range(n):\n list.append(input())\n \n list.sort()\n str = \"\"\n for s in list:\n str += s\n \n-print(s)\n+print(str)\n", "FL_content": " n, l = map(int, input().split())\n \n list = []\n for _ in range(n):\n list.append(input())\n \n list.sort()\n str = \"\"\n for s in list:\n str += s\n \n-print(s)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u577504524", "problem_id": "p04044", "submission1_id": "s269136561", "submission2_id": "s812948162", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nn,l = map(int,input().split())\nword_list=[]\nfor i in range(n):\n word = str(input())\n word_list.append(word)\nx = sorted(word_list)\nprint(''.join(word_list))", "code2": "\nn,l = map(int,input().split())\nword_list=[]\nfor i in range(n):\n word = str(input())\n word_list.append(word)\nx = sorted(word_list)\nprint(''.join(x))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593353689", "date2": "1593353887", "bleu_score": "0.9353198825437469", "code1_test_status": [0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0], "code1_test_score": 16, "total_score": 101, "input": "3 3\ncwx\naxx\ndxy\n", "actual_output": "cwxaxxdxy\n", "expected_output": "axxcwxdxy\n\n", "anno_code": ["\nn,l = map(int,input().split()) # (0): n=3, l=3\nword_list=[] # (1): word_list=[]\nfor i in range(n): # (2): i=0 (5): i=1 ... (11): NO CHANGE\n word = str(input()) # (3): word=cwx (6): word=axx (9): word=dxy\n word_list.append(word) # (4): word_list=['cwx'] (7): word_list=['cwx', 'axx'] (10): word_list=['cwx', 'axx', 'dxy']\nx = sorted(word_list) # (12): x=['axx', 'cwx', 'dxy']\nprint(''.join(word_list))"], "anno_status": [true], "diff_content": " \n n,l = map(int,input().split())\n word_list=[]\n for i in range(n):\n word = str(input())\n word_list.append(word)\n x = sorted(word_list)\n-print(''.join(word_list))\n+print(''.join(x))\n", "FL_content": " \n n,l = map(int,input().split())\n word_list=[]\n for i in range(n):\n word = str(input())\n word_list.append(word)\n x = sorted(word_list)\n-print(''.join(word_list))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u779483561", "problem_id": "p04044", "submission1_id": "s707354049", "submission2_id": "s509352717", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, L = list(map(int,input().split()))\nS = [input() for _ in range(N)]\nprint(sorted(S))\n", "code2": "N, L = list(map(int,input().split()))\nS = [input() for i in range(N)]\nS.sort()\nfor str in S:\n print(str, end=\"\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1556780845", "date2": "1556781282", "bleu_score": "0.659056830267723", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 3\ndxx\nxxa\nxxd\n", "actual_output": "['dxx', 'xxa', 'xxd']\n", "expected_output": "dxxxxaxxd\n\n", "anno_code": ["N, L = list(map(int,input().split())) # (0): N=3, L=3\nS = [input() for _ in range(N)] # (1): S=['dxx', 'xxa', 'xxd']\nprint(sorted(S))\n"], "anno_status": [true], "diff_content": " N, L = list(map(int,input().split()))\n-S = [input() for _ in range(N)]\n-print(sorted(S))\n+S = [input() for i in range(N)]\n+S.sort()\n+for str in S:\n+ print(str, end=\"\")\n \n", "FL_content": " N, L = list(map(int,input().split()))\n-S = [input() for _ in range(N)]\n-print(sorted(S))\n \n", "added_lines": 4, "removed_lines": 2, "code1_lines": 4 }, { "user_id": "u968166680", "problem_id": "p04044", "submission1_id": "s658843038", "submission2_id": "s209841328", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\nsys.setrecursionlimit(10 ** 9)\nINF = 1 << 60\nMOD = 1000000007\n\n\ndef main():\n N, L = map(int, readline().split())\n S = [readline().strip() for _ in range(L)]\n\n S.sort()\n ans = ''.join(S)\n print(ans)\n return\n\n\nif __name__ == '__main__':\n main()\n", "code2": "import sys\n\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\nsys.setrecursionlimit(10 ** 9)\nINF = 1 << 60\nMOD = 1000000007\n\n\ndef main():\n N, L = map(int, readline().split())\n S = [readline().strip() for _ in range(N)]\n\n S.sort()\n ans = ''.join(S)\n print(ans)\n return\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1594890854", "date2": "1594890963", "bleu_score": "0.9930117393912855", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1], "code1_test_score": 63, "total_score": 101, "input": "3 1\nxxd\nxax\nxyd\n", "actual_output": "xxd\n", "expected_output": "xaxxxdxyd\n\n", "anno_code": ["import sys\n\nread = sys.stdin.read # (0): read=\nreadline = sys.stdin.readline # (1): readline=\nreadlines = sys.stdin.readlines # (2): readlines=\nsys.setrecursionlimit(10 ** 9) # (3): NO CHANGE\nINF = 1 << 60 # (4): INF=1152921504606846976\nMOD = 1000000007 # (5): MOD=1000000007\n\n\ndef main(): # (6): main=\n N, L = map(int, readline().split())\n S = [readline().strip() for _ in range(L)]\n\n S.sort()\n ans = ''.join(S)\n print(ans)\n return\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " import sys\n \n read = sys.stdin.read\n readline = sys.stdin.readline\n readlines = sys.stdin.readlines\n sys.setrecursionlimit(10 ** 9)\n INF = 1 << 60\n MOD = 1000000007\n \n \n def main():\n N, L = map(int, readline().split())\n- S = [readline().strip() for _ in range(L)]\n+ S = [readline().strip() for _ in range(N)]\n \n S.sort()\n ans = ''.join(S)\n print(ans)\n return\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " import sys\n \n read = sys.stdin.read\n readline = sys.stdin.readline\n readlines = sys.stdin.readlines\n sys.setrecursionlimit(10 ** 9)\n INF = 1 << 60\n MOD = 1000000007\n \n \n def main():\n N, L = map(int, readline().split())\n- S = [readline().strip() for _ in range(L)]\n \n S.sort()\n ans = ''.join(S)\n print(ans)\n return\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 23 }, { "user_id": "u634873566", "problem_id": "p04044", "submission1_id": "s158234892", "submission2_id": "s154147528", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, l = map(int, input().split())\nd = {input() for _ in range(n)}\nprint(sorted(d))", "code2": "n, l = map(int, input().split())\nd = sorted([input() for _ in range(n)])\nprint(''.join(d))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590363900", "date2": "1590364023", "bleu_score": "0.8142660498513914", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 3\ncwx\nxxa\nyxd\n", "actual_output": "['cwx', 'xxa', 'yxd']\n", "expected_output": "cwxxxayxd\n\n", "anno_code": ["n, l = map(int, input().split()) # (0): n=3, l=3\nd = {input() for _ in range(n)} # (1): d={'yxd', 'xxa', 'cwx'}\nprint(sorted(d))"], "anno_status": [true], "diff_content": " n, l = map(int, input().split())\n-d = {input() for _ in range(n)}\n-print(sorted(d))\n+d = sorted([input() for _ in range(n)])\n+print(''.join(d))\n", "FL_content": " n, l = map(int, input().split())\n-d = {input() for _ in range(n)}\n-print(sorted(d))\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 3 }, { "user_id": "u614181788", "problem_id": "p04044", "submission1_id": "s020589925", "submission2_id": "s535660481", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,l = map(int,input().split())\ns = [0]*n\nfor i in range(n):\n s[i] = input()\ns = sorted(s)\nans = []\nfor i in range(n):\n ans.extend(s[i])\nprint(ans)", "code2": "n,l = map(int,input().split())\ns = [0]*n\nfor i in range(n):\n s[i] = input()\ns = sorted(s)\nans = []\nfor i in range(n):\n print(s[i],end=\"\")\nprint(\"\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588552933", "date2": "1588553036", "bleu_score": "0.8953241443743615", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 3\nxcw\nxxa\ndxy\n", "actual_output": "['d', 'x', 'y', 'x', 'c', 'w', 'x', 'x', 'a']\n", "expected_output": "dxyxcwxxa\n\n", "anno_code": ["n,l = map(int,input().split()) # (0): n=3, l=3\ns = [0]*n # (1): s=[0, 0, 0]\nfor i in range(n): # (2): i=0 (4): i=1 ... (8): NO CHANGE\n s[i] = input() # (3): s=['xcw', 0, 0] (5): s=['xcw', 'xxa', 0] (7): s=['xcw', 'xxa', 'dxy']\ns = sorted(s) # (9): s=['dxy', 'xcw', 'xxa']\nans = [] # (10): ans=[]\nfor i in range(n): # (11): i=0 (13): i=1 ... (17): NO CHANGE\n ans.extend(s[i]) # (12): ans=['d', 'x', 'y'] (14): ans=['d', 'x', 'y', 'x', 'c', 'w'] (16): ans=['d', 'x', 'y', 'x', 'c', 'w', 'x', 'x', 'a']\nprint(ans)"], "anno_status": [true], "diff_content": " n,l = map(int,input().split())\n s = [0]*n\n for i in range(n):\n s[i] = input()\n s = sorted(s)\n ans = []\n for i in range(n):\n- ans.extend(s[i])\n-print(ans)\n+ print(s[i],end=\"\")\n+print(\"\")\n", "FL_content": " n,l = map(int,input().split())\n s = [0]*n\n for i in range(n):\n s[i] = input()\n s = sorted(s)\n ans = []\n for i in range(n):\n- ans.extend(s[i])\n-print(ans)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u881816188", "problem_id": "p04044", "submission1_id": "s672205061", "submission2_id": "s830177267", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,l=map(int,input().split())\ns=[str(input()) for _ in range(n)]\nsort_s=sorted(s)\n\nprint(''.join(s))", "code2": "n,l=map(int,input().split())\ns=[str(input()) for _ in range(n)]\nsort_s=sorted(s)\n\nprint(''.join(sort_s))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566848922", "date2": "1566849014", "bleu_score": "0.9437719421410621", "code1_test_status": [0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0], "code1_test_score": 16, "total_score": 101, "input": "3 3\ncxx\naxx\nxxd\n", "actual_output": "cxxaxxxxd\n", "expected_output": "axxcxxxxd\n\n", "anno_code": ["n,l=map(int,input().split()) # (0): n=3, l=3\ns=[str(input()) for _ in range(n)] # (1): s=['cxx', 'axx', 'xxd']\nsort_s=sorted(s) # (2): sort_s=['axx', 'cxx', 'xxd']\n\nprint(''.join(s))"], "anno_status": [true], "diff_content": " n,l=map(int,input().split())\n s=[str(input()) for _ in range(n)]\n sort_s=sorted(s)\n \n-print(''.join(s))\n+print(''.join(sort_s))\n", "FL_content": " n,l=map(int,input().split())\n s=[str(input()) for _ in range(n)]\n sort_s=sorted(s)\n \n-print(''.join(s))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u859210968", "problem_id": "p03338", "submission1_id": "s990749763", "submission2_id": "s083353733", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nS = str(input())\n\nM = 0\nfor n in range(1,N) :\n set1 = set([])\n set2 = set([])\n I = set([])\n for c in (S[:n]) :\n set1.add(c)\n for d in (S[n+1:]) :\n set2.add(d)\n I = set1 & set2\n if(len(I)>M) :\n M = len(I)\nprint(M)", "code2": "N = int(input())\nS = str(input())\n\nM = 0\nfor n in range(1,N) :\n set1 = set([])\n set2 = set([])\n I = set([])\n for c in (S[:n]) :\n set1.add(c)\n for d in (S[n:]) :\n set2.add(d)\n I = set1 & set2\n if(len(I)>M) :\n M = len(I)\nprint(M)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1527386532", "date2": "1527386603", "bleu_score": "0.9870004318408176", "code1_test_status": [1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1], "code1_test_score": 64, "total_score": 103, "input": "6\ncaacb^\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["N = int(input()) # (0): N=6\nS = str(input()) # (1): S=caacb^\n\nM = 0 # (2): M=0\nfor n in range(1,N) : # (3): n=1 (22): n=2 ... (94): NO CHANGE\n set1 = set([]) # (4): set1=set() (23): set1=set() ... (77): set1=set()\n set2 = set([]) # (5): set2=set() (24): set2=set() ... (78): set2=set()\n I = set([]) # (6): I=set() (25): I=set() ... (79): NO CHANGE\n for c in (S[:n]) : # (7): c=c (9): NO CHANGE ... (90): NO CHANGE\n set1.add(c) # (8): set1={'c'} (27): set1={'c'} ... (89): set1={'c', 'a', 'b'}\n for d in (S[n+1:]) : # (10): d=a (12): d=c ... (91): NO CHANGE\n set2.add(d) # (11): set2={'a'} (13): set2={'c', 'a'} ... (72): set2={'^'}\n I = set1 & set2 # (19): I={'c'} (38): I={'c'} ... (92): NO CHANGE\n if(len(I)>M) : # (20): NO CHANGE (39): NO CHANGE ... (93): NO CHANGE\n M = len(I) # (21): M=1\nprint(M)"], "anno_status": [true], "diff_content": " N = int(input())\n S = str(input())\n \n M = 0\n for n in range(1,N) :\n set1 = set([])\n set2 = set([])\n I = set([])\n for c in (S[:n]) :\n set1.add(c)\n- for d in (S[n+1:]) :\n+ for d in (S[n:]) :\n set2.add(d)\n I = set1 & set2\n if(len(I)>M) :\n M = len(I)\n print(M)\n", "FL_content": " N = int(input())\n S = str(input())\n \n M = 0\n for n in range(1,N) :\n set1 = set([])\n set2 = set([])\n I = set([])\n for c in (S[:n]) :\n set1.add(c)\n- for d in (S[n+1:]) :\n set2.add(d)\n I = set1 & set2\n if(len(I)>M) :\n M = len(I)\n print(M)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u537550206", "problem_id": "p03338", "submission1_id": "s994795223", "submission2_id": "s578960158", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ns = input()\nch = []\nfor i in range(1, n):\n x = s[:i+1]\n y = s[i:len(s)]\n a = set(x)\n b = set(y)\n c = a.intersection(b)\n ch.append(len(c))\nprint(max(ch))", "code2": "n = int(input())\ns = input()\nch = []\nfor i in range(0, n):\n x = s[:i+1]\n y = s[i+1:len(s)]\n a = set(x)\n b = set(y)\n c = a.intersection(b)\n ch.append(len(c))\nprint(max(ch))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586026797", "date2": "1586027219", "bleu_score": "0.9691501468122027", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 69, "total_score": 103, "input": "10\naba`ababbb\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["n = int(input()) # (0): n=10\ns = input() # (1): s=aba`ababbb\nch = [] # (2): ch=[]\nfor i in range(1, n): # (3): i=1 (10): i=2 ... (66): NO CHANGE\n x = s[:i+1] # (4): x=ab (11): x=aba ... (60): x=aba`ababbb\n y = s[i:len(s)] # (5): y=ba`ababbb (12): y=a`ababbb ... (61): y=b\n a = set(x) # (6): a={'b', 'a'} (13): NO CHANGE ... (62): NO CHANGE\n b = set(y) # (7): b={'b', 'a', '`'} (14): NO CHANGE ... (63): NO CHANGE\n c = a.intersection(b) # (8): c={'b', 'a'} (15): NO CHANGE ... (64): NO CHANGE\n ch.append(len(c)) # (9): ch=[2] (16): ch=[2, 2] ... (65): ch=[2, 2, 3, 2, 2, 2, 1, 1, 1]\nprint(max(ch))"], "anno_status": [true], "diff_content": " n = int(input())\n s = input()\n ch = []\n-for i in range(1, n):\n+for i in range(0, n):\n x = s[:i+1]\n- y = s[i:len(s)]\n+ y = s[i+1:len(s)]\n a = set(x)\n b = set(y)\n c = a.intersection(b)\n ch.append(len(c))\n print(max(ch))\n", "FL_content": " n = int(input())\n s = input()\n ch = []\n-for i in range(1, n):\n x = s[:i+1]\n- y = s[i:len(s)]\n a = set(x)\n b = set(y)\n c = a.intersection(b)\n ch.append(len(c))\n print(max(ch))\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 11 }, { "user_id": "u345710188", "problem_id": "p03338", "submission1_id": "s693145670", "submission2_id": "s146676510", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nS = input()\na = set(S[:1])\nb = set(S[1:])\nM = a & b\n\nfor i in range(2,N):\n a = set(S[:i])\n b = set(S[i:])\n if (a & b) > M:\n M = (a & b)\n else:\n print(M)\n break", "code2": "N = int(input())\nS = input()\na = set(S[:1])\nb = set(S[1:])\nM = len(a & b)\n\nfor i in range(2,N):\n a = set(S[:i])\n b = set(S[i:])\n if len(a & b) > M:\n M = len(a & b)\n\nprint(M)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569635973", "date2": "1569636907", "bleu_score": "0.8485713281722653", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "6\nabdbb`\n", "actual_output": "{'b'}\n", "expected_output": "1\n\n", "anno_code": ["N = int(input()) # (0): N=6\nS = input() # (1): S=abdbb`\na = set(S[:1]) # (2): a={'a'}\nb = set(S[1:]) # (3): b={'d', 'b', '`'}\nM = a & b # (4): M=set()\n\nfor i in range(2,N): # (5): i=2 (10): i=3\n a = set(S[:i]) # (6): a={'a', 'b'} (11): a={'d', 'b', 'a'}\n b = set(S[i:]) # (7): NO CHANGE (12): b={'b', '`'}\n if (a & b) > M: # (8): NO CHANGE (13): NO CHANGE\n M = (a & b) # (9): M={'b'}\n else:\n print(M) # (14): NO CHANGE\n break"], "anno_status": [true], "diff_content": " N = int(input())\n S = input()\n a = set(S[:1])\n b = set(S[1:])\n-M = a & b\n+M = len(a & b)\n \n for i in range(2,N):\n a = set(S[:i])\n b = set(S[i:])\n- if (a & b) > M:\n- M = (a & b)\n- else:\n- print(M)\n- break\n+ if len(a & b) > M:\n+ M = len(a & b)\n+\n+print(M)\n", "FL_content": " N = int(input())\n S = input()\n a = set(S[:1])\n b = set(S[1:])\n-M = a & b\n \n for i in range(2,N):\n a = set(S[:i])\n b = set(S[i:])\n- if (a & b) > M:\n- M = (a & b)\n- else:\n- print(M)\n- break\n", "added_lines": 5, "removed_lines": 6, "code1_lines": 14 }, { "user_id": "u129978636", "problem_id": "p03338", "submission1_id": "s629722823", "submission2_id": "s237999604", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int( input())\nS = list( input())\n\nintger2 = 0\n\nfor i in range(N):\n intger1 = 0\n str1 = list(set(S[i:]))\n str2 = list(set(S[:i + 1]))\n l = len(str2)\n \n for j in range(l):\n if( str2[j] in str1):\n intger1 += 1\n \n else:\n continue\n \n if( intger2 <= intger1):\n intger2 = intger1\n \n else:\n continue\n \nprint(intger2)", "code2": "N = int( input())\nS = list( input())\n\nintger2 = 0\nc = []\n\nfor i in range(N):\n intger1 = 0\n str1 = list(set(S[i + 1:]))\n str2 = list(set(S[:i + 1]))\n l = len(str2)\n \n for j in range(l):\n if( str2[j] in str1):\n intger1 += 1\n \n else:\n continue\n \n if( intger2 <= intger1):\n intger2 = intger1\n c.append(intger2)\n \n else:\n continue\n\nprint(max(c))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1542468872", "date2": "1542473024", "bleu_score": "0.9124929266872315", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 69, "total_score": 103, "input": "6\nab`dcb\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["N = int( input()) # (0): N=6\nS = list( input()) # (1): S=['a', 'b', '`', 'd', 'c', 'b']\n\nintger2 = 0 # (2): intger2=0\n\nfor i in range(N): # (3): i=0 (14): i=1 ... (111): NO CHANGE\n intger1 = 0 # (4): intger1=0 (15): intger1=0 ... (89): intger1=0\n str1 = list(set(S[i:])) # (5): str1=['d', 'c', '`', 'b', 'a'] (16): str1=['d', '`', 'b', 'c'] ... (90): str1=['b']\n str2 = list(set(S[:i + 1])) # (6): str2=['a'] (17): str2=['b', 'a'] ... (91): NO CHANGE\n l = len(str2) # (7): l=1 (18): l=2 ... (92): NO CHANGE\n \n for j in range(l): # (8): j=0 (11): NO CHANGE ... (108): NO CHANGE\n if( str2[j] in str1): # (9): NO CHANGE (20): NO CHANGE ... (106): NO CHANGE\n intger1 += 1 # (10): intger1=1 (21): intger1=1 ... (104): intger1=1\n \n else:\n continue # (24): NO CHANGE (41): NO CHANGE ... (107): NO CHANGE\n \n if( intger2 <= intger1): # (12): NO CHANGE (26): NO CHANGE ... (109): NO CHANGE\n intger2 = intger1 # (13): intger2=1 (27): NO CHANGE ... (87): NO CHANGE\n \n else:\n continue # (110): NO CHANGE\n \nprint(intger2)"], "anno_status": [true], "diff_content": " N = int( input())\n S = list( input())\n \n intger2 = 0\n+c = []\n \n for i in range(N):\n intger1 = 0\n- str1 = list(set(S[i:]))\n+ str1 = list(set(S[i + 1:]))\n str2 = list(set(S[:i + 1]))\n l = len(str2)\n \n for j in range(l):\n if( str2[j] in str1):\n intger1 += 1\n \n else:\n continue\n \n if( intger2 <= intger1):\n intger2 = intger1\n+ c.append(intger2)\n \n else:\n continue\n- \n-print(intger2)\n+\n+print(max(c))\n", "FL_content": " N = int( input())\n S = list( input())\n \n intger2 = 0\n \n for i in range(N):\n intger1 = 0\n- str1 = list(set(S[i:]))\n str2 = list(set(S[:i + 1]))\n l = len(str2)\n \n for j in range(l):\n if( str2[j] in str1):\n intger1 += 1\n \n else:\n continue\n \n if( intger2 <= intger1):\n intger2 = intger1\n \n else:\n continue\n- \n-print(intger2)\n", "added_lines": 5, "removed_lines": 3, "code1_lines": 25 }, { "user_id": "u329058683", "problem_id": "p03338", "submission1_id": "s859177970", "submission2_id": "s143604135", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nL=list(input())\nans=[]\nfor i in range(N):\n a=set(L[:i+1])\n b=set(L[i+1:])\n ans.append(a & b)\nprint(len(max(ans)))", "code2": "N=int(input())\nL=list(input())\nans=[]\nfor i in range(N):\n a=set(L[:i+1])\n b=set(L[i+1:])\n ans.append(len(a & b))\nprint(max(ans))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559649814", "date2": "1559650002", "bleu_score": "0.9722819910077517", "code1_test_status": [1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0], "code1_test_score": 58, "total_score": 103, "input": "10\na_a``bccbb\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["N=int(input()) # (0): N=10\nL=list(input()) # (1): L=['a', '_', 'a', '`', '`', 'b', 'c', 'c', 'b', 'b']\nans=[] # (2): ans=[]\nfor i in range(N): # (3): i=0 (7): i=1 ... (43): NO CHANGE\n a=set(L[:i+1]) # (4): a={'a'} (8): a={'a', '_'} ... (40): NO CHANGE\n b=set(L[i+1:]) # (5): b={'_', 'a', 'c', 'b', '`'} (9): b={'a', 'b', '`', 'c'} ... (41): b=set()\n ans.append(a & b) # (6): ans=[{'a'}] (10): ans=[{'a'}, {'a'}] ... (42): ans=[{'a'}, {'a'}, set(), {'`'}, set(), {'b'}, {'b', 'c'}, {'b'}, {'b'}, set()]\nprint(len(max(ans)))"], "anno_status": [true], "diff_content": " N=int(input())\n L=list(input())\n ans=[]\n for i in range(N):\n a=set(L[:i+1])\n b=set(L[i+1:])\n- ans.append(a & b)\n-print(len(max(ans)))\n+ ans.append(len(a & b))\n+print(max(ans))\n", "FL_content": " N=int(input())\n L=list(input())\n ans=[]\n for i in range(N):\n a=set(L[:i+1])\n b=set(L[i+1:])\n- ans.append(a & b)\n-print(len(max(ans)))\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u902380746", "problem_id": "p03338", "submission1_id": "s537952423", "submission2_id": "s602298378", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport math\nimport bisect\n\ndef solve(s):\n n = len(s)\n max_val = 0\n for i in range(1, n):\n s1 = set(list(s[0:i]))\n s2 = set(list(s[i:]))\n val = len(s1 ^ s2)\n max_val = max(max_val, val)\n return max_val\n\ndef main():\n n = int(input())\n s = input()\n print(solve(s))\n\nif __name__ == \"__main__\":\n main()\n", "code2": "import sys\nimport math\nimport bisect\n\ndef solve(s):\n n = len(s)\n max_val = 0\n for i in range(1, n):\n s1 = set(list(s[0:i]))\n s2 = set(list(s[i:]))\n val = len(s1 & s2)\n max_val = max(max_val, val)\n return max_val\n\ndef main():\n n = int(input())\n s = input()\n print(solve(s))\n\nif __name__ == \"__main__\":\n main()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589561842", "date2": "1589562051", "bleu_score": "0.9930312196442871", "code1_test_status": [1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 12, "total_score": 103, "input": "10\naaabaaabaa\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["import sys\nimport math\nimport bisect\n\ndef solve(s): # (0): solve=\n n = len(s)\n max_val = 0\n for i in range(1, n):\n s1 = set(list(s[0:i]))\n s2 = set(list(s[i:]))\n val = len(s1 ^ s2)\n max_val = max(max_val, val)\n return max_val\n\ndef main(): # (1): main=\n n = int(input())\n s = input()\n print(solve(s))\n\nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " import sys\n import math\n import bisect\n \n def solve(s):\n n = len(s)\n max_val = 0\n for i in range(1, n):\n s1 = set(list(s[0:i]))\n s2 = set(list(s[i:]))\n- val = len(s1 ^ s2)\n+ val = len(s1 & s2)\n max_val = max(max_val, val)\n return max_val\n \n def main():\n n = int(input())\n s = input()\n print(solve(s))\n \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": " import sys\n import math\n import bisect\n \n def solve(s):\n n = len(s)\n max_val = 0\n for i in range(1, n):\n s1 = set(list(s[0:i]))\n s2 = set(list(s[i:]))\n- val = len(s1 ^ s2)\n max_val = max(max_val, val)\n return max_val\n \n def main():\n n = int(input())\n s = input()\n print(solve(s))\n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 22 }, { "user_id": "u519339498", "problem_id": "p03338", "submission1_id": "s678464512", "submission2_id": "s945757543", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nS=input()\nans=1\nfor i in range(N-2):\n ans=max(ans,len(list(set(list(S[:i+1])) & set(list(S[i+1:])))))\nprint(ans)", "code2": "N=int(input())\nS=input()\nans=0\nfor i in range(N):\n ans=max(ans,len(list(set(list(set(list(S[:i+1])) & set(list(S[i+1:])))))))\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597283825", "date2": "1597284049", "bleu_score": "0.8889844982360751", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "6\nb`^dca\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["N=int(input()) # (0): N=6\nS=input() # (1): S=b`^dca\nans=1 # (2): ans=1\nfor i in range(N-2): # (3): i=0 (5): i=1 ... (11): NO CHANGE\n ans=max(ans,len(list(set(list(S[:i+1])) & set(list(S[i+1:]))))) # (4): NO CHANGE (6): NO CHANGE ... (10): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " N=int(input())\n S=input()\n-ans=1\n-for i in range(N-2):\n- ans=max(ans,len(list(set(list(S[:i+1])) & set(list(S[i+1:])))))\n+ans=0\n+for i in range(N):\n+ ans=max(ans,len(list(set(list(set(list(S[:i+1])) & set(list(S[i+1:])))))))\n print(ans)\n", "FL_content": " N=int(input())\n S=input()\n-ans=1\n-for i in range(N-2):\n- ans=max(ans,len(list(set(list(S[:i+1])) & set(list(S[i+1:])))))\n print(ans)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 6 }, { "user_id": "u662430503", "problem_id": "p03338", "submission1_id": "s267440389", "submission2_id": "s145841633", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\ndef main():\n n = int(input())\n s = input()\n ans=0\n for i in range(0,int(n/2)+1):\n sum=0\n x=s[:i+1]\n y=s[i+1:]\n while len(x)>0:\n if x[0] in y :\n sum+=1\n x=x.replace(x[0],'')\n if sum>ans:\n ans=sum\n print(ans)\nmain()\n", "code2": "import math\ndef main():\n n = int(input())\n s = input()\n ans=0\n for i in range(0,n):\n sum=0\n x=s[:i+1]\n y=s[i+1:]\n while len(x)>0:\n if x[0] in y :\n sum+=1\n x=x.replace(x[0],'')\n if sum>ans:\n ans=sum\n print(ans)\nmain()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594341393", "date2": "1594342141", "bleu_score": "0.953503231074013", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 93, "total_score": 103, "input": "10\naaa`abccbb\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["import math\ndef main(): # (0): main=\n n = int(input()) # (2): n=10\n s = input() # (3): s=aaa`abccbb\n ans=0 # (4): ans=0\n for i in range(0,int(n/2)+1): # (5): i=0 (16): i=1 ... (77): NO CHANGE\n sum=0 # (6): sum=0 (17): sum=0 ... (62): NO CHANGE\n x=s[:i+1] # (7): x=a (18): x=aa ... (63): x=aaa`ab\n y=s[i+1:] # (8): y=aa`abccbb (19): y=a`abccbb ... (64): y=ccbb\n while len(x)>0: # (9): NO CHANGE (13): NO CHANGE ... (75): NO CHANGE\n if x[0] in y : # (10): NO CHANGE (21): NO CHANGE ... (72): NO CHANGE\n sum+=1 # (11): sum=1 (22): sum=1 ... (73): sum=1\n x=x.replace(x[0],'') # (12): x= (23): x= ... (74): x=\n if sum>ans: # (14): NO CHANGE (25): NO CHANGE ... (76): NO CHANGE\n ans=sum # (15): ans=1\n print(ans)\nmain() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " import math\n def main():\n n = int(input())\n s = input()\n ans=0\n- for i in range(0,int(n/2)+1):\n+ for i in range(0,n):\n sum=0\n x=s[:i+1]\n y=s[i+1:]\n while len(x)>0:\n if x[0] in y :\n sum+=1\n x=x.replace(x[0],'')\n if sum>ans:\n ans=sum\n print(ans)\n main()\n-\n", "FL_content": " import math\n def main():\n n = int(input())\n s = input()\n ans=0\n- for i in range(0,int(n/2)+1):\n sum=0\n x=s[:i+1]\n y=s[i+1:]\n while len(x)>0:\n if x[0] in y :\n sum+=1\n x=x.replace(x[0],'')\n if sum>ans:\n ans=sum\n print(ans)\n main()\n-\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 18 }, { "user_id": "u578489732", "problem_id": "p03338", "submission1_id": "s713744596", "submission2_id": "s993432441", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nfrom functools import reduce\n\n\n\ndef solve(lines):\n def func(n, i, initializer=0):\n a = set(S[:i])\n b = set(S[i:])\n return max( n, len(a & b) )\n\n N = int(lines.pop(0))\n S = lines.pop(0)\n\n print( reduce( func, range(1,N) ) )\n\n\n\n\nlines = [x.strip() for x in sys.stdin.readlines()]\n\n\n\n\nsolve(lines)", "code2": "\nimport sys\nfrom functools import reduce\n\n\n\ndef solve(lines):\n def func(n, i):\n a = set(S[:i])\n b = set(S[i:])\n return max( n, len(a & b) )\n\n N = int(lines.pop(0))\n S = lines.pop(0)\n\n print( reduce( func, range(1,N), 0 ) )\n\n\n\n\nlines = [x.strip() for x in sys.stdin.readlines()]\n\n\n\n\nsolve(lines)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549596144", "date2": "1549596614", "bleu_score": "0.9490727005320709", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "6\nb`^dca\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["\nimport sys\nfrom functools import reduce\n\n\n\ndef solve(lines): # (0): solve=\n def func(n, i, initializer=0): # (3): func=.func at 0x000001AD8BEE9B40>\n a = set(S[:i]) # (7): a={'b', '`'} (9): a={'b', '^', '`'} ... (13): a={'c', '^', '`', 'd', 'b'}\n b = set(S[i:]) # (8): i=3 (10): i=4 (12): i=5\n return max( n, len(a & b) )\n\n N = int(lines.pop(0)) # (4): lines=['b`^dca'], N=6\n S = lines.pop(0) # (5): lines=[], S=b`^dca\n\n print( reduce( func, range(1,N) ) ) # (6): n=1, i=2, initializer=0\n\n\n\n\nlines = [x.strip() for x in sys.stdin.readlines()] # (1): lines=['6', 'b`^dca']\n\n\n\n\nsolve(lines) # (2): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n import sys\n from functools import reduce\n \n \n \n def solve(lines):\n- def func(n, i, initializer=0):\n+ def func(n, i):\n a = set(S[:i])\n b = set(S[i:])\n return max( n, len(a & b) )\n \n N = int(lines.pop(0))\n S = lines.pop(0)\n \n- print( reduce( func, range(1,N) ) )\n+ print( reduce( func, range(1,N), 0 ) )\n \n \n \n \n lines = [x.strip() for x in sys.stdin.readlines()]\n \n \n \n \n solve(lines)\n", "FL_content": " \n import sys\n from functools import reduce\n \n \n \n def solve(lines):\n- def func(n, i, initializer=0):\n a = set(S[:i])\n b = set(S[i:])\n return max( n, len(a & b) )\n \n N = int(lines.pop(0))\n S = lines.pop(0)\n \n- print( reduce( func, range(1,N) ) )\n \n \n \n \n lines = [x.strip() for x in sys.stdin.readlines()]\n \n \n \n \n solve(lines)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 26 }, { "user_id": "u825528847", "problem_id": "p03338", "submission1_id": "s144551127", "submission2_id": "s997227657", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nS = input()\nans = 0\nfor i in range(1, N):\n x, y = set(S[:i+1]), set(S[i:])\n cnt = 0\n for c in x:\n if c in y:\n cnt += 1\n ans = max(ans, cnt)\nprint(ans)\n", "code2": "N = int(input())\nS = input()\nans = 0\nfor i in range(1, N):\n x, y = set(S[:i]), set(S[i:])\n cnt = 0\n for c in x:\n if c in y:\n cnt += 1\n ans = max(ans, cnt)\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1528400998", "date2": "1528401101", "bleu_score": "0.9821643152834509", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 69, "total_score": 103, "input": "45\notyczfqfmgbjrfblyrtrupdiplldjktuzxhejykqthxmb\n", "actual_output": "12\n", "expected_output": "11\n\n", "anno_code": ["N = int(input()) # (0): N=45\nS = input() # (1): S=otyczfqfmgbjrfblyrtrupdiplldjktuzxhejykqthxmb\nans = 0 # (2): ans=0\nfor i in range(1, N): # (3): i=1 (13): i=2 ... (1824): NO CHANGE\n x, y = set(S[:i+1]), set(S[i:]) # (4): x={'t', 'o'}, y={'r', 'i', 'p', 'c', 'f', 'd', 'z', 't', 'g', 'j', 'u', 'l', 'k', 'h', 'y', 'b', 'x', 'm', 'q', 'e'} (14): x={'t', 'y', 'o'} ... (1777): y={'b'}\n cnt = 0 # (5): cnt=0 (15): cnt=0 ... (1778): cnt=0\n for c in x: # (6): c=t (9): c=o ... (1822): NO CHANGE\n if c in y: # (7): NO CHANGE (10): NO CHANGE ... (1821): NO CHANGE\n cnt += 1 # (8): cnt=1 (18): cnt=1 ... (1811): cnt=1\n ans = max(ans, cnt) # (12): ans=1 (25): ans=2 ... (1823): NO CHANGE\nprint(ans)\n"], "anno_status": [true], "diff_content": " N = int(input())\n S = input()\n ans = 0\n for i in range(1, N):\n- x, y = set(S[:i+1]), set(S[i:])\n+ x, y = set(S[:i]), set(S[i:])\n cnt = 0\n for c in x:\n if c in y:\n cnt += 1\n ans = max(ans, cnt)\n print(ans)\n \n", "FL_content": " N = int(input())\n S = input()\n ans = 0\n for i in range(1, N):\n- x, y = set(S[:i+1]), set(S[i:])\n cnt = 0\n for c in x:\n if c in y:\n cnt += 1\n ans = max(ans, cnt)\n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u826929627", "problem_id": "p02899", "submission1_id": "s087210574", "submission2_id": "s156971463", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int,input().split()))\n\nans = [0] * N\nfor i,a in enumerate(A):\n ans[a-1] = i+1\n\nprint(ans)", "code2": "N = int(input())\nA = list(map(int,input().split()))\n\nans = [0] * N\nfor i,a in enumerate(A):\n ans[a-1] = i+1\n\nprint(*ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579983789", "date2": "1579983828", "bleu_score": "0.9789435002605391", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 11, "input": "3\n3 -2 -1\n", "actual_output": "[2, 3, 1]\n", "expected_output": "2 3 1 \n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = list(map(int,input().split())) # (1): A=[3, -2, -1]\n\nans = [0] * N # (2): ans=[0, 0, 0]\nfor i,a in enumerate(A): # (3): i=0, a=3 (5): i=1, a=-2 ... (9): NO CHANGE\n ans[a-1] = i+1 # (4): ans=[0, 0, 1] (6): ans=[2, 0, 1] (8): ans=[2, 3, 1]\n\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int,input().split()))\n \n ans = [0] * N\n for i,a in enumerate(A):\n ans[a-1] = i+1\n \n-print(ans)\n+print(*ans)\n", "FL_content": " N = int(input())\n A = list(map(int,input().split()))\n \n ans = [0] * N\n for i,a in enumerate(A):\n ans[a-1] = i+1\n \n-print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u639343026", "problem_id": "p02899", "submission1_id": "s189513333", "submission2_id": "s647547768", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=list(map(int,input().split()))\nb=[0]*n\nfor i in range(n):\n for l in range(n):\n if a[i]==l+1:\n b[i]=l+1\n break\nprint(*b)", "code2": "n=int(input())\na=list(map(int,input().split()))\nb=[0]*n\nfor i in range(n):\n b[i]=[a[i],i+1]\nb=sorted(b, key=lambda x: x[0])\nfor i in range(n):\n if i!=n-1:\n print(b[i][1],end=\" \")\n else:\n print(b[i][1])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569719406", "date2": "1569719775", "bleu_score": "0.6072950608479625", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 1, "total_score": 11, "input": "3\n-2 0 -1\n", "actual_output": "0 0 0\n", "expected_output": "1 3 2 \n\n", "anno_code": ["n=int(input()) # (0): n=3\na=list(map(int,input().split())) # (1): a=[-2, 0, -1]\nb=[0]*n # (2): b=[0, 0, 0]\nfor i in range(n): # (3): i=0 (11): i=1 ... (27): NO CHANGE\n for l in range(n): # (4): l=0 (6): l=1 ... (26): NO CHANGE\n if a[i]==l+1: # (5): NO CHANGE (7): NO CHANGE ... (25): NO CHANGE\n b[i]=l+1\n break\nprint(*b)"], "anno_status": [true], "diff_content": " n=int(input())\n a=list(map(int,input().split()))\n b=[0]*n\n for i in range(n):\n- for l in range(n):\n- if a[i]==l+1:\n- b[i]=l+1\n- break\n-print(*b)\n+ b[i]=[a[i],i+1]\n+b=sorted(b, key=lambda x: x[0])\n+for i in range(n):\n+ if i!=n-1:\n+ print(b[i][1],end=\" \")\n+ else:\n+ print(b[i][1])\n", "FL_content": " n=int(input())\n a=list(map(int,input().split()))\n b=[0]*n\n for i in range(n):\n- for l in range(n):\n- if a[i]==l+1:\n- b[i]=l+1\n- break\n-print(*b)\n", "added_lines": 7, "removed_lines": 5, "code1_lines": 9 }, { "user_id": "u624696727", "problem_id": "p02899", "submission1_id": "s051751914", "submission2_id": "s376882735", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nsys.setrecursionlimit(10 ** 6)\nint1 = lambda x: int(x) - 1\np2D = lambda x: print(*x, sep=\"\\n\")\ndef IS(): return sys.stdin.readline()[:-1]\ndef II(): return int(sys.stdin.readline())\ndef MI(): return map(int, sys.stdin.readline().split())\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef LI1(): return list(map(int1, sys.stdin.readline().split()))\ndef LII(rows_number): return [II() for _ in range(rows_number)]\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\ndef LLI1(rows_number): return [LI1() for _ in range(rows_number)]\n\ndef main():\n\tN = II()\n\tA = LI()\n\torder = [0]*N\n\tfor i,a in enumerate(A):\n\t\torder[a-1] = i+1\n\tA = list(map(str,A))\n\tprint(\"\".join(A))\n\nmain()", "code2": "import sys\n\nsys.setrecursionlimit(10 ** 6)\nint1 = lambda x: int(x) - 1\np2D = lambda x: print(*x, sep=\"\\n\")\ndef IS(): return sys.stdin.readline()[:-1]\ndef II(): return int(sys.stdin.readline())\ndef MI(): return map(int, sys.stdin.readline().split())\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef LI1(): return list(map(int1, sys.stdin.readline().split()))\ndef LII(rows_number): return [II() for _ in range(rows_number)]\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\ndef LLI1(rows_number): return [LI1() for _ in range(rows_number)]\n\ndef main():\n\tN = II()\n\tA = LI()\n\torder = [0]*N\n\tfor i,a in enumerate(A):\n\t\torder[a-1] = i+1\n\torder = list(map(str,order))\n\tprint(\" \".join(order))\n\nmain()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1581279332", "date2": "1581281486", "bleu_score": "0.9694781727170962", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 11, "input": "3\n2 -2 3\n", "actual_output": "2-23\n", "expected_output": "2 1 3 \n\n", "anno_code": ["import sys\n\nsys.setrecursionlimit(10 ** 6) # (0): NO CHANGE\nint1 = lambda x: int(x) - 1 # (1): int1= at 0x0000018A7EB49BD0>\np2D = lambda x: print(*x, sep=\"\\n\") # (2): p2D= at 0x0000018A7EB49B40>, IS=, II=, MI=, LI=, LI1=, LII=, LLI=, LLI1=\ndef IS(): return sys.stdin.readline()[:-1]\ndef II(): return int(sys.stdin.readline())\ndef MI(): return map(int, sys.stdin.readline().split())\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef LI1(): return list(map(int1, sys.stdin.readline().split()))\ndef LII(rows_number): return [II() for _ in range(rows_number)]\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\ndef LLI1(rows_number): return [LI1() for _ in range(rows_number)]\n\ndef main(): # (3): main=\n\tN = II() # (5): N=3\n\tA = LI() # (6): A=[2, -2, 3]\n\torder = [0]*N # (7): order=[0, 0, 0]\n\tfor i,a in enumerate(A): # (8): i=0, a=2 (10): i=1, a=-2 ... (14): NO CHANGE\n\t\torder[a-1] = i+1 # (9): order=[0, 1, 0] (11): order=[2, 1, 0] (13): order=[2, 1, 3]\n\tA = list(map(str,A)) # (15): A=['2', '-2', '3']\n\tprint(\"\".join(A))\n\nmain() # (4): NO CHANGE\n"], "anno_status": [true], "diff_content": " import sys\n \n sys.setrecursionlimit(10 ** 6)\n int1 = lambda x: int(x) - 1\n p2D = lambda x: print(*x, sep=\"\\n\")\n def IS(): return sys.stdin.readline()[:-1]\n def II(): return int(sys.stdin.readline())\n def MI(): return map(int, sys.stdin.readline().split())\n def LI(): return list(map(int, sys.stdin.readline().split()))\n def LI1(): return list(map(int1, sys.stdin.readline().split()))\n def LII(rows_number): return [II() for _ in range(rows_number)]\n def LLI(rows_number): return [LI() for _ in range(rows_number)]\n def LLI1(rows_number): return [LI1() for _ in range(rows_number)]\n \n def main():\n \tN = II()\n \tA = LI()\n \torder = [0]*N\n \tfor i,a in enumerate(A):\n \t\torder[a-1] = i+1\n-\tA = list(map(str,A))\n-\tprint(\"\".join(A))\n+\torder = list(map(str,order))\n+\tprint(\" \".join(order))\n \n main()\n", "FL_content": " import sys\n \n sys.setrecursionlimit(10 ** 6)\n int1 = lambda x: int(x) - 1\n p2D = lambda x: print(*x, sep=\"\\n\")\n def IS(): return sys.stdin.readline()[:-1]\n def II(): return int(sys.stdin.readline())\n def MI(): return map(int, sys.stdin.readline().split())\n def LI(): return list(map(int, sys.stdin.readline().split()))\n def LI1(): return list(map(int1, sys.stdin.readline().split()))\n def LII(rows_number): return [II() for _ in range(rows_number)]\n def LLI(rows_number): return [LI() for _ in range(rows_number)]\n def LLI1(rows_number): return [LI1() for _ in range(rows_number)]\n \n def main():\n \tN = II()\n \tA = LI()\n \torder = [0]*N\n \tfor i,a in enumerate(A):\n \t\torder[a-1] = i+1\n-\tA = list(map(str,A))\n-\tprint(\"\".join(A))\n \n main()\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 24 }, { "user_id": "u382639013", "problem_id": "p02899", "submission1_id": "s107831354", "submission2_id": "s328085258", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split()))\nL = [0]*N\nfor i in range(0, N):\n L[A[i]-1] = i + 1\n print(L,A[i])\nprint(*L)", "code2": "N = int(input())\nA = list(map(int, input().split()))\nL = [0]*N\nfor i in range(0, N):\n L[A[i]-1] = i + 1\nprint(*L)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590761342", "date2": "1590761364", "bleu_score": "0.850577732092957", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 11, "input": "5\n2 1 3 4 5\n", "actual_output": "[0, 1, 0, 0, 0] 2\n[2, 1, 0, 0, 0] 1\n[2, 1, 3, 0, 0] 3\n[2, 1, 3, 4, 0] 4\n[2, 1, 3, 4, 5] 5\n2 1 3 4 5\n", "expected_output": "2 1 3 4 5 \n\n", "anno_code": ["N = int(input()) # (0): N=5\nA = list(map(int, input().split())) # (1): A=[2, 1, 3, 4, 5]\nL = [0]*N # (2): L=[0, 0, 0, 0, 0]\nfor i in range(0, N): # (3): i=0 (6): i=1 ... (18): NO CHANGE\n L[A[i]-1] = i + 1 # (4): L=[0, 1, 0, 0, 0] (7): L=[2, 1, 0, 0, 0] ... (16): L=[2, 1, 3, 4, 5]\n print(L,A[i]) # (5): NO CHANGE (8): NO CHANGE ... (17): NO CHANGE\nprint(*L)"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int, input().split()))\n L = [0]*N\n for i in range(0, N):\n L[A[i]-1] = i + 1\n- print(L,A[i])\n print(*L)\n", "FL_content": " N = int(input())\n A = list(map(int, input().split()))\n L = [0]*N\n for i in range(0, N):\n L[A[i]-1] = i + 1\n- print(L,A[i])\n print(*L)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u247830763", "problem_id": "p02899", "submission1_id": "s175189208", "submission2_id": "s618210499", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nls = list(map(str,input().split()))\na = [0 for j in range(n)]\nfor i in range(n):\n a[i] = ls[i] + str(i+1)\na.sort()\nfor k in range(n):\n print(a[k][int(len(a[k]))-1],end=' ')", "code2": "n = int(input())\nls = list(map(int,input().split()))\na = [0 for j in range(n)]\nfor i in range(n):\n a[i] = [ls[i],str(i+1)]\na.sort()\nfor k in range(n):\n print(a[k][1],end=' ')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588530903", "date2": "1588531864", "bleu_score": "0.8596717011242501", "code1_test_status": [1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1], "code1_test_score": 8, "total_score": 11, "input": "3\n-2 0 -1\n", "actual_output": "3 1 2 ", "expected_output": "1 3 2 \n\n", "anno_code": ["n = int(input()) # (0): n=3\nls = list(map(str,input().split())) # (1): ls=['-2', '0', '-1']\na = [0 for j in range(n)] # (2): a=[0, 0, 0]\nfor i in range(n): # (3): i=0 (5): i=1 ... (9): NO CHANGE\n a[i] = ls[i] + str(i+1) # (4): a=['-21', 0, 0] (6): a=['-21', '02', 0] (8): a=['-21', '02', '-13']\na.sort() # (10): a=['-13', '-21', '02']\nfor k in range(n): # (11): k=0 (13): k=1 (15): k=2\n print(a[k][int(len(a[k]))-1],end=' ') # (12): NO CHANGE (14): NO CHANGE (16): NO CHANGE\n"], "anno_status": [true], "diff_content": " n = int(input())\n-ls = list(map(str,input().split()))\n+ls = list(map(int,input().split()))\n a = [0 for j in range(n)]\n for i in range(n):\n- a[i] = ls[i] + str(i+1)\n+ a[i] = [ls[i],str(i+1)]\n a.sort()\n for k in range(n):\n- print(a[k][int(len(a[k]))-1],end=' ')\n+ print(a[k][1],end=' ')\n", "FL_content": " n = int(input())\n-ls = list(map(str,input().split()))\n a = [0 for j in range(n)]\n for i in range(n):\n- a[i] = ls[i] + str(i+1)\n a.sort()\n for k in range(n):\n- print(a[k][int(len(a[k]))-1],end=' ')\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u495415554", "problem_id": "p02899", "submission1_id": "s802500834", "submission2_id": "s451857101", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split()))\n\noutput = list(range(0,N))\n\nfor i in range(N):\n output[A[i] - 1] = i + 1\n\nprint(output)", "code2": "N = int(input())\nA = list(map(int, input().split()))\n\noutput = list(range(0,N))\n\nfor i in range(N):\n output[A[i] - 1] = i + 1\n\nprint(*output)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576935607", "date2": "1576935712", "bleu_score": "0.9823610456991699", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 11, "input": "3\n2 -2 3\n", "actual_output": "[2, 1, 3]\n", "expected_output": "2 1 3 \n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = list(map(int, input().split())) # (1): A=[2, -2, 3]\n\noutput = list(range(0,N)) # (2): output=[0, 1, 2]\n\nfor i in range(N): # (3): i=0 (5): i=1 ... (9): NO CHANGE\n output[A[i] - 1] = i + 1 # (4): NO CHANGE (6): output=[2, 1, 2] (8): output=[2, 1, 3]\n\nprint(output)"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int, input().split()))\n \n output = list(range(0,N))\n \n for i in range(N):\n output[A[i] - 1] = i + 1\n \n-print(output)\n+print(*output)\n", "FL_content": " N = int(input())\n A = list(map(int, input().split()))\n \n output = list(range(0,N))\n \n for i in range(N):\n output[A[i] - 1] = i + 1\n \n-print(output)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u532637712", "problem_id": "p02899", "submission1_id": "s194023259", "submission2_id": "s475674676", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nN = int(input())\nnum_list = list(map(int, input().split()))\norder_list = sorted(range(len(num_list)), key=lambda k: num_list[k])\norder_list = list(map(lambda x: x+1, order_list))\nprint('{}'.format(order_list))\n", "code2": "\n\nN = int(input())\nnum_list = list(map(int, input().split()))\norder_list = sorted(range(len(num_list)), key=lambda k: num_list[k])\norder_list = list(map(lambda x: x+1, order_list))\n[print(' '.join([str(i) for i in order_list]))]\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569724087", "date2": "1569724456", "bleu_score": "0.8664783677582678", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 11, "input": "3\n2 -2 3\n", "actual_output": "[2, 1, 3]\n", "expected_output": "2 1 3 \n\n", "anno_code": ["\n\nN = int(input()) # (0): N=3\nnum_list = list(map(int, input().split())) # (1): num_list=[2, -2, 3]\norder_list = sorted(range(len(num_list)), key=lambda k: num_list[k]) # (2): order_list=[1, 0, 2]\norder_list = list(map(lambda x: x+1, order_list)) # (3): order_list=[2, 1, 3]\nprint('{}'.format(order_list))\n"], "anno_status": [true], "diff_content": " \n \n N = int(input())\n num_list = list(map(int, input().split()))\n order_list = sorted(range(len(num_list)), key=lambda k: num_list[k])\n order_list = list(map(lambda x: x+1, order_list))\n-print('{}'.format(order_list))\n+[print(' '.join([str(i) for i in order_list]))]\n \n", "FL_content": " \n \n N = int(input())\n num_list = list(map(int, input().split()))\n order_list = sorted(range(len(num_list)), key=lambda k: num_list[k])\n order_list = list(map(lambda x: x+1, order_list))\n-print('{}'.format(order_list))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u527261492", "problem_id": "p02899", "submission1_id": "s737595767", "submission2_id": "s324229954", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nA=list(map(int,input().split()))\na=[]\nfor i in range(n):\n a.append([i+1])\nfor j in range(n):\n a[j].append(A[j])\nsorted(a,key=lambda x:x[1])\nlst=[]\nfor i in range(n):\n lst.append(a[i][0])\nprint(lst)\n \n", "code2": "n=int(input())\nA=list(map(int,input().split()))\na=[]\nfor i in range(n):\n a.append([i+1,A[i]])\nb=sorted(a,key=lambda x:x[1])\nlst=[]\nfor k in range(n):\n lst.append(b[k][0])\nprint(*lst)\n \n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569720128", "date2": "1569723806", "bleu_score": "0.7685692546042097", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 11, "input": "5\n2 1 3 4 5\n", "actual_output": "[1, 2, 3, 4, 5]\n", "expected_output": "2 1 3 4 5 \n\n", "anno_code": ["n=int(input()) # (0): n=5\nA=list(map(int,input().split())) # (1): A=[2, 1, 3, 4, 5]\na=[] # (2): a=[]\nfor i in range(n): # (3): i=0 (5): i=1 ... (13): NO CHANGE\n a.append([i+1]) # (4): a (6): a ... (12): a\nfor j in range(n): # (14): j=0 (16): a, j=1 ... (24): NO CHANGE\n a[j].append(A[j]) # (15): a (17): a ... (23): a\nsorted(a,key=lambda x:x[1]) # (25): NO CHANGE\nlst=[] # (26): lst=[]\nfor i in range(n): # (27): i=0 (29): i=1 ... (37): NO CHANGE\n lst.append(a[i][0]) # (28): lst=[1] (30): lst=[1, 2] ... (36): lst=[1, 2, 3, 4, 5]\nprint(lst)\n \n"], "anno_status": [true], "diff_content": " n=int(input())\n A=list(map(int,input().split()))\n a=[]\n for i in range(n):\n- a.append([i+1])\n-for j in range(n):\n- a[j].append(A[j])\n-sorted(a,key=lambda x:x[1])\n+ a.append([i+1,A[i]])\n+b=sorted(a,key=lambda x:x[1])\n lst=[]\n-for i in range(n):\n- lst.append(a[i][0])\n-print(lst)\n+for k in range(n):\n+ lst.append(b[k][0])\n+print(*lst)\n \n \n", "FL_content": " n=int(input())\n A=list(map(int,input().split()))\n a=[]\n for i in range(n):\n- a.append([i+1])\n-for j in range(n):\n- a[j].append(A[j])\n-sorted(a,key=lambda x:x[1])\n lst=[]\n-for i in range(n):\n- lst.append(a[i][0])\n-print(lst)\n \n \n", "added_lines": 5, "removed_lines": 7, "code1_lines": 14 }, { "user_id": "u494058663", "problem_id": "p02899", "submission1_id": "s780195571", "submission2_id": "s257125068", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = [int(i) for i in input().split()]\nNum = [int(i) for i in range(1,N+1)]\n\nList = []\nfor i in range(len(A)):\n List.append([A[i],i+1])\nprint(List)\n\nList.sort()\nans = []\nfor i in range(len(List)):\n ans.append(List[i][1])\nprint(*ans)\n", "code2": "N = int(input())\nA = [int(i) for i in input().split()]\nNum = [int(i) for i in range(1,N+1)]\n\nList = []\nfor i in range(len(A)):\n List.append([A[i],i+1])\n\n\nList.sort()\nans = []\nfor i in range(len(List)):\n ans.append(List[i][1])\nprint(*ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569719410", "date2": "1569719461", "bleu_score": "0.9468618176787261", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 11, "input": "3\n-2 0 -1\n", "actual_output": "[[-2, 1], [0, 2], [-1, 3]]\n1 3 2\n", "expected_output": "1 3 2 \n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = [int(i) for i in input().split()] # (1): A=[-2, 0, -1]\nNum = [int(i) for i in range(1,N+1)] # (2): Num=[1, 2, 3]\n\nList = [] # (3): List=[]\nfor i in range(len(A)): # (4): i=0 (6): i=1 ... (10): NO CHANGE\n List.append([A[i],i+1]) # (5): List=[[-2, 1]] (7): List (9): List\nprint(List) # (11): NO CHANGE\n\nList.sort() # (12): List\nans = [] # (13): ans=[]\nfor i in range(len(List)): # (14): i=0 (16): i=1 ... (20): NO CHANGE\n ans.append(List[i][1]) # (15): ans=[1] (17): ans=[1, 3] (19): ans=[1, 3, 2]\nprint(*ans)\n"], "anno_status": [true], "diff_content": " N = int(input())\n A = [int(i) for i in input().split()]\n Num = [int(i) for i in range(1,N+1)]\n \n List = []\n for i in range(len(A)):\n List.append([A[i],i+1])\n-print(List)\n+\n \n List.sort()\n ans = []\n for i in range(len(List)):\n ans.append(List[i][1])\n print(*ans)\n-\n", "FL_content": " N = int(input())\n A = [int(i) for i in input().split()]\n Num = [int(i) for i in range(1,N+1)]\n \n List = []\n for i in range(len(A)):\n List.append([A[i],i+1])\n-print(List)\n \n List.sort()\n ans = []\n for i in range(len(List)):\n ans.append(List[i][1])\n print(*ans)\n-\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 15 }, { "user_id": "u478719560", "problem_id": "p02899", "submission1_id": "s659428730", "submission2_id": "s960467847", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nfrom sys import stdin\nimport heapq\n\nN = int(input())\nAs = [int(x) for x in stdin.readline().rstrip().split()]\nans = [0] * N\n\nfor i in range(N):\n x = As[i]\n ans[x-1] = i + 1\n\nprint(ans)\n", "code2": "\nfrom sys import stdin\nimport heapq\n\nN = int(input())\nAs = [int(x) for x in stdin.readline().rstrip().split()]\nans = [0] * N\n\nfor i in range(N):\n x = As[i]\n ans[x-1] = i + 1\n\nans = ' '.join(map(str, ans))\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569721226", "date2": "1569721504", "bleu_score": "0.8605111275743289", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 11, "input": "8\n8 2 7 3 4 5 6 1\n", "actual_output": "[8, 2, 4, 5, 6, 7, 3, 1]\n", "expected_output": "8 2 4 5 6 7 3 1\n", "anno_code": ["\nfrom sys import stdin\nimport heapq\n\nN = int(input()) # (0): N=8\nAs = [int(x) for x in stdin.readline().rstrip().split()] # (1): As=[8, 2, 7, 3, 4, 5, 6, 1]\nans = [0] * N # (2): ans=[0, 0, 0, 0, 0, 0, 0, 0]\n\nfor i in range(N): # (3): i=0 (6): i=1 ... (27): NO CHANGE\n x = As[i] # (4): x=8 (7): x=2 ... (25): x=1\n ans[x-1] = i + 1 # (5): ans=[0, 0, 0, 0, 0, 0, 0, 1] (8): ans=[0, 2, 0, 0, 0, 0, 0, 1] ... (26): ans=[8, 2, 4, 5, 6, 7, 3, 1]\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " \n from sys import stdin\n import heapq\n \n N = int(input())\n As = [int(x) for x in stdin.readline().rstrip().split()]\n ans = [0] * N\n \n for i in range(N):\n x = As[i]\n ans[x-1] = i + 1\n \n+ans = ' '.join(map(str, ans))\n print(ans)\n \n", "FL_content": " \n from sys import stdin\n import heapq\n \n N = int(input())\n As = [int(x) for x in stdin.readline().rstrip().split()]\n ans = [0] * N\n \n for i in range(N):\n x = As[i]\n ans[x-1] = i + 1\n \n print(ans)\n \n", "added_lines": 1, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u961674365", "problem_id": "p02702", "submission1_id": "s801753575", "submission2_id": "s419202249", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nn=len(s)\nrst=[0 for j in range(2019)]\nx=0\nans=0\nfor i in range(n):\n y=(int(s[n-1-i])*(10**i))%2019\n x+=y\n if x>=2019:\n x%=2019\n print(x,y)\n ans+=rst[x]\n rst[x]+=1\nif rst[0]==1:\n ans+=1\n\nprint(ans)", "code2": "s=input()\nn=len(s)\nrst=[0 for j in range(2019)]\nrst[0]=1\nx=0\nans=0\ndrst=1\nfor i in range(n):\n y=(int(s[n-1-i])*drst)%2019\n drst=(drst*10)%2019\n x+=y\n if x>=2019:\n x%=2019\n \n ans+=rst[x]\n rst[x]+=1\n\n \n\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1587950852", "date2": "1587953506", "bleu_score": "0.8278878864158989", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 74, "input": "1176854830\n", "actual_output": "0 0\n30 30\n830 800\n792 1981\n317 1544\n793 476\n325 1551\n1595 1270\n525 949\n1939 1414\n1\n", "expected_output": "1\n\n", "anno_code": ["s=input() # (0): s=1176854830\nn=len(s) # (1): n=10\nrst=[0 for j in range(2019)] # (2): rst=[0, 0, ..., 0, 0]\nx=0 # (3): x=0\nans=0 # (4): ans=0\nfor i in range(n): # (5): i=0 (12): i=1 ... (79): NO CHANGE\n y=(int(s[n-1-i])*(10**i))%2019 # (6): y=0 (13): y=30 ... (73): y=1414\n x+=y # (7): NO CHANGE (14): x=30 ... (74): x=1939\n if x>=2019: # (8): NO CHANGE (15): NO CHANGE ... (75): NO CHANGE\n x%=2019 # (30): x=792 (38): x=317 ... (68): x=525\n print(x,y) # (9): NO CHANGE (16): NO CHANGE ... (76): NO CHANGE\n ans+=rst[x] # (10): NO CHANGE (17): NO CHANGE ... (77): NO CHANGE\n rst[x]+=1 # (11): rst=[1, 0, ..., 0, 0] (18): rst=[1, 0, ..., 0, 0] ... (78): rst=[1, 0, ..., 0, 0]\nif rst[0]==1: # (80): NO CHANGE\n ans+=1 # (81): ans=1\n\nprint(ans)"], "anno_status": [true], "diff_content": " s=input()\n n=len(s)\n rst=[0 for j in range(2019)]\n+rst[0]=1\n x=0\n ans=0\n+drst=1\n for i in range(n):\n- y=(int(s[n-1-i])*(10**i))%2019\n+ y=(int(s[n-1-i])*drst)%2019\n+ drst=(drst*10)%2019\n x+=y\n if x>=2019:\n x%=2019\n- print(x,y)\n+ \n ans+=rst[x]\n rst[x]+=1\n-if rst[0]==1:\n- ans+=1\n+\n+ \n \n print(ans)\n", "FL_content": " s=input()\n n=len(s)\n rst=[0 for j in range(2019)]\n x=0\n ans=0\n for i in range(n):\n- y=(int(s[n-1-i])*(10**i))%2019\n x+=y\n if x>=2019:\n x%=2019\n- print(x,y)\n ans+=rst[x]\n rst[x]+=1\n-if rst[0]==1:\n- ans+=1\n \n print(ans)\n", "added_lines": 7, "removed_lines": 4, "code1_lines": 17 }, { "user_id": "u910426639", "problem_id": "p02702", "submission1_id": "s223157666", "submission2_id": "s360066597", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nN = len(S)\n\nmap_ = [-1] * 2019\nmap_[0] = 0\nans = 0\nnow = 0\nfor i in range(0, N + 1):\n now = (now + int(S[N - i - 1]) * pow(10, i, 2019)) % 2019\n map_[now] += 1\n ans += map_[now]\n\nprint(ans)", "code2": "S = input()\nN = len(S)\n\nmap_ = [-1] * 2019\nmap_[0] = 0\nans = 0\nnow = 0\nfor i in range(0, N):\n now = (now + int(S[N - i - 1]) * pow(10, i, 2019)) % 2019\n map_[now] += 1\n ans += map_[now]\n\nprint(ans)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1588166884", "date2": "1588167090", "bleu_score": "0.973576688957571", "code1_test_status": [0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 61, "total_score": 74, "input": "3054417607960\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["S = input() # (0): S=3054417607960\nN = len(S) # (1): N=13\n\nmap_ = [-1] * 2019 # (2): map_=[-1, -1, ..., -1, -1]\nmap_[0] = 0 # (3): map_=[0, -1, ..., -1, -1]\nans = 0 # (4): ans=0\nnow = 0 # (5): now=0\nfor i in range(0, N + 1): # (6): i=0 (10): i=1 ... (62): NO CHANGE\n now = (now + int(S[N - i - 1]) * pow(10, i, 2019)) % 2019 # (7): NO CHANGE (11): now=60 ... (59): NO CHANGE\n map_[now] += 1 # (8): map_=[1, -1, ..., -1, -1] (12): map_=[1, -1, ..., -1, -1] ... (60): map_=[1, -1, ..., -1, -1]\n ans += map_[now] # (9): ans=1 (13): NO CHANGE ... (61): ans=4\n\nprint(ans)"], "anno_status": [true], "diff_content": " S = input()\n N = len(S)\n \n map_ = [-1] * 2019\n map_[0] = 0\n ans = 0\n now = 0\n-for i in range(0, N + 1):\n+for i in range(0, N):\n now = (now + int(S[N - i - 1]) * pow(10, i, 2019)) % 2019\n map_[now] += 1\n ans += map_[now]\n \n print(ans)\n+\n", "FL_content": " S = input()\n N = len(S)\n \n map_ = [-1] * 2019\n map_[0] = 0\n ans = 0\n now = 0\n-for i in range(0, N + 1):\n now = (now + int(S[N - i - 1]) * pow(10, i, 2019)) % 2019\n map_[now] += 1\n ans += map_[now]\n \n print(ans)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u088063513", "problem_id": "p02702", "submission1_id": "s986034089", "submission2_id": "s867249357", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nS = input()[::-1] \nN = len(S)\n\n\nremainder = [0] * 2019\ntmp = 0\nfor i in range(N):\n r = int(S[i])\n tmp += r*10**(i)\n \n remainder[tmp%2019] += 1\n tmp %= 2019\n\n \n \nremainder[0] += 1\nprint(-1)\n\n\n", "code2": "\n\nS = input()[::-1] \nN = len(S)\n\n\nremainder = [0] * 2019\ntmp = 0\nrad = 1 \nfor i in range(N):\n r = int(S[i])\n tmp += r*rad\n tmp %= 2019\n \n remainder[tmp] += 1\n rad *= 10\n rad %= 2019\n\n \n \nremainder[0] += 1\n\n\n\n\nanswer = 0\nfor i in range(2019):\n p = remainder[i]\n answer += p*(p-1)/2\nprint(int(answer))\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1588130069", "date2": "1588130950", "bleu_score": "0.6002020656898546", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 74, "input": "5235394296\n", "actual_output": "-1\n", "expected_output": "0\n\n", "anno_code": ["\n\nS = input()[::-1] # (0): S=6924935325\nN = len(S) # (1): N=10\n\n\nremainder = [0] * 2019 # (2): remainder=[0, 0, ..., 0, 0]\ntmp = 0 # (3): tmp=0\nfor i in range(N): # (4): i=0 (9): i=1 ... (54): NO CHANGE\n r = int(S[i]) # (5): r=6 (10): r=9 ... (50): r=5\n tmp += r*10**(i) # (6): tmp=6 (11): tmp=96 ... (51): tmp=5000001105\n \n remainder[tmp%2019] += 1 # (7): remainder=[0, 0, ..., 0, 0] (12): remainder=[0, 0, ..., 0, 0] ... (52): remainder=[0, 0, ..., 0, 0]\n tmp %= 2019 # (8): NO CHANGE (13): NO CHANGE ... (53): tmp=99\n\n \n \nremainder[0] += 1 # (55): remainder=[1, 0, ..., 0, 0]\nprint(-1)\n\n\n"], "anno_status": [true], "diff_content": " \n \n S = input()[::-1] \n N = len(S)\n \n \n remainder = [0] * 2019\n tmp = 0\n+rad = 1 \n for i in range(N):\n r = int(S[i])\n- tmp += r*10**(i)\n- \n- remainder[tmp%2019] += 1\n+ tmp += r*rad\n tmp %= 2019\n+ \n+ remainder[tmp] += 1\n+ rad *= 10\n+ rad %= 2019\n \n \n \n remainder[0] += 1\n-print(-1)\n \n \n \n+\n+answer = 0\n+for i in range(2019):\n+ p = remainder[i]\n+ answer += p*(p-1)/2\n+print(int(answer))\n+\n", "FL_content": " \n \n S = input()[::-1] \n N = len(S)\n \n \n remainder = [0] * 2019\n tmp = 0\n for i in range(N):\n r = int(S[i])\n- tmp += r*10**(i)\n- \n- remainder[tmp%2019] += 1\n tmp %= 2019\n \n \n \n remainder[0] += 1\n-print(-1)\n \n \n \n", "added_lines": 13, "removed_lines": 4, "code1_lines": 22 }, { "user_id": "u961674365", "problem_id": "p02702", "submission1_id": "s502964823", "submission2_id": "s419202249", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nn=len(s)\nrst=[0 for j in range(2019)]\nx=0\nans=0\ndrst=1\nfor i in range(n):\n y=int(s[n-1-i])*drst%2019\n drst=(drst*10)%2019\n x+=y\n if x>=2019:\n x%=2019\n \n ans+=rst[x]\n rst[x]+=1\nif rst[0]==1:\n ans+=1\n\nprint(ans)", "code2": "s=input()\nn=len(s)\nrst=[0 for j in range(2019)]\nrst[0]=1\nx=0\nans=0\ndrst=1\nfor i in range(n):\n y=(int(s[n-1-i])*drst)%2019\n drst=(drst*10)%2019\n x+=y\n if x>=2019:\n x%=2019\n \n ans+=rst[x]\n rst[x]+=1\n\n \n\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1587952285", "date2": "1587953506", "bleu_score": "0.9237484068990053", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 73, "total_score": 74, "input": "880430372400\n", "actual_output": "3\n", "expected_output": "5\n\n", "anno_code": ["s=input() # (0): s=880430372400\nn=len(s) # (1): n=12\nrst=[0 for j in range(2019)] # (2): rst=[0, 0, ..., 0, 0]\nx=0 # (3): x=0\nans=0 # (4): ans=0\ndrst=1 # (5): drst=1\nfor i in range(n): # (6): i=0 (13): i=1 ... (94): NO CHANGE\n y=int(s[n-1-i])*drst%2019 # (7): y=0 (14): NO CHANGE ... (88): y=560\n drst=(drst*10)%2019 # (8): drst=10 (15): drst=100 ... (89): drst=700\n x+=y # (9): NO CHANGE (16): NO CHANGE ... (90): x=957\n if x>=2019: # (10): NO CHANGE (17): NO CHANGE ... (91): NO CHANGE\n x%=2019 # (32): x=381 (47): x=904 ... (70): x=341\n \n ans+=rst[x] # (11): NO CHANGE (18): ans=1 ... (92): NO CHANGE\n rst[x]+=1 # (12): rst=[1, 0, ..., 0, 0] (19): rst=[2, 0, ..., 0, 0] ... (93): rst=[2, 0, ..., 0, 0]\nif rst[0]==1: # (95): NO CHANGE\n ans+=1\n\nprint(ans)"], "anno_status": [true], "diff_content": " s=input()\n n=len(s)\n rst=[0 for j in range(2019)]\n+rst[0]=1\n x=0\n ans=0\n drst=1\n for i in range(n):\n- y=int(s[n-1-i])*drst%2019\n+ y=(int(s[n-1-i])*drst)%2019\n drst=(drst*10)%2019\n x+=y\n if x>=2019:\n x%=2019\n \n ans+=rst[x]\n rst[x]+=1\n-if rst[0]==1:\n- ans+=1\n+\n+ \n \n print(ans)\n", "FL_content": " s=input()\n n=len(s)\n rst=[0 for j in range(2019)]\n x=0\n ans=0\n drst=1\n for i in range(n):\n- y=int(s[n-1-i])*drst%2019\n drst=(drst*10)%2019\n x+=y\n if x>=2019:\n x%=2019\n \n ans+=rst[x]\n rst[x]+=1\n-if rst[0]==1:\n- ans+=1\n \n print(ans)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 19 }, { "user_id": "u652569315", "problem_id": "p02702", "submission1_id": "s809174281", "submission2_id": "s513299389", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n s=input()[::-1]\n l,mod=len(s),2019\n x=[0]*(l+1)\n x[1]=(int(s[0])*(pow(10,1,mod)))%mod\n for i in range(2,l+1):\n x[i]=((int(s[i-1])*(pow(10,i,mod)))+x[i-1])%mod\n ll=len(set(x))\n print(l-ll+1)\nif __name__=='__main__':\n main()", "code2": "def main():\n s=input()[::-1]\n l,mod=len(s),2019\n x=[0]*mod\n x[0]=1\n a,t=0,1\n for i in range(l):\n a = (a + int(s[i])*t) % 2019\n x[a]+=1\n t=(t*10)%mod\n ans=sum([i*(i-1)\n print(ans)\nif __name__=='__main__':\n main()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1587958088", "date2": "1587958829", "bleu_score": "0.6345015325760955", "code1_test_status": [1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 66, "total_score": 74, "input": "649171600089\n", "actual_output": "3\n", "expected_output": "6\n\n", "anno_code": ["def main(): # (0): main=\n s=input()[::-1]\n l,mod=len(s),2019\n x=[0]*(l+1)\n x[1]=(int(s[0])*(pow(10,1,mod)))%mod\n for i in range(2,l+1):\n x[i]=((int(s[i-1])*(pow(10,i,mod)))+x[i-1])%mod\n ll=len(set(x))\n print(l-ll+1)\nif __name__=='__main__':\n main()"], "anno_status": [true], "diff_content": " def main():\n s=input()[::-1]\n l,mod=len(s),2019\n- x=[0]*(l+1)\n- x[1]=(int(s[0])*(pow(10,1,mod)))%mod\n- for i in range(2,l+1):\n- x[i]=((int(s[i-1])*(pow(10,i,mod)))+x[i-1])%mod\n- ll=len(set(x))\n- print(l-ll+1)\n+ x=[0]*mod\n+ x[0]=1\n+ a,t=0,1\n+ for i in range(l):\n+ a = (a + int(s[i])*t) % 2019\n+ x[a]+=1\n+ t=(t*10)%mod\n+ ans=sum([i*(i-1)\n+ print(ans)\n if __name__=='__main__':\n main()\n", "FL_content": " def main():\n s=input()[::-1]\n l,mod=len(s),2019\n- x=[0]*(l+1)\n- x[1]=(int(s[0])*(pow(10,1,mod)))%mod\n- for i in range(2,l+1):\n- x[i]=((int(s[i-1])*(pow(10,i,mod)))+x[i-1])%mod\n- ll=len(set(x))\n- print(l-ll+1)\n if __name__=='__main__':\n main()\n", "added_lines": 9, "removed_lines": 6, "code1_lines": 11 }, { "user_id": "u250583425", "problem_id": "p02702", "submission1_id": "s145912414", "submission2_id": "s500523892", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ndef input(): return sys.stdin.readline().rstrip()\n\ndef main():\n S = input()\n ans = 0\n for i in range(0, 200000, 2019):\n ind = -1\n stri = str(i)\n while True:\n ind = S.find(stri, ind + 1)\n if ind >= 0:\n ans += 1\n else:\n break\n print(ans)\n\nif __name__ == '__main__':\n main()\n", "code2": "import sys\ndef input(): return sys.stdin.readline().rstrip()\n\ndef main():\n S = input()\n s_list = list(map(int, list(S)))[::-1]\n MOD = 2019\n\n sum_v = 0\n cnt = [0] * MOD\n cnt[0] = 1\n for i, s in enumerate(s_list):\n sum_v += s * pow(10, i, MOD)\n sum_v %= MOD\n cnt[sum_v] += 1\n print(sum([c * (c - 1) \n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1587951034", "date2": "1588174233", "bleu_score": "0.6048023939264042", "code1_test_status": [1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 66, "total_score": 74, "input": "2612900314\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["import sys\ndef input(): return sys.stdin.readline().rstrip()\n\ndef main(): # (0): main=\n S = input()\n ans = 0\n for i in range(0, 200000, 2019):\n ind = -1\n stri = str(i)\n while True:\n ind = S.find(stri, ind + 1)\n if ind >= 0:\n ans += 1\n else:\n break\n print(ans)\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " import sys\n def input(): return sys.stdin.readline().rstrip()\n \n def main():\n S = input()\n- ans = 0\n- for i in range(0, 200000, 2019):\n- ind = -1\n- stri = str(i)\n- while True:\n- ind = S.find(stri, ind + 1)\n- if ind >= 0:\n- ans += 1\n- else:\n- break\n- print(ans)\n+ s_list = list(map(int, list(S)))[::-1]\n+ MOD = 2019\n+\n+ sum_v = 0\n+ cnt = [0] * MOD\n+ cnt[0] = 1\n+ for i, s in enumerate(s_list):\n+ sum_v += s * pow(10, i, MOD)\n+ sum_v %= MOD\n+ cnt[sum_v] += 1\n+ print(sum([c * (c - 1) \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " import sys\n def input(): return sys.stdin.readline().rstrip()\n \n def main():\n S = input()\n- ans = 0\n- for i in range(0, 200000, 2019):\n- ind = -1\n- stri = str(i)\n- while True:\n- ind = S.find(stri, ind + 1)\n- if ind >= 0:\n- ans += 1\n- else:\n- break\n- print(ans)\n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 11, "removed_lines": 11, "code1_lines": 20 }, { "user_id": "u991134049", "problem_id": "p02702", "submission1_id": "s783661623", "submission2_id": "s706415755", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\namari = [0]*2019\nans = 0\nfor i in range(len(S)):\n amari[int(S[len(S)-1-i:]) % 2019] += 1\nfor i in amari:\n if i >= 2:\n ans += i*(i-1)/2\nprint(ans)\n ", "code2": "S = input()\namari = [0]*2019\nans = 0\namari[0] = 1\nA = 0\nfor i in range(len(S)):\n A += pow(10, i, 2019)*(int(S[len(S)-1-i]))\n amari[A % 2019] += 1\nfor i in amari:\n if i >= 2:\n ans += i*(i-1)/2\nprint(int(ans))\n \n ", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1589775237", "date2": "1589777149", "bleu_score": "0.7109531459689303", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1], "code1_test_score": 26, "total_score": 74, "input": "8498035987509\n", "actual_output": "2.0\n", "expected_output": "2\n\n", "anno_code": ["S = input() # (0): S=8498035987509\namari = [0]*2019 # (1): amari=[0, 0, ..., 0, 0]\nans = 0 # (2): ans=0\nfor i in range(len(S)): # (3): i=0 (5): i=1 ... (29): NO CHANGE\n amari[int(S[len(S)-1-i:]) % 2019] += 1 # (4): amari=[0, 0, ..., 0, 0] (6): amari=[0, 0, ..., 0, 0] ... (28): amari=[0, 0, ..., 0, 0]\nfor i in amari: # (30): i=0 (32): NO CHANGE ... (4070): NO CHANGE\n if i >= 2: # (31): NO CHANGE (33): NO CHANGE ... (4069): NO CHANGE\n ans += i*(i-1)/2 # (50): ans=1.0 (1739): ans=2.0\nprint(ans)\n "], "anno_status": [true], "diff_content": " S = input()\n amari = [0]*2019\n ans = 0\n+amari[0] = 1\n+A = 0\n for i in range(len(S)):\n- amari[int(S[len(S)-1-i:]) % 2019] += 1\n+ A += pow(10, i, 2019)*(int(S[len(S)-1-i]))\n+ amari[A % 2019] += 1\n for i in amari:\n if i >= 2:\n ans += i*(i-1)/2\n-print(ans)\n+print(int(ans))\n+ \n \n", "FL_content": " S = input()\n amari = [0]*2019\n ans = 0\n for i in range(len(S)):\n- amari[int(S[len(S)-1-i:]) % 2019] += 1\n for i in amari:\n if i >= 2:\n ans += i*(i-1)/2\n-print(ans)\n \n", "added_lines": 6, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u773865844", "problem_id": "p02702", "submission1_id": "s554412245", "submission2_id": "s137397724", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = str(input())\n\n\nA = []\np =1\nfor i in range(len(S)):\n A.append(p)\n p = p*10%2019\n\n\nX = []\na = 0\nfor i in range(len(S)):\n a = (a + int(S[len(S)-i-1])*A[i]) %2019\n X.append(a)\nX.sort()\nflag =1\nn = 0\n\n\nfor i in range(len(X)-1):\n if X[i]==0:\n n +=1\n if X[i]==X[i+1]:\n flag += 1\n else:\n n += flag*(flag-1)\n flag = 1\nprint(n)", "code2": "S = str(input())\n\n\nA = []\np =1\nfor i in range(len(S)):\n A.append(p)\n p = p*10%2019\n\n\nX = []\na = 0\nfor i in range(len(S)):\n a = (a + int(S[len(S)-i-1])*A[i]) %2019\n X.append(a)\nX.sort()\nflag =1\nn = 0\n\n\nfor i in range(len(X)-1):\n if X[i]==0:\n n +=1\n if X[i]==X[i+1]:\n flag += 1\n else:\n n += int(flag*(flag-1)/2)\n flag = 1\nn += int(flag*(flag-1)/2)\nif X[len(X)-1]==0:\n n +=1\nprint(n)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1588197504", "date2": "1588199806", "bleu_score": "0.8410116689019727", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1], "code1_test_score": 31, "total_score": 74, "input": "5256140109\n", "actual_output": "4\n", "expected_output": "2\n\n", "anno_code": ["S = str(input()) # (0): S=5256140109\n\n\nA = [] # (1): A=[]\np =1 # (2): p=1\nfor i in range(len(S)): # (3): i=0 (6): i=1 ... (33): NO CHANGE\n A.append(p) # (4): A=[1] (7): A=[1, 10] ... (31): A=[1, 10, 100, 1000, 1924, 1069, 595, 1912, 949, 1414]\n p = p*10%2019 # (5): p=10 (8): p=100 ... (32): p=7\n\n\nX = [] # (34): X=[]\na = 0 # (35): a=0\nfor i in range(len(S)): # (36): i=0 (39): i=1 ... (66): NO CHANGE\n a = (a + int(S[len(S)-i-1])*A[i]) %2019 # (37): a=9 (40): NO CHANGE ... (64): a=687\n X.append(a) # (38): X=[9] (41): X=[9, 9] ... (65): X=[9, 9, 109, 109, 1748, 798, 330, 1814, 1693, 687]\nX.sort() # (67): X=[9, 9, 109, 109, 330, 687, 798, 1693, 1748, 1814]\nflag =1 # (68): flag=1\nn = 0 # (69): n=0\n\n\nfor i in range(len(X)-1): # (70): i=0 (74): i=1 ... (113): NO CHANGE\n if X[i]==0: # (71): NO CHANGE (75): NO CHANGE ... (109): NO CHANGE\n n +=1\n if X[i]==X[i+1]: # (72): NO CHANGE (76): NO CHANGE ... (110): NO CHANGE\n flag += 1 # (73): flag=2 (82): flag=2\n else:\n n += flag*(flag-1) # (77): n=2 (86): n=4 ... (111): NO CHANGE\n flag = 1 # (78): flag=1 (87): flag=1 ... (112): NO CHANGE\nprint(n)"], "anno_status": [true], "diff_content": " S = str(input())\n \n \n A = []\n p =1\n for i in range(len(S)):\n A.append(p)\n p = p*10%2019\n \n \n X = []\n a = 0\n for i in range(len(S)):\n a = (a + int(S[len(S)-i-1])*A[i]) %2019\n X.append(a)\n X.sort()\n flag =1\n n = 0\n \n \n for i in range(len(X)-1):\n if X[i]==0:\n n +=1\n if X[i]==X[i+1]:\n flag += 1\n else:\n- n += flag*(flag-1)\n+ n += int(flag*(flag-1)/2)\n flag = 1\n+n += int(flag*(flag-1)/2)\n+if X[len(X)-1]==0:\n+ n +=1\n print(n)\n+\n", "FL_content": " S = str(input())\n \n \n A = []\n p =1\n for i in range(len(S)):\n A.append(p)\n p = p*10%2019\n \n \n X = []\n a = 0\n for i in range(len(S)):\n a = (a + int(S[len(S)-i-1])*A[i]) %2019\n X.append(a)\n X.sort()\n flag =1\n n = 0\n \n \n for i in range(len(X)-1):\n if X[i]==0:\n n +=1\n if X[i]==X[i+1]:\n flag += 1\n else:\n- n += flag*(flag-1)\n flag = 1\n print(n)\n", "added_lines": 5, "removed_lines": 1, "code1_lines": 29 }, { "user_id": "u087356957", "problem_id": "p02702", "submission1_id": "s331921778", "submission2_id": "s042020839", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\n\nS = stdin.readline().rstrip()\nN = len(S)\nSp = S\n\nres_map = [0 for _ in range(N)]\n\naa_list2 = [1]\nfor i in range(1,N):\n aa_list2.append((aa_list2[i-1]*10)%2019)\n\n\nres_map[N-1] = int(S[N-1])\nindex=1\nfor i in range(N-2,-1,-1):\n res_map[i] = (int(S[i])*aa_list2[index] + res_map[i+1])%2019\n index+=1\n\nres_map.sort()\ntemp_num=res_map[0]\nindex=1\ntot = 0\n\nfor i in range(1,N):\n if temp_num==res_map[i]:\n index+=1\n continue\n else:\n if index==1 and temp_num==0:\n tot+=1\n elif index>1:\n tot += index*(index-1)/2\n \n index=1\n temp_num=res_map[i]\n\n\n\n\n\nprint(int(tot))\n\n", "code2": "from sys import stdin\n\nS = stdin.readline().rstrip()\nN = len(S)\nSp = S\n\nres_map = [0 for _ in range(N)]\n\naa_list2 = [1]\nfor i in range(1,N):\n aa_list2.append((aa_list2[i-1]*10)%2019)\n\nres_map[N-1] = int(S[N-1])\nindex=1\n\n\nfor i in range(N-2,-1,-1):\n res_map[i] = (int(S[i])*aa_list2[index] + res_map[i+1])%2019\n index+=1\n\naa_table = [0 for i in range(2019)]\nfor i in range(len(res_map)):\n aa_table[res_map[i]]+=1\n\naa_table[0]+=1\n\ntot = 0\nfor i in range(2019):\n tot+=int((aa_table[i]-1)*aa_table[i]/2)\n\nprint(tot)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1587954058", "date2": "1587957615", "bleu_score": "0.6095067740074601", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 69, "total_score": 74, "input": "3054417607960\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["from sys import stdin\n\nS = stdin.readline().rstrip() # (0): S=3054417607960\nN = len(S) # (1): N=13\nSp = S # (2): Sp=3054417607960\n\nres_map = [0 for _ in range(N)] # (3): res_map=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\naa_list2 = [1] # (4): aa_list2=[1]\nfor i in range(1,N): # (5): i=1 (7): i=2 ... (29): NO CHANGE\n aa_list2.append((aa_list2[i-1]*10)%2019) # (6): aa_list2=[1, 10] (8): aa_list2=[1, 10, 100] ... (28): aa_list2=[1, 10, 100, 1000, 1924, 1069, 595, 1912, 949, 1414, 7, 70, 700]\n\n\nres_map[N-1] = int(S[N-1]) # (30): NO CHANGE\nindex=1 # (31): index=1\nfor i in range(N-2,-1,-1): # (32): i=11 (35): i=10 ... (68): NO CHANGE\n res_map[i] = (int(S[i])*aa_list2[index] + res_map[i+1])%2019 # (33): res_map=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 60, 0] (36): res_map=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 960, 60, 0] ... (66): res_map=[1753, 1672, 1672, 1637, 19, 261, 368, 241, 1903, 1903, 960, 60, 0]\n index+=1 # (34): index=2 (37): index=3 ... (67): index=13\n\nres_map.sort() # (69): res_map=[0, 19, 60, 241, 261, 368, 960, 1637, 1672, 1672, 1753, 1903, 1903]\ntemp_num=res_map[0] # (70): temp_num=0\nindex=1 # (71): index=1\ntot = 0 # (72): tot=0\n\nfor i in range(1,N): # (73): i=1 (79): i=2 ... (142): NO CHANGE\n if temp_num==res_map[i]: # (74): NO CHANGE (80): NO CHANGE ... (139): NO CHANGE\n index+=1 # (123): index=2 (140): index=2\n continue # (124): NO CHANGE (141): NO CHANGE\n else:\n if index==1 and temp_num==0: # (75): NO CHANGE (81): NO CHANGE ... (134): NO CHANGE\n tot+=1 # (76): tot=1\n elif index>1: # (82): NO CHANGE (88): NO CHANGE ... (135): NO CHANGE\n tot += index*(index-1)/2 # (129): tot=2.0\n \n index=1 # (77): NO CHANGE (83): NO CHANGE ... (136): NO CHANGE\n temp_num=res_map[i] # (78): temp_num=19 (84): temp_num=60 ... (137): temp_num=1903\n\n\n\n\n\nprint(int(tot))\n\n"], "anno_status": [false], "diff_content": " from sys import stdin\n \n S = stdin.readline().rstrip()\n N = len(S)\n Sp = S\n \n res_map = [0 for _ in range(N)]\n \n aa_list2 = [1]\n for i in range(1,N):\n aa_list2.append((aa_list2[i-1]*10)%2019)\n \n-\n res_map[N-1] = int(S[N-1])\n index=1\n+\n+\n for i in range(N-2,-1,-1):\n res_map[i] = (int(S[i])*aa_list2[index] + res_map[i+1])%2019\n index+=1\n \n-res_map.sort()\n-temp_num=res_map[0]\n-index=1\n-tot = 0\n+aa_table = [0 for i in range(2019)]\n+for i in range(len(res_map)):\n+ aa_table[res_map[i]]+=1\n \n-for i in range(1,N):\n- if temp_num==res_map[i]:\n- index+=1\n- continue\n- else:\n- if index==1 and temp_num==0:\n- tot+=1\n- elif index>1:\n- tot += index*(index-1)/2\n- \n- index=1\n- temp_num=res_map[i]\n+aa_table[0]+=1\n \n+tot = 0\n+for i in range(2019):\n+ tot+=int((aa_table[i]-1)*aa_table[i]/2)\n \n-\n-\n-\n-print(int(tot))\n-\n+print(tot)\n \n", "FL_content": " from sys import stdin\n \n S = stdin.readline().rstrip()\n N = len(S)\n Sp = S\n \n res_map = [0 for _ in range(N)]\n \n aa_list2 = [1]\n for i in range(1,N):\n aa_list2.append((aa_list2[i-1]*10)%2019)\n \n-\n res_map[N-1] = int(S[N-1])\n index=1\n for i in range(N-2,-1,-1):\n res_map[i] = (int(S[i])*aa_list2[index] + res_map[i+1])%2019\n index+=1\n \n-res_map.sort()\n-temp_num=res_map[0]\n-index=1\n-tot = 0\n \n-for i in range(1,N):\n- if temp_num==res_map[i]:\n- index+=1\n- continue\n- else:\n- if index==1 and temp_num==0:\n- tot+=1\n- elif index>1:\n- tot += index*(index-1)/2\n- \n- index=1\n- temp_num=res_map[i]\n \n \n-\n-\n-\n-print(int(tot))\n-\n \n", "added_lines": 10, "removed_lines": 22, "code1_lines": 44 }, { "user_id": "u150664457", "problem_id": "p02702", "submission1_id": "s421312200", "submission2_id": "s027164434", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\n\nn = len(S)\n\nmodlist = [0] * 2019\nnum = 0\nmods = 1\n\nfor i in range(n):\n fig = int(S[n - i - 1])\n mods = mods % 2019\n num = (num + fig * mods) % 2019\n modlist[num] = modlist[num] + 1\n mods = mods * 10\n\nresult = 0\nif modlist[0] > 0:\n result += 1\n\nfor i in range(2019):\n m = modlist[i]\n if n != 0:\n result += m * (m - 1) / 2\n\nprint(int(result))", "code2": "S = input()\n\nn = len(S)\n\nmedalist = [0] * 2019\nmedalist[0] = 1\nnum = 0\nmods = 1\n\nfor i in range(n):\n fig = int(S[n - i - 1])\n num = (num + fig * mods) % 2019\n medalist[num] = medalist[num] + 1\n mods = (mods * 10) % 2019\n\nresult = 0\n\nfor i in range(2019):\n m = medalist[i]\n if m != 0:\n result += m * (m - 1) / 2\n\nprint(int(result))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1588548243", "date2": "1588548893", "bleu_score": "0.8390863240394524", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 73, "total_score": 74, "input": "880430372400\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["S = input() # (0): S=880430372400\n\nn = len(S) # (1): n=12\n\nmodlist = [0] * 2019 # (2): modlist=[0, 0, ..., 0, 0]\nnum = 0 # (3): num=0\nmods = 1 # (4): mods=1\n\nfor i in range(n): # (5): i=0 (11): i=1 ... (77): NO CHANGE\n fig = int(S[n - i - 1]) # (6): fig=0 (12): NO CHANGE ... (72): NO CHANGE\n mods = mods % 2019 # (7): NO CHANGE (13): NO CHANGE ... (73): NO CHANGE\n num = (num + fig * mods) % 2019 # (8): NO CHANGE (14): NO CHANGE ... (74): num=957\n modlist[num] = modlist[num] + 1 # (9): modlist=[1, 0, ..., 0, 0] (15): modlist=[2, 0, ..., 0, 0] ... (75): modlist=[2, 0, ..., 0, 0]\n mods = mods * 10 # (10): mods=10 (16): mods=100 ... (76): mods=700\n\nresult = 0 # (78): result=0\nif modlist[0] > 0: # (79): NO CHANGE\n result += 1 # (80): result=1\n\nfor i in range(2019): # (81): i=0 (85): i=1 ... (8157): NO CHANGE\n m = modlist[i] # (82): m=2 (86): m=0 ... (8154): NO CHANGE\n if n != 0: # (83): NO CHANGE (87): NO CHANGE ... (8155): NO CHANGE\n result += m * (m - 1) / 2 # (84): result=2.0 (88): NO CHANGE ... (8156): NO CHANGE\n\nprint(int(result))"], "anno_status": [true], "diff_content": " S = input()\n \n n = len(S)\n \n-modlist = [0] * 2019\n+medalist = [0] * 2019\n+medalist[0] = 1\n num = 0\n mods = 1\n \n for i in range(n):\n fig = int(S[n - i - 1])\n- mods = mods % 2019\n num = (num + fig * mods) % 2019\n- modlist[num] = modlist[num] + 1\n- mods = mods * 10\n+ medalist[num] = medalist[num] + 1\n+ mods = (mods * 10) % 2019\n \n result = 0\n-if modlist[0] > 0:\n- result += 1\n \n for i in range(2019):\n- m = modlist[i]\n- if n != 0:\n+ m = medalist[i]\n+ if m != 0:\n result += m * (m - 1) / 2\n \n print(int(result))\n", "FL_content": " S = input()\n \n n = len(S)\n \n-modlist = [0] * 2019\n num = 0\n mods = 1\n \n for i in range(n):\n fig = int(S[n - i - 1])\n- mods = mods % 2019\n num = (num + fig * mods) % 2019\n- modlist[num] = modlist[num] + 1\n- mods = mods * 10\n \n result = 0\n-if modlist[0] > 0:\n- result += 1\n \n for i in range(2019):\n- m = modlist[i]\n- if n != 0:\n result += m * (m - 1) / 2\n \n print(int(result))\n", "added_lines": 6, "removed_lines": 8, "code1_lines": 25 }, { "user_id": "u037098269", "problem_id": "p03739", "submission1_id": "s476645428", "submission2_id": "s484514340", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nnum_list = list(map(int, input().split()))\ncount = 0\nsum_ = num_list[0]\nif sum_ > 0:\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n sum_ -= abs(sum_) + 1\n count += abs(sum_) + 1\n print(count) \nelif sum_ < 0:\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n sum_ += -abs(sum_) - 1\n count += abs(sum_) + 1 \n print(count) \nelse:\n sum_ = 1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n sum_ -= -abs(sum_) - 1\n count += abs(sum_) + 1\n count1 = count \n sum_ = -1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1 \n count2 = count \n print(min(count1, count2))", "code2": "n = int(input())\nnum_list = list(map(int, input().split()))\ncount = 0\nsum_ = num_list[0]\nif sum_ > 0:\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n count += abs(sum_) + 1\n sum_ = 1\n else:\n if sum_ >= 0:\n count += abs(sum_) + 1\n sum_ = -1\n count1 = count\n \n count = 0\n sum_ = -1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n count += abs(sum_) + 1\n sum_ = 1\n else:\n if sum_ >= 0:\n count += abs(sum_) + 1\n sum_ = -1\n count2 = count + num_list[0] + 1\n \n print(min(count1, count2))\nelif sum_ < 0:\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n count += abs(sum_) + 1\n sum_ = 1\n else:\n if sum_ >= 0:\n count += abs(sum_) + 1\n sum_ = -1\n count1 = count\n \n count = 0\n sum_ = 1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n count += abs(sum_) + 1\n sum_ = 1\n else:\n if sum_ >= 0:\n count += abs(sum_) + 1\n sum_ = -1\n count2 = count + abs(num_list[0]) + 1\n \n print(min(count1, count2))\n \nelse:\n sum_ = -1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n count += abs(sum_) + 1\n sum_ = 1\n else:\n if sum_ >= 0:\n count += abs(sum_) + 1\n sum_ = -1\n count1 = count + 1\n \n count = 0\n sum_ = 1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n count += abs(sum_) + 1\n sum_ = 1\n else:\n if sum_ >= 0:\n count += abs(sum_) + 1\n sum_ = -1\n count2 = count + 1 \n\n print(min(count1, count2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1542511557", "date2": "1542568220", "bleu_score": "0.6770445590459119", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0], "code1_test_score": 4, "total_score": 94, "input": "6\n-1 4 1 2 -5 0\n", "actual_output": "4\n", "expected_output": "10\n\n", "anno_code": ["n = int(input()) # (0): n=6\nnum_list = list(map(int, input().split())) # (1): num_list=[-1, 4, 1, 2, -5, 0]\ncount = 0 # (2): count=0\nsum_ = num_list[0] # (3): sum_=-1\nif sum_ > 0: # (4): NO CHANGE\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n sum_ -= abs(sum_) + 1\n count += abs(sum_) + 1\n print(count) \nelif sum_ < 0: # (5): NO CHANGE\n for i in range(1, n): # (6): i=1 (10): i=2 ... (30): NO CHANGE\n sum_ += num_list[i] # (7): sum_=3 (11): sum_=4 ... (25): NO CHANGE\n if i%2 == 1: # (8): NO CHANGE (12): NO CHANGE ... (26): NO CHANGE\n if sum_ <= 0: # (9): NO CHANGE (19): NO CHANGE (27): NO CHANGE\n sum_ += abs(sum_) + 1 # (28): sum_=1\n count += abs(sum_) + 1 # (29): count=4\n else:\n if sum_ >= 0: # (13): NO CHANGE (23): NO CHANGE\n sum_ += -abs(sum_) - 1 # (14): sum_=-1\n count += abs(sum_) + 1 # (15): count=2\n print(count) \nelse:\n sum_ = 1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n sum_ -= -abs(sum_) - 1\n count += abs(sum_) + 1\n count1 = count \n sum_ = -1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1 \n count2 = count \n print(min(count1, count2))"], "anno_status": [false], "diff_content": " n = int(input())\n num_list = list(map(int, input().split()))\n count = 0\n sum_ = num_list[0]\n if sum_ > 0:\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n- sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n+ sum_ = 1\n else:\n if sum_ >= 0:\n- sum_ -= abs(sum_) + 1\n count += abs(sum_) + 1\n- print(count) \n+ sum_ = -1\n+ count1 = count\n+ \n+ count = 0\n+ sum_ = -1\n+ for i in range(1, n):\n+ sum_ += num_list[i]\n+ if i%2 == 1:\n+ if sum_ <= 0:\n+ count += abs(sum_) + 1\n+ sum_ = 1\n+ else:\n+ if sum_ >= 0:\n+ count += abs(sum_) + 1\n+ sum_ = -1\n+ count2 = count + num_list[0] + 1\n+ \n+ print(min(count1, count2))\n elif sum_ < 0:\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n- sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n+ sum_ = 1\n else:\n if sum_ >= 0:\n- sum_ += -abs(sum_) - 1\n- count += abs(sum_) + 1 \n- print(count) \n-else:\n+ count += abs(sum_) + 1\n+ sum_ = -1\n+ count1 = count\n+ \n+ count = 0\n sum_ = 1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n- sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n+ sum_ = 1\n else:\n if sum_ >= 0:\n- sum_ -= -abs(sum_) - 1\n count += abs(sum_) + 1\n- count1 = count \n+ sum_ = -1\n+ count2 = count + abs(num_list[0]) + 1\n+ \n+ print(min(count1, count2))\n+ \n+else:\n sum_ = -1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n- sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n+ sum_ = 1\n+ else:\n+ if sum_ >= 0:\n+ count += abs(sum_) + 1\n+ sum_ = -1\n+ count1 = count + 1\n+ \n+ count = 0\n+ sum_ = 1\n+ for i in range(1, n):\n+ sum_ += num_list[i]\n+ if i%2 == 0:\n+ if sum_ <= 0:\n+ count += abs(sum_) + 1\n+ sum_ = 1\n else:\n if sum_ >= 0:\n- sum_ += abs(sum_) + 1\n- count += abs(sum_) + 1 \n- count2 = count \n+ count += abs(sum_) + 1\n+ sum_ = -1\n+ count2 = count + 1 \n+\n print(min(count1, count2))\n", "FL_content": " n = int(input())\n num_list = list(map(int, input().split()))\n count = 0\n sum_ = num_list[0]\n if sum_ > 0:\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n- sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n- sum_ -= abs(sum_) + 1\n count += abs(sum_) + 1\n- print(count) \n elif sum_ < 0:\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n- sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n- sum_ += -abs(sum_) - 1\n- count += abs(sum_) + 1 \n- print(count) \n-else:\n sum_ = 1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n- sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n- sum_ -= -abs(sum_) - 1\n count += abs(sum_) + 1\n- count1 = count \n sum_ = -1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n- sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n- sum_ += abs(sum_) + 1\n- count += abs(sum_) + 1 \n- count2 = count \n print(min(count1, count2))\n", "added_lines": 51, "removed_lines": 15, "code1_lines": 54 }, { "user_id": "u947883560", "problem_id": "p03739", "submission1_id": "s640704856", "submission2_id": "s579665083", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nINF = float(\"inf\")\n\n\ndef solve(n: int, a: \"List[int]\"):\n\n \n tot = 0\n countA = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 0:\n if tot <= 0:\n countA += -tot+1\n tot = 1\n elif i % 2 == 1:\n if tot >= 0:\n countA += tot+1\n tot = -1\n\n tot = 0\n countB = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 1:\n if tot <= 0:\n countB += -tot+1\n tot = 1\n elif i % 2 == 0:\n if tot >= 1:\n countB += tot+1\n tot = -1\n print(min(countA, countB))\n\n return\n\n\ndef main():\n\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n n = int(next(tokens)) \n a = [int(next(tokens)) for _ in range(n)] \n solve(n, a)\n\n\nif __name__ == '__main__':\n main()\n", "code2": "\nimport sys\nINF = float(\"inf\")\n\n\ndef solve(n: int, a: \"List[int]\"):\n\n \n tot = 0\n countA = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 0:\n if tot <= 0:\n countA += -tot+1\n tot = 1\n else:\n if tot >= 0:\n countA += tot+1\n tot = -1\n\n tot = 0\n countB = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 1:\n if tot <= 0:\n countB += -tot+1\n tot = 1\n else:\n if tot >= 0:\n countB += tot+1\n tot = -1\n print(min(countA, countB))\n\n return\n\n\ndef main():\n\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n n = int(next(tokens)) \n a = [int(next(tokens)) for _ in range(n)] \n solve(n, a)\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566039050", "date2": "1566056730", "bleu_score": "0.97015933396301", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 80, "total_score": 94, "input": "5\n55 -1 -1 1 -6\n", "actual_output": "59\n", "expected_output": "61\n\n", "anno_code": ["\nimport sys\nINF = float(\"inf\") # (0): INF=inf\n\n\ndef solve(n: int, a: \"List[int]\"): # (1): solve=\n\n \n tot = 0\n countA = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 0:\n if tot <= 0:\n countA += -tot+1\n tot = 1\n elif i % 2 == 1:\n if tot >= 0:\n countA += tot+1\n tot = -1\n\n tot = 0\n countB = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 1:\n if tot <= 0:\n countB += -tot+1\n tot = 1\n elif i % 2 == 0:\n if tot >= 1:\n countB += tot+1\n tot = -1\n print(min(countA, countB))\n\n return\n\n\ndef main(): # (2): main=\n\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n n = int(next(tokens)) \n a = [int(next(tokens)) for _ in range(n)] \n solve(n, a)\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " \n import sys\n INF = float(\"inf\")\n \n \n def solve(n: int, a: \"List[int]\"):\n \n \n tot = 0\n countA = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 0:\n if tot <= 0:\n countA += -tot+1\n tot = 1\n- elif i % 2 == 1:\n+ else:\n if tot >= 0:\n countA += tot+1\n tot = -1\n \n tot = 0\n countB = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 1:\n if tot <= 0:\n countB += -tot+1\n tot = 1\n- elif i % 2 == 0:\n- if tot >= 1:\n+ else:\n+ if tot >= 0:\n countB += tot+1\n tot = -1\n print(min(countA, countB))\n \n return\n \n \n def main():\n \n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n n = int(next(tokens)) \n a = [int(next(tokens)) for _ in range(n)] \n solve(n, a)\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " \n import sys\n INF = float(\"inf\")\n \n \n def solve(n: int, a: \"List[int]\"):\n \n \n tot = 0\n countA = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 0:\n if tot <= 0:\n countA += -tot+1\n tot = 1\n- elif i % 2 == 1:\n if tot >= 0:\n countA += tot+1\n tot = -1\n \n tot = 0\n countB = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 1:\n if tot <= 0:\n countB += -tot+1\n tot = 1\n- elif i % 2 == 0:\n- if tot >= 1:\n countB += tot+1\n tot = -1\n print(min(countA, countB))\n \n return\n \n \n def main():\n \n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n n = int(next(tokens)) \n a = [int(next(tokens)) for _ in range(n)] \n solve(n, a)\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 53 }, { "user_id": "u230117534", "problem_id": "p03739", "submission1_id": "s983423472", "submission2_id": "s536225946", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input().strip())\nA = list(map(int, input().strip().split(\" \")))\n\ns = A[0]\ncount = 0\n\nif s == 0:\n if n == 1:\n count += 1\n else:\n count += 1\n if A[1] > 0:\n s = -1\n else:\n s = 1\n\nfor a in A[1:]:\n prev = s\n sign = prev > 0\n s += a\n if s == 0:\n count += 1\n if sign: \n s = -1\n else: \n s = 1\n elif sign == (s > 0): \n count += abs(s)+1\n if s > 0:\n s = -1\n else:\n s = 1\n else:\n pass\n\nprint(count)\n", "code2": "n = int(input().strip())\nA = list(map(int, input().strip().split(\" \")))\n\ndef solver(_sign):\n s = A[0]\n count = 0\n\n if _sign:\n if s <= 0: \n count += abs(s) + 1\n s = 1\n else:\n if s >= 0: \n count += abs(s) + 1\n s = -1\n\n for a in A[1:]:\n prev = s\n sign = prev > 0\n s += a\n if s == 0:\n count += 1\n if sign: \n s = -1\n else: \n s = 1\n elif sign == (s > 0): \n count += abs(s)+1\n if s > 0:\n s = -1\n else:\n s = 1\n else:\n pass\n return count\n\nprint(min(solver(True), solver(False)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590633503", "date2": "1590635015", "bleu_score": "0.7302420023893698", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 94, "input": "5\n40 -1 -1 1 -5\n", "actual_output": "53\n", "expected_output": "46\n\n", "anno_code": ["n = int(input().strip()) # (0): n=5\nA = list(map(int, input().strip().split(\" \"))) # (1): A=[40, -1, -1, 1, -5]\n\ns = A[0] # (2): s=40\ncount = 0 # (3): count=0\n\nif s == 0: # (4): NO CHANGE\n if n == 1:\n count += 1\n else:\n count += 1\n if A[1] > 0:\n s = -1\n else:\n s = 1\n\nfor a in A[1:]: # (5): a=-1 (14): NO CHANGE ... (41): NO CHANGE\n prev = s # (6): prev=40 (15): prev=-1 ... (33): prev=-1\n sign = prev > 0 # (7): sign=True (16): sign=False ... (34): sign=False\n s += a # (8): s=39 (17): s=-2 ... (35): s=-6\n if s == 0: # (9): NO CHANGE (18): NO CHANGE ... (36): NO CHANGE\n count += 1\n if sign: \n s = -1\n else: \n s = 1\n elif sign == (s > 0): # (10): NO CHANGE (19): NO CHANGE ... (37): NO CHANGE\n count += abs(s)+1 # (11): count=40 (20): count=43 ... (38): count=53\n if s > 0: # (12): NO CHANGE (21): NO CHANGE ... (39): NO CHANGE\n s = -1 # (13): s=-1 (31): s=-1\n else:\n s = 1 # (22): s=1 (40): s=1\n else:\n pass\n\nprint(count)\n"], "anno_status": [true], "diff_content": " n = int(input().strip())\n A = list(map(int, input().strip().split(\" \")))\n \n-s = A[0]\n-count = 0\n+def solver(_sign):\n+ s = A[0]\n+ count = 0\n \n-if s == 0:\n- if n == 1:\n- count += 1\n+ if _sign:\n+ if s <= 0: \n+ count += abs(s) + 1\n+ s = 1\n else:\n- count += 1\n- if A[1] > 0:\n+ if s >= 0: \n+ count += abs(s) + 1\n s = -1\n- else:\n- s = 1\n \n-for a in A[1:]:\n- prev = s\n- sign = prev > 0\n- s += a\n- if s == 0:\n- count += 1\n- if sign: \n- s = -1\n- else: \n- s = 1\n- elif sign == (s > 0): \n- count += abs(s)+1\n- if s > 0:\n- s = -1\n+ for a in A[1:]:\n+ prev = s\n+ sign = prev > 0\n+ s += a\n+ if s == 0:\n+ count += 1\n+ if sign: \n+ s = -1\n+ else: \n+ s = 1\n+ elif sign == (s > 0): \n+ count += abs(s)+1\n+ if s > 0:\n+ s = -1\n+ else:\n+ s = 1\n else:\n- s = 1\n- else:\n- pass\n-\n-print(count)\n+ pass\n+ return count\n \n+print(min(solver(True), solver(False)))\n", "FL_content": " n = int(input().strip())\n A = list(map(int, input().strip().split(\" \")))\n \n-s = A[0]\n-count = 0\n \n-if s == 0:\n- if n == 1:\n- count += 1\n else:\n- count += 1\n- if A[1] > 0:\n s = -1\n- else:\n- s = 1\n \n-for a in A[1:]:\n- prev = s\n- sign = prev > 0\n- s += a\n- if s == 0:\n- count += 1\n- if sign: \n- s = -1\n- else: \n- s = 1\n- elif sign == (s > 0): \n- count += abs(s)+1\n- if s > 0:\n- s = -1\n else:\n- s = 1\n- else:\n- pass\n-\n-print(count)\n \n", "added_lines": 28, "removed_lines": 28, "code1_lines": 37 }, { "user_id": "u897329068", "problem_id": "p03739", "submission1_id": "s119742065", "submission2_id": "s316072547", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA2 = list(map(int,input().split()))\n\n\n\ndef getSign(a):\n\tif a < 0:\n\t\treturn -1\n\telif a == 0:\n\t\treturn 0\n\telse:\n\t\treturn 1\n\ncounts = []\nfor j in range(2):\n\tA = list(A2)\n\tcount = 0\n\tsumN = A[0]\n\tbeforeSign = getSign(A[0])\n\t\n\tif j == 0:\n\t\tadd = -A[0] - beforeSign\n\t\tA[0] += add\n\t\tcount += abs(add)\n\t\n\tfor i in range(1,N):\n\t\tsumN += A[i]\n\n\t\t\n\n\t\tif 0 <= beforeSign * sumN:\n\t\t\tadd = -sumN - beforeSign\n\t\t\tA[i] += add\n\t\t\tsumN += add\n\t\t\tcount += abs(add)\n\t\t\n\t\tbeforeSign = getSign(sumN)\n\t\t\n\t\n\tcounts.append(count)\n\t\nprint(min(counts))", "code2": "N = int(input())\nA = list(map(int,input().split()))\n\n\n\ndef getSign(a):\n\tif a < 0:\n\t\treturn -1\n\telif a == 0:\n\t\treturn 0\n\telse:\n\t\treturn 1\n\ncounts = []\nfor beforeSign in [-1,1]:\n\tcount = 0\n\tsumN = 0\n\tfor i in range(N):\n\t\tsumN += A[i]\n\n\t\t\n\n\t\tif 0 <= beforeSign * sumN:\n\t\t\tadd = -sumN - beforeSign\n\t\t\tsumN += add\n\t\t\tcount += abs(add)\n\t\t\n\t\tbeforeSign = getSign(sumN)\n\t\t\n\t\n\tcounts.append(count)\n\t\nprint(min(counts))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552972595", "date2": "1553028021", "bleu_score": "0.701374424575256", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1], "code1_test_score": 62, "total_score": 94, "input": "5\n40 -1 -1 1 -5\n", "actual_output": "53\n", "expected_output": "46\n\n", "anno_code": ["N = int(input()) # (0): N=5\nA2 = list(map(int,input().split())) # (1): A2=[40, -1, -1, 1, -5]\n\n\n\ndef getSign(a): # (2): getSign=\n\tif a < 0: # (9): NO CHANGE (23): N=5, A2=[40, -1, -1, 1, -5], getSign=, counts=[], j=0, A=[-1, -41, -1, 1, -5], count=81, sumN=-1, beforeSign=-1, add=-40, i=1 ... (99): NO CHANGE\n\t\treturn -1\n\telif a == 0: # (10): N=5, A2=[40, -1, -1, 1, -5], getSign=, counts=[], j=0, A=[40, -1, -1, 1, -5], count=0, sumN=40, beforeSign=1 (33): N=5, A2=[40, -1, -1, 1, -5], getSign=, counts=[], j=0, A=[-1, -41, 2, 1, -5], count=84, sumN=1, beforeSign=1, add=3, i=2 ... (100): N=5, A2=[40, -1, -1, 1, -5], getSign=, counts=[94], j=1, A=[40, -41, 2, -2, 2], count=53, sumN=1, beforeSign=1, add=7, i=4\n\t\treturn 0\n\telse:\n\t\treturn 1\n\ncounts = [] # (3): counts=[]\nfor j in range(2): # (4): j=0 (55): j=1 (103): NO CHANGE\n\tA = list(A2) # (5): A=[40, -1, -1, 1, -5] (56): A=[40, -1, -1, 1, -5]\n\tcount = 0 # (6): count=0 (57): count=0\n\tsumN = A[0] # (7): sumN=40 (58): sumN=40\n\tbeforeSign = getSign(A[0]) # (8): a=40 (59): a=40\n\t\n\tif j == 0: # (11): NO CHANGE (62): NO CHANGE\n\t\tadd = -A[0] - beforeSign # (12): add=-41\n\t\tA[0] += add # (13): A=[-1, -1, -1, 1, -5]\n\t\tcount += abs(add) # (14): count=41\n\t\n\tfor i in range(1,N): # (15): i=1 (24): i=2 ... (101): NO CHANGE\n\t\tsumN += A[i] # (16): sumN=39 (25): sumN=-2 ... (92): sumN=-6\n\n\t\t\n\n\t\tif 0 <= beforeSign * sumN: # (17): NO CHANGE (26): NO CHANGE ... (93): NO CHANGE\n\t\t\tadd = -sumN - beforeSign # (18): add=-40 (27): add=3 ... (94): add=7\n\t\t\tA[i] += add # (19): A=[-1, -41, -1, 1, -5] (28): A=[-1, -41, 2, 1, -5] ... (95): A=[40, -41, 2, -2, 2]\n\t\t\tsumN += add # (20): sumN=-1 (29): sumN=1 ... (96): sumN=1\n\t\t\tcount += abs(add) # (21): count=81 (30): count=84 ... (97): count=53\n\t\t\n\t\tbeforeSign = getSign(sumN) # (22): a=-1 (31): a=1 ... (98): a=1\n\t\t\n\t\n\tcounts.append(count) # (54): counts=[94] (102): counts=[94, 53]\n\t\nprint(min(counts))"], "anno_status": [false], "diff_content": " N = int(input())\n-A2 = list(map(int,input().split()))\n+A = list(map(int,input().split()))\n \n \n \n def getSign(a):\n \tif a < 0:\n \t\treturn -1\n \telif a == 0:\n \t\treturn 0\n \telse:\n \t\treturn 1\n \n counts = []\n-for j in range(2):\n-\tA = list(A2)\n+for beforeSign in [-1,1]:\n \tcount = 0\n-\tsumN = A[0]\n-\tbeforeSign = getSign(A[0])\n-\t\n-\tif j == 0:\n-\t\tadd = -A[0] - beforeSign\n-\t\tA[0] += add\n-\t\tcount += abs(add)\n-\t\n-\tfor i in range(1,N):\n+\tsumN = 0\n+\tfor i in range(N):\n \t\tsumN += A[i]\n \n \t\t\n \n \t\tif 0 <= beforeSign * sumN:\n \t\t\tadd = -sumN - beforeSign\n-\t\t\tA[i] += add\n \t\t\tsumN += add\n \t\t\tcount += abs(add)\n \t\t\n \t\tbeforeSign = getSign(sumN)\n \t\t\n \t\n \tcounts.append(count)\n \t\n print(min(counts))\n", "FL_content": " N = int(input())\n-A2 = list(map(int,input().split()))\n \n \n \n def getSign(a):\n \tif a < 0:\n \t\treturn -1\n \telif a == 0:\n \t\treturn 0\n \telse:\n \t\treturn 1\n \n counts = []\n-for j in range(2):\n-\tA = list(A2)\n \tcount = 0\n-\tsumN = A[0]\n-\tbeforeSign = getSign(A[0])\n-\t\n-\tif j == 0:\n-\t\tadd = -A[0] - beforeSign\n-\t\tA[0] += add\n-\t\tcount += abs(add)\n-\t\n-\tfor i in range(1,N):\n \t\tsumN += A[i]\n \n \t\t\n \n \t\tif 0 <= beforeSign * sumN:\n \t\t\tadd = -sumN - beforeSign\n-\t\t\tA[i] += add\n \t\t\tsumN += add\n \t\t\tcount += abs(add)\n \t\t\n \t\tbeforeSign = getSign(sumN)\n \t\t\n \t\n \tcounts.append(count)\n \t\n print(min(counts))\n", "added_lines": 4, "removed_lines": 13, "code1_lines": 42 }, { "user_id": "u983918956", "problem_id": "p03739", "submission1_id": "s206736033", "submission2_id": "s939459579", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nA = list(map(int,input().split()))\ndef func(list1,op,acc = 0,count = 0):\n for i in range(n):\n acc += list1[i]\n if i % 2 == 1 and acc * op >= 0:\n count += op * acc + 1\n acc = -op\n elif i % 2 == 0 and acc * op <= 0:\n count += -op * acc + 1\n acc = op\n if acc == 0:\n count += 1\n return count\nif A[0] > 0:\n ans = func(A,1)\nelif A[0] < 0:\n ans = func(A,-1)\nelif A[0] == 0:\n ans = min(func(A,1),func(A,-1))\nprint(ans)", "code2": "n = int(input())\nA = list(map(int,input().split()))\ndef func(list1,op,acc = 0,count = 0):\n for i in range(n):\n acc += list1[i]\n if i % 2 == 1 and acc * op >= 0:\n count += op * acc + 1\n acc = -op\n elif i % 2 == 0 and acc * op <= 0:\n count += -op * acc + 1\n acc = op\n if acc == 0:\n count += 1\n return count\nans = min(func(A,1),func(A,-1))\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1545108722", "date2": "1545109699", "bleu_score": "0.8093874690353725", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 80, "total_score": 94, "input": "5\n40 -1 -1 1 -5\n", "actual_output": "53\n", "expected_output": "46\n\n", "anno_code": ["n = int(input()) # (0): n=5\nA = list(map(int,input().split())) # (1): A=[40, -1, -1, 1, -5]\ndef func(list1,op,acc = 0,count = 0): # (2): func=\n for i in range(n): # (5): i=0 (9): i=1 ... (31): NO CHANGE\n acc += list1[i] # (6): acc=40 (10): acc=39 ... (26): acc=-6\n if i % 2 == 1 and acc * op >= 0: # (7): NO CHANGE (11): NO CHANGE ... (27): NO CHANGE\n count += op * acc + 1 # (12): count=40 (23): count=46\n acc = -op # (13): acc=-1 (24): acc=-1\n elif i % 2 == 0 and acc * op <= 0: # (8): NO CHANGE (17): NO CHANGE (28): NO CHANGE\n count += -op * acc + 1 # (18): count=43 (29): count=53\n acc = op # (19): acc=1 (30): acc=1\n if acc == 0: # (32): n=5, A=[40, -1, -1, 1, -5], func=, ans=53\n count += 1\n return count\nif A[0] > 0: # (3): NO CHANGE\n ans = func(A,1) # (4): list1=[40, -1, -1, 1, -5], op=1, acc=0, count=0\nelif A[0] < 0:\n ans = func(A,-1)\nelif A[0] == 0:\n ans = min(func(A,1),func(A,-1))\nprint(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n A = list(map(int,input().split()))\n def func(list1,op,acc = 0,count = 0):\n for i in range(n):\n acc += list1[i]\n if i % 2 == 1 and acc * op >= 0:\n count += op * acc + 1\n acc = -op\n elif i % 2 == 0 and acc * op <= 0:\n count += -op * acc + 1\n acc = op\n if acc == 0:\n count += 1\n return count\n-if A[0] > 0:\n- ans = func(A,1)\n-elif A[0] < 0:\n- ans = func(A,-1)\n-elif A[0] == 0:\n- ans = min(func(A,1),func(A,-1))\n+ans = min(func(A,1),func(A,-1))\n print(ans)\n", "FL_content": " n = int(input())\n A = list(map(int,input().split()))\n def func(list1,op,acc = 0,count = 0):\n for i in range(n):\n acc += list1[i]\n if i % 2 == 1 and acc * op >= 0:\n count += op * acc + 1\n acc = -op\n elif i % 2 == 0 and acc * op <= 0:\n count += -op * acc + 1\n acc = op\n if acc == 0:\n count += 1\n return count\n-if A[0] > 0:\n- ans = func(A,1)\n-elif A[0] < 0:\n- ans = func(A,-1)\n-elif A[0] == 0:\n- ans = min(func(A,1),func(A,-1))\n print(ans)\n", "added_lines": 1, "removed_lines": 6, "code1_lines": 21 }, { "user_id": "u576432509", "problem_id": "p03739", "submission1_id": "s920884684", "submission2_id": "s019988788", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\n\na=list(map(int,input().split()))\n\nkp=0\nasum=0\nflag=-1\nfor i in range(n):\n asum=asum+a[i]\n if flag==-1:\n if asum>=0:\n kp=kp+asum+1\n asum=-1\n else:\n if asum<=0:\n kp=kp+1-asum\n asum=1\n flag=-flag\n print(asum)\nprint(\"-----\",kp) \nkm=0\nasum=0\nflag=1\nfor i in range(n):\n asum=asum+a[i]\n if flag==-1:\n if asum>=0:\n km=km+asum+1\n asum=-1\n else:\n if asum<=0:\n km=km+1-asum\n asum=1\n flag=-flag\n print(asum)\nprint(\"-----\",km) \n\nprint(min(kp,km))\n ", "code2": "n=int(input())\n\na=list(map(int,input().split()))\n\nkp=0\nasum=0\nflag=-1\nfor i in range(n):\n asum=asum+a[i]\n if flag==-1:\n if asum>=0:\n kp=kp+asum+1\n asum=-1\n else:\n if asum<=0:\n kp=kp+1-asum\n asum=1\n flag=-flag\n\n\nkm=0\nasum=0\nflag=1\nfor i in range(n):\n asum=asum+a[i]\n if flag==-1:\n if asum>=0:\n km=km+asum+1\n asum=-1\n else:\n if asum<=0:\n km=km+1-asum\n asum=1\n flag=-flag\n\n\n\nprint(min(kp,km))\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586313798", "date2": "1586313859", "bleu_score": "0.8419633617565788", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 94, "input": "6\n0 8 0 2 -5 -1\n", "actual_output": "-1\n7\n-1\n1\n-4\n1\n----- 15\n1\n-1\n1\n-1\n1\n-1\n----- 25\n15\n", "expected_output": "15\n\n", "anno_code": ["n=int(input()) # (0): n=6\n\na=list(map(int,input().split())) # (1): a=[0, 8, 0, 2, -5, -1]\n\nkp=0 # (2): kp=0\nasum=0 # (3): asum=0\nflag=-1 # (4): flag=-1\nfor i in range(n): # (5): i=0 (13): i=1 ... (47): NO CHANGE\n asum=asum+a[i] # (6): NO CHANGE (14): asum=7 ... (40): asum=-5\n if flag==-1: # (7): NO CHANGE (15): NO CHANGE ... (41): NO CHANGE\n if asum>=0: # (8): NO CHANGE (22): NO CHANGE (36): NO CHANGE\n kp=kp+asum+1 # (9): kp=1 (23): kp=9\n asum=-1 # (10): asum=-1 (24): asum=-1\n else:\n if asum<=0: # (16): NO CHANGE (30): NO CHANGE (42): NO CHANGE\n kp=kp+1-asum # (43): kp=15\n asum=1 # (44): asum=1\n flag=-flag # (11): flag=1 (17): flag=-1 ... (45): flag=-1\n print(asum) # (12): NO CHANGE (18): NO CHANGE ... (46): NO CHANGE\nprint(\"-----\",kp) # (48): NO CHANGE\nkm=0 # (49): km=0\nasum=0 # (50): asum=0\nflag=1 # (51): flag=1\nfor i in range(n): # (52): i=0 (60): i=1 ... (100): NO CHANGE\n asum=asum+a[i] # (53): NO CHANGE (61): asum=9 ... (93): asum=0\n if flag==-1: # (54): NO CHANGE (62): NO CHANGE ... (94): NO CHANGE\n if asum>=0: # (63): NO CHANGE (79): NO CHANGE (95): NO CHANGE\n km=km+asum+1 # (64): km=11 (80): km=17 (96): km=25\n asum=-1 # (65): asum=-1 (81): asum=-1 (97): asum=-1\n else:\n if asum<=0: # (55): NO CHANGE (71): NO CHANGE (87): NO CHANGE\n km=km+1-asum # (56): km=1 (72): km=13 (88): km=24\n asum=1 # (57): asum=1 (73): asum=1 (89): asum=1\n flag=-flag # (58): flag=-1 (66): flag=1 ... (98): flag=1\n print(asum) # (59): NO CHANGE (67): NO CHANGE ... (99): NO CHANGE\nprint(\"-----\",km) # (101): NO CHANGE\n\nprint(min(kp,km))\n "], "anno_status": [true], "diff_content": " n=int(input())\n \n a=list(map(int,input().split()))\n \n kp=0\n asum=0\n flag=-1\n for i in range(n):\n asum=asum+a[i]\n if flag==-1:\n if asum>=0:\n kp=kp+asum+1\n asum=-1\n else:\n if asum<=0:\n kp=kp+1-asum\n asum=1\n flag=-flag\n- print(asum)\n-print(\"-----\",kp) \n+\n+\n km=0\n asum=0\n flag=1\n for i in range(n):\n asum=asum+a[i]\n if flag==-1:\n if asum>=0:\n km=km+asum+1\n asum=-1\n else:\n if asum<=0:\n km=km+1-asum\n asum=1\n flag=-flag\n- print(asum)\n-print(\"-----\",km) \n+\n+\n \n print(min(kp,km))\n \n", "FL_content": " n=int(input())\n \n a=list(map(int,input().split()))\n \n kp=0\n asum=0\n flag=-1\n for i in range(n):\n asum=asum+a[i]\n if flag==-1:\n if asum>=0:\n kp=kp+asum+1\n asum=-1\n else:\n if asum<=0:\n kp=kp+1-asum\n asum=1\n flag=-flag\n- print(asum)\n-print(\"-----\",kp) \n km=0\n asum=0\n flag=1\n for i in range(n):\n asum=asum+a[i]\n if flag==-1:\n if asum>=0:\n km=km+asum+1\n asum=-1\n else:\n if asum<=0:\n km=km+1-asum\n asum=1\n flag=-flag\n- print(asum)\n-print(\"-----\",km) \n \n print(min(kp,km))\n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 39 }, { "user_id": "u472883337", "problem_id": "p03739", "submission1_id": "s883231030", "submission2_id": "s355850718", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\nl = len(a)\nb = []\nfor i in range(l):\n b.append(a[i])\n \nans = 0\nAns = 0\nsummary = a[0]\n\nif(summary == 0):\n a[0] = 1\n ans+= 1\n b[0] = -1\n Ans+= 1\nelse:\n b[0] = int(-a[0]/ abs(a[0]))\n Ans+= abs(a[0]- b[0])\n\nSummary = b[0] \n \nfor i in range(1, l):\n if(summary* (summary+ a[i])>= 0):\n if(summary > 0):\n ans+= a[i]+ summary+ 1\n a[i] = -summary- 1 \n summary= -1\n else:\n ans+= -summary+ 1- a[i]\n a[i] = -summary+ 1\n summary= 1\n else:\n summary+= a[i]\n\nfor i in range(1, l):\n if(Summary* (Summary+ b[i])>= 0):\n if(Summary > 0):\n Ans+= b[i]+ Summary+ 1\n b[i] = -Summary- 1 \n Summary= -1\n else:\n Ans+= -Summary+ 1- b[i]\n b[i] = -Summary+ 1\n Summary= 1\n else:\n Summary+= b[i]\n \nprint(min(ans, Ans))\nprint(a, b)", "code2": "n = int(input())\na = list(map(int, input().split()))\nl = len(a)\nb = []\nfor i in range(l):\n b.append(a[i])\n \nans = 0\nAns = 0\nsummary = a[0]\n\nif(summary == 0):\n summary = 1\n ans+= 1\n Summary = -1\n Ans+= 1\nelse:\n b[0] = int(-a[0]/ abs(a[0]))\n Ans+= abs(a[0]- b[0])\n Summary = b[0] \n \nfor i in range(1, l):\n if(summary* (summary+ a[i])>= 0):\n if(summary > 0):\n ans+= a[i]+ summary+ 1\n a[i] = -summary- 1 \n summary= -1\n else:\n ans+= -summary+ 1- a[i]\n a[i] = -summary+ 1\n summary= 1\n else:\n summary+= a[i]\n\nfor i in range(1, l):\n if(Summary* (Summary+ b[i])>= 0):\n if(Summary > 0):\n Ans+= b[i]+ Summary+ 1\n b[i] = -Summary- 1 \n Summary= -1\n else:\n Ans+= -Summary+ 1- b[i]\n b[i] = -Summary+ 1\n Summary= 1\n else:\n Summary+= b[i]\n \nprint(min(ans, Ans))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591063117", "date2": "1591063855", "bleu_score": "0.9709230851471963", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 94, "input": "6\n9 -1 -7 1 -1 0\n", "actual_output": "22\n[9, -10, 2, -2, 2, -2] [-1, 2, -7, 7, -2, 2]\n", "expected_output": "22\n\n", "anno_code": ["n = int(input()) # (0): n=6\na = list(map(int, input().split())) # (1): a=[9, -1, -7, 1, -1, 0]\nl = len(a) # (2): l=6\nb = [] # (3): b=[]\nfor i in range(l): # (4): i=0 (6): i=1 ... (16): NO CHANGE\n b.append(a[i]) # (5): b=[9] (7): b=[9, -1] ... (15): b=[9, -1, -7, 1, -1, 0]\n \nans = 0 # (17): ans=0\nAns = 0 # (18): Ans=0\nsummary = a[0] # (19): summary=9\n\nif(summary == 0): # (20): NO CHANGE\n a[0] = 1\n ans+= 1\n b[0] = -1\n Ans+= 1\nelse:\n b[0] = int(-a[0]/ abs(a[0])) # (21): b=[-1, -1, -7, 1, -1, 0]\n Ans+= abs(a[0]- b[0]) # (22): Ans=10\n\nSummary = b[0] # (23): Summary=-1\n \nfor i in range(1, l): # (24): i=1 (30): i=2 ... (54): NO CHANGE\n if(summary* (summary+ a[i])>= 0): # (25): NO CHANGE (31): NO CHANGE ... (49): NO CHANGE\n if(summary > 0): # (26): NO CHANGE (32): NO CHANGE ... (50): NO CHANGE\n ans+= a[i]+ summary+ 1 # (27): ans=9 (39): ans=21 (51): ans=26\n a[i] = -summary- 1 # (28): a=[9, -10, -7, 1, -1, 0] (40): a=[9, -10, 2, -2, -1, 0] (52): a=[9, -10, 2, -2, 2, -2]\n summary= -1 # (29): summary=-1 (41): summary=-1 (53): summary=-1\n else:\n ans+= -summary+ 1- a[i] # (33): ans=18 (45): ans=24\n a[i] = -summary+ 1 # (34): a=[9, -10, 2, 1, -1, 0] (46): a=[9, -10, 2, -2, 2, 0]\n summary= 1 # (35): summary=1 (47): summary=1\n else:\n summary+= a[i]\n\nfor i in range(1, l): # (55): i=1 (61): i=2 ... (82): NO CHANGE\n if(Summary* (Summary+ b[i])>= 0): # (56): NO CHANGE (62): NO CHANGE ... (77): NO CHANGE\n if(Summary > 0): # (57): NO CHANGE (66): NO CHANGE ... (78): NO CHANGE\n Ans+= b[i]+ Summary+ 1 # (73): Ans=20\n b[i] = -Summary- 1 # (74): b=[-1, 2, -7, 7, -2, 0]\n Summary= -1 # (75): Summary=-1\n else:\n Ans+= -Summary+ 1- b[i] # (58): Ans=13 (67): Ans=19 (79): Ans=22\n b[i] = -Summary+ 1 # (59): b=[-1, 2, -7, 1, -1, 0] (68): b=[-1, 2, -7, 7, -1, 0] (80): b=[-1, 2, -7, 7, -2, 2]\n Summary= 1 # (60): Summary=1 (69): Summary=1 (81): Summary=1\n else:\n Summary+= b[i] # (63): Summary=-6\n \nprint(min(ans, Ans)) # (83): NO CHANGE\nprint(a, b)"], "anno_status": [false], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n l = len(a)\n b = []\n for i in range(l):\n b.append(a[i])\n \n ans = 0\n Ans = 0\n summary = a[0]\n \n if(summary == 0):\n- a[0] = 1\n+ summary = 1\n ans+= 1\n- b[0] = -1\n+ Summary = -1\n Ans+= 1\n else:\n b[0] = int(-a[0]/ abs(a[0]))\n Ans+= abs(a[0]- b[0])\n-\n-Summary = b[0] \n+ Summary = b[0] \n \n for i in range(1, l):\n if(summary* (summary+ a[i])>= 0):\n if(summary > 0):\n ans+= a[i]+ summary+ 1\n a[i] = -summary- 1 \n summary= -1\n else:\n ans+= -summary+ 1- a[i]\n a[i] = -summary+ 1\n summary= 1\n else:\n summary+= a[i]\n \n for i in range(1, l):\n if(Summary* (Summary+ b[i])>= 0):\n if(Summary > 0):\n Ans+= b[i]+ Summary+ 1\n b[i] = -Summary- 1 \n Summary= -1\n else:\n Ans+= -Summary+ 1- b[i]\n b[i] = -Summary+ 1\n Summary= 1\n else:\n Summary+= b[i]\n \n print(min(ans, Ans))\n-print(a, b)\n", "FL_content": " n = int(input())\n a = list(map(int, input().split()))\n l = len(a)\n b = []\n for i in range(l):\n b.append(a[i])\n \n ans = 0\n Ans = 0\n summary = a[0]\n \n if(summary == 0):\n- a[0] = 1\n ans+= 1\n- b[0] = -1\n Ans+= 1\n else:\n b[0] = int(-a[0]/ abs(a[0]))\n Ans+= abs(a[0]- b[0])\n-\n-Summary = b[0] \n \n for i in range(1, l):\n if(summary* (summary+ a[i])>= 0):\n if(summary > 0):\n ans+= a[i]+ summary+ 1\n a[i] = -summary- 1 \n summary= -1\n else:\n ans+= -summary+ 1- a[i]\n a[i] = -summary+ 1\n summary= 1\n else:\n summary+= a[i]\n \n for i in range(1, l):\n if(Summary* (Summary+ b[i])>= 0):\n if(Summary > 0):\n Ans+= b[i]+ Summary+ 1\n b[i] = -Summary- 1 \n Summary= -1\n else:\n Ans+= -Summary+ 1- b[i]\n b[i] = -Summary+ 1\n Summary= 1\n else:\n Summary+= b[i]\n \n print(min(ans, Ans))\n-print(a, b)\n", "added_lines": 3, "removed_lines": 5, "code1_lines": 50 }, { "user_id": "u620084012", "problem_id": "p03739", "submission1_id": "s455710046", "submission2_id": "s550505656", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int,input().split()))\ns = A[0]\nans = 0\n\nfor k in range(1,N):\n if s*(s+A[k])<=-1:\n s += A[k]\n else:\n if s > 0:\n if s + A[k] >= 0:\n ans += s + A[k] + 1\n s = -1\n elif s < 0:\n if s + A[k] <= 0:\n ans += 1 - s - A[k]\n s = 1\nprint(ans)", "code2": "N = int(input())\nA = list(map(int,input().split()))\n\ns = 0\nans1 = 0\nfor k in range(N):\n s += A[k]\n if k%2==0:\n if s <= 0:\n ans1 += -s+1\n s = 1\n else:\n if s >= 0:\n ans1 += s+1\n s = -1\n\ns = 0\nans2 = 0\nfor k in range(N):\n s += A[k]\n if k%2==0:\n if s >= 0:\n ans2 += s+1\n s = -1\n else:\n if s <= 0:\n ans2 += -s+1\n s = 1\n\nprint(min(ans1,ans2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1525421102", "date2": "1525424710", "bleu_score": "0.6538845300484326", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1], "code1_test_score": 62, "total_score": 94, "input": "6\n0 1 2 -1 -2 -1\n", "actual_output": "0\n", "expected_output": "10\n\n", "anno_code": ["N = int(input()) # (0): N=6\nA = list(map(int,input().split())) # (1): A=[0, 1, 2, -1, -2, -1]\ns = A[0] # (2): s=0\nans = 0 # (3): ans=0\n\nfor k in range(1,N): # (4): k=1 (8): k=2 ... (24): NO CHANGE\n if s*(s+A[k])<=-1: # (5): NO CHANGE (9): NO CHANGE ... (21): NO CHANGE\n s += A[k]\n else:\n if s > 0: # (6): NO CHANGE (10): NO CHANGE ... (22): NO CHANGE\n if s + A[k] >= 0:\n ans += s + A[k] + 1\n s = -1\n elif s < 0: # (7): NO CHANGE (11): NO CHANGE ... (23): NO CHANGE\n if s + A[k] <= 0:\n ans += 1 - s - A[k]\n s = 1\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int,input().split()))\n-s = A[0]\n-ans = 0\n \n-for k in range(1,N):\n- if s*(s+A[k])<=-1:\n- s += A[k]\n+s = 0\n+ans1 = 0\n+for k in range(N):\n+ s += A[k]\n+ if k%2==0:\n+ if s <= 0:\n+ ans1 += -s+1\n+ s = 1\n else:\n- if s > 0:\n- if s + A[k] >= 0:\n- ans += s + A[k] + 1\n- s = -1\n- elif s < 0:\n- if s + A[k] <= 0:\n- ans += 1 - s - A[k]\n- s = 1\n-print(ans)\n+ if s >= 0:\n+ ans1 += s+1\n+ s = -1\n+\n+s = 0\n+ans2 = 0\n+for k in range(N):\n+ s += A[k]\n+ if k%2==0:\n+ if s >= 0:\n+ ans2 += s+1\n+ s = -1\n+ else:\n+ if s <= 0:\n+ ans2 += -s+1\n+ s = 1\n+\n+print(min(ans1,ans2))\n", "FL_content": " N = int(input())\n A = list(map(int,input().split()))\n-s = A[0]\n-ans = 0\n \n-for k in range(1,N):\n- if s*(s+A[k])<=-1:\n- s += A[k]\n else:\n- if s > 0:\n- if s + A[k] >= 0:\n- ans += s + A[k] + 1\n- s = -1\n- elif s < 0:\n- if s + A[k] <= 0:\n- ans += 1 - s - A[k]\n- s = 1\n-print(ans)\n", "added_lines": 26, "removed_lines": 14, "code1_lines": 18 }, { "user_id": "u667458133", "problem_id": "p03739", "submission1_id": "s763310132", "submission2_id": "s887713007", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\n\nresult = []\n\nfor i in range(1):\n num = 0\n r = 0\n for j in range(len(a)):\n num += a[j]\n if (j + i) % 2 == 0:\n if num <= 0:\n r -= num - 1\n num = 1\n\n else:\n if num >= 0:\n r += num + 1\n num = -1\n\n result.append(r)\n\nprint(min(result))\n", "code2": "n = int(input())\na = list(map(int, input().split()))\n\nresult = []\n\nfor i in range(2):\n num = 0\n r = 0\n for j in range(len(a)):\n num += a[j]\n if (j + i) % 2 == 0:\n if num <= 0:\n r -= num - 1\n num = 1\n\n else:\n if num >= 0:\n r += num + 1\n num = -1\n\n result.append(r)\n\nprint(min(result))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1543553161", "date2": "1543553286", "bleu_score": "0.9936986998662828", "code1_test_status": [1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 58, "total_score": 94, "input": "5\n35 -1 -1 1 -2\n", "actual_output": "45\n", "expected_output": "41\n\n", "anno_code": ["n = int(input()) # (0): n=5\na = list(map(int, input().split())) # (1): a=[35, -1, -1, 1, -2]\n\nresult = [] # (2): result=[]\n\nfor i in range(1): # (3): i=0 (36): NO CHANGE\n num = 0 # (4): num=0\n r = 0 # (5): r=0\n for j in range(len(a)): # (6): j=0 (10): j=1 ... (34): NO CHANGE\n num += a[j] # (7): num=35 (11): num=34 ... (29): num=-3\n if (j + i) % 2 == 0: # (8): NO CHANGE (12): NO CHANGE ... (30): NO CHANGE\n if num <= 0: # (9): NO CHANGE (19): NO CHANGE (31): NO CHANGE\n r -= num - 1 # (20): r=38 (32): r=45\n num = 1 # (21): num=1 (33): num=1\n\n else:\n if num >= 0: # (13): NO CHANGE (25): NO CHANGE\n r += num + 1 # (14): r=35 (26): r=41\n num = -1 # (15): num=-1 (27): num=-1\n\n result.append(r) # (35): result=[45]\n\nprint(min(result))\n"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n \n result = []\n \n-for i in range(1):\n+for i in range(2):\n num = 0\n r = 0\n for j in range(len(a)):\n num += a[j]\n if (j + i) % 2 == 0:\n if num <= 0:\n r -= num - 1\n num = 1\n \n else:\n if num >= 0:\n r += num + 1\n num = -1\n \n result.append(r)\n \n print(min(result))\n \n", "FL_content": " n = int(input())\n a = list(map(int, input().split()))\n \n result = []\n \n-for i in range(1):\n num = 0\n r = 0\n for j in range(len(a)):\n num += a[j]\n if (j + i) % 2 == 0:\n if num <= 0:\n r -= num - 1\n num = 1\n \n else:\n if num >= 0:\n r += num + 1\n num = -1\n \n result.append(r)\n \n print(min(result))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 24 }, { "user_id": "u379559362", "problem_id": "p03739", "submission1_id": "s297569404", "submission2_id": "s455800683", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\nans = 0\n\nwhile a[0] == 0:\n if a[1] > 0:\n a[0] = -1\n elif a[1] < 0:\n a[0] = 1\n else:\n a.pop(0)\n ans += 1\n\nif a[0] < 0:\n a = list(map(lambda x: x * (-1), a))\n\nproduct = 0\n\nfor i in range(len(a)):\n product += a[i]\n\n if i % 2 == 0:\n if product <= 0:\n ans += abs(product) + 1\n product = 1\n\n elif i % 2 == 1:\n if product >= 0:\n ans += abs(product) + 1\n product = -1\n\nprint(ans)\n", "code2": "n = int(input())\na = list(map(int, input().split()))\n_a = list(map(lambda x: x * (-1), a))\n\n\ndef func(l: list):\n _ans = 0\n product = 0\n for i in range(n):\n product += l[i]\n\n if i % 2 == 0:\n if product <= 0:\n _ans += abs(product) + 1\n product = 1\n\n elif i % 2 == 1:\n if product >= 0:\n _ans += abs(product) + 1\n product = -1\n return _ans\n\nans = min(func(a), func(_a))\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1493676542", "date2": "1493677585", "bleu_score": "0.7768195102037689", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1], "code1_test_score": 77, "total_score": 94, "input": "5\n113 -1 -1 1 -2\n", "actual_output": "123\n", "expected_output": "119\n\n", "anno_code": ["n = int(input()) # (0): n=5\na = list(map(int, input().split())) # (1): a=[113, -1, -1, 1, -2]\nans = 0 # (2): ans=0\n\nwhile a[0] == 0: # (3): NO CHANGE\n if a[1] > 0:\n a[0] = -1\n elif a[1] < 0:\n a[0] = 1\n else:\n a.pop(0)\n ans += 1\n\nif a[0] < 0: # (4): NO CHANGE\n a = list(map(lambda x: x * (-1), a))\n\nproduct = 0 # (5): product=0\n\nfor i in range(len(a)): # (6): i=0 (10): i=1 ... (36): NO CHANGE\n product += a[i] # (7): product=113 (11): product=112 ... (31): product=-3\n\n if i % 2 == 0: # (8): NO CHANGE (12): NO CHANGE ... (32): NO CHANGE\n if product <= 0: # (9): NO CHANGE (20): NO CHANGE (33): NO CHANGE\n ans += abs(product) + 1 # (21): ans=116 (34): ans=123\n product = 1 # (22): product=1 (35): product=1\n\n elif i % 2 == 1: # (13): NO CHANGE (26): NO CHANGE\n if product >= 0: # (14): NO CHANGE (27): NO CHANGE\n ans += abs(product) + 1 # (15): ans=113 (28): ans=119\n product = -1 # (16): product=-1 (29): product=-1\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n-ans = 0\n+_a = list(map(lambda x: x * (-1), a))\n \n-while a[0] == 0:\n- if a[1] > 0:\n- a[0] = -1\n- elif a[1] < 0:\n- a[0] = 1\n- else:\n- a.pop(0)\n- ans += 1\n \n-if a[0] < 0:\n- a = list(map(lambda x: x * (-1), a))\n+def func(l: list):\n+ _ans = 0\n+ product = 0\n+ for i in range(n):\n+ product += l[i]\n \n-product = 0\n+ if i % 2 == 0:\n+ if product <= 0:\n+ _ans += abs(product) + 1\n+ product = 1\n \n-for i in range(len(a)):\n- product += a[i]\n-\n- if i % 2 == 0:\n- if product <= 0:\n- ans += abs(product) + 1\n- product = 1\n-\n- elif i % 2 == 1:\n- if product >= 0:\n- ans += abs(product) + 1\n- product = -1\n+ elif i % 2 == 1:\n+ if product >= 0:\n+ _ans += abs(product) + 1\n+ product = -1\n+ return _ans\n \n+ans = min(func(a), func(_a))\n print(ans)\n \n", "FL_content": " n = int(input())\n a = list(map(int, input().split()))\n-ans = 0\n \n-while a[0] == 0:\n- if a[1] > 0:\n- a[0] = -1\n- elif a[1] < 0:\n- a[0] = 1\n- else:\n- a.pop(0)\n- ans += 1\n \n-if a[0] < 0:\n- a = list(map(lambda x: x * (-1), a))\n \n-product = 0\n \n-for i in range(len(a)):\n- product += a[i]\n-\n- if i % 2 == 0:\n- if product <= 0:\n- ans += abs(product) + 1\n- product = 1\n-\n- elif i % 2 == 1:\n- if product >= 0:\n- ans += abs(product) + 1\n- product = -1\n \n print(ans)\n \n", "added_lines": 16, "removed_lines": 24, "code1_lines": 33 }, { "user_id": "u900688325", "problem_id": "p03363", "submission1_id": "s264036092", "submission2_id": "s197767687", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA_list = list(map(int, input().split()))\nimport math\n\nruiseki_A_list = [0 for _ in range(N)]\n\nfor i in range(N):\n if i == 0:\n ruiseki_A_list[i] = A_list[i]\n else:\n ruiseki_A_list[i] = A_list[i] + ruiseki_A_list[i-1]\n\n\n\nruiseki_A_list.insert(0,0)\nans = 0\n\n\nruiseki_A_list.sort()\nkosuu = [1]\nk = 0\nfor i in range(N):\n if ruiseki_A_list[i+1] - ruiseki_A_list[i] == 0:\n kosuu[k] += 1\n else:\n k += 1\n kosuu.append(1)\n\nkosuu[-1] += 1\nfor num in kosuu:\n if num <= 1:\n ans += 0\n else:\n ans += math.factorial(num)/(math.factorial(2) * math.factorial(num-2))\nprint(ans)", "code2": "N = int(input())\nA_list = list(map(int, input().split()))\nimport math\n\nruiseki_A_list = [0 for _ in range(N)]\n\nfor i in range(N):\n if i == 0:\n ruiseki_A_list[i] = A_list[i]\n else:\n ruiseki_A_list[i] = A_list[i] + ruiseki_A_list[i-1]\n\n\n\nruiseki_A_list.insert(0,0)\nans = 0\n\n\nruiseki_A_list.sort()\nkosuu = [1]\nk = 0\nfor i in range(N):\n if ruiseki_A_list[i+1] - ruiseki_A_list[i] == 0:\n kosuu[k] += 1\n else:\n k += 1\n kosuu.append(1)\n \nfor num in kosuu:\n if num <= 1:\n ans += 0\n else:\n ans += math.factorial(num)/(math.factorial(2) * math.factorial(num-2))\nprint(int(ans))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555467640", "date2": "1555468090", "bleu_score": "0.9750514358521677", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "6\n-1 1 -3 2 1 -3\n", "actual_output": "8.0\n", "expected_output": "5\n\n", "anno_code": ["N = int(input()) # (0): N=6\nA_list = list(map(int, input().split())) # (1): A_list=[-1, 1, -3, 2, 1, -3], math=\nimport math\n\nruiseki_A_list = [0 for _ in range(N)] # (2): ruiseki_A_list=[0, 0, 0, 0, 0, 0]\n\nfor i in range(N): # (3): i=0 (6): i=1 ... (21): NO CHANGE\n if i == 0: # (4): NO CHANGE (7): NO CHANGE ... (19): NO CHANGE\n ruiseki_A_list[i] = A_list[i] # (5): ruiseki_A_list=[-1, 0, 0, 0, 0, 0]\n else:\n ruiseki_A_list[i] = A_list[i] + ruiseki_A_list[i-1] # (8): NO CHANGE (11): ruiseki_A_list=[-1, 0, -3, 0, 0, 0] ... (20): ruiseki_A_list=[-1, 0, -3, -1, 0, -3]\n\n\n\nruiseki_A_list.insert(0,0) # (22): ruiseki_A_list=[0, -1, 0, -3, -1, 0, -3]\nans = 0 # (23): ans=0\n\n\nruiseki_A_list.sort() # (24): ruiseki_A_list=[-3, -3, -1, -1, 0, 0, 0]\nkosuu = [1] # (25): kosuu=[1]\nk = 0 # (26): k=0\nfor i in range(N): # (27): i=0 (30): i=1 ... (47): NO CHANGE\n if ruiseki_A_list[i+1] - ruiseki_A_list[i] == 0: # (28): NO CHANGE (31): NO CHANGE ... (45): NO CHANGE\n kosuu[k] += 1 # (29): kosuu=[2] (36): kosuu=[2, 2] ... (46): kosuu=[2, 2, 3]\n else:\n k += 1 # (32): k=1 (39): k=2\n kosuu.append(1) # (33): kosuu=[2, 1] (40): kosuu=[2, 2, 1]\n\nkosuu[-1] += 1 # (48): kosuu=[2, 2, 4]\nfor num in kosuu: # (49): num=2 (52): NO CHANGE ... (58): NO CHANGE\n if num <= 1: # (50): NO CHANGE (53): NO CHANGE (56): NO CHANGE\n ans += 0\n else:\n ans += math.factorial(num)/(math.factorial(2) * math.factorial(num-2)) # (51): ans=1.0 (54): ans=2.0 (57): ans=8.0\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n A_list = list(map(int, input().split()))\n import math\n \n ruiseki_A_list = [0 for _ in range(N)]\n \n for i in range(N):\n if i == 0:\n ruiseki_A_list[i] = A_list[i]\n else:\n ruiseki_A_list[i] = A_list[i] + ruiseki_A_list[i-1]\n \n \n \n ruiseki_A_list.insert(0,0)\n ans = 0\n \n \n ruiseki_A_list.sort()\n kosuu = [1]\n k = 0\n for i in range(N):\n if ruiseki_A_list[i+1] - ruiseki_A_list[i] == 0:\n kosuu[k] += 1\n else:\n k += 1\n kosuu.append(1)\n-\n-kosuu[-1] += 1\n+ \n for num in kosuu:\n if num <= 1:\n ans += 0\n else:\n ans += math.factorial(num)/(math.factorial(2) * math.factorial(num-2))\n-print(ans)\n+print(int(ans))\n", "FL_content": " N = int(input())\n A_list = list(map(int, input().split()))\n import math\n \n ruiseki_A_list = [0 for _ in range(N)]\n \n for i in range(N):\n if i == 0:\n ruiseki_A_list[i] = A_list[i]\n else:\n ruiseki_A_list[i] = A_list[i] + ruiseki_A_list[i-1]\n \n \n \n ruiseki_A_list.insert(0,0)\n ans = 0\n \n \n ruiseki_A_list.sort()\n kosuu = [1]\n k = 0\n for i in range(N):\n if ruiseki_A_list[i+1] - ruiseki_A_list[i] == 0:\n kosuu[k] += 1\n else:\n k += 1\n kosuu.append(1)\n-\n-kosuu[-1] += 1\n for num in kosuu:\n if num <= 1:\n ans += 0\n else:\n ans += math.factorial(num)/(math.factorial(2) * math.factorial(num-2))\n-print(ans)\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 35 }, { "user_id": "u099918199", "problem_id": "p03363", "submission1_id": "s842704676", "submission2_id": "s011506512", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nlist_a = list((map(int, input().split())))\nmemo = 0\nmemo_list = [0]\nmemo_dict = {}\nfor i in range(0,n):\n memo += list_a[i]\n memo_list.append(memo)\n if memo in memo_dict:\n memo_dict[memo] += 1\n else:\n memo_dict[memo] = 1\nans = 0\nfor number in memo_dict.values():\n ans += number * (number-1) / 2\nprint(int(ans))\n", "code2": "n = int(input())\nlist_a = list((map(int, input().split())))\nmemo = 0\nmemo_dict = {0:1}\nfor i in range(0,n):\n memo += list_a[i]\n if memo in memo_dict:\n memo_dict[memo] += 1\n else:\n memo_dict[memo] = 1\nans = 0\nfor number in memo_dict.values():\n ans += number * (number-1) / 2\nprint(int(ans))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1537939779", "date2": "1537940032", "bleu_score": "0.8691702091557438", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1], "code1_test_score": 29, "total_score": 103, "input": "7\n0 -2 2 -4 0 0 1\n", "actual_output": "4\n", "expected_output": "6\n\n", "anno_code": ["n = int(input()) # (0): n=7\nlist_a = list((map(int, input().split()))) # (1): list_a=[0, -2, 2, -4, 0, 0, 1]\nmemo = 0 # (2): memo=0\nmemo_list = [0] # (3): memo_list=[0]\nmemo_dict = {} # (4): memo_dict={}\nfor i in range(0,n): # (5): i=0 (10): i=1 ... (40): NO CHANGE\n memo += list_a[i] # (6): NO CHANGE (11): memo=-2 ... (36): memo=-3\n memo_list.append(memo) # (7): memo_list=[0, 0] (12): memo_list=[0, 0, -2] ... (37): memo_list=[0, 0, -2, 0, -4, -4, -4, -3]\n if memo in memo_dict: # (8): NO CHANGE (13): NO CHANGE ... (38): NO CHANGE\n memo_dict[memo] += 1 # (19): memo_dict={0: 2, -2: 1} (29): memo_dict={0: 2, -2: 1, -4: 2} (34): memo_dict={0: 2, -2: 1, -4: 3}\n else:\n memo_dict[memo] = 1 # (9): memo_dict={0: 1} (14): memo_dict={0: 1, -2: 1} ... (39): memo_dict={0: 2, -2: 1, -4: 3, -3: 1}\nans = 0 # (41): ans=0\nfor number in memo_dict.values(): # (42): number=2 (44): number=1 ... (50): NO CHANGE\n ans += number * (number-1) / 2 # (43): ans=1.0 (45): NO CHANGE ... (49): NO CHANGE\nprint(int(ans))\n"], "anno_status": [true], "diff_content": " n = int(input())\n list_a = list((map(int, input().split())))\n memo = 0\n-memo_list = [0]\n-memo_dict = {}\n+memo_dict = {0:1}\n for i in range(0,n):\n memo += list_a[i]\n- memo_list.append(memo)\n if memo in memo_dict:\n memo_dict[memo] += 1\n else:\n memo_dict[memo] = 1\n ans = 0\n for number in memo_dict.values():\n ans += number * (number-1) / 2\n print(int(ans))\n \n", "FL_content": " n = int(input())\n list_a = list((map(int, input().split())))\n memo = 0\n-memo_list = [0]\n-memo_dict = {}\n for i in range(0,n):\n memo += list_a[i]\n- memo_list.append(memo)\n if memo in memo_dict:\n memo_dict[memo] += 1\n else:\n memo_dict[memo] = 1\n ans = 0\n for number in memo_dict.values():\n ans += number * (number-1) / 2\n print(int(ans))\n \n", "added_lines": 1, "removed_lines": 3, "code1_lines": 17 }, { "user_id": "u149260203", "problem_id": "p03363", "submission1_id": "s161615627", "submission2_id": "s673866124", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = [int(i) for i in input().split()]\nca = [A[0]] + [0]*(N-1)\n\nfor i in range(1,N):\n ca[i] = ca[i-1] + A[i]\n\ncount = 0\nfor i in list(set(ca)):\n if i == 0:\n count += sum([1 if j == 0 else 0 for j in ca])\n number = sum([1 if j == i else 0 for j in ca])\n count += number * (number-1) /2\n\n\nprint(count)", "code2": "N = int(input())\nA = [int(i) for i in input().split()]\nca = [A[0]] + [0]*(N-1)\n\nfor i in range(1,N):\n ca[i] = ca[i-1] + A[i]\n\ncount = 1\nnumber = 0\nnumber += ca.count(0)\nsca = sorted(ca) + ['hoge']\nfor i in range(1,N+1):\n if sca[i] == sca[i-1]:\n count += 1\n else:\n number += count*(count - 1)/2\n count = 1\n\n\nprint(int(number))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1527117665", "date2": "1527119935", "bleu_score": "0.7013991385640482", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "7\n0 -2 2 -4 0 0 0\n", "actual_output": "9.0\n", "expected_output": "9\n\n", "anno_code": ["N = int(input()) # (0): N=7\nA = [int(i) for i in input().split()] # (1): A=[0, -2, 2, -4, 0, 0, 0]\nca = [A[0]] + [0]*(N-1) # (2): ca=[0, 0, 0, 0, 0, 0, 0]\n\nfor i in range(1,N): # (3): i=1 (5): i=2 ... (15): NO CHANGE\n ca[i] = ca[i-1] + A[i] # (4): ca=[0, -2, 0, 0, 0, 0, 0] (6): NO CHANGE ... (14): ca=[0, -2, 0, -4, -4, -4, -4]\n\ncount = 0 # (16): count=0\nfor i in list(set(ca)): # (17): i=0 (22): i=-4 ... (30): NO CHANGE\n if i == 0: # (18): NO CHANGE (23): NO CHANGE (27): NO CHANGE\n count += sum([1 if j == 0 else 0 for j in ca]) # (19): count=2\n number = sum([1 if j == i else 0 for j in ca]) # (20): number=2 (24): number=4 (28): number=1\n count += number * (number-1) /2 # (21): count=3.0 (25): count=9.0 (29): NO CHANGE\n\n\nprint(count)"], "anno_status": [true], "diff_content": " N = int(input())\n A = [int(i) for i in input().split()]\n ca = [A[0]] + [0]*(N-1)\n \n for i in range(1,N):\n ca[i] = ca[i-1] + A[i]\n \n-count = 0\n-for i in list(set(ca)):\n- if i == 0:\n- count += sum([1 if j == 0 else 0 for j in ca])\n- number = sum([1 if j == i else 0 for j in ca])\n- count += number * (number-1) /2\n+count = 1\n+number = 0\n+number += ca.count(0)\n+sca = sorted(ca) + ['hoge']\n+for i in range(1,N+1):\n+ if sca[i] == sca[i-1]:\n+ count += 1\n+ else:\n+ number += count*(count - 1)/2\n+ count = 1\n \n \n-print(count)\n+print(int(number))\n", "FL_content": " N = int(input())\n A = [int(i) for i in input().split()]\n ca = [A[0]] + [0]*(N-1)\n \n for i in range(1,N):\n ca[i] = ca[i-1] + A[i]\n \n-count = 0\n-for i in list(set(ca)):\n- if i == 0:\n- count += sum([1 if j == 0 else 0 for j in ca])\n- number = sum([1 if j == i else 0 for j in ca])\n- count += number * (number-1) /2\n \n \n-print(count)\n", "added_lines": 11, "removed_lines": 7, "code1_lines": 16 }, { "user_id": "u246217175", "problem_id": "p03363", "submission1_id": "s560136412", "submission2_id": "s667082587", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\nimport math\nn = int(input())\na = list(map(int,input().split()))\n \ns = []\n\ntem = 0\ns.append(tem)\nfor i in range(n):\n tem += a[i]\n s.append(tem)\n \nb = Counter(s)\nc = b.values()\n\nans = 0\nfor i in c:\n if i != 1:\n ans += math.factorial(i-1)\n \nprint(ans)", "code2": "from collections import Counter\nimport math\nn = int(input())\na = list(map(int,input().split()))\n \ns = []\n\ntem = 0\ns.append(tem)\nfor i in range(n):\n tem += a[i]\n s.append(tem)\n \nb = Counter(s)\nc = b.values()\n\nans = 0\nfor i in c:\n ans += (i*(i-1)\n \nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587767028", "date2": "1587767271", "bleu_score": "0.8830823005676833", "code1_test_status": [0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 51, "total_score": 103, "input": "7\n0 -2 2 -11 0 0 0\n", "actual_output": "8\n", "expected_output": "9\n\n", "anno_code": ["from collections import Counter\nimport math\nn = int(input()) # (0): n=7\na = list(map(int,input().split())) # (1): a=[0, -2, 2, -11, 0, 0, 0]\n \ns = [] # (2): s=[]\n\ntem = 0 # (3): tem=0\ns.append(tem) # (4): s=[0]\nfor i in range(n): # (5): i=0 (8): i=1 ... (26): NO CHANGE\n tem += a[i] # (6): NO CHANGE (9): tem=-2 ... (24): NO CHANGE\n s.append(tem) # (7): s=[0, 0] (10): s=[0, 0, -2] ... (25): s=[0, 0, -2, 0, -11, -11, -11, -11]\n \nb = Counter(s) # (27): b=Counter({-11: 4, 0: 3, -2: 1})\nc = b.values() # (28): c=dict_values([3, 1, 4])\n\nans = 0 # (29): ans=0\nfor i in c: # (30): i=3 (33): i=1 ... (38): NO CHANGE\n if i != 1: # (31): NO CHANGE (34): NO CHANGE (36): NO CHANGE\n ans += math.factorial(i-1) # (32): ans=2 (37): ans=8\n \nprint(ans)"], "anno_status": [true], "diff_content": " from collections import Counter\n import math\n n = int(input())\n a = list(map(int,input().split()))\n \n s = []\n \n tem = 0\n s.append(tem)\n for i in range(n):\n tem += a[i]\n s.append(tem)\n \n b = Counter(s)\n c = b.values()\n \n ans = 0\n for i in c:\n- if i != 1:\n- ans += math.factorial(i-1)\n+ ans += (i*(i-1)\n \n print(ans)\n", "FL_content": " from collections import Counter\n import math\n n = int(input())\n a = list(map(int,input().split()))\n \n s = []\n \n tem = 0\n s.append(tem)\n for i in range(n):\n tem += a[i]\n s.append(tem)\n \n b = Counter(s)\n c = b.values()\n \n ans = 0\n for i in c:\n- if i != 1:\n- ans += math.factorial(i-1)\n \n print(ans)\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 22 }, { "user_id": "u532966492", "problem_id": "p03363", "submission1_id": "s931944447", "submission2_id": "s425938511", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nL=list(map(int,input().split()))\nN=200000\nL=[i for i in range(N)]\nLeft=[[0,0]]\nRight=[[0,N]]\nfor i in range(N):\n Left.append([Left[i][0]+L[i],i+1])\nfor i in range(N):\n Right.append([Right[i][0]+L[i*(-1)-1],N-i-1])\nRight=list(reversed(Right))\nLeft=sorted(Left, key=lambda x: x[0])\n_sum_=Right[0][0]\nLeft=sorted(Left, key=lambda x: x[0],reverse=True)\nRight=sorted(Right, key=lambda x: x[0])\nLeft.append([0,0])\nRight.append([0,0])\n\nj=0\ns=0\nans=0\nfor i in range(N+1):\n if i != 0:\n if Left[i][0]!=Left[i-1][0]:\n s=0\n while(Left[i][0]+Right[j][0]<_sum_ and j<=N):\n j+=1\n if j>N:\n break\n elif Left[i][0]+Right[j][0]>_sum_:\n continue\n else:\n while(Left[i][0]+Right[j][0]==_sum_ and j<=N):\n if Left[i][1]>=Right[j][1]:\n j+=1\n else:\n s+=1\n ans+=s\n break\nprint(ans)", "code2": "N=int(input())\nL=list(map(int,input().split()))\nLeft=[[0,0]]\nRight=[[0,N]]\nfor i in range(N):\n Left.append([Left[i][0]+L[i],i+1])\nfor i in range(N):\n Right.append([Right[i][0]+L[i*(-1)-1],N-i-1])\nRight=list(reversed(Right))\nLeft=sorted(Left, key=lambda x: x[0])\n_sum_=Right[0][0]\nLeft=sorted(Left, key=lambda x: x[0],reverse=True)\nRight=sorted(Right, key=lambda x: x[0])\nLeft.append([0,0])\nRight.append([0,0])\n \nj=0\ns=0\nans=0\nfor i in range(N+1):\n if i != 0:\n if Left[i][0]!=Left[i-1][0]:\n s=0\n while(Left[i][0]+Right[j][0]<_sum_ and j<=N):\n j+=1\n if j>N:\n break\n elif Left[i][0]+Right[j][0]>_sum_:\n continue\n else:\n while(Left[i][0]+Right[j][0]==_sum_ and j<=N):\n if Left[i][1]>=Right[j][1]:\n j+=1\n else:\n s+=1\n ans+=s\n break\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558319105", "date2": "1558326517", "bleu_score": "0.9612494470143321", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0], "code1_test_score": 16, "total_score": 103, "input": "6\n1 3 -2 2 0 -4\n", "actual_output": "1\n", "expected_output": "4\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N=int(input())\n L=list(map(int,input().split()))\n-N=200000\n-L=[i for i in range(N)]\n Left=[[0,0]]\n Right=[[0,N]]\n for i in range(N):\n Left.append([Left[i][0]+L[i],i+1])\n for i in range(N):\n Right.append([Right[i][0]+L[i*(-1)-1],N-i-1])\n Right=list(reversed(Right))\n Left=sorted(Left, key=lambda x: x[0])\n _sum_=Right[0][0]\n Left=sorted(Left, key=lambda x: x[0],reverse=True)\n Right=sorted(Right, key=lambda x: x[0])\n Left.append([0,0])\n Right.append([0,0])\n-\n+ \n j=0\n s=0\n ans=0\n for i in range(N+1):\n if i != 0:\n if Left[i][0]!=Left[i-1][0]:\n s=0\n while(Left[i][0]+Right[j][0]<_sum_ and j<=N):\n j+=1\n if j>N:\n break\n elif Left[i][0]+Right[j][0]>_sum_:\n continue\n else:\n while(Left[i][0]+Right[j][0]==_sum_ and j<=N):\n if Left[i][1]>=Right[j][1]:\n j+=1\n else:\n s+=1\n ans+=s\n break\n print(ans)\n", "FL_content": " N=int(input())\n L=list(map(int,input().split()))\n-N=200000\n-L=[i for i in range(N)]\n Left=[[0,0]]\n Right=[[0,N]]\n for i in range(N):\n Left.append([Left[i][0]+L[i],i+1])\n for i in range(N):\n Right.append([Right[i][0]+L[i*(-1)-1],N-i-1])\n Right=list(reversed(Right))\n Left=sorted(Left, key=lambda x: x[0])\n _sum_=Right[0][0]\n Left=sorted(Left, key=lambda x: x[0],reverse=True)\n Right=sorted(Right, key=lambda x: x[0])\n Left.append([0,0])\n Right.append([0,0])\n-\n j=0\n s=0\n ans=0\n for i in range(N+1):\n if i != 0:\n if Left[i][0]!=Left[i-1][0]:\n s=0\n while(Left[i][0]+Right[j][0]<_sum_ and j<=N):\n j+=1\n if j>N:\n break\n elif Left[i][0]+Right[j][0]>_sum_:\n continue\n else:\n while(Left[i][0]+Right[j][0]==_sum_ and j<=N):\n if Left[i][1]>=Right[j][1]:\n j+=1\n else:\n s+=1\n ans+=s\n break\n print(ans)\n", "added_lines": 1, "removed_lines": 3, "code1_lines": 40 }, { "user_id": "u053220793", "problem_id": "p03363", "submission1_id": "s294802906", "submission2_id": "s034375082", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nn = int(input())\ns = list(map(int, input().split()))\nfor i in range(1, n):\n s[i] += s[i-1]\n\nans = 0\nprint(s)\ns = sorted(s)\nprint(s)\ni = 0\nwhile True:\n mid = 0\n for j in range(i+1, n):\n if s[j] == s[i]:\n mid += 1\n ans += mid\n else:\n break\n if s[i] == 0:\n ans += mid+1\n i += mid\n i += 1\n if i >= n:\n break\nprint(ans)", "code2": "\n\nn = int(input())\ns = list(map(int, input().split()))\nfor i in range(1, n):\n s[i] += s[i-1]\n\nans = 0\ns = sorted(s)\ni = 0\nwhile True:\n mid = 0\n for j in range(i+1, n):\n if s[j] == s[i]:\n mid += 1\n ans += mid\n else:\n break\n if s[i] == 0:\n ans += mid+1\n i += mid\n i += 1\n if i >= n:\n break\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1525013724", "date2": "1525013825", "bleu_score": "0.953827952250936", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "5\n0 0 3 1 8\n", "actual_output": "[0, 0, 3, 4, 12]\n[0, 0, 3, 4, 12]\n3\n", "expected_output": "3\n\n", "anno_code": ["\n\nn = int(input()) # (0): n=5\ns = list(map(int, input().split())) # (1): s=[0, 0, 3, 1, 8]\nfor i in range(1, n): # (2): i=1 (4): i=2 ... (10): NO CHANGE\n s[i] += s[i-1] # (3): NO CHANGE (5): NO CHANGE ... (9): s=[0, 0, 3, 4, 12]\n\nans = 0 # (11): ans=0\nprint(s) # (12): NO CHANGE\ns = sorted(s) # (13): NO CHANGE\nprint(s) # (14): NO CHANGE\ni = 0 # (15): i=0\nwhile True: # (16): NO CHANGE (30): NO CHANGE ... (48): NO CHANGE\n mid = 0 # (17): mid=0 (31): mid=0 ... (49): NO CHANGE\n for j in range(i+1, n): # (18): j=1 (22): j=2 ... (50): NO CHANGE\n if s[j] == s[i]: # (19): NO CHANGE (23): NO CHANGE ... (42): NO CHANGE\n mid += 1 # (20): mid=1\n ans += mid # (21): ans=1\n else:\n break # (24): NO CHANGE (34): NO CHANGE (43): NO CHANGE\n if s[i] == 0: # (25): NO CHANGE (35): NO CHANGE ... (51): NO CHANGE\n ans += mid+1 # (26): ans=3\n i += mid # (27): i=1 (36): NO CHANGE ... (52): NO CHANGE\n i += 1 # (28): i=2 (37): i=3 ... (53): i=5\n if i >= n: # (29): NO CHANGE (38): NO CHANGE ... (54): NO CHANGE\n break # (55): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " \n \n n = int(input())\n s = list(map(int, input().split()))\n for i in range(1, n):\n s[i] += s[i-1]\n \n ans = 0\n-print(s)\n s = sorted(s)\n-print(s)\n i = 0\n while True:\n mid = 0\n for j in range(i+1, n):\n if s[j] == s[i]:\n mid += 1\n ans += mid\n else:\n break\n if s[i] == 0:\n ans += mid+1\n i += mid\n i += 1\n if i >= n:\n break\n print(ans)\n+\n", "FL_content": " \n \n n = int(input())\n s = list(map(int, input().split()))\n for i in range(1, n):\n s[i] += s[i-1]\n \n ans = 0\n-print(s)\n s = sorted(s)\n-print(s)\n i = 0\n while True:\n mid = 0\n for j in range(i+1, n):\n if s[j] == s[i]:\n mid += 1\n ans += mid\n else:\n break\n if s[i] == 0:\n ans += mid+1\n i += mid\n i += 1\n if i >= n:\n break\n print(ans)\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 27 }, { "user_id": "u268210555", "problem_id": "p03363", "submission1_id": "s740876841", "submission2_id": "s266466411", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import *\nfrom itertools import *\nn = int(input())\na = list(map(int, input().split()))\nb = list(accumulate(a))\nc = Counter(b)\nr = 0\nfor i in range(n):\n c[b[i]] -= 1\n r += c[b[i]-a[i]]\nprint(r)", "code2": "from collections import *\nfrom itertools import *\nn = int(input())\na = list(map(int, input().split()))\nb = list(accumulate(a))\nc = Counter(b)\nr = 0\nfor i in range(n):\n r += c[b[i]-a[i]]\n c[b[i]] -= 1\nprint(r)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1525007808", "date2": "1525012045", "bleu_score": "0.9928710116167552", "code1_test_status": [0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1], "code1_test_score": 26, "total_score": 103, "input": "7\n0 -1 1 -4 -1 0 -3\n", "actual_output": "2\n", "expected_output": "4\n\n", "anno_code": ["from collections import *\nfrom itertools import *\nn = int(input()) # (0): n=7\na = list(map(int, input().split())) # (1): a=[0, -1, 1, -4, -1, 0, -3]\nb = list(accumulate(a)) # (2): b=[0, -1, 0, -4, -5, -5, -8]\nc = Counter(b) # (3): c=Counter({0: 2, -5: 2, -1: 1, -4: 1, -8: 1})\nr = 0 # (4): r=0\nfor i in range(n): # (5): i=0 (8): i=1 ... (26): NO CHANGE\n c[b[i]] -= 1 # (6): c=Counter({-5: 2, 0: 1, -1: 1, -4: 1, -8: 1}) (9): c=Counter({-5: 2, 0: 1, -4: 1, -8: 1, -1: 0}) ... (24): c=Counter({0: 0, -1: 0, -4: 0, -5: 0, -8: 0})\n r += c[b[i]-a[i]] # (7): r=1 (10): r=2 ... (25): NO CHANGE\nprint(r)"], "anno_status": [true], "diff_content": " from collections import *\n from itertools import *\n n = int(input())\n a = list(map(int, input().split()))\n b = list(accumulate(a))\n c = Counter(b)\n r = 0\n for i in range(n):\n- c[b[i]] -= 1\n r += c[b[i]-a[i]]\n+ c[b[i]] -= 1\n print(r)\n", "FL_content": " from collections import *\n from itertools import *\n n = int(input())\n a = list(map(int, input().split()))\n b = list(accumulate(a))\n c = Counter(b)\n r = 0\n for i in range(n):\n- c[b[i]] -= 1\n r += c[b[i]-a[i]]\n print(r)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u874935184", "problem_id": "p03363", "submission1_id": "s013518033", "submission2_id": "s335333994", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = map(int, input().split())\nd = set()\ns = 0\nc = 0\nfor i in a:\n s += i\n if s == 0:\n c+=1\n elif s in d:\n c+=1\n d.add(s)\nprint(c)", "code2": "n = int(input())\na = map(int, input().split())\nd = {}\ns = 0\nc = 0\nfor i in a:\n s += i\n if s == 0:\n c+=1\n if s in d:\n c+=d[s]\n d[s]+=1\n else:\n d[s]=1\n\nprint(c)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1528196143", "date2": "1528196328", "bleu_score": "0.784276203017542", "code1_test_status": [0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1], "code1_test_score": 40, "total_score": 103, "input": "6\n0 0 -4 3 0 -2\n", "actual_output": "3\n", "expected_output": "4\n\n", "anno_code": ["n = int(input()) # (0): n=6\na = map(int, input().split()) # (1): a=\nd = set() # (2): d=set()\ns = 0 # (3): s=0\nc = 0 # (4): c=0\nfor i in a: # (5): i=0 (10): NO CHANGE ... (36): NO CHANGE\n s += i # (6): NO CHANGE (11): NO CHANGE ... (32): s=-3\n if s == 0: # (7): NO CHANGE (12): NO CHANGE ... (33): NO CHANGE\n c+=1 # (8): c=1 (13): c=2\n elif s in d: # (18): NO CHANGE (23): NO CHANGE ... (34): NO CHANGE\n c+=1 # (29): c=3\n d.add(s) # (9): d={0} (14): NO CHANGE ... (35): d={0, -4, -3, -1}\nprint(c)"], "anno_status": [true], "diff_content": " n = int(input())\n a = map(int, input().split())\n-d = set()\n+d = {}\n s = 0\n c = 0\n for i in a:\n s += i\n if s == 0:\n c+=1\n- elif s in d:\n- c+=1\n- d.add(s)\n+ if s in d:\n+ c+=d[s]\n+ d[s]+=1\n+ else:\n+ d[s]=1\n+\n print(c)\n", "FL_content": " n = int(input())\n a = map(int, input().split())\n-d = set()\n s = 0\n c = 0\n for i in a:\n s += i\n if s == 0:\n c+=1\n- elif s in d:\n- c+=1\n- d.add(s)\n print(c)\n", "added_lines": 7, "removed_lines": 4, "code1_lines": 13 }, { "user_id": "u149260203", "problem_id": "p03363", "submission1_id": "s524517994", "submission2_id": "s673866124", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = [int(i) for i in input().split()]\nca = [A[0]] + [0]*(N-1)\n\nfor i in range(1,N):\n ca[i] = ca[i-1] + A[i]\n\ncount = 1\nnumber = 0\nnumber += ca.count(0)\nsca = sorted(ca) + ['hoge']\nprint(sca)\nfor i in range(1,N+1):\n if sca[i] == sca[i-1]:\n count += 1\n else:\n number += count*(count - 1)/2\n count = 1\n\n\nprint(int(number))", "code2": "N = int(input())\nA = [int(i) for i in input().split()]\nca = [A[0]] + [0]*(N-1)\n\nfor i in range(1,N):\n ca[i] = ca[i-1] + A[i]\n\ncount = 1\nnumber = 0\nnumber += ca.count(0)\nsca = sorted(ca) + ['hoge']\nfor i in range(1,N+1):\n if sca[i] == sca[i-1]:\n count += 1\n else:\n number += count*(count - 1)/2\n count = 1\n\n\nprint(int(number))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1527119914", "date2": "1527119935", "bleu_score": "0.9674228091306235", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "6\n-1 1 -3 2 1 -3\n", "actual_output": "[-3, -3, -1, -1, 0, 0, 'hoge']\n5\n", "expected_output": "5\n\n", "anno_code": ["N = int(input()) # (0): N=6\nA = [int(i) for i in input().split()] # (1): A=[-1, 1, -3, 2, 1, -3]\nca = [A[0]] + [0]*(N-1) # (2): ca=[-1, 0, 0, 0, 0, 0]\n\nfor i in range(1,N): # (3): i=1 (5): i=2 ... (13): NO CHANGE\n ca[i] = ca[i-1] + A[i] # (4): NO CHANGE (6): ca=[-1, 0, -3, 0, 0, 0] ... (12): ca=[-1, 0, -3, -1, 0, -3]\n\ncount = 1 # (14): count=1\nnumber = 0 # (15): number=0\nnumber += ca.count(0) # (16): number=2\nsca = sorted(ca) + ['hoge'] # (17): sca=[-3, -3, -1, -1, 0, 0, 'hoge']\nprint(sca) # (18): NO CHANGE\nfor i in range(1,N+1): # (19): i=1 (22): i=2 ... (40): NO CHANGE\n if sca[i] == sca[i-1]: # (20): NO CHANGE (23): NO CHANGE ... (37): NO CHANGE\n count += 1 # (21): count=2 (28): count=2 (35): count=2\n else:\n number += count*(count - 1)/2 # (24): number=3.0 (31): number=4.0 (38): number=5.0\n count = 1 # (25): count=1 (32): count=1 (39): count=1\n\n\nprint(int(number))"], "anno_status": [true], "diff_content": " N = int(input())\n A = [int(i) for i in input().split()]\n ca = [A[0]] + [0]*(N-1)\n \n for i in range(1,N):\n ca[i] = ca[i-1] + A[i]\n \n count = 1\n number = 0\n number += ca.count(0)\n sca = sorted(ca) + ['hoge']\n-print(sca)\n for i in range(1,N+1):\n if sca[i] == sca[i-1]:\n count += 1\n else:\n number += count*(count - 1)/2\n count = 1\n \n \n print(int(number))\n", "FL_content": " N = int(input())\n A = [int(i) for i in input().split()]\n ca = [A[0]] + [0]*(N-1)\n \n for i in range(1,N):\n ca[i] = ca[i-1] + A[i]\n \n count = 1\n number = 0\n number += ca.count(0)\n sca = sorted(ca) + ['hoge']\n-print(sca)\n for i in range(1,N+1):\n if sca[i] == sca[i-1]:\n count += 1\n else:\n number += count*(count - 1)/2\n count = 1\n \n \n print(int(number))\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 21 }, { "user_id": "u099918199", "problem_id": "p03363", "submission1_id": "s086379236", "submission2_id": "s011506512", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nlist_a = list((map(int, input().split())))\nmemo = 0\nmemo_dict = {0:1}\nfor i in range(0,n):\n memo += list_a[i]\n if memo in memo_dict:\n memo_dict[memo] += 1\n else:\n memo_dict[memo] = 1\nprint(memo_dict)\nans = 0\nfor number in memo_dict.values():\n ans += number * (number-1) / 2\nprint(int(ans))\n", "code2": "n = int(input())\nlist_a = list((map(int, input().split())))\nmemo = 0\nmemo_dict = {0:1}\nfor i in range(0,n):\n memo += list_a[i]\n if memo in memo_dict:\n memo_dict[memo] += 1\n else:\n memo_dict[memo] = 1\nans = 0\nfor number in memo_dict.values():\n ans += number * (number-1) / 2\nprint(int(ans))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1537939908", "date2": "1537940032", "bleu_score": "0.945352422842051", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "6\n1 3 -2 2 2 -4\n", "actual_output": "{0: 1, 1: 1, 4: 2, 2: 2, 6: 1}\n2\n", "expected_output": "2\n\n", "anno_code": ["n = int(input()) # (0): n=6\nlist_a = list((map(int, input().split()))) # (1): list_a=[1, 3, -2, 2, 2, -4]\nmemo = 0 # (2): memo=0\nmemo_dict = {0:1} # (3): memo_dict={0: 1}\nfor i in range(0,n): # (4): i=0 (8): i=1 ... (28): NO CHANGE\n memo += list_a[i] # (5): memo=1 (9): memo=4 ... (25): memo=2\n if memo in memo_dict: # (6): NO CHANGE (10): NO CHANGE ... (26): NO CHANGE\n memo_dict[memo] += 1 # (19): memo_dict={0: 1, 1: 1, 4: 2, 2: 1} (27): memo_dict={0: 1, 1: 1, 4: 2, 2: 2, 6: 1}\n else:\n memo_dict[memo] = 1 # (7): memo_dict={0: 1, 1: 1} (11): memo_dict={0: 1, 1: 1, 4: 1} ... (23): memo_dict={0: 1, 1: 1, 4: 2, 2: 1, 6: 1}\nprint(memo_dict) # (29): NO CHANGE\nans = 0 # (30): ans=0\nfor number in memo_dict.values(): # (31): number=1 (33): NO CHANGE ... (41): NO CHANGE\n ans += number * (number-1) / 2 # (32): NO CHANGE (34): NO CHANGE ... (40): NO CHANGE\nprint(int(ans))\n"], "anno_status": [true], "diff_content": " n = int(input())\n list_a = list((map(int, input().split())))\n memo = 0\n memo_dict = {0:1}\n for i in range(0,n):\n memo += list_a[i]\n if memo in memo_dict:\n memo_dict[memo] += 1\n else:\n memo_dict[memo] = 1\n-print(memo_dict)\n ans = 0\n for number in memo_dict.values():\n ans += number * (number-1) / 2\n print(int(ans))\n \n", "FL_content": " n = int(input())\n list_a = list((map(int, input().split())))\n memo = 0\n memo_dict = {0:1}\n for i in range(0,n):\n memo += list_a[i]\n if memo in memo_dict:\n memo_dict[memo] += 1\n else:\n memo_dict[memo] = 1\n-print(memo_dict)\n ans = 0\n for number in memo_dict.values():\n ans += number * (number-1) / 2\n print(int(ans))\n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u252745826", "problem_id": "p04000", "submission1_id": "s254684998", "submission2_id": "s890120030", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\n\nh, w, n = list(map(int, input().split()))\nans = [0 for i in range(10)]\n\nif n != 0:\n board = defaultdict(int)\n for i in range(n):\n a, b = list(map(int, input().split()))\n a = a - 1\n b = b - 1\n for dx in range(b-1, b+2):\n if dx < 0 or dx >= w:\n continue\n for dy in range(a-1, a+2):\n if dy < 0 or dy >= h:\n continue\n board[(dx, dy)] += 1\n\n for x in range(1, w-1):\n for y in range(1, h-1):\n num = board[(x, y)]\n ans[num] += 1\n\nfor i in range(10):\n print(ans[i])\n", "code2": "from collections import defaultdict\n\nh, w, n = list(map(int, input().split()))\nans = [0 for i in range(10)]\n\nboard = defaultdict(int)\nfor i in range(n):\n a, b = list(map(int, input().split()))\n a = a - 1\n b = b - 1\n for dx in range(b-1, b+2):\n if dx <= 0 or dx >= w - 1:\n continue\n for dy in range(a-1, a+2):\n if dy <= 0 or dy >= h - 1:\n continue\n board[(dx, dy)] += 1\n\nfor v in board.values():\n ans[v] += 1\nans[0] = (h - 2) * (w - 2) - sum(ans)\n\nfor i in range(10):\n print(ans[i])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1508332757", "date2": "1508333198", "bleu_score": "0.7585254508618349", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 91, "total_score": 103, "input": "1000100000 1001001010 0\n", "actual_output": "0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n", "expected_output": "1001101106098797984\n0\n0\n0\n0\n0\n0\n0\n0\n0\n\n", "anno_code": ["from collections import defaultdict\n\nh, w, n = list(map(int, input().split())) # (0): h=1000100000, w=1001001010, n=0\nans = [0 for i in range(10)] # (1): ans=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\nif n != 0: # (2): NO CHANGE\n board = defaultdict(int)\n for i in range(n):\n a, b = list(map(int, input().split()))\n a = a - 1\n b = b - 1\n for dx in range(b-1, b+2):\n if dx < 0 or dx >= w:\n continue\n for dy in range(a-1, a+2):\n if dy < 0 or dy >= h:\n continue\n board[(dx, dy)] += 1\n\n for x in range(1, w-1):\n for y in range(1, h-1):\n num = board[(x, y)]\n ans[num] += 1\n\nfor i in range(10): # (3): i=0 (5): i=1 ... (21): i=9\n print(ans[i]) # (4): NO CHANGE (6): NO CHANGE ... (22): NO CHANGE\n"], "anno_status": [true], "diff_content": " from collections import defaultdict\n \n h, w, n = list(map(int, input().split()))\n ans = [0 for i in range(10)]\n \n-if n != 0:\n- board = defaultdict(int)\n- for i in range(n):\n- a, b = list(map(int, input().split()))\n- a = a - 1\n- b = b - 1\n- for dx in range(b-1, b+2):\n- if dx < 0 or dx >= w:\n+board = defaultdict(int)\n+for i in range(n):\n+ a, b = list(map(int, input().split()))\n+ a = a - 1\n+ b = b - 1\n+ for dx in range(b-1, b+2):\n+ if dx <= 0 or dx >= w - 1:\n+ continue\n+ for dy in range(a-1, a+2):\n+ if dy <= 0 or dy >= h - 1:\n continue\n- for dy in range(a-1, a+2):\n- if dy < 0 or dy >= h:\n- continue\n- board[(dx, dy)] += 1\n+ board[(dx, dy)] += 1\n \n- for x in range(1, w-1):\n- for y in range(1, h-1):\n- num = board[(x, y)]\n- ans[num] += 1\n+for v in board.values():\n+ ans[v] += 1\n+ans[0] = (h - 2) * (w - 2) - sum(ans)\n \n for i in range(10):\n print(ans[i])\n \n", "FL_content": " from collections import defaultdict\n \n h, w, n = list(map(int, input().split()))\n ans = [0 for i in range(10)]\n \n-if n != 0:\n- board = defaultdict(int)\n- for i in range(n):\n- a, b = list(map(int, input().split()))\n- a = a - 1\n- b = b - 1\n- for dx in range(b-1, b+2):\n- if dx < 0 or dx >= w:\n continue\n- for dy in range(a-1, a+2):\n- if dy < 0 or dy >= h:\n- continue\n- board[(dx, dy)] += 1\n \n- for x in range(1, w-1):\n- for y in range(1, h-1):\n- num = board[(x, y)]\n- ans[num] += 1\n \n for i in range(10):\n print(ans[i])\n \n", "added_lines": 14, "removed_lines": 16, "code1_lines": 27 }, { "user_id": "u596276291", "problem_id": "p04000", "submission1_id": "s810952650", "submission2_id": "s614720651", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\n\n\ndef main():\n H, W, N = map(int, input().split())\n\n d = defaultdict(int)\n for _ in range(N):\n a, b = map(int, input().split())\n for y in range(-2, 1):\n for x in range(-2, 1):\n n_y, n_x = y + a, x + b\n if 0 < n_y <= H - 2 and 0 < n_x <= W - 2:\n d[(n_y, n_x)] += 1\n\n ans = [0] * 10\n for k, v in d.items():\n ans[v] += 1\n\n print(*ans, sep=\"\\n\")\n\nif __name__ == '__main__':\n main()\n", "code2": "from collections import defaultdict\n\n\ndef main():\n H, W, N = map(int, input().split())\n\n d = defaultdict(int)\n for _ in range(N):\n a, b = map(int, input().split())\n for y in range(-2, 1):\n for x in range(-2, 1):\n n_y, n_x = y + a, x + b\n if 0 < n_y <= H - 2 and 0 < n_x <= W - 2:\n d[(n_y, n_x)] += 1\n\n ans = [0] * 10\n for k, v in d.items():\n ans[v] += 1\n ans[0] = (H - 2) * (W - 2) - sum(ans)\n\n print(*ans, sep=\"\\n\")\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1476138338", "date2": "1476138892", "bleu_score": "0.9231760026804908", "code1_test_status": [0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 10, "total_score": 103, "input": "10 10 20\n0 1\n1 4\n1 9\n2 7\n3 5\n4 2\n1 7\n5 9\n6 4\n6 6\n6 7\n2 2\n7 3\n7 5\n16 1\n8 5\n8 10\n9 4\n10 4\n10 9\n", "actual_output": "0\n25\n21\n8\n4\n0\n0\n0\n0\n0\n", "expected_output": "6\n25\n21\n8\n4\n0\n0\n0\n0\n0\n\n", "anno_code": ["from collections import defaultdict\n\n\ndef main(): # (0): main=\n H, W, N = map(int, input().split())\n\n d = defaultdict(int)\n for _ in range(N):\n a, b = map(int, input().split())\n for y in range(-2, 1):\n for x in range(-2, 1):\n n_y, n_x = y + a, x + b\n if 0 < n_y <= H - 2 and 0 < n_x <= W - 2:\n d[(n_y, n_x)] += 1\n\n ans = [0] * 10\n for k, v in d.items():\n ans[v] += 1\n\n print(*ans, sep=\"\\n\")\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " from collections import defaultdict\n \n \n def main():\n H, W, N = map(int, input().split())\n \n d = defaultdict(int)\n for _ in range(N):\n a, b = map(int, input().split())\n for y in range(-2, 1):\n for x in range(-2, 1):\n n_y, n_x = y + a, x + b\n if 0 < n_y <= H - 2 and 0 < n_x <= W - 2:\n d[(n_y, n_x)] += 1\n \n ans = [0] * 10\n for k, v in d.items():\n ans[v] += 1\n+ ans[0] = (H - 2) * (W - 2) - sum(ans)\n \n print(*ans, sep=\"\\n\")\n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " from collections import defaultdict\n \n \n def main():\n H, W, N = map(int, input().split())\n \n d = defaultdict(int)\n for _ in range(N):\n a, b = map(int, input().split())\n for y in range(-2, 1):\n for x in range(-2, 1):\n n_y, n_x = y + a, x + b\n if 0 < n_y <= H - 2 and 0 < n_x <= W - 2:\n d[(n_y, n_x)] += 1\n \n ans = [0] * 10\n for k, v in d.items():\n ans[v] += 1\n \n print(*ans, sep=\"\\n\")\n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 1, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u252745826", "problem_id": "p04000", "submission1_id": "s615539585", "submission2_id": "s890120030", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\n\nh, w, n = list(map(int, input().split()))\nans = [0 for i in range(10)]\n\nif n != 0:\n board = defaultdict(int)\n for i in range(n):\n a, b = list(map(int, input().split()))\n a = a - 1\n b = b - 1\n for dx in range(b-1, b+2):\n if dx <= 0 or dx >= w - 1:\n continue\n for dy in range(a-1, a+2):\n if dy <= 0 or dy >= h - 1:\n continue\n board[(dx, dy)] += 1\n\n for v in board.values():\n ans[v] += 1\n\nfor i in range(10):\n print(ans[i])\n", "code2": "from collections import defaultdict\n\nh, w, n = list(map(int, input().split()))\nans = [0 for i in range(10)]\n\nboard = defaultdict(int)\nfor i in range(n):\n a, b = list(map(int, input().split()))\n a = a - 1\n b = b - 1\n for dx in range(b-1, b+2):\n if dx <= 0 or dx >= w - 1:\n continue\n for dy in range(a-1, a+2):\n if dy <= 0 or dy >= h - 1:\n continue\n board[(dx, dy)] += 1\n\nfor v in board.values():\n ans[v] += 1\nans[0] = (h - 2) * (w - 2) - sum(ans)\n\nfor i in range(10):\n print(ans[i])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1508332943", "date2": "1508333198", "bleu_score": "0.8830332676614862", "code1_test_status": [0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 10, "total_score": 103, "input": "10 10 20\n0 1\n1 4\n1 9\n2 5\n2 6\n4 1\n1 7\n5 9\n6 4\n6 6\n6 5\n2 2\n10 3\n7 8\n16 1\n8 5\n11 10\n9 5\n17 4\n4 9\n", "actual_output": "0\n20\n24\n7\n1\n0\n0\n0\n0\n0\n", "expected_output": "12\n20\n24\n7\n1\n0\n0\n0\n0\n0\n\n", "anno_code": ["from collections import defaultdict\n\nh, w, n = list(map(int, input().split())) # (0): h=10, w=10, n=20\nans = [0 for i in range(10)] # (1): ans=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\nif n != 0: # (2): NO CHANGE\n board = defaultdict(int) # (3): board=defaultdict(, {})\n for i in range(n): # (4): i=0 (27): i=1 ... (716): NO CHANGE\n a, b = list(map(int, input().split())) # (5): a=0, b=1 (28): a=1, b=4 ... (685): a=4, b=9\n a = a - 1 # (6): a=-1 (29): a=0 ... (686): a=3\n b = b - 1 # (7): b=0 (30): b=3 ... (687): b=8\n for dx in range(b-1, b+2): # (8): dx=-1 (11): dx=0 ... (715): NO CHANGE\n if dx <= 0 or dx >= w - 1: # (9): NO CHANGE (12): NO CHANGE ... (713): NO CHANGE\n continue # (10): NO CHANGE (13): NO CHANGE ... (714): NO CHANGE\n for dy in range(a-1, a+2): # (16): dy=-2 (19): dy=-1 ... (711): NO CHANGE\n if dy <= 0 or dy >= h - 1: # (17): NO CHANGE (20): NO CHANGE ... (709): NO CHANGE\n continue # (18): NO CHANGE (21): NO CHANGE ... (681): NO CHANGE\n board[(dx, dy)] += 1 # (41): board=defaultdict(, {(2, 1): 1}) (53): board=defaultdict(, {(2, 1): 1, (3, 1): 1}) ... (710): board=defaultdict(, {(2, 1): 2, (3, 1): 2, (4, 1): 3, (7, 1): 2, (8, 1): 1, (3, 2): 1, (4, 2): 2, (5, 1): 3, (5, 2): 2, (6, 1): 2, (6, 2): 1, (1, 2): 2, (1, 3): 1, (1, 4): 1, (7, 3): 2, (7, 4): 2, (7, 5): 2, (8, 3): 2, (8, 4): 2, (8, 5): 2, (2, 4): 1, (2, 5): 1, (2, 6): 1, (3, 4): 2, (3, 5): 2, (3, 6): 3, (4, 4): 3, (4, 5): 3, (4, 6): 4, (5, 4): 2, (5, 5): 2, (5, 6): 3, (6, 4): 1, (6, 5): 2, (6, 6): 2, (1, 1): 1, (2, 2): 1, (1, 8): 1, (2, 8): 1, (3, 8): 3, (6, 7): 1, (7, 6): 1, (7, 7): 1, (8, 6): 1, (8, 7): 1, (3, 7): 2, (4, 7): 2, (4, 8): 2, (5, 7): 2, (5, 8): 2, (7, 2): 1, (8, 2): 1})\n\n for v in board.values(): # (717): v=2 (719): NO CHANGE ... (821): NO CHANGE\n ans[v] += 1 # (718): ans=[0, 0, 1, 0, 0, 0, 0, 0, 0, 0] (720): ans=[0, 0, 2, 0, 0, 0, 0, 0, 0, 0] ... (820): ans=[0, 20, 24, 7, 1, 0, 0, 0, 0, 0]\n\nfor i in range(10): # (822): i=0 (824): i=1 ... (840): i=9\n print(ans[i]) # (823): NO CHANGE (825): NO CHANGE ... (841): NO CHANGE\n"], "anno_status": [false], "diff_content": " from collections import defaultdict\n \n h, w, n = list(map(int, input().split()))\n ans = [0 for i in range(10)]\n \n-if n != 0:\n- board = defaultdict(int)\n- for i in range(n):\n- a, b = list(map(int, input().split()))\n- a = a - 1\n- b = b - 1\n- for dx in range(b-1, b+2):\n- if dx <= 0 or dx >= w - 1:\n+board = defaultdict(int)\n+for i in range(n):\n+ a, b = list(map(int, input().split()))\n+ a = a - 1\n+ b = b - 1\n+ for dx in range(b-1, b+2):\n+ if dx <= 0 or dx >= w - 1:\n+ continue\n+ for dy in range(a-1, a+2):\n+ if dy <= 0 or dy >= h - 1:\n continue\n- for dy in range(a-1, a+2):\n- if dy <= 0 or dy >= h - 1:\n- continue\n- board[(dx, dy)] += 1\n+ board[(dx, dy)] += 1\n \n- for v in board.values():\n- ans[v] += 1\n+for v in board.values():\n+ ans[v] += 1\n+ans[0] = (h - 2) * (w - 2) - sum(ans)\n \n for i in range(10):\n print(ans[i])\n \n", "FL_content": " from collections import defaultdict\n \n h, w, n = list(map(int, input().split()))\n ans = [0 for i in range(10)]\n \n-if n != 0:\n- board = defaultdict(int)\n- for i in range(n):\n- a, b = list(map(int, input().split()))\n- a = a - 1\n- b = b - 1\n- for dx in range(b-1, b+2):\n- if dx <= 0 or dx >= w - 1:\n continue\n- for dy in range(a-1, a+2):\n- if dy <= 0 or dy >= h - 1:\n- continue\n- board[(dx, dy)] += 1\n \n- for v in board.values():\n- ans[v] += 1\n \n for i in range(10):\n print(ans[i])\n \n", "added_lines": 14, "removed_lines": 14, "code1_lines": 25 }, { "user_id": "u560301743", "problem_id": "p04000", "submission1_id": "s115002494", "submission2_id": "s883653680", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, W, N = [int(v) for v in input().split()]\npoints = (map(int, input().split()) for _ in range(N))\nmemory = {}\n\nfor ai, bi in points:\n for i in range(max(2, ai - 1), min(H - 1, ai + 1) + 1):\n for j in range(max(2, bi - 1), min(W - 1, bi + 1) + 1):\n key = (i, j)\n if not key in memory:\n memory[key] = 0\n memory[key] += 1\n\ncounter = {i: 0 for i in range(1, 9 + 1)}\nfor v in memory.values():\n counter[v] += 1\n\nfor i in range(1, 9 + 1):\n print(counter[i])", "code2": "H, W, N = [int(v) for v in input().split()]\npoints = (map(int, input().split()) for _ in range(N))\nmemory = {}\nfor ai, bi in points:\n for i in range(max(2, ai - 1), min(H - 1, ai + 1) + 1):\n for j in range(max(2, bi - 1), min(W - 1, bi + 1) + 1):\n key = (i, j)\n if not key in memory:\n memory[key] = 0\n memory[key] += 1\n\ncounter = {i: 0 for i in range(1, 10)}\nfor v in memory.values():\n counter[v] += 1\n\nprint((H - 2) * (W - 2) - sum(counter.values()))\nfor i in range(1, 10):\n print(counter[i])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590350007", "date2": "1590350331", "bleu_score": "0.898822056643126", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "10 10 20\n1 2\n1 4\n1 9\n2 5\n3 10\n4 2\n4 7\n5 9\n6 4\n6 6\n6 7\n7 1\n7 3\n7 7\n8 1\n9 5\n8 10\n9 2\n10 0\n10 9\n", "actual_output": "28\n22\n9\n1\n0\n0\n0\n0\n0\n", "expected_output": "4\n28\n22\n9\n1\n0\n0\n0\n0\n0\n\n", "anno_code": ["H, W, N = [int(v) for v in input().split()] # (0): H=10, W=10, N=20\npoints = (map(int, input().split()) for _ in range(N)) # (1): points= at 0x0000027AD0E5BCA0>\nmemory = {} # (2): memory={}\n\nfor ai, bi in points: # (3): ai=1, bi=2 (17): bi=4 ... (609): NO CHANGE\n for i in range(max(2, ai - 1), min(H - 1, ai + 1) + 1): # (4): i=2 (16): NO CHANGE ... (608): NO CHANGE\n for j in range(max(2, bi - 1), min(W - 1, bi + 1) + 1): # (5): j=2 (10): j=3 ... (607): NO CHANGE\n key = (i, j) # (6): key=(2, 2) (11): key=(2, 3) ... (604): key=(9, 9)\n if not key in memory: # (7): NO CHANGE (12): NO CHANGE ... (605): NO CHANGE\n memory[key] = 0 # (8): memory={(2, 2): 0} (13): memory={(2, 2): 1, (2, 3): 0} ... (601): memory={(2, 2): 1, (2, 3): 2, (2, 4): 2, (2, 5): 2, (2, 8): 1, (2, 9): 2, (2, 6): 1, (3, 4): 1, (3, 5): 1, (3, 6): 2, (3, 9): 1, (4, 9): 2, (3, 2): 1, (3, 3): 1, (4, 2): 1, (4, 3): 1, (5, 2): 1, (5, 3): 2, (3, 7): 1, (3, 8): 1, (4, 6): 1, (4, 7): 1, (4, 8): 2, (5, 6): 3, (5, 7): 3, (5, 8): 3, (5, 9): 1, (6, 8): 3, (6, 9): 1, (5, 4): 1, (5, 5): 2, (6, 3): 2, (6, 4): 2, (6, 5): 2, (7, 3): 2, (7, 4): 2, (7, 5): 2, (6, 6): 3, (6, 7): 3, (7, 6): 3, (7, 7): 3, (7, 8): 2, (6, 2): 2, (7, 2): 3, (8, 2): 4, (8, 3): 2, (8, 4): 2, (8, 6): 2, (8, 7): 1, (8, 8): 1, (9, 2): 2, (8, 5): 1, (9, 4): 1, (9, 5): 1, (9, 6): 1, (7, 9): 1, (8, 9): 1, (9, 9): 1, (9, 3): 1, (9, 8): 0}\n memory[key] += 1 # (9): memory={(2, 2): 1} (14): memory={(2, 2): 1, (2, 3): 1} ... (606): memory={(2, 2): 1, (2, 3): 2, (2, 4): 2, (2, 5): 2, (2, 8): 1, (2, 9): 2, (2, 6): 1, (3, 4): 1, (3, 5): 1, (3, 6): 2, (3, 9): 1, (4, 9): 2, (3, 2): 1, (3, 3): 1, (4, 2): 1, (4, 3): 1, (5, 2): 1, (5, 3): 2, (3, 7): 1, (3, 8): 1, (4, 6): 1, (4, 7): 1, (4, 8): 2, (5, 6): 3, (5, 7): 3, (5, 8): 3, (5, 9): 1, (6, 8): 3, (6, 9): 1, (5, 4): 1, (5, 5): 2, (6, 3): 2, (6, 4): 2, (6, 5): 2, (7, 3): 2, (7, 4): 2, (7, 5): 2, (6, 6): 3, (6, 7): 3, (7, 6): 3, (7, 7): 3, (7, 8): 2, (6, 2): 2, (7, 2): 3, (8, 2): 4, (8, 3): 2, (8, 4): 2, (8, 6): 2, (8, 7): 1, (8, 8): 1, (9, 2): 2, (8, 5): 1, (9, 4): 1, (9, 5): 1, (9, 6): 1, (7, 9): 1, (8, 9): 1, (9, 9): 2, (9, 3): 1, (9, 8): 1}\n\ncounter = {i: 0 for i in range(1, 9 + 1)} # (610): counter={1: 0, 2: 0, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0, 8: 0, 9: 0}\nfor v in memory.values(): # (611): v=1 (613): v=2 ... (731): NO CHANGE\n counter[v] += 1 # (612): counter={1: 1, 2: 0, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0, 8: 0, 9: 0} (614): counter={1: 1, 2: 1, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0, 8: 0, 9: 0} ... (730): counter={1: 28, 2: 22, 3: 9, 4: 1, 5: 0, 6: 0, 7: 0, 8: 0, 9: 0}\n\nfor i in range(1, 9 + 1): # (732): i=1 (734): i=2 ... (748): i=9\n print(counter[i]) # (733): NO CHANGE (735): NO CHANGE ... (749): NO CHANGE\n"], "anno_status": [false], "diff_content": " H, W, N = [int(v) for v in input().split()]\n points = (map(int, input().split()) for _ in range(N))\n memory = {}\n-\n for ai, bi in points:\n for i in range(max(2, ai - 1), min(H - 1, ai + 1) + 1):\n for j in range(max(2, bi - 1), min(W - 1, bi + 1) + 1):\n key = (i, j)\n if not key in memory:\n memory[key] = 0\n memory[key] += 1\n \n-counter = {i: 0 for i in range(1, 9 + 1)}\n+counter = {i: 0 for i in range(1, 10)}\n for v in memory.values():\n counter[v] += 1\n \n-for i in range(1, 9 + 1):\n+print((H - 2) * (W - 2) - sum(counter.values()))\n+for i in range(1, 10):\n print(counter[i])\n+\n", "FL_content": " H, W, N = [int(v) for v in input().split()]\n points = (map(int, input().split()) for _ in range(N))\n memory = {}\n-\n for ai, bi in points:\n for i in range(max(2, ai - 1), min(H - 1, ai + 1) + 1):\n for j in range(max(2, bi - 1), min(W - 1, bi + 1) + 1):\n key = (i, j)\n if not key in memory:\n memory[key] = 0\n memory[key] += 1\n \n-counter = {i: 0 for i in range(1, 9 + 1)}\n for v in memory.values():\n counter[v] += 1\n \n-for i in range(1, 9 + 1):\n print(counter[i])\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 18 }, { "user_id": "u091051505", "problem_id": "p04000", "submission1_id": "s508859529", "submission2_id": "s972124129", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter, defaultdict\n\nans = defaultdict(lambda: 0)\nh, w, n = map(int, input().split())\nfor _ in range(n):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n for a_i in range(a - 2, a + 1):\n for b_i in range(b - 2, b + 1):\n if (0 <= a_i < h - 2) & (0 <= b_i < w - 2):\n ans[(a_i, b_i)] += 1\n\nk = Counter(ans.values())\nans_0 = (h - 2) * (w - 2) - sum(k.values())\nfor i in range(10):\n if i in k.keys():\n print(k[i])\n else:\n print(0)", "code2": "from collections import Counter, defaultdict\n\nans = defaultdict(lambda: 0)\nh, w, n = map(int, input().split())\nfor _ in range(n):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n for a_i in range(a - 2, a + 1):\n for b_i in range(b - 2, b + 1):\n if (0 <= a_i < h - 2) & (0 <= b_i < w - 2):\n ans[(a_i, b_i)] += 1\n\nk = Counter(ans.values())\nprint((h - 2) * (w - 2) - sum(k.values()))\nfor i in range(1, 10):\n if i in k.keys():\n print(k[i])\n else:\n print(0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567562214", "date2": "1567562289", "bleu_score": "0.9767828132613441", "code1_test_status": [0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 10, "total_score": 103, "input": "10 10 20\n1 1\n1 4\n1 9\n2 5\n3 10\n4 2\n2 7\n5 9\n6 4\n6 6\n6 7\n7 2\n7 3\n7 7\n8 1\n8 5\n8 10\n9 2\n10 4\n10 9\n", "actual_output": "0\n24\n23\n10\n2\n0\n0\n0\n0\n0\n", "expected_output": "5\n24\n23\n10\n2\n0\n0\n0\n0\n0\n\n", "anno_code": ["from collections import Counter, defaultdict\n\nans = defaultdict(lambda: 0) # (0): ans=defaultdict( at 0x0000021C73EA9BD0>, {})\nh, w, n = map(int, input().split()) # (1): h=10, w=10, n=20\nfor _ in range(n): # (2): _=0 (32): _=1 ... (690): NO CHANGE\n a, b = map(int, input().split()) # (3): a=1, b=1 (33): a=1, b=4 ... (660): a=10, b=9\n a -= 1 # (4): a=0 (34): a=0 ... (661): a=9\n b -= 1 # (5): b=0 (35): b=3 ... (662): b=8\n for a_i in range(a - 2, a + 1): # (6): a_i=-2 (14): a_i=-1 ... (689): NO CHANGE\n for b_i in range(b - 2, b + 1): # (7): b_i=-2 (9): b_i=-1 ... (688): NO CHANGE\n if (0 <= a_i < h - 2) & (0 <= b_i < w - 2): # (8): NO CHANGE (10): NO CHANGE ... (687): NO CHANGE\n ans[(a_i, b_i)] += 1 # (29): ans=defaultdict( at 0x0000021C73EA9BD0>, {(0, 0): 1}) (55): ans=defaultdict( at 0x0000021C73EA9BD0>, {(0, 0): 1, (0, 1): 1}) ... (669): ans=defaultdict( at 0x0000021C73EA9BD0>, {(0, 0): 1, (0, 1): 1, (0, 2): 2, (0, 3): 2, (0, 6): 2, (0, 7): 2, (0, 4): 2, (1, 2): 1, (1, 3): 1, (1, 4): 2, (1, 7): 1, (2, 7): 2, (1, 0): 1, (1, 1): 1, (2, 0): 1, (2, 1): 1, (3, 0): 1, (3, 1): 2, (0, 5): 1, (1, 5): 1, (1, 6): 1, (2, 6): 1, (3, 6): 2, (3, 7): 1, (4, 6): 3, (4, 7): 1, (3, 2): 1, (3, 3): 2, (4, 1): 3, (4, 2): 2, (4, 3): 2, (5, 1): 3, (5, 2): 3, (5, 3): 3, (3, 4): 2, (3, 5): 2, (4, 4): 3, (4, 5): 3, (5, 4): 4, (5, 5): 3, (5, 6): 2, (4, 0): 2, (5, 0): 3, (6, 0): 4, (6, 1): 3, (6, 2): 2, (6, 4): 2, (6, 5): 1, (6, 6): 1, (7, 0): 2, (6, 3): 1, (7, 2): 2, (7, 3): 2, (7, 4): 1, (5, 7): 1, (6, 7): 1, (7, 7): 2, (7, 1): 2, (7, 6): 1})\n\nk = Counter(ans.values()) # (691): k=Counter({1: 24, 2: 23, 3: 10, 4: 2})\nans_0 = (h - 2) * (w - 2) - sum(k.values()) # (692): ans_0=5\nfor i in range(10): # (693): i=0 (696): i=1 ... (720): i=9\n if i in k.keys(): # (694): NO CHANGE (697): NO CHANGE ... (721): NO CHANGE\n print(k[i]) # (698): NO CHANGE (701): NO CHANGE ... (707): NO CHANGE\n else:\n print(0) # (695): NO CHANGE (710): NO CHANGE ... (722): NO CHANGE\n"], "anno_status": [false], "diff_content": " from collections import Counter, defaultdict\n \n ans = defaultdict(lambda: 0)\n h, w, n = map(int, input().split())\n for _ in range(n):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n for a_i in range(a - 2, a + 1):\n for b_i in range(b - 2, b + 1):\n if (0 <= a_i < h - 2) & (0 <= b_i < w - 2):\n ans[(a_i, b_i)] += 1\n \n k = Counter(ans.values())\n-ans_0 = (h - 2) * (w - 2) - sum(k.values())\n-for i in range(10):\n+print((h - 2) * (w - 2) - sum(k.values()))\n+for i in range(1, 10):\n if i in k.keys():\n print(k[i])\n else:\n print(0)\n", "FL_content": " from collections import Counter, defaultdict\n \n ans = defaultdict(lambda: 0)\n h, w, n = map(int, input().split())\n for _ in range(n):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n for a_i in range(a - 2, a + 1):\n for b_i in range(b - 2, b + 1):\n if (0 <= a_i < h - 2) & (0 <= b_i < w - 2):\n ans[(a_i, b_i)] += 1\n \n k = Counter(ans.values())\n-ans_0 = (h - 2) * (w - 2) - sum(k.values())\n-for i in range(10):\n if i in k.keys():\n print(k[i])\n else:\n print(0)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 20 }, { "user_id": "u091051505", "problem_id": "p04000", "submission1_id": "s736188501", "submission2_id": "s972124129", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter, defaultdict\n\nans = defaultdict(lambda: 0)\nh, w, n = map(int, input().split())\nfor _ in range(n):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n for a_i in range(a - 2, a + 1):\n for b_i in range(b - 2, b + 1):\n if (0 <= a_i < h - 2) & (0 <= b_i < w - 2):\n ans[(a_i, b_i)] += 1\n\nk = Counter(ans.values())\nfor i in range(10):\n if i in k.keys():\n print(k[i])\n else:\n print(0)", "code2": "from collections import Counter, defaultdict\n\nans = defaultdict(lambda: 0)\nh, w, n = map(int, input().split())\nfor _ in range(n):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n for a_i in range(a - 2, a + 1):\n for b_i in range(b - 2, b + 1):\n if (0 <= a_i < h - 2) & (0 <= b_i < w - 2):\n ans[(a_i, b_i)] += 1\n\nk = Counter(ans.values())\nprint((h - 2) * (w - 2) - sum(k.values()))\nfor i in range(1, 10):\n if i in k.keys():\n print(k[i])\n else:\n print(0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567562050", "date2": "1567562289", "bleu_score": "0.9096563845467414", "code1_test_status": [0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 10, "total_score": 103, "input": "10 10 20\n0 1\n1 4\n1 9\n2 4\n0 6\n4 1\n1 7\n5 9\n6 4\n6 6\n6 5\n2 1\n10 3\n7 8\n16 1\n8 5\n11 10\n9 5\n17 4\n4 4\n", "actual_output": "0\n23\n21\n5\n2\n0\n0\n0\n0\n0\n", "expected_output": "13\n23\n21\n5\n2\n0\n0\n0\n0\n0\n\n", "anno_code": ["from collections import Counter, defaultdict\n\nans = defaultdict(lambda: 0) # (0): ans=defaultdict( at 0x000001CBFB185BD0>, {})\nh, w, n = map(int, input().split()) # (1): h=10, w=10, n=20\nfor _ in range(n): # (2): _=0 (31): _=1 ... (670): NO CHANGE\n a, b = map(int, input().split()) # (3): a=0, b=1 (32): a=1, b=4 ... (633): a=4, b=4\n a -= 1 # (4): a=-1 (33): a=0 ... (634): a=3\n b -= 1 # (5): b=0 (34): b=3 ... (635): b=3\n for a_i in range(a - 2, a + 1): # (6): a_i=-3 (14): a_i=-2 ... (669): NO CHANGE\n for b_i in range(b - 2, b + 1): # (7): b_i=-2 (9): b_i=-1 ... (668): NO CHANGE\n if (0 <= a_i < h - 2) & (0 <= b_i < w - 2): # (8): NO CHANGE (10): NO CHANGE ... (666): NO CHANGE\n ans[(a_i, b_i)] += 1 # (54): ans=defaultdict( at 0x000001CBFB185BD0>, {(0, 1): 1}) (57): ans=defaultdict( at 0x000001CBFB185BD0>, {(0, 1): 1, (0, 2): 1}) ... (667): ans=defaultdict( at 0x000001CBFB185BD0>, {(0, 1): 2, (0, 2): 2, (0, 3): 2, (0, 6): 2, (0, 7): 1, (1, 1): 2, (1, 2): 2, (1, 3): 2, (1, 0): 2, (2, 0): 1, (3, 0): 1, (0, 4): 1, (0, 5): 1, (2, 6): 1, (2, 7): 1, (3, 6): 1, (3, 7): 1, (4, 6): 2, (4, 7): 2, (3, 1): 2, (3, 2): 3, (3, 3): 4, (4, 1): 1, (4, 2): 2, (4, 3): 3, (5, 1): 1, (5, 2): 3, (5, 3): 4, (3, 4): 2, (3, 5): 1, (4, 4): 2, (4, 5): 2, (5, 4): 3, (5, 5): 2, (0, 0): 1, (7, 0): 1, (7, 1): 1, (7, 2): 3, (5, 6): 1, (5, 7): 1, (6, 5): 1, (6, 6): 1, (6, 7): 1, (6, 2): 2, (6, 3): 2, (6, 4): 2, (7, 3): 2, (7, 4): 2, (2, 1): 1, (2, 2): 1, (2, 3): 1})\n\nk = Counter(ans.values()) # (671): k=Counter({1: 23, 2: 21, 3: 5, 4: 2})\nfor i in range(10): # (672): i=0 (675): i=1 ... (699): i=9\n if i in k.keys(): # (673): NO CHANGE (676): NO CHANGE ... (700): NO CHANGE\n print(k[i]) # (677): NO CHANGE (680): NO CHANGE ... (686): NO CHANGE\n else:\n print(0) # (674): NO CHANGE (689): NO CHANGE ... (701): NO CHANGE\n"], "anno_status": [false], "diff_content": " from collections import Counter, defaultdict\n \n ans = defaultdict(lambda: 0)\n h, w, n = map(int, input().split())\n for _ in range(n):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n for a_i in range(a - 2, a + 1):\n for b_i in range(b - 2, b + 1):\n if (0 <= a_i < h - 2) & (0 <= b_i < w - 2):\n ans[(a_i, b_i)] += 1\n \n k = Counter(ans.values())\n-for i in range(10):\n+print((h - 2) * (w - 2) - sum(k.values()))\n+for i in range(1, 10):\n if i in k.keys():\n print(k[i])\n else:\n print(0)\n", "FL_content": " from collections import Counter, defaultdict\n \n ans = defaultdict(lambda: 0)\n h, w, n = map(int, input().split())\n for _ in range(n):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n for a_i in range(a - 2, a + 1):\n for b_i in range(b - 2, b + 1):\n if (0 <= a_i < h - 2) & (0 <= b_i < w - 2):\n ans[(a_i, b_i)] += 1\n \n k = Counter(ans.values())\n-for i in range(10):\n if i in k.keys():\n print(k[i])\n else:\n print(0)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 19 }, { "user_id": "u073852194", "problem_id": "p04000", "submission1_id": "s652555474", "submission2_id": "s904933082", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\n\nH,W,N = map(int,input().split())\nD = defaultdict(bool)\nB = []\n\nfor _ in range(N):\n a,b = map(lambda x: int(x)-1,input().split())\n D[(a,b)] = True\n B.append((a,b))\n\nans = [0 for _ in range(10)]\n\nfor a,b in B:\n for i in range(9):\n ix,iy = divmod(i,3)\n if a-ix<0 or b-iy<0:\n continue\n black_count = 0\n for j in range(9):\n jx,jy = divmod(j,3)\n if H<=a-ix+jx or W<=b-iy+jy:\n break\n if D[(a-ix+jx,b-iy+jy)]:\n if -ix+jx<0 or (-ix+jx==0 and -iy+jy<0):\n print(a,b,ix,iy,jx,jy,-ix+jx,-iy+jy)\n break\n black_count += 1\n else:\n ans[black_count] += 1\n\nans[0] = (H-2)*(W-2)-sum(ans)\nprint(*ans,sep='\\n')", "code2": "from collections import defaultdict\nimport sys\ninput = sys.stdin.readline\n\nH,W,N = map(int,input().split())\nD = defaultdict(bool)\nB = []\n\nfor _ in range(N):\n a,b = map(lambda x: int(x)-1,input().split())\n D[(a,b)] = True\n B.append((a,b))\n\nans = [0 for _ in range(10)]\n\nfor a,b in B:\n for i in range(9):\n ix,iy = divmod(i,3)\n if a-ix<0 or b-iy<0:\n continue\n black_count = 0\n for j in range(9):\n jx,jy = divmod(j,3)\n if H<=a-ix+jx or W<=b-iy+jy:\n break\n if (a-ix+jx,b-iy+jy) in D:\n if -iy+jy<0 or (-iy+jy==0 and -ix+jx<0):\n break\n black_count += 1\n else:\n ans[black_count] += 1\n\nans[0] = (H-2)*(W-2)-sum(ans)\nprint(*ans,sep='\\n')", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1579059095", "date2": "1579060945", "bleu_score": "0.9245423766643245", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 14, "total_score": 103, "input": "10 10 20\n0 1\n1 4\n1 9\n2 5\n3 6\n4 1\n1 7\n5 9\n6 4\n6 6\n6 7\n2 2\n7 3\n7 8\n16 1\n8 5\n8 10\n9 4\n17 4\n4 9\n", "actual_output": "0 8 0 2 0 0 0 -2\n1 4 1 0 0 2 -1 2\n1 4 1 1 0 0 -1 -1\n1 4 1 2 0 1 -1 -1\n2 5 1 1 0 0 -1 -1\n2 5 1 2 0 1 -1 -1\n2 5 2 0 0 1 -2 1\n2 5 2 1 0 2 -2 1\n2 5 2 2 0 0 -2 -2\n3 0 2 0 0 1 -2 1\n4 8 1 0 0 0 -1 0\n4 8 1 1 0 1 -1 0\n4 8 1 2 0 2 -1 0\n4 8 2 1 1 1 -1 0\n4 8 2 2 1 2 -1 0\n5 5 0 2 0 0 0 -2\n5 5 1 2 1 0 0 -2\n5 5 2 2 2 0 0 -2\n5 6 0 1 0 0 0 -1\n5 6 0 2 0 1 0 -1\n5 6 1 0 0 2 -1 2\n5 6 1 1 1 0 0 -1\n5 6 1 2 1 1 0 -1\n5 6 2 0 0 2 -2 2\n5 6 2 1 2 0 0 -1\n5 6 2 2 2 1 0 -1\n1 1 1 0 0 2 -1 2\n6 2 1 0 0 1 -1 1\n6 2 1 1 0 2 -1 1\n6 2 2 0 1 1 -1 1\n6 2 2 1 1 2 -1 1\n6 7 1 1 0 0 -1 -1\n6 7 1 2 0 0 -1 -2\n6 7 2 0 0 1 -2 1\n6 7 2 1 0 2 -2 1\n6 7 2 2 1 0 -1 -2\n7 4 1 2 0 0 -1 -2\n7 4 2 0 0 1 -2 1\n7 4 2 1 0 0 -2 -1\n7 4 2 2 0 1 -2 -1\n7 9 1 2 0 0 -1 -2\n7 9 2 2 1 0 -1 -2\n8 3 1 0 0 1 -1 1\n8 3 1 1 0 2 -1 1\n8 3 2 0 1 1 -1 1\n8 3 2 1 0 0 -2 -1\n8 3 2 2 0 1 -2 -1\n5\n23\n26\n10\n0\n0\n0\n0\n0\n0\n", "expected_output": "5\n23\n26\n10\n0\n0\n0\n0\n0\n0\n\n", "anno_code": ["from collections import defaultdict\n\nH,W,N = map(int,input().split()) # (0): H=10, W=10, N=20\nD = defaultdict(bool) # (1): D=defaultdict(, {})\nB = [] # (2): B=[]\n\nfor _ in range(N): # (3): _=0 (7): _=1 ... (83): NO CHANGE\n a,b = map(lambda x: int(x)-1,input().split()) # (4): a=-1, b=0 (8): a=0, b=3 ... (80): a=3, b=8\n D[(a,b)] = True # (5): D=defaultdict(, {(-1, 0): True}) (9): D=defaultdict(, {(-1, 0): True, (0, 3): True}) ... (81): D=defaultdict(, {(-1, 0): True, (0, 3): True, (0, 8): True, (1, 4): True, (2, 5): True, (3, 0): True, (0, 6): True, (4, 8): True, (5, 3): True, (5, 5): True, (5, 6): True, (1, 1): True, (6, 2): True, (6, 7): True, (15, 0): True, (7, 4): True, (7, 9): True, (8, 3): True, (16, 3): True, (3, 8): True})\n B.append((a,b)) # (6): B=[(-1, 0)] (10): B=[(-1, 0), (0, 3)] ... (82): B=[(-1, 0), (0, 3), (0, 8), (1, 4), (2, 5), (3, 0), (0, 6), (4, 8), (5, 3), (5, 5), (5, 6), (1, 1), (6, 2), (6, 7), (15, 0), (7, 4), (7, 9), (8, 3), (16, 3), (3, 8)]\n\nans = [0 for _ in range(10)] # (84): ans=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\nfor a,b in B: # (85): a=-1, b=0 (123): a=0, b=3 ... (4254): NO CHANGE\n for i in range(9): # (86): i=0 (90): i=1 ... (4253): NO CHANGE\n ix,iy = divmod(i,3) # (87): ix=0, iy=0 (91): iy=1 ... (4210): iy=2\n if a-ix<0 or b-iy<0: # (88): NO CHANGE (92): NO CHANGE ... (4211): NO CHANGE\n continue # (89): NO CHANGE (93): NO CHANGE ... (3169): NO CHANGE\n black_count = 0 # (127): black_count=0 (175): black_count=0 ... (4212): black_count=0\n for j in range(9): # (128): j=0 (134): j=1 ... (4251): NO CHANGE\n jx,jy = divmod(j,3) # (129): jx=0, jy=0 (135): jy=1 ... (4246): jy=2\n if H<=a-ix+jx or W<=b-iy+jy: # (130): NO CHANGE (136): NO CHANGE ... (4247): NO CHANGE\n break # (307): NO CHANGE (1145): NO CHANGE ... (4164): NO CHANGE\n if D[(a-ix+jx,b-iy+jy)]: # (131): NO CHANGE (137): D=defaultdict(, {(-1, 0): True, (0, 3): True, (0, 8): True, (1, 4): True, (2, 5): True, (3, 0): True, (0, 6): True, (4, 8): True, (5, 3): True, (5, 5): True, (5, 6): True, (1, 1): True, (6, 2): True, (6, 7): True, (15, 0): True, (7, 4): True, (7, 9): True, (8, 3): True, (16, 3): True, (3, 8): True, (0, 4): False}) ... (4248): NO CHANGE\n if -ix+jx<0 or (-ix+jx==0 and -iy+jy<0): # (132): NO CHANGE (150): NO CHANGE ... (4249): NO CHANGE\n print(a,b,ix,iy,jx,jy,-ix+jx,-iy+jy) # (361): NO CHANGE (542): NO CHANGE ... (3851): NO CHANGE\n break # (362): NO CHANGE (543): NO CHANGE ... (3852): NO CHANGE\n black_count += 1 # (133): black_count=1 (151): black_count=2 ... (4250): black_count=1\n else:\n ans[black_count] += 1 # (171): ans=[0, 0, 0, 1, 0, 0, 0, 0, 0, 0] (217): ans=[0, 0, 1, 1, 0, 0, 0, 0, 0, 0] ... (4252): ans=[0, 23, 26, 10, 0, 0, 0, 0, 0, 0]\n\nans[0] = (H-2)*(W-2)-sum(ans) # (4255): ans=[5, 23, 26, 10, 0, 0, 0, 0, 0, 0]\nprint(*ans,sep='\\n')"], "anno_status": [false], "diff_content": " from collections import defaultdict\n+import sys\n+input = sys.stdin.readline\n \n H,W,N = map(int,input().split())\n D = defaultdict(bool)\n B = []\n \n for _ in range(N):\n a,b = map(lambda x: int(x)-1,input().split())\n D[(a,b)] = True\n B.append((a,b))\n \n ans = [0 for _ in range(10)]\n \n for a,b in B:\n for i in range(9):\n ix,iy = divmod(i,3)\n if a-ix<0 or b-iy<0:\n continue\n black_count = 0\n for j in range(9):\n jx,jy = divmod(j,3)\n if H<=a-ix+jx or W<=b-iy+jy:\n break\n- if D[(a-ix+jx,b-iy+jy)]:\n- if -ix+jx<0 or (-ix+jx==0 and -iy+jy<0):\n- print(a,b,ix,iy,jx,jy,-ix+jx,-iy+jy)\n+ if (a-ix+jx,b-iy+jy) in D:\n+ if -iy+jy<0 or (-iy+jy==0 and -ix+jx<0):\n break\n black_count += 1\n else:\n ans[black_count] += 1\n \n ans[0] = (H-2)*(W-2)-sum(ans)\n print(*ans,sep='\\n')\n", "FL_content": " from collections import defaultdict\n \n H,W,N = map(int,input().split())\n D = defaultdict(bool)\n B = []\n \n for _ in range(N):\n a,b = map(lambda x: int(x)-1,input().split())\n D[(a,b)] = True\n B.append((a,b))\n \n ans = [0 for _ in range(10)]\n \n for a,b in B:\n for i in range(9):\n ix,iy = divmod(i,3)\n if a-ix<0 or b-iy<0:\n continue\n black_count = 0\n for j in range(9):\n jx,jy = divmod(j,3)\n if H<=a-ix+jx or W<=b-iy+jy:\n break\n- if D[(a-ix+jx,b-iy+jy)]:\n- if -ix+jx<0 or (-ix+jx==0 and -iy+jy<0):\n- print(a,b,ix,iy,jx,jy,-ix+jx,-iy+jy)\n break\n black_count += 1\n else:\n ans[black_count] += 1\n \n ans[0] = (H-2)*(W-2)-sum(ans)\n print(*ans,sep='\\n')\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 33 }, { "user_id": "u419686324", "problem_id": "p04000", "submission1_id": "s898699391", "submission2_id": "s439030455", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h, w, n = map(int, input().split())\nab = [list(map(int, input().split())) for _ in range(n)]\n\nsa = {}\nfor a,b in ab:\n for i in range(3):\n aa = a + i\n if aa < 3 or h < aa:\n continue\n for j in range(3):\n bb = b + j\n if bb < 3 or w < bb:\n continue\n id = \"%d,%d\" % (aa, bb)\n sa[id] = sa.get(id, 0) + 1\n\ns = {}\nfor x in sa.values():\n s[x] = s.setdefault(x, 0) + 1\nprint((w - 2) * (h - 2) - len(sa.keys()))\nfor i in range(10):\n print(s.get(i, 0))", "code2": "h, w, n = map(int, input().split())\nab = [list(map(int, input().split())) for _ in range(n)]\n\nsa = {}\nfor a,b in ab:\n for i in range(3):\n aa = a + i\n if aa < 3 or h < aa:\n continue\n for j in range(3):\n bb = b + j\n if bb < 3 or w < bb:\n continue\n id = \"%d,%d\" % (aa, bb)\n sa[id] = sa.get(id, 0) + 1\n\ns = {}\nfor x in sa.values():\n s[x] = s.setdefault(x, 0) + 1\nprint((w - 2) * (h - 2) - len(sa.keys()))\nfor i in range(1, 10):\n print(s.get(i, 0))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531797498", "date2": "1531798053", "bleu_score": "0.9930705729924024", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "10 10 20\n1 1\n1 4\n1 9\n2 5\n3 10\n4 2\n4 7\n5 9\n6 4\n6 6\n6 7\n7 2\n7 3\n7 7\n8 1\n8 5\n8 10\n9 2\n10 4\n10 9\n", "actual_output": "4\n0\n26\n19\n13\n2\n0\n0\n0\n0\n0\n", "expected_output": "4\n26\n19\n13\n2\n0\n0\n0\n0\n0\n\n", "anno_code": ["h, w, n = map(int, input().split()) # (0): h=10, w=10, n=20\nab = [list(map(int, input().split())) for _ in range(n)] # (1): ab\n\nsa = {} # (2): sa={}\nfor a,b in ab: # (3): a=1, b=1 (30): b=4 ... (970): NO CHANGE\n for i in range(3): # (4): i=0 (8): i=1 ... (969): NO CHANGE\n aa = a + i # (5): aa=1 (9): aa=2 ... (966): aa=12\n if aa < 3 or h < aa: # (6): NO CHANGE (10): NO CHANGE ... (967): NO CHANGE\n continue # (7): NO CHANGE (11): NO CHANGE ... (968): NO CHANGE\n for j in range(3): # (15): j=0 (19): j=1 ... (960): NO CHANGE\n bb = b + j # (16): bb=1 (20): bb=2 ... (957): bb=11\n if bb < 3 or w < bb: # (17): NO CHANGE (21): NO CHANGE ... (958): NO CHANGE\n continue # (18): NO CHANGE (22): NO CHANGE ... (959): NO CHANGE\n id = \"%d,%d\" % (aa, bb) # (26): id=3,3 (45): id=3,4 ... (954): id=10,10\n sa[id] = sa.get(id, 0) + 1 # (27): sa={'3,3': 1} (46): sa={'3,3': 1, '3,4': 1} ... (955): sa={'3,3': 1, '3,4': 1, '3,5': 2, '3,6': 2, '3,9': 1, '3,10': 2, '3,7': 1, '4,5': 1, '4,6': 1, '4,7': 2, '4,10': 1, '5,10': 2, '4,3': 1, '4,4': 1, '5,3': 1, '5,4': 1, '6,3': 1, '6,4': 2, '4,8': 1, '4,9': 1, '5,7': 1, '5,8': 1, '5,9': 2, '6,7': 3, '6,8': 3, '6,9': 3, '6,10': 1, '7,9': 3, '7,10': 1, '6,5': 1, '6,6': 2, '7,4': 3, '7,5': 2, '7,6': 2, '8,4': 3, '8,5': 3, '8,6': 3, '7,7': 3, '7,8': 3, '8,7': 4, '8,8': 3, '8,9': 2, '7,3': 2, '8,3': 3, '9,3': 4, '9,4': 3, '9,5': 2, '9,7': 2, '9,8': 1, '9,9': 1, '10,3': 2, '9,6': 1, '10,5': 2, '10,6': 2, '10,7': 1, '8,10': 1, '9,10': 1, '10,10': 2, '10,4': 2, '10,9': 1}\n\ns = {} # (971): s={}\nfor x in sa.values(): # (972): x=1 (974): NO CHANGE ... (1092): NO CHANGE\n s[x] = s.setdefault(x, 0) + 1 # (973): s={1: 1} (975): s={1: 2} ... (1091): s={1: 26, 2: 19, 3: 13, 4: 2}\nprint((w - 2) * (h - 2) - len(sa.keys())) # (1093): NO CHANGE\nfor i in range(10): # (1094): i=0 (1096): i=1 ... (1112): i=9\n print(s.get(i, 0)) # (1095): NO CHANGE (1097): NO CHANGE ... (1113): NO CHANGE\n"], "anno_status": [false], "diff_content": " h, w, n = map(int, input().split())\n ab = [list(map(int, input().split())) for _ in range(n)]\n \n sa = {}\n for a,b in ab:\n for i in range(3):\n aa = a + i\n if aa < 3 or h < aa:\n continue\n for j in range(3):\n bb = b + j\n if bb < 3 or w < bb:\n continue\n id = \"%d,%d\" % (aa, bb)\n sa[id] = sa.get(id, 0) + 1\n \n s = {}\n for x in sa.values():\n s[x] = s.setdefault(x, 0) + 1\n print((w - 2) * (h - 2) - len(sa.keys()))\n-for i in range(10):\n+for i in range(1, 10):\n print(s.get(i, 0))\n", "FL_content": " h, w, n = map(int, input().split())\n ab = [list(map(int, input().split())) for _ in range(n)]\n \n sa = {}\n for a,b in ab:\n for i in range(3):\n aa = a + i\n if aa < 3 or h < aa:\n continue\n for j in range(3):\n bb = b + j\n if bb < 3 or w < bb:\n continue\n id = \"%d,%d\" % (aa, bb)\n sa[id] = sa.get(id, 0) + 1\n \n s = {}\n for x in sa.values():\n s[x] = s.setdefault(x, 0) + 1\n print((w - 2) * (h - 2) - len(sa.keys()))\n-for i in range(10):\n print(s.get(i, 0))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 22 }, { "user_id": "u340781749", "problem_id": "p04000", "submission1_id": "s386177295", "submission2_id": "s558836662", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter, defaultdict\n\nh, w, n = map(int, input().split())\ndd = defaultdict(int)\n\nfor a, b in (map(int, input().split()) for _ in range(n)):\n for y in range(max(0, a - 3), min(a, h - 2)):\n for x in range(max(0, b - 3), min(b, w - 2)):\n dd[(y, x)] += 1\n\nc = Counter(dd.values())\nfor i in range(10):\n print(c[i] if i in c else 0)\n", "code2": "from collections import Counter, defaultdict\n\nh, w, n = map(int, input().split())\nhs, ws = h - 2, w - 2\ndd = defaultdict(int)\n\nfor a, b in (map(int, input().split()) for _ in range(n)):\n for y in range(max(0, a - 3), min(a, hs)):\n for x in range(max(0, b - 3), min(b, ws)):\n dd[(y, x)] += 1\n\nprint(hs * ws - len(dd))\n\nc = Counter(dd.values())\nfor i in range(1, 10):\n print(c[i] if i in c else 0)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1476598840", "date2": "1476599220", "bleu_score": "0.8804238132809915", "code1_test_status": [0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 10, "total_score": 103, "input": "1000000000 1001001010 0\n", "actual_output": "0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n", "expected_output": "1001001005997997984\n0\n0\n0\n0\n0\n0\n0\n0\n0\n\n", "anno_code": ["from collections import Counter, defaultdict\n\nh, w, n = map(int, input().split()) # (0): h=1000000000, w=1001001010, n=0\ndd = defaultdict(int) # (1): dd=defaultdict(, {})\n\nfor a, b in (map(int, input().split()) for _ in range(n)): # (2): NO CHANGE\n for y in range(max(0, a - 3), min(a, h - 2)):\n for x in range(max(0, b - 3), min(b, w - 2)):\n dd[(y, x)] += 1\n\nc = Counter(dd.values()) # (3): c=Counter()\nfor i in range(10): # (4): i=0 (6): i=1 ... (22): i=9\n print(c[i] if i in c else 0) # (5): NO CHANGE (7): NO CHANGE ... (23): NO CHANGE\n"], "anno_status": [true], "diff_content": " from collections import Counter, defaultdict\n \n h, w, n = map(int, input().split())\n+hs, ws = h - 2, w - 2\n dd = defaultdict(int)\n \n for a, b in (map(int, input().split()) for _ in range(n)):\n- for y in range(max(0, a - 3), min(a, h - 2)):\n- for x in range(max(0, b - 3), min(b, w - 2)):\n+ for y in range(max(0, a - 3), min(a, hs)):\n+ for x in range(max(0, b - 3), min(b, ws)):\n dd[(y, x)] += 1\n \n+print(hs * ws - len(dd))\n+\n c = Counter(dd.values())\n-for i in range(10):\n+for i in range(1, 10):\n print(c[i] if i in c else 0)\n \n", "FL_content": " from collections import Counter, defaultdict\n \n h, w, n = map(int, input().split())\n dd = defaultdict(int)\n \n for a, b in (map(int, input().split()) for _ in range(n)):\n- for y in range(max(0, a - 3), min(a, h - 2)):\n- for x in range(max(0, b - 3), min(b, w - 2)):\n dd[(y, x)] += 1\n \n c = Counter(dd.values())\n-for i in range(10):\n print(c[i] if i in c else 0)\n \n", "added_lines": 6, "removed_lines": 3, "code1_lines": 14 }, { "user_id": "u780962115", "problem_id": "p04000", "submission1_id": "s753303242", "submission2_id": "s796166305", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nh,w,n=map(int,input().split())\ndic={}\nfor _ in range(n):\n a,b=map(int,input().split())\n for i in range(a-1,a+2):\n for j in range(b-1,b+2):\n if (i,j) in dic.keys():\n dic[(i,j)]+=1\n else:\n dic[(i,j)]=1\n \nhowmany=[0 for i in range(10)]\nfor some in dic.keys():\n a,b=some[0],some[1]\n if 2<=a<=h-1 and 2<=b<=w-1:\n howmany[dic[some]]+=1\nfor i in range(10):\n print(howmany[i])", "code2": "\nh,w,n=map(int,input().split())\ndic={}\nfor _ in range(n):\n a,b=map(int,input().split())\n for i in range(a-1,a+2):\n for j in range(b-1,b+2):\n if (i,j) in dic.keys():\n dic[(i,j)]+=1\n else:\n dic[(i,j)]=1\n \nhowmany=[0 for i in range(10)]\nfor some in dic.keys():\n a,b=some[0],some[1]\n if 2<=a<=h-1 and 2<=b<=w-1:\n howmany[dic[some]]+=1\nJ=(h-2)*(w-2)-sum(howmany)\nprint(J)\nfor i in range(1,10):\n print(howmany[i])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583040606", "date2": "1583040926", "bleu_score": "0.919228313446399", "code1_test_status": [0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 10, "total_score": 103, "input": "10 10 20\n0 1\n1 4\n1 9\n2 5\n3 6\n4 2\n1 7\n5 9\n6 4\n6 6\n6 7\n2 2\n7 3\n7 8\n16 1\n8 5\n8 10\n9 4\n10 4\n4 9\n", "actual_output": "0\n21\n27\n12\n0\n0\n0\n0\n0\n0\n", "expected_output": "4\n21\n27\n12\n0\n0\n0\n0\n0\n0\n\n", "anno_code": ["\nh,w,n=map(int,input().split()) # (0): h=10, w=10, n=20\ndic={} # (1): dic={}\nfor _ in range(n): # (2): _=0 (38): _=1 ... (722): NO CHANGE\n a,b=map(int,input().split()) # (3): a=0, b=1 (39): a=1, b=4 ... (687): a=4, b=9\n for i in range(a-1,a+2): # (4): i=-1 (15): i=0 ... (721): NO CHANGE\n for j in range(b-1,b+2): # (5): j=0 (8): j=1 ... (720): NO CHANGE\n if (i,j) in dic.keys(): # (6): NO CHANGE (9): NO CHANGE ... (718): NO CHANGE\n dic[(i,j)]+=1 # (115): dic={(-1, 0): 1, (-1, 1): 1, (-1, 2): 1, (0, 0): 1, (0, 1): 1, (0, 2): 1, (1, 0): 1, (1, 1): 1, (1, 2): 1, (0, 3): 1, (0, 4): 1, (0, 5): 1, (1, 3): 1, (1, 4): 2, (1, 5): 1, (2, 3): 1, (2, 4): 1, (2, 5): 1, (0, 8): 1, (0, 9): 1, (0, 10): 1, (1, 8): 1, (1, 9): 1, (1, 10): 1, (2, 8): 1, (2, 9): 1, (2, 10): 1} (118): dic={(-1, 0): 1, (-1, 1): 1, (-1, 2): 1, (0, 0): 1, (0, 1): 1, (0, 2): 1, (1, 0): 1, (1, 1): 1, (1, 2): 1, (0, 3): 1, (0, 4): 1, (0, 5): 1, (1, 3): 1, (1, 4): 2, (1, 5): 2, (2, 3): 1, (2, 4): 1, (2, 5): 1, (0, 8): 1, (0, 9): 1, (0, 10): 1, (1, 8): 1, (1, 9): 1, (1, 10): 1, (2, 8): 1, (2, 9): 1, (2, 10): 1} ... (719): dic={(-1, 0): 1, (-1, 1): 1, (-1, 2): 1, (0, 0): 1, (0, 1): 1, (0, 2): 1, (1, 0): 1, (1, 1): 2, (1, 2): 2, (0, 3): 1, (0, 4): 1, (0, 5): 1, (1, 3): 2, (1, 4): 2, (1, 5): 2, (2, 3): 2, (2, 4): 2, (2, 5): 3, (0, 8): 2, (0, 9): 1, (0, 10): 1, (1, 8): 2, (1, 9): 1, (1, 10): 1, (2, 8): 2, (2, 9): 1, (2, 10): 1, (1, 6): 2, (2, 6): 3, (3, 4): 1, (3, 5): 2, (3, 6): 2, (2, 7): 2, (3, 7): 1, (4, 5): 1, (4, 6): 1, (4, 7): 1, (3, 1): 2, (3, 2): 2, (3, 3): 2, (4, 1): 1, (4, 2): 1, (4, 3): 1, (5, 1): 1, (5, 2): 1, (5, 3): 2, (0, 6): 1, (0, 7): 1, (1, 7): 1, (4, 8): 2, (4, 9): 2, (4, 10): 2, (5, 8): 3, (5, 9): 2, (5, 10): 2, (6, 8): 3, (6, 9): 2, (6, 10): 1, (5, 4): 1, (5, 5): 2, (6, 3): 2, (6, 4): 2, (6, 5): 2, (7, 3): 2, (7, 4): 3, (7, 5): 3, (5, 6): 2, (5, 7): 2, (6, 6): 2, (6, 7): 3, (7, 6): 3, (7, 7): 3, (7, 8): 2, (2, 1): 1, (2, 2): 1, (6, 2): 1, (7, 2): 1, (8, 2): 1, (8, 3): 2, (8, 4): 3, (7, 9): 2, (8, 7): 1, (8, 8): 1, (8, 9): 2, (15, 0): 1, (15, 1): 1, (15, 2): 1, (16, 0): 1, (16, 1): 1, (16, 2): 1, (17, 0): 1, (17, 1): 1, (17, 2): 1, (8, 5): 2, (8, 6): 1, (9, 4): 3, (9, 5): 3, (9, 6): 1, (7, 10): 1, (7, 11): 1, (8, 10): 1, (8, 11): 1, (9, 9): 1, (9, 10): 1, (9, 11): 1, (9, 3): 2, (10, 3): 2, (10, 4): 2, (10, 5): 2, (11, 3): 1, (11, 4): 1, (11, 5): 1, (3, 8): 1, (3, 9): 1, (3, 10): 1}\n else:\n dic[(i,j)]=1 # (7): dic={(-1, 0): 1} (10): dic={(-1, 0): 1, (-1, 1): 1} ... (697): dic={(-1, 0): 1, (-1, 1): 1, (-1, 2): 1, (0, 0): 1, (0, 1): 1, (0, 2): 1, (1, 0): 1, (1, 1): 2, (1, 2): 2, (0, 3): 1, (0, 4): 1, (0, 5): 1, (1, 3): 2, (1, 4): 2, (1, 5): 2, (2, 3): 2, (2, 4): 2, (2, 5): 3, (0, 8): 2, (0, 9): 1, (0, 10): 1, (1, 8): 2, (1, 9): 1, (1, 10): 1, (2, 8): 2, (2, 9): 1, (2, 10): 1, (1, 6): 2, (2, 6): 3, (3, 4): 1, (3, 5): 2, (3, 6): 2, (2, 7): 2, (3, 7): 1, (4, 5): 1, (4, 6): 1, (4, 7): 1, (3, 1): 2, (3, 2): 2, (3, 3): 2, (4, 1): 1, (4, 2): 1, (4, 3): 1, (5, 1): 1, (5, 2): 1, (5, 3): 2, (0, 6): 1, (0, 7): 1, (1, 7): 1, (4, 8): 1, (4, 9): 1, (4, 10): 1, (5, 8): 2, (5, 9): 1, (5, 10): 1, (6, 8): 3, (6, 9): 2, (6, 10): 1, (5, 4): 1, (5, 5): 2, (6, 3): 2, (6, 4): 2, (6, 5): 2, (7, 3): 2, (7, 4): 3, (7, 5): 3, (5, 6): 2, (5, 7): 2, (6, 6): 2, (6, 7): 3, (7, 6): 3, (7, 7): 3, (7, 8): 2, (2, 1): 1, (2, 2): 1, (6, 2): 1, (7, 2): 1, (8, 2): 1, (8, 3): 2, (8, 4): 3, (7, 9): 2, (8, 7): 1, (8, 8): 1, (8, 9): 2, (15, 0): 1, (15, 1): 1, (15, 2): 1, (16, 0): 1, (16, 1): 1, (16, 2): 1, (17, 0): 1, (17, 1): 1, (17, 2): 1, (8, 5): 2, (8, 6): 1, (9, 4): 3, (9, 5): 3, (9, 6): 1, (7, 10): 1, (7, 11): 1, (8, 10): 1, (8, 11): 1, (9, 9): 1, (9, 10): 1, (9, 11): 1, (9, 3): 2, (10, 3): 2, (10, 4): 2, (10, 5): 2, (11, 3): 1, (11, 4): 1, (11, 5): 1, (3, 8): 1, (3, 9): 1, (3, 10): 1}\n \nhowmany=[0 for i in range(10)] # (723): howmany=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor some in dic.keys(): # (724): some=(-1, 0) (727): some=(-1, 1) ... (1129): NO CHANGE\n a,b=some[0],some[1] # (725): a=-1, b=0 (728): b=1 ... (1127): b=10\n if 2<=a<=h-1 and 2<=b<=w-1: # (726): NO CHANGE (729): NO CHANGE ... (1128): NO CHANGE\n howmany[dic[some]]+=1 # (772): howmany=[0, 0, 1, 0, 0, 0, 0, 0, 0, 0] (776): howmany=[0, 0, 2, 0, 0, 0, 0, 0, 0, 0] ... (1125): howmany=[0, 21, 27, 12, 0, 0, 0, 0, 0, 0]\nfor i in range(10): # (1130): i=0 (1132): i=1 ... (1148): i=9\n print(howmany[i]) # (1131): NO CHANGE (1133): NO CHANGE ... (1149): NO CHANGE\n"], "anno_status": [false], "diff_content": " \n h,w,n=map(int,input().split())\n dic={}\n for _ in range(n):\n a,b=map(int,input().split())\n for i in range(a-1,a+2):\n for j in range(b-1,b+2):\n if (i,j) in dic.keys():\n dic[(i,j)]+=1\n else:\n dic[(i,j)]=1\n \n howmany=[0 for i in range(10)]\n for some in dic.keys():\n a,b=some[0],some[1]\n if 2<=a<=h-1 and 2<=b<=w-1:\n howmany[dic[some]]+=1\n-for i in range(10):\n+J=(h-2)*(w-2)-sum(howmany)\n+print(J)\n+for i in range(1,10):\n print(howmany[i])\n+\n", "FL_content": " \n h,w,n=map(int,input().split())\n dic={}\n for _ in range(n):\n a,b=map(int,input().split())\n for i in range(a-1,a+2):\n for j in range(b-1,b+2):\n if (i,j) in dic.keys():\n dic[(i,j)]+=1\n else:\n dic[(i,j)]=1\n \n howmany=[0 for i in range(10)]\n for some in dic.keys():\n a,b=some[0],some[1]\n if 2<=a<=h-1 and 2<=b<=w-1:\n howmany[dic[some]]+=1\n-for i in range(10):\n print(howmany[i])\n", "added_lines": 4, "removed_lines": 1, "code1_lines": 19 }, { "user_id": "u377989038", "problem_id": "p02720", "submission1_id": "s171501051", "submission2_id": "s076495420", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def dfs(r):\n global l\n if len(r) == 11:\n return\n l.append(int(r))\n for i in range(-1, 2):\n tmp = int(r[-1]) + i\n if 0 <= tmp <= 9:\n dfs(r + str(tmp))\n\n\nk = int(input())\nl = []\nfor i in range(1, 10):\n dfs(str(i))\nprint(sorted(l)[k])", "code2": "def dfs(r):\n global l\n if len(r) == 11:\n return\n l.append(int(r))\n for i in range(-1, 2):\n tmp = int(r[-1]) + i\n if 0 <= tmp <= 9:\n dfs(r + str(tmp))\n\n\nk = int(input())\nl = []\nfor i in range(1, 10):\n dfs(str(i))\nprint(sorted(l)[k - 1])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588648081", "date2": "1588648551", "bleu_score": "0.9812673671160095", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "179\n", "actual_output": "3443\n", "expected_output": "3434\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " def dfs(r):\n global l\n if len(r) == 11:\n return\n l.append(int(r))\n for i in range(-1, 2):\n tmp = int(r[-1]) + i\n if 0 <= tmp <= 9:\n dfs(r + str(tmp))\n \n \n k = int(input())\n l = []\n for i in range(1, 10):\n dfs(str(i))\n-print(sorted(l)[k])\n+print(sorted(l)[k - 1])\n", "FL_content": " def dfs(r):\n global l\n if len(r) == 11:\n return\n l.append(int(r))\n for i in range(-1, 2):\n tmp = int(r[-1]) + i\n if 0 <= tmp <= 9:\n dfs(r + str(tmp))\n \n \n k = int(input())\n l = []\n for i in range(1, 10):\n dfs(str(i))\n-print(sorted(l)[k])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u572012241", "problem_id": "p02720", "submission1_id": "s546830619", "submission2_id": "s874569890", "status1": "Wrong Answer", "status2": "Accepted", "code1": " \ndef make_tree(G,keta,count):\n if keta==1:\n num =[]\n for i in range(1,10):\n count+=1\n if count ==k:\n print(i)\n exit()\n else:\n num.append(i)\n G.append(num)\n make_tree(G,2,count)\n else:\n print(G)\n num_list = G[keta-2]\n num_lis =[]\n for num in num_list:\n num_str = str(num)\n num_e = int(num_str[-1])\n if num_e == 0:\n count +=1\n if count == k :\n print(int(num_str + \"0\"))\n exit()\n num_lis.append(int((num_str)+\"0\"))\n count+=1\n if count == k :\n print(int(num_str + \"1\"))\n exit()\n num_lis.append(int((num_str)+\"1\"))\n elif num_e == 9:\n count +=1\n if count == k :\n print(int(num_str + \"8\"))\n exit()\n num_lis.append(int((num_str)+\"8\"))\n count+=1\n if count == k :\n print(int(num_str + \"8\"))\n exit()\n num_lis.append(int((num_str)+\"9\"))\n else:\n count +=1\n if count == k :\n print(int(num_str + str(num_e-1)))\n exit()\n num_lis.append(int(num_str + str(num_e-1)))\n count+=1\n if count == k :\n print(int(num_str + str(num_e)))\n exit()\n num_lis.append(int(num_str + str(num_e)))\n count+=1\n if count == k :\n print(int(num_str + str(num_e+1)))\n exit()\n num_lis.append(int(num_str + str(num_e+1)))\n G.append(num_lis)\n\n make_tree(G,keta+1,count)\n\n\nk = int(input())\nG=[]\nmake_tree(G,1,0)", "code2": "def make_tree(G,keta,count):\n if keta==1:\n num =[]\n for i in range(1,10):\n count+=1\n if count ==k:\n print(i)\n exit()\n else:\n num.append(i)\n G.append(num)\n make_tree(G,2,count)\n else:\n \n num_list = G[keta-2]\n num_lis =[]\n for num in num_list:\n num_str = str(num)\n num_e = int(num_str[-1])\n if num_e == 0:\n count +=1\n if count == k :\n print(int(num_str + \"0\"))\n exit()\n num_lis.append(int((num_str)+\"0\"))\n count+=1\n if count == k :\n print(int(num_str + \"1\"))\n exit()\n num_lis.append(int((num_str)+\"1\"))\n elif num_e == 9:\n count +=1\n if count == k :\n print(int(num_str + \"8\"))\n exit()\n num_lis.append(int((num_str)+\"8\"))\n count+=1\n if count == k :\n print(int(num_str + \"9\"))\n exit()\n num_lis.append(int((num_str)+\"9\"))\n else:\n count +=1\n if count == k :\n print(int(num_str + str(num_e-1)))\n exit()\n num_lis.append(int(num_str + str(num_e-1)))\n count+=1\n if count == k :\n print(int(num_str + str(num_e)))\n exit()\n num_lis.append(int(num_str + str(num_e)))\n count+=1\n if count == k :\n print(int(num_str + str(num_e+1)))\n exit()\n num_lis.append(int(num_str + str(num_e+1)))\n G.append(num_lis)\n\n make_tree(G,keta+1,count)\n\n\nk = int(input())\nG=[]\nmake_tree(G,1,0)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586053690", "date2": "1586053792", "bleu_score": "0.9919343765598214", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "333\n", "actual_output": "[[1, 2, 3, 4, 5, 6, 7, 8, 9]]\n[[1, 2, 3, 4, 5, 6, 7, 8, 9], [10, 11, 12, 21, 22, 23, 32, 33, 34, 43, 44, 45, 54, 55, 56, 65, 66, 67, 76, 77, 78, 87, 88, 89, 98, 99]]\n[[1, 2, 3, 4, 5, 6, 7, 8, 9], [10, 11, 12, 21, 22, 23, 32, 33, 34, 43, 44, 45, 54, 55, 56, 65, 66, 67, 76, 77, 78, 87, 88, 89, 98, 99], [100, 101, 110, 111, 112, 121, 122, 123, 210, 211, 212, 221, 222, 223, 232, 233, 234, 321, 322, 323, 332, 333, 334, 343, 344, 345, 432, 433, 434, 443, 444, 445, 454, 455, 456, 543, 544, 545, 554, 555, 556, 565, 566, 567, 654, 655, 656, 665, 666, 667, 676, 677, 678, 765, 766, 767, 776, 777, 778, 787, 788, 789, 876, 877, 878, 887, 888, 889, 898, 899, 987, 988, 989, 998, 999]]\n[[1, 2, 3, 4, 5, 6, 7, 8, 9], [10, 11, 12, 21, 22, 23, 32, 33, 34, 43, 44, 45, 54, 55, 56, 65, 66, 67, 76, 77, 78, 87, 88, 89, 98, 99], [100, 101, 110, 111, 112, 121, 122, 123, 210, 211, 212, 221, 222, 223, 232, 233, 234, 321, 322, 323, 332, 333, 334, 343, 344, 345, 432, 433, 434, 443, 444, 445, 454, 455, 456, 543, 544, 545, 554, 555, 556, 565, 566, 567, 654, 655, 656, 665, 666, 667, 676, 677, 678, 765, 766, 767, 776, 777, 778, 787, 788, 789, 876, 877, 878, 887, 888, 889, 898, 899, 987, 988, 989, 998, 999], [1000, 1001, 1010, 1011, 1012, 1100, 1101, 1110, 1111, 1112, 1121, 1122, 1123, 1210, 1211, 1212, 1221, 1222, 1223, 1232, 1233, 1234, 2100, 2101, 2110, 2111, 2112, 2121, 2122, 2123, 2210, 2211, 2212, 2221, 2222, 2223, 2232, 2233, 2234, 2321, 2322, 2323, 2332, 2333, 2334, 2343, 2344, 2345, 3210, 3211, 3212, 3221, 3222, 3223, 3232, 3233, 3234, 3321, 3322, 3323, 3332, 3333, 3334, 3343, 3344, 3345, 3432, 3433, 3434, 3443, 3444, 3445, 3454, 3455, 3456, 4321, 4322, 4323, 4332, 4333, 4334, 4343, 4344, 4345, 4432, 4433, 4434, 4443, 4444, 4445, 4454, 4455, 4456, 4543, 4544, 4545, 4554, 4555, 4556, 4565, 4566, 4567, 5432, 5433, 5434, 5443, 5444, 5445, 5454, 5455, 5456, 5543, 5544, 5545, 5554, 5555, 5556, 5565, 5566, 5567, 5654, 5655, 5656, 5665, 5666, 5667, 5676, 5677, 5678, 6543, 6544, 6545, 6554, 6555, 6556, 6565, 6566, 6567, 6654, 6655, 6656, 6665, 6666, 6667, 6676, 6677, 6678, 6765, 6766, 6767, 6776, 6777, 6778, 6787, 6788, 6789, 7654, 7655, 7656, 7665, 7666, 7667, 7676, 7677, 7678, 7765, 7766, 7767, 7776, 7777, 7778, 7787, 7788, 7789, 7876, 7877, 7878, 7887, 7888, 7889, 7898, 7899, 8765, 8766, 8767, 8776, 8777, 8778, 8787, 8788, 8789, 8876, 8877, 8878, 8887, 8888, 8889, 8898, 8899, 8987, 8988, 8989, 8998, 8999, 9876, 9877, 9878, 9887, 9888, 9889, 9898, 9899, 9987, 9988, 9989, 9998, 9999]]\n10100\n", "expected_output": "10100\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": "- \n def make_tree(G,keta,count):\n if keta==1:\n num =[]\n for i in range(1,10):\n count+=1\n if count ==k:\n print(i)\n exit()\n else:\n num.append(i)\n G.append(num)\n make_tree(G,2,count)\n else:\n- print(G)\n+ \n num_list = G[keta-2]\n num_lis =[]\n for num in num_list:\n num_str = str(num)\n num_e = int(num_str[-1])\n if num_e == 0:\n count +=1\n if count == k :\n print(int(num_str + \"0\"))\n exit()\n num_lis.append(int((num_str)+\"0\"))\n count+=1\n if count == k :\n print(int(num_str + \"1\"))\n exit()\n num_lis.append(int((num_str)+\"1\"))\n elif num_e == 9:\n count +=1\n if count == k :\n print(int(num_str + \"8\"))\n exit()\n num_lis.append(int((num_str)+\"8\"))\n count+=1\n if count == k :\n- print(int(num_str + \"8\"))\n+ print(int(num_str + \"9\"))\n exit()\n num_lis.append(int((num_str)+\"9\"))\n else:\n count +=1\n if count == k :\n print(int(num_str + str(num_e-1)))\n exit()\n num_lis.append(int(num_str + str(num_e-1)))\n count+=1\n if count == k :\n print(int(num_str + str(num_e)))\n exit()\n num_lis.append(int(num_str + str(num_e)))\n count+=1\n if count == k :\n print(int(num_str + str(num_e+1)))\n exit()\n num_lis.append(int(num_str + str(num_e+1)))\n G.append(num_lis)\n \n make_tree(G,keta+1,count)\n \n \n k = int(input())\n G=[]\n make_tree(G,1,0)\n+\n", "FL_content": "- \n def make_tree(G,keta,count):\n if keta==1:\n num =[]\n for i in range(1,10):\n count+=1\n if count ==k:\n print(i)\n exit()\n else:\n num.append(i)\n G.append(num)\n make_tree(G,2,count)\n else:\n- print(G)\n num_list = G[keta-2]\n num_lis =[]\n for num in num_list:\n num_str = str(num)\n num_e = int(num_str[-1])\n if num_e == 0:\n count +=1\n if count == k :\n print(int(num_str + \"0\"))\n exit()\n num_lis.append(int((num_str)+\"0\"))\n count+=1\n if count == k :\n print(int(num_str + \"1\"))\n exit()\n num_lis.append(int((num_str)+\"1\"))\n elif num_e == 9:\n count +=1\n if count == k :\n print(int(num_str + \"8\"))\n exit()\n num_lis.append(int((num_str)+\"8\"))\n count+=1\n if count == k :\n- print(int(num_str + \"8\"))\n exit()\n num_lis.append(int((num_str)+\"9\"))\n else:\n count +=1\n if count == k :\n print(int(num_str + str(num_e-1)))\n exit()\n num_lis.append(int(num_str + str(num_e-1)))\n count+=1\n if count == k :\n print(int(num_str + str(num_e)))\n exit()\n num_lis.append(int(num_str + str(num_e)))\n count+=1\n if count == k :\n print(int(num_str + str(num_e+1)))\n exit()\n num_lis.append(int(num_str + str(num_e+1)))\n G.append(num_lis)\n \n make_tree(G,keta+1,count)\n \n \n k = int(input())\n G=[]\n make_tree(G,1,0)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 66 }, { "user_id": "u190405389", "problem_id": "p02720", "submission1_id": "s214368008", "submission2_id": "s843363482", "status1": "Wrong Answer", "status2": "Accepted", "code1": "k = int(input())\n\ndp = [[[] for j in range(11)] for i in range(11)]\n\n\nfor i in range(10):\n dp[1][i].append(i)\n dp[0][i].append(0)\n\n\nif k<=9:\n print(k)\n exit()\n\nk-=9\n\nfor i in range(2, 11):\n for j in range(1, 10):\n if j==1:\n for z in range(i):\n for x in dp[i-z-1][j]:\n dp[i][j].append(j*10**(i-1)+x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j + 1]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n else:\n for x in dp[i-1][j-1]:\n dp[i][j].append(j*10**(i-1)+x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j + 1]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n\n\n", "code2": "k = int(input())\n\ndp = [[[] for j in range(11)] for i in range(11)]\n\n\nfor i in range(10):\n dp[1][i].append(i)\n dp[0][i].append(0)\n\n\nif k<=9:\n print(k)\n exit()\n\nk-=9\n\nfor i in range(2, 11):\n for j in range(1, 10):\n if j==1:\n for z in range(i):\n for x in dp[z][j]:\n dp[i][j].append(j*10**(i-1)+x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j + 1]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n else:\n for x in dp[i-1][j-1]:\n dp[i][j].append(j*10**(i-1)+x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j + 1]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586051274", "date2": "1586051351", "bleu_score": "0.9952462237859762", "code1_test_status": [0, 1], "code1_test_score": 1, "total_score": 2, "input": "333\n", "actual_output": "11121\n", "expected_output": "10100\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " k = int(input())\n \n dp = [[[] for j in range(11)] for i in range(11)]\n \n \n for i in range(10):\n dp[1][i].append(i)\n dp[0][i].append(0)\n \n \n if k<=9:\n print(k)\n exit()\n \n k-=9\n \n for i in range(2, 11):\n for j in range(1, 10):\n if j==1:\n for z in range(i):\n- for x in dp[i-z-1][j]:\n+ for x in dp[z][j]:\n dp[i][j].append(j*10**(i-1)+x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j + 1]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n else:\n for x in dp[i-1][j-1]:\n dp[i][j].append(j*10**(i-1)+x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j + 1]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n \n \n \n", "FL_content": " k = int(input())\n \n dp = [[[] for j in range(11)] for i in range(11)]\n \n \n for i in range(10):\n dp[1][i].append(i)\n dp[0][i].append(0)\n \n \n if k<=9:\n print(k)\n exit()\n \n k-=9\n \n for i in range(2, 11):\n for j in range(1, 10):\n if j==1:\n for z in range(i):\n- for x in dp[i-z-1][j]:\n dp[i][j].append(j*10**(i-1)+x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j + 1]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n else:\n for x in dp[i-1][j-1]:\n dp[i][j].append(j*10**(i-1)+x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j + 1]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n \n \n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 54 }, { "user_id": "u737758066", "problem_id": "p02720", "submission1_id": "s961250487", "submission2_id": "s708254484", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import collections\n\nk = int(input())\nli = [str(i) for i in range(1,10)]\nstr_li = li[:]\nq = collections.deque(li)\ncount = 0\nn = 10**10\n\nfor i in range(1,n):\n a = q.popleft()\n num = int(a[-1])\n if num != 0:\n aa = a + str(num-1)\n str_li.append(aa)\n count+=1\n aa = a + str(num)\n str_li.append(aa)\n q.append(aa)\n count+=1\n if num != 9:\n aa = a + str(num+1)\n str_li.append(aa)\n q.append(aa)\n count+=1\n if count > k:\n print(str_li[k-1])\n break\n\n", "code2": "import collections\nk = int(input())\nli = [str(i) for i in range(1,10)]\nst_li = li[:]\n\nq = collections.deque(li)\ncount = 0\nn = 10 ** 10\n\nfor i in range(1,n):\n \n a = q.popleft()\n num = int(a[-1])\n \n if num != 0:\n aa = a + str(num-1)\n st_li.append(aa)\n q.append(aa)\n count += 1\n aa = a + str(num)\n st_li.append(aa)\n q.append(aa)\n count += 1\n if num != 9:\n aa = a + str(num+1)\n st_li.append(aa)\n q.append(aa)\n count += 1\n if count > k:\n print(st_li[k-1])\n exit(0)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587125594", "date2": "1587343765", "bleu_score": "0.8810054304115738", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "333\n", "actual_output": "78889\n", "expected_output": "10100\n\n", "anno_code": ["import collections\n\nk = int(input()) # (0): k=333\nli = [str(i) for i in range(1,10)] # (1): li=['1', '2', '3', '4', '5', '6', '7', '8', '9']\nstr_li = li[:] # (2): str_li=['1', '2', '3', '4', '5', '6', '7', '8', '9']\nq = collections.deque(li) # (3): q=deque(['8999', '9999', '11111', '11112', '11122', '11123', '11222', '11223', '11233', '11234', '12222', '12223', '12233', '12234', '12333', '12334', '12344', '12345', '22222', '22223', '22233', '22234', '22333', '22334', '22344', '22345', '23333', '23334', '23344', '23345', '23444', '23445', '23455', '23456', '33333', '33334', '33344', '33345', '33444', '33445', '33455', '33456', '34444', '34445', '34455', '34456', '34555', '34556', '34566', '34567', '44444', '44445', '44455', '44456', '44555', '44556', '44566', '44567', '45555', '45556', '45566', '45567', '45666', '45667', '45677', '45678', '55555', '55556', '55566', '55567', '55666', '55667', '55677', '55678', '56666', '56667', '56677', '56678', '56777', '56778', '56788', '56789', '66666', '66667', '66677', '66678', '66777', '66778', '66788', '66789', '67777', '67778', '67788', '67789', '67888', '67889', '67899', '77777', '77778', '77788', '77789', '77888', '77889', '77899', '78888', '78889', '78899', '78999', '88888', '88889', '88899', '88999'])\ncount = 0 # (4): count=0\nn = 10**10 # (5): n=10000000000\n\nfor i in range(1,n): # (6): i=1 (23): i=2 ... (1913): i=116\n a = q.popleft() # (7): a=1 (24): a=2 ... (1914): a=8899\n num = int(a[-1]) # (8): num=1 (25): num=2 ... (1915): NO CHANGE\n if num != 0: # (9): NO CHANGE (26): NO CHANGE ... (1916): NO CHANGE\n aa = a + str(num-1) # (10): aa=10 (27): aa=21 ... (1917): aa=88998\n str_li.append(aa) # (11): str_li=['1', '2', '3', '4', '5', '6', '7', '8', '9', '10'] (28): str_li=['1', '2', '3', '4', '5', '6', '7', '8', '9', '10', '11', '12', '21'] ... (1918): str_li=[1, 2, ..., 88899, 88998]\n count+=1 # (12): count=1 (29): count=4 ... (1919): count=334\n aa = a + str(num) # (13): aa=11 (30): aa=22 ... (1920): aa=88999\n str_li.append(aa) # (14): str_li=['1', '2', '3', '4', '5', '6', '7', '8', '9', '10', '11'] (31): str_li=['1', '2', '3', '4', '5', '6', '7', '8', '9', '10', '11', '12', '21', '22'] ... (1921): str_li=[1, 2, ..., 88998, 88999]\n q.append(aa) # (15): NO CHANGE (32): NO CHANGE ... (1922): NO CHANGE\n count+=1 # (16): count=2 (33): count=5 ... (1923): count=335\n if num != 9: # (17): NO CHANGE (34): NO CHANGE ... (1924): NO CHANGE\n aa = a + str(num+1) # (18): aa=12 (35): aa=23 ... (1895): aa=88889\n str_li.append(aa) # (19): str_li=['1', '2', '3', '4', '5', '6', '7', '8', '9', '10', '11', '12'] (36): str_li=['1', '2', '3', '4', '5', '6', '7', '8', '9', '10', '11', '12', '21', '22', '23'] ... (1896): str_li=[1, 2, ..., 88888, 88889]\n q.append(aa) # (20): NO CHANGE (37): NO CHANGE ... (1897): NO CHANGE\n count+=1 # (21): count=3 (38): count=6 ... (1898): count=331\n if count > k: # (22): NO CHANGE (39): NO CHANGE ... (1925): NO CHANGE\n print(str_li[k-1]) # (1926): NO CHANGE\n break\n\n"], "anno_status": [false], "diff_content": " import collections\n-\n k = int(input())\n li = [str(i) for i in range(1,10)]\n-str_li = li[:]\n+st_li = li[:]\n+\n q = collections.deque(li)\n count = 0\n-n = 10**10\n+n = 10 ** 10\n \n for i in range(1,n):\n+ \n a = q.popleft()\n num = int(a[-1])\n+ \n if num != 0:\n aa = a + str(num-1)\n- str_li.append(aa)\n- count+=1\n+ st_li.append(aa)\n+ q.append(aa)\n+ count += 1\n aa = a + str(num)\n- str_li.append(aa)\n+ st_li.append(aa)\n q.append(aa)\n- count+=1\n+ count += 1\n if num != 9:\n aa = a + str(num+1)\n- str_li.append(aa)\n+ st_li.append(aa)\n q.append(aa)\n- count+=1\n+ count += 1\n if count > k:\n- print(str_li[k-1])\n- break\n-\n+ print(st_li[k-1])\n+ exit(0)\n \n", "FL_content": " import collections\n-\n k = int(input())\n li = [str(i) for i in range(1,10)]\n-str_li = li[:]\n q = collections.deque(li)\n count = 0\n-n = 10**10\n \n for i in range(1,n):\n a = q.popleft()\n num = int(a[-1])\n if num != 0:\n aa = a + str(num-1)\n- str_li.append(aa)\n- count+=1\n aa = a + str(num)\n- str_li.append(aa)\n q.append(aa)\n- count+=1\n if num != 9:\n aa = a + str(num+1)\n- str_li.append(aa)\n q.append(aa)\n- count+=1\n if count > k:\n- print(str_li[k-1])\n- break\n-\n \n", "added_lines": 14, "removed_lines": 12, "code1_lines": 30 }, { "user_id": "u334904929", "problem_id": "p02720", "submission1_id": "s955053441", "submission2_id": "s594649038", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\nK = int(input())\n\nd = deque()\n\nfor i in range(1,10):\n\td.append(i)\n\nfor i in range(K):\n\tx = d.popleft()\n\tif x % 10 != 0:\n\t\td.append(10*x+x-1)\n\td.append(10*x+x)\n\tif x % 10 != 9:\n\t\td.append(10*x+x+1)\n\nprint(x)\n", "code2": "from collections import deque\nK = int(input())\n\nd = deque()\n\nfor i in range(1,10):\n\td.append(i)\n\nfor i in range(K):\n\tx = d.popleft()\n\tif x % 10 != 0:\n\t\td.append(10*x+(x%10)-1)\n\td.append(10*x+(x%10))\n\tif x % 10 != 9:\n\t\td.append(10*x+(x%10)+1)\n\nprint(x)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588518051", "date2": "1588518171", "bleu_score": "0.9129163693286184", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "333\n", "actual_output": "13420\n", "expected_output": "10100\n\n", "anno_code": ["from collections import deque\nK = int(input()) # (0): K=333\n\nd = deque() # (1): d=deque([13421, 13430, 13431, 13432, 13441, 13442, 13443, 14520, 14521, 14530, 14531, 14532, 14630, 14631, 14640, 14641, 14642, 14651, 14652, 14653, 14750, 14751, 14752, 14761, 14762, 14763, 14772, 14773, 14774, 15840, 15841, 15850, 15851, 15852, 15861, 15862, 15863, 15960, 15961, 15962, 15971, 15972, 15973, 15982, 15983, 15984, 16081, 16082, 16083, 16092, 16093, 16094, 16103, 16104, 16105, 27830, 27831, 27840, 27841, 27842, 27940, 27941, 27950, 27951, 27952, 27961, 27962, 27963, 28060, 28061, 28062, 28071, 28072, 28073, 28082, 28083, 28084, 29150, 29151, 29160, 29161, 29162, 29171, 29172, 29173, 29270, 29271, 29272, 29281, 29282, 29283, 29292, 29293, 29294, 29391, 29392, 29393, 29402, 29403, 29404, 29413, 29414, 29415, 30480, 30481, 30482, 30491, 30492, 30493, 30502, 30503, 30504, 30601, 30602, 30603, 30612, 30613, 30614, 30623, 30624, 30625, 30722, 30723, 30724, 30733, 30734, 30735, 30744, 30745, 30746, 42460, 42461, 42470, 42471, 42472, 42481, 42482, 42483, 42580, 42581, 42582, 42591, 42592, 42593, 42602, 42603, 42604, 42701, 42702, 42703, 42712, 42713, 42714, 42723, 42724, 42725, 43790, 43791, 43792, 43801, 43802, 43803, 43812, 43813, 43814, 43911, 43912, 43913, 43922, 43923, 43924, 43933, 43934, 43935, 44032, 44033, 44034, 44043, 44044, 44045, 44054, 44055, 44056, 45121, 45122, 45123, 45132, 45133, 45134, 45143, 45144, 45145, 45242, 45243, 45244, 45253, 45254, 45255, 45264, 45265, 45266, 45363, 45364, 45365, 45374, 45375, 45376, 45385, 45386, 45387, 57100, 57101, 57102, 57111, 57112, 57113, 57122, 57123, 57124, 57221, 57222, 57223, 57232, 57233, 57234, 57243, 57244, 57245, 57342, 57343, 57344, 57353, 57354, 57355, 57364, 57365, 57366, 58431, 58432, 58433, 58442, 58443, 58444, 58453, 58454, 58455, 58552, 58553, 58554, 58563, 58564, 58565, 58574, 58575, 58576, 58673, 58674, 58675, 58684, 58685, 58686, 58695, 58696, 58697, 59762, 59763, 59764, 59773, 59774, 59775, 59784, 59785, 59786, 59883, 59884, 59885, 59894, 59895, 59896, 59905, 59906, 59907, 60004, 60005, 60006, 60015, 60016, 60017, 60026, 60027, 60028, 71741, 71742, 71743, 71752, 71753, 71754, 71763, 71764, 71765, 71862, 71863, 71864, 71873, 71874, 71875, 71884, 71885, 71886, 71983, 71984, 71985, 71994, 71995, 71996, 72005, 72006, 72007, 73072, 73073, 73074, 73083, 73084, 73085, 73094, 73095, 73096, 73193, 73194, 73195, 73204, 73205, 73206, 73215, 73216, 73217, 73314, 73315, 73316, 73325, 73326, 73327, 73336, 73337, 73338, 74403, 74404, 74405, 74414, 74415, 74416, 74425, 74426, 74427, 74524, 74525, 74526, 74535, 74536, 74537, 74546, 74547, 74548, 74645, 74646, 74647, 74656, 74657, 74658, 74667, 74668, 74669, 86382, 86383, 86384, 86393, 86394, 86395, 86404, 86405, 86406, 86503, 86504, 86505, 86514, 86515, 86516, 86525, 86526, 86527, 86624, 86625, 86626, 86635, 86636, 86637, 86646, 86647, 86648, 87713, 87714, 87715, 87724, 87725, 87726, 87735, 87736, 87737, 87834, 87835, 87836, 87845, 87846, 87847, 87856, 87857, 87858, 87955, 87956, 87957, 87966, 87967, 87968, 87977, 87978, 87979, 89044, 89045, 89046, 89055, 89056, 89057, 89066, 89067, 89068, 89165, 89166, 89167, 89176, 89177, 89178, 89187, 89188, 89189, 89286, 89287, 89288, 89297, 89298, 89299, 89308, 89309, 101023, 101024, 101025, 101034, 101035, 101036, 101045, 101046, 101047, 101144, 101145, 101146, 101155, 101156, 101157, 101166, 101167, 101168, 101265, 101266, 101267, 101276, 101277, 101278, 101287, 101288, 101289, 102354, 102355, 102356, 102365, 102366, 102367, 102376, 102377, 102378, 102475, 102476, 102477, 102486, 102487, 102488, 102497, 102498, 102499, 102596, 102597, 102598, 102607, 102608, 102609, 102618, 102619, 103685, 103686, 103687, 103696, 103697, 103698, 103707, 103708, 103709, 103806, 103807, 103808, 103817, 103818, 103819, 103828, 103829, 103927, 103928, 103929, 103938, 103939, 115664, 115665, 115666, 115675, 115676, 115677, 115686, 115687, 115688, 115785, 115786, 115787, 115796, 115797, 115798, 115807, 115808, 115809, 115906, 115907, 115908, 115917, 115918, 115919, 115928, 115929, 116995, 116996, 116997, 117006, 117007, 117008, 117017, 117018, 117019, 117116, 117117, 117118, 117127, 117128, 117129, 117138, 117139, 117237, 117238, 117239, 117248, 117249, 118326, 118327, 118328, 118337, 118338, 118339, 118348, 118349, 118447, 118448, 118449, 118458, 118459, 130305, 130306, 130307, 130316, 130317, 130318, 130327, 130328, 130329, 130426, 130427, 130428, 130437, 130438, 130439, 130448, 130449, 130547, 130548, 130549, 130558, 130559, 131636, 131637, 131638, 131647, 131648, 131649, 131658, 131659, 131757, 131758, 131759, 131768, 131769, 146410, 146411, 146420, 146421, 146422, 146520, 146521, 146530, 146531, 146532, 146541, 146542, 146543, 147620, 147621])\n\nfor i in range(1,10): # (2): i=1 (4): i=2 ... (20): NO CHANGE\n\td.append(i) # (3): NO CHANGE (5): NO CHANGE ... (19): NO CHANGE\n\nfor i in range(K): # (21): i=0 (28): i=1 ... (2315): NO CHANGE\n\tx = d.popleft() # (22): x=1 (29): x=2 ... (2310): x=13420\n\tif x % 10 != 0: # (23): NO CHANGE (30): NO CHANGE ... (2311): NO CHANGE\n\t\td.append(10*x+x-1) # (24): NO CHANGE (31): NO CHANGE ... (2305): NO CHANGE\n\td.append(10*x+x) # (25): NO CHANGE (32): NO CHANGE ... (2312): NO CHANGE\n\tif x % 10 != 9: # (26): NO CHANGE (33): NO CHANGE ... (2313): NO CHANGE\n\t\td.append(10*x+x+1) # (27): NO CHANGE (34): NO CHANGE ... (2314): NO CHANGE\n\nprint(x)\n"], "anno_status": [false], "diff_content": " from collections import deque\n K = int(input())\n \n d = deque()\n \n for i in range(1,10):\n \td.append(i)\n \n for i in range(K):\n \tx = d.popleft()\n \tif x % 10 != 0:\n-\t\td.append(10*x+x-1)\n-\td.append(10*x+x)\n+\t\td.append(10*x+(x%10)-1)\n+\td.append(10*x+(x%10))\n \tif x % 10 != 9:\n-\t\td.append(10*x+x+1)\n+\t\td.append(10*x+(x%10)+1)\n \n print(x)\n \n", "FL_content": " from collections import deque\n K = int(input())\n \n d = deque()\n \n for i in range(1,10):\n \td.append(i)\n \n for i in range(K):\n \tx = d.popleft()\n \tif x % 10 != 0:\n-\t\td.append(10*x+x-1)\n-\td.append(10*x+x)\n \tif x % 10 != 9:\n-\t\td.append(10*x+x+1)\n \n print(x)\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 18 }, { "user_id": "u907414670", "problem_id": "p02720", "submission1_id": "s094331207", "submission2_id": "s687018743", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import queue\n\nk = int(input())\nq = queue.Queue()\nx = -1\nfor i in range(1,10):\n q.put(i)\nfor i in range(1,k+1):\n x = q.get()\n if x % 10 != 0:\n q.put(10 * x + (x % 10) - 1)\n q.put(10 * x + (x % 10))\n if x % 9 != 0:\n q.put(10 * x + (x % 10) + 1)\nprint(x)", "code2": "import queue\n\nk = int(input())\nq = queue.Queue()\nx = -1\nfor i in range(1,10):\n q.put(i)\nfor i in range(1,k+1):\n x = q.get()\n if x % 10 != 0:\n q.put(10 * x + (x % 10) - 1)\n q.put(10 * x + (x % 10))\n if x % 10 != 9:\n q.put(10 * x + (x % 10) + 1)\nprint(x)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586112023", "date2": "1586112164", "bleu_score": "0.9811123369245202", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "179\n", "actual_output": "3445\n", "expected_output": "3434\n\n", "anno_code": ["import queue\n\nk = int(input()) # (0): k=179\nq = queue.Queue() # (1): q=\nx = -1 # (2): x=-1\nfor i in range(1,10): # (3): i=1 (5): i=2 ... (21): NO CHANGE\n q.put(i) # (4): NO CHANGE (6): NO CHANGE ... (20): NO CHANGE\nfor i in range(1,k+1): # (22): i=1 (29): i=2 ... (1243): NO CHANGE\n x = q.get() # (23): x=1 (30): x=2 ... (1237): x=3445\n if x % 10 != 0: # (24): NO CHANGE (31): NO CHANGE ... (1238): NO CHANGE\n q.put(10 * x + (x % 10) - 1) # (25): NO CHANGE (32): NO CHANGE ... (1239): NO CHANGE\n q.put(10 * x + (x % 10)) # (26): NO CHANGE (33): NO CHANGE ... (1240): NO CHANGE\n if x % 9 != 0: # (27): NO CHANGE (34): NO CHANGE ... (1241): NO CHANGE\n q.put(10 * x + (x % 10) + 1) # (28): NO CHANGE (35): NO CHANGE ... (1242): NO CHANGE\nprint(x)"], "anno_status": [true], "diff_content": " import queue\n \n k = int(input())\n q = queue.Queue()\n x = -1\n for i in range(1,10):\n q.put(i)\n for i in range(1,k+1):\n x = q.get()\n if x % 10 != 0:\n q.put(10 * x + (x % 10) - 1)\n q.put(10 * x + (x % 10))\n- if x % 9 != 0:\n+ if x % 10 != 9:\n q.put(10 * x + (x % 10) + 1)\n print(x)\n", "FL_content": " import queue\n \n k = int(input())\n q = queue.Queue()\n x = -1\n for i in range(1,10):\n q.put(i)\n for i in range(1,k+1):\n x = q.get()\n if x % 10 != 0:\n q.put(10 * x + (x % 10) - 1)\n q.put(10 * x + (x % 10))\n- if x % 9 != 0:\n q.put(10 * x + (x % 10) + 1)\n print(x)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u090972687", "problem_id": "p02720", "submission1_id": "s013146411", "submission2_id": "s168151011", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\n\nk = int(input())\n\nque = deque([1,2,3,4,5,6,7,8,9])\n\nfor n in range(0, k):\n x = que.popleft()\n if x % 10 != 0:\n que.append(x * 10 + x % 10 - 1)\n que.append(10*x)\n if x % 10 != 9:\n que.append(x * 10 + x % 10 + 1)\n\nprint(x)", "code2": "from collections import deque\n\nk = int(input())\n\nque = deque([1,2,3,4,5,6,7,8,9])\n\nfor n in range(0, k):\n x = que.popleft()\n if x % 10 != 0:\n que.append(x * 10 + x % 10 - 1)\n que.append(x * 10 + x % 10)\n if x % 10 != 9:\n que.append(x * 10 + x % 10 + 1)\n\nprint(x)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586055443", "date2": "1586055630", "bleu_score": "0.943528708919775", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "333\n", "actual_output": "21201\n", "expected_output": "10100\n\n", "anno_code": ["from collections import deque\n\nk = int(input()) # (0): k=333\n\nque = deque([1,2,3,4,5,6,7,8,9]) # (1): que=deque([21232, 21230, 21234, 20000, 20001, 20010, 20010, 20012, 20100, 20101, 20100, 20101, 20121, 20120, 20123, 23210, 23210, 23212, 23200, 23201, 23232, 23230, 23234, 23000, 23001, 23010, 23010, 23012, 23432, 23430, 23434, 23400, 23401, 23454, 23450, 23456, 32100, 32101, 32100, 32101, 32121, 32120, 32123, 32000, 32001, 32010, 32010, 32012, 32321, 32320, 32323, 32300, 32301, 32343, 32340, 32345, 30000, 30001, 30010, 30010, 30012, 30100, 30101, 30100, 30101, 30121, 30120, 30123, 34321, 34320, 34323, 34300, 34301, 34343, 34340, 34345, 34000, 34001, 34010, 34010, 34012, 34543, 34540, 34545, 34500, 34501, 34565, 34560, 34567, 43210, 43210, 43212, 43200, 43201, 43232, 43230, 43234, 43000, 43001, 43010, 43010, 43012, 43432, 43430, 43434, 43400, 43401, 43454, 43450, 43456, 40000, 40001, 40010, 40010, 40012, 40100, 40101, 40100, 40101, 40121, 40120, 40123, 45432, 45430, 45434, 45400, 45401, 45454, 45450, 45456, 45000, 45001, 45010, 45010, 45012, 45654, 45650, 45656, 45600, 45601, 45676, 45670, 45678, 54321, 54320, 54323, 54300, 54301, 54343, 54340, 54345, 54000, 54001, 54010, 54010, 54012, 54543, 54540, 54545, 54500, 54501, 54565, 54560, 54567, 50000, 50001, 50010, 50010, 50012, 50100, 50101, 50100, 50101, 50121, 50120, 50123, 56543, 56540, 56545, 56500, 56501, 56565, 56560, 56567, 56000, 56001, 56010, 56010, 56012, 56765, 56760, 56767, 56700, 56701, 56787, 56780, 56789, 65432, 65430, 65434, 65400, 65401, 65454, 65450, 65456, 65000, 65001, 65010, 65010, 65012, 65654, 65650, 65656, 65600, 65601, 65676, 65670, 65678, 60000, 60001, 60010, 60010, 60012, 60100, 60101, 60100, 60101, 60121, 60120, 60123, 67654, 67650, 67656, 67600, 67601, 67676, 67670, 67678, 67000, 67001, 67010, 67010, 67012, 67876, 67870, 67878, 67800, 67801, 67898, 67890, 76543, 76540, 76545, 76500, 76501, 76565, 76560, 76567, 76000, 76001, 76010, 76010, 76012, 76765, 76760, 76767, 76700, 76701, 76787, 76780, 76789, 70000, 70001, 70010, 70010, 70012, 70100, 70101, 70100, 70101, 70121, 70120, 70123, 78765, 78760, 78767, 78700, 78701, 78787, 78780, 78789, 78000, 78001, 78010, 78010, 78012, 78987, 78980, 78989, 78900, 78901, 87654, 87650, 87656, 87600, 87601, 87676, 87670, 87678, 87000, 87001, 87010, 87010, 87012, 87876, 87870, 87878, 87800, 87801, 87898, 87890, 80000, 80001, 80010, 80010, 80012, 80100, 80101, 80100, 80101, 80121, 80120, 80123, 89876, 89870, 89878, 89800, 89801, 89898, 89890, 89000, 89001, 89010, 89010, 89012, 98765, 98760, 98767, 98700, 98701, 98787, 98780, 98789, 98000, 98001, 98010, 98010, 98012, 98987, 98980, 98989, 98900, 98901, 90000, 90001, 90010, 90010, 90012, 90100, 90101, 90100, 90101, 90121, 90120, 90123, 100000, 100001, 100010, 100010, 100012, 100100, 100101, 100100, 100101, 100121, 100120, 100123, 101000, 101001, 101010, 101010, 101012, 101000, 101001, 101010, 101010, 101012, 101210, 101210, 101212, 101200, 101201, 101232, 101230, 101234, 100000, 100001, 100010, 100010, 100012, 100100, 100101, 100100, 100101, 100121, 100120, 100123, 101000, 101001, 101010, 101010, 101012, 101000, 101001, 101010, 101010, 101012, 101210, 101210, 101212, 101200, 101201, 101232, 101230, 101234, 121000, 121001, 121010, 121010, 121012, 121000, 121001, 121010, 121010, 121012, 121210, 121210, 121212, 121200, 121201, 121232, 121230, 121234, 120000, 120001, 120010, 120010, 120012, 120100, 120101, 120100, 120101, 120121, 120120, 120123, 123210, 123210, 123212, 123200, 123201, 123232, 123230, 123234, 123000, 123001, 123010, 123010, 123012, 123432, 123430, 123434, 123400, 123401, 123454, 123450, 123456, 210000, 210001, 210010, 210010, 210012, 210100, 210101, 210100, 210101, 210121, 210120, 210123, 210000, 210001, 210010, 210010, 210012, 210100, 210101, 210100, 210101, 210121, 210120, 210123, 212100, 212101, 212100, 212101, 212121, 212120, 212123, 212000, 212001, 212010, 212010, 212012])\n\nfor n in range(0, k): # (2): n=0 (9): n=1 ... (2180): NO CHANGE\n x = que.popleft() # (3): x=1 (10): x=2 ... (2174): x=21201\n if x % 10 != 0: # (4): NO CHANGE (11): NO CHANGE ... (2175): NO CHANGE\n que.append(x * 10 + x % 10 - 1) # (5): NO CHANGE (12): NO CHANGE ... (2176): NO CHANGE\n que.append(10*x) # (6): NO CHANGE (13): NO CHANGE ... (2177): NO CHANGE\n if x % 10 != 9: # (7): NO CHANGE (14): NO CHANGE ... (2178): NO CHANGE\n que.append(x * 10 + x % 10 + 1) # (8): NO CHANGE (15): NO CHANGE ... (2179): NO CHANGE\n\nprint(x)"], "anno_status": [false], "diff_content": " from collections import deque\n \n k = int(input())\n \n que = deque([1,2,3,4,5,6,7,8,9])\n \n for n in range(0, k):\n x = que.popleft()\n if x % 10 != 0:\n que.append(x * 10 + x % 10 - 1)\n- que.append(10*x)\n+ que.append(x * 10 + x % 10)\n if x % 10 != 9:\n que.append(x * 10 + x % 10 + 1)\n \n print(x)\n", "FL_content": " from collections import deque\n \n k = int(input())\n \n que = deque([1,2,3,4,5,6,7,8,9])\n \n for n in range(0, k):\n x = que.popleft()\n if x % 10 != 0:\n que.append(x * 10 + x % 10 - 1)\n- que.append(10*x)\n if x % 10 != 9:\n que.append(x * 10 + x % 10 + 1)\n \n print(x)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u392319141", "problem_id": "p02720", "submission1_id": "s234311500", "submission2_id": "s286651000", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from heapq import heappop, heappush, heapify\nK = int(input())\n\nque = list(range(1, 10))\nV = set()\nheapify(que)\n\nwhile K >= 1:\n top = heappop(que)\n if top in V:\n continue\n V.add(top)\n K -= 1\n\n top = str(top)\n L = int(top[0])\n R = int(top[-1])\n\n for i in (L - 1, L, L + 1):\n if 1 <= i <= 9:\n heappush(que, int(str(i) + top))\n for i in (R - 1, R, R + 1):\n if 0 <= i <= 9:\n heappush(que, int(top + str(i)))\n\nprint(que[0])\n", "code2": "from heapq import heappop, heappush, heapify\nK = int(input())\nM = K\n\nque = list(range(1, 10))\nV = set()\nheapify(que)\n\nwhile M + 100 >= 0:\n top = heappop(que)\n if top in V:\n continue\n V.add(top)\n M -= 1\n\n top = str(top)\n L = int(top[0])\n R = int(top[-1])\n\n for i in (L - 1, L, L + 1):\n if 1 <= i <= 9:\n heappush(que, int(str(i) + top))\n for i in (R - 1, R, R + 1):\n if 0 <= i <= 9:\n heappush(que, int(top + str(i)))\n\nV = [int(d) for d in V]\nV.sort()\nprint(V[K - 1])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586051922", "date2": "1586052304", "bleu_score": "0.8869055666247208", "code1_test_status": [0, 1], "code1_test_score": 1, "total_score": 2, "input": "333\n", "actual_output": "10101\n", "expected_output": "10100\n\n", "anno_code": ["from heapq import heappop, heappush, heapify\nK = int(input()) # (0): K=333\n\nque = list(range(1, 10)) # (1): que=[1, 2, 3, 4, 5, 6, 7, 8, 9]\nV = set() # (2): V=set()\nheapify(que) # (3): NO CHANGE\n\nwhile K >= 1: # (4): NO CHANGE (31): NO CHANGE ... (10470): NO CHANGE\n top = heappop(que) # (5): que=[2, 4, 3, 8, 5, 6, 7, 9], top=1 (32): que=[3, 4, 6, 8, 5, 11, 7, 9, 11, 21, 10, 12], top=2 ... (10445): que=[10101, 10123, ..., 100121, 100122], top=10100\n if top in V: # (6): NO CHANGE (33): NO CHANGE ... (10446): NO CHANGE\n continue # (309): NO CHANGE (340): NO CHANGE ... (10310): NO CHANGE\n V.add(top) # (7): V={1} (34): V={1, 2} ... (10447): V={1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 21, 22, 23, 32, 33, 34, 43, 44, 45, 2100, 2101, 54, 55, 56, 2110, 2111, 2112, 65, 66, 67, 2121, 2122, 2123, 76, 77, 78, 87, 88, 89, 98, 99, 100, 101, 110, 111, 112, 121, 122, 123, 2210, 2211, 2212, 2221, 2222, 2223, 2232, 2233, 2234, 210, 211, 212, 221, 222, 223, 4321, 4322, 4323, 232, 233, 234, 4332, 4333, 4334, 4343, 4344, 4345, 2321, 2322, 2323, 2332, 2333, 2334, 2343, 2344, 2345, 321, 322, 323, 332, 333, 334, 4432, 4433, 4434, 343, 344, 345, 4443, 4444, 4445, 4454, 4455, 4456, 6543, 6544, 6545, 6554, 6555, 6556, 6565, 6566, 6567, 432, 433, 434, 443, 444, 445, 4543, 4544, 4545, 454, 455, 456, 4554, 4555, 4556, 4565, 4566, 4567, 6654, 6655, 6656, 6665, 6666, 6667, 6676, 6677, 6678, 543, 544, 545, 554, 555, 556, 565, 566, 567, 8765, 8766, 8767, 8776, 8777, 8778, 8787, 8788, 8789, 6765, 6766, 6767, 6776, 6777, 6778, 6787, 6788, 6789, 654, 655, 656, 665, 666, 667, 676, 677, 678, 8876, 8877, 8878, 8887, 8888, 8889, 8898, 8899, 765, 766, 767, 776, 777, 778, 787, 788, 789, 8987, 8988, 8989, 8998, 8999, 876, 877, 878, 887, 888, 889, 898, 899, 987, 988, 989, 998, 999, 1000, 1001, 1010, 1011, 1012, 1100, 1101, 1110, 1111, 1112, 1121, 1122, 1123, 3210, 3211, 3212, 3221, 3222, 3223, 3232, 3233, 3234, 1210, 1211, 1212, 1221, 1222, 1223, 1232, 1233, 1234, 3321, 3322, 3323, 3332, 3333, 3334, 3343, 3344, 3345, 5432, 5433, 5434, 5443, 5444, 5445, 5454, 5455, 5456, 3432, 3433, 3434, 3443, 3444, 3445, 3454, 3455, 3456, 5543, 5544, 5545, 5554, 5555, 5556, 5565, 5566, 5567, 7654, 7655, 7656, 7665, 7666, 7667, 7676, 7677, 7678, 5654, 5655, 5656, 5665, 5666, 5667, 5676, 5677, 5678, 7765, 7766, 7767, 7776, 7777, 7778, 7787, 7788, 7789, 9876, 9877, 9878, 9887, 9888, 9889, 9898, 9899, 7876, 7877, 7878, 7887, 7888, 7889, 7898, 7899, 9987, 9988, 9989, 9998, 9999, 10000, 10001, 10010, 10011, 10012, 10100}\n K -= 1 # (8): K=332 (35): K=331 ... (10448): K=0\n\n top = str(top) # (9): top=1 (36): top=2 ... (10449): top=10100\n L = int(top[0]) # (10): L=1 (37): L=2 ... (10450): NO CHANGE\n R = int(top[-1]) # (11): R=1 (38): R=2 ... (10451): R=0\n\n for i in (L - 1, L, L + 1): # (12): i=0 (14): i=1 ... (10460): NO CHANGE\n if 1 <= i <= 9: # (13): NO CHANGE (15): NO CHANGE ... (10458): NO CHANGE\n heappush(que, int(str(i) + top)) # (16): que=[2, 4, 3, 8, 5, 6, 7, 9, 11] (19): que=[2, 4, 3, 8, 5, 6, 7, 9, 11, 21] ... (10459): que=[10101, 10123, ..., 110100, 210100]\n for i in (R - 1, R, R + 1): # (21): i=0 (24): i=1 ... (10469): NO CHANGE\n if 0 <= i <= 9: # (22): NO CHANGE (25): NO CHANGE ... (10467): NO CHANGE\n heappush(que, int(top + str(i))) # (23): que=[2, 4, 3, 8, 5, 6, 7, 9, 11, 21, 10] (26): que=[2, 4, 3, 8, 5, 6, 7, 9, 11, 21, 10, 11] ... (10468): que=[10101, 10123, ..., 101000, 101001]\n\nprint(que[0])\n"], "anno_status": [false], "diff_content": " from heapq import heappop, heappush, heapify\n K = int(input())\n+M = K\n \n que = list(range(1, 10))\n V = set()\n heapify(que)\n \n-while K >= 1:\n+while M + 100 >= 0:\n top = heappop(que)\n if top in V:\n continue\n V.add(top)\n- K -= 1\n+ M -= 1\n \n top = str(top)\n L = int(top[0])\n R = int(top[-1])\n \n for i in (L - 1, L, L + 1):\n if 1 <= i <= 9:\n heappush(que, int(str(i) + top))\n for i in (R - 1, R, R + 1):\n if 0 <= i <= 9:\n heappush(que, int(top + str(i)))\n \n-print(que[0])\n+V = [int(d) for d in V]\n+V.sort()\n+print(V[K - 1])\n \n", "FL_content": " from heapq import heappop, heappush, heapify\n K = int(input())\n \n que = list(range(1, 10))\n V = set()\n heapify(que)\n \n-while K >= 1:\n top = heappop(que)\n if top in V:\n continue\n V.add(top)\n- K -= 1\n \n top = str(top)\n L = int(top[0])\n R = int(top[-1])\n \n for i in (L - 1, L, L + 1):\n if 1 <= i <= 9:\n heappush(que, int(str(i) + top))\n for i in (R - 1, R, R + 1):\n if 0 <= i <= 9:\n heappush(que, int(top + str(i)))\n \n-print(que[0])\n \n", "added_lines": 6, "removed_lines": 3, "code1_lines": 27 }, { "user_id": "u291528105", "problem_id": "p02720", "submission1_id": "s188536520", "submission2_id": "s146922900", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\nimport sys\n\ndef solve(k):\n if k < 10:\n return k\n \n heap = [1,2,3,4,5,6,7,8,9]\n heapq.heapify(heap)\n\n for i in range(k-1):\n lunlun = heapq.heappop(heap)\n lastDigit = lunlun % 10\n \n heapq.heappush(heap, (lunlun*10) + lastDigit)\n\n if lastDigit == 0:\n newlunlun = (lunlun * 10) + 1\n heapq.heappush(heap, newlunlun) \n elif lastDigit == 9:\n newlunlun = (lunlun * 10) + 8\n heapq.heappush(heap, newlunlun) \n else:\n newlunlun1 = (lunlun * 10) + lastDigit + 1\n newlunlun2 = (lunlun * 10) + lastDigit - 1\n heapq.heappush(heap, newlunlun1)\n heapq.heappush(heap, newlunlun2)\n\n return heapq.heappop(heap)\n\n\nk = 100000\nprint(solve(int(k)))", "code2": "import heapq\nimport sys\n\ndef solve(k):\n if k < 10:\n return k\n \n heap = [1,2,3,4,5,6,7,8,9]\n heapq.heapify(heap)\n\n for i in range(k-1):\n lunlun = heapq.heappop(heap)\n lastDigit = lunlun % 10\n \n heapq.heappush(heap, (lunlun*10) + lastDigit)\n\n if lastDigit == 0:\n newlunlun = (lunlun * 10) + 1\n heapq.heappush(heap, newlunlun) \n elif lastDigit == 9:\n newlunlun = (lunlun * 10) + 8\n heapq.heappush(heap, newlunlun) \n else:\n newlunlun1 = (lunlun * 10) + lastDigit + 1\n newlunlun2 = (lunlun * 10) + lastDigit - 1\n heapq.heappush(heap, newlunlun1)\n heapq.heappush(heap, newlunlun2)\n\n return heapq.heappop(heap)\n\nk = input()\n\nprint(solve(int(k)))", "original_language1": "Python (2.7.6)", "original_language2": "Python (2.7.6)", "date1": "1586195265", "date2": "1586195329", "bleu_score": "0.9884816208581918", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "179\n", "actual_output": "3234566667\n", "expected_output": "3434\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import heapq\n import sys\n \n def solve(k):\n if k < 10:\n return k\n \n heap = [1,2,3,4,5,6,7,8,9]\n heapq.heapify(heap)\n \n for i in range(k-1):\n lunlun = heapq.heappop(heap)\n lastDigit = lunlun % 10\n \n heapq.heappush(heap, (lunlun*10) + lastDigit)\n \n if lastDigit == 0:\n newlunlun = (lunlun * 10) + 1\n heapq.heappush(heap, newlunlun) \n elif lastDigit == 9:\n newlunlun = (lunlun * 10) + 8\n heapq.heappush(heap, newlunlun) \n else:\n newlunlun1 = (lunlun * 10) + lastDigit + 1\n newlunlun2 = (lunlun * 10) + lastDigit - 1\n heapq.heappush(heap, newlunlun1)\n heapq.heappush(heap, newlunlun2)\n \n return heapq.heappop(heap)\n \n+k = input()\n \n-k = 100000\n print(solve(int(k)))\n", "FL_content": " import heapq\n import sys\n \n def solve(k):\n if k < 10:\n return k\n \n heap = [1,2,3,4,5,6,7,8,9]\n heapq.heapify(heap)\n \n for i in range(k-1):\n lunlun = heapq.heappop(heap)\n lastDigit = lunlun % 10\n \n heapq.heappush(heap, (lunlun*10) + lastDigit)\n \n if lastDigit == 0:\n newlunlun = (lunlun * 10) + 1\n heapq.heappush(heap, newlunlun) \n elif lastDigit == 9:\n newlunlun = (lunlun * 10) + 8\n heapq.heappush(heap, newlunlun) \n else:\n newlunlun1 = (lunlun * 10) + lastDigit + 1\n newlunlun2 = (lunlun * 10) + lastDigit - 1\n heapq.heappush(heap, newlunlun1)\n heapq.heappush(heap, newlunlun2)\n \n return heapq.heappop(heap)\n \n \n-k = 100000\n print(solve(int(k)))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 33 }, { "user_id": "u089142196", "problem_id": "p02720", "submission1_id": "s406888778", "submission2_id": "s579139708", "status1": "Wrong Answer", "status2": "Accepted", "code1": "K=int(input())\nx=[[0] for _ in range(11)]\ny=[ 0 for _ in range(11)]\n\nx[1]=[1,2,3,4,5,6,7,8,9]\ny[1]=9\n\nfor i in range(2,11):\n x[i].pop()\n for num in x[i-1]:\n last = num%10\n if last==0:\n x[i].append(10*num)\n x[i].append(10*num+1)\n y[i] +=2\n elif last==9:\n x[i].append(10*num+8)\n x[i].append(10*num+9)\n y[i] +=2\n else:\n x[i].append(10*num+(last-1))\n x[i].append(10*num+last)\n x[i].append(10*num+(last+1))\n y[i] +=3\n \n\n\n\nz=[0,y[1]]\nfor i in range(2,11):\n z.append(z[-1]+y[i])\n\n\nmaxi=0\nfor r in range(11):\n if z[r]<=K:\n maxi=max(maxi,r)\n \nketa=maxi+1\n\nprint(x[keta][K-y[maxi]-1])", "code2": "K=int(input())\nx=[[0] for _ in range(11)]\ny=[ 0 for _ in range(11)]\n\nx[1]=[1,2,3,4,5,6,7,8,9]\ny[1]=9\n\nfor i in range(2,11):\n x[i].pop()\n for num in x[i-1]:\n last = num%10\n if last==0:\n x[i].append(10*num)\n x[i].append(10*num+1)\n y[i] +=2\n elif last==9:\n x[i].append(10*num+8)\n x[i].append(10*num+9)\n y[i] +=2\n else:\n x[i].append(10*num+(last-1))\n x[i].append(10*num+last)\n x[i].append(10*num+(last+1))\n y[i] +=3\n \n\n\n\nz=[0,y[1]]\nfor i in range(2,11):\n z.append(z[-1]+y[i])\n\n\nketa=0\nfor i,num in enumerate(z):\n if num<=K:\n keta=i+1\n\ns= K-z[keta-1]\n\nprint(x[keta][s-1])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586054387", "date2": "1586054797", "bleu_score": "0.9162558731495822", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "179\n", "actual_output": "5433\n", "expected_output": "3434\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " K=int(input())\n x=[[0] for _ in range(11)]\n y=[ 0 for _ in range(11)]\n \n x[1]=[1,2,3,4,5,6,7,8,9]\n y[1]=9\n \n for i in range(2,11):\n x[i].pop()\n for num in x[i-1]:\n last = num%10\n if last==0:\n x[i].append(10*num)\n x[i].append(10*num+1)\n y[i] +=2\n elif last==9:\n x[i].append(10*num+8)\n x[i].append(10*num+9)\n y[i] +=2\n else:\n x[i].append(10*num+(last-1))\n x[i].append(10*num+last)\n x[i].append(10*num+(last+1))\n y[i] +=3\n \n \n \n \n z=[0,y[1]]\n for i in range(2,11):\n z.append(z[-1]+y[i])\n \n \n-maxi=0\n-for r in range(11):\n- if z[r]<=K:\n- maxi=max(maxi,r)\n- \n-keta=maxi+1\n-\n-print(x[keta][K-y[maxi]-1])\n+keta=0\n+for i,num in enumerate(z):\n+ if num<=K:\n+ keta=i+1\n+\n+s= K-z[keta-1]\n+\n+print(x[keta][s-1])\n", "FL_content": " K=int(input())\n x=[[0] for _ in range(11)]\n y=[ 0 for _ in range(11)]\n \n x[1]=[1,2,3,4,5,6,7,8,9]\n y[1]=9\n \n for i in range(2,11):\n x[i].pop()\n for num in x[i-1]:\n last = num%10\n if last==0:\n x[i].append(10*num)\n x[i].append(10*num+1)\n y[i] +=2\n elif last==9:\n x[i].append(10*num+8)\n x[i].append(10*num+9)\n y[i] +=2\n else:\n x[i].append(10*num+(last-1))\n x[i].append(10*num+last)\n x[i].append(10*num+(last+1))\n y[i] +=3\n \n \n \n \n z=[0,y[1]]\n for i in range(2,11):\n z.append(z[-1]+y[i])\n \n \n-maxi=0\n-for r in range(11):\n- if z[r]<=K:\n- maxi=max(maxi,r)\n- \n-keta=maxi+1\n-\n-print(x[keta][K-y[maxi]-1])\n", "added_lines": 8, "removed_lines": 8, "code1_lines": 41 }, { "user_id": "u567380442", "problem_id": "p00015", "submission1_id": "s386357163", "submission2_id": "s559262615", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nf = sys.stdin\nn = int(f.readline())\nfor _ in range(n):\n a = f.readline().strip()\n b = f.readline().strip()\n c = int(a) + int(b)\n c = '{}'.format(c)\n print(c if len(c) else 'overflow')", "code2": "import sys\nf = sys.stdin\nn = int(f.readline())\nfor _ in range(n):\n a = f.readline().strip()\n b = f.readline().strip()\n c = int(a) + int(b)\n c = '{}'.format(c)\n print(c if len(c) <= 80 else 'overflow')", "original_language1": "Python3", "original_language2": "Python3", "date1": "1422615985", "date2": "1422616122", "bleu_score": "0.9683555094436175", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "6\n1101\n510\n11150581741799452420768643548247021706207\n8\n940241109576576259861480672250431087579815558778668516145336988025960960181876147\n-1\n30649081726584987569566544405667724154727609853023356866994194873421704913983049\n1\n101000000000100000000000000000000000000000000000000000000001000000000000000001000\n1\n100000000001000000000000000000000000000000000001000000000001000000000000000000000\n100000010000000000000000000000001000000001000100000000000000000000000000000010000\n", "actual_output": "1611\n11150581741799452420768643548247021706215\n940241109576576259861480672250431087579815558778668516145336988025960960181876146\n30649081726584987569566544405667724154727609853023356866994194873421704913983050\n101000000000100000000000000000000000000000000000000000000001000000000000000001001\n200000010001000000000000000000001000000001000101000000000001000000000000000010000\n", "expected_output": "1611\n11150581741799452420768643548247021706215\noverflow\n30649081726584987569566544405667724154727609853023356866994194873421704913983050\noverflow\noverflow\n\n", "anno_code": ["import sys\nf = sys.stdin # (0): f=<_io.TextIOWrapper name='../../test/autoComment2\\\\Dev\\\\p00015\\\\input_s386357163.txt' mode='r' encoding='utf-8'>\nn = int(f.readline()) # (1): n=6\nfor _ in range(n): # (2): _=0 (8): _=1 ... (32): _=5\n a = f.readline().strip() # (3): a=1101 (9): a=11150581741799452420768643548247021706207 ... (33): a=100000000001000000000000000000000000000000000001000000000001000000000000000000000\n b = f.readline().strip() # (4): b=510 (10): b=8 ... (34): b=100000010000000000000000000000001000000001000100000000000000000000000000000010000\n c = int(a) + int(b) # (5): c=1611 (11): c=11150581741799452420768643548247021706215 ... (35): c=200000010001000000000000000000001000000001000101000000000001000000000000000010000\n c = '{}'.format(c) # (6): c=1611 (12): c=11150581741799452420768643548247021706215 ... (36): c=200000010001000000000000000000001000000001000101000000000001000000000000000010000\n print(c if len(c) else 'overflow') # (7): NO CHANGE (13): NO CHANGE ... (37): NO CHANGE\n"], "anno_status": [false], "diff_content": " import sys\n f = sys.stdin\n n = int(f.readline())\n for _ in range(n):\n a = f.readline().strip()\n b = f.readline().strip()\n c = int(a) + int(b)\n c = '{}'.format(c)\n- print(c if len(c) else 'overflow')\n+ print(c if len(c) <= 80 else 'overflow')\n", "FL_content": " import sys\n f = sys.stdin\n n = int(f.readline())\n for _ in range(n):\n a = f.readline().strip()\n b = f.readline().strip()\n c = int(a) + int(b)\n c = '{}'.format(c)\n- print(c if len(c) else 'overflow')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u585391547", "problem_id": "p00015", "submission1_id": "s194661465", "submission2_id": "s980917527", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nfor n in range(n):\n\ta=int(input())\n\tb=int(input())\n\tc=a+b\n\tif a>=int(1e79) or b>=int(1e79) or c>=int(1e79):\n\t\tprint(\"overflow\")\n\telse:\n\t\tprint(c)", "code2": "n=int(input())\nfor i in range(n):\n\ta=int(input())\n\tb=int(input())\n\tc=a+b\n\tc=str(c)\n\tif len(c)>80:\n\t\tprint(\"overflow\")\n\telse:\n\t\tprint(c)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1412872736", "date2": "1413205987", "bleu_score": "0.703102183007645", "code1_test_status": [0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0], "code1_test_score": 34, "total_score": 101, "input": "6\n1001\n755\n9999999999999999999999999999999999999999\n2\n193919268602104111709736623030259273252485145760643079255618727884865768962159432\n0\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n0\n101000000000100000000000000000000000000000000000000000000000000000000000000000000\n1\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n100000010000000000000000000000001000000000000000000000000000000000000000000000000\n", "actual_output": "1756\n10000000000000000000000000000000000000001\noverflow\noverflow\noverflow\noverflow\n", "expected_output": "1756\n10000000000000000000000000000000000000001\noverflow\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\noverflow\noverflow\n\n", "anno_code": ["n=int(input()) # (0): n=6\nfor n in range(n): # (1): n=0 (7): n=1 ... (31): n=5\n\ta=int(input()) # (2): a=1001 (8): a=9999999999999999999999999999999999999999 ... (32): a=100000000000000000000000000000000000000000000000000000000000000000000000000000000\n\tb=int(input()) # (3): b=755 (9): b=2 ... (33): b=100000010000000000000000000000001000000000000000000000000000000000000000000000000\n\tc=a+b # (4): c=1756 (10): c=10000000000000000000000000000000000000001 ... (34): c=200000010000000000000000000000001000000000000000000000000000000000000000000000000\n\tif a>=int(1e79) or b>=int(1e79) or c>=int(1e79): # (5): NO CHANGE (11): NO CHANGE ... (35): NO CHANGE\n\t\tprint(\"overflow\") # (18): NO CHANGE (24): NO CHANGE ... (36): NO CHANGE\n\telse:\n\t\tprint(c) # (6): NO CHANGE (12): NO CHANGE\n"], "anno_status": [false], "diff_content": " n=int(input())\n-for n in range(n):\n+for i in range(n):\n \ta=int(input())\n \tb=int(input())\n \tc=a+b\n-\tif a>=int(1e79) or b>=int(1e79) or c>=int(1e79):\n+\tc=str(c)\n+\tif len(c)>80:\n \t\tprint(\"overflow\")\n \telse:\n \t\tprint(c)\n", "FL_content": " n=int(input())\n-for n in range(n):\n \ta=int(input())\n \tb=int(input())\n \tc=a+b\n-\tif a>=int(1e79) or b>=int(1e79) or c>=int(1e79):\n \t\tprint(\"overflow\")\n \telse:\n \t\tprint(c)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u940190657", "problem_id": "p00015", "submission1_id": "s656748883", "submission2_id": "s856329787", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n n = int(input())\n\n for i in range(n):\n val1 = int(input())\n val2 = int(input())\n print(str(val1 + val2))\n\nif __name__ == '__main__':\n main()", "code2": "def main():\n n = int(input())\n\n for i in range(n):\n result = str(int(input()) + int(input()))\n\n if len(result) > 80:\n print(\"overflow\")\n else:\n print(result)\n\nif __name__ == '__main__':\n main()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1433666693", "date2": "1433667088", "bleu_score": "0.6315722649505564", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "6\n1000\n38\n38060050512103967751821046555123274986471\n3\n748965102781050937681387220428718693622269067764748925491378558113447551883527603\n0\n14923344184498858993988796745669562170196205905706056613273758587721771662780252\n2\n101000000000100000000000000000000000000000000000000000000001000000000000100001000\n0\n110000000001000000000000000000000000000000001001000000000001000000000000000000000\n110000010000000000000000000000001000000001000000000000000000000000000000000010000\n", "actual_output": "1038\n38060050512103967751821046555123274986474\n748965102781050937681387220428718693622269067764748925491378558113447551883527603\n14923344184498858993988796745669562170196205905706056613273758587721771662780254\n101000000000100000000000000000000000000000000000000000000001000000000000100001000\n220000010001000000000000000000001000000001001001000000000001000000000000000010000\n", "expected_output": "1038\n38060050512103967751821046555123274986474\noverflow\n14923344184498858993988796745669562170196205905706056613273758587721771662780254\noverflow\noverflow\n\n", "anno_code": ["def main(): # (0): main=\n n = int(input())\n\n for i in range(n):\n val1 = int(input())\n val2 = int(input())\n print(str(val1 + val2))\n\nif __name__ == '__main__':\n main()"], "anno_status": [false], "diff_content": " def main():\n n = int(input())\n \n for i in range(n):\n- val1 = int(input())\n- val2 = int(input())\n- print(str(val1 + val2))\n+ result = str(int(input()) + int(input()))\n+\n+ if len(result) > 80:\n+ print(\"overflow\")\n+ else:\n+ print(result)\n \n if __name__ == '__main__':\n main()\n", "FL_content": " def main():\n n = int(input())\n \n for i in range(n):\n- val1 = int(input())\n- val2 = int(input())\n- print(str(val1 + val2))\n \n if __name__ == '__main__':\n main()\n", "added_lines": 6, "removed_lines": 3, "code1_lines": 10 }, { "user_id": "u364509382", "problem_id": "p00015", "submission1_id": "s401243549", "submission2_id": "s567307563", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nfor i in range(n):\n\ts = int(input())+int(input())\n\tif len(str(s))>=10**80:\n\t\tprint(\"overflow\")\n\telse:\n\t\tprint(s)", "code2": "n = int(input())\nfor i in range(n):\n\ts = int(input())+int(input())\n\tif len(str(s))>80:\n\t\tprint(\"overflow\")\n\telse:\n\t\tprint(s)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1472282136", "date2": "1472282245", "bleu_score": "0.9485960647060905", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "6\n1000\n800\n9999999999999999999999999999999999999999\n2\n101324030029434858112167499308639520871934406912468763412863813360414081674525193\n1\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n0\n101000000000000000000000000000000000000000000000000000000000000000000000000000000\n1\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n", "actual_output": "1800\n10000000000000000000000000000000000000001\n101324030029434858112167499308639520871934406912468763412863813360414081674525194\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n101000000000000000000000000000000000000000000000000000000000000000000000000000001\n200000000000000000000000000000000000000000000000000000000000000000000000000000000\n", "expected_output": "1800\n10000000000000000000000000000000000000001\noverflow\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\noverflow\noverflow\n\n", "anno_code": ["n = int(input()) # (0): n=6\nfor i in range(n): # (1): i=0 (5): i=1 ... (21): i=5\n\ts = int(input())+int(input()) # (2): s=1800 (6): s=10000000000000000000000000000000000000001 ... (22): s=200000000000000000000000000000000000000000000000000000000000000000000000000000000\n\tif len(str(s))>=10**80: # (3): NO CHANGE (7): NO CHANGE ... (23): NO CHANGE\n\t\tprint(\"overflow\")\n\telse:\n\t\tprint(s) # (4): NO CHANGE (8): NO CHANGE ... (24): NO CHANGE\n"], "anno_status": [false], "diff_content": " n = int(input())\n for i in range(n):\n \ts = int(input())+int(input())\n-\tif len(str(s))>=10**80:\n+\tif len(str(s))>80:\n \t\tprint(\"overflow\")\n \telse:\n \t\tprint(s)\n", "FL_content": " n = int(input())\n for i in range(n):\n \ts = int(input())+int(input())\n-\tif len(str(s))>=10**80:\n \t\tprint(\"overflow\")\n \telse:\n \t\tprint(s)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u957840591", "problem_id": "p00015", "submission1_id": "s503839163", "submission2_id": "s121335692", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nA=[]\nB=[]\nfor i in range(N):\n a = int(input())\n b = int(input())\n A.append(a)\n B.append(b)\n\nfor i in range(N):\n if A[i] >= 10 ** 79 or B[i] >= 10 ** 79:\n print(\"overflow\")\n elif A[i] + B[i]>= 10 ** 79:\n print(\"overflow\")\n else:\n print(str(A[i]+B[i]))", "code2": "N = int(input())\nA = []\nB = []\nfor i in range(N):\n a = int(input())\n b = int(input())\n A.append(a)\n B.append(b)\n\nfor i in range(N):\n if A[i] >= 10 ** 80 or B[i] >= 10 ** 80:\n print(\"overflow\")\n elif A[i] + B[i] >= 10 ** 80:\n print(\"overflow\")\n else:\n print(str(A[i] + B[i]))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1497342277", "date2": "1497342577", "bleu_score": "0.9063659341768328", "code1_test_status": [0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0], "code1_test_score": 34, "total_score": 101, "input": "6\n1000\n476\n9999999999999999999999999999999999999999\n1\n193919268602104111709736623030259273252485145760643079255618727884865768962159432\n0\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n0\n101000000000100000000000000000000000000000000000000000000000000000000000000000000\n1\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n100000010000000000000000000000001000000000000000000000000000000000000000000000000\n", "actual_output": "1476\n10000000000000000000000000000000000000000\noverflow\noverflow\noverflow\noverflow\n", "expected_output": "1476\n10000000000000000000000000000000000000000\noverflow\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\noverflow\noverflow\n\n", "anno_code": ["N=int(input()) # (0): N=6\nA=[] # (1): A=[]\nB=[] # (2): B=[]\nfor i in range(N): # (3): i=0 (8): i=1 ... (33): NO CHANGE\n a = int(input()) # (4): a=1000 (9): a=9999999999999999999999999999999999999999 ... (29): a=100000000000000000000000000000000000000000000000000000000000000000000000000000000\n b = int(input()) # (5): b=476 (10): b=1 ... (30): b=100000010000000000000000000000001000000000000000000000000000000000000000000000000\n A.append(a) # (6): A=[1000] (11): A=[1000, 9999999999999999999999999999999999999999] ... (31): A=[1000, 9999999999999999999999999999999999999999, 193919268602104111709736623030259273252485145760643079255618727884865768962159432, 99999999999999999999999999999999999999999999999999999999999999999999999999999999, 101000000000100000000000000000000000000000000000000000000000000000000000000000000, 100000000000000000000000000000000000000000000000000000000000000000000000000000000]\n B.append(b) # (7): B=[476] (12): B=[476, 1] ... (32): B=[476, 1, 0, 0, 1, 100000010000000000000000000000001000000000000000000000000000000000000000000000000]\n\nfor i in range(N): # (34): i=0 (38): i=1 ... (51): i=5\n if A[i] >= 10 ** 79 or B[i] >= 10 ** 79: # (35): NO CHANGE (39): NO CHANGE ... (52): NO CHANGE\n print(\"overflow\") # (44): NO CHANGE (47): NO CHANGE ... (53): NO CHANGE\n elif A[i] + B[i]>= 10 ** 79: # (36): NO CHANGE (40): NO CHANGE\n print(\"overflow\")\n else:\n print(str(A[i]+B[i])) # (37): NO CHANGE (41): NO CHANGE\n"], "anno_status": [false], "diff_content": "-N=int(input())\n-A=[]\n-B=[]\n+N = int(input())\n+A = []\n+B = []\n for i in range(N):\n a = int(input())\n b = int(input())\n A.append(a)\n B.append(b)\n \n for i in range(N):\n- if A[i] >= 10 ** 79 or B[i] >= 10 ** 79:\n+ if A[i] >= 10 ** 80 or B[i] >= 10 ** 80:\n print(\"overflow\")\n- elif A[i] + B[i]>= 10 ** 79:\n+ elif A[i] + B[i] >= 10 ** 80:\n print(\"overflow\")\n else:\n- print(str(A[i]+B[i]))\n+ print(str(A[i] + B[i]))\n", "FL_content": "-N=int(input())\n-A=[]\n-B=[]\n for i in range(N):\n a = int(input())\n b = int(input())\n A.append(a)\n B.append(b)\n \n for i in range(N):\n- if A[i] >= 10 ** 79 or B[i] >= 10 ** 79:\n print(\"overflow\")\n- elif A[i] + B[i]>= 10 ** 79:\n print(\"overflow\")\n else:\n- print(str(A[i]+B[i]))\n", "added_lines": 6, "removed_lines": 6, "code1_lines": 16 }, { "user_id": "u075836834", "problem_id": "p00015", "submission1_id": "s874429214", "submission2_id": "s147590026", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nfor _ in range(n):\n\ts=int(input())+int(input())\n\tprint('overflow' if s/1e80>1 else s)", "code2": "n=int(input())\nfor _ in range(n):\n\ts=int(input())+int(input())\n\tprint('overflow' if len(str(s))>80 else s)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1458769278", "date2": "1458769352", "bleu_score": "0.8651813126873771", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0], "code1_test_score": 98, "total_score": 101, "input": "6\n1000\n800\n167319819924237415589807736201027599985\n1\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n1\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n0\n101000000000000000000000000000000000000000000000000000000000000000000000000000000\n1\n100000000000000000000000000000000000000000000000000010000000000000000000000000000\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n", "actual_output": "1800\n167319819924237415589807736201027599986\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\noverflow\noverflow\n", "expected_output": "1800\n167319819924237415589807736201027599986\noverflow\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\noverflow\noverflow\n\n", "anno_code": ["n=int(input()) # (0): n=6\nfor _ in range(n): # (1): _=0 (4): _=1 ... (16): _=5\n\ts=int(input())+int(input()) # (2): s=1800 (5): s=167319819924237415589807736201027599986 ... (17): s=200000000000000000000000000000000000000000000000000010000000000000000000000000000\n\tprint('overflow' if s/1e80>1 else s) # (3): NO CHANGE (6): NO CHANGE ... (18): NO CHANGE\n"], "anno_status": [false], "diff_content": " n=int(input())\n for _ in range(n):\n \ts=int(input())+int(input())\n-\tprint('overflow' if s/1e80>1 else s)\n+\tprint('overflow' if len(str(s))>80 else s)\n", "FL_content": " n=int(input())\n for _ in range(n):\n \ts=int(input())+int(input())\n-\tprint('overflow' if s/1e80>1 else s)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u886122084", "problem_id": "p00015", "submission1_id": "s480705666", "submission2_id": "s736807739", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\n\nn = int(input())\nans = []\nfor _ in range(n):\n a = int(input())\n b = int(input())\n s = a+b\n if s >= 10**79:\n ans.append(\"overflow\")\n else:\n ans.append(str(s))\nprint(\"\\n\".join(ans))\n\n", "code2": "\nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\n\nn = int(input())\nans = []\nfor _ in range(n):\n a = int(input())\n b = int(input())\n s = a+b\n if s > 10**80-1:\n ans.append(\"overflow\")\n else:\n ans.append(str(s))\nprint(\"\\n\".join(ans))\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1551516046", "date2": "1551516157", "bleu_score": "0.9747988064450065", "code1_test_status": [0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0], "code1_test_score": 34, "total_score": 101, "input": "6\n1000\n800\n9999999999999999999999999999999999999999\n2\n101324030029434858112167499308639520871934406912468763412863813360414081674525193\n1\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n0\n101000000000000000000000000000000000000000000000000000000000000000000000000000000\n1\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n", "actual_output": "1800\n10000000000000000000000000000000000000001\noverflow\noverflow\noverflow\noverflow\n", "expected_output": "1800\n10000000000000000000000000000000000000001\noverflow\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\noverflow\noverflow\n\n", "anno_code": ["\nimport sys\nsys.setrecursionlimit(10**9) # (0): NO CHANGE\ninput = sys.stdin.readline # (1): input=\n\nn = int(input()) # (2): n=6\nans = [] # (3): ans=[]\nfor _ in range(n): # (4): _=0 (10): _=1 ... (40): NO CHANGE\n a = int(input()) # (5): a=1000 (11): a=9999999999999999999999999999999999999999 ... (35): a=100000000000000000000000000000000000000000000000000000000000000000000000000000000\n b = int(input()) # (6): b=800 (12): b=2 ... (36): b=100000000000000000000000000000000000000000000000000000000000000000000000000000000\n s = a+b # (7): s=1800 (13): s=10000000000000000000000000000000000000001 ... (37): s=200000000000000000000000000000000000000000000000000000000000000000000000000000000\n if s >= 10**79: # (8): NO CHANGE (14): NO CHANGE ... (38): NO CHANGE\n ans.append(\"overflow\") # (21): ans=['1800', '10000000000000000000000000000000000000001', 'overflow'] (27): ans=['1800', '10000000000000000000000000000000000000001', 'overflow', 'overflow'] ... (39): ans=['1800', '10000000000000000000000000000000000000001', 'overflow', 'overflow', 'overflow', 'overflow']\n else:\n ans.append(str(s)) # (9): ans=['1800'] (15): ans=['1800', '10000000000000000000000000000000000000001']\nprint(\"\\n\".join(ans))\n\n"], "anno_status": [false], "diff_content": " \n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n \n n = int(input())\n ans = []\n for _ in range(n):\n a = int(input())\n b = int(input())\n s = a+b\n- if s >= 10**79:\n+ if s > 10**80-1:\n ans.append(\"overflow\")\n else:\n ans.append(str(s))\n print(\"\\n\".join(ans))\n \n \n", "FL_content": " \n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n \n n = int(input())\n ans = []\n for _ in range(n):\n a = int(input())\n b = int(input())\n s = a+b\n- if s >= 10**79:\n ans.append(\"overflow\")\n else:\n ans.append(str(s))\n print(\"\\n\".join(ans))\n \n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u364509382", "problem_id": "p00015", "submission1_id": "s823452760", "submission2_id": "s567307563", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nfor i in range(n):\n\ts = int(input())+int(input())\n\tif len(str(s))>=80:\n\t\tprint(\"overflow\")\n\telse:\n\t\tprint(s)", "code2": "n = int(input())\nfor i in range(n):\n\ts = int(input())+int(input())\n\tif len(str(s))>80:\n\t\tprint(\"overflow\")\n\telse:\n\t\tprint(s)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1472282097", "date2": "1472282245", "bleu_score": "0.9796948341262014", "code1_test_status": [0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0], "code1_test_score": 34, "total_score": 101, "input": "6\n1010\n30\n11150581741799452420768643548247021706207\n8\n314411289867618232702241807880438703320781023701160407692239774484611399304275912\n-1\n14923344184498858993988796745669562170196205905706056613273758587721771662780252\n1\n101000000000100000000000000000000000000000000000000000000001000000000000000001000\n1\n100000000001000000000000000000000000000000001001000000000001000000000000000000000\n110000010000000000000000000000001000000001000100000000000000000000000000000010000\n", "actual_output": "1040\n11150581741799452420768643548247021706215\noverflow\noverflow\noverflow\noverflow\n", "expected_output": "1040\n11150581741799452420768643548247021706215\noverflow\n14923344184498858993988796745669562170196205905706056613273758587721771662780253\noverflow\noverflow\n\n", "anno_code": ["n = int(input()) # (0): n=6\nfor i in range(n): # (1): i=0 (5): i=1 ... (21): i=5\n\ts = int(input())+int(input()) # (2): s=1040 (6): s=11150581741799452420768643548247021706215 ... (22): s=210000010001000000000000000000001000000001001101000000000001000000000000000010000\n\tif len(str(s))>=80: # (3): NO CHANGE (7): NO CHANGE ... (23): NO CHANGE\n\t\tprint(\"overflow\") # (12): NO CHANGE (16): NO CHANGE ... (24): NO CHANGE\n\telse:\n\t\tprint(s) # (4): NO CHANGE (8): NO CHANGE\n"], "anno_status": [true], "diff_content": " n = int(input())\n for i in range(n):\n \ts = int(input())+int(input())\n-\tif len(str(s))>=80:\n+\tif len(str(s))>80:\n \t\tprint(\"overflow\")\n \telse:\n \t\tprint(s)\n", "FL_content": " n = int(input())\n for i in range(n):\n \ts = int(input())+int(input())\n-\tif len(str(s))>=80:\n \t\tprint(\"overflow\")\n \telse:\n \t\tprint(s)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u585391547", "problem_id": "p00015", "submission1_id": "s692007952", "submission2_id": "s980917527", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nfor n in range(n):\n\ta=int(input())\n\tb=int(input())\n\tc=a+b\n\tif a>=int(1e80) or b>=int(1e80) or c>=int(1e80):\n\t\tprint(\"overflow\")\n\telse:\n\t\tprint(c)", "code2": "n=int(input())\nfor i in range(n):\n\ta=int(input())\n\tb=int(input())\n\tc=a+b\n\tc=str(c)\n\tif len(c)>80:\n\t\tprint(\"overflow\")\n\telse:\n\t\tprint(c)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1412872829", "date2": "1413205987", "bleu_score": "0.707424422410111", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0], "code1_test_score": 98, "total_score": 101, "input": "6\n1000\n800\n9999999999999999999999999999999999999999\n1\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n1\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n0\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n1\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n", "actual_output": "1800\n10000000000000000000000000000000000000000\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n100000000000000000000000000000000000000000000000000000000000000000000000000000001\noverflow\n", "expected_output": "1800\n10000000000000000000000000000000000000000\noverflow\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\noverflow\noverflow\n", "anno_code": ["n=int(input()) # (0): n=6\nfor n in range(n): # (1): n=0 (7): n=1 ... (31): n=5\n\ta=int(input()) # (2): a=1000 (8): a=9999999999999999999999999999999999999999 ... (32): NO CHANGE\n\tb=int(input()) # (3): b=800 (9): b=1 ... (33): b=100000000000000000000000000000000000000000000000000000000000000000000000000000000\n\tc=a+b # (4): c=1800 (10): c=10000000000000000000000000000000000000000 ... (34): c=200000000000000000000000000000000000000000000000000000000000000000000000000000000\n\tif a>=int(1e80) or b>=int(1e80) or c>=int(1e80): # (5): NO CHANGE (11): NO CHANGE ... (35): NO CHANGE\n\t\tprint(\"overflow\") # (36): NO CHANGE\n\telse:\n\t\tprint(c) # (6): NO CHANGE (12): NO CHANGE ... (30): NO CHANGE\n"], "anno_status": [false], "diff_content": " n=int(input())\n-for n in range(n):\n+for i in range(n):\n \ta=int(input())\n \tb=int(input())\n \tc=a+b\n-\tif a>=int(1e80) or b>=int(1e80) or c>=int(1e80):\n+\tc=str(c)\n+\tif len(c)>80:\n \t\tprint(\"overflow\")\n \telse:\n \t\tprint(c)\n", "FL_content": " n=int(input())\n-for n in range(n):\n \ta=int(input())\n \tb=int(input())\n \tc=a+b\n-\tif a>=int(1e80) or b>=int(1e80) or c>=int(1e80):\n \t\tprint(\"overflow\")\n \telse:\n \t\tprint(c)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u123687446", "problem_id": "p00015", "submission1_id": "s758682555", "submission2_id": "s596567217", "status1": "Wrong Answer", "status2": "Accepted", "code1": "upper = 10**81\nn = int(input())\nfor i in range(n):\n n1 = int(input())\n if n1 >= upper:\n print(\"overflow\")\n continue\n n2 = int(input())\n if n2 >= upper:\n print(\"overflow\")\n continue\n print( n1 + n2 if n1+n2 < upper else \"overflow\")", "code2": "upper = 10**80\nn = int(input())\nfor i in range(n):\n n1 = int(input())\n n2 = int(input())\n if n1 >= upper or n2 >= upper:\n print(\"overflow\")\n continue\n print( n1 + n2 if n1+n2 < upper else \"overflow\")", "original_language1": "Python3", "original_language2": "Python3", "date1": "1481110598", "date2": "1481110655", "bleu_score": "0.7851418469119057", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "6\n1001\n510\n9999999999999999999999999999999999999999\n8\n406457296153147731569431812193957336633213953097465104312094248394524915238944551\n-2\n58309788833475244131751092110501484455671325624249551256800630673736756882679442\n1\n101000000000100000000000000000000000000000000000000000000001000000000000000001000\n-1\n100000000000000000000000000000000000000000000001000000000001000000000000000000000\n100000010000000000000000000000001000000001000000000000000000000000000000000010000\n", "actual_output": "1511\n10000000000000000000000000000000000000007\n406457296153147731569431812193957336633213953097465104312094248394524915238944549\n58309788833475244131751092110501484455671325624249551256800630673736756882679443\n101000000000100000000000000000000000000000000000000000000001000000000000000000999\n200000010000000000000000000000001000000001000001000000000001000000000000000010000\n", "expected_output": "1511\n10000000000000000000000000000000000000007\noverflow\n58309788833475244131751092110501484455671325624249551256800630673736756882679443\noverflow\noverflow\n\n", "anno_code": ["upper = 10**81 # (0): upper=1000000000000000000000000000000000000000000000000000000000000000000000000000000000\nn = int(input()) # (1): n=6\nfor i in range(n): # (2): i=0 (8): i=1 ... (32): i=5\n n1 = int(input()) # (3): n1=1001 (9): n1=9999999999999999999999999999999999999999 ... (33): n1=100000000000000000000000000000000000000000000001000000000001000000000000000000000\n if n1 >= upper: # (4): NO CHANGE (10): NO CHANGE ... (34): NO CHANGE\n print(\"overflow\")\n continue\n n2 = int(input()) # (5): n2=510 (11): n2=8 ... (35): n2=100000010000000000000000000000001000000001000000000000000000000000000000000010000\n if n2 >= upper: # (6): NO CHANGE (12): NO CHANGE ... (36): NO CHANGE\n print(\"overflow\")\n continue\n print( n1 + n2 if n1+n2 < upper else \"overflow\") # (7): NO CHANGE (13): NO CHANGE ... (37): NO CHANGE\n"], "anno_status": [false], "diff_content": "-upper = 10**81\n+upper = 10**80\n n = int(input())\n for i in range(n):\n n1 = int(input())\n- if n1 >= upper:\n- print(\"overflow\")\n- continue\n n2 = int(input())\n- if n2 >= upper:\n+ if n1 >= upper or n2 >= upper:\n print(\"overflow\")\n continue\n print( n1 + n2 if n1+n2 < upper else \"overflow\")\n", "FL_content": "-upper = 10**81\n n = int(input())\n for i in range(n):\n n1 = int(input())\n- if n1 >= upper:\n- print(\"overflow\")\n- continue\n n2 = int(input())\n- if n2 >= upper:\n print(\"overflow\")\n continue\n print( n1 + n2 if n1+n2 < upper else \"overflow\")\n", "added_lines": 2, "removed_lines": 5, "code1_lines": 12 }, { "user_id": "u097317219", "problem_id": "p03139", "submission1_id": "s636054427", "submission2_id": "s481512740", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,a,b = map(int,input().split())\nprint(min(a,b))", "code2": "n,a,b = map(int,input().split())\nprint(min(a,b),max(a+b-n,0))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589481800", "date2": "1589481850", "bleu_score": "0.7727887635299474", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 81, "input": "101 110 000\n", "actual_output": "0\n", "expected_output": "0 9\n\n", "anno_code": ["n,a,b = map(int,input().split()) # (0): n=101, a=110, b=0\nprint(min(a,b))"], "anno_status": [true], "diff_content": " n,a,b = map(int,input().split())\n-print(min(a,b))\n+print(min(a,b),max(a+b-n,0))\n", "FL_content": " n,a,b = map(int,input().split())\n-print(min(a,b))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u223133214", "problem_id": "p03139", "submission1_id": "s315690902", "submission2_id": "s821139381", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n_k = list(map(int, input().split()))\nn,a,b = n_k[0],n_k[1],n_k[2]\nmax,min = 0,0\nif n > a+b:\n min=0\n if a a+b:\n min=0\n if a a+b: # (3): NO CHANGE\n min=0\n if a a+b:\n min=0\n if a a+b:\n min=0\n if a N and A+B == 2*N ):\n print(\"{} {}\".format(c, A+B-N))\nelse:\n print(\"{} {}\".format(c, 0))\n", "code2": "N, A, B = (int(x) for x in input().split())\nc=0\nif(A <= B):\n c = A\nelse:\n c = B\nif(A+B > N):\n print(\"{} {}\".format(c, A+B-N))\nelse:\n print(\"{} {}\".format(c, 0))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1548641996", "date2": "1548642051", "bleu_score": "0.9036296825044923", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 9, "total_score": 81, "input": "101 001 111\n", "actual_output": "1 0\n", "expected_output": "1 11\n\n", "anno_code": ["N, A, B = (int(x) for x in input().split()) # (0): N=101, A=1, B=111\nc=0 # (1): c=0\nif(A <= B): # (2): NO CHANGE\n c = A # (3): c=1\nelse:\n c = B\nif(A+B > N and A+B == 2*N ): # (4): NO CHANGE\n print(\"{} {}\".format(c, A+B-N))\nelse:\n print(\"{} {}\".format(c, 0))\n"], "anno_status": [true], "diff_content": " N, A, B = (int(x) for x in input().split())\n c=0\n if(A <= B):\n c = A\n else:\n c = B\n-if(A+B > N and A+B == 2*N ):\n+if(A+B > N):\n print(\"{} {}\".format(c, A+B-N))\n else:\n print(\"{} {}\".format(c, 0))\n \n", "FL_content": " N, A, B = (int(x) for x in input().split())\n c=0\n if(A <= B):\n c = A\n else:\n c = B\n-if(A+B > N and A+B == 2*N ):\n print(\"{} {}\".format(c, A+B-N))\n else:\n print(\"{} {}\".format(c, 0))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u702786238", "problem_id": "p03139", "submission1_id": "s609316528", "submission2_id": "s453853150", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, A, B = map(int, input().split())\n\nans1 = B if A>B else A\nans2 = A+B-N\n\nprint(\"{} {}\".format(ans1, ans2))", "code2": "N, A, B = map(int, input().split())\n\nans1 = B if A>B else A\nans2 = A+B-N if A+B-N >= 0 else 0\n\nprint(\"{} {}\".format(ans1, ans2))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1585056075", "date2": "1585056134", "bleu_score": "0.821976415259977", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 74, "total_score": 81, "input": "5 -3 -1\n", "actual_output": "-3 -9\n", "expected_output": "-3 0\n\n", "anno_code": ["N, A, B = map(int, input().split()) # (0): N=5, A=-3, B=-1\n\nans1 = B if A>B else A # (1): ans1=-3\nans2 = A+B-N # (2): ans2=-9\n\nprint(\"{} {}\".format(ans1, ans2))"], "anno_status": [true], "diff_content": " N, A, B = map(int, input().split())\n \n ans1 = B if A>B else A\n-ans2 = A+B-N\n+ans2 = A+B-N if A+B-N >= 0 else 0\n \n print(\"{} {}\".format(ans1, ans2))\n", "FL_content": " N, A, B = map(int, input().split())\n \n ans1 = B if A>B else A\n-ans2 = A+B-N\n \n print(\"{} {}\".format(ans1, ans2))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u565380863", "problem_id": "p03139", "submission1_id": "s118404601", "submission2_id": "s352251100", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import bisect\nimport sys\n\nsys.setrecursionlimit(200000)\n\n\ndef input():\n return sys.stdin.readline()[:-1]\n\n\ndef ii(t: type = int):\n return t(input())\n\n\ndef il(t: type = int):\n return list(map(t, input().split()))\n\n\ndef imi(N: int, t: type = int):\n return [ii(t) for _ in range(N)]\n\n\ndef iml(N: int, t: type = int):\n return [il(t) for _ in range(N)]\n\n\ndef solve():\n N, a, b = il()\n return \"{} {}\".format(min(a, b), b if a == b else max(0, a - b))\n\n\nif __name__ == \"__main__\":\n print(solve())\n", "code2": "import bisect\nimport sys\n\nsys.setrecursionlimit(200000)\n\n\ndef input():\n return sys.stdin.readline()[:-1]\n\n\ndef ii(t: type = int):\n return t(input())\n\n\ndef il(t: type = int):\n return list(map(t, input().split()))\n\n\ndef imi(N: int, t: type = int):\n return [ii(t) for _ in range(N)]\n\n\ndef iml(N: int, t: type = int):\n return [il(t) for _ in range(N)]\n\n\ndef solve():\n N, a, b = il()\n return \"{} {}\".format(min(a, b), max(0, a - (N - b)))\n\n\nif __name__ == \"__main__\":\n print(solve())\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1548641117", "date2": "1548641247", "bleu_score": "0.9656735008535292", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 8, "total_score": 81, "input": "1 5 0\n", "actual_output": "0 5\n", "expected_output": "0 4\n\n", "anno_code": ["import bisect\nimport sys\n\nsys.setrecursionlimit(200000) # (0): NO CHANGE\n\n\ndef input(): # (1): input=\n return sys.stdin.readline()[:-1]\n\n\ndef ii(t: type = int): # (2): ii=\n return t(input())\n\n\ndef il(t: type = int): # (3): il=\n return list(map(t, input().split()))\n\n\ndef imi(N: int, t: type = int): # (4): imi=\n return [ii(t) for _ in range(N)]\n\n\ndef iml(N: int, t: type = int): # (5): iml=\n return [il(t) for _ in range(N)]\n\n\ndef solve(): # (6): solve=\n N, a, b = il()\n return \"{} {}\".format(min(a, b), b if a == b else max(0, a - b))\n\n\nif __name__ == \"__main__\":\n print(solve())\n"], "anno_status": [true], "diff_content": " import bisect\n import sys\n \n sys.setrecursionlimit(200000)\n \n \n def input():\n return sys.stdin.readline()[:-1]\n \n \n def ii(t: type = int):\n return t(input())\n \n \n def il(t: type = int):\n return list(map(t, input().split()))\n \n \n def imi(N: int, t: type = int):\n return [ii(t) for _ in range(N)]\n \n \n def iml(N: int, t: type = int):\n return [il(t) for _ in range(N)]\n \n \n def solve():\n N, a, b = il()\n- return \"{} {}\".format(min(a, b), b if a == b else max(0, a - b))\n+ return \"{} {}\".format(min(a, b), max(0, a - (N - b)))\n \n \n if __name__ == \"__main__\":\n print(solve())\n \n", "FL_content": " import bisect\n import sys\n \n sys.setrecursionlimit(200000)\n \n \n def input():\n return sys.stdin.readline()[:-1]\n \n \n def ii(t: type = int):\n return t(input())\n \n \n def il(t: type = int):\n return list(map(t, input().split()))\n \n \n def imi(N: int, t: type = int):\n return [ii(t) for _ in range(N)]\n \n \n def iml(N: int, t: type = int):\n return [il(t) for _ in range(N)]\n \n \n def solve():\n N, a, b = il()\n- return \"{} {}\".format(min(a, b), b if a == b else max(0, a - b))\n \n \n if __name__ == \"__main__\":\n print(solve())\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 34 }, { "user_id": "u106181248", "problem_id": "p03139", "submission1_id": "s411475446", "submission2_id": "s069987611", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y, z = map(int,input().split())\nprint(min(y,z), max(0, x-y-z))", "code2": "x, y, z = map(int,input().split())\nprint(min(y,z), max(0,y+z-x))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591193584", "date2": "1591193625", "bleu_score": "0.9003193833354567", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 2, "total_score": 81, "input": "000 011 100\n", "actual_output": "11 0\n", "expected_output": "11 111\n\n", "anno_code": ["x, y, z = map(int,input().split()) # (0): x=0, y=11, z=100\nprint(min(y,z), max(0, x-y-z))"], "anno_status": [true], "diff_content": " x, y, z = map(int,input().split())\n-print(min(y,z), max(0, x-y-z))\n+print(min(y,z), max(0,y+z-x))\n", "FL_content": " x, y, z = map(int,input().split())\n-print(min(y,z), max(0, x-y-z))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u814986259", "problem_id": "p03139", "submission1_id": "s266600972", "submission2_id": "s617706794", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,A,B=map(int,input().split())\nprint(max(0,min(A,B) -(N-max(A,B))),min(A,B))", "code2": "N,A,B=map(int,input().split())\nprint(min(A,B),max(0,min(A,B) -(N-max(A,B))))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573336323", "date2": "1573336369", "bleu_score": "0.9616606573639723", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 3, "total_score": 81, "input": "000 110 100\n", "actual_output": "210 100\n", "expected_output": "100 210\n\n", "anno_code": ["N,A,B=map(int,input().split()) # (0): N=0, A=110, B=100\nprint(max(0,min(A,B) -(N-max(A,B))),min(A,B))"], "anno_status": [true], "diff_content": " N,A,B=map(int,input().split())\n-print(max(0,min(A,B) -(N-max(A,B))),min(A,B))\n+print(min(A,B),max(0,min(A,B) -(N-max(A,B))))\n", "FL_content": " N,A,B=map(int,input().split())\n-print(max(0,min(A,B) -(N-max(A,B))),min(A,B))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u891946219", "problem_id": "p03139", "submission1_id": "s881976371", "submission2_id": "s453687838", "status1": "Wrong Answer", "status2": "Accepted", "code1": "if __name__ == '__main__':\n n, a, b = input().split()\n N, A, B = int(n), int(a), int(b)\n\n ans_max = min(A, B)\n\n n_mid = N / 2\n if A <= (n_mid) and B <= (n_mid):\n ans_min = 0\n else:\n ans_min = max((A - n_mid) + (B - n_mid), 0)\n\n print('{0} {1}'.format(ans_max, ans_min))\n", "code2": "if __name__ == '__main__':\n n, a, b = input().split()\n N, A, B = int(n), int(a), int(b)\n\n ans_max = min(A, B)\n\n if (A + B) <= N:\n ans_min = 0\n else:\n ans_min = max((A + B - N), 0)\n\n print('{0} {1}'.format(ans_max, ans_min))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1548647519", "date2": "1548647932", "bleu_score": "0.785504345005853", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 7, "total_score": 81, "input": "000 101 100\n", "actual_output": "100 201.0\n", "expected_output": "100 201\n\n", "anno_code": ["if __name__ == '__main__':\n n, a, b = input().split()\n N, A, B = int(n), int(a), int(b)\n\n ans_max = min(A, B)\n\n n_mid = N / 2\n if A <= (n_mid) and B <= (n_mid):\n ans_min = 0\n else:\n ans_min = max((A - n_mid) + (B - n_mid), 0)\n\n print('{0} {1}'.format(ans_max, ans_min))\n"], "anno_status": [true], "diff_content": " if __name__ == '__main__':\n n, a, b = input().split()\n N, A, B = int(n), int(a), int(b)\n \n ans_max = min(A, B)\n \n- n_mid = N / 2\n- if A <= (n_mid) and B <= (n_mid):\n+ if (A + B) <= N:\n ans_min = 0\n else:\n- ans_min = max((A - n_mid) + (B - n_mid), 0)\n+ ans_min = max((A + B - N), 0)\n \n print('{0} {1}'.format(ans_max, ans_min))\n \n", "FL_content": " if __name__ == '__main__':\n n, a, b = input().split()\n N, A, B = int(n), int(a), int(b)\n \n ans_max = min(A, B)\n \n- n_mid = N / 2\n- if A <= (n_mid) and B <= (n_mid):\n ans_min = 0\n else:\n- ans_min = max((A - n_mid) + (B - n_mid), 0)\n \n print('{0} {1}'.format(ans_max, ans_min))\n \n", "added_lines": 2, "removed_lines": 3, "code1_lines": 14 }, { "user_id": "u257162238", "problem_id": "p03139", "submission1_id": "s932118099", "submission2_id": "s101942790", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def read():\n N, A, B = map(int, input().strip().split())\n return N, A, B\n\n\ndef solve(N, A, B):\n intersect_max = min(A, B)\n intersect_min = max(0, A + B - N)\n return intersect_max, intersect_min\n\n\nif __name__ == '__main__':\n inputs = read()\n print(solve(*inputs))\n", "code2": "def read():\n N, A, B = map(int, input().strip().split())\n return N, A, B\n\n\ndef solve(N, A, B):\n intersect_max = min(A, B)\n intersect_min = max(0, A + B - N)\n return intersect_max, intersect_min\n\n\nif __name__ == '__main__':\n inputs = read()\n print(\"%d %d\" % solve(*inputs))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1548641554", "date2": "1548641686", "bleu_score": "0.9606603609978814", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 81, "input": "101 110 000\n", "actual_output": "(0, 9)\n", "expected_output": "0 9\n\n", "anno_code": ["def read(): # (0): read=\n N, A, B = map(int, input().strip().split())\n return N, A, B\n\n\ndef solve(N, A, B): # (1): solve=\n intersect_max = min(A, B)\n intersect_min = max(0, A + B - N)\n return intersect_max, intersect_min\n\n\nif __name__ == '__main__':\n inputs = read()\n print(solve(*inputs))\n"], "anno_status": [true], "diff_content": " def read():\n N, A, B = map(int, input().strip().split())\n return N, A, B\n \n \n def solve(N, A, B):\n intersect_max = min(A, B)\n intersect_min = max(0, A + B - N)\n return intersect_max, intersect_min\n \n \n if __name__ == '__main__':\n inputs = read()\n- print(solve(*inputs))\n+ print(\"%d %d\" % solve(*inputs))\n \n", "FL_content": " def read():\n N, A, B = map(int, input().strip().split())\n return N, A, B\n \n \n def solve(N, A, B):\n intersect_max = min(A, B)\n intersect_min = max(0, A + B - N)\n return intersect_max, intersect_min\n \n \n if __name__ == '__main__':\n inputs = read()\n- print(solve(*inputs))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u698919163", "problem_id": "p03502", "submission1_id": "s008358329", "submission2_id": "s590607008", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = input()\n\ntmp = 0\n\nfor i in range(len(N)):\n tmp += int(N[i])\n \nif tmp % int(N) == 0:\n print('Yes')\nelse:\n print('No')", "code2": "N = input()\n\ntmp = 0\n\nfor i in range(len(N)):\n tmp += int(N[i])\n \nif int(N) % tmp == 0:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586651229", "date2": "1586651291", "bleu_score": "0.9764628234955328", "code1_test_status": [1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 20, "total_score": 23, "input": "190\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N = input() # (0): N=190\n\ntmp = 0 # (1): tmp=0\n\nfor i in range(len(N)): # (2): i=0 (4): i=1 ... (8): NO CHANGE\n tmp += int(N[i]) # (3): tmp=1 (5): tmp=10 (7): NO CHANGE\n \nif tmp % int(N) == 0: # (9): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " N = input()\n \n tmp = 0\n \n for i in range(len(N)):\n tmp += int(N[i])\n \n-if tmp % int(N) == 0:\n+if int(N) % tmp == 0:\n print('Yes')\n else:\n print('No')\n", "FL_content": " N = input()\n \n tmp = 0\n \n for i in range(len(N)):\n tmp += int(N[i])\n \n-if tmp % int(N) == 0:\n print('Yes')\n else:\n print('No')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u317710033", "problem_id": "p03502", "submission1_id": "s707070557", "submission2_id": "s552824862", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = (input())\nnumber_2 = [int(s) for s in a]\ntotal = sum(number_2)\nprint(total)\nif int(a) % total == 0:\n print('Yes')\nelse:\n print('No')", "code2": "a = (input())\nnumber_2 = [int(s) for s in a]\ntotal = sum(number_2)\nif int(a) % total == 0:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567469159", "date2": "1567469219", "bleu_score": "0.8993728204180318", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 23, "input": "284\n", "actual_output": "14\nNo\n", "expected_output": "No\n\n", "anno_code": ["a = (input()) # (0): a=284\nnumber_2 = [int(s) for s in a] # (1): number_2=[2, 8, 4]\ntotal = sum(number_2) # (2): total=14\nprint(total) # (3): NO CHANGE\nif int(a) % total == 0: # (4): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " a = (input())\n number_2 = [int(s) for s in a]\n total = sum(number_2)\n-print(total)\n if int(a) % total == 0:\n print('Yes')\n else:\n print('No')\n", "FL_content": " a = (input())\n number_2 = [int(s) for s in a]\n total = sum(number_2)\n-print(total)\n if int(a) % total == 0:\n print('Yes')\n else:\n print('No')\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u046136258", "problem_id": "p03502", "submission1_id": "s393275944", "submission2_id": "s889441480", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nif int(s)%sum(map(int,list(s)))==0:\n\tprint('YES')\nelse:\n \tprint('NO')\n ", "code2": "s=input()\nif int(s)%sum(map(int,list(s)))==0:\n\tprint('Yes')\nelse:\n \tprint('No')\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1513052404", "date2": "1513052512", "bleu_score": "0.9273566911694289", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 23, "input": "151\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["s=input() # (0): s=151\nif int(s)%sum(map(int,list(s)))==0: # (1): NO CHANGE\n\tprint('YES')\nelse:\n \tprint('NO')\n "], "anno_status": [true], "diff_content": " s=input()\n if int(s)%sum(map(int,list(s)))==0:\n-\tprint('YES')\n+\tprint('Yes')\n else:\n- \tprint('NO')\n+ \tprint('No')\n \n", "FL_content": " s=input()\n if int(s)%sum(map(int,list(s)))==0:\n-\tprint('YES')\n else:\n- \tprint('NO')\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u776781549", "problem_id": "p03502", "submission1_id": "s590822939", "submission2_id": "s228727173", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = input()\nif int(n) % sum(list(map(int, n))) == 0:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "code2": "n = input()\nif int(n) % sum(list(map(int, n))) == 0:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512851965", "date2": "1512852052", "bleu_score": "0.9305163849527504", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 23, "input": "190\n", "actual_output": "YES\n", "expected_output": "Yes\n\n", "anno_code": ["n = input() # (0): n=190\nif int(n) % sum(list(map(int, n))) == 0: # (1): NO CHANGE\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")"], "anno_status": [true], "diff_content": " n = input()\n if int(n) % sum(list(map(int, n))) == 0:\n-\tprint(\"YES\")\n+\tprint(\"Yes\")\n else:\n-\tprint(\"NO\")\n+\tprint(\"No\")\n", "FL_content": " n = input()\n if int(n) % sum(list(map(int, n))) == 0:\n-\tprint(\"YES\")\n else:\n-\tprint(\"NO\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u375870553", "problem_id": "p03502", "submission1_id": "s504896544", "submission2_id": "s748504815", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n n=input()\n s=sum([int(i) for i in n])\n print(s)\n if int(n)%s==0:\n print(\"Yes\")\n else:\n print(\"No\")\n\nif __name__=='__main__':\n main()\n", "code2": "def main():\n n=input()\n s=sum([int(i) for i in n])\n if int(n)%s==0:\n print(\"Yes\")\n else:\n print(\"No\")\n\nif __name__=='__main__':\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512353218", "date2": "1512353292", "bleu_score": "0.9242359537041557", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 23, "input": "128\n", "actual_output": "11\nNo\n", "expected_output": "No\n\n", "anno_code": ["def main(): # (0): main=\n n=input()\n s=sum([int(i) for i in n])\n print(s)\n if int(n)%s==0:\n print(\"Yes\")\n else:\n print(\"No\")\n\nif __name__=='__main__':\n main()\n"], "anno_status": [true], "diff_content": " def main():\n n=input()\n s=sum([int(i) for i in n])\n- print(s)\n if int(n)%s==0:\n print(\"Yes\")\n else:\n print(\"No\")\n \n if __name__=='__main__':\n main()\n \n", "FL_content": " def main():\n n=input()\n s=sum([int(i) for i in n])\n- print(s)\n if int(n)%s==0:\n print(\"Yes\")\n else:\n print(\"No\")\n \n if __name__=='__main__':\n main()\n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u698567423", "problem_id": "p03502", "submission1_id": "s382296366", "submission2_id": "s357957216", "status1": "Wrong Answer", "status2": "Accepted", "code1": "num = int(input())\n\nfx = 0\nfor i in str(num):\n fx += int(i)\n\nprint(\"YES\" if num % fx == 0 else \"NO\")", "code2": "num = int(input())\n\nfx = 0\nfor i in str(num):\n fx += int(i)\n\nprint(\"Yes\" if num % fx == 0 else \"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512441117", "date2": "1512441148", "bleu_score": "0.9429358793263002", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 23, "input": "1075\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["num = int(input()) # (0): num=1075\n\nfx = 0 # (1): fx=0\nfor i in str(num): # (2): i=1 (4): i=0 ... (10): NO CHANGE\n fx += int(i) # (3): fx=1 (5): NO CHANGE ... (9): fx=13\n\nprint(\"YES\" if num % fx == 0 else \"NO\")"], "anno_status": [true], "diff_content": " num = int(input())\n \n fx = 0\n for i in str(num):\n fx += int(i)\n \n-print(\"YES\" if num % fx == 0 else \"NO\")\n+print(\"Yes\" if num % fx == 0 else \"No\")\n", "FL_content": " num = int(input())\n \n fx = 0\n for i in str(num):\n fx += int(i)\n \n-print(\"YES\" if num % fx == 0 else \"NO\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u207799478", "problem_id": "p03502", "submission1_id": "s211198937", "submission2_id": "s916157731", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nimport string\n\n\ndef readints():\n return list(map(int, input().split()))\n\n\ndef nCr(n, r):\n return math.factorial(n)\n\n\ndef has_duplicates2(seq):\n seen = []\n for item in seq:\n if not(item in seen):\n seen.append(item)\n return len(seq) != len(seen)\n\n\ndef divisor(n):\n divisor = []\n for i in range(1, n+1):\n if n % i == 0:\n divisor.append(i)\n return divisor\n\n\n\ndx = [-1, -1, -1, 0, 0, 1, 1, 1]\ndy = [-1, 0, 1, -1, 1, -1, 0, 1]\n\nn = input()\nprint(n)\nprint(sum(map(int, n)))\nx = sum(map(int, n))\nprint(int(n)/x)\n\nif int(n) % sum(map(int, n)) == 0:\n print('Yes')\n exit()\nelse:\n print('No')\n", "code2": "import math\nimport string\n\n\ndef readints():\n return list(map(int, input().split()))\n\n\ndef nCr(n, r):\n return math.factorial(n)\n\n\ndef has_duplicates2(seq):\n seen = []\n for item in seq:\n if not(item in seen):\n seen.append(item)\n return len(seq) != len(seen)\n\n\ndef divisor(n):\n divisor = []\n for i in range(1, n+1):\n if n % i == 0:\n divisor.append(i)\n return divisor\n\n\n\ndx = [-1, -1, -1, 0, 0, 1, 1, 1]\ndy = [-1, 0, 1, -1, 1, -1, 0, 1]\n\nn = input()\n\n\nx = sum(map(int, n))\n\n\nif int(n) % sum(map(int, n)) == 0:\n print('Yes')\n exit()\nelse:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584924489", "date2": "1584924575", "bleu_score": "0.9227443581959335", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 23, "input": "172\n", "actual_output": "172\n10\n17.2\nNo\n", "expected_output": "No\n\n", "anno_code": ["import math\nimport string\n\n\ndef readints(): # (0): readints=\n return list(map(int, input().split()))\n\n\ndef nCr(n, r): # (1): nCr=\n return math.factorial(n)\n\n\ndef has_duplicates2(seq): # (2): has_duplicates2=\n seen = []\n for item in seq:\n if not(item in seen):\n seen.append(item)\n return len(seq) != len(seen)\n\n\ndef divisor(n): # (3): divisor=\n divisor = []\n for i in range(1, n+1):\n if n % i == 0:\n divisor.append(i)\n return divisor\n\n\n\ndx = [-1, -1, -1, 0, 0, 1, 1, 1] # (4): dx=[-1, -1, -1, 0, 0, 1, 1, 1]\ndy = [-1, 0, 1, -1, 1, -1, 0, 1] # (5): dy=[-1, 0, 1, -1, 1, -1, 0, 1]\n\nn = input() # (6): n=172\nprint(n) # (7): NO CHANGE\nprint(sum(map(int, n))) # (8): NO CHANGE\nx = sum(map(int, n)) # (9): x=10\nprint(int(n)/x) # (10): NO CHANGE\n\nif int(n) % sum(map(int, n)) == 0: # (11): NO CHANGE\n print('Yes')\n exit()\nelse:\n print('No')\n"], "anno_status": [true], "diff_content": " import math\n import string\n \n \n def readints():\n return list(map(int, input().split()))\n \n \n def nCr(n, r):\n return math.factorial(n)\n \n \n def has_duplicates2(seq):\n seen = []\n for item in seq:\n if not(item in seen):\n seen.append(item)\n return len(seq) != len(seen)\n \n \n def divisor(n):\n divisor = []\n for i in range(1, n+1):\n if n % i == 0:\n divisor.append(i)\n return divisor\n \n \n \n dx = [-1, -1, -1, 0, 0, 1, 1, 1]\n dy = [-1, 0, 1, -1, 1, -1, 0, 1]\n \n n = input()\n-print(n)\n-print(sum(map(int, n)))\n+\n+\n x = sum(map(int, n))\n-print(int(n)/x)\n+\n \n if int(n) % sum(map(int, n)) == 0:\n print('Yes')\n exit()\n else:\n print('No')\n \n", "FL_content": " import math\n import string\n \n \n def readints():\n return list(map(int, input().split()))\n \n \n def nCr(n, r):\n return math.factorial(n)\n \n \n def has_duplicates2(seq):\n seen = []\n for item in seq:\n if not(item in seen):\n seen.append(item)\n return len(seq) != len(seen)\n \n \n def divisor(n):\n divisor = []\n for i in range(1, n+1):\n if n % i == 0:\n divisor.append(i)\n return divisor\n \n \n \n dx = [-1, -1, -1, 0, 0, 1, 1, 1]\n dy = [-1, 0, 1, -1, 1, -1, 0, 1]\n \n n = input()\n-print(n)\n-print(sum(map(int, n)))\n x = sum(map(int, n))\n-print(int(n)/x)\n \n if int(n) % sum(map(int, n)) == 0:\n print('Yes')\n exit()\n else:\n print('No')\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 44 }, { "user_id": "u464912173", "problem_id": "p03502", "submission1_id": "s057500996", "submission2_id": "s598976347", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = input()\n\ni = 0\n\nfor i in range(len(a)):\n i += int(a[i])\n\nprint('Yes' if int(a)%i ==0 else 'No')", "code2": "a = input()\nx = 0\nfor i in range(len(a)):\n x += int(a[i])\nprint(\"Yes\" if int(a) % x == 0 else \"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567657926", "date2": "1567658305", "bleu_score": "0.7409704828015635", "code1_test_status": [1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0], "code1_test_score": 15, "total_score": 23, "input": "561\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["a = input() # (0): a=561\n\ni = 0 # (1): i=0\n\nfor i in range(len(a)): # (2): NO CHANGE (4): i=1 ... (8): NO CHANGE\n i += int(a[i]) # (3): i=5 (5): i=7 (7): i=3\n\nprint('Yes' if int(a)%i ==0 else 'No')"], "anno_status": [true], "diff_content": " a = input()\n-\n-i = 0\n-\n+x = 0\n for i in range(len(a)):\n- i += int(a[i])\n-\n-print('Yes' if int(a)%i ==0 else 'No')\n+ x += int(a[i])\n+print(\"Yes\" if int(a) % x == 0 else \"No\")\n", "FL_content": " a = input()\n-\n-i = 0\n-\n for i in range(len(a)):\n- i += int(a[i])\n-\n-print('Yes' if int(a)%i ==0 else 'No')\n", "added_lines": 3, "removed_lines": 6, "code1_lines": 8 }, { "user_id": "u762557532", "problem_id": "p03502", "submission1_id": "s047722906", "submission2_id": "s223480304", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\n\n\n\n\n\nimport sys\n\ndef input(): return sys.stdin.readline().rstrip()\ndef iIn(): return int(input())\ndef iInM(): return map(int, input().split())\ndef iInM1(): return map(int1, input().split())\ndef iInLH(): return list(map(int, input().split()))\ndef iInLH1(): return list(map(int1, input().split()))\ndef iInLV(n): return [iIn() for _ in range(n)]\ndef iInLV1(n): return [iIn()-1 for _ in range(n)]\ndef iInLD(n): return [iInLH() for _ in range(n)]\ndef iInLD1(n): return [iInLH1() for _ in range(n)]\ndef sInLH(): return list(input().split())\ndef sInLV(n): return [input().rstrip('\\n') for _ in range(n)]\ndef sInLD(n): return [sInLH() for _ in range(n)]\n\ndef OutH(lst, deli=' '): print(deli.join(map(str, lst)))\ndef OutV(lst): print('\\n'.join(map(str, lst)))\n\nsys.setrecursionlimit(10 ** 6)\n\nint1 = lambda x: int(x) - 1\n\nINF = int(1e9)\nMOD = 1000000007\ndx = (-1, 0, 1, 0)\ndy = (0, -1, 0, 1)\n\n\nN = iIn()\n\nfN = sum(list(map(int, list(str(N)))))\n\nans = 'Yes' if N == fN else 'No'\n\nprint(ans)", "code2": "\n\n\n\n\n\n\n\n\n\nimport sys\n\ndef input(): return sys.stdin.readline().rstrip()\ndef iIn(): return int(input())\ndef iInM(): return map(int, input().split())\ndef iInM1(): return map(int1, input().split())\ndef iInLH(): return list(map(int, input().split()))\ndef iInLH1(): return list(map(int1, input().split()))\ndef iInLV(n): return [iIn() for _ in range(n)]\ndef iInLV1(n): return [iIn()-1 for _ in range(n)]\ndef iInLD(n): return [iInLH() for _ in range(n)]\ndef iInLD1(n): return [iInLH1() for _ in range(n)]\ndef sInLH(): return list(input().split())\ndef sInLV(n): return [input().rstrip('\\n') for _ in range(n)]\ndef sInLD(n): return [sInLH() for _ in range(n)]\n\ndef OutH(lst, deli=' '): print(deli.join(map(str, lst)))\ndef OutV(lst): print('\\n'.join(map(str, lst)))\n\nsys.setrecursionlimit(10 ** 6)\n\nint1 = lambda x: int(x) - 1\n\nINF = int(1e9)\nMOD = 1000000007\ndx = (-1, 0, 1, 0)\ndy = (0, -1, 0, 1)\n\n\nN = iIn()\n\nfN = sum(list(map(int, list(str(N)))))\n\nans = 'Yes' if N % fN == 0 else 'No'\n\nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593828803", "date2": "1593828836", "bleu_score": "0.9941728506855295", "code1_test_status": [1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 20, "total_score": 23, "input": "117\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["\n\n\n\n\n\n\n\n\n\nimport sys\n\ndef input(): return sys.stdin.readline().rstrip()\ndef iIn(): return int(input())\ndef iInM(): return map(int, input().split())\ndef iInM1(): return map(int1, input().split())\ndef iInLH(): return list(map(int, input().split()))\ndef iInLH1(): return list(map(int1, input().split()))\ndef iInLV(n): return [iIn() for _ in range(n)]\ndef iInLV1(n): return [iIn()-1 for _ in range(n)]\ndef iInLD(n): return [iInLH() for _ in range(n)]\ndef iInLD1(n): return [iInLH1() for _ in range(n)]\ndef sInLH(): return list(input().split())\ndef sInLV(n): return [input().rstrip('\\n') for _ in range(n)]\ndef sInLD(n): return [sInLH() for _ in range(n)]\n\ndef OutH(lst, deli=' '): print(deli.join(map(str, lst))) # (0): OutH=\ndef OutV(lst): print('\\n'.join(map(str, lst))) # (1): OutV=\n\nsys.setrecursionlimit(10 ** 6) # (2): NO CHANGE\n\nint1 = lambda x: int(x) - 1 # (3): int1= at 0x000001E85AD3A3B0>\n\nINF = int(1e9) # (4): INF=1000000000\nMOD = 1000000007 # (5): MOD=1000000007\ndx = (-1, 0, 1, 0) # (6): dx=(-1, 0, 1, 0)\ndy = (0, -1, 0, 1) # (7): dy=(0, -1, 0, 1)\n\n\nN = iIn() # (8): N=117\n\nfN = sum(list(map(int, list(str(N))))) # (9): fN=9\n\nans = 'Yes' if N == fN else 'No' # (10): ans=No\n\nprint(ans)"], "anno_status": [true], "diff_content": " \n \n \n \n \n \n \n \n \n \n import sys\n \n def input(): return sys.stdin.readline().rstrip()\n def iIn(): return int(input())\n def iInM(): return map(int, input().split())\n def iInM1(): return map(int1, input().split())\n def iInLH(): return list(map(int, input().split()))\n def iInLH1(): return list(map(int1, input().split()))\n def iInLV(n): return [iIn() for _ in range(n)]\n def iInLV1(n): return [iIn()-1 for _ in range(n)]\n def iInLD(n): return [iInLH() for _ in range(n)]\n def iInLD1(n): return [iInLH1() for _ in range(n)]\n def sInLH(): return list(input().split())\n def sInLV(n): return [input().rstrip('\\n') for _ in range(n)]\n def sInLD(n): return [sInLH() for _ in range(n)]\n \n def OutH(lst, deli=' '): print(deli.join(map(str, lst)))\n def OutV(lst): print('\\n'.join(map(str, lst)))\n \n sys.setrecursionlimit(10 ** 6)\n \n int1 = lambda x: int(x) - 1\n \n INF = int(1e9)\n MOD = 1000000007\n dx = (-1, 0, 1, 0)\n dy = (0, -1, 0, 1)\n \n \n N = iIn()\n \n fN = sum(list(map(int, list(str(N)))))\n \n-ans = 'Yes' if N == fN else 'No'\n+ans = 'Yes' if N % fN == 0 else 'No'\n \n print(ans)\n", "FL_content": " \n \n \n \n \n \n \n \n \n \n import sys\n \n def input(): return sys.stdin.readline().rstrip()\n def iIn(): return int(input())\n def iInM(): return map(int, input().split())\n def iInM1(): return map(int1, input().split())\n def iInLH(): return list(map(int, input().split()))\n def iInLH1(): return list(map(int1, input().split()))\n def iInLV(n): return [iIn() for _ in range(n)]\n def iInLV1(n): return [iIn()-1 for _ in range(n)]\n def iInLD(n): return [iInLH() for _ in range(n)]\n def iInLD1(n): return [iInLH1() for _ in range(n)]\n def sInLH(): return list(input().split())\n def sInLV(n): return [input().rstrip('\\n') for _ in range(n)]\n def sInLD(n): return [sInLH() for _ in range(n)]\n \n def OutH(lst, deli=' '): print(deli.join(map(str, lst)))\n def OutV(lst): print('\\n'.join(map(str, lst)))\n \n sys.setrecursionlimit(10 ** 6)\n \n int1 = lambda x: int(x) - 1\n \n INF = int(1e9)\n MOD = 1000000007\n dx = (-1, 0, 1, 0)\n dy = (0, -1, 0, 1)\n \n \n N = iIn()\n \n fN = sum(list(map(int, list(str(N)))))\n \n-ans = 'Yes' if N == fN else 'No'\n \n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 46 }, { "user_id": "u643081547", "problem_id": "p03502", "submission1_id": "s089729165", "submission2_id": "s130503007", "status1": "Wrong Answer", "status2": "Accepted", "code1": "num=input()\ns=0\nfor it in num:\n s+=int(it)\nprint(s)\nnum=int(num)\nprint(\"Yes\" if num%s==0 else \"No\")\n\n", "code2": "num=input()\ns=0\nfor it in num:\n s+=int(it)\nnum=int(num)\nprint(\"Yes\" if num%s==0 else \"No\")\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574100878", "date2": "1574100923", "bleu_score": "0.907130362617298", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 23, "input": "128\n", "actual_output": "11\nNo\n", "expected_output": "No\n\n", "anno_code": ["num=input() # (0): num=128\ns=0 # (1): s=0\nfor it in num: # (2): it=1 (4): it=2 ... (8): NO CHANGE\n s+=int(it) # (3): s=1 (5): s=3 (7): s=11\nprint(s) # (9): NO CHANGE\nnum=int(num) # (10): num=128\nprint(\"Yes\" if num%s==0 else \"No\")\n\n"], "anno_status": [true], "diff_content": " num=input()\n s=0\n for it in num:\n s+=int(it)\n-print(s)\n num=int(num)\n print(\"Yes\" if num%s==0 else \"No\")\n \n \n", "FL_content": " num=input()\n s=0\n for it in num:\n s+=int(it)\n-print(s)\n num=int(num)\n print(\"Yes\" if num%s==0 else \"No\")\n \n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u271063202", "problem_id": "p03856", "submission1_id": "s072710668", "submission2_id": "s494984464", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nn = len(s)\nidx = 0\nwhile idx < n:\n if idx+5 <= n and s[idx:idx+5] == 'dream':\n idx += 5\n elif s[idx:idx+4] == 'eras':\n idx += 4\n else:\n break\n if idx+2 <= n and s[idx:idx+2] == 'er' and (idx+2 == n or s[idx+2:idx+3] != 'a'):\n idx += 2\nif idx == n:\n print('YES')\nelse:\n print('NO')", "code2": "s = input()\nn = len(s)\nidx = 0\nwhile idx < n:\n if idx+5 > n:\n break\n if s[idx:idx+5] == 'dream':\n idx += 5\n if idx+2 <= n and s[idx:idx+2] == 'er' and (idx+2 == n or s[idx+2:idx+3] != 'a'):\n idx += 2\n elif s[idx:idx+5] == 'erase':\n idx += 5\n if idx+1 <= n and s[idx:idx+1] == 'r':\n idx += 1\n else:\n break\n\nif idx == n:\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586454252", "date2": "1586454568", "bleu_score": "0.7611704023111397", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "NO\n", "expected_output": "YES\n", "anno_code": ["s = input() # (0): s=erasedream\nn = len(s) # (1): n=10\nidx = 0 # (2): idx=0\nwhile idx < n: # (3): NO CHANGE (8): NO CHANGE\n if idx+5 <= n and s[idx:idx+5] == 'dream': # (4): NO CHANGE (9): NO CHANGE\n idx += 5\n elif s[idx:idx+4] == 'eras': # (5): NO CHANGE (10): NO CHANGE\n idx += 4 # (6): idx=4\n else:\n break # (11): NO CHANGE\n if idx+2 <= n and s[idx:idx+2] == 'er' and (idx+2 == n or s[idx+2:idx+3] != 'a'): # (7): NO CHANGE\n idx += 2\nif idx == n: # (12): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " s = input()\n n = len(s)\n idx = 0\n while idx < n:\n- if idx+5 <= n and s[idx:idx+5] == 'dream':\n+ if idx+5 > n:\n+ break\n+ if s[idx:idx+5] == 'dream':\n+ idx += 5\n+ if idx+2 <= n and s[idx:idx+2] == 'er' and (idx+2 == n or s[idx+2:idx+3] != 'a'):\n+ idx += 2\n+ elif s[idx:idx+5] == 'erase':\n idx += 5\n- elif s[idx:idx+4] == 'eras':\n- idx += 4\n+ if idx+1 <= n and s[idx:idx+1] == 'r':\n+ idx += 1\n else:\n break\n- if idx+2 <= n and s[idx:idx+2] == 'er' and (idx+2 == n or s[idx+2:idx+3] != 'a'):\n- idx += 2\n+\n if idx == n:\n print('YES')\n else:\n print('NO')\n", "FL_content": " s = input()\n n = len(s)\n idx = 0\n while idx < n:\n- if idx+5 <= n and s[idx:idx+5] == 'dream':\n idx += 5\n- elif s[idx:idx+4] == 'eras':\n- idx += 4\n else:\n break\n- if idx+2 <= n and s[idx:idx+2] == 'er' and (idx+2 == n or s[idx+2:idx+3] != 'a'):\n- idx += 2\n if idx == n:\n print('YES')\n else:\n print('NO')\n", "added_lines": 10, "removed_lines": 5, "code1_lines": 16 }, { "user_id": "u398942100", "problem_id": "p03856", "submission1_id": "s378434884", "submission2_id": "s392177239", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input().replace('eraser','').replace('erase','').replace('dreamer','').replace('dream','')\nif S == '':\n print('Yes')\nelse:\n print('No')", "code2": "S = input().replace('eraser','').replace('erase','').replace('dreamer','').replace('dream','')\nif S == '':\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1542857694", "date2": "1542857736", "bleu_score": "0.9597276205623526", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "Yes\n", "expected_output": "YES\n", "anno_code": ["S = input().replace('eraser','').replace('erase','').replace('dreamer','').replace('dream','') # (0): S=\nif S == '': # (1): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " S = input().replace('eraser','').replace('erase','').replace('dreamer','').replace('dream','')\n if S == '':\n- print('Yes')\n+ print('YES')\n else:\n- print('No')\n+ print('NO')\n", "FL_content": " S = input().replace('eraser','').replace('erase','').replace('dreamer','').replace('dream','')\n if S == '':\n- print('Yes')\n else:\n- print('No')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u558528117", "problem_id": "p03856", "submission1_id": "s120247655", "submission2_id": "s023355238", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\ndef solve(s):\n sys.stderr.write(s)\n sys.stderr.write(\"\\n\")\n\n while(len(s) >= 1):\n if s == \"\":\n return True\n elif s.startswith(\"maerd\"):\n s = s[5:]\n elif s.startswith(\"remaerd\"):\n s = s[7:]\n elif s.startswith(\"esare\"):\n s = s[5:]\n elif s.startswith(\"resare\"):\n s = s[6:]\n else:\n return False\n\n\n\ndef main():\n line = sys.stdin.readline().rstrip()\n line_rev = line[::-1]\n\n if solve(line):\n print(\"YES\")\n else:\n print(\"NO\")\n\n return 0\n\nif __name__ == '__main__':\n sys.exit(main())\n", "code2": "import sys\n\ndef solve(s):\n tmp_s = s\n while(len(tmp_s) > 0):\n if tmp_s.startswith(\"maerd\"):\n tmp_s = tmp_s[5:]\n elif tmp_s.startswith(\"remaerd\"):\n tmp_s = tmp_s[7:]\n elif tmp_s.startswith(\"esare\"):\n tmp_s = tmp_s[5:]\n elif tmp_s.startswith(\"resare\"):\n tmp_s = tmp_s[6:]\n else:\n return False\n\n return True\n\ndef main():\n line = sys.stdin.readline().rstrip()\n line_rev = line[::-1]\n\n if solve(line_rev):\n print(\"YES\")\n else:\n print(\"NO\")\n\n return 0\n\nif __name__ == '__main__':\n sys.exit(main())\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1492947783", "date2": "1492948313", "bleu_score": "0.839662200924308", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "NO\n", "expected_output": "YES\n", "anno_code": ["import sys\n\ndef solve(s): # (0): solve=\n sys.stderr.write(s)\n sys.stderr.write(\"\\n\")\n\n while(len(s) >= 1):\n if s == \"\":\n return True\n elif s.startswith(\"maerd\"):\n s = s[5:]\n elif s.startswith(\"remaerd\"):\n s = s[7:]\n elif s.startswith(\"esare\"):\n s = s[5:]\n elif s.startswith(\"resare\"):\n s = s[6:]\n else:\n return False\n\n\n\ndef main(): # (1): main=\n line = sys.stdin.readline().rstrip()\n line_rev = line[::-1]\n\n if solve(line):\n print(\"YES\")\n else:\n print(\"NO\")\n\n return 0\n\nif __name__ == '__main__':\n sys.exit(main())\n"], "anno_status": [true], "diff_content": " import sys\n \n def solve(s):\n- sys.stderr.write(s)\n- sys.stderr.write(\"\\n\")\n-\n- while(len(s) >= 1):\n- if s == \"\":\n- return True\n- elif s.startswith(\"maerd\"):\n- s = s[5:]\n- elif s.startswith(\"remaerd\"):\n- s = s[7:]\n- elif s.startswith(\"esare\"):\n- s = s[5:]\n- elif s.startswith(\"resare\"):\n- s = s[6:]\n+ tmp_s = s\n+ while(len(tmp_s) > 0):\n+ if tmp_s.startswith(\"maerd\"):\n+ tmp_s = tmp_s[5:]\n+ elif tmp_s.startswith(\"remaerd\"):\n+ tmp_s = tmp_s[7:]\n+ elif tmp_s.startswith(\"esare\"):\n+ tmp_s = tmp_s[5:]\n+ elif tmp_s.startswith(\"resare\"):\n+ tmp_s = tmp_s[6:]\n else:\n return False\n \n-\n+ return True\n \n def main():\n line = sys.stdin.readline().rstrip()\n line_rev = line[::-1]\n \n- if solve(line):\n+ if solve(line_rev):\n print(\"YES\")\n else:\n print(\"NO\")\n \n return 0\n \n if __name__ == '__main__':\n sys.exit(main())\n \n", "FL_content": " import sys\n \n def solve(s):\n- sys.stderr.write(s)\n- sys.stderr.write(\"\\n\")\n-\n- while(len(s) >= 1):\n- if s == \"\":\n- return True\n- elif s.startswith(\"maerd\"):\n- s = s[5:]\n- elif s.startswith(\"remaerd\"):\n- s = s[7:]\n- elif s.startswith(\"esare\"):\n- s = s[5:]\n- elif s.startswith(\"resare\"):\n- s = s[6:]\n else:\n return False\n \n-\n \n def main():\n line = sys.stdin.readline().rstrip()\n line_rev = line[::-1]\n \n- if solve(line):\n print(\"YES\")\n else:\n print(\"NO\")\n \n return 0\n \n if __name__ == '__main__':\n sys.exit(main())\n \n", "added_lines": 12, "removed_lines": 16, "code1_lines": 36 }, { "user_id": "u780475861", "problem_id": "p03856", "submission1_id": "s755934755", "submission2_id": "s393470762", "status1": "Wrong Answer", "status2": "Accepted", "code1": "if not input().replace('eraser', '').replace('erase', '').replace('dream', '').replace('dreamer', ''):\n print('Yes')\nelse:\n print('No')", "code2": "if not input().replace('eraser', '').replace('erase', '').replace('dreamer', '').replace('dream', ''):\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589869603", "date2": "1589869692", "bleu_score": "0.9573365533289768", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "Yes\n", "expected_output": "YES\n", "anno_code": ["if not input().replace('eraser', '').replace('erase', '').replace('dream', '').replace('dreamer', ''): # (0): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": "-if not input().replace('eraser', '').replace('erase', '').replace('dream', '').replace('dreamer', ''):\n- print('Yes')\n+if not input().replace('eraser', '').replace('erase', '').replace('dreamer', '').replace('dream', ''):\n+ print('YES')\n else:\n- print('No')\n+ print('NO')\n", "FL_content": "-if not input().replace('eraser', '').replace('erase', '').replace('dream', '').replace('dreamer', ''):\n- print('Yes')\n else:\n- print('No')\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 4 }, { "user_id": "u882620594", "problem_id": "p03856", "submission1_id": "s972951566", "submission2_id": "s625821798", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\n\nS = input()\nindex = len(S)\nwhile index >= 7:\n five = S[index-5:index]\n six = S[index-6:index]\n seven = S[index-7:index]\n if five == \"dream\" or five == \"erase\":\n index -= 5\n elif six == \"eraser\":\n index -= 6\n elif seven == \"dreamer\":\n index -= 7\n else:\n print(\"NO\")\n sys.exit()\n\nlast = S[:index]\n\n\n\n", "code2": "\nimport sys\n\nS = input()\nindex = len(S)\nwhile index > 7:\n five = S[index-5:index]\n six = S[index-6:index]\n seven = S[index-7:index]\n if five == \"dream\" or five == \"erase\":\n index -= 5\n elif six == \"eraser\":\n index -= 6\n elif seven == \"dreamer\":\n index -= 7\n else:\n print(\"NO\")\n sys.exit()\n\nlast = S[:index]\nif last == \"dream\" or last == \"erase\" or last == \"eraser\" or last == \"dreamer\":\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1562989404", "date2": "1562989521", "bleu_score": "0.7533501757523471", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "no output\n", "expected_output": "YES\n", "anno_code": ["\nimport sys\n\nS = input() # (0): S=erasedream\nindex = len(S) # (1): index=10\nwhile index >= 7: # (2): NO CHANGE (8): NO CHANGE\n five = S[index-5:index] # (3): five=dream\n six = S[index-6:index] # (4): six=edream\n seven = S[index-7:index] # (5): seven=sedream\n if five == \"dream\" or five == \"erase\": # (6): NO CHANGE\n index -= 5 # (7): index=5\n elif six == \"eraser\":\n index -= 6\n elif seven == \"dreamer\":\n index -= 7\n else:\n print(\"NO\")\n sys.exit()\n\nlast = S[:index]\n\n\n\n"], "anno_status": [true], "diff_content": " \n import sys\n \n S = input()\n index = len(S)\n-while index >= 7:\n+while index > 7:\n five = S[index-5:index]\n six = S[index-6:index]\n seven = S[index-7:index]\n if five == \"dream\" or five == \"erase\":\n index -= 5\n elif six == \"eraser\":\n index -= 6\n elif seven == \"dreamer\":\n index -= 7\n else:\n print(\"NO\")\n sys.exit()\n \n last = S[:index]\n-\n-\n-\n-\n+if last == \"dream\" or last == \"erase\" or last == \"eraser\" or last == \"dreamer\":\n+ print(\"YES\")\n+else:\n+ print(\"NO\")\n", "FL_content": " \n import sys\n \n S = input()\n index = len(S)\n-while index >= 7:\n five = S[index-5:index]\n six = S[index-6:index]\n seven = S[index-7:index]\n if five == \"dream\" or five == \"erase\":\n index -= 5\n elif six == \"eraser\":\n index -= 6\n elif seven == \"dreamer\":\n index -= 7\n else:\n print(\"NO\")\n sys.exit()\n \n last = S[:index]\n-\n-\n-\n-\n", "added_lines": 5, "removed_lines": 5, "code1_lines": 24 }, { "user_id": "u426108351", "problem_id": "p03856", "submission1_id": "s351418852", "submission2_id": "s062849386", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(input())\ns.reverse()\ns = ''.join(map(str, s))\ncount = 0\nword = ['maerd', 'remaerd', 'resare', 'esare']\n\nwhile count <= len(s)-8:\n counttemp = count\n for i in range(4):\n w = word[i]\n if s[count:count+len(w)] == w:\n count += len(w)\n if counttemp == count:\n break\nif s[count:] in word:\n print('YES')\nelse:\n print('NO')\n \n", "code2": "s = list(input())\ns.reverse()\ns = ''.join(map(str, s))\ncount = 0\nword = ['maerd', 'remaerd', 'resare', 'esare']\n\nwhile count <= len(s)-8:\n counttemp = count\n for i in range(4):\n w = word[i]\n if s[count:count+len(w)] == w:\n count += len(w)\n if counttemp == count:\n break\n\nif s[count:] in word or s[count:] =='':\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564100331", "date2": "1564100504", "bleu_score": "0.943752597231175", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "NO\n", "expected_output": "YES\n", "anno_code": ["s = list(input()) # (0): s=['e', 'r', 'a', 's', 'e', 'd', 'r', 'e', 'a', 'm']\ns.reverse() # (1): s=['m', 'a', 'e', 'r', 'd', 'e', 's', 'a', 'r', 'e']\ns = ''.join(map(str, s)) # (2): s=maerdesare\ncount = 0 # (3): count=0\nword = ['maerd', 'remaerd', 'resare', 'esare'] # (4): word=['maerd', 'remaerd', 'resare', 'esare']\n\nwhile count <= len(s)-8: # (5): NO CHANGE (23): NO CHANGE\n counttemp = count # (6): counttemp=0\n for i in range(4): # (7): i=0 (11): i=1 ... (21): NO CHANGE\n w = word[i] # (8): w=maerd (12): w=remaerd ... (18): w=esare\n if s[count:count+len(w)] == w: # (9): NO CHANGE (13): NO CHANGE ... (19): NO CHANGE\n count += len(w) # (10): count=5 (20): count=10\n if counttemp == count: # (22): NO CHANGE\n break\nif s[count:] in word: # (24): NO CHANGE\n print('YES')\nelse:\n print('NO')\n \n"], "anno_status": [true], "diff_content": " s = list(input())\n s.reverse()\n s = ''.join(map(str, s))\n count = 0\n word = ['maerd', 'remaerd', 'resare', 'esare']\n \n while count <= len(s)-8:\n counttemp = count\n for i in range(4):\n w = word[i]\n if s[count:count+len(w)] == w:\n count += len(w)\n if counttemp == count:\n break\n-if s[count:] in word:\n+\n+if s[count:] in word or s[count:] =='':\n print('YES')\n else:\n print('NO')\n- \n-\n", "FL_content": " s = list(input())\n s.reverse()\n s = ''.join(map(str, s))\n count = 0\n word = ['maerd', 'remaerd', 'resare', 'esare']\n \n while count <= len(s)-8:\n counttemp = count\n for i in range(4):\n w = word[i]\n if s[count:count+len(w)] == w:\n count += len(w)\n if counttemp == count:\n break\n-if s[count:] in word:\n print('YES')\n else:\n print('NO')\n- \n-\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 20 }, { "user_id": "u875291233", "problem_id": "p03856", "submission1_id": "s486448055", "submission2_id": "s184292901", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\nread = sys.stdin.read\nreadline = sys.stdin.readline\n\n\n\n\ns = [*input()]\na = [*\"dream\"]\nb = [*\"dreamer\"]\nc = [*\"erase\"]\nd = [*\"eraser\"]\n\n\nwhile True:\n if not s:\n print(\"Yes\")\n break\n elif s[-5:] == a:\n for _ in range(5): s.pop()\n elif s[-5:] == c:\n for _ in range(5): s.pop()\n elif s[-6:] == b:\n for _ in range(6): s.pop()\n elif s[-6:] == d:\n for _ in range(6): s.pop()\n else:\n print(\"No\")\n break\n\n\n\n\n\n", "code2": "\n\nimport sys\nread = sys.stdin.read\nreadline = sys.stdin.readline\n\n\n\n\ns = [*input()]\na = [*\"dream\"]\nb = [*\"dreamer\"]\nc = [*\"erase\"]\nd = [*\"eraser\"]\n\nwhile True:\n if not s:\n print(\"YES\")\n break\n elif s[-5:] == a:\n for _ in range(5): s.pop()\n elif s[-5:] == c:\n for _ in range(5): s.pop()\n elif s[-7:] == b:\n for _ in range(7): s.pop()\n elif s[-6:] == d:\n for _ in range(6): s.pop()\n else:\n print(\"NO\")\n break\n\n\n\n\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593290500", "date2": "1593290797", "bleu_score": "0.972638483673835", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "Yes\n", "expected_output": "YES\n", "anno_code": ["\n\nimport sys\nread = sys.stdin.read # (0): read=\nreadline = sys.stdin.readline # (1): readline=\n\n\n\n\ns = [*input()] # (2): s=['e', 'r', 'a', 's', 'e', 'd', 'r', 'e', 'a', 'm']\na = [*\"dream\"] # (3): a=['d', 'r', 'e', 'a', 'm']\nb = [*\"dreamer\"] # (4): b=['d', 'r', 'e', 'a', 'm', 'e', 'r']\nc = [*\"erase\"] # (5): c=['e', 'r', 'a', 's', 'e']\nd = [*\"eraser\"] # (6): d=['e', 'r', 'a', 's', 'e', 'r']\n\n\nwhile True: # (7): NO CHANGE (16): NO CHANGE (26): NO CHANGE\n if not s: # (8): NO CHANGE (17): NO CHANGE (27): NO CHANGE\n print(\"Yes\") # (28): NO CHANGE\n break\n elif s[-5:] == a: # (9): NO CHANGE (18): NO CHANGE\n for _ in range(5): s.pop() # (10): s=['e', 'r', 'a', 's', 'e', 'd', 'r', 'e', 'a'], _=0 (11): s=['e', 'r', 'a', 's', 'e', 'd', 'r', 'e'], _=1 ... (15): NO CHANGE\n elif s[-5:] == c: # (19): NO CHANGE\n for _ in range(5): s.pop() # (20): s=['e', 'r', 'a', 's'], _=0 (21): s=['e', 'r', 'a'], _=1 ... (25): NO CHANGE\n elif s[-6:] == b:\n for _ in range(6): s.pop()\n elif s[-6:] == d:\n for _ in range(6): s.pop()\n else:\n print(\"No\")\n break\n\n\n\n\n\n"], "anno_status": [true], "diff_content": " \n \n import sys\n read = sys.stdin.read\n readline = sys.stdin.readline\n \n \n \n \n s = [*input()]\n a = [*\"dream\"]\n b = [*\"dreamer\"]\n c = [*\"erase\"]\n d = [*\"eraser\"]\n \n-\n while True:\n if not s:\n- print(\"Yes\")\n+ print(\"YES\")\n break\n elif s[-5:] == a:\n for _ in range(5): s.pop()\n elif s[-5:] == c:\n for _ in range(5): s.pop()\n- elif s[-6:] == b:\n- for _ in range(6): s.pop()\n+ elif s[-7:] == b:\n+ for _ in range(7): s.pop()\n elif s[-6:] == d:\n for _ in range(6): s.pop()\n else:\n- print(\"No\")\n+ print(\"NO\")\n break\n \n \n \n \n \n-\n", "FL_content": " \n \n import sys\n read = sys.stdin.read\n readline = sys.stdin.readline\n \n \n \n \n s = [*input()]\n a = [*\"dream\"]\n b = [*\"dreamer\"]\n c = [*\"erase\"]\n d = [*\"eraser\"]\n \n-\n while True:\n if not s:\n- print(\"Yes\")\n break\n elif s[-5:] == a:\n for _ in range(5): s.pop()\n elif s[-5:] == c:\n for _ in range(5): s.pop()\n- elif s[-6:] == b:\n- for _ in range(6): s.pop()\n elif s[-6:] == d:\n for _ in range(6): s.pop()\n else:\n- print(\"No\")\n break\n \n \n \n \n \n-\n", "added_lines": 4, "removed_lines": 6, "code1_lines": 37 }, { "user_id": "u237362582", "problem_id": "p03856", "submission1_id": "s962648127", "submission2_id": "s623219470", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nrS = S[::-1]\nkeys = ['dream', 'dreamer', 'erase', 'eraser']\nreversed_keys = [keys[i][::-1] for i in range(len(keys))]\ni = 0\nprint(reversed_keys)\nwhile i < len(rS):\n if rS[i:i+5] in reversed_keys:\n i += 5\n elif rS[i:i+6] in reversed_keys:\n i += 6\n elif rS[i:i+7] in reversed_keys:\n i += 7\n else:\n break\nif i == len(rS):\n print('YES')\nelse:\n print('NO')\n", "code2": "S = input()\nrS = S[::-1]\nkeys = ['dream', 'dreamer', 'erase', 'eraser']\nreversed_keys = [keys[i][::-1] for i in range(len(keys))]\ni = 0\n\nwhile i < len(rS):\n if rS[i:i+5] in reversed_keys:\n i += 5\n elif rS[i:i+6] in reversed_keys:\n i += 6\n elif rS[i:i+7] in reversed_keys:\n i += 7\n else:\n break\nif i == len(rS):\n print('YES')\nelse:\n print('NO')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1544047388", "date2": "1544047500", "bleu_score": "0.9463308078061249", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "['maerd', 'remaerd', 'esare', 'resare']\nYES\n", "expected_output": "YES\n", "anno_code": ["S = input() # (0): S=erasedream\nrS = S[::-1] # (1): rS=maerdesare\nkeys = ['dream', 'dreamer', 'erase', 'eraser'] # (2): keys=['dream', 'dreamer', 'erase', 'eraser']\nreversed_keys = [keys[i][::-1] for i in range(len(keys))] # (3): reversed_keys=['maerd', 'remaerd', 'esare', 'resare']\ni = 0 # (4): i=0\nprint(reversed_keys) # (5): NO CHANGE\nwhile i < len(rS): # (6): NO CHANGE (9): NO CHANGE (12): NO CHANGE\n if rS[i:i+5] in reversed_keys: # (7): NO CHANGE (10): NO CHANGE\n i += 5 # (8): i=5 (11): i=10\n elif rS[i:i+6] in reversed_keys:\n i += 6\n elif rS[i:i+7] in reversed_keys:\n i += 7\n else:\n break\nif i == len(rS): # (13): NO CHANGE\n print('YES')\nelse:\n print('NO')\n"], "anno_status": [true], "diff_content": " S = input()\n rS = S[::-1]\n keys = ['dream', 'dreamer', 'erase', 'eraser']\n reversed_keys = [keys[i][::-1] for i in range(len(keys))]\n i = 0\n-print(reversed_keys)\n+\n while i < len(rS):\n if rS[i:i+5] in reversed_keys:\n i += 5\n elif rS[i:i+6] in reversed_keys:\n i += 6\n elif rS[i:i+7] in reversed_keys:\n i += 7\n else:\n break\n if i == len(rS):\n print('YES')\n else:\n print('NO')\n \n", "FL_content": " S = input()\n rS = S[::-1]\n keys = ['dream', 'dreamer', 'erase', 'eraser']\n reversed_keys = [keys[i][::-1] for i in range(len(keys))]\n i = 0\n-print(reversed_keys)\n while i < len(rS):\n if rS[i:i+5] in reversed_keys:\n i += 5\n elif rS[i:i+6] in reversed_keys:\n i += 6\n elif rS[i:i+7] in reversed_keys:\n i += 7\n else:\n break\n if i == len(rS):\n print('YES')\n else:\n print('NO')\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 20 }, { "user_id": "u558528117", "problem_id": "p03856", "submission1_id": "s966245761", "submission2_id": "s023355238", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\ndef solve(s):\n if s == \"\":\n return True\n elif s.endswith(\"dream\"):\n return solve(s[:-5])\n elif s.endswith(\"dreamer\"):\n return solve(s[:-7])\n elif s.endswith(\"erase\"):\n return solve(s[:-5])\n elif s.endswith(\"eraser\"):\n return solve(s[:-6])\n else:\n return False\n return False\n\n\ndef main():\n line = sys.stdin.readline()\n\n if solve(line):\n print(\"YES\")\n else:\n print(\"NO\")\n\n return 0\n\nif __name__ == '__main__':\n sys.exit(main())\n", "code2": "import sys\n\ndef solve(s):\n tmp_s = s\n while(len(tmp_s) > 0):\n if tmp_s.startswith(\"maerd\"):\n tmp_s = tmp_s[5:]\n elif tmp_s.startswith(\"remaerd\"):\n tmp_s = tmp_s[7:]\n elif tmp_s.startswith(\"esare\"):\n tmp_s = tmp_s[5:]\n elif tmp_s.startswith(\"resare\"):\n tmp_s = tmp_s[6:]\n else:\n return False\n\n return True\n\ndef main():\n line = sys.stdin.readline().rstrip()\n line_rev = line[::-1]\n\n if solve(line_rev):\n print(\"YES\")\n else:\n print(\"NO\")\n\n return 0\n\nif __name__ == '__main__':\n sys.exit(main())\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1492901645", "date2": "1492948313", "bleu_score": "0.6221692314045402", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "NO\n", "expected_output": "YES\n", "anno_code": ["import sys\n\ndef solve(s): # (0): solve=\n if s == \"\":\n return True\n elif s.endswith(\"dream\"):\n return solve(s[:-5])\n elif s.endswith(\"dreamer\"):\n return solve(s[:-7])\n elif s.endswith(\"erase\"):\n return solve(s[:-5])\n elif s.endswith(\"eraser\"):\n return solve(s[:-6])\n else:\n return False\n return False\n\n\ndef main(): # (1): main=\n line = sys.stdin.readline()\n\n if solve(line):\n print(\"YES\")\n else:\n print(\"NO\")\n\n return 0\n\nif __name__ == '__main__':\n sys.exit(main())\n"], "anno_status": [true], "diff_content": " import sys\n \n def solve(s):\n- if s == \"\":\n- return True\n- elif s.endswith(\"dream\"):\n- return solve(s[:-5])\n- elif s.endswith(\"dreamer\"):\n- return solve(s[:-7])\n- elif s.endswith(\"erase\"):\n- return solve(s[:-5])\n- elif s.endswith(\"eraser\"):\n- return solve(s[:-6])\n- else:\n- return False\n- return False\n+ tmp_s = s\n+ while(len(tmp_s) > 0):\n+ if tmp_s.startswith(\"maerd\"):\n+ tmp_s = tmp_s[5:]\n+ elif tmp_s.startswith(\"remaerd\"):\n+ tmp_s = tmp_s[7:]\n+ elif tmp_s.startswith(\"esare\"):\n+ tmp_s = tmp_s[5:]\n+ elif tmp_s.startswith(\"resare\"):\n+ tmp_s = tmp_s[6:]\n+ else:\n+ return False\n \n+ return True\n \n def main():\n- line = sys.stdin.readline()\n+ line = sys.stdin.readline().rstrip()\n+ line_rev = line[::-1]\n \n- if solve(line):\n+ if solve(line_rev):\n print(\"YES\")\n else:\n print(\"NO\")\n \n return 0\n \n if __name__ == '__main__':\n sys.exit(main())\n \n", "FL_content": " import sys\n \n def solve(s):\n- if s == \"\":\n- return True\n- elif s.endswith(\"dream\"):\n- return solve(s[:-5])\n- elif s.endswith(\"dreamer\"):\n- return solve(s[:-7])\n- elif s.endswith(\"erase\"):\n- return solve(s[:-5])\n- elif s.endswith(\"eraser\"):\n- return solve(s[:-6])\n- else:\n- return False\n- return False\n \n \n def main():\n- line = sys.stdin.readline()\n \n- if solve(line):\n print(\"YES\")\n else:\n print(\"NO\")\n \n return 0\n \n if __name__ == '__main__':\n sys.exit(main())\n \n", "added_lines": 17, "removed_lines": 16, "code1_lines": 31 }, { "user_id": "u558528117", "problem_id": "p03856", "submission1_id": "s468917985", "submission2_id": "s023355238", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(10000)\n\ndef solve(s):\n if s == \"\":\n return True\n elif s.endswith(\"dream\"):\n return solve(s[:-5])\n elif s.endswith(\"dreamer\"):\n return solve(s[:-7])\n elif s.endswith(\"erase\"):\n return solve(s[:-5])\n elif s.endswith(\"eraser\"):\n return solve(s[:-6])\n else:\n return False\n return False\n\n\ndef main():\n line = sys.stdin.readline()\n\n if solve(line):\n print(\"YES\")\n else:\n print(\"NO\")\n\n return 0\n\nif __name__ == '__main__':\n sys.exit(main())\n", "code2": "import sys\n\ndef solve(s):\n tmp_s = s\n while(len(tmp_s) > 0):\n if tmp_s.startswith(\"maerd\"):\n tmp_s = tmp_s[5:]\n elif tmp_s.startswith(\"remaerd\"):\n tmp_s = tmp_s[7:]\n elif tmp_s.startswith(\"esare\"):\n tmp_s = tmp_s[5:]\n elif tmp_s.startswith(\"resare\"):\n tmp_s = tmp_s[6:]\n else:\n return False\n\n return True\n\ndef main():\n line = sys.stdin.readline().rstrip()\n line_rev = line[::-1]\n\n if solve(line_rev):\n print(\"YES\")\n else:\n print(\"NO\")\n\n return 0\n\nif __name__ == '__main__':\n sys.exit(main())\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1492901797", "date2": "1492948313", "bleu_score": "0.6276201314294582", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "NO\n", "expected_output": "YES\n", "anno_code": ["import sys\nsys.setrecursionlimit(10000) # (0): NO CHANGE\n\ndef solve(s): # (1): solve=\n if s == \"\":\n return True\n elif s.endswith(\"dream\"):\n return solve(s[:-5])\n elif s.endswith(\"dreamer\"):\n return solve(s[:-7])\n elif s.endswith(\"erase\"):\n return solve(s[:-5])\n elif s.endswith(\"eraser\"):\n return solve(s[:-6])\n else:\n return False\n return False\n\n\ndef main(): # (2): main=\n line = sys.stdin.readline()\n\n if solve(line):\n print(\"YES\")\n else:\n print(\"NO\")\n\n return 0\n\nif __name__ == '__main__':\n sys.exit(main())\n"], "anno_status": [true], "diff_content": " import sys\n-sys.setrecursionlimit(10000)\n \n def solve(s):\n- if s == \"\":\n- return True\n- elif s.endswith(\"dream\"):\n- return solve(s[:-5])\n- elif s.endswith(\"dreamer\"):\n- return solve(s[:-7])\n- elif s.endswith(\"erase\"):\n- return solve(s[:-5])\n- elif s.endswith(\"eraser\"):\n- return solve(s[:-6])\n- else:\n- return False\n- return False\n+ tmp_s = s\n+ while(len(tmp_s) > 0):\n+ if tmp_s.startswith(\"maerd\"):\n+ tmp_s = tmp_s[5:]\n+ elif tmp_s.startswith(\"remaerd\"):\n+ tmp_s = tmp_s[7:]\n+ elif tmp_s.startswith(\"esare\"):\n+ tmp_s = tmp_s[5:]\n+ elif tmp_s.startswith(\"resare\"):\n+ tmp_s = tmp_s[6:]\n+ else:\n+ return False\n \n+ return True\n \n def main():\n- line = sys.stdin.readline()\n+ line = sys.stdin.readline().rstrip()\n+ line_rev = line[::-1]\n \n- if solve(line):\n+ if solve(line_rev):\n print(\"YES\")\n else:\n print(\"NO\")\n \n return 0\n \n if __name__ == '__main__':\n sys.exit(main())\n \n", "FL_content": " import sys\n-sys.setrecursionlimit(10000)\n \n def solve(s):\n- if s == \"\":\n- return True\n- elif s.endswith(\"dream\"):\n- return solve(s[:-5])\n- elif s.endswith(\"dreamer\"):\n- return solve(s[:-7])\n- elif s.endswith(\"erase\"):\n- return solve(s[:-5])\n- elif s.endswith(\"eraser\"):\n- return solve(s[:-6])\n- else:\n- return False\n- return False\n \n \n def main():\n- line = sys.stdin.readline()\n \n- if solve(line):\n print(\"YES\")\n else:\n print(\"NO\")\n \n return 0\n \n if __name__ == '__main__':\n sys.exit(main())\n \n", "added_lines": 17, "removed_lines": 17, "code1_lines": 32 }, { "user_id": "u205087376", "problem_id": "p02921", "submission1_id": "s168313238", "submission2_id": "s025492598", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = str(input())\nt = str(input())\ncnt = 0\nfor i in range(0,2):\n if s[i] == t[i]:\n cnt += 1\nprint(int(cnt))", "code2": "s = str(input())\nt = str(input())\ncnt = 0\nfor i in range(0,3):\n if s[i] == t[i]:\n cnt += 1\nprint(int(cnt))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586422389", "date2": "1586422505", "bleu_score": "0.976792959791408", "code1_test_status": [1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 80, "total_score": 103, "input": "RTR\nSTR\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["s = str(input()) # (0): s=RTR\nt = str(input()) # (1): t=STR\ncnt = 0 # (2): cnt=0\nfor i in range(0,2): # (3): i=0 (5): i=1 (8): NO CHANGE\n if s[i] == t[i]: # (4): NO CHANGE (6): NO CHANGE\n cnt += 1 # (7): cnt=1\nprint(int(cnt))"], "anno_status": [true], "diff_content": " s = str(input())\n t = str(input())\n cnt = 0\n-for i in range(0,2):\n+for i in range(0,3):\n if s[i] == t[i]:\n cnt += 1\n print(int(cnt))\n", "FL_content": " s = str(input())\n t = str(input())\n cnt = 0\n-for i in range(0,2):\n if s[i] == t[i]:\n cnt += 1\n print(int(cnt))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u782138812", "problem_id": "p02921", "submission1_id": "s667766225", "submission2_id": "s350633744", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = list(input())\nT = list(input())\ncnt = 0\n\nfor i in range(2):\n if S[i] == T[i]:\n cnt += 1\n else:\n cnt\n\nprint(cnt)\n", "code2": "S = list(input())\nT = list(input())\ncnt = 0\n\nfor i in range(3):\n if S[i] == T[i]:\n cnt += 1\n\nprint(cnt)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567546666", "date2": "1567546893", "bleu_score": "0.8004078315763231", "code1_test_status": [1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 80, "total_score": 103, "input": "QVT\nRST\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["S = list(input()) # (0): S=['Q', 'V', 'T']\nT = list(input()) # (1): T=['R', 'S', 'T']\ncnt = 0 # (2): cnt=0\n\nfor i in range(2): # (3): i=0 (6): i=1 (9): NO CHANGE\n if S[i] == T[i]: # (4): NO CHANGE (7): NO CHANGE\n cnt += 1\n else:\n cnt # (5): NO CHANGE (8): NO CHANGE\n\nprint(cnt)\n"], "anno_status": [true], "diff_content": " S = list(input())\n T = list(input())\n cnt = 0\n \n-for i in range(2):\n+for i in range(3):\n if S[i] == T[i]:\n cnt += 1\n- else:\n- cnt\n \n print(cnt)\n \n", "FL_content": " S = list(input())\n T = list(input())\n cnt = 0\n \n-for i in range(2):\n if S[i] == T[i]:\n cnt += 1\n- else:\n- cnt\n \n print(cnt)\n \n", "added_lines": 1, "removed_lines": 3, "code1_lines": 12 }, { "user_id": "u183896397", "problem_id": "p02921", "submission1_id": "s723186060", "submission2_id": "s661539735", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = str(input())\nT = str(input())\n\ns = list(S)\nt = list(T)\n\nans = 0\n\nfor i in range(2):\n if s[i] == t[i]:\n ans += 1\n \nprint(ans)", "code2": "S = str(input())\nT = str(input())\n\ns = list(S)\nt = list(T)\n\nans = 0\n\nfor i in range(3):\n if s[i] == t[i]:\n ans += 1\n \nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567364738", "date2": "1567364786", "bleu_score": "0.9824846426725741", "code1_test_status": [1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 80, "total_score": 103, "input": "RTS\nTTS\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["S = str(input()) # (0): S=RTS\nT = str(input()) # (1): T=TTS\n\ns = list(S) # (2): s=['R', 'T', 'S']\nt = list(T) # (3): t=['T', 'T', 'S']\n\nans = 0 # (4): ans=0\n\nfor i in range(2): # (5): i=0 (7): i=1 (10): NO CHANGE\n if s[i] == t[i]: # (6): NO CHANGE (8): NO CHANGE\n ans += 1 # (9): ans=1\n \nprint(ans)"], "anno_status": [true], "diff_content": " S = str(input())\n T = str(input())\n \n s = list(S)\n t = list(T)\n \n ans = 0\n \n-for i in range(2):\n+for i in range(3):\n if s[i] == t[i]:\n ans += 1\n \n print(ans)\n", "FL_content": " S = str(input())\n T = str(input())\n \n s = list(S)\n t = list(T)\n \n ans = 0\n \n-for i in range(2):\n if s[i] == t[i]:\n ans += 1\n \n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u962535482", "problem_id": "p02921", "submission1_id": "s293067536", "submission2_id": "s433059441", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nT = input()\ncounter = 0\nfor i in range(2):\n if S[i] == T[i]:\n counter += 1\n \nprint(counter)\n", "code2": "S = input()\nT = input()\ncounter = 0\nfor i in range(3):\n if S[i] == T[i]:\n counter += 1\n \nprint(counter)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567366734", "date2": "1567366795", "bleu_score": "0.9789435002605391", "code1_test_status": [1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 80, "total_score": 103, "input": "VRS\nQTS\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["S = input() # (0): S=VRS\nT = input() # (1): T=QTS\ncounter = 0 # (2): counter=0\nfor i in range(2): # (3): i=0 (5): i=1 (7): NO CHANGE\n if S[i] == T[i]: # (4): NO CHANGE (6): NO CHANGE\n counter += 1\n \nprint(counter)\n"], "anno_status": [true], "diff_content": " S = input()\n T = input()\n counter = 0\n-for i in range(2):\n+for i in range(3):\n if S[i] == T[i]:\n counter += 1\n \n print(counter)\n \n", "FL_content": " S = input()\n T = input()\n counter = 0\n-for i in range(2):\n if S[i] == T[i]:\n counter += 1\n \n print(counter)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u581040514", "problem_id": "p02921", "submission1_id": "s351309635", "submission2_id": "s519177391", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = list(input())\nT = list(input()) \n\nans = 0\nprint(S)\nfor i in range(3):\n if S[i] == T[i]:\n ans += 1\n\nprint(ans)", "code2": "S = list(input())\nT = list(input()) \n\nans = 0\nfor i in range(3):\n if S[i] == T[i]:\n ans += 1\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567364703", "date2": "1567364739", "bleu_score": "0.9185235520488739", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "UTR\nSTS\n", "actual_output": "['U', 'T', 'R']\n1\n", "expected_output": "1\n\n", "anno_code": ["S = list(input()) # (0): S=['U', 'T', 'R']\nT = list(input()) # (1): T=['S', 'T', 'S']\n\nans = 0 # (2): ans=0\nprint(S) # (3): NO CHANGE\nfor i in range(3): # (4): i=0 (6): i=1 ... (11): NO CHANGE\n if S[i] == T[i]: # (5): NO CHANGE (7): NO CHANGE (10): NO CHANGE\n ans += 1 # (8): ans=1\n\nprint(ans)"], "anno_status": [true], "diff_content": " S = list(input())\n T = list(input()) \n \n ans = 0\n-print(S)\n for i in range(3):\n if S[i] == T[i]:\n ans += 1\n \n print(ans)\n", "FL_content": " S = list(input())\n T = list(input()) \n \n ans = 0\n-print(S)\n for i in range(3):\n if S[i] == T[i]:\n ans += 1\n \n print(ans)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u460229551", "problem_id": "p02921", "submission1_id": "s101099324", "submission2_id": "s425433100", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S=input()\nT=input()\ncount=0\nfor i in range(0,2):\n if S[i]==T[i]:\n count+=1\nprint(count)", "code2": "S=input()\nT=input()\ncount=0\nfor i in range(0,3):\n if S[i]==T[i]:\n count+=1\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567365462", "date2": "1567365639", "bleu_score": "0.9736071380988617", "code1_test_status": [1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 80, "total_score": 103, "input": "VSS\nTRS\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["S=input() # (0): S=VSS\nT=input() # (1): T=TRS\ncount=0 # (2): count=0\nfor i in range(0,2): # (3): i=0 (5): i=1 (7): NO CHANGE\n if S[i]==T[i]: # (4): NO CHANGE (6): NO CHANGE\n count+=1\nprint(count)"], "anno_status": [true], "diff_content": " S=input()\n T=input()\n count=0\n-for i in range(0,2):\n+for i in range(0,3):\n if S[i]==T[i]:\n count+=1\n print(count)\n", "FL_content": " S=input()\n T=input()\n count=0\n-for i in range(0,2):\n if S[i]==T[i]:\n count+=1\n print(count)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u090729464", "problem_id": "p02921", "submission1_id": "s633277623", "submission2_id": "s971959979", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(input())\nt = list(input())\nnum = 0\nfor i in range(2):\n if s[i] == t[i]:\n num += 1\nprint(num)\n", "code2": "s = list(input())\nt = list(input())\nnum = 0\nfor i in range(3):\n if s[i] == t[i]:\n num += 1\nprint(num)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567591772", "date2": "1567592378", "bleu_score": "0.9772160520895917", "code1_test_status": [1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 80, "total_score": 103, "input": "RTS\nSTS\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["s = list(input()) # (0): s=['R', 'T', 'S']\nt = list(input()) # (1): t=['S', 'T', 'S']\nnum = 0 # (2): num=0\nfor i in range(2): # (3): i=0 (5): i=1 (8): NO CHANGE\n if s[i] == t[i]: # (4): NO CHANGE (6): NO CHANGE\n num += 1 # (7): num=1\nprint(num)\n"], "anno_status": [true], "diff_content": " s = list(input())\n t = list(input())\n num = 0\n-for i in range(2):\n+for i in range(3):\n if s[i] == t[i]:\n num += 1\n print(num)\n \n", "FL_content": " s = list(input())\n t = list(input())\n num = 0\n-for i in range(2):\n if s[i] == t[i]:\n num += 1\n print(num)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u285628294", "problem_id": "p02921", "submission1_id": "s106762821", "submission2_id": "s826024261", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S=list(str(input()))\nT=list(str(input()))\ni=0\n\nfor i in range(3):\n\tif S[i]==T[i]:\n\t\ti+=1\nprint(i)", "code2": "S=list(str(input()))\nT=list(str(input()))\np=0\n\nfor i in range(3):\n\tif (S[i]==T[i]):\n\t\tp+=1\nprint(p)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575312249", "date2": "1575313056", "bleu_score": "0.8774446812976884", "code1_test_status": [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 4, "total_score": 103, "input": "TSR\nSTS\n", "actual_output": "2\n", "expected_output": "0\n\n", "anno_code": ["S=list(str(input())) # (0): S=['T', 'S', 'R']\nT=list(str(input())) # (1): T=['S', 'T', 'S']\ni=0 # (2): i=0\n\nfor i in range(3): # (3): NO CHANGE (5): i=1 ... (9): NO CHANGE\n\tif S[i]==T[i]: # (4): NO CHANGE (6): NO CHANGE (8): NO CHANGE\n\t\ti+=1\nprint(i)"], "anno_status": [true], "diff_content": " S=list(str(input()))\n T=list(str(input()))\n-i=0\n+p=0\n \n for i in range(3):\n-\tif S[i]==T[i]:\n-\t\ti+=1\n-print(i)\n+\tif (S[i]==T[i]):\n+\t\tp+=1\n+print(p)\n", "FL_content": " S=list(str(input()))\n T=list(str(input()))\n-i=0\n \n for i in range(3):\n-\tif S[i]==T[i]:\n-\t\ti+=1\n-print(i)\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 8 }, { "user_id": "u687599294", "problem_id": "p02921", "submission1_id": "s217298216", "submission2_id": "s715105273", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ns,t = input(), input()\n\nc = 1\nfor i in range(len(s)):\n\tif s[i] == t[i]:c+=1\n\t\nprint(c)", "code2": "\ns,t = input(), input()\n\nc = 0\nfor i in range(len(s)):\n\tif s[i] == t[i]:c+=1\n\t\nprint(c)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1567623157", "date2": "1567623197", "bleu_score": "0.9704907832745403", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "TSR\nTTR\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["\ns,t = input(), input() # (0): s=TSR, t=TTR\n\nc = 1 # (1): c=1\nfor i in range(len(s)): # (2): i=0 (4): i=1 ... (8): NO CHANGE\n\tif s[i] == t[i]:c+=1 # (3): c=2 (5): NO CHANGE (7): c=3\n\t\nprint(c)"], "anno_status": [true], "diff_content": " \n s,t = input(), input()\n \n-c = 1\n+c = 0\n for i in range(len(s)):\n \tif s[i] == t[i]:c+=1\n \t\n print(c)\n", "FL_content": " \n s,t = input(), input()\n \n-c = 1\n for i in range(len(s)):\n \tif s[i] == t[i]:c+=1\n \t\n print(c)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u768496010", "problem_id": "p02921", "submission1_id": "s669973086", "submission2_id": "s457175230", "status1": "Wrong Answer", "status2": "Accepted", "code1": "predict = input('predict')\n\nactual = input('actual')\n\ncount = 0\n\nfor index in range(0, len(predict)):\n if predict[index] == actual[index]:\n count += 1\n \nprint (count)", "code2": "predict = input()\n\nactual = input()\n\ncount = 0\n\nfor index in range(0, len(predict)):\n if predict[index] == actual[index]:\n count += 1\n\nprint (count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567364780", "date2": "1567365204", "bleu_score": "0.8287713708838921", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "RTT\nSUS\n", "actual_output": "predictactual0\n", "expected_output": "0\n\n", "anno_code": ["predict = input('predict') # (0): predict=RTT\n\nactual = input('actual') # (1): actual=SUS\n\ncount = 0 # (2): count=0\n\nfor index in range(0, len(predict)): # (3): index=0 (5): index=1 ... (9): NO CHANGE\n if predict[index] == actual[index]: # (4): NO CHANGE (6): NO CHANGE (8): NO CHANGE\n count += 1\n \nprint (count)"], "anno_status": [true], "diff_content": "-predict = input('predict')\n+predict = input()\n \n-actual = input('actual')\n+actual = input()\n \n count = 0\n \n for index in range(0, len(predict)):\n if predict[index] == actual[index]:\n count += 1\n- \n+\n print (count)\n", "FL_content": "-predict = input('predict')\n \n-actual = input('actual')\n \n count = 0\n \n for index in range(0, len(predict)):\n if predict[index] == actual[index]:\n count += 1\n- \n print (count)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 11 }, { "user_id": "u432805419", "problem_id": "p03719", "submission1_id": "s672560189", "submission2_id": "s292389382", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = list(map(int,input().split()))\nb = sorted(a)\nif a[2] == b[1]:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "a = list(map(int,input().split()))\nif a[0] <= a[2] and a[1] >= a[2]:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1541381455", "date2": "1541381624", "bleu_score": "0.7885235500812869", "code1_test_status": [0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 19, "total_score": 21, "input": "5 -1 0\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["a = list(map(int,input().split())) # (0): a=[5, -1, 0]\nb = sorted(a) # (1): b=[-1, 0, 5]\nif a[2] == b[1]: # (2): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " a = list(map(int,input().split()))\n-b = sorted(a)\n-if a[2] == b[1]:\n+if a[0] <= a[2] and a[1] >= a[2]:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " a = list(map(int,input().split()))\n-b = sorted(a)\n-if a[2] == b[1]:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u765590009", "problem_id": "p03719", "submission1_id": "s845737433", "submission2_id": "s506191230", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\na, b, c = map(int, input().split())\n\n\nif (c >= a) and (c <= b) :\n print(\"YES\")\nelse :\n print(\"NO\")", "code2": "\n\na, b, c = map(int, input().split())\n\n\nif (c >= a) and (c <= b) :\n print(\"Yes\")\nelse :\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558479315", "date2": "1558479353", "bleu_score": "0.9445864447947969", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 21, "input": "-1 4 -1\n", "actual_output": "YES\n", "expected_output": "Yes\n\n", "anno_code": ["\n\na, b, c = map(int, input().split()) # (0): a=-1, b=4, c=-1\n\n\nif (c >= a) and (c <= b) : # (1): NO CHANGE\n print(\"YES\")\nelse :\n print(\"NO\")"], "anno_status": [true], "diff_content": " \n \n a, b, c = map(int, input().split())\n \n \n if (c >= a) and (c <= b) :\n- print(\"YES\")\n+ print(\"Yes\")\n else :\n- print(\"NO\")\n+ print(\"No\")\n", "FL_content": " \n \n a, b, c = map(int, input().split())\n \n \n if (c >= a) and (c <= b) :\n- print(\"YES\")\n else :\n- print(\"NO\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u341087021", "problem_id": "p03719", "submission1_id": "s560786132", "submission2_id": "s136754106", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\na, b, c = [int(x) for x in sys.stdin.readline().split()]\n\nif a <= c and b >= c:\n\tprint('YES')\nelse:\n\tprint('NO')", "code2": "import sys\n\na, b, c = [int(x) for x in sys.stdin.readline().split()]\n\nif a <= c and b >= c:\n\tprint('Yes')\nelse:\n\tprint('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1494724016", "date2": "1494724131", "bleu_score": "0.9527806225305113", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 21, "input": "9 3 1\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["import sys\n\na, b, c = [int(x) for x in sys.stdin.readline().split()] # (0): a=9, b=3, c=1\n\nif a <= c and b >= c: # (1): NO CHANGE\n\tprint('YES')\nelse:\n\tprint('NO')"], "anno_status": [true], "diff_content": " import sys\n \n a, b, c = [int(x) for x in sys.stdin.readline().split()]\n \n if a <= c and b >= c:\n-\tprint('YES')\n+\tprint('Yes')\n else:\n-\tprint('NO')\n+\tprint('No')\n", "FL_content": " import sys\n \n a, b, c = [int(x) for x in sys.stdin.readline().split()]\n \n if a <= c and b >= c:\n-\tprint('YES')\n else:\n-\tprint('NO')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u597136378", "problem_id": "p03719", "submission1_id": "s893228611", "submission2_id": "s540039019", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c = (int(i) for i in input().split())\nif(a<=c and c<=b):\n print('YES')\nelse:\n print('No')\n ", "code2": "a,b,c = (int(i) for i in input().split())\nif(a<=c and c<=b):\n print('Yes')\nelse:\n print('No')\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564339393", "date2": "1564339521", "bleu_score": "0.9649773185979726", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0], "code1_test_score": 16, "total_score": 21, "input": "-4 2 -3\n", "actual_output": "YES\n", "expected_output": "Yes\n\n", "anno_code": ["a,b,c = (int(i) for i in input().split()) # (0): a=-4, b=2, c=-3\nif(a<=c and c<=b): # (1): NO CHANGE\n print('YES')\nelse:\n print('No')\n "], "anno_status": [true], "diff_content": " a,b,c = (int(i) for i in input().split())\n if(a<=c and c<=b):\n- print('YES')\n+ print('Yes')\n else:\n print('No')\n \n", "FL_content": " a,b,c = (int(i) for i in input().split())\n if(a<=c and c<=b):\n- print('YES')\n else:\n print('No')\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u312821683", "problem_id": "p03719", "submission1_id": "s734192383", "submission2_id": "s583609420", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A,B,C = input().split()\nif C >= A and C <= B:\n print('YES')\nelse:\n print('NO')", "code2": "A,B,C = map(int, input().split())\n\nif C >= A and C <= B:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600612106", "date2": "1600972714", "bleu_score": "0.7976726452902457", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 21, "input": "0 2 -6\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["A,B,C = input().split() # (0): A=0, B=2, C=-6\nif C >= A and C <= B: # (1): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": "-A,B,C = input().split()\n+A,B,C = map(int, input().split())\n+\n if C >= A and C <= B:\n- print('YES')\n+ print('Yes')\n else:\n- print('NO')\n+ print('No')\n", "FL_content": "-A,B,C = input().split()\n if C >= A and C <= B:\n- print('YES')\n else:\n- print('NO')\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 5 }, { "user_id": "u752898745", "problem_id": "p03719", "submission1_id": "s533451107", "submission2_id": "s081433628", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=input().split()\nprint(\"Yes\" if c>=a and c<=b else \"No\")", "code2": "a,b,c=map(int,input().split())\nprint(\"Yes\" if a<=c and c<=b else \"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587218835", "date2": "1587219055", "bleu_score": "0.7628435877352012", "code1_test_status": [1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0], "code1_test_score": 15, "total_score": 21, "input": "-1 2 -2\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["a,b,c=input().split() # (0): a=-1, b=2, c=-2\nprint(\"Yes\" if c>=a and c<=b else \"No\")"], "anno_status": [true], "diff_content": "-a,b,c=input().split()\n-print(\"Yes\" if c>=a and c<=b else \"No\")\n+a,b,c=map(int,input().split())\n+print(\"Yes\" if a<=c and c<=b else \"No\")\n", "FL_content": "-a,b,c=input().split()\n-print(\"Yes\" if c>=a and c<=b else \"No\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 2 }, { "user_id": "u137726327", "problem_id": "p03719", "submission1_id": "s288479957", "submission2_id": "s263448868", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nlists=list(map(int,input().split()))\n\n\n\n\n\n\nif lists[0]<=lists[2] and lists[1]>=lists[2]:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "code2": "\n\n\n\n\nlists=list(map(int,input().split()))\n\n\n\n\n\n\nif lists[0]<=lists[2] and lists[1]>=lists[2]:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575385862", "date2": "1575385964", "bleu_score": "0.955431396518499", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 21, "input": "0 2 -7\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["\n\n\n\n\nlists=list(map(int,input().split())) # (0): lists=[0, 2, -7]\n\n\n\n\n\n\nif lists[0]<=lists[2] and lists[1]>=lists[2]: # (1): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")\n"], "anno_status": [true], "diff_content": " \n \n \n \n \n lists=list(map(int,input().split()))\n \n \n \n \n \n \n if lists[0]<=lists[2] and lists[1]>=lists[2]:\n- print(\"YES\")\n+ print(\"Yes\")\n else:\n- print(\"NO\")\n+ print(\"No\")\n \n", "FL_content": " \n \n \n \n \n lists=list(map(int,input().split()))\n \n \n \n \n \n \n if lists[0]<=lists[2] and lists[1]>=lists[2]:\n- print(\"YES\")\n else:\n- print(\"NO\")\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 17 }, { "user_id": "u732491892", "problem_id": "p03719", "submission1_id": "s390509534", "submission2_id": "s977337334", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = map(int, input().split(' '))\nprint(\"YES\") if c >= a and c <= b else print(\"NO\")\n", "code2": "a, b, c = map(int, input().split(' '))\nprint(\"Yes\") if c >= a and c <= b else print(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1494723773", "date2": "1494723892", "bleu_score": "0.9315065860605276", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 21, "input": "-2 2 -3\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["a, b, c = map(int, input().split(' ')) # (0): a=-2, b=2, c=-3\nprint(\"YES\") if c >= a and c <= b else print(\"NO\")\n"], "anno_status": [true], "diff_content": " a, b, c = map(int, input().split(' '))\n-print(\"YES\") if c >= a and c <= b else print(\"NO\")\n+print(\"Yes\") if c >= a and c <= b else print(\"No\")\n \n", "FL_content": " a, b, c = map(int, input().split(' '))\n-print(\"YES\") if c >= a and c <= b else print(\"NO\")\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u382748202", "problem_id": "p03719", "submission1_id": "s873884114", "submission2_id": "s502495391", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = map(int, input().split())\n\nif C >= A and C <= B:\n print('YES')\nelse:\n print('No')", "code2": "A, B, C = map(int, input().split())\n\nif C >= A and C <= B:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1494723870", "date2": "1494724130", "bleu_score": "0.9631321533466505", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0], "code1_test_score": 16, "total_score": 21, "input": "-1 3 -1\n", "actual_output": "YES\n", "expected_output": "Yes\n\n", "anno_code": ["A, B, C = map(int, input().split()) # (0): A=-1, B=3, C=-1\n\nif C >= A and C <= B: # (1): NO CHANGE\n print('YES')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " A, B, C = map(int, input().split())\n \n if C >= A and C <= B:\n- print('YES')\n+ print('Yes')\n else:\n print('No')\n", "FL_content": " A, B, C = map(int, input().split())\n \n if C >= A and C <= B:\n- print('YES')\n else:\n print('No')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u280512618", "problem_id": "p03719", "submission1_id": "s749413787", "submission2_id": "s496988763", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=map(int,input().split())\nprint('Yes' if a<=b and b<=c else 'No')", "code2": "a,b,c=map(int,input().split())\nprint('Yes' if a<=c and c<=b else 'No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553950489", "date2": "1553950506", "bleu_score": "0.9360313564621927", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0], "code1_test_score": 16, "total_score": 21, "input": "-1 3 -1\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["a,b,c=map(int,input().split()) # (0): a=-1, b=3, c=-1\nprint('Yes' if a<=b and b<=c else 'No')"], "anno_status": [true], "diff_content": " a,b,c=map(int,input().split())\n-print('Yes' if a<=b and b<=c else 'No')\n+print('Yes' if a<=c and c<=b else 'No')\n", "FL_content": " a,b,c=map(int,input().split())\n-print('Yes' if a<=b and b<=c else 'No')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u520158330", "problem_id": "p04039", "submission1_id": "s456370910", "submission2_id": "s197779607", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K = map(int,input().split())\nD = input().split()\n\nfor i in range(N,10000):\n match = False\n for s in str(i):\n if s in D:\n match = True\n break\n if not match:\n print(i)\n break", "code2": "N,K = map(int,input().split())\nD = input().split()\n\nfor i in range(N,100000):\n match = False\n for s in str(i):\n if s in D:\n match = True\n break\n if not match:\n print(i)\n break", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1525557893", "date2": "1525558104", "bleu_score": "0.9955653009413392", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 72, "total_score": 94, "input": "31766 1\n3\n", "actual_output": "no output\n", "expected_output": "40000\n\n", "anno_code": ["N,K = map(int,input().split()) # (0): N=31766, K=1\nD = input().split() # (1): D=['3']\n\nfor i in range(N,10000):\n match = False\n for s in str(i):\n if s in D:\n match = True\n break\n if not match:\n print(i)\n break"], "anno_status": [true], "diff_content": " N,K = map(int,input().split())\n D = input().split()\n \n-for i in range(N,10000):\n+for i in range(N,100000):\n match = False\n for s in str(i):\n if s in D:\n match = True\n break\n if not match:\n print(i)\n break\n", "FL_content": " N,K = map(int,input().split())\n D = input().split()\n \n-for i in range(N,10000):\n match = False\n for s in str(i):\n if s in D:\n match = True\n break\n if not match:\n print(i)\n break\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u827202523", "problem_id": "p04039", "submission1_id": "s169382877", "submission2_id": "s436772052", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def dig_check(i,d):\n for k in [int(j) for j in str(i)]:\n if k in d:\n return False\n return True\n\n\nN,K = input().split()\nN = int(N)\n\nd = [int(i) for i in input().split()]\n\nfor i in range(10001):\n if i >= N :\n if dig_check(i,d):\n print(i)\n break\n\n", "code2": "def dig_check(i,d):\n for k in [int(j) for j in str(i)]:\n if k in d:\n return False\n return True\n\n\nN,K = input().split()\nN = int(N)\n\nd = [int(i) for i in input().split()]\n\nfor i in range(100001):\n if i >= N :\n if dig_check(i,d):\n print(i)\n break\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1537589189", "date2": "1537589558", "bleu_score": "0.9966610552288375", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 72, "total_score": 94, "input": "17212 1\n-1\n", "actual_output": "no output\n", "expected_output": "17212\n\n", "anno_code": ["def dig_check(i,d): # (0): dig_check=\n for k in [int(j) for j in str(i)]:\n if k in d:\n return False\n return True\n\n\nN,K = input().split() # (1): N=17212, K=1\nN = int(N) # (2): N=17212\n\nd = [int(i) for i in input().split()] # (3): d=[-1]\n\nfor i in range(10001): # (4): i=0 (6): i=1 ... (20004): i=10000\n if i >= N : # (5): NO CHANGE (7): NO CHANGE ... (20005): NO CHANGE\n if dig_check(i,d):\n print(i)\n break\n\n"], "anno_status": [true], "diff_content": " def dig_check(i,d):\n for k in [int(j) for j in str(i)]:\n if k in d:\n return False\n return True\n \n \n N,K = input().split()\n N = int(N)\n \n d = [int(i) for i in input().split()]\n \n-for i in range(10001):\n+for i in range(100001):\n if i >= N :\n if dig_check(i,d):\n print(i)\n break\n \n \n", "FL_content": " def dig_check(i,d):\n for k in [int(j) for j in str(i)]:\n if k in d:\n return False\n return True\n \n \n N,K = input().split()\n N = int(N)\n \n d = [int(i) for i in input().split()]\n \n-for i in range(10001):\n if i >= N :\n if dig_check(i,d):\n print(i)\n break\n \n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 19 }, { "user_id": "u653005308", "problem_id": "p04039", "submission1_id": "s308420841", "submission2_id": "s092995203", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k=map(int,input().split())\ndislike=list(map(int,input().split()))\n\n\nwhile 1:\n for i in range(len(str(n))):\n if int(str(n)[i]) in dislike:\n break\n print(n)\n exit()\n n+=1", "code2": "n,k=map(int,input().split())\ndislike=list(map(int,input().split()))\n\n\nwhile 1:\n for i in range(len(str(n))):\n if int(str(n)[i]) in dislike:\n break\n if i==len(str(n))-1:\n print(n)\n exit()\n n+=1", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1521927210", "date2": "1521927400", "bleu_score": "0.8480457907602076", "code1_test_status": [1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 82, "total_score": 94, "input": "21630 1\n0\n", "actual_output": "21630\n", "expected_output": "21631\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " n,k=map(int,input().split())\n dislike=list(map(int,input().split()))\n \n \n while 1:\n for i in range(len(str(n))):\n if int(str(n)[i]) in dislike:\n break\n- print(n)\n- exit()\n+ if i==len(str(n))-1:\n+ print(n)\n+ exit()\n n+=1\n", "FL_content": " n,k=map(int,input().split())\n dislike=list(map(int,input().split()))\n \n \n while 1:\n for i in range(len(str(n))):\n if int(str(n)[i]) in dislike:\n break\n- print(n)\n- exit()\n n+=1\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 11 }, { "user_id": "u497046426", "problem_id": "p04039", "submission1_id": "s169913417", "submission2_id": "s965720108", "status1": "Wrong Answer", "status2": "Accepted", "code1": "numbers = {str(i) for i in range(10)}\nN, K = map(int, input().split())\n*D, = map(str, input().split())\nD = set(D)\navailable = numbers - D\nans = 0\nfor i in range(N, 100000):\n nums = set(str(i))\n if nums < available:\n print(i)\n break", "code2": "numbers = {str(i) for i in range(10)}\nN, K = map(int, input().split())\n*D, = map(str, input().split())\nD = set(D)\navailable = numbers - D\nans = 0\nfor i in range(N, 100000):\n nums = set(str(i))\n if nums <= available:\n print(i)\n break", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560468690", "date2": "1560468777", "bleu_score": "0.9899895766450997", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 91, "total_score": 94, "input": "1001 8\n1 3 4 5 6 7 8 9\n", "actual_output": "2222\n", "expected_output": "2000\n\n", "anno_code": ["numbers = {str(i) for i in range(10)} # (0): numbers={'7', '6', '2', '8', '0', '5', '9', '3', '4', '1'}\nN, K = map(int, input().split()) # (1): N=1001, K=8\n*D, = map(str, input().split()) # (2): D=['1', '3', '4', '5', '6', '7', '8', '9']\nD = set(D) # (3): D={'7', '6', '8', '5', '9', '3', '4', '1'}\navailable = numbers - D # (4): available={'0', '2'}\nans = 0 # (5): ans=0\nfor i in range(N, 100000): # (6): i=1001 (9): i=1002 ... (3669): i=2222\n nums = set(str(i)) # (7): nums={'0', '1'} (10): nums={'0', '2', '1'} ... (3670): nums={'2'}\n if nums < available: # (8): NO CHANGE (11): NO CHANGE ... (3671): NO CHANGE\n print(i) # (3672): NO CHANGE\n break"], "anno_status": [true], "diff_content": " numbers = {str(i) for i in range(10)}\n N, K = map(int, input().split())\n *D, = map(str, input().split())\n D = set(D)\n available = numbers - D\n ans = 0\n for i in range(N, 100000):\n nums = set(str(i))\n- if nums < available:\n+ if nums <= available:\n print(i)\n break\n", "FL_content": " numbers = {str(i) for i in range(10)}\n N, K = map(int, input().split())\n *D, = map(str, input().split())\n D = set(D)\n available = numbers - D\n ans = 0\n for i in range(N, 100000):\n nums = set(str(i))\n- if nums < available:\n print(i)\n break\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u925051897", "problem_id": "p04039", "submission1_id": "s071854284", "submission2_id": "s910679923", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import re\n\n\n\ninput_1st=input()\ninput_2nd=input()\n\nN, K = input_1st.split(\" \")\nD = input_2nd.split(\" \")\n\npattern = re.compile(\"|\".join(D))\n\n\nfor ans in range(int(N), 10000):\n result = re.findall(pattern, str(ans))\n if not result:\n print(ans)\n break\n", "code2": "input_1st=input()\ninput_2nd=input()\n\nN, K = input_1st.split(\" \")\nD = input_2nd.split(\" \")\n\nfor ans in range(int(N), 100000):\n flg = True\n for i in range(len(str(ans))):\n if str(ans)[i] in D:\n flg = False\n break\n\n if flg:\n print(ans)\n break\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589210862", "date2": "1589224541", "bleu_score": "0.6664305937084326", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 72, "total_score": 94, "input": "34782 1\n1\n", "actual_output": "no output\n", "expected_output": "34782\n\n", "anno_code": ["import re\n\n\n\ninput_1st=input() # (0): input_1st=34782 1\ninput_2nd=input() # (1): input_2nd=1\n\nN, K = input_1st.split(\" \") # (2): N=34782, K=1\nD = input_2nd.split(\" \") # (3): D=['1']\n\npattern = re.compile(\"|\".join(D)) # (4): pattern=re.compile('1')\n\n\nfor ans in range(int(N), 10000):\n result = re.findall(pattern, str(ans))\n if not result:\n print(ans)\n break\n"], "anno_status": [true], "diff_content": "-import re\n-\n-\n-\n input_1st=input()\n input_2nd=input()\n \n N, K = input_1st.split(\" \")\n D = input_2nd.split(\" \")\n \n-pattern = re.compile(\"|\".join(D))\n-\n+for ans in range(int(N), 100000):\n+ flg = True\n+ for i in range(len(str(ans))):\n+ if str(ans)[i] in D:\n+ flg = False\n+ break\n \n-for ans in range(int(N), 10000):\n- result = re.findall(pattern, str(ans))\n- if not result:\n+ if flg:\n print(ans)\n break\n \n", "FL_content": "-import re\n-\n-\n-\n input_1st=input()\n input_2nd=input()\n \n N, K = input_1st.split(\" \")\n D = input_2nd.split(\" \")\n \n-pattern = re.compile(\"|\".join(D))\n-\n \n-for ans in range(int(N), 10000):\n- result = re.findall(pattern, str(ans))\n- if not result:\n print(ans)\n break\n \n", "added_lines": 7, "removed_lines": 9, "code1_lines": 19 }, { "user_id": "u707870100", "problem_id": "p04039", "submission1_id": "s726895938", "submission2_id": "s653932056", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\n\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\nn=hoge[0]\nk=hoge[1]\n\nd=[]\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\nfor i in range(0,k):\n\td.append(hoge[i])\n\npayment=0\nfor i in range(0,10000-n+1):\n\tpayment=n+i\n\tfor j in range(0,k):\n\t\tif(str(d[j]) in str(payment)):\n\t\t\tbreak\n\t\tif(j==k-1):\n\t\t\tprint(payment)\n\t\t\tsys.exit()", "code2": "\n\nimport sys\n\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\nn=hoge[0]\nk=hoge[1]\n\nd=[]\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\nfor i in range(0,k):\n\td.append(hoge[i])\n\npayment=0\nfor i in range(0,100000):\n\tpayment=n+i\n\tfor j in range(0,k):\n\t\tif(str(d[j]) in str(payment)):\n\t\t\tbreak\n\t\tif(j==k-1):\n\t\t\tprint(payment)\n\t\t\tsys.exit()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564589334", "date2": "1564589634", "bleu_score": "0.9848964880107537", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 72, "total_score": 94, "input": "19738 1\n-1\n", "actual_output": "no output\n", "expected_output": "19738\n\n", "anno_code": ["\n\nimport sys\n\ntmp = input().split() # (0): tmp=['19738', '1']\nhoge = list(map(lambda a: int(a), tmp)) # (1): hoge=[19738, 1]\nn=hoge[0] # (2): n=19738\nk=hoge[1] # (3): k=1\n\nd=[] # (4): d=[]\ntmp = input().split() # (5): tmp=['-1']\nhoge = list(map(lambda a: int(a), tmp)) # (6): hoge=[-1]\nfor i in range(0,k): # (7): i=0 (9): NO CHANGE\n\td.append(hoge[i]) # (8): d=[-1]\n\npayment=0 # (10): payment=0\nfor i in range(0,10000-n+1):\n\tpayment=n+i\n\tfor j in range(0,k):\n\t\tif(str(d[j]) in str(payment)):\n\t\t\tbreak\n\t\tif(j==k-1):\n\t\t\tprint(payment)\n\t\t\tsys.exit()"], "anno_status": [true], "diff_content": " \n \n import sys\n \n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n n=hoge[0]\n k=hoge[1]\n \n d=[]\n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n for i in range(0,k):\n \td.append(hoge[i])\n \n payment=0\n-for i in range(0,10000-n+1):\n+for i in range(0,100000):\n \tpayment=n+i\n \tfor j in range(0,k):\n \t\tif(str(d[j]) in str(payment)):\n \t\t\tbreak\n \t\tif(j==k-1):\n \t\t\tprint(payment)\n \t\t\tsys.exit()\n", "FL_content": " \n \n import sys\n \n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n n=hoge[0]\n k=hoge[1]\n \n d=[]\n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n for i in range(0,k):\n \td.append(hoge[i])\n \n payment=0\n-for i in range(0,10000-n+1):\n \tpayment=n+i\n \tfor j in range(0,k):\n \t\tif(str(d[j]) in str(payment)):\n \t\t\tbreak\n \t\tif(j==k-1):\n \t\t\tprint(payment)\n \t\t\tsys.exit()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 24 }, { "user_id": "u878849567", "problem_id": "p04039", "submission1_id": "s777756045", "submission2_id": "s673262176", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int, input().split())\nd = list(input().split())\nans = 100000\nfor i in range(n, 10001):\n for j in range(k):\n if d[j] in str(i):\n break\n else:\n if ans > i:\n ans = i\nprint(ans)\n", "code2": "n, k = map(int, input().split())\nd = list(input().split())\nans = 100000\nfor i in range(n, 100001):\n for j in range(k):\n if d[j] in str(i):\n break\n else:\n if ans > i:\n ans = i\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586197635", "date2": "1586197924", "bleu_score": "0.9955848811461051", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 72, "total_score": 94, "input": "19727 1\n0\n", "actual_output": "100000\n", "expected_output": "19727\n\n", "anno_code": ["n, k = map(int, input().split()) # (0): n=19727, k=1\nd = list(input().split()) # (1): d=['0']\nans = 100000 # (2): ans=100000\nfor i in range(n, 10001): # (3): NO CHANGE\n for j in range(k):\n if d[j] in str(i):\n break\n else:\n if ans > i:\n ans = i\nprint(ans)\n"], "anno_status": [true], "diff_content": " n, k = map(int, input().split())\n d = list(input().split())\n ans = 100000\n-for i in range(n, 10001):\n+for i in range(n, 100001):\n for j in range(k):\n if d[j] in str(i):\n break\n else:\n if ans > i:\n ans = i\n print(ans)\n \n", "FL_content": " n, k = map(int, input().split())\n d = list(input().split())\n ans = 100000\n-for i in range(n, 10001):\n for j in range(k):\n if d[j] in str(i):\n break\n else:\n if ans > i:\n ans = i\n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u371763408", "problem_id": "p04039", "submission1_id": "s949780138", "submission2_id": "s005428046", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k=map(int,input().split())\nD=list(map(int,input().split()))\n\nfor i in range(n,10001):\n for j in str(i):\n if int(j) in D:\n break\n else:\n print(i)\n exit()", "code2": "n,k=map(int,input().split())\nD=list(map(int,input().split()))\n\nfor i in range(n,88889):\n for j in str(i):\n if int(j) in D:\n break\n else:\n print(i)\n exit()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554299727", "date2": "1554300000", "bleu_score": "0.9613539001024424", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 72, "total_score": 94, "input": "17691 1\n2\n", "actual_output": "no output\n", "expected_output": "17691\n\n", "anno_code": ["n,k=map(int,input().split()) # (0): n=17691, k=1\nD=list(map(int,input().split())) # (1): D=[2]\n\nfor i in range(n,10001):\n for j in str(i):\n if int(j) in D:\n break\n else:\n print(i)\n exit()"], "anno_status": [true], "diff_content": " n,k=map(int,input().split())\n D=list(map(int,input().split()))\n \n-for i in range(n,10001):\n+for i in range(n,88889):\n for j in str(i):\n if int(j) in D:\n break\n else:\n print(i)\n exit()\n", "FL_content": " n,k=map(int,input().split())\n D=list(map(int,input().split()))\n \n-for i in range(n,10001):\n for j in str(i):\n if int(j) in D:\n break\n else:\n print(i)\n exit()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u802963389", "problem_id": "p04039", "submission1_id": "s351972976", "submission2_id": "s729193441", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int, input().split())\na = list(input().split())\nfor i in range(n+1, 10**6):\n if all([j not in a for j in str(i)]):\n \n print(i)\n exit()", "code2": "n, k = map(int, input().split())\na = list(input().split())\nfor i in range(n, 10**6):\n if all([j not in a for j in str(i)]):\n \n print(i)\n exit()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568089918", "date2": "1568089993", "bleu_score": "0.9767025983530488", "code1_test_status": [0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0], "code1_test_score": 20, "total_score": 94, "input": "18 1\n0\n", "actual_output": "19\n", "expected_output": "18\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " n, k = map(int, input().split())\n a = list(input().split())\n-for i in range(n+1, 10**6):\n+for i in range(n, 10**6):\n if all([j not in a for j in str(i)]):\n \n print(i)\n exit()\n", "FL_content": " n, k = map(int, input().split())\n a = list(input().split())\n-for i in range(n+1, 10**6):\n if all([j not in a for j in str(i)]):\n \n print(i)\n exit()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u538381753", "problem_id": "p04039", "submission1_id": "s023550828", "submission2_id": "s991915497", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = [int(x) for x in input().split(' ')]\nd = set(x for x in input().split(' '))\n\nfor i in range(10000):\n if set(str(i)).isdisjoint(d) and i >= n:\n print(i)\n exit()", "code2": "n, k = [int(x) for x in input().split(' ')]\nd = set(x for x in input().split(' '))\n\nfor i in range(100000):\n if set(str(i)).isdisjoint(d) and i >= n:\n print(i)\n exit()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567464287", "date2": "1567464482", "bleu_score": "0.9945203417194042", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 72, "total_score": 94, "input": "20079 1\n-1\n", "actual_output": "no output\n", "expected_output": "20079\n\n", "anno_code": ["n, k = [int(x) for x in input().split(' ')] # (0): n=20079, k=1\nd = set(x for x in input().split(' ')) # (1): d={'-1'}\n\nfor i in range(10000): # (2): i=0 (4): i=1 ... (20000): i=9999\n if set(str(i)).isdisjoint(d) and i >= n: # (3): NO CHANGE (5): NO CHANGE ... (20001): NO CHANGE\n print(i)\n exit()"], "anno_status": [true], "diff_content": " n, k = [int(x) for x in input().split(' ')]\n d = set(x for x in input().split(' '))\n \n-for i in range(10000):\n+for i in range(100000):\n if set(str(i)).isdisjoint(d) and i >= n:\n print(i)\n exit()\n", "FL_content": " n, k = [int(x) for x in input().split(' ')]\n d = set(x for x in input().split(' '))\n \n-for i in range(10000):\n if set(str(i)).isdisjoint(d) and i >= n:\n print(i)\n exit()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u844789719", "problem_id": "p02839", "submission1_id": "s704997025", "submission2_id": "s332876090", "status1": "Wrong Answer", "status2": "Accepted", "code1": "I = [int(_) for _ in open(0).read().split()]\nH, W = I[:2]\nA = I[2:2 + H * W]\nB = I[2 + H * W:]\nD = [abs(a - b) for a, b in zip(A, B)]\ndp = [0] + [1] + [0] * (W - 1)\nfor h in range(H):\n dpo = dp\n dp = [0] * (W + 1)\n for w, d in enumerate(D[W * h:W * (h + 1)]):\n s = dp[w] | dpo[w + 1]\n dp[w + 1] = (s << d) | (s >> d)\n t = bin(s)[2:][-1 - d:][::-1]\n t += '0' * (d - len(t))\n dp[w + 1] |= int(t, 2)\nfor i in range(160 * 80):\n if dp[-1] & 2**i:\n print(i)\n exit()\n", "code2": "I = [int(_) for _ in open(0).read().split()]\nH, W = I[:2]\nA = I[2:2 + H * W]\nB = I[2 + H * W:]\nD = [abs(a - b) for a, b in zip(A, B)]\ndp = [0] + [1] + [0] * (W - 1)\nfor h in range(H):\n dpo = dp\n dp = [0] * (W + 1)\n for w, d in enumerate(D[W * h:W * (h + 1)]):\n s = dp[w] | dpo[w + 1]\n dp[w + 1] = (s << d) | (s >> d)\n if d:\n t = bin(s)[2:][::-1][:d + 1]\n t += '0' * (d + 1 - len(t))\n dp[w + 1] |= int(t, 2)\nfor i in range(160 * 80):\n if dp[-1] & 2**i:\n print(i)\n exit()\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1595641955", "date2": "1595642399", "bleu_score": "0.9352444332996089", "code1_test_status": [0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 6, "total_score": 102, "input": "1 3\n0 10 4\n151 14 1\n1 2 3\n3 2 6\n", "actual_output": "143\n", "expected_output": "144\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " I = [int(_) for _ in open(0).read().split()]\n H, W = I[:2]\n A = I[2:2 + H * W]\n B = I[2 + H * W:]\n D = [abs(a - b) for a, b in zip(A, B)]\n dp = [0] + [1] + [0] * (W - 1)\n for h in range(H):\n dpo = dp\n dp = [0] * (W + 1)\n for w, d in enumerate(D[W * h:W * (h + 1)]):\n s = dp[w] | dpo[w + 1]\n dp[w + 1] = (s << d) | (s >> d)\n- t = bin(s)[2:][-1 - d:][::-1]\n- t += '0' * (d - len(t))\n- dp[w + 1] |= int(t, 2)\n+ if d:\n+ t = bin(s)[2:][::-1][:d + 1]\n+ t += '0' * (d + 1 - len(t))\n+ dp[w + 1] |= int(t, 2)\n for i in range(160 * 80):\n if dp[-1] & 2**i:\n print(i)\n exit()\n \n", "FL_content": " I = [int(_) for _ in open(0).read().split()]\n H, W = I[:2]\n A = I[2:2 + H * W]\n B = I[2 + H * W:]\n D = [abs(a - b) for a, b in zip(A, B)]\n dp = [0] + [1] + [0] * (W - 1)\n for h in range(H):\n dpo = dp\n dp = [0] * (W + 1)\n for w, d in enumerate(D[W * h:W * (h + 1)]):\n s = dp[w] | dpo[w + 1]\n dp[w + 1] = (s << d) | (s >> d)\n- t = bin(s)[2:][-1 - d:][::-1]\n- t += '0' * (d - len(t))\n- dp[w + 1] |= int(t, 2)\n for i in range(160 * 80):\n if dp[-1] & 2**i:\n print(i)\n exit()\n \n", "added_lines": 4, "removed_lines": 3, "code1_lines": 20 }, { "user_id": "u708618797", "problem_id": "p02839", "submission1_id": "s865677868", "submission2_id": "s276845746", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nsys.setrecursionlimit(2147483647)\nINF=float(\"inf\")\nMOD=10**9+7\ninput=lambda:sys.stdin.readline().rstrip()\ndef resolve():\n ofs=6400\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 dp=[[0]*w for _ in range(h)]\n x=abs(A[0][0]-B[0][0])\n dp[0][0]|=((1<<(ofs+x))|(1<<(ofs-x)))\n\n from itertools import product\n for i,j in product(range(h),range(w)):\n x=abs(A[i][j]-B[i][j])\n t=0\n if(i-1>=0):\n t|=dp[i-1][j]\n if(j-1>=0):\n t|=dp[i][j-1]\n dp[i][j]=((t<>x))\n\n for i,s in enumerate(bin(dp[-1][-1])[-ofs-1:]):\n if(s=='1'):\n print(i)\n return\n \nresolve()\n", "code2": "\nimport sys\nsys.setrecursionlimit(2147483647)\nINF=float(\"inf\")\nMOD=10**9+7\ninput=lambda:sys.stdin.readline().rstrip()\ndef resolve():\n ofs=6400\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 dp=[[0]*w for _ in range(h)]\n x=abs(A[0][0]-B[0][0])\n dp[0][0]|=((1<<(ofs+x))|(1<<(ofs-x)))\n\n from itertools import product\n for i,j in product(range(h),range(w)):\n x=abs(A[i][j]-B[i][j])\n t=0\n if(i-1>=0):\n t|=dp[i-1][j]\n if(j-1>=0):\n t|=dp[i][j-1]\n dp[i][j]|=((t<>x))\n\n for i,s in enumerate(bin(dp[-1][-1])[-ofs-1:]):\n if(s=='1'):\n print(i)\n return\n \nresolve()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575874688", "date2": "1575874859", "bleu_score": "0.9968101940083974", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "1 3\n1 0 25\n83 2 2\n1 3 3\n7 2 6\n", "actual_output": "no output\n", "expected_output": "57\n\n", "anno_code": ["\nimport sys\nsys.setrecursionlimit(2147483647) # (0): NO CHANGE\nINF=float(\"inf\") # (1): INF=inf\nMOD=10**9+7 # (2): MOD=1000000007\ninput=lambda:sys.stdin.readline().rstrip() # (3): input= at 0x00000293FFAA9BD0>\ndef resolve(): # (4): resolve=\n ofs=6400 # (6): ofs=6400\n h,w=map(int,input().split()) # (7): h=1, w=3\n A=[list(map(int,input().split())) for _ in range(h)] # (8): A\n B=[list(map(int,input().split())) for _ in range(h)] # (9): B\n dp=[[0]*w for _ in range(h)] # (10): dp\n x=abs(A[0][0]-B[0][0]) # (11): x=82\n dp[0][0]|=((1<<(ofs+x))|(1<<(ofs-x))) # (12): dp, product=\n\n from itertools import product\n for i,j in product(range(h),range(w)): # (13): i=0, j=0 (19): j=1 ... (33): NO CHANGE\n x=abs(A[i][j]-B[i][j]) # (14): NO CHANGE (20): x=2 (27): x=23\n t=0 # (15): t=0 (21): NO CHANGE (28): NO CHANGE\n if(i-1>=0): # (16): NO CHANGE (22): NO CHANGE (29): NO CHANGE\n t|=dp[i-1][j]\n if(j-1>=0): # (17): NO CHANGE (23): NO CHANGE (30): NO CHANGE\n t|=dp[i][j-1] # (24): NO CHANGE (31): NO CHANGE\n dp[i][j]=((t<>x)) # (18): dp (25): NO CHANGE (32): NO CHANGE\n\n for i,s in enumerate(bin(dp[-1][-1])[-ofs-1:]): # (34): s=0 (36): i=1, s=b (38): i=2, s=0\n if(s=='1'): # (35): NO CHANGE (37): NO CHANGE (39): NO CHANGE\n print(i)\n return\n \nresolve() # (5): NO CHANGE\n"], "anno_status": [false], "diff_content": " \n import sys\n sys.setrecursionlimit(2147483647)\n INF=float(\"inf\")\n MOD=10**9+7\n input=lambda:sys.stdin.readline().rstrip()\n def resolve():\n ofs=6400\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 dp=[[0]*w for _ in range(h)]\n x=abs(A[0][0]-B[0][0])\n dp[0][0]|=((1<<(ofs+x))|(1<<(ofs-x)))\n \n from itertools import product\n for i,j in product(range(h),range(w)):\n x=abs(A[i][j]-B[i][j])\n t=0\n if(i-1>=0):\n t|=dp[i-1][j]\n if(j-1>=0):\n t|=dp[i][j-1]\n- dp[i][j]=((t<>x))\n+ dp[i][j]|=((t<>x))\n \n for i,s in enumerate(bin(dp[-1][-1])[-ofs-1:]):\n if(s=='1'):\n print(i)\n return\n \n resolve()\n \n", "FL_content": " \n import sys\n sys.setrecursionlimit(2147483647)\n INF=float(\"inf\")\n MOD=10**9+7\n input=lambda:sys.stdin.readline().rstrip()\n def resolve():\n ofs=6400\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 dp=[[0]*w for _ in range(h)]\n x=abs(A[0][0]-B[0][0])\n dp[0][0]|=((1<<(ofs+x))|(1<<(ofs-x)))\n \n from itertools import product\n for i,j in product(range(h),range(w)):\n x=abs(A[i][j]-B[i][j])\n t=0\n if(i-1>=0):\n t|=dp[i-1][j]\n if(j-1>=0):\n t|=dp[i][j-1]\n- dp[i][j]=((t<>x))\n \n for i,s in enumerate(bin(dp[-1][-1])[-ofs-1:]):\n if(s=='1'):\n print(i)\n return\n \n resolve()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 32 }, { "user_id": "u708618797", "problem_id": "p02839", "submission1_id": "s956231502", "submission2_id": "s276845746", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nsys.setrecursionlimit(2147483647)\nINF=float(\"inf\")\nMOD=10**9+7\ninput=lambda:sys.stdin.readline().rstrip()\ndef resolve():\n ofs=6400\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 dp=[[0]*w for _ in range(h)]\n x=abs(A[0][0]-B[0][0])\n dp[0][0]|=(1<<(ofs+x))|(1<<(ofs-x))\n\n from itertools import product\n for i,j in product(range(h),range(w)):\n x=abs(A[i][j]-B[i][j])\n t=0\n if(i-1>=0):\n t|=dp[i-1][j]\n if(j-1>=0):\n t|=dp[i][j-1]\n dp[i][j]=(t<>x)\n\n for i,s in enumerate(bin(dp[-1][-1])[ofs:]):\n if(s=='1'):\n print(i)\n return\n \nresolve()\n", "code2": "\nimport sys\nsys.setrecursionlimit(2147483647)\nINF=float(\"inf\")\nMOD=10**9+7\ninput=lambda:sys.stdin.readline().rstrip()\ndef resolve():\n ofs=6400\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 dp=[[0]*w for _ in range(h)]\n x=abs(A[0][0]-B[0][0])\n dp[0][0]|=((1<<(ofs+x))|(1<<(ofs-x)))\n\n from itertools import product\n for i,j in product(range(h),range(w)):\n x=abs(A[i][j]-B[i][j])\n t=0\n if(i-1>=0):\n t|=dp[i-1][j]\n if(j-1>=0):\n t|=dp[i][j-1]\n dp[i][j]|=((t<>x))\n\n for i,s in enumerate(bin(dp[-1][-1])[-ofs-1:]):\n if(s=='1'):\n print(i)\n return\n \nresolve()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575873149", "date2": "1575874859", "bleu_score": "0.981482674593877", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "2 3\n1 10 80\n80 10 1\n1 2 3\n4 2 6\n", "actual_output": "no output\n", "expected_output": "5\n\n", "anno_code": ["\nimport sys\nsys.setrecursionlimit(2147483647) # (0): NO CHANGE\nINF=float(\"inf\") # (1): INF=inf\nMOD=10**9+7 # (2): MOD=1000000007\ninput=lambda:sys.stdin.readline().rstrip() # (3): input= at 0x000001DE1C995BD0>\ndef resolve(): # (4): resolve=\n ofs=6400 # (6): ofs=6400\n h,w=map(int,input().split()) # (7): h=2, w=3\n A=[list(map(int,input().split())) for _ in range(h)] # (8): A\n B=[list(map(int,input().split())) for _ in range(h)] # (9): B\n dp=[[0]*w for _ in range(h)] # (10): dp\n x=abs(A[0][0]-B[0][0]) # (11): x=0\n dp[0][0]|=(1<<(ofs+x))|(1<<(ofs-x)) # (12): dp, product=\n\n from itertools import product\n for i,j in product(range(h),range(w)): # (13): i=0, j=0 (19): j=1 ... (56): NO CHANGE\n x=abs(A[i][j]-B[i][j]) # (14): NO CHANGE (20): x=8 ... (49): x=5\n t=0 # (15): t=0 (21): NO CHANGE ... (50): NO CHANGE\n if(i-1>=0): # (16): NO CHANGE (22): NO CHANGE ... (51): NO CHANGE\n t|=dp[i-1][j] # (37): NO CHANGE (44): NO CHANGE (52): NO CHANGE\n if(j-1>=0): # (17): NO CHANGE (23): NO CHANGE ... (53): NO CHANGE\n t|=dp[i][j-1] # (24): NO CHANGE (31): NO CHANGE ... (54): NO CHANGE\n dp[i][j]=(t<>x) # (18): dp (25): NO CHANGE ... (55): NO CHANGE\n\n for i,s in enumerate(bin(dp[-1][-1])[ofs:]):\n if(s=='1'):\n print(i)\n return\n \nresolve() # (5): NO CHANGE\n"], "anno_status": [false], "diff_content": " \n import sys\n sys.setrecursionlimit(2147483647)\n INF=float(\"inf\")\n MOD=10**9+7\n input=lambda:sys.stdin.readline().rstrip()\n def resolve():\n ofs=6400\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 dp=[[0]*w for _ in range(h)]\n x=abs(A[0][0]-B[0][0])\n- dp[0][0]|=(1<<(ofs+x))|(1<<(ofs-x))\n+ dp[0][0]|=((1<<(ofs+x))|(1<<(ofs-x)))\n \n from itertools import product\n for i,j in product(range(h),range(w)):\n x=abs(A[i][j]-B[i][j])\n t=0\n if(i-1>=0):\n t|=dp[i-1][j]\n if(j-1>=0):\n t|=dp[i][j-1]\n- dp[i][j]=(t<>x)\n+ dp[i][j]|=((t<>x))\n \n- for i,s in enumerate(bin(dp[-1][-1])[ofs:]):\n+ for i,s in enumerate(bin(dp[-1][-1])[-ofs-1:]):\n if(s=='1'):\n print(i)\n return\n \n resolve()\n \n", "FL_content": " \n import sys\n sys.setrecursionlimit(2147483647)\n INF=float(\"inf\")\n MOD=10**9+7\n input=lambda:sys.stdin.readline().rstrip()\n def resolve():\n ofs=6400\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 dp=[[0]*w for _ in range(h)]\n x=abs(A[0][0]-B[0][0])\n- dp[0][0]|=(1<<(ofs+x))|(1<<(ofs-x))\n \n from itertools import product\n for i,j in product(range(h),range(w)):\n x=abs(A[i][j]-B[i][j])\n t=0\n if(i-1>=0):\n t|=dp[i-1][j]\n if(j-1>=0):\n t|=dp[i][j-1]\n- dp[i][j]=(t<>x)\n \n- for i,s in enumerate(bin(dp[-1][-1])[ofs:]):\n if(s=='1'):\n print(i)\n return\n \n resolve()\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 32 }, { "user_id": "u714642969", "problem_id": "p02839", "submission1_id": "s941418214", "submission2_id": "s735487167", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(10**9)\nINF=10**18\ndef input():\n return sys.stdin.readline().rstrip()\n\ndef main():\n H,W=map(int,input().split())\n A=[[] for _ in range(H)]\n B=[[] for _ in range(H)]\n C=[[0]*W for _ in range(H)]\n minusdigit=80\n for i in range(H):\n A[i]=list(map(int,input().split()))\n for i in range(H):\n B[i]=list(map(int,input().split()))\n for i in range(H):\n for j in range(W):\n C[i][j]=abs(A[i][j]-B[i][j])\n dp=[[0]*W for _ in range(H)]\n dp[0][0]=((1<>C[0][0])\n for i in range(1,H):\n dp[i][0]=(dp[i-1][0]<>C[i][0])\n for j in range(1,W):\n dp[0][j]=(dp[0][j-1]<>C[0][j])\n \n for i in range(1,H):\n for j in range(1,W):\n dp[i][j]=(dp[i-1][j]<>C[i][j])|(dp[i][j-1]<>C[i][j])\n ans=dp[H-1][W-1]>>minusdigit\n for i in range(len(bin(ans))-2):\n if (ans>>i)&0b1==1:\n print(i)\n exit()\n \n \n\nif __name__ == '__main__':\n main()\n", "code2": "import sys\nsys.setrecursionlimit(10**9)\nINF = 10**18\n\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\ndef main():\n H, W = map(int, input().split())\n A = [[] for _ in range(H)]\n B = [[] for _ in range(H)]\n C = [[0] * W for _ in range(H)]\n minusdigit = 80 * 80 * 2\n for i in range(H):\n A[i] = list(map(int, input().split()))\n for i in range(H):\n B[i] = list(map(int, input().split()))\n for i in range(H):\n for j in range(W):\n C[i][j] = abs(A[i][j] - B[i][j])\n dp = [[0] * W for _ in range(H)]\n dp[0][0] = ((1 << minusdigit) << C[0][0]) | ((1 << minusdigit) >> C[0][0])\n for i in range(1, H):\n dp[i][0] = (dp[i - 1][0] << C[i][0]) | (dp[i - 1][0] >> C[i][0])\n for j in range(1, W):\n dp[0][j] = (dp[0][j - 1] << C[0][j]) | (dp[0][j - 1] >> C[0][j])\n\n for i in range(1, H):\n for j in range(1, W):\n dp[i][j] = (dp[i - 1][j] << C[i][j]) | (dp[i - 1][j] >> C[i][j]) | (dp[i][j - 1] << C[i][j]) | (dp[i][j - 1] >> C[i][j])\n ans = dp[H - 1][W - 1]\n for i in range(len(bin(ans)) - (2 + minusdigit)):\n if (ans >> (i + minusdigit)) & 0b1 == 1 or (-i + minusdigit >= 0 and (ans >> (-i + minusdigit)) & 0b1 == 1):\n print(i)\n exit()\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575942575", "date2": "1575950024", "bleu_score": "0.732562541218604", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 95, "total_score": 102, "input": "1 3\n0 9 133\n80 14 1\n1 2 3\n4 2 11\n", "actual_output": "57\n", "expected_output": "47\n\n", "anno_code": ["import sys\nsys.setrecursionlimit(10**9) # (0): NO CHANGE\nINF=10**18 # (1): INF=1000000000000000000\ndef input(): # (2): input=\n return sys.stdin.readline().rstrip()\n\ndef main(): # (3): main=\n H,W=map(int,input().split())\n A=[[] for _ in range(H)]\n B=[[] for _ in range(H)]\n C=[[0]*W for _ in range(H)]\n minusdigit=80\n for i in range(H):\n A[i]=list(map(int,input().split()))\n for i in range(H):\n B[i]=list(map(int,input().split()))\n for i in range(H):\n for j in range(W):\n C[i][j]=abs(A[i][j]-B[i][j])\n dp=[[0]*W for _ in range(H)]\n dp[0][0]=((1<>C[0][0])\n for i in range(1,H):\n dp[i][0]=(dp[i-1][0]<>C[i][0])\n for j in range(1,W):\n dp[0][j]=(dp[0][j-1]<>C[0][j])\n \n for i in range(1,H):\n for j in range(1,W):\n dp[i][j]=(dp[i-1][j]<>C[i][j])|(dp[i][j-1]<>C[i][j])\n ans=dp[H-1][W-1]>>minusdigit\n for i in range(len(bin(ans))-2):\n if (ans>>i)&0b1==1:\n print(i)\n exit()\n \n \n\nif __name__ == '__main__':\n main()\n"], "anno_status": [false], "diff_content": " import sys\n sys.setrecursionlimit(10**9)\n-INF=10**18\n+INF = 10**18\n+\n+\n def input():\n return sys.stdin.readline().rstrip()\n \n+\n def main():\n- H,W=map(int,input().split())\n- A=[[] for _ in range(H)]\n- B=[[] for _ in range(H)]\n- C=[[0]*W for _ in range(H)]\n- minusdigit=80\n+ H, W = map(int, input().split())\n+ A = [[] for _ in range(H)]\n+ B = [[] for _ in range(H)]\n+ C = [[0] * W for _ in range(H)]\n+ minusdigit = 80 * 80 * 2\n for i in range(H):\n- A[i]=list(map(int,input().split()))\n+ A[i] = list(map(int, input().split()))\n for i in range(H):\n- B[i]=list(map(int,input().split()))\n+ B[i] = list(map(int, input().split()))\n for i in range(H):\n for j in range(W):\n- C[i][j]=abs(A[i][j]-B[i][j])\n- dp=[[0]*W for _ in range(H)]\n- dp[0][0]=((1<>C[0][0])\n- for i in range(1,H):\n- dp[i][0]=(dp[i-1][0]<>C[i][0])\n- for j in range(1,W):\n- dp[0][j]=(dp[0][j-1]<>C[0][j])\n- \n- for i in range(1,H):\n- for j in range(1,W):\n- dp[i][j]=(dp[i-1][j]<>C[i][j])|(dp[i][j-1]<>C[i][j])\n- ans=dp[H-1][W-1]>>minusdigit\n- for i in range(len(bin(ans))-2):\n- if (ans>>i)&0b1==1:\n+ C[i][j] = abs(A[i][j] - B[i][j])\n+ dp = [[0] * W for _ in range(H)]\n+ dp[0][0] = ((1 << minusdigit) << C[0][0]) | ((1 << minusdigit) >> C[0][0])\n+ for i in range(1, H):\n+ dp[i][0] = (dp[i - 1][0] << C[i][0]) | (dp[i - 1][0] >> C[i][0])\n+ for j in range(1, W):\n+ dp[0][j] = (dp[0][j - 1] << C[0][j]) | (dp[0][j - 1] >> C[0][j])\n+\n+ for i in range(1, H):\n+ for j in range(1, W):\n+ dp[i][j] = (dp[i - 1][j] << C[i][j]) | (dp[i - 1][j] >> C[i][j]) | (dp[i][j - 1] << C[i][j]) | (dp[i][j - 1] >> C[i][j])\n+ ans = dp[H - 1][W - 1]\n+ for i in range(len(bin(ans)) - (2 + minusdigit)):\n+ if (ans >> (i + minusdigit)) & 0b1 == 1 or (-i + minusdigit >= 0 and (ans >> (-i + minusdigit)) & 0b1 == 1):\n print(i)\n exit()\n- \n- \n+\n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " import sys\n sys.setrecursionlimit(10**9)\n-INF=10**18\n def input():\n return sys.stdin.readline().rstrip()\n \n def main():\n- H,W=map(int,input().split())\n- A=[[] for _ in range(H)]\n- B=[[] for _ in range(H)]\n- C=[[0]*W for _ in range(H)]\n- minusdigit=80\n for i in range(H):\n- A[i]=list(map(int,input().split()))\n for i in range(H):\n- B[i]=list(map(int,input().split()))\n for i in range(H):\n for j in range(W):\n- C[i][j]=abs(A[i][j]-B[i][j])\n- dp=[[0]*W for _ in range(H)]\n- dp[0][0]=((1<>C[0][0])\n- for i in range(1,H):\n- dp[i][0]=(dp[i-1][0]<>C[i][0])\n- for j in range(1,W):\n- dp[0][j]=(dp[0][j-1]<>C[0][j])\n- \n- for i in range(1,H):\n- for j in range(1,W):\n- dp[i][j]=(dp[i-1][j]<>C[i][j])|(dp[i][j-1]<>C[i][j])\n- ans=dp[H-1][W-1]>>minusdigit\n- for i in range(len(bin(ans))-2):\n- if (ans>>i)&0b1==1:\n print(i)\n exit()\n- \n- \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 26, "removed_lines": 24, "code1_lines": 40 }, { "user_id": "u020390084", "problem_id": "p02839", "submission1_id": "s712069849", "submission2_id": "s257046511", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\n\n\ndef solve(H: int, W: int, A: \"List[List[int]]\", B: \"List[List[int]]\"):\n\n \n ab = [[0]*W for _ in range(H)]\n\n for h in range(H):\n for w in range(W):\n ab[h][w] = abs(A[h][w]-B[h][w])\n \n setlist = [set() for _ in range(H+W-1)]\n setlist[0].add(ab[0][0])\n for i in range(1,H+W-1):\n h = i\n w = 0\n while h >= 0:\n if h >= H or w>=W:\n h -= 1\n w += 1\n continue\n for num in setlist[i-1]:\n if abs(num+ab[h][w]) < 160:\n setlist[i].add(abs(num+ab[h][w]))\n setlist[i].add(abs(num-ab[h][w]))\n h -= 1\n w += 1\n \n print(min(setlist[H+W-2]))\n return\n\n\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n H = int(next(tokens)) \n W = int(next(tokens)) \n A = [[int(next(tokens)) for _ in range(W)] for _ in range(H)] \n B = [[int(next(tokens)) for _ in range(W)] for _ in range(H)] \n solve(H, W, A, B)\n\nif __name__ == '__main__':\n main()\n", "code2": "\nimport sys\n\ndef solve(H: int, W: int, A: \"List[List[int]]\", B: \"List[List[int]]\"):\n SA=[[0]*W for i in range(H)]\n MAX = (H+W)*80\n for i in range(H):\n for j in range(W):\n SA[i][j]=abs(A[i][j]-B[i][j])\n\n DP=[[0 for i in range(W)] for j in range(H)]\n DP[0][0]=1<>SA[i+1][j]\n\n if j>SA[i][j+1]\n\n ANS=1<\n\n \n ab = [[0]*W for _ in range(H)]\n\n for h in range(H):\n for w in range(W):\n ab[h][w] = abs(A[h][w]-B[h][w])\n \n setlist = [set() for _ in range(H+W-1)]\n setlist[0].add(ab[0][0])\n for i in range(1,H+W-1):\n h = i\n w = 0\n while h >= 0:\n if h >= H or w>=W:\n h -= 1\n w += 1\n continue\n for num in setlist[i-1]:\n if abs(num+ab[h][w]) < 160:\n setlist[i].add(abs(num+ab[h][w]))\n setlist[i].add(abs(num-ab[h][w]))\n h -= 1\n w += 1\n \n print(min(setlist[H+W-2]))\n return\n\n\n\ndef main(): # (1): main=\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n H = int(next(tokens)) \n W = int(next(tokens)) \n A = [[int(next(tokens)) for _ in range(W)] for _ in range(H)] \n B = [[int(next(tokens)) for _ in range(W)] for _ in range(H)] \n solve(H, W, A, B)\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [false], "diff_content": " \n import sys\n \n-\n def solve(H: int, W: int, A: \"List[List[int]]\", B: \"List[List[int]]\"):\n-\n- \n- ab = [[0]*W for _ in range(H)]\n-\n- for h in range(H):\n- for w in range(W):\n- ab[h][w] = abs(A[h][w]-B[h][w])\n- \n- setlist = [set() for _ in range(H+W-1)]\n- setlist[0].add(ab[0][0])\n- for i in range(1,H+W-1):\n- h = i\n- w = 0\n- while h >= 0:\n- if h >= H or w>=W:\n- h -= 1\n- w += 1\n- continue\n- for num in setlist[i-1]:\n- if abs(num+ab[h][w]) < 160:\n- setlist[i].add(abs(num+ab[h][w]))\n- setlist[i].add(abs(num-ab[h][w]))\n- h -= 1\n- w += 1\n- \n- print(min(setlist[H+W-2]))\n+ SA=[[0]*W for i in range(H)]\n+ MAX = (H+W)*80\n+ for i in range(H):\n+ for j in range(W):\n+ SA[i][j]=abs(A[i][j]-B[i][j])\n+\n+ DP=[[0 for i in range(W)] for j in range(H)]\n+ DP[0][0]=1<>SA[i+1][j]\n+\n+ if j>SA[i][j+1]\n+\n+ ANS=1<= 0:\n- if h >= H or w>=W:\n- h -= 1\n- w += 1\n- continue\n- for num in setlist[i-1]:\n- if abs(num+ab[h][w]) < 160:\n- setlist[i].add(abs(num+ab[h][w]))\n- setlist[i].add(abs(num-ab[h][w]))\n- h -= 1\n- w += 1\n- \n- print(min(setlist[H+W-2]))\n return\n \n \n \n def main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n H = int(next(tokens)) \n W = int(next(tokens)) \n A = [[int(next(tokens)) for _ in range(W)] for _ in range(H)] \n B = [[int(next(tokens)) for _ in range(W)] for _ in range(H)] \n solve(H, W, A, B)\n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 26, "removed_lines": 27, "code1_lines": 50 }, { "user_id": "u150641538", "problem_id": "p02839", "submission1_id": "s141266036", "submission2_id": "s248683558", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ndef input():\n return sys.stdin.readline()[:-1]\nh,w=map(int,input().split())\na=[list(map(int,input().split())) for i in range(h)]\nb=[list(map(int,input().split())) for i in range(h)]\nd=[[0 for i in range(w)] for j in range(h)]\nmaxd=1\nfor i in range(h):\n for j in range(w):\n d[i][j] = abs(a[i][j]-b[i][j])\n maxd=max(maxd,d[i][j])\ndp=[[0 for j in range(w)] for k in range(h)]\nc=20000\ndp[0][0] |= 1 << c+d[0][0]\nfor i in range(h):\n for j in range(w):\n if i+1> d[i+1][j]\n if j+1> d[i][j+1]\nm=1000000\ncnt = 0\nfor x in bin(dp[h-1][w-1])[2:][::-1]:\n m=min(m,abs(cnt-c))\n cnt+=1\nprint(m)", "code2": "import sys\ndef input():\n return sys.stdin.readline()[:-1]\nh,w=map(int,input().split())\na=[list(map(int,input().split())) for i in range(h)]\nb=[list(map(int,input().split())) for i in range(h)]\nd=[[0 for i in range(w)] for j in range(h)]\nmaxd=1\nfor i in range(h):\n for j in range(w):\n d[i][j] = abs(a[i][j]-b[i][j])\n maxd=max(maxd,d[i][j])\ndp=[[0 for j in range(w)] for k in range(h)]\nc=20000\ndp[0][0] |= 1 << c+d[0][0]\nfor i in range(h):\n for j in range(w):\n if i+1> d[i+1][j]\n if j+1> d[i][j+1]\nm=1000000\ncnt = 0\nfor x in bin(dp[h-1][w-1])[2:][::-1]:\n if x=='1':\n m=min(m,abs(cnt-c))\n cnt+=1\nprint(m)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575867402", "date2": "1575867461", "bleu_score": "0.9769836035581076", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 2, "total_score": 102, "input": "1 3\n0 7 1\n80 1 1\n1 2 5\n6 4 6\n", "actual_output": "0\n", "expected_output": "74\n\n", "anno_code": ["源代码执行有误\nTraceback (most recent call last):\n\n File \"G:\\Projects\\Python\\SummerProject\\CodeRepair\\Project\\CodeTest\\AutoComment\\tracer6_2_copy.py\", line 224, in \n\n add_comment_to_new_file(target_script, update_dict, to_file)\n\n File \"G:\\Projects\\Python\\SummerProject\\CodeRepair\\Project\\CodeTest\\AutoComment\\tracer6_2_copy.py\", line 161, in add_comment_to_new_file\n\n formatted_changes = [f\"({step}): {format_vars(change)}\" if change != \"NO CHANGE\" else f\"({step}): NO CHANGE\" for step, change in changes]\n\n File \"G:\\Projects\\Python\\SummerProject\\CodeRepair\\Project\\CodeTest\\AutoComment\\tracer6_2_copy.py\", line 161, in \n\n formatted_changes = [f\"({step}): {format_vars(change)}\" if change != \"NO CHANGE\" else f\"({step}): NO CHANGE\" for step, change in changes]\n\n File \"G:\\Projects\\Python\\SummerProject\\CodeRepair\\Project\\CodeTest\\AutoComment\\tracer6_2_copy.py\", line 126, in format_vars\n\n value_str = str(value).replace('\\n', ' ')\n\nValueError: Exceeds the limit (4300) for integer string conversion; use sys.set_int_max_str_digits() to increase the limit\n\n"], "anno_status": [true], "diff_content": " import sys\n def input():\n return sys.stdin.readline()[:-1]\n h,w=map(int,input().split())\n a=[list(map(int,input().split())) for i in range(h)]\n b=[list(map(int,input().split())) for i in range(h)]\n d=[[0 for i in range(w)] for j in range(h)]\n maxd=1\n for i in range(h):\n for j in range(w):\n d[i][j] = abs(a[i][j]-b[i][j])\n maxd=max(maxd,d[i][j])\n dp=[[0 for j in range(w)] for k in range(h)]\n c=20000\n dp[0][0] |= 1 << c+d[0][0]\n for i in range(h):\n for j in range(w):\n if i+1> d[i+1][j]\n if j+1> d[i][j+1]\n m=1000000\n cnt = 0\n for x in bin(dp[h-1][w-1])[2:][::-1]:\n- m=min(m,abs(cnt-c))\n+ if x=='1':\n+ m=min(m,abs(cnt-c))\n cnt+=1\n print(m)\n", "FL_content": " import sys\n def input():\n return sys.stdin.readline()[:-1]\n h,w=map(int,input().split())\n a=[list(map(int,input().split())) for i in range(h)]\n b=[list(map(int,input().split())) for i in range(h)]\n d=[[0 for i in range(w)] for j in range(h)]\n maxd=1\n for i in range(h):\n for j in range(w):\n d[i][j] = abs(a[i][j]-b[i][j])\n maxd=max(maxd,d[i][j])\n dp=[[0 for j in range(w)] for k in range(h)]\n c=20000\n dp[0][0] |= 1 << c+d[0][0]\n for i in range(h):\n for j in range(w):\n if i+1> d[i+1][j]\n if j+1> d[i][j+1]\n m=1000000\n cnt = 0\n for x in bin(dp[h-1][w-1])[2:][::-1]:\n- m=min(m,abs(cnt-c))\n cnt+=1\n print(m)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 29 }, { "user_id": "u155024797", "problem_id": "p02839", "submission1_id": "s692354686", "submission2_id": "s974960017", "status1": "Wrong Answer", "status2": "Accepted", "code1": "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 dp = [[set() for _ in range(W+1)] for _ in range(2)]\n dp[0][1].add(abs(A[0][0] - B[0][0]))\n for i in range(H):\n dp[(i+1) & 1] = [set() for _ in range(W+1)]\n for j in range(W):\n diff = abs(A[i][j] - B[i][j])\n dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x + diff), dp[i & 1][j+1]))\n dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x - diff), dp[i & 1][j+1]))\n dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x + diff), dp[(i+1) & 1][j]))\n dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x - diff), dp[(i+1) & 1][j]))\n print(min(dp[H & 1][W]))\n\n\nif __name__ == \"__main__\":\n main()\n", "code2": "def main():\n H, W = map(int, input().split())\n N = 80 * (H+W) \n A = [list(map(int, input().split())) for _ in range(H)]\n B = [list(map(int, input().split())) for _ in range(H)]\n dp = [[set() for _ in range(W+1)] for _ in range(2)]\n dp[0][1].add(0)\n def ltN(x): return x <= N\n for i in range(H):\n dp[(i+1) & 1] = [set() for _ in range(W+1)]\n for j in range(W):\n diff = abs(A[i][j] - B[i][j])\n tmp = set()\n for x in dp[i & 1][j + 1]:\n tmp.add(abs(x + diff))\n tmp.add(abs(x - diff))\n for x in dp[(i+1) & 1][j]:\n tmp.add(abs(x + diff))\n tmp.add(abs(x - diff))\n dp[(i+1) & 1][j+1] = tmp\n print(min(dp[H & 1][W]))\n\n\nif __name__ == \"__main__\":\n main()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1579924171", "date2": "1579927179", "bleu_score": "0.7679588919899263", "code1_test_status": [1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 6, "total_score": 102, "input": "1 3\n4 10 90\n80 14 1\n1 2 3\n4 2 6\n", "actual_output": "59\n", "expected_output": "9\n\n", "anno_code": ["def main(): # (0): 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 dp = [[set() for _ in range(W+1)] for _ in range(2)]\n dp[0][1].add(abs(A[0][0] - B[0][0]))\n for i in range(H):\n dp[(i+1) & 1] = [set() for _ in range(W+1)]\n for j in range(W):\n diff = abs(A[i][j] - B[i][j])\n dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x + diff), dp[i & 1][j+1]))\n dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x - diff), dp[i & 1][j+1]))\n dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x + diff), dp[(i+1) & 1][j]))\n dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x - diff), dp[(i+1) & 1][j]))\n print(min(dp[H & 1][W]))\n\n\nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " def main():\n H, W = map(int, input().split())\n+ N = 80 * (H+W) \n A = [list(map(int, input().split())) for _ in range(H)]\n B = [list(map(int, input().split())) for _ in range(H)]\n dp = [[set() for _ in range(W+1)] for _ in range(2)]\n- dp[0][1].add(abs(A[0][0] - B[0][0]))\n+ dp[0][1].add(0)\n+ def ltN(x): return x <= N\n for i in range(H):\n dp[(i+1) & 1] = [set() for _ in range(W+1)]\n for j in range(W):\n diff = abs(A[i][j] - B[i][j])\n- dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x + diff), dp[i & 1][j+1]))\n- dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x - diff), dp[i & 1][j+1]))\n- dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x + diff), dp[(i+1) & 1][j]))\n- dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x - diff), dp[(i+1) & 1][j]))\n+ tmp = set()\n+ for x in dp[i & 1][j + 1]:\n+ tmp.add(abs(x + diff))\n+ tmp.add(abs(x - diff))\n+ for x in dp[(i+1) & 1][j]:\n+ tmp.add(abs(x + diff))\n+ tmp.add(abs(x - diff))\n+ dp[(i+1) & 1][j+1] = tmp\n print(min(dp[H & 1][W]))\n \n \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": " 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 dp = [[set() for _ in range(W+1)] for _ in range(2)]\n- dp[0][1].add(abs(A[0][0] - B[0][0]))\n for i in range(H):\n dp[(i+1) & 1] = [set() for _ in range(W+1)]\n for j in range(W):\n diff = abs(A[i][j] - B[i][j])\n- dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x + diff), dp[i & 1][j+1]))\n- dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x - diff), dp[i & 1][j+1]))\n- dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x + diff), dp[(i+1) & 1][j]))\n- dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x - diff), dp[(i+1) & 1][j]))\n print(min(dp[H & 1][W]))\n \n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 11, "removed_lines": 5, "code1_lines": 20 }, { "user_id": "u874320250", "problem_id": "p02839", "submission1_id": "s540032712", "submission2_id": "s678026637", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, 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)]\nr_k = 80*10\ndiffs = [[abs(A[i][j] - B[i][j]) for j in range(W)] for i in range(H)]\ndp = [[[False] * r_k for _ in range(W+1)] for _ in range(H+1)]\nfor i in range(H+1):\n dp[i][0][0] = True\nfor j in range(W+1):\n dp[0][j][0] = True\nfor i in range(H):\n for j in range(W):\n diff = diffs[i][j]\n for k in range(r_k):\n dp[i + 1][j + 1][abs(k - diff)] = dp[i + 1][j][k] or dp[i][j +\n 1][k] or dp[i + 1][j + 1][abs(k - diff)]\n if k + diff < r_k:\n dp[i + 1][j + 1][k + diff] = dp[i + 1][j][k] or dp[i][j +\n 1][k] or dp[i + 1][j + 1][k+diff]\n\nfor k in range(r_k):\n if dp[H][W][k]:\n print(k)\n break\n", "code2": "H, 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)]\ndiffs = [[abs(A[i][j] - B[i][j]) for j in range(W)] for i in range(H)]\nmax_diff = 0\nfor diff in diffs:\n max_diff = max(max_diff, max(diff))\nr_k = max_diff*(H+W)\ndp = [[[False] * r_k for _ in range(W)] for _ in range(H)]\ndp[0][0][0] = True\nfor i in range(H):\n for j in range(W):\n diff = diffs[i][j]\n dp_ = dp[i][j]\n if j < W-1:\n dpj = dp[i][j + 1]\n for k in range(r_k):\n if dp_[k] == True:\n dpj[abs(k - diff)] = True\n if k+diff\nMI=lambda:map(int,input().split()) # (1): MI= at 0x000002ACBABD5B40>\nLI=lambda:list(map(int,input().split())) # (2): LI= at 0x000002ACBABD5C60>\n\nH,W=MI() # (3): H=1, W=3\nA=[LI() for _ in [0]*H] # (4): A\nB=[LI() for _ in [0]*H] # (5): B\n \nG=[[set() for i in range(W)] for j in range(H)] # (6): G\ndif=A[0][0]-B[0][0] # (7): dif=-10\nG[0][0].add(0) # (8): G\n\nM=80*(H+W) # (9): M=320\n\nfor h in range(H): # (10): h=0 (37): NO CHANGE\n for w in range(W): # (11): w=0 (19): w=1 ... (36): NO CHANGE\n d=A[h][w]-B[h][w] # (12): d=-10 (20): d=-4 (28): d=117\n for a in G[h][w]: # (13): a=0 (18): NO CHANGE ... (35): NO CHANGE\n if h!=H-1: # (14): NO CHANGE (22): NO CHANGE ... (33): NO CHANGE\n G[h+1][w].add(abs(a+d))\n G[h+1][w].add(abs(a-d))\n if w!=W-1: # (15): NO CHANGE (23): NO CHANGE ... (34): NO CHANGE\n G[h][w+1].add(abs(a+d)) # (16): G (24): G\n G[h][w+1].add(abs(a-d)) # (17): NO CHANGE (25): G\n \nres=set() # (38): res=set()\nfor a in G[H-1][W-1]: # (39): a=6 (41): a=14 (43): NO CHANGE\n res.add(a) # (40): res={6} (42): res={6, 14}\nd=A[H-1][W-1]-B[H-1][W-1] # (44): NO CHANGE\nfor a in G[H-1][W-1]: # (45): a=6 (48): a=14 (51): NO CHANGE\n res.add(abs(a+d)) # (46): res={123, 6, 14} (49): res={131, 6, 14, 111, 123}\n res.add(abs(a-d)) # (47): res={123, 14, 6, 111} (50): res={131, 6, 103, 14, 111, 123}\n\nres=sorted(list(res)) # (52): res=[6, 14, 103, 111, 123, 131]\nprint(min(res))\n"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n MI=lambda:map(int,input().split())\n LI=lambda:list(map(int,input().split()))\n \n H,W=MI()\n A=[LI() for _ in [0]*H]\n B=[LI() for _ in [0]*H]\n- \n+\n G=[[set() for i in range(W)] for j in range(H)]\n-dif=A[0][0]-B[0][0]\n G[0][0].add(0)\n \n-M=80*(H+W)\n-\n for h in range(H):\n for w in range(W):\n d=A[h][w]-B[h][w]\n for a in G[h][w]:\n if h!=H-1:\n G[h+1][w].add(abs(a+d))\n G[h+1][w].add(abs(a-d))\n if w!=W-1:\n G[h][w+1].add(abs(a+d))\n G[h][w+1].add(abs(a-d))\n- \n+\n res=set()\n-for a in G[H-1][W-1]:\n- res.add(a)\n d=A[H-1][W-1]-B[H-1][W-1]\n for a in G[H-1][W-1]:\n res.add(abs(a+d))\n res.add(abs(a-d))\n \n res=sorted(list(res))\n print(min(res))\n-\n", "FL_content": " import sys\n input = sys.stdin.readline\n MI=lambda:map(int,input().split())\n LI=lambda:list(map(int,input().split()))\n \n H,W=MI()\n A=[LI() for _ in [0]*H]\n B=[LI() for _ in [0]*H]\n- \n G=[[set() for i in range(W)] for j in range(H)]\n-dif=A[0][0]-B[0][0]\n G[0][0].add(0)\n \n-M=80*(H+W)\n-\n for h in range(H):\n for w in range(W):\n d=A[h][w]-B[h][w]\n for a in G[h][w]:\n if h!=H-1:\n G[h+1][w].add(abs(a+d))\n G[h+1][w].add(abs(a-d))\n if w!=W-1:\n G[h][w+1].add(abs(a+d))\n G[h][w+1].add(abs(a-d))\n- \n res=set()\n-for a in G[H-1][W-1]:\n- res.add(a)\n d=A[H-1][W-1]-B[H-1][W-1]\n for a in G[H-1][W-1]:\n res.add(abs(a+d))\n res.add(abs(a-d))\n \n res=sorted(list(res))\n print(min(res))\n-\n", "added_lines": 2, "removed_lines": 8, "code1_lines": 37 }, { "user_id": "u097121858", "problem_id": "p03147", "submission1_id": "s253769738", "submission2_id": "s774131122", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def min_other_than_zero(seq):\n seq = set(seq)\n if 0 in seq: seq.remove(0)\n return min(seq)\n\n\ndef water(H, start, stop):\n if max(H) == 0:\n return\n\n \n valley = min_other_than_zero(H[start:stop])\n for i in range(start, stop):\n H[i] -= valley\n global ans\n ans += valley\n\n \n valley_indices = [start + i for i, h in enumerate(H[start:stop]) if h == 0]\n if len(valley_indices) == 0:\n return\n if valley_indices[0] != start:\n valley_indices = [start - 1] + valley_indices\n if valley_indices[-1] != stop - 1:\n valley_indices += [stop]\n for i in range(len(valley_indices) - 1):\n if valley_indices[i + 1] - valley_indices[i] > 1:\n water(H, valley_indices[i] + 1, valley_indices[i + 1])\n\n\nN = int(input())\nH = [int(s) for s in input().split()]\n\nans = 0\nwater(H, 0, N)\nprint(ans)\n", "code2": "def water(H, start, stop):\n if max(H) == 0:\n return\n\n \n valley = min(H[start:stop])\n for i in range(start, stop):\n H[i] -= valley\n global ans\n ans += valley\n\n \n valley_indices = [start + i for i, h in enumerate(H[start:stop]) if h == 0]\n if valley_indices[0] != start:\n valley_indices = [start - 1] + valley_indices\n if valley_indices[-1] != stop - 1:\n valley_indices += [stop]\n for i in range(len(valley_indices) - 1):\n if valley_indices[i + 1] - valley_indices[i] > 1:\n water(H, valley_indices[i] + 1, valley_indices[i + 1])\n\n\nN = int(input())\nH = [int(s) for s in input().split()]\n\nans = 0\nwater(H, 0, N)\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558267719", "date2": "1558268221", "bleu_score": "0.7874918442402232", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 95, "total_score": 99, "input": "5\n2 0 8 3 0\n", "actual_output": "8\n", "expected_output": "10\n\n", "anno_code": ["def min_other_than_zero(seq): # (0): min_other_than_zero=\n seq = set(seq) # (8): seq={0, 8, 2, 3} (32): seq={1, -2, 6} ... (71): seq={5}\n if 0 in seq: seq.remove(0) # (9): H=[2, 0, 8, 3, 0], stop=5, start=0, valley=2 (33): H=[0, -2, 6, 1, -2], stop=5, start=1, valley=-2 ... (72): H=[0, 0, 5, 0, 0], stop=3, start=2, valley=5\n return min(seq)\n\n\ndef water(H, start, stop): # (1): water=\n if max(H) == 0: # (6): NO CHANGE (30): NO CHANGE ... (69): NO CHANGE\n return\n\n \n valley = min_other_than_zero(H[start:stop]) # (7): seq=[2, 0, 8, 3, 0] (31): seq=[-2, 6, 1, -2] ... (70): seq=[5]\n for i in range(start, stop): # (10): i=0 (12): i=1 ... (75): NO CHANGE\n H[i] -= valley # (11): H=[0, 0, 8, 3, 0] (13): H=[0, -2, 8, 3, 0] ... (74): H=[0, 0, 0, 0, 0]\n global ans\n ans += valley # (21): NO CHANGE (43): NO CHANGE ... (76): NO CHANGE\n\n \n valley_indices = [start + i for i, h in enumerate(H[start:stop]) if h == 0] # (22): valley_indices=[0] (44): valley_indices=[1, 4] ... (77): valley_indices=[2]\n if len(valley_indices) == 0: # (23): NO CHANGE (45): NO CHANGE ... (78): NO CHANGE\n return\n if valley_indices[0] != start: # (24): NO CHANGE (46): NO CHANGE ... (79): NO CHANGE\n valley_indices = [start - 1] + valley_indices # (64): valley_indices=[1, 3]\n if valley_indices[-1] != stop - 1: # (25): NO CHANGE (47): NO CHANGE ... (80): NO CHANGE\n valley_indices += [stop] # (26): valley_indices=[0, 5]\n for i in range(len(valley_indices) - 1): # (27): i=0 (48): i=0 ... (84): min_other_than_zero=, water=, N=5, ans=8\n if valley_indices[i + 1] - valley_indices[i] > 1: # (28): NO CHANGE (49): NO CHANGE (67): NO CHANGE\n water(H, valley_indices[i] + 1, valley_indices[i + 1]) # (29): start=1 (50): stop=4, start=2 (68): stop=3\n\n\nN = int(input()) # (2): N=5\nH = [int(s) for s in input().split()] # (3): H=[2, 0, 8, 3, 0]\n\nans = 0 # (4): ans=0\nwater(H, 0, N) # (5): stop=5, start=0\nprint(ans)\n"], "anno_status": [false], "diff_content": "-def min_other_than_zero(seq):\n- seq = set(seq)\n- if 0 in seq: seq.remove(0)\n- return min(seq)\n-\n-\n def water(H, start, stop):\n if max(H) == 0:\n return\n \n \n- valley = min_other_than_zero(H[start:stop])\n+ valley = min(H[start:stop])\n for i in range(start, stop):\n H[i] -= valley\n global ans\n ans += valley\n \n \n valley_indices = [start + i for i, h in enumerate(H[start:stop]) if h == 0]\n- if len(valley_indices) == 0:\n- return\n if valley_indices[0] != start:\n valley_indices = [start - 1] + valley_indices\n if valley_indices[-1] != stop - 1:\n valley_indices += [stop]\n for i in range(len(valley_indices) - 1):\n if valley_indices[i + 1] - valley_indices[i] > 1:\n water(H, valley_indices[i] + 1, valley_indices[i + 1])\n \n \n N = int(input())\n H = [int(s) for s in input().split()]\n \n ans = 0\n water(H, 0, N)\n print(ans)\n \n", "FL_content": "-def min_other_than_zero(seq):\n- seq = set(seq)\n- if 0 in seq: seq.remove(0)\n- return min(seq)\n-\n-\n def water(H, start, stop):\n if max(H) == 0:\n return\n \n \n- valley = min_other_than_zero(H[start:stop])\n for i in range(start, stop):\n H[i] -= valley\n global ans\n ans += valley\n \n \n valley_indices = [start + i for i, h in enumerate(H[start:stop]) if h == 0]\n- if len(valley_indices) == 0:\n- return\n if valley_indices[0] != start:\n valley_indices = [start - 1] + valley_indices\n if valley_indices[-1] != stop - 1:\n valley_indices += [stop]\n for i in range(len(valley_indices) - 1):\n if valley_indices[i + 1] - valley_indices[i] > 1:\n water(H, valley_indices[i] + 1, valley_indices[i + 1])\n \n \n N = int(input())\n H = [int(s) for s in input().split()]\n \n ans = 0\n water(H, 0, N)\n print(ans)\n \n", "added_lines": 1, "removed_lines": 9, "code1_lines": 37 }, { "user_id": "u112324182", "problem_id": "p03147", "submission1_id": "s653316953", "submission2_id": "s200949660", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nh = list(map(int,input().split()))\nh.insert(0,0)\nsum = 0\nbottom = 0\nfor i, hn in enumerate(h):\n if (i == 0) :\n continue\n if (hn < h[i-1]):\n sum += (h[i-1] - bottom)\n bottom = hn\nend = bottom if h[n-1] < h[n] else 0\nprint(sum+end)", "code2": "n = int(input())\nh = list(map(int,input().split()))\nh.insert(0,0)\nsum = 0\nbottom = 0\nfor i, hn in enumerate(h):\n if (i == 0) :\n continue\n if (hn < h[i-1]):\n bottom = hn\n else:\n sum += hn - h[i-1]\nprint(sum)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1570641331", "date2": "1570643217", "bleu_score": "0.7950038985141609", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1], "code1_test_score": 46, "total_score": 99, "input": "8\n6 23 136 1 23 32 50 100\n", "actual_output": "137\n", "expected_output": "235\n\n", "anno_code": ["n = int(input()) # (0): n=8\nh = list(map(int,input().split())) # (1): h=[6, 23, 136, 1, 23, 32, 50, 100]\nh.insert(0,0) # (2): h=[0, 6, 23, 136, 1, 23, 32, 50, 100]\nsum = 0 # (3): sum=0\nbottom = 0 # (4): bottom=0\nfor i, hn in enumerate(h): # (5): i=0, hn=0 (8): i=1, hn=6 ... (34): NO CHANGE\n if (i == 0) : # (6): NO CHANGE (9): NO CHANGE ... (32): NO CHANGE\n continue # (7): NO CHANGE\n if (hn < h[i-1]): # (10): NO CHANGE (13): NO CHANGE ... (33): NO CHANGE\n sum += (h[i-1] - bottom) # (20): sum=136\n bottom = hn # (21): bottom=1\nend = bottom if h[n-1] < h[n] else 0 # (35): end=1\nprint(sum+end)"], "anno_status": [true], "diff_content": " n = int(input())\n h = list(map(int,input().split()))\n h.insert(0,0)\n sum = 0\n bottom = 0\n for i, hn in enumerate(h):\n if (i == 0) :\n continue\n if (hn < h[i-1]):\n- sum += (h[i-1] - bottom)\n bottom = hn\n-end = bottom if h[n-1] < h[n] else 0\n-print(sum+end)\n+ else:\n+ sum += hn - h[i-1]\n+print(sum)\n", "FL_content": " n = int(input())\n h = list(map(int,input().split()))\n h.insert(0,0)\n sum = 0\n bottom = 0\n for i, hn in enumerate(h):\n if (i == 0) :\n continue\n if (hn < h[i-1]):\n- sum += (h[i-1] - bottom)\n bottom = hn\n-end = bottom if h[n-1] < h[n] else 0\n-print(sum+end)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 13 }, { "user_id": "u271752821", "problem_id": "p03147", "submission1_id": "s491864737", "submission2_id": "s268341511", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nhs = [int(i) for i in input().split()]\nflag = -1\ncount = 0\n\nwhile max(hs) > 0:\n for i in range(n):\n if hs[i] > 0:\n if flag == 1:\n if i == n - 1:\n flag *= -1\n hs[i] -= 1\n else:\n count += 1\n flag *= -1\n hs[i] -= 1\n else:\n if flag == 1: \n flag *= -1\nprint(count)", "code2": "n = int(input())\nhs = [int(i) for i in input().split()]\nflag = -1\ncount = 0\n\nwhile max(hs) > 0:\n flag = -1\n for i in range(n):\n if hs[i] > 0:\n if flag == 1:\n hs[i] -= 1\n else:\n count += 1\n flag = 1\n hs[i] -= 1\n else:\n if flag == 1: \n flag = -1\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583880764", "date2": "1583882199", "bleu_score": "0.8635213137846783", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1], "code1_test_score": 93, "total_score": 99, "input": "8\n4 65 110 2 5 88 0 101\n", "actual_output": "294\n", "expected_output": "297\n\n", "anno_code": ["n = int(input()) # (0): n=8\nhs = [int(i) for i in input().split()] # (1): hs=[4, 65, 110, 2, 5, 88, 0, 101]\nflag = -1 # (2): flag=-1\ncount = 0 # (3): count=0\n\nwhile max(hs) > 0: # (4): NO CHANGE (47): NO CHANGE ... (4202): NO CHANGE\n for i in range(n): # (5): i=0 (11): i=1 ... (4201): NO CHANGE\n if hs[i] > 0: # (6): NO CHANGE (12): NO CHANGE ... (4199): NO CHANGE\n if flag == 1: # (7): NO CHANGE (13): NO CHANGE ... (4181): NO CHANGE\n if i == n - 1: # (14): NO CHANGE (19): NO CHANGE ... (2589): NO CHANGE\n flag *= -1\n hs[i] -= 1 # (15): hs=[3, 64, 110, 2, 5, 88, 0, 101] (20): hs=[3, 64, 109, 2, 5, 88, 0, 101] ... (2590): hs=[0, 0, 45, 0, 0, 24, 0, 37]\n else:\n count += 1 # (8): count=1 (43): count=2 ... (4182): count=294\n flag *= -1 # (9): flag=1 (44): flag=1 ... (4183): flag=1\n hs[i] -= 1 # (10): hs=[3, 65, 110, 2, 5, 88, 0, 101] (45): hs=[3, 64, 109, 1, 4, 87, 0, 100] ... (4184): hs=[0, 0, 0, 0, 0, 0, 0, 0]\n else:\n if flag == 1: # (38): NO CHANGE (80): NO CHANGE ... (4200): NO CHANGE\n flag *= -1 # (39): flag=-1 (81): flag=-1 ... (4188): flag=-1\nprint(count)"], "anno_status": [true], "diff_content": " n = int(input())\n hs = [int(i) for i in input().split()]\n flag = -1\n count = 0\n \n while max(hs) > 0:\n+ flag = -1\n for i in range(n):\n if hs[i] > 0:\n if flag == 1:\n- if i == n - 1:\n- flag *= -1\n hs[i] -= 1\n else:\n count += 1\n- flag *= -1\n+ flag = 1\n hs[i] -= 1\n else:\n if flag == 1: \n- flag *= -1\n+ flag = -1\n print(count)\n", "FL_content": " n = int(input())\n hs = [int(i) for i in input().split()]\n flag = -1\n count = 0\n \n while max(hs) > 0:\n for i in range(n):\n if hs[i] > 0:\n if flag == 1:\n- if i == n - 1:\n- flag *= -1\n hs[i] -= 1\n else:\n count += 1\n- flag *= -1\n hs[i] -= 1\n else:\n if flag == 1: \n- flag *= -1\n print(count)\n", "added_lines": 3, "removed_lines": 4, "code1_lines": 20 }, { "user_id": "u518064858", "problem_id": "p03147", "submission1_id": "s598782996", "submission2_id": "s964825177", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nh=list(map(int,input().split()))\nans=0\nwhile any(h)==True:\n flag=0\n for i in range(n):\n if h[i]>0:\n h[i]-=1\n flag=1\n else:\n if flag==1:\n ans+=1\n flag=0\n if i==n-2:\n if h[n-1]>0:\n h[n-1]-=1\n ans+=1\n break\n else:\n if h[i]>0:\n ans+=1\n break\nprint(ans)\n", "code2": "n=int(input())\nh=list(map(int,input().split()))\nans=0\nif n==1:\n print(h[0])\n exit()\nwhile any(h)==True:\n flag=0\n for i in range(n-1):\n if h[i]>0:\n h[i]-=1\n flag=1\n else:\n if flag==1:\n ans+=1\n flag=0\n if i==n-2:\n if h[n-1]>0:\n h[n-1]-=1\n ans+=1\n else:\n if flag==1:\n ans+=1\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553718380", "date2": "1553719700", "bleu_score": "0.9036593522606018", "code1_test_status": [0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1], "code1_test_score": 67, "total_score": 99, "input": "5\n3 1 2 3 1\n", "actual_output": "4\n", "expected_output": "5\n", "anno_code": ["n=int(input()) # (0): n=5\nh=list(map(int,input().split())) # (1): h=[3, 1, 2, 3, 1]\nans=0 # (2): ans=0\nwhile any(h)==True: # (3): NO CHANGE (29): NO CHANGE ... (81): NO CHANGE\n flag=0 # (4): flag=0 (30): flag=0 (57): flag=0\n for i in range(n): # (5): i=0 (10): i=1 ... (73): i=3\n if h[i]>0: # (6): NO CHANGE (11): NO CHANGE ... (74): NO CHANGE\n h[i]-=1 # (7): h=[2, 1, 2, 3, 1] (12): h=[2, 0, 2, 3, 1] ... (75): h=[0, 0, 0, 0, 0]\n flag=1 # (8): flag=1 (13): NO CHANGE ... (76): flag=1\n else:\n if flag==1: # (38): NO CHANGE (65): NO CHANGE (71): NO CHANGE\n ans+=1 # (39): ans=2 (66): ans=4\n flag=0 # (40): flag=0 (67): flag=0\n if i==n-2: # (9): NO CHANGE (14): NO CHANGE ... (77): NO CHANGE\n if h[n-1]>0: # (25): NO CHANGE (52): NO CHANGE (78): NO CHANGE\n h[n-1]-=1 # (26): h=[2, 0, 1, 2, 0]\n ans+=1 # (27): ans=1\n break # (28): NO CHANGE\n else:\n if h[i]>0: # (53): NO CHANGE (79): NO CHANGE\n ans+=1 # (54): ans=3\n break # (55): NO CHANGE (80): NO CHANGE\nprint(ans)\n"], "anno_status": [true], "diff_content": " n=int(input())\n h=list(map(int,input().split()))\n ans=0\n+if n==1:\n+ print(h[0])\n+ exit()\n while any(h)==True:\n flag=0\n- for i in range(n):\n+ for i in range(n-1):\n if h[i]>0:\n h[i]-=1\n flag=1\n else:\n if flag==1:\n ans+=1\n flag=0\n if i==n-2:\n if h[n-1]>0:\n h[n-1]-=1\n ans+=1\n- break\n else:\n- if h[i]>0:\n+ if flag==1:\n ans+=1\n- break\n print(ans)\n \n", "FL_content": " n=int(input())\n h=list(map(int,input().split()))\n ans=0\n while any(h)==True:\n flag=0\n- for i in range(n):\n if h[i]>0:\n h[i]-=1\n flag=1\n else:\n if flag==1:\n ans+=1\n flag=0\n if i==n-2:\n if h[n-1]>0:\n h[n-1]-=1\n ans+=1\n- break\n else:\n- if h[i]>0:\n ans+=1\n- break\n print(ans)\n \n", "added_lines": 5, "removed_lines": 4, "code1_lines": 24 }, { "user_id": "u397953026", "problem_id": "p03147", "submission1_id": "s093805830", "submission2_id": "s648780584", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nh = list(map(int,input().split()))\nans = 0\ntmp = 0\nfor i in range(len(h)):\n print(h[i])\n if tmp < h[i]:\n ans += h[i] - tmp\n tmp = h[i]\nprint(ans)", "code2": "n = int(input())\nh = list(map(int,input().split()))\nans = 0\ntmp = 0\nfor i in range(len(h)):\n if tmp < h[i]:\n ans += h[i] - tmp\n tmp = h[i]\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592966710", "date2": "1592966729", "bleu_score": "0.9059551911095096", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 99, "input": "8\n6 23 15 0 23 1 50 100\n", "actual_output": "6\n23\n15\n0\n23\n1\n50\n100\n145\n", "expected_output": "145\n\n", "anno_code": ["n = int(input()) # (0): n=8\nh = list(map(int,input().split())) # (1): h=[6, 23, 15, 0, 23, 1, 50, 100]\nans = 0 # (2): ans=0\ntmp = 0 # (3): tmp=0\nfor i in range(len(h)): # (4): i=0 (9): i=1 ... (41): NO CHANGE\n print(h[i]) # (5): NO CHANGE (10): NO CHANGE ... (37): NO CHANGE\n if tmp < h[i]: # (6): NO CHANGE (11): NO CHANGE ... (38): NO CHANGE\n ans += h[i] - tmp # (7): ans=6 (12): ans=23 ... (39): ans=145\n tmp = h[i] # (8): tmp=6 (13): tmp=23 ... (40): tmp=100\nprint(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n h = list(map(int,input().split()))\n ans = 0\n tmp = 0\n for i in range(len(h)):\n- print(h[i])\n if tmp < h[i]:\n ans += h[i] - tmp\n tmp = h[i]\n print(ans)\n", "FL_content": " n = int(input())\n h = list(map(int,input().split()))\n ans = 0\n tmp = 0\n for i in range(len(h)):\n- print(h[i])\n if tmp < h[i]:\n ans += h[i] - tmp\n tmp = h[i]\n print(ans)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u619455726", "problem_id": "p03147", "submission1_id": "s867863500", "submission2_id": "s059877023", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nn=int(input()) \nglobal h\nh=list(map(int, input().split())) \nglobal cnt\ncnt=0\nwhile sum(h) !=0:\n for L in range(0,len(h)):\n if h[L] != 0:\n for r in range(L+1 ,len(h)):\n if h[r] == 0:\n \n for k in range(L,r):\n h[k]-=1\n cnt+=1\n break\n else:\n r = len(h)\n for k in range(L,r):\n h[k]-=1\n cnt+=1\n break\nprint(cnt)\n", "code2": "\n\nn=int(input()) \nh=list(map(int, input().split())) \ncnt=0\nL=0\nwhile L != len(h):\n if h[L] != 0:\n for r in range(L+1 ,len(h)):\n if h[r] == 0:\n \n for k in range(L,r):\n h[k]-=1\n cnt+=1\n break\n else:\n r = len(h)\n for k in range(L,r):\n h[k]-=1\n cnt+=1\n elif h[L] == 0:\n L+=1\nprint(cnt)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569258269", "date2": "1569258826", "bleu_score": "0.7755406461030453", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 42, "total_score": 99, "input": "8\n3 65 13 0 0 84 8 011\n", "actual_output": "157\n", "expected_output": "152\n\n", "anno_code": ["\n\nn=int(input()) # (0): n=8\nglobal h\nh=list(map(int, input().split())) # (1): h=[3, 65, 13, 0, 0, 84, 8, 11]\nglobal cnt\ncnt=0 # (2): cnt=0\nwhile sum(h) !=0: # (3): NO CHANGE (64): NO CHANGE ... (2679): NO CHANGE\n for L in range(0,len(h)): # (4): L=0 (21): L=1 ... (2678): NO CHANGE\n if h[L] != 0: # (5): NO CHANGE (22): NO CHANGE ... (2677): NO CHANGE\n for r in range(L+1 ,len(h)): # (6): r=1 (8): r=2 ... (2667): NO CHANGE\n if h[r] == 0: # (7): NO CHANGE (9): NO CHANGE ... (2668): NO CHANGE\n \n for k in range(L,r): # (12): k=0 (14): k=1 ... (2671): NO CHANGE\n h[k]-=1 # (13): h=[2, 65, 13, 0, 0, 84, 8, 11] (15): h=[2, 64, 13, 0, 0, 84, 8, 11] ... (2670): h=[0, 0, 0, 0, 0, 0, 0, 0]\n cnt+=1 # (19): cnt=1 (32): cnt=2 ... (2672): cnt=157\n break # (20): NO CHANGE (33): NO CHANGE ... (2673): NO CHANGE\n else:\n r = len(h) # (54): r=8 (115): r=8 ... (491): r=8\n for k in range(L,r): # (55): k=5 (57): k=6 ... (494): NO CHANGE\n h[k]-=1 # (56): h=[2, 63, 10, 0, 0, 83, 8, 11] (58): h=[2, 63, 10, 0, 0, 83, 7, 11] ... (493): h=[0, 51, 0, 0, 0, 73, 0, 0]\n cnt+=1 # (62): cnt=4 (123): cnt=8 ... (495): cnt=33\n break # (63): NO CHANGE (124): NO CHANGE ... (496): NO CHANGE\nprint(cnt)\n"], "anno_status": [true], "diff_content": " \n \n n=int(input()) \n-global h\n h=list(map(int, input().split())) \n-global cnt\n cnt=0\n-while sum(h) !=0:\n- for L in range(0,len(h)):\n- if h[L] != 0:\n- for r in range(L+1 ,len(h)):\n- if h[r] == 0:\n- \n- for k in range(L,r):\n- h[k]-=1\n- cnt+=1\n- break\n- else:\n- r = len(h)\n+L=0\n+while L != len(h):\n+ if h[L] != 0:\n+ for r in range(L+1 ,len(h)):\n+ if h[r] == 0:\n+ \n for k in range(L,r):\n h[k]-=1\n cnt+=1\n break\n+ else:\n+ r = len(h)\n+ for k in range(L,r):\n+ h[k]-=1\n+ cnt+=1\n+ elif h[L] == 0:\n+ L+=1\n print(cnt)\n \n", "FL_content": " \n \n n=int(input()) \n-global h\n h=list(map(int, input().split())) \n-global cnt\n cnt=0\n-while sum(h) !=0:\n- for L in range(0,len(h)):\n- if h[L] != 0:\n- for r in range(L+1 ,len(h)):\n- if h[r] == 0:\n- \n- for k in range(L,r):\n- h[k]-=1\n- cnt+=1\n- break\n- else:\n- r = len(h)\n for k in range(L,r):\n h[k]-=1\n cnt+=1\n break\n print(cnt)\n \n", "added_lines": 13, "removed_lines": 14, "code1_lines": 25 }, { "user_id": "u337626942", "problem_id": "p03147", "submission1_id": "s485632901", "submission2_id": "s909688610", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nh=list(map(int, input().split()))\nans=0\n\nfor i in range(n-1):\n ans+=max(h[i+1]-h[i], 0)\n\nprint(ans)", "code2": "n=int(input())\nh=[0]+list(map(int, input().split()))\nans=0\n\nfor i in range(n):\n ans+=max(h[i+1]-h[i],0)\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590088783", "date2": "1590088912", "bleu_score": "0.9262857197456473", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 3, "total_score": 99, "input": "8\n4 2 75 0 21 13 66 101\n", "actual_output": "182\n", "expected_output": "186\n\n", "anno_code": ["n=int(input()) # (0): n=8\nh=list(map(int, input().split())) # (1): h=[4, 2, 75, 0, 21, 13, 66, 101]\nans=0 # (2): ans=0\n\nfor i in range(n-1): # (3): i=0 (5): i=1 ... (17): NO CHANGE\n ans+=max(h[i+1]-h[i], 0) # (4): NO CHANGE (6): ans=73 ... (16): ans=182\n\nprint(ans)"], "anno_status": [true], "diff_content": " n=int(input())\n-h=list(map(int, input().split()))\n+h=[0]+list(map(int, input().split()))\n ans=0\n \n-for i in range(n-1):\n- ans+=max(h[i+1]-h[i], 0)\n+for i in range(n):\n+ ans+=max(h[i+1]-h[i],0)\n \n print(ans)\n", "FL_content": " n=int(input())\n-h=list(map(int, input().split()))\n ans=0\n \n-for i in range(n-1):\n- ans+=max(h[i+1]-h[i], 0)\n \n print(ans)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u068727970", "problem_id": "p03147", "submission1_id": "s455555736", "submission2_id": "s600706209", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nh = list(map(int, input().split()))\ncounter = 0\nfin = [0 for _ in range(N)]\n\nwhile not h == fin:\n for i in range(1, N-1):\n if h[i] == 0 and not h[i-1] == 0:\n counter += 1\n counter += 1\n for i in range(N):\n if not h[i] == 0:\n h[i] -= 1\n\n\nprint(counter)\n", "code2": "N = int(input())\nh = [0] + list(map(int, input().split())) + [0]\ncounter = 0\nfin = [0 for _ in range(N+2)]\n\nwhile not h == fin:\n for i in range(1, N+2):\n if h[i] == 0 and not h[i-1] == 0:\n counter += 1\n for i in range(1, N+1):\n if not h[i] == 0:\n h[i] -= 1\n\n\nprint(counter)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587626184", "date2": "1587627449", "bleu_score": "0.9184526738947268", "code1_test_status": [0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 29, "total_score": 99, "input": "5\n1 1 6 3 1\n", "actual_output": "9\n", "expected_output": "6\n\n", "anno_code": ["N = int(input()) # (0): N=5\nh = list(map(int, input().split())) # (1): h=[1, 1, 6, 3, 1]\ncounter = 0 # (2): counter=0\nfin = [0 for _ in range(N)] # (3): fin=[0, 0, 0, 0, 0]\n\nwhile not h == fin: # (4): NO CHANGE (29): NO CHANGE ... (139): NO CHANGE\n for i in range(1, N-1): # (5): i=1 (7): i=2 ... (125): NO CHANGE\n if h[i] == 0 and not h[i-1] == 0: # (6): NO CHANGE (8): NO CHANGE ... (123): NO CHANGE\n counter += 1 # (80): counter=4 (102): counter=6 (124): counter=8\n counter += 1 # (12): counter=1 (37): counter=2 ... (126): counter=9\n for i in range(N): # (13): i=0 (16): i=1 ... (138): NO CHANGE\n if not h[i] == 0: # (14): NO CHANGE (17): NO CHANGE ... (137): NO CHANGE\n h[i] -= 1 # (15): h=[0, 1, 6, 3, 1] (18): h=[0, 0, 6, 3, 1] ... (133): h=[0, 0, 0, 0, 0]\n\n\nprint(counter)\n"], "anno_status": [true], "diff_content": " N = int(input())\n-h = list(map(int, input().split()))\n+h = [0] + list(map(int, input().split())) + [0]\n counter = 0\n-fin = [0 for _ in range(N)]\n+fin = [0 for _ in range(N+2)]\n \n while not h == fin:\n- for i in range(1, N-1):\n+ for i in range(1, N+2):\n if h[i] == 0 and not h[i-1] == 0:\n counter += 1\n- counter += 1\n- for i in range(N):\n+ for i in range(1, N+1):\n if not h[i] == 0:\n h[i] -= 1\n \n \n print(counter)\n \n", "FL_content": " N = int(input())\n-h = list(map(int, input().split()))\n counter = 0\n-fin = [0 for _ in range(N)]\n \n while not h == fin:\n- for i in range(1, N-1):\n if h[i] == 0 and not h[i-1] == 0:\n counter += 1\n- counter += 1\n- for i in range(N):\n if not h[i] == 0:\n h[i] -= 1\n \n \n print(counter)\n \n", "added_lines": 4, "removed_lines": 5, "code1_lines": 17 }, { "user_id": "u773686010", "problem_id": "p03147", "submission1_id": "s157524928", "submission2_id": "s949218125", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nn=int(input())\nTree_List=list(map(int,input().split()))\n\nct =0\nfor i in range(n):\n while Tree_List[i] != 0:\n \n if i == n-1:\n Tree_List[i] -= 1\n print(Tree_List)\n \n else:\n \n k = i + 1\n while Tree_List[k] != 0: \n k+=1\n if k == n:\n break\n \n \n \n Tree_List[i:k]=map(lambda x:x-1,Tree_List[i:k])\n \n ct += 1\n \n \n \n \n \nprint(ct)", "code2": "\nn=int(input())\nTree_List=list(map(int,input().split()))\n\nct =0\nfor i in range(n):\n while Tree_List[i] != 0:\n \n if i == n-1:\n Tree_List[i] -= 1\n \n else:\n \n k = i + 1\n while Tree_List[k] != 0: \n k+=1\n if k == n:\n break\n Tree_List[i:k]=map(lambda x:x-1,Tree_List[i:k])\n \n ct += 1\n \nprint(ct)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590875974", "date2": "1590876048", "bleu_score": "0.7987405525741004", "code1_test_status": [1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0], "code1_test_score": 33, "total_score": 99, "input": "8\n8 65 136 0 0 108 31 101\n", "actual_output": "[0, 0, 0, 0, 0, 0, 0, 69]\n[0, 0, 0, 0, 0, 0, 0, 68]\n[0, 0, 0, 0, 0, 0, 0, 67]\n[0, 0, 0, 0, 0, 0, 0, 66]\n[0, 0, 0, 0, 0, 0, 0, 65]\n[0, 0, 0, 0, 0, 0, 0, 64]\n[0, 0, 0, 0, 0, 0, 0, 63]\n[0, 0, 0, 0, 0, 0, 0, 62]\n[0, 0, 0, 0, 0, 0, 0, 61]\n[0, 0, 0, 0, 0, 0, 0, 60]\n[0, 0, 0, 0, 0, 0, 0, 59]\n[0, 0, 0, 0, 0, 0, 0, 58]\n[0, 0, 0, 0, 0, 0, 0, 57]\n[0, 0, 0, 0, 0, 0, 0, 56]\n[0, 0, 0, 0, 0, 0, 0, 55]\n[0, 0, 0, 0, 0, 0, 0, 54]\n[0, 0, 0, 0, 0, 0, 0, 53]\n[0, 0, 0, 0, 0, 0, 0, 52]\n[0, 0, 0, 0, 0, 0, 0, 51]\n[0, 0, 0, 0, 0, 0, 0, 50]\n[0, 0, 0, 0, 0, 0, 0, 49]\n[0, 0, 0, 0, 0, 0, 0, 48]\n[0, 0, 0, 0, 0, 0, 0, 47]\n[0, 0, 0, 0, 0, 0, 0, 46]\n[0, 0, 0, 0, 0, 0, 0, 45]\n[0, 0, 0, 0, 0, 0, 0, 44]\n[0, 0, 0, 0, 0, 0, 0, 43]\n[0, 0, 0, 0, 0, 0, 0, 42]\n[0, 0, 0, 0, 0, 0, 0, 41]\n[0, 0, 0, 0, 0, 0, 0, 40]\n[0, 0, 0, 0, 0, 0, 0, 39]\n[0, 0, 0, 0, 0, 0, 0, 38]\n[0, 0, 0, 0, 0, 0, 0, 37]\n[0, 0, 0, 0, 0, 0, 0, 36]\n[0, 0, 0, 0, 0, 0, 0, 35]\n[0, 0, 0, 0, 0, 0, 0, 34]\n[0, 0, 0, 0, 0, 0, 0, 33]\n[0, 0, 0, 0, 0, 0, 0, 32]\n[0, 0, 0, 0, 0, 0, 0, 31]\n[0, 0, 0, 0, 0, 0, 0, 30]\n[0, 0, 0, 0, 0, 0, 0, 29]\n[0, 0, 0, 0, 0, 0, 0, 28]\n[0, 0, 0, 0, 0, 0, 0, 27]\n[0, 0, 0, 0, 0, 0, 0, 26]\n[0, 0, 0, 0, 0, 0, 0, 25]\n[0, 0, 0, 0, 0, 0, 0, 24]\n[0, 0, 0, 0, 0, 0, 0, 23]\n[0, 0, 0, 0, 0, 0, 0, 22]\n[0, 0, 0, 0, 0, 0, 0, 21]\n[0, 0, 0, 0, 0, 0, 0, 20]\n[0, 0, 0, 0, 0, 0, 0, 19]\n[0, 0, 0, 0, 0, 0, 0, 18]\n[0, 0, 0, 0, 0, 0, 0, 17]\n[0, 0, 0, 0, 0, 0, 0, 16]\n[0, 0, 0, 0, 0, 0, 0, 15]\n[0, 0, 0, 0, 0, 0, 0, 14]\n[0, 0, 0, 0, 0, 0, 0, 13]\n[0, 0, 0, 0, 0, 0, 0, 12]\n[0, 0, 0, 0, 0, 0, 0, 11]\n[0, 0, 0, 0, 0, 0, 0, 10]\n[0, 0, 0, 0, 0, 0, 0, 9]\n[0, 0, 0, 0, 0, 0, 0, 8]\n[0, 0, 0, 0, 0, 0, 0, 7]\n[0, 0, 0, 0, 0, 0, 0, 6]\n[0, 0, 0, 0, 0, 0, 0, 5]\n[0, 0, 0, 0, 0, 0, 0, 4]\n[0, 0, 0, 0, 0, 0, 0, 3]\n[0, 0, 0, 0, 0, 0, 0, 2]\n[0, 0, 0, 0, 0, 0, 0, 1]\n[0, 0, 0, 0, 0, 0, 0, 0]\n314\n", "expected_output": "314\n\n", "anno_code": ["\nn=int(input()) # (0): n=8\nTree_List=list(map(int,input().split())) # (1): Tree_List=[8, 65, 136, 0, 0, 108, 31, 101]\n\nct =0 # (2): ct=0\nfor i in range(n): # (3): i=0 (101): i=1 ... (2238): NO CHANGE\n while Tree_List[i] != 0: # (4): NO CHANGE (16): NO CHANGE ... (2237): NO CHANGE\n \n if i == n-1: # (5): NO CHANGE (17): NO CHANGE ... (2233): NO CHANGE\n Tree_List[i] -= 1 # (1889): Tree_List=[0, 0, 0, 0, 0, 0, 0, 69] (1894): Tree_List=[0, 0, 0, 0, 0, 0, 0, 68] ... (2234): Tree_List=[0, 0, 0, 0, 0, 0, 0, 0]\n print(Tree_List) # (1890): NO CHANGE (1895): NO CHANGE ... (2235): NO CHANGE\n \n else:\n \n k = i + 1 # (6): k=1 (18): k=1 ... (1879): NO CHANGE\n while Tree_List[k] != 0: # (7): NO CHANGE (10): NO CHANGE ... (1880): NO CHANGE\n k+=1 # (8): k=2 (11): k=3 ... (1416): k=8\n if k == n: # (9): NO CHANGE (12): NO CHANGE ... (1417): NO CHANGE\n break # (1058): NO CHANGE (1070): NO CHANGE ... (1418): NO CHANGE\n \n \n \n Tree_List[i:k]=map(lambda x:x-1,Tree_List[i:k]) # (14): Tree_List=[7, 64, 135, 0, 0, 108, 31, 101] (26): Tree_List=[6, 63, 134, 0, 0, 108, 31, 101] ... (1881): Tree_List=[0, 0, 0, 0, 0, 0, 0, 70]\n \n ct += 1 # (15): ct=1 (27): ct=2 ... (2236): ct=314\n \n \n \n \n \nprint(ct)"], "anno_status": [false], "diff_content": " \n n=int(input())\n Tree_List=list(map(int,input().split()))\n \n ct =0\n for i in range(n):\n while Tree_List[i] != 0:\n \n if i == n-1:\n Tree_List[i] -= 1\n- print(Tree_List)\n \n else:\n \n k = i + 1\n while Tree_List[k] != 0: \n k+=1\n if k == n:\n break\n- \n- \n- \n Tree_List[i:k]=map(lambda x:x-1,Tree_List[i:k])\n \n ct += 1\n \n- \n- \n- \n- \n print(ct)\n", "FL_content": " \n n=int(input())\n Tree_List=list(map(int,input().split()))\n \n ct =0\n for i in range(n):\n while Tree_List[i] != 0:\n \n if i == n-1:\n Tree_List[i] -= 1\n- print(Tree_List)\n \n else:\n \n k = i + 1\n while Tree_List[k] != 0: \n k+=1\n if k == n:\n break\n- \n- \n- \n Tree_List[i:k]=map(lambda x:x-1,Tree_List[i:k])\n \n ct += 1\n \n- \n- \n- \n- \n print(ct)\n", "added_lines": 0, "removed_lines": 8, "code1_lines": 31 }, { "user_id": "u927534107", "problem_id": "p03147", "submission1_id": "s136156767", "submission2_id": "s090586892", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ns = list(map(int,input().split()))\ns = [i-1 for i in s]\nans = 0\nwhile(sum(s)!=-n):\n s_new=[i.replace(\"-1\",\"a\") for i in map(str,s)]\n print(s_new)\n s_join = ''.join(s_new)\n non = s_join.split(\"a\")\n num = len([x for x in non if x])\n ans += num\n s = [max(i-1,-1) for i in s]\nprint(ans)", "code2": "n = int(input())\ns = list(map(int,input().split()))\ns = [i-1 for i in s]\nans = 0\nwhile(sum(s)!=-n):\n s_new=[i.replace(\"-1\",\"a\") for i in map(str,s)]\n s_join = ''.join(s_new)\n non = s_join.split(\"a\")\n num = len([x for x in non if x])\n ans += num\n s = [max(i-1,-1) for i in s]\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1561366472", "date2": "1561366565", "bleu_score": "0.945439282244647", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 99, "input": "8\n4 65 136 0 23 151 22 111\n", "actual_output": "['3', '64', '135', 'a', '22', '150', '21', '110']\n['2', '63', '134', 'a', '21', '149', '20', '109']\n['1', '62', '133', 'a', '20', '148', '19', '108']\n['0', '61', '132', 'a', '19', '147', '18', '107']\n['a', '60', '131', 'a', '18', '146', '17', '106']\n['a', '59', '130', 'a', '17', '145', '16', '105']\n['a', '58', '129', 'a', '16', '144', '15', '104']\n['a', '57', '128', 'a', '15', '143', '14', '103']\n['a', '56', '127', 'a', '14', '142', '13', '102']\n['a', '55', '126', 'a', '13', '141', '12', '101']\n['a', '54', '125', 'a', '12', '140', '11', '100']\n['a', '53', '124', 'a', '11', '139', '10', '99']\n['a', '52', '123', 'a', '10', '138', '9', '98']\n['a', '51', '122', 'a', '9', '137', '8', '97']\n['a', '50', '121', 'a', '8', '136', '7', '96']\n['a', '49', '120', 'a', '7', '135', '6', '95']\n['a', '48', '119', 'a', '6', '134', '5', '94']\n['a', '47', '118', 'a', '5', '133', '4', '93']\n['a', '46', '117', 'a', '4', '132', '3', '92']\n['a', '45', '116', 'a', '3', '131', '2', '91']\n['a', '44', '115', 'a', '2', '130', '1', '90']\n['a', '43', '114', 'a', '1', '129', '0', '89']\n['a', '42', '113', 'a', '0', '128', 'a', '88']\n['a', '41', '112', 'a', 'a', '127', 'a', '87']\n['a', '40', '111', 'a', 'a', '126', 'a', '86']\n['a', '39', '110', 'a', 'a', '125', 'a', '85']\n['a', '38', '109', 'a', 'a', '124', 'a', '84']\n['a', '37', '108', 'a', 'a', '123', 'a', '83']\n['a', '36', '107', 'a', 'a', '122', 'a', '82']\n['a', '35', '106', 'a', 'a', '121', 'a', '81']\n['a', '34', '105', 'a', 'a', '120', 'a', '80']\n['a', '33', '104', 'a', 'a', '119', 'a', '79']\n['a', '32', '103', 'a', 'a', '118', 'a', '78']\n['a', '31', '102', 'a', 'a', '117', 'a', '77']\n['a', '30', '101', 'a', 'a', '116', 'a', '76']\n['a', '29', '100', 'a', 'a', '115', 'a', '75']\n['a', '28', '99', 'a', 'a', '114', 'a', '74']\n['a', '27', '98', 'a', 'a', '113', 'a', '73']\n['a', '26', '97', 'a', 'a', '112', 'a', '72']\n['a', '25', '96', 'a', 'a', '111', 'a', '71']\n['a', '24', '95', 'a', 'a', '110', 'a', '70']\n['a', '23', '94', 'a', 'a', '109', 'a', '69']\n['a', '22', '93', 'a', 'a', '108', 'a', '68']\n['a', '21', '92', 'a', 'a', '107', 'a', '67']\n['a', '20', '91', 'a', 'a', '106', 'a', '66']\n['a', '19', '90', 'a', 'a', '105', 'a', '65']\n['a', '18', '89', 'a', 'a', '104', 'a', '64']\n['a', '17', '88', 'a', 'a', '103', 'a', '63']\n['a', '16', '87', 'a', 'a', '102', 'a', '62']\n['a', '15', '86', 'a', 'a', '101', 'a', '61']\n['a', '14', '85', 'a', 'a', '100', 'a', '60']\n['a', '13', '84', 'a', 'a', '99', 'a', '59']\n['a', '12', '83', 'a', 'a', '98', 'a', '58']\n['a', '11', '82', 'a', 'a', '97', 'a', '57']\n['a', '10', '81', 'a', 'a', '96', 'a', '56']\n['a', '9', '80', 'a', 'a', '95', 'a', '55']\n['a', '8', '79', 'a', 'a', '94', 'a', '54']\n['a', '7', '78', 'a', 'a', '93', 'a', '53']\n['a', '6', '77', 'a', 'a', '92', 'a', '52']\n['a', '5', '76', 'a', 'a', '91', 'a', '51']\n['a', '4', '75', 'a', 'a', '90', 'a', '50']\n['a', '3', '74', 'a', 'a', '89', 'a', '49']\n['a', '2', '73', 'a', 'a', '88', 'a', '48']\n['a', '1', '72', 'a', 'a', '87', 'a', '47']\n['a', '0', '71', 'a', 'a', '86', 'a', '46']\n['a', 'a', '70', 'a', 'a', '85', 'a', '45']\n['a', 'a', '69', 'a', 'a', '84', 'a', '44']\n['a', 'a', '68', 'a', 'a', '83', 'a', '43']\n['a', 'a', '67', 'a', 'a', '82', 'a', '42']\n['a', 'a', '66', 'a', 'a', '81', 'a', '41']\n['a', 'a', '65', 'a', 'a', '80', 'a', '40']\n['a', 'a', '64', 'a', 'a', '79', 'a', '39']\n['a', 'a', '63', 'a', 'a', '78', 'a', '38']\n['a', 'a', '62', 'a', 'a', '77', 'a', '37']\n['a', 'a', '61', 'a', 'a', '76', 'a', '36']\n['a', 'a', '60', 'a', 'a', '75', 'a', '35']\n['a', 'a', '59', 'a', 'a', '74', 'a', '34']\n['a', 'a', '58', 'a', 'a', '73', 'a', '33']\n['a', 'a', '57', 'a', 'a', '72', 'a', '32']\n['a', 'a', '56', 'a', 'a', '71', 'a', '31']\n['a', 'a', '55', 'a', 'a', '70', 'a', '30']\n['a', 'a', '54', 'a', 'a', '69', 'a', '29']\n['a', 'a', '53', 'a', 'a', '68', 'a', '28']\n['a', 'a', '52', 'a', 'a', '67', 'a', '27']\n['a', 'a', '51', 'a', 'a', '66', 'a', '26']\n['a', 'a', '50', 'a', 'a', '65', 'a', '25']\n['a', 'a', '49', 'a', 'a', '64', 'a', '24']\n['a', 'a', '48', 'a', 'a', '63', 'a', '23']\n['a', 'a', '47', 'a', 'a', '62', 'a', '22']\n['a', 'a', '46', 'a', 'a', '61', 'a', '21']\n['a', 'a', '45', 'a', 'a', '60', 'a', '20']\n['a', 'a', '44', 'a', 'a', '59', 'a', '19']\n['a', 'a', '43', 'a', 'a', '58', 'a', '18']\n['a', 'a', '42', 'a', 'a', '57', 'a', '17']\n['a', 'a', '41', 'a', 'a', '56', 'a', '16']\n['a', 'a', '40', 'a', 'a', '55', 'a', '15']\n['a', 'a', '39', 'a', 'a', '54', 'a', '14']\n['a', 'a', '38', 'a', 'a', '53', 'a', '13']\n['a', 'a', '37', 'a', 'a', '52', 'a', '12']\n['a', 'a', '36', 'a', 'a', '51', 'a', '11']\n['a', 'a', '35', 'a', 'a', '50', 'a', '10']\n['a', 'a', '34', 'a', 'a', '49', 'a', '9']\n['a', 'a', '33', 'a', 'a', '48', 'a', '8']\n['a', 'a', '32', 'a', 'a', '47', 'a', '7']\n['a', 'a', '31', 'a', 'a', '46', 'a', '6']\n['a', 'a', '30', 'a', 'a', '45', 'a', '5']\n['a', 'a', '29', 'a', 'a', '44', 'a', '4']\n['a', 'a', '28', 'a', 'a', '43', 'a', '3']\n['a', 'a', '27', 'a', 'a', '42', 'a', '2']\n['a', 'a', '26', 'a', 'a', '41', 'a', '1']\n['a', 'a', '25', 'a', 'a', '40', 'a', '0']\n['a', 'a', '24', 'a', 'a', '39', 'a', 'a']\n['a', 'a', '23', 'a', 'a', '38', 'a', 'a']\n['a', 'a', '22', 'a', 'a', '37', 'a', 'a']\n['a', 'a', '21', 'a', 'a', '36', 'a', 'a']\n['a', 'a', '20', 'a', 'a', '35', 'a', 'a']\n['a', 'a', '19', 'a', 'a', '34', 'a', 'a']\n['a', 'a', '18', 'a', 'a', '33', 'a', 'a']\n['a', 'a', '17', 'a', 'a', '32', 'a', 'a']\n['a', 'a', '16', 'a', 'a', '31', 'a', 'a']\n['a', 'a', '15', 'a', 'a', '30', 'a', 'a']\n['a', 'a', '14', 'a', 'a', '29', 'a', 'a']\n['a', 'a', '13', 'a', 'a', '28', 'a', 'a']\n['a', 'a', '12', 'a', 'a', '27', 'a', 'a']\n['a', 'a', '11', 'a', 'a', '26', 'a', 'a']\n['a', 'a', '10', 'a', 'a', '25', 'a', 'a']\n['a', 'a', '9', 'a', 'a', '24', 'a', 'a']\n['a', 'a', '8', 'a', 'a', '23', 'a', 'a']\n['a', 'a', '7', 'a', 'a', '22', 'a', 'a']\n['a', 'a', '6', 'a', 'a', '21', 'a', 'a']\n['a', 'a', '5', 'a', 'a', '20', 'a', 'a']\n['a', 'a', '4', 'a', 'a', '19', 'a', 'a']\n['a', 'a', '3', 'a', 'a', '18', 'a', 'a']\n['a', 'a', '2', 'a', 'a', '17', 'a', 'a']\n['a', 'a', '1', 'a', 'a', '16', 'a', 'a']\n['a', 'a', '0', 'a', 'a', '15', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '14', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '13', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '12', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '11', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '10', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '9', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '8', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '7', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '6', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '5', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '4', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '3', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '2', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '1', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '0', 'a', 'a']\n376\n", "expected_output": "376\n\n", "anno_code": ["n = int(input()) # (0): n=8\ns = list(map(int,input().split())) # (1): s=[4, 65, 136, 0, 23, 151, 22, 111]\ns = [i-1 for i in s] # (2): s=[3, 64, 135, -1, 22, 150, 21, 110]\nans = 0 # (3): ans=0\nwhile(sum(s)!=-n): # (4): NO CHANGE (12): NO CHANGE ... (1212): NO CHANGE\n s_new=[i.replace(\"-1\",\"a\") for i in map(str,s)] # (5): s_new=['3', '64', '135', 'a', '22', '150', '21', '110'] (13): s_new=['2', '63', '134', 'a', '21', '149', '20', '109'] ... (1205): s_new=['a', 'a', 'a', 'a', 'a', '0', 'a', 'a']\n print(s_new) # (6): NO CHANGE (14): NO CHANGE ... (1206): NO CHANGE\n s_join = ''.join(s_new) # (7): s_join=364135a2215021110 (15): s_join=263134a2114920109 ... (1207): s_join=aaaaa0aa\n non = s_join.split(\"a\") # (8): non=['364135', '2215021110'] (16): non=['263134', '2114920109'] ... (1208): non=['', '', '', '', '', '0', '', '']\n num = len([x for x in non if x]) # (9): num=2 (17): NO CHANGE ... (1209): NO CHANGE\n ans += num # (10): ans=2 (18): ans=4 ... (1210): ans=376\n s = [max(i-1,-1) for i in s] # (11): s=[2, 63, 134, -1, 21, 149, 20, 109] (19): s=[1, 62, 133, -1, 20, 148, 19, 108] ... (1211): s=[-1, -1, -1, -1, -1, -1, -1, -1]\nprint(ans)"], "anno_status": [false], "diff_content": " n = int(input())\n s = list(map(int,input().split()))\n s = [i-1 for i in s]\n ans = 0\n while(sum(s)!=-n):\n s_new=[i.replace(\"-1\",\"a\") for i in map(str,s)]\n- print(s_new)\n s_join = ''.join(s_new)\n non = s_join.split(\"a\")\n num = len([x for x in non if x])\n ans += num\n s = [max(i-1,-1) for i in s]\n print(ans)\n", "FL_content": " n = int(input())\n s = list(map(int,input().split()))\n s = [i-1 for i in s]\n ans = 0\n while(sum(s)!=-n):\n s_new=[i.replace(\"-1\",\"a\") for i in map(str,s)]\n- print(s_new)\n s_join = ''.join(s_new)\n non = s_join.split(\"a\")\n num = len([x for x in non if x])\n ans += num\n s = [max(i-1,-1) for i in s]\n print(ans)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u546285759", "problem_id": "p00637", "submission1_id": "s299943821", "submission2_id": "s702601982", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n n = int(input())\n if n == 0:\n break\n line = list(map(int, input().split()))\n t = len(line)-1\n ans = []\n i = 0\n while True:\n ans.append(line[i])\n while i < t:\n if line[i]+1 == line[i+1]:\n i += 1\n else:\n ans.append(line[i])\n i += 1\n break\n if i == t:\n ans.append(line[i])\n break\n print(*ans)", "code2": "while True:\n n = int(input())\n if n == 0:\n break\n line = list(map(int, input().split()))\n i = 0\n while i < n:\n j = i\n while j+1 < n and line[j+1]-line[j] == 1:\n j += 1\n s = \"\\n\" if n-1 == j else \" \"\n if i == j:\n print(\"%d%s\" % (line[i], s), end='')\n i += 1\n else:\n print(\"%d-%d%s\" % (line[i], line[j], s), end='')\n i = j+1", "original_language1": "Python3", "original_language2": "Python3", "date1": "1492664337", "date2": "1492665020", "bleu_score": "0.699147635014877", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "5\n1 1 5 3 4\n3\n24 8 9\n0\n", "actual_output": "1 1 1 1 5 5 3 4\n24 24 8 9\n", "expected_output": "1 1 5 3-4\n24 8-9\n\n", "anno_code": ["while True: # (0): NO CHANGE (41): NO CHANGE (66): NO CHANGE\n n = int(input()) # (1): n=5 (42): n=3 (67): n=0\n if n == 0: # (2): NO CHANGE (43): NO CHANGE (68): NO CHANGE\n break\n line = list(map(int, input().split())) # (3): line=[1, 1, 5, 3, 4] (44): line=[24, 8, 9]\n t = len(line)-1 # (4): t=4 (45): t=2\n ans = [] # (5): ans=[] (46): ans=[]\n i = 0 # (6): i=0 (47): i=0\n while True: # (7): NO CHANGE (15): NO CHANGE ... (56): NO CHANGE\n ans.append(line[i]) # (8): ans=[1] (16): ans=[1, 1, 1] ... (57): ans=[24, 24, 8]\n while i < t: # (9): NO CHANGE (17): NO CHANGE ... (61): NO CHANGE\n if line[i]+1 == line[i+1]: # (10): NO CHANGE (18): NO CHANGE ... (59): NO CHANGE\n i += 1 # (35): i=4 (60): i=2\n else:\n ans.append(line[i]) # (11): ans=[1, 1] (19): ans=[1, 1, 1, 1] ... (52): ans=[24, 24]\n i += 1 # (12): i=1 (20): i=2 ... (53): i=1\n break # (13): NO CHANGE (21): NO CHANGE ... (54): NO CHANGE\n if i == t: # (14): NO CHANGE (22): NO CHANGE ... (62): NO CHANGE\n ans.append(line[i]) # (38): ans=[1, 1, 1, 1, 5, 5, 3, 4] (63): ans=[24, 24, 8, 9]\n break # (39): NO CHANGE (64): NO CHANGE\n print(*ans) # (40): NO CHANGE (65): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n n = int(input())\n if n == 0:\n break\n line = list(map(int, input().split()))\n- t = len(line)-1\n- ans = []\n i = 0\n- while True:\n- ans.append(line[i])\n- while i < t:\n- if line[i]+1 == line[i+1]:\n- i += 1\n- else:\n- ans.append(line[i])\n- i += 1\n- break\n- if i == t:\n- ans.append(line[i])\n- break\n- print(*ans)\n+ while i < n:\n+ j = i\n+ while j+1 < n and line[j+1]-line[j] == 1:\n+ j += 1\n+ s = \"\\n\" if n-1 == j else \" \"\n+ if i == j:\n+ print(\"%d%s\" % (line[i], s), end='')\n+ i += 1\n+ else:\n+ print(\"%d-%d%s\" % (line[i], line[j], s), end='')\n+ i = j+1\n", "FL_content": " while True:\n n = int(input())\n if n == 0:\n break\n line = list(map(int, input().split()))\n- t = len(line)-1\n- ans = []\n i = 0\n- while True:\n- ans.append(line[i])\n- while i < t:\n- if line[i]+1 == line[i+1]:\n- i += 1\n- else:\n- ans.append(line[i])\n- i += 1\n- break\n- if i == t:\n- ans.append(line[i])\n- break\n- print(*ans)\n", "added_lines": 11, "removed_lines": 15, "code1_lines": 21 }, { "user_id": "u612721349", "problem_id": "p03698", "submission1_id": "s177761346", "submission2_id": "s704816741", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input();print(\"yneos\"[len(set(s))>len(s)::2])", "code2": "s=input();print(\"yneos\"[len(set(s))len(s)::2])"], "anno_status": [true], "diff_content": "-s=input();print(\"yneos\"[len(set(s))>len(s)::2])\n+s=input();print(\"yneos\"[len(set(s))len(s)::2])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 1 }, { "user_id": "u268516119", "problem_id": "p03698", "submission1_id": "s701503745", "submission2_id": "s369459278", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import collections\ndic=collections.Counter(list(input()))\nif max((dic.values()))==1:\n\tprint('yes')\nelse:print('No')\t\n", "code2": "import collections\ndic=collections.Counter(list(input()))\nif max((dic.values()))==1:\n\tprint('yes')\nelse:print('no')\t\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554477955", "date2": "1554478026", "bleu_score": "0.9783975498178012", "code1_test_status": [0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0], "code1_test_score": 36, "total_score": 103, "input": "tiffdrgnf\n", "actual_output": "No\n", "expected_output": "no\n\n", "anno_code": ["import collections\ndic=collections.Counter(list(input())) # (0): dic=Counter({'f': 3, 't': 1, 'i': 1, 'd': 1, 'r': 1, 'g': 1, 'n': 1})\nif max((dic.values()))==1: # (1): NO CHANGE\n\tprint('yes')\nelse:print('No')\t\n"], "anno_status": [true], "diff_content": " import collections\n dic=collections.Counter(list(input()))\n if max((dic.values()))==1:\n \tprint('yes')\n-else:print('No')\t\n+else:print('no')\t\n \n", "FL_content": " import collections\n dic=collections.Counter(list(input()))\n if max((dic.values()))==1:\n \tprint('yes')\n-else:print('No')\t\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u277104886", "problem_id": "p03698", "submission1_id": "s697276283", "submission2_id": "s739672933", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nfor i in s:\n if s.count(i) != 1:\n print('No')\n exit()\nprint('Yes')", "code2": "s = input()\nfor i in s:\n if s.count(i) != 1:\n print('no')\n exit()\nprint('yes')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1592010857", "date2": "1592010895", "bleu_score": "0.9459113584260849", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "ql\n", "actual_output": "Yes\n", "expected_output": "yes\n\n", "anno_code": ["s = input() # (0): s=ql\nfor i in s: # (1): i=q (3): i=l (5): NO CHANGE\n if s.count(i) != 1: # (2): NO CHANGE (4): NO CHANGE\n print('No')\n exit()\nprint('Yes')"], "anno_status": [true], "diff_content": " s = input()\n for i in s:\n if s.count(i) != 1:\n- print('No')\n+ print('no')\n exit()\n-print('Yes')\n+print('yes')\n", "FL_content": " s = input()\n for i in s:\n if s.count(i) != 1:\n- print('No')\n exit()\n-print('Yes')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u146803137", "problem_id": "p03698", "submission1_id": "s878868192", "submission2_id": "s221453062", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\ndef py():\n print(\"Yes\")\ndef pn():\n print(\"No\")\ndef iin():\n x = int(input())\n return x\n\nneko = 0\nnya = 0\nnuko = 0\n\ns = input()\nfor a in range(len(s)-1):\n for b in range(a+1,len(s)):\n if s[a] == s[b]:\n neko = 1\nif neko:\n pn()\nelse:\n py()", "code2": "import math\ndef py():\n print(\"yes\")\ndef pn():\n print(\"no\")\ndef iin():\n x = int(input())\n return x\n\nneko = 0\nnya = 0\nnuko = 0\n\ns = input()\nfor a in range(len(s)-1):\n for b in range(a+1,len(s)):\n if s[a] == s[b]:\n neko = 1\nif neko:\n pn()\nelse:\n py()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1589422911", "date2": "1589423062", "bleu_score": "0.9823621484436937", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "elcashfiqxcopnu\n", "actual_output": "No\n", "expected_output": "no\n\n", "anno_code": ["import math\ndef py(): # (0): py=\n print(\"Yes\")\ndef pn(): # (1): pn=\n print(\"No\")\ndef iin(): # (2): iin=\n x = int(input())\n return x\n\nneko = 0 # (3): neko=0\nnya = 0 # (4): nya=0\nnuko = 0 # (5): nuko=0\n\ns = input() # (6): s=elcashfiqxcopnu\nfor a in range(len(s)-1): # (7): a=0 (37): a=1 ... (246): NO CHANGE\n for b in range(a+1,len(s)): # (8): b=1 (10): b=2 ... (245): NO CHANGE\n if s[a] == s[b]: # (9): NO CHANGE (11): NO CHANGE ... (244): NO CHANGE\n neko = 1 # (82): neko=1\nif neko: # (247): NO CHANGE\n pn() # (248): NO CHANGE\nelse:\n py()"], "anno_status": [true], "diff_content": " import math\n def py():\n- print(\"Yes\")\n+ print(\"yes\")\n def pn():\n- print(\"No\")\n+ print(\"no\")\n def iin():\n x = int(input())\n return x\n \n neko = 0\n nya = 0\n nuko = 0\n \n s = input()\n for a in range(len(s)-1):\n for b in range(a+1,len(s)):\n if s[a] == s[b]:\n neko = 1\n if neko:\n pn()\n else:\n py()\n", "FL_content": " import math\n def py():\n- print(\"Yes\")\n def pn():\n- print(\"No\")\n def iin():\n x = int(input())\n return x\n \n neko = 0\n nya = 0\n nuko = 0\n \n s = input()\n for a in range(len(s)-1):\n for b in range(a+1,len(s)):\n if s[a] == s[b]:\n neko = 1\n if neko:\n pn()\n else:\n py()\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 22 }, { "user_id": "u170650966", "problem_id": "p03698", "submission1_id": "s019583391", "submission2_id": "s325834829", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(input())\ns.sort()\nflag = True\nfor i in range(len(s) - 1):\n if s[i] == [i + 1]:\n flag = False\n\nif flag:\n print(\"yes\")\nelse:\n print(\"no\")\n", "code2": "s = list(input())\ns.sort()\nflag = True\nfor i in range(len(s) - 1):\n if s[i] == s[i + 1]:\n flag = False\n\nif flag:\n print(\"yes\")\nelse:\n print(\"no\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1551569309", "date2": "1551569364", "bleu_score": "0.9843489635453336", "code1_test_status": [0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0], "code1_test_score": 36, "total_score": 103, "input": "gmfidfqju\n", "actual_output": "yes\n", "expected_output": "no\n\n", "anno_code": ["s = list(input()) # (0): s=['g', 'm', 'f', 'i', 'd', 'f', 'q', 'j', 'u']\ns.sort() # (1): s=['d', 'f', 'f', 'g', 'i', 'j', 'm', 'q', 'u']\nflag = True # (2): flag=True\nfor i in range(len(s) - 1): # (3): i=0 (5): i=1 ... (19): NO CHANGE\n if s[i] == [i + 1]: # (4): NO CHANGE (6): NO CHANGE ... (18): NO CHANGE\n flag = False\n\nif flag: # (20): NO CHANGE\n print(\"yes\")\nelse:\n print(\"no\")\n"], "anno_status": [true], "diff_content": " s = list(input())\n s.sort()\n flag = True\n for i in range(len(s) - 1):\n- if s[i] == [i + 1]:\n+ if s[i] == s[i + 1]:\n flag = False\n \n if flag:\n print(\"yes\")\n else:\n print(\"no\")\n \n", "FL_content": " s = list(input())\n s.sort()\n flag = True\n for i in range(len(s) - 1):\n- if s[i] == [i + 1]:\n flag = False\n \n if flag:\n print(\"yes\")\n else:\n print(\"no\")\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u344813796", "problem_id": "p03698", "submission1_id": "s862063741", "submission2_id": "s401895158", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=list(str(input()))\n\nprint('Yes' if len(list(set(s)))==len(s) else 'No')\n", "code2": "s=list(str(input()))\n\nprint('yes' if len(list(set(s)))==len(s) else 'no')\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596770328", "date2": "1596770371", "bleu_score": "0.9299940324325051", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "enereffit\n", "actual_output": "No\n", "expected_output": "no\n\n", "anno_code": ["s=list(str(input())) # (0): s=['e', 'n', 'e', 'r', 'e', 'f', 'f', 'i', 't']\n\nprint('Yes' if len(list(set(s)))==len(s) else 'No')\n"], "anno_status": [true], "diff_content": " s=list(str(input()))\n \n-print('Yes' if len(list(set(s)))==len(s) else 'No')\n+print('yes' if len(list(set(s)))==len(s) else 'no')\n \n", "FL_content": " s=list(str(input()))\n \n-print('Yes' if len(list(set(s)))==len(s) else 'No')\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u889344512", "problem_id": "p03698", "submission1_id": "s528027618", "submission2_id": "s195834135", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\nans = \"Yes\"\nfor i in range(len(s)):\n if s.count(s[i])>1:\n ans = \"No\"\n\nprint(ans)\n\n", "code2": "s = input()\n\nans = \"yes\"\nfor i in range(len(s)):\n if s.count(s[i])>1:\n ans = \"no\"\n\nprint(ans)\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1565391999", "date2": "1565392034", "bleu_score": "0.9511942021208858", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "lo\n", "actual_output": "Yes\n", "expected_output": "yes\n\n", "anno_code": ["s = input() # (0): s=lo\n\nans = \"Yes\" # (1): ans=Yes\nfor i in range(len(s)): # (2): i=0 (4): i=1 (6): NO CHANGE\n if s.count(s[i])>1: # (3): NO CHANGE (5): NO CHANGE\n ans = \"No\"\n\nprint(ans)\n\n"], "anno_status": [true], "diff_content": " s = input()\n \n-ans = \"Yes\"\n+ans = \"yes\"\n for i in range(len(s)):\n if s.count(s[i])>1:\n- ans = \"No\"\n+ ans = \"no\"\n \n print(ans)\n \n \n", "FL_content": " s = input()\n \n-ans = \"Yes\"\n for i in range(len(s)):\n if s.count(s[i])>1:\n- ans = \"No\"\n \n print(ans)\n \n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u391059484", "problem_id": "p03698", "submission1_id": "s497358719", "submission2_id": "s580304013", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nfor i in range(len(S)):\n if i == len(S)-1:\n print('yes')\n break\n for p in range(i+1,len(S)):\n if S[i] == S[p]:\n print('no')\n break", "code2": "S = input()\nn = []\nfor i in range(len(S)):\n for p in range(i+1,len(S)):\n if S[i] == S[p]:\n n.append(0)\n if i == len(S)-1:\n n.append(1)\nfor i in range(len(n)):\n if n[i] == 0:\n print('no')\n break\n if i == len(n)-1:\n print('yes')", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1574956831", "date2": "1574957316", "bleu_score": "0.6276052184278417", "code1_test_status": [0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0], "code1_test_score": 36, "total_score": 103, "input": "dnereffit\n", "actual_output": "no\nno\nyes\n", "expected_output": "no\n\n", "anno_code": ["S = input() # (0): S=dnereffit\nfor i in range(len(S)): # (1): i=0 (20): i=1 ... (87): i=8\n if i == len(S)-1: # (2): NO CHANGE (21): NO CHANGE ... (88): NO CHANGE\n print('yes') # (89): NO CHANGE\n break\n for p in range(i+1,len(S)): # (3): p=1 (5): p=2 ... (86): NO CHANGE\n if S[i] == S[p]: # (4): NO CHANGE (6): NO CHANGE ... (85): NO CHANGE\n print('no') # (43): NO CHANGE (73): NO CHANGE\n break # (44): NO CHANGE (74): NO CHANGE\n"], "anno_status": [true], "diff_content": " S = input()\n+n = []\n for i in range(len(S)):\n- if i == len(S)-1:\n- print('yes')\n- break\n for p in range(i+1,len(S)):\n if S[i] == S[p]:\n- print('no')\n- break\n+ n.append(0)\n+ if i == len(S)-1:\n+ n.append(1)\n+for i in range(len(n)):\n+ if n[i] == 0:\n+ print('no')\n+ break\n+ if i == len(n)-1:\n+ print('yes')\n", "FL_content": " S = input()\n for i in range(len(S)):\n- if i == len(S)-1:\n- print('yes')\n- break\n for p in range(i+1,len(S)):\n if S[i] == S[p]:\n- print('no')\n- break\n", "added_lines": 10, "removed_lines": 5, "code1_lines": 9 }, { "user_id": "u581187895", "problem_id": "p03698", "submission1_id": "s089152251", "submission2_id": "s629017860", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\ns = input().rstrip()\nprint(\"yes\" if set(s) == s else \"no\")", "code2": "import sys\ninput = sys.stdin.readline\n\ns = input().rstrip()\nprint(\"yes\" if len(set(s)) == len(s) else \"no\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1557787588", "date2": "1557787730", "bleu_score": "0.8665045360686334", "code1_test_status": [1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1], "code1_test_score": 67, "total_score": 103, "input": "mq\n", "actual_output": "no\n", "expected_output": "yes\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\ns = input().rstrip() # (1): s=mq\nprint(\"yes\" if set(s) == s else \"no\")"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n \n s = input().rstrip()\n-print(\"yes\" if set(s) == s else \"no\")\n+print(\"yes\" if len(set(s)) == len(s) else \"no\")\n", "FL_content": " import sys\n input = sys.stdin.readline\n \n s = input().rstrip()\n-print(\"yes\" if set(s) == s else \"no\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u449555432", "problem_id": "p03698", "submission1_id": "s486904540", "submission2_id": "s894245965", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(input())\nt = set(s)\nprint(s)\nprint(t)\nif len(s) == len(t):\n\tprint('yes')\nelse:\n\tprint('no')", "code2": "s = list(input())\nt = set(s)\nif len(s) == len(t):\n\tprint('yes')\nelse:\n\tprint('no')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554342842", "date2": "1554342886", "bleu_score": "0.8003573595907328", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "uxrmg`cjdhpspme\n", "actual_output": "['u', 'x', 'r', 'm', 'g', '`', 'c', 'j', 'd', 'h', 'p', 's', 'p', 'm', 'e']\n{'m', 'u', 'c', 'p', 's', 'g', 'h', '`', 'd', 'j', 'x', 'e', 'r'}\nno\n", "expected_output": "no\n\n", "anno_code": ["s = list(input()) # (0): s=['u', 'x', 'r', 'm', 'g', '`', 'c', 'j', 'd', 'h', 'p', 's', 'p', 'm', 'e']\nt = set(s) # (1): t={'m', 'd', 'g', 'h', 'c', '`', 'j', 'r', 'p', 'e', 'x', 's', 'u'}\nprint(s) # (2): NO CHANGE\nprint(t) # (3): NO CHANGE\nif len(s) == len(t): # (4): NO CHANGE\n\tprint('yes')\nelse:\n\tprint('no')"], "anno_status": [true], "diff_content": " s = list(input())\n t = set(s)\n-print(s)\n-print(t)\n if len(s) == len(t):\n \tprint('yes')\n else:\n \tprint('no')\n", "FL_content": " s = list(input())\n t = set(s)\n-print(s)\n-print(t)\n if len(s) == len(t):\n \tprint('yes')\n else:\n \tprint('no')\n", "added_lines": 0, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u707808519", "problem_id": "p02601", "submission1_id": "s252305097", "submission2_id": "s041230857", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = map(int, input().split())\nK = int(input())\n\nwhile K > 0:\n if a > b:\n b *= 2\n elif b > c:\n c *= 2\n K -= 1\n\nif a < b < c:\n print('Yes')\nelse:\n print('No')", "code2": "a, b, c = map(int, input().split())\nK = int(input())\n\nwhile K > 0:\n if a >= b:\n b *= 2\n elif b >= c:\n c *= 2\n K -= 1\n\nif a < b < c:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595725680", "date2": "1595726585", "bleu_score": "0.9738865275645977", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 63, "total_score": 102, "input": "1 2 1\n9\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["a, b, c = map(int, input().split()) # (0): a=1, b=2, c=1\nK = int(input()) # (1): K=9\n\nwhile K > 0: # (2): NO CHANGE (7): NO CHANGE ... (39): NO CHANGE\n if a > b: # (3): NO CHANGE (8): NO CHANGE ... (36): NO CHANGE\n b *= 2\n elif b > c: # (4): NO CHANGE (9): NO CHANGE ... (37): NO CHANGE\n c *= 2 # (5): c=2\n K -= 1 # (6): K=8 (10): K=7 ... (38): K=0\n\nif a < b < c: # (40): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " a, b, c = map(int, input().split())\n K = int(input())\n \n while K > 0:\n- if a > b:\n+ if a >= b:\n b *= 2\n- elif b > c:\n+ elif b >= c:\n c *= 2\n K -= 1\n \n if a < b < c:\n print('Yes')\n else:\n print('No')\n", "FL_content": " a, b, c = map(int, input().split())\n K = int(input())\n \n while K > 0:\n- if a > b:\n b *= 2\n- elif b > c:\n c *= 2\n K -= 1\n \n if a < b < c:\n print('Yes')\n else:\n print('No')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 14 }, { "user_id": "u342801789", "problem_id": "p02601", "submission1_id": "s666502921", "submission2_id": "s659435844", "status1": "Wrong Answer", "status2": "Accepted", "code1": "numbers = [int(s) for s in input().split()] \nK = int(input())\nfor i in range(K):\n if(numbers[2] < numbers[0]):\n numbers[2] *= 2\n \n elif(numbers[1] < numbers[0]):\n numbers[1] *= 2\n \n elif(numbers[2] < numbers[1]):\n numbers[2] *= 2\n \n else:\n break\nif(numbers[1] > numbers[0] and numbers[2] > numbers[1]):\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "numbers = [int(s) for s in input().split()] \nK = int(input())\nfor i in range(K):\n if(numbers[2] <= numbers[0]):\n numbers[2] *= 2\n elif(numbers[1] <= numbers[0]):\n numbers[1] *= 2\n elif(numbers[2] <= numbers[1]):\n numbers[2] *= 2\n else:\n break\nif(numbers[1] > numbers[0] and numbers[2] > numbers[1]):\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595728746", "date2": "1595728947", "bleu_score": "0.9197232137037599", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 63, "total_score": 102, "input": "4 2 5\n3\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["numbers = [int(s) for s in input().split()] # (0): numbers=[4, 2, 5]\nK = int(input()) # (1): K=3\nfor i in range(K): # (2): i=0 (6): i=1\n if(numbers[2] < numbers[0]): # (3): NO CHANGE (7): NO CHANGE\n numbers[2] *= 2\n \n elif(numbers[1] < numbers[0]): # (4): NO CHANGE (8): NO CHANGE\n numbers[1] *= 2 # (5): numbers=[4, 4, 5]\n \n elif(numbers[2] < numbers[1]): # (9): NO CHANGE\n numbers[2] *= 2\n \n else:\n break # (10): NO CHANGE\nif(numbers[1] > numbers[0] and numbers[2] > numbers[1]): # (11): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " numbers = [int(s) for s in input().split()] \n K = int(input())\n for i in range(K):\n- if(numbers[2] < numbers[0]):\n+ if(numbers[2] <= numbers[0]):\n numbers[2] *= 2\n- \n- elif(numbers[1] < numbers[0]):\n+ elif(numbers[1] <= numbers[0]):\n numbers[1] *= 2\n- \n- elif(numbers[2] < numbers[1]):\n+ elif(numbers[2] <= numbers[1]):\n numbers[2] *= 2\n- \n else:\n break\n if(numbers[1] > numbers[0] and numbers[2] > numbers[1]):\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " numbers = [int(s) for s in input().split()] \n K = int(input())\n for i in range(K):\n- if(numbers[2] < numbers[0]):\n numbers[2] *= 2\n- \n- elif(numbers[1] < numbers[0]):\n numbers[1] *= 2\n- \n- elif(numbers[2] < numbers[1]):\n numbers[2] *= 2\n- \n else:\n break\n if(numbers[1] > numbers[0] and numbers[2] > numbers[1]):\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 3, "removed_lines": 6, "code1_lines": 18 }, { "user_id": "u837507786", "problem_id": "p02601", "submission1_id": "s340011823", "submission2_id": "s045689487", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A,B,C = map(int, input().split())\nK = int(input())\ncount = 0\na = 0\nwhile K > 0:\n\n if (A < B * 2 ** K) and (B * 2 ** K < C * 2 ** a):\n count +=1\n K -=1\n a +=1\n\nif count == 1:\n print(\"Yes\")\nelse: print(\"No\")", "code2": "A,B,C = map(int, input().split())\nK = int(input())\ncount = 0\na = 0\nwhile K >= 0:\n\n if (A < B * 2 ** K) and (B * 2 ** K < C * 2 ** a):\n count +=1\n K -=1\n a +=1\n\nif count >= 1:\n print(\"Yes\")\nelse: print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595730086", "date2": "1595730212", "bleu_score": "0.9786197091746561", "code1_test_status": [1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1], "code1_test_score": 48, "total_score": 102, "input": "12 4 2\n9\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["A,B,C = map(int, input().split()) # (0): A=12, B=4, C=2\nK = int(input()) # (1): K=9\ncount = 0 # (2): count=0\na = 0 # (3): a=0\nwhile K > 0: # (4): NO CHANGE (8): NO CHANGE ... (42): NO CHANGE\n\n if (A < B * 2 ** K) and (B * 2 ** K < C * 2 ** a): # (5): NO CHANGE (9): NO CHANGE ... (39): NO CHANGE\n count +=1 # (30): count=1 (35): count=2\n K -=1 # (6): K=8 (10): K=7 ... (40): K=0\n a +=1 # (7): a=1 (11): a=2 ... (41): a=9\n\nif count == 1: # (43): NO CHANGE\n print(\"Yes\")\nelse: print(\"No\")"], "anno_status": [true], "diff_content": " A,B,C = map(int, input().split())\n K = int(input())\n count = 0\n a = 0\n-while K > 0:\n+while K >= 0:\n \n if (A < B * 2 ** K) and (B * 2 ** K < C * 2 ** a):\n count +=1\n K -=1\n a +=1\n \n-if count == 1:\n+if count >= 1:\n print(\"Yes\")\n else: print(\"No\")\n", "FL_content": " A,B,C = map(int, input().split())\n K = int(input())\n count = 0\n a = 0\n-while K > 0:\n \n if (A < B * 2 ** K) and (B * 2 ** K < C * 2 ** a):\n count +=1\n K -=1\n a +=1\n \n-if count == 1:\n print(\"Yes\")\n else: print(\"No\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 14 }, { "user_id": "u477837488", "problem_id": "p02601", "submission1_id": "s776199794", "submission2_id": "s314053744", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = map(int, input().split())\nq = int(input())\n\nk = 0\n\nfor i in range(q+1):\n for j in range(0, q-i+1):\n print(i, j)\n B_ = B * (2 ** i)\n C_ = C * (2 ** j)\n if A < B_ and B_ < C_ and A < C_:\n k = 1\nif k != 0:\n print('Yes')\nelse:\n print('No')", "code2": "A, B, C = map(int, input().split())\nq = int(input())\n\nk = 0\n\nfor i in range(q+1):\n for j in range(0, q-i+1):\n B_ = B * (2 ** i)\n C_ = C * (2 ** j)\n if A < B_ and B_ < C_ and A < C_:\n k = 1\nif k != 0:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595726097", "date2": "1595726168", "bleu_score": "0.9293590971428531", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "16 2 4\n9\n", "actual_output": "0 0\n0 1\n0 2\n0 3\n0 4\n0 5\n0 6\n0 7\n0 8\n0 9\n1 0\n1 1\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n2 0\n2 1\n2 2\n2 3\n2 4\n2 5\n2 6\n2 7\n3 0\n3 1\n3 2\n3 3\n3 4\n3 5\n3 6\n4 0\n4 1\n4 2\n4 3\n4 4\n4 5\n5 0\n5 1\n5 2\n5 3\n5 4\n6 0\n6 1\n6 2\n6 3\n7 0\n7 1\n7 2\n8 0\n8 1\n9 0\nYes\n", "expected_output": "Yes\n\n", "anno_code": ["A, B, C = map(int, input().split()) # (0): A=16, B=2, C=4\nq = int(input()) # (1): q=9\n\nk = 0 # (2): k=0\n\nfor i in range(q+1): # (3): i=0 (55): i=1 ... (300): NO CHANGE\n for j in range(0, q-i+1): # (4): j=0 (9): j=1 ... (299): NO CHANGE\n print(i, j) # (5): NO CHANGE (10): NO CHANGE ... (295): NO CHANGE\n B_ = B * (2 ** i) # (6): B_=2 (11): NO CHANGE ... (296): B_=1024\n C_ = C * (2 ** j) # (7): C_=4 (12): C_=8 ... (297): C_=4\n if A < B_ and B_ < C_ and A < C_: # (8): NO CHANGE (13): NO CHANGE ... (298): NO CHANGE\n k = 1 # (207): k=1 (213): NO CHANGE\nif k != 0: # (301): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " A, B, C = map(int, input().split())\n q = int(input())\n \n k = 0\n \n for i in range(q+1):\n for j in range(0, q-i+1):\n- print(i, j)\n B_ = B * (2 ** i)\n C_ = C * (2 ** j)\n if A < B_ and B_ < C_ and A < C_:\n k = 1\n if k != 0:\n print('Yes')\n else:\n print('No')\n", "FL_content": " A, B, C = map(int, input().split())\n q = int(input())\n \n k = 0\n \n for i in range(q+1):\n for j in range(0, q-i+1):\n- print(i, j)\n B_ = B * (2 ** i)\n C_ = C * (2 ** j)\n if A < B_ and B_ < C_ and A < C_:\n k = 1\n if k != 0:\n print('Yes')\n else:\n print('No')\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u857460786", "problem_id": "p02601", "submission1_id": "s315358187", "submission2_id": "s615085166", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nA,B,C = map(int, input().split())\nK = int(input())\n\nfor i in range(K):\n\n if A > B:\n B *= 2\n if B > A:\n if B > C:\n C *= 2\n elif B < C:\n pass\n\nif A < B and B < C:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "\n\nA,B,C = map(int, input().split())\nK = int(input())\n\nfor i in range(K):\n\n if A >= B:\n B *= 2\n elif B > A:\n if B >= C:\n C *= 2\n elif B < C:\n pass\n else:\n pass\n\nif A < B and B < C:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1595725793", "date2": "1595726081", "bleu_score": "0.8855209345080605", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1], "code1_test_score": 60, "total_score": 102, "input": "3 3 6\n5\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["\n\nA,B,C = map(int, input().split()) # (0): A=3, B=3, C=6\nK = int(input()) # (1): K=5\n\nfor i in range(K): # (2): i=0 (5): i=1 ... (17): NO CHANGE\n\n if A > B: # (3): NO CHANGE (6): NO CHANGE ... (15): NO CHANGE\n B *= 2\n if B > A: # (4): NO CHANGE (7): NO CHANGE ... (16): NO CHANGE\n if B > C:\n C *= 2\n elif B < C:\n pass\n\nif A < B and B < C: # (18): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " \n \n A,B,C = map(int, input().split())\n K = int(input())\n \n for i in range(K):\n \n- if A > B:\n+ if A >= B:\n B *= 2\n- if B > A:\n- if B > C:\n+ elif B > A:\n+ if B >= C:\n C *= 2\n elif B < C:\n pass\n+ else:\n+ pass\n \n if A < B and B < C:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": " \n \n A,B,C = map(int, input().split())\n K = int(input())\n \n for i in range(K):\n \n- if A > B:\n B *= 2\n- if B > A:\n- if B > C:\n C *= 2\n elif B < C:\n pass\n \n if A < B and B < C:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 5, "removed_lines": 3, "code1_lines": 19 }, { "user_id": "u038155726", "problem_id": "p02601", "submission1_id": "s179307236", "submission2_id": "s963848216", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\ndef magic(a, b, c, k):\n i = 0\n while i < k:\n if a > b:\n b = b * 2\n elif b > c:\n c = c * 2\n if a < b and b < c:\n return \"Yes\"\n i += 1\n return \"No\"\n\n\nif __name__ == \"__main__\":\n param_a, param_b, param_c = input().split(' ')\n param_k = int(input())\n print(magic(int(param_a), int(param_b), int(param_c), int(param_k)))\n", "code2": "\n\n\ndef magic(a, b, c, k):\n for i in range(k):\n if a >= b:\n b = b * 2\n elif b >= c:\n c = c * 2\n i += 1\n if a < b and b < c:\n return \"Yes\"\n else:\n return \"No\"\n\n\nif __name__ == \"__main__\":\n param_a, param_b, param_c = map(int, input().split(' '))\n param_k = int(input())\n print(magic(param_a, param_b, param_c, param_k))\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595874810", "date2": "1595875175", "bleu_score": "0.8777396872107135", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 63, "total_score": 102, "input": "2 1 6\n2\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["\n\n\ndef magic(a, b, c, k): # (0): magic=\n i = 0\n while i < k:\n if a > b:\n b = b * 2\n elif b > c:\n c = c * 2\n if a < b and b < c:\n return \"Yes\"\n i += 1\n return \"No\"\n\n\nif __name__ == \"__main__\":\n param_a, param_b, param_c = input().split(' ')\n param_k = int(input())\n print(magic(int(param_a), int(param_b), int(param_c), int(param_k)))\n"], "anno_status": [true], "diff_content": " \n \n \n def magic(a, b, c, k):\n- i = 0\n- while i < k:\n- if a > b:\n+ for i in range(k):\n+ if a >= b:\n b = b * 2\n- elif b > c:\n+ elif b >= c:\n c = c * 2\n- if a < b and b < c:\n- return \"Yes\"\n i += 1\n- return \"No\"\n+ if a < b and b < c:\n+ return \"Yes\"\n+ else:\n+ return \"No\"\n \n \n if __name__ == \"__main__\":\n- param_a, param_b, param_c = input().split(' ')\n+ param_a, param_b, param_c = map(int, input().split(' '))\n param_k = int(input())\n- print(magic(int(param_a), int(param_b), int(param_c), int(param_k)))\n+ print(magic(param_a, param_b, param_c, param_k))\n \n", "FL_content": " \n \n \n def magic(a, b, c, k):\n- i = 0\n- while i < k:\n- if a > b:\n b = b * 2\n- elif b > c:\n c = c * 2\n- if a < b and b < c:\n- return \"Yes\"\n i += 1\n- return \"No\"\n \n \n if __name__ == \"__main__\":\n- param_a, param_b, param_c = input().split(' ')\n param_k = int(input())\n- print(magic(int(param_a), int(param_b), int(param_c), int(param_k)))\n \n", "added_lines": 9, "removed_lines": 9, "code1_lines": 21 }, { "user_id": "u552143188", "problem_id": "p02601", "submission1_id": "s467619221", "submission2_id": "s774145460", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = map(int, input().split())\nK = int(input())\n\n\nif A < B and B < C :\n print('Yes')\n exit()\n\nfor i in range(K):\n if A < C and C < B:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif B < A and A < C:\n B = B * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif B < C and C < A:\n B = B * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif C < A and A < B:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif C < B and B < A:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\nprint('No')", "code2": "A, B, C = map(int, input().split())\nK = int(input())\n\nif A < B and B < C :\n print('Yes')\n exit()\n\nfor i in range(K):\n if A <= C and C <= B:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif B <= A and A <= C:\n B = B * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif B <= C and C <= A:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif C <= A and A <= B:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif C <= B and B <= A:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\nprint('No')\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595727928", "date2": "1595728388", "bleu_score": "0.9494847647872153", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 61, "total_score": 102, "input": "12 7 7\n7\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["A, B, C = map(int, input().split()) # (0): A=12, B=7, C=7\nK = int(input()) # (1): K=7\n\n\nif A < B and B < C : # (2): NO CHANGE\n print('Yes')\n exit()\n\nfor i in range(K): # (3): i=0 (9): i=1 ... (45): NO CHANGE\n if A < C and C < B: # (4): NO CHANGE (10): NO CHANGE ... (40): NO CHANGE\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif B < A and A < C: # (5): NO CHANGE (11): NO CHANGE ... (41): NO CHANGE\n B = B * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif B < C and C < A: # (6): NO CHANGE (12): NO CHANGE ... (42): NO CHANGE\n B = B * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif C < A and A < B: # (7): NO CHANGE (13): NO CHANGE ... (43): NO CHANGE\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif C < B and B < A: # (8): NO CHANGE (14): NO CHANGE ... (44): NO CHANGE\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\nprint('No')"], "anno_status": [true], "diff_content": " A, B, C = map(int, input().split())\n K = int(input())\n \n-\n if A < B and B < C :\n print('Yes')\n exit()\n \n for i in range(K):\n- if A < C and C < B:\n+ if A <= C and C <= B:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n- elif B < A and A < C:\n+ elif B <= A and A <= C:\n B = B * 2\n if A < B and B < C:\n print('Yes')\n exit()\n- elif B < C and C < A:\n- B = B * 2\n+ elif B <= C and C <= A:\n+ C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n- elif C < A and A < B:\n+ elif C <= A and A <= B:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n- elif C < B and B < A:\n+ elif C <= B and B <= A:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n print('No')\n+\n", "FL_content": " A, B, C = map(int, input().split())\n K = int(input())\n \n-\n if A < B and B < C :\n print('Yes')\n exit()\n \n for i in range(K):\n- if A < C and C < B:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n- elif B < A and A < C:\n B = B * 2\n if A < B and B < C:\n print('Yes')\n exit()\n- elif B < C and C < A:\n- B = B * 2\n if A < B and B < C:\n print('Yes')\n exit()\n- elif C < A and A < B:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n- elif C < B and B < A:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n print('No')\n", "added_lines": 7, "removed_lines": 7, "code1_lines": 35 }, { "user_id": "u338597441", "problem_id": "p02601", "submission1_id": "s848826651", "submission2_id": "s900149866", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=map(int,input().split())\nk=int(input())\ni=0\nwhile a>=b:\n b*=2\n i+=1\n \n\nwhile b>=c:\n c*=2\n i+=1\n\nif a=b:\n b*=2\n i+=1\n \n\nwhile b>=c:\n c*=2\n i+=1\n\nif a=b: # (3): NO CHANGE (6): NO CHANGE (9): NO CHANGE\n b*=2 # (4): b=6 (7): b=12\n i+=1 # (5): i=1 (8): i=2\n \n\nwhile b>=c: # (10): NO CHANGE (13): NO CHANGE\n c*=2 # (11): c=18\n i+=1 # (12): i=3\n\nif a=b:\n b*=2\n i+=1\n \n \n while b>=c:\n c*=2\n i+=1\n \n if a=b:\n b*=2\n i+=1\n \n \n while b>=c:\n c*=2\n i+=1\n \n if a G:\n G = G * 2\n else:\n if G > B:\n B = B * 2\n if B > G > R:\n print(\"Yes\")\n exit()\n print(\"No\")\nif __name__ == '__main__':\n main()", "code2": "\ndef main():\n R, G, B = map(int, input().split())\n K = int(input())\n\n for i in range(K):\n if R >= G:\n G = G * 2\n else:\n if G >= B:\n B = B * 2\n if B > G > R:\n print(\"Yes\")\n exit()\n print(\"No\")\nif __name__ == '__main__':\n main()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595729996", "date2": "1595734075", "bleu_score": "0.9843497334798079", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 63, "total_score": 102, "input": "6 3 6\n5\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["\ndef main(): # (0): main=\n R, G, B = map(int, input().split())\n K = int(input())\n\n for i in range(K):\n if R > G:\n G = G * 2\n else:\n if G > B:\n B = B * 2\n if B > G > R:\n print(\"Yes\")\n exit()\n print(\"No\")\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " \n def main():\n R, G, B = map(int, input().split())\n K = int(input())\n \n for i in range(K):\n- if R > G:\n+ if R >= G:\n G = G * 2\n else:\n- if G > B:\n+ if G >= B:\n B = B * 2\n if B > G > R:\n print(\"Yes\")\n exit()\n print(\"No\")\n if __name__ == '__main__':\n main()\n", "FL_content": " \n def main():\n R, G, B = map(int, input().split())\n K = int(input())\n \n for i in range(K):\n- if R > G:\n G = G * 2\n else:\n- if G > B:\n B = B * 2\n if B > G > R:\n print(\"Yes\")\n exit()\n print(\"No\")\n if __name__ == '__main__':\n main()\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 17 }, { "user_id": "u272336707", "problem_id": "p02601", "submission1_id": "s002620160", "submission2_id": "s368638080", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = map(int, input().split())\nk = int(input())\nfor x in range(k+1):\n for y in range(x, k+1):\n if a * (2**x) < b * (2**(y-x)) < c* (2**(k-x-y)):\n print(\"Yes\")\n break\n break\nelse:\n print(\"No\")", "code2": "import sys\n\na, b, c = map(int, input().split())\nk = int(input())\nfor x in range(k+1):\n for y in range(x, k+1):\n if a * (2**x) < b * (2**(y-x)) < c* (2**(k-x-y)):\n print(\"Yes\")\n sys.exit()\nelse:\n print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595726580", "date2": "1595726707", "bleu_score": "0.905930496194067", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1], "code1_test_score": 77, "total_score": 102, "input": "8 3 4\n3\n", "actual_output": "no output\n", "expected_output": "No\n\n", "anno_code": ["a, b, c = map(int, input().split()) # (0): a=8, b=3, c=4\nk = int(input()) # (1): k=3\nfor x in range(k+1): # (2): x=0\n for y in range(x, k+1): # (3): y=0 (5): y=1 ... (11): NO CHANGE\n if a * (2**x) < b * (2**(y-x)) < c* (2**(k-x-y)): # (4): NO CHANGE (6): NO CHANGE ... (10): NO CHANGE\n print(\"Yes\")\n break\n break\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": "+import sys\n+\n a, b, c = map(int, input().split())\n k = int(input())\n for x in range(k+1):\n for y in range(x, k+1):\n if a * (2**x) < b * (2**(y-x)) < c* (2**(k-x-y)):\n print(\"Yes\")\n- break\n- break\n+ sys.exit()\n else:\n print(\"No\")\n", "FL_content": " a, b, c = map(int, input().split())\n k = int(input())\n for x in range(k+1):\n for y in range(x, k+1):\n if a * (2**x) < b * (2**(y-x)) < c* (2**(k-x-y)):\n print(\"Yes\")\n- break\n- break\n else:\n print(\"No\")\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u453642820", "problem_id": "p02975", "submission1_id": "s308017950", "submission2_id": "s225566121", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nA=list(map(int,input().split()))\nif A.count(0)==N:\n print(\"Yes\")\nelif N%3!=0:\n print(\"No\")\nelif len(set(A))==2:\n if 0 in set(A):\n if A.count(0)==N/3:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n print(\"No\")\nelif len(set(A))==3:\n print(\"Yes\" if all(A.count(a)==N/3 for a in set(A)) else \"No\")\nelse:\n print(\"No\")", "code2": "N=int(input())\nA=list(map(int,input().split()))\nif A.count(0)==N:\n print(\"Yes\")\nelif N%3!=0:\n print(\"No\")\nelif len(set(A))==2:\n if 0 in set(A):\n if A.count(0)==N/3:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n print(\"No\")\nelif len(set(A))==3:\n xor=0\n for a in set(A):\n if A.count(a)==N/3:\n xor^=a\n else:\n print(\"No\")\n exit()\n if xor==0:\n print(\"Yes\")\n else:\n print(\"No\")\nelse:\n print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592578249", "date2": "1592578581", "bleu_score": "0.7161079550295233", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 44, "total_score": 58, "input": "3\n-1 25 0\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["N=int(input()) # (0): N=3\nA=list(map(int,input().split())) # (1): A=[-1, 25, 0]\nif A.count(0)==N: # (2): NO CHANGE\n print(\"Yes\")\nelif N%3!=0: # (3): NO CHANGE\n print(\"No\")\nelif len(set(A))==2: # (4): NO CHANGE\n if 0 in set(A):\n if A.count(0)==N/3:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n print(\"No\")\nelif len(set(A))==3: # (5): NO CHANGE\n print(\"Yes\" if all(A.count(a)==N/3 for a in set(A)) else \"No\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " N=int(input())\n A=list(map(int,input().split()))\n if A.count(0)==N:\n print(\"Yes\")\n elif N%3!=0:\n print(\"No\")\n elif len(set(A))==2:\n if 0 in set(A):\n if A.count(0)==N/3:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n print(\"No\")\n elif len(set(A))==3:\n- print(\"Yes\" if all(A.count(a)==N/3 for a in set(A)) else \"No\")\n+ xor=0\n+ for a in set(A):\n+ if A.count(a)==N/3:\n+ xor^=a\n+ else:\n+ print(\"No\")\n+ exit()\n+ if xor==0:\n+ print(\"Yes\")\n+ else:\n+ print(\"No\")\n else:\n print(\"No\")\n", "FL_content": " N=int(input())\n A=list(map(int,input().split()))\n if A.count(0)==N:\n print(\"Yes\")\n elif N%3!=0:\n print(\"No\")\n elif len(set(A))==2:\n if 0 in set(A):\n if A.count(0)==N/3:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n print(\"No\")\n elif len(set(A))==3:\n- print(\"Yes\" if all(A.count(a)==N/3 for a in set(A)) else \"No\")\n else:\n print(\"No\")\n", "added_lines": 11, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u390618988", "problem_id": "p02975", "submission1_id": "s268735541", "submission2_id": "s507347414", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin, exit\n\nN = int(stdin.readline().rstrip())\na = [int(x) for x in stdin.readline().rstrip().split()]\n\nnum = []\nfor k in a:\n if k not in num:\n num.append(k)\n if len(num) > 3:\n print('No')\n exit()\nif len(num) == 1 and num[0] == 0:\n print('Yes')\n exit()\nif len(num) == 2 and num[0] ^ num[1] == num[0] and N % 2 == 0:\n print('Yes')\n exit()\nif len(num) <= 2:\n print('No')\n exit()\nif num[0] ^ num[1] != num[2] and num[2] ^ num[1] != num[0] and num[0] ^ num[2] != num[1] and N % 3 == 0:\n print('No')\nelse:\n print('Yes')\n", "code2": "from sys import stdin, exit\n\nN = int(stdin.readline().rstrip())\na = [int(x) for x in stdin.readline().rstrip().split()]\n\nnum = []\ncount = []\nfor k in a:\n if k not in num:\n num.append(k)\n count.append(1)\n else:\n count[num.index(k)] += 1\n if len(num) > 3:\n print('No')\n exit()\nif len(num) == 1 and num[0] == 0:\n print('Yes')\n exit()\nif len(num) == 2 and num[0] ^ num[1] == num[1] and N % 3 == 0 and count[1] == 2 * count[0]:\n print('Yes')\n exit()\nif len(num) == 2 and num[0] ^ num[1] == num[0] and N % 3 == 0 and count[0] == 2 * count[1]:\n print('Yes')\n exit()\nif len(num) <= 2:\n print('No')\n exit()\nif num[0] ^ num[1] ^ num[2] == 0 and N % 3 == 0 and count[0] == count[1] == count[2] == int(N / 3):\n print('Yes')\nelse:\n print('No')\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1563156513", "date2": "1563164939", "bleu_score": "0.6929282058716065", "code1_test_status": [1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0], "code1_test_score": 36, "total_score": 58, "input": "4\n0 7 1 0\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["from sys import stdin, exit\n\nN = int(stdin.readline().rstrip()) # (0): N=4\na = [int(x) for x in stdin.readline().rstrip().split()] # (1): a=[0, 7, 1, 0]\n\nnum = [] # (2): num=[]\nfor k in a: # (3): k=0 (7): k=7 ... (18): NO CHANGE\n if k not in num: # (4): NO CHANGE (8): NO CHANGE ... (16): NO CHANGE\n num.append(k) # (5): num=[0] (9): num=[0, 7] (13): num=[0, 7, 1]\n if len(num) > 3: # (6): NO CHANGE (10): NO CHANGE ... (17): NO CHANGE\n print('No')\n exit()\nif len(num) == 1 and num[0] == 0: # (19): NO CHANGE\n print('Yes')\n exit()\nif len(num) == 2 and num[0] ^ num[1] == num[0] and N % 2 == 0: # (20): NO CHANGE\n print('Yes')\n exit()\nif len(num) <= 2: # (21): NO CHANGE\n print('No')\n exit()\nif num[0] ^ num[1] != num[2] and num[2] ^ num[1] != num[0] and num[0] ^ num[2] != num[1] and N % 3 == 0: # (22): NO CHANGE\n print('No')\nelse:\n print('Yes')\n"], "anno_status": [true], "diff_content": " from sys import stdin, exit\n \n N = int(stdin.readline().rstrip())\n a = [int(x) for x in stdin.readline().rstrip().split()]\n \n num = []\n+count = []\n for k in a:\n if k not in num:\n num.append(k)\n+ count.append(1)\n+ else:\n+ count[num.index(k)] += 1\n if len(num) > 3:\n print('No')\n exit()\n if len(num) == 1 and num[0] == 0:\n print('Yes')\n exit()\n-if len(num) == 2 and num[0] ^ num[1] == num[0] and N % 2 == 0:\n+if len(num) == 2 and num[0] ^ num[1] == num[1] and N % 3 == 0 and count[1] == 2 * count[0]:\n+ print('Yes')\n+ exit()\n+if len(num) == 2 and num[0] ^ num[1] == num[0] and N % 3 == 0 and count[0] == 2 * count[1]:\n print('Yes')\n exit()\n if len(num) <= 2:\n print('No')\n exit()\n-if num[0] ^ num[1] != num[2] and num[2] ^ num[1] != num[0] and num[0] ^ num[2] != num[1] and N % 3 == 0:\n- print('No')\n-else:\n+if num[0] ^ num[1] ^ num[2] == 0 and N % 3 == 0 and count[0] == count[1] == count[2] == int(N / 3):\n print('Yes')\n+else:\n+ print('No')\n \n", "FL_content": " from sys import stdin, exit\n \n N = int(stdin.readline().rstrip())\n a = [int(x) for x in stdin.readline().rstrip().split()]\n \n num = []\n for k in a:\n if k not in num:\n num.append(k)\n if len(num) > 3:\n print('No')\n exit()\n if len(num) == 1 and num[0] == 0:\n print('Yes')\n exit()\n-if len(num) == 2 and num[0] ^ num[1] == num[0] and N % 2 == 0:\n print('Yes')\n exit()\n if len(num) <= 2:\n print('No')\n exit()\n-if num[0] ^ num[1] != num[2] and num[2] ^ num[1] != num[0] and num[0] ^ num[2] != num[1] and N % 3 == 0:\n- print('No')\n-else:\n print('Yes')\n \n", "added_lines": 11, "removed_lines": 4, "code1_lines": 26 }, { "user_id": "u358254559", "problem_id": "p02975", "submission1_id": "s566471074", "submission2_id": "s322108841", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\n\nres=0\n\nfor i in range(n):\n res = res ^ a[i]\n\nif n % 3 ==0:\n if res==0:\n print(\"Yes\")\n exit()\nelse:\n for i in range(n):\n if res == a[i]:\n print(\"Yes\")\n exit()\nprint(\"No\")", "code2": "n = int(input())\na = list(map(int, input().split()))\n\nres=0\na_set=set(a)\n\nres=0\nfor i in range(n):\n res = res ^ a[i]\n\nif n % 3 ==0:\n if res==0:\n print(\"Yes\")\n exit()\nelse:\n if len(a_set) ==1:\n print(\"Yes\")\n exit()\nprint(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580346582", "date2": "1580347759", "bleu_score": "0.8378291100490339", "code1_test_status": [1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 51, "total_score": 58, "input": "4\n2 -5 0 2\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n \n res=0\n+a_set=set(a)\n \n+res=0\n for i in range(n):\n res = res ^ a[i]\n \n if n % 3 ==0:\n if res==0:\n print(\"Yes\")\n exit()\n else:\n- for i in range(n):\n- if res == a[i]:\n- print(\"Yes\")\n- exit()\n+ if len(a_set) ==1:\n+ print(\"Yes\")\n+ exit()\n print(\"No\")\n", "FL_content": " n = int(input())\n a = list(map(int, input().split()))\n \n res=0\n \n for i in range(n):\n res = res ^ a[i]\n \n if n % 3 ==0:\n if res==0:\n print(\"Yes\")\n exit()\n else:\n- for i in range(n):\n- if res == a[i]:\n- print(\"Yes\")\n- exit()\n print(\"No\")\n", "added_lines": 5, "removed_lines": 4, "code1_lines": 18 }, { "user_id": "u456353530", "problem_id": "p02975", "submission1_id": "s813121419", "submission2_id": "s757379446", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\na = list(map(int, input().split()))\n\nR = {}\nfor i in a:\n if i in R:\n R[i] += 1\n else:\n R[i] = 1\n\nans = [\"Yes\", \"No\"]\nif 0 in R:\n if len(R) == 1:\n print(ans[0])\n elif len(R) == 2:\n for i in R.keys():\n if i != 0:\n x = R[i]\n else:\n z = R[i]\n if x == z * 2:\n print(ans[0])\n else:\n print(ans[1])\n else:\n print(ans[1])\nelse:\n if len(R) != 3:\n print(ans[0])\n else:\n t = -1\n for i in R.values():\n if t == -1:\n t = i\n else:\n if i != t:\n print(ans[1])\n break\n else:\n print(ans[0])", "code2": "N = int(input())\na = list(map(int, input().split()))\n\nR = {}\nfor i in a:\n if i in R:\n R[i] += 1\n else:\n R[i] = 1\n\nans = [\"Yes\", \"No\"]\nif 0 in R:\n if len(R) == 1:\n print(ans[0])\n elif len(R) == 2:\n for i in R.keys():\n if i != 0:\n x = R[i]\n else:\n z = R[i]\n if x == z * 2:\n print(ans[0])\n else:\n print(ans[1])\n else:\n print(ans[1])\nelse:\n if len(R) != 3:\n print(ans[1])\n else:\n t = -1\n for i in R.values():\n if t == -1:\n t = i\n else:\n if i != t:\n print(ans[1])\n break\n else:\n a = b = c = -1\n for i in R.keys():\n if a == -1:\n a = i\n elif b == -1:\n b = i\n else:\n c = i\n if a ^ b == c:\n print(ans[0])\n else:\n print(ans[1])", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1563155173", "date2": "1563155528", "bleu_score": "0.7427750720851666", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 43, "total_score": 58, "input": "3\n-1 49 -1\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["N = int(input()) # (0): N=3\na = list(map(int, input().split())) # (1): a=[-1, 49, -1]\n\nR = {} # (2): R={}\nfor i in a: # (3): i=-1 (6): i=49 ... (12): NO CHANGE\n if i in R: # (4): NO CHANGE (7): NO CHANGE (10): NO CHANGE\n R[i] += 1 # (11): R={-1: 2, 49: 1}\n else:\n R[i] = 1 # (5): R={-1: 1} (8): R={-1: 1, 49: 1}\n\nans = [\"Yes\", \"No\"] # (13): ans=['Yes', 'No']\nif 0 in R: # (14): NO CHANGE\n if len(R) == 1:\n print(ans[0])\n elif len(R) == 2:\n for i in R.keys():\n if i != 0:\n x = R[i]\n else:\n z = R[i]\n if x == z * 2:\n print(ans[0])\n else:\n print(ans[1])\n else:\n print(ans[1])\nelse:\n if len(R) != 3: # (15): NO CHANGE\n print(ans[0])\n else:\n t = -1\n for i in R.values():\n if t == -1:\n t = i\n else:\n if i != t:\n print(ans[1])\n break\n else:\n print(ans[0])"], "anno_status": [true], "diff_content": " N = int(input())\n a = list(map(int, input().split()))\n \n R = {}\n for i in a:\n if i in R:\n R[i] += 1\n else:\n R[i] = 1\n \n ans = [\"Yes\", \"No\"]\n if 0 in R:\n if len(R) == 1:\n print(ans[0])\n elif len(R) == 2:\n for i in R.keys():\n if i != 0:\n x = R[i]\n else:\n z = R[i]\n if x == z * 2:\n print(ans[0])\n else:\n print(ans[1])\n else:\n print(ans[1])\n else:\n if len(R) != 3:\n- print(ans[0])\n+ print(ans[1])\n else:\n t = -1\n for i in R.values():\n if t == -1:\n t = i\n else:\n if i != t:\n print(ans[1])\n break\n else:\n- print(ans[0])\n+ a = b = c = -1\n+ for i in R.keys():\n+ if a == -1:\n+ a = i\n+ elif b == -1:\n+ b = i\n+ else:\n+ c = i\n+ if a ^ b == c:\n+ print(ans[0])\n+ else:\n+ print(ans[1])\n", "FL_content": " N = int(input())\n a = list(map(int, input().split()))\n \n R = {}\n for i in a:\n if i in R:\n R[i] += 1\n else:\n R[i] = 1\n \n ans = [\"Yes\", \"No\"]\n if 0 in R:\n if len(R) == 1:\n print(ans[0])\n elif len(R) == 2:\n for i in R.keys():\n if i != 0:\n x = R[i]\n else:\n z = R[i]\n if x == z * 2:\n print(ans[0])\n else:\n print(ans[1])\n else:\n print(ans[1])\n else:\n if len(R) != 3:\n- print(ans[0])\n else:\n t = -1\n for i in R.values():\n if t == -1:\n t = i\n else:\n if i != t:\n print(ans[1])\n break\n else:\n- print(ans[0])\n", "added_lines": 13, "removed_lines": 2, "code1_lines": 40 }, { "user_id": "u114648678", "problem_id": "p02975", "submission1_id": "s763982952", "submission2_id": "s434675695", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import collections\nn=input()\na=list(map(int,input().split()))\nb=set(a)\nc=list(b)\nc.sort()\ncnt=collections.Counter(a)\nif len(b)==1:\n if c[0]==0:\n print('Yes')\nif len(b)==2:\n if c[0]==0 and cnt[1]%2==0:\n print('Yes')\nif len(b)==3:\n if cnt[c[0]]==cnt[c[1]]==cnt[c[2]]:\n if c[0]^c[1]==c[2]:\n print('Yes')\nelse:\n print('No')\n", "code2": "import collections\nn=input()\na=list(map(int,input().split()))\nb=set(a)\nc=list(b)\nc.sort()\ncnt=collections.Counter(a)\nif len(b)==1:\n if c[0]==0:\n print('Yes')\n else:\n print('No')\nif len(b)==2:\n if c[0]==0 and cnt[c[1]]%2==0 and cnt[c[0]]*2>=cnt[c[1]]:\n print('Yes')\n else:\n print('No')\nif len(b)==3:\n if c[0]==0:\n print('No')\n elif cnt[c[0]]==cnt[c[1]]==cnt[c[2]] and c[0]^c[1]==c[2]:\n print('Yes')\n else:\n print('No')\nif len(b)>3:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563157256", "date2": "1563160017", "bleu_score": "0.6946770140897192", "code1_test_status": [1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0], "code1_test_score": 20, "total_score": 58, "input": "4\n1 4 1 -1\n", "actual_output": "no output\n", "expected_output": "No\n\n", "anno_code": ["import collections\nn=input() # (0): n=4\na=list(map(int,input().split())) # (1): a=[1, 4, 1, -1]\nb=set(a) # (2): b={1, 4, -1}\nc=list(b) # (3): c=[1, 4, -1]\nc.sort() # (4): c=[-1, 1, 4]\ncnt=collections.Counter(a) # (5): cnt=Counter({1: 2, 4: 1, -1: 1})\nif len(b)==1: # (6): NO CHANGE\n if c[0]==0:\n print('Yes')\nif len(b)==2: # (7): NO CHANGE\n if c[0]==0 and cnt[1]%2==0:\n print('Yes')\nif len(b)==3: # (8): NO CHANGE\n if cnt[c[0]]==cnt[c[1]]==cnt[c[2]]:\n if c[0]^c[1]==c[2]:\n print('Yes')\nelse:\n print('No')\n"], "anno_status": [true], "diff_content": " import collections\n n=input()\n a=list(map(int,input().split()))\n b=set(a)\n c=list(b)\n c.sort()\n cnt=collections.Counter(a)\n if len(b)==1:\n if c[0]==0:\n print('Yes')\n+ else:\n+ print('No')\n if len(b)==2:\n- if c[0]==0 and cnt[1]%2==0:\n+ if c[0]==0 and cnt[c[1]]%2==0 and cnt[c[0]]*2>=cnt[c[1]]:\n print('Yes')\n+ else:\n+ print('No')\n if len(b)==3:\n- if cnt[c[0]]==cnt[c[1]]==cnt[c[2]]:\n- if c[0]^c[1]==c[2]:\n- print('Yes')\n-else:\n+ if c[0]==0:\n+ print('No')\n+ elif cnt[c[0]]==cnt[c[1]]==cnt[c[2]] and c[0]^c[1]==c[2]:\n+ print('Yes')\n+ else:\n+ print('No')\n+if len(b)>3:\n print('No')\n \n", "FL_content": " import collections\n n=input()\n a=list(map(int,input().split()))\n b=set(a)\n c=list(b)\n c.sort()\n cnt=collections.Counter(a)\n if len(b)==1:\n if c[0]==0:\n print('Yes')\n if len(b)==2:\n- if c[0]==0 and cnt[1]%2==0:\n print('Yes')\n if len(b)==3:\n- if cnt[c[0]]==cnt[c[1]]==cnt[c[2]]:\n- if c[0]^c[1]==c[2]:\n- print('Yes')\n-else:\n print('No')\n \n", "added_lines": 12, "removed_lines": 5, "code1_lines": 20 }, { "user_id": "u948911484", "problem_id": "p02975", "submission1_id": "s696169263", "submission2_id": "s367656456", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\nn = int(input())\na = list(map(int,input().split()))\nc = Counter(a)\nif len(c) == 3:\n l = list(c.keys())\n v = list(c.values())\n if l[0]^l[1]^l[2] == 0 and v[0]==v[1]==v[2]:\n print(\"Yes\")\nelif len(c) == 1:\n if list(c.keys())[0] == 0:\n print(\"Yes\")\nelif len(c) == 2:\n if (0 not in a):\n print(\"No\")\n else:\n v = c[0]\n if len(a) == c[0]*3/2 or len(a) == c[0]*3:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "from collections import Counter\nn = int(input())\na = list(map(int,input().split()))\nc = Counter(a)\nif len(c) == 3:\n l = list(c.keys())\n v = list(c.values())\n if l[0]^l[1]^l[2] == 0 and v[0]==v[1]==v[2]:\n print(\"Yes\")\n else:\n print(\"No\")\nelif len(c) == 1:\n if list(c.keys())[0] == 0:\n print(\"Yes\")\n else:\n print(\"No\")\nelif len(c) == 2:\n if (0 not in a):\n print(\"No\")\n else:\n v = c[0]\n if len(a) == c[0]*3:\n print(\"Yes\")\n else:\n print(\"No\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589850968", "date2": "1589851154", "bleu_score": "0.8300029242330463", "code1_test_status": [1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0], "code1_test_score": 20, "total_score": 58, "input": "3\n-1 25 0\n", "actual_output": "no output\n", "expected_output": "No\n\n", "anno_code": ["from collections import Counter\nn = int(input()) # (0): n=3\na = list(map(int,input().split())) # (1): a=[-1, 25, 0]\nc = Counter(a) # (2): c=Counter({-1: 1, 25: 1, 0: 1})\nif len(c) == 3: # (3): NO CHANGE\n l = list(c.keys()) # (4): l=[-1, 25, 0]\n v = list(c.values()) # (5): v=[1, 1, 1]\n if l[0]^l[1]^l[2] == 0 and v[0]==v[1]==v[2]:\n print(\"Yes\")\nelif len(c) == 1:\n if list(c.keys())[0] == 0:\n print(\"Yes\")\nelif len(c) == 2:\n if (0 not in a):\n print(\"No\")\n else:\n v = c[0]\n if len(a) == c[0]*3/2 or len(a) == c[0]*3:\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " from collections import Counter\n n = int(input())\n a = list(map(int,input().split()))\n c = Counter(a)\n if len(c) == 3:\n l = list(c.keys())\n v = list(c.values())\n if l[0]^l[1]^l[2] == 0 and v[0]==v[1]==v[2]:\n print(\"Yes\")\n+ else:\n+ print(\"No\")\n elif len(c) == 1:\n if list(c.keys())[0] == 0:\n print(\"Yes\")\n+ else:\n+ print(\"No\")\n elif len(c) == 2:\n if (0 not in a):\n print(\"No\")\n else:\n v = c[0]\n- if len(a) == c[0]*3/2 or len(a) == c[0]*3:\n+ if len(a) == c[0]*3:\n print(\"Yes\")\n+ else:\n+ print(\"No\")\n else:\n print(\"No\")\n", "FL_content": " from collections import Counter\n n = int(input())\n a = list(map(int,input().split()))\n c = Counter(a)\n if len(c) == 3:\n l = list(c.keys())\n v = list(c.values())\n if l[0]^l[1]^l[2] == 0 and v[0]==v[1]==v[2]:\n print(\"Yes\")\n elif len(c) == 1:\n if list(c.keys())[0] == 0:\n print(\"Yes\")\n elif len(c) == 2:\n if (0 not in a):\n print(\"No\")\n else:\n v = c[0]\n- if len(a) == c[0]*3/2 or len(a) == c[0]*3:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 7, "removed_lines": 1, "code1_lines": 21 }, { "user_id": "u651803486", "problem_id": "p02975", "submission1_id": "s414188731", "submission2_id": "s441361297", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\n\nN = int(input())\nA = list(map(int, input().split()))\n\ndic = defaultdict(int)\n\n\n\nif N % 3 == 0:\n \n for a in A:\n dic[a] += 1\n\n n_kind = len(dic.keys())\n values = list(dic.keys())\n cnts = list(dic.values())\n \n \n if n_kind == 3:\n \n is_xor = False\n for i in range(n_kind-2):\n for j in range(i+1, n_kind-1):\n for k in range(j+1, n_kind):\n if values[i] ^ values[j] ^ values[k] == 0:\n is_xor = True\n\n \n \n is_n_valid = True\n for cnt in cnts:\n if cnt != N/3:\n is_n_valid = False\n\n \n if is_xor and is_n_valid:\n print('Yes')\n else:\n print('No')\n \n elif n_kind == 2:\n \n \n is_in_zero = True\n if 0 in values:\n is_in_zero = False\n\n is_n_valid = True\n if is_in_zero:\n for k, v in dic.items():\n if k == 0:\n if v != N/3:\n is_n_valid = False\n else:\n if v != N * (2/3):\n is_n_valid = False\n\n if is_n_valid:\n print('Yes')\n else:\n print('No')\n\n\n elif n_kind == 1:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n\n if all_zero:\n print('Yes')\n else:\n print('No') \n\n else:\n print('No')\n\nelse:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n\n if all_zero:\n print('Yes')\n else:\n print('No')\n ", "code2": "from collections import defaultdict\n\nN = int(input())\nA = list(map(int, input().split()))\n\ndic = defaultdict(int)\n\n\n\nif N % 3 == 0:\n \n for a in A:\n dic[a] += 1\n\n n_kind = len(dic.keys())\n values = list(dic.keys())\n cnts = list(dic.values())\n \n \n if n_kind == 3:\n is_xor = False \n \n for i in range(n_kind-2):\n for j in range(i+1, n_kind-1):\n for k in range(j+1, n_kind):\n if values[i] ^ values[j] ^ values[k] == 0:\n is_xor = True\n\n \n \n is_n_valid = True\n for cnt in cnts:\n if cnt != N/3:\n is_n_valid = False\n\n \n if is_xor and is_n_valid:\n print('Yes')\n else:\n print('No')\n \n elif n_kind == 2:\n \n \n is_n_valid = True\n if 0 in values:\n for k, v in dic.items():\n if k == 0:\n if v != N/3:\n is_n_valid = False\n else:\n if v != N * (2/3):\n is_n_valid = False\n else:\n is_n_valid = False\n\n if is_n_valid:\n print('Yes')\n else:\n print('No')\n\n\n elif n_kind == 1:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n\n if all_zero:\n print('Yes')\n else:\n print('No') \n\n else:\n print('No')\n\n\nelse:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n\n if all_zero:\n print('Yes')\n else:\n print('No')\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563494122", "date2": "1563494529", "bleu_score": "0.9748123962286582", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 57, "total_score": 58, "input": "3\n0 25 0\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["from collections import defaultdict\n\nN = int(input()) # (0): N=3\nA = list(map(int, input().split())) # (1): A=[0, 25, 0]\n\ndic = defaultdict(int) # (2): dic=defaultdict(, {})\n\n\n\nif N % 3 == 0: # (3): NO CHANGE\n \n for a in A: # (4): a=0 (6): a=25 ... (10): NO CHANGE\n dic[a] += 1 # (5): dic=defaultdict(, {0: 1}) (7): dic=defaultdict(, {0: 1, 25: 1}) (9): dic=defaultdict(, {0: 2, 25: 1})\n\n n_kind = len(dic.keys()) # (11): n_kind=2\n values = list(dic.keys()) # (12): values=[0, 25]\n cnts = list(dic.values()) # (13): cnts=[2, 1]\n \n \n if n_kind == 3: # (14): NO CHANGE\n \n is_xor = False\n for i in range(n_kind-2):\n for j in range(i+1, n_kind-1):\n for k in range(j+1, n_kind):\n if values[i] ^ values[j] ^ values[k] == 0:\n is_xor = True\n\n \n \n is_n_valid = True\n for cnt in cnts:\n if cnt != N/3:\n is_n_valid = False\n\n \n if is_xor and is_n_valid:\n print('Yes')\n else:\n print('No')\n \n elif n_kind == 2: # (15): NO CHANGE\n \n \n is_in_zero = True # (16): is_in_zero=True\n if 0 in values: # (17): NO CHANGE\n is_in_zero = False # (18): is_in_zero=False\n\n is_n_valid = True # (19): is_n_valid=True\n if is_in_zero: # (20): NO CHANGE\n for k, v in dic.items():\n if k == 0:\n if v != N/3:\n is_n_valid = False\n else:\n if v != N * (2/3):\n is_n_valid = False\n\n if is_n_valid: # (21): NO CHANGE\n print('Yes')\n else:\n print('No')\n\n\n elif n_kind == 1:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n\n if all_zero:\n print('Yes')\n else:\n print('No') \n\n else:\n print('No')\n\nelse:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n\n if all_zero:\n print('Yes')\n else:\n print('No')\n "], "anno_status": [false], "diff_content": " from collections import defaultdict\n \n N = int(input())\n A = list(map(int, input().split()))\n \n dic = defaultdict(int)\n \n \n \n if N % 3 == 0:\n \n for a in A:\n dic[a] += 1\n \n n_kind = len(dic.keys())\n values = list(dic.keys())\n cnts = list(dic.values())\n- \n+ \n \n if n_kind == 3:\n+ is_xor = False \n \n- is_xor = False\n for i in range(n_kind-2):\n for j in range(i+1, n_kind-1):\n for k in range(j+1, n_kind):\n if values[i] ^ values[j] ^ values[k] == 0:\n is_xor = True\n \n \n \n is_n_valid = True\n for cnt in cnts:\n if cnt != N/3:\n is_n_valid = False\n \n \n if is_xor and is_n_valid:\n print('Yes')\n else:\n print('No')\n \n elif n_kind == 2:\n \n \n- is_in_zero = True\n- if 0 in values:\n- is_in_zero = False\n-\n is_n_valid = True\n- if is_in_zero:\n+ if 0 in values:\n for k, v in dic.items():\n if k == 0:\n if v != N/3:\n is_n_valid = False\n else:\n if v != N * (2/3):\n is_n_valid = False\n+ else:\n+ is_n_valid = False\n \n if is_n_valid:\n print('Yes')\n else:\n print('No')\n \n \n elif n_kind == 1:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n \n if all_zero:\n print('Yes')\n else:\n print('No') \n \n else:\n print('No')\n \n+\n else:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n \n if all_zero:\n print('Yes')\n else:\n print('No')\n \n", "FL_content": " from collections import defaultdict\n \n N = int(input())\n A = list(map(int, input().split()))\n \n dic = defaultdict(int)\n \n \n \n if N % 3 == 0:\n \n for a in A:\n dic[a] += 1\n \n n_kind = len(dic.keys())\n values = list(dic.keys())\n cnts = list(dic.values())\n- \n \n if n_kind == 3:\n \n- is_xor = False\n for i in range(n_kind-2):\n for j in range(i+1, n_kind-1):\n for k in range(j+1, n_kind):\n if values[i] ^ values[j] ^ values[k] == 0:\n is_xor = True\n \n \n \n is_n_valid = True\n for cnt in cnts:\n if cnt != N/3:\n is_n_valid = False\n \n \n if is_xor and is_n_valid:\n print('Yes')\n else:\n print('No')\n \n elif n_kind == 2:\n \n \n- is_in_zero = True\n- if 0 in values:\n- is_in_zero = False\n-\n is_n_valid = True\n- if is_in_zero:\n for k, v in dic.items():\n if k == 0:\n if v != N/3:\n is_n_valid = False\n else:\n if v != N * (2/3):\n is_n_valid = False\n \n if is_n_valid:\n print('Yes')\n else:\n print('No')\n \n \n elif n_kind == 1:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n \n if all_zero:\n print('Yes')\n else:\n print('No') \n \n else:\n print('No')\n \n else:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n \n if all_zero:\n print('Yes')\n else:\n print('No')\n \n", "added_lines": 6, "removed_lines": 7, "code1_lines": 89 }, { "user_id": "u712397093", "problem_id": "p02975", "submission1_id": "s637826951", "submission2_id": "s259490528", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\na = list(map(int, input().split()))\n\nsum = 0\nfor i in range(N):\n sum ^= a[i]\n\n print('Yes' if sum == 0 else 'No')\n", "code2": "N = int(input())\na = list(map(int, input().split()))\n\nsum = 0\nfor i in range(N):\n sum ^= a[i]\n\nprint('Yes' if sum == 0 else 'No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563643904", "date2": "1563644069", "bleu_score": "0.9591964190670353", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 58, "input": "3\n-1 49 -1\n", "actual_output": "No\nNo\nNo\n", "expected_output": "No\n\n", "anno_code": ["N = int(input()) # (0): N=3\na = list(map(int, input().split())) # (1): a=[-1, 49, -1]\n\nsum = 0 # (2): sum=0\nfor i in range(N): # (3): i=0 (6): i=1 (9): i=2\n sum ^= a[i] # (4): sum=-1 (7): sum=-50 (10): sum=49\n\n print('Yes' if sum == 0 else 'No') # (5): NO CHANGE (8): NO CHANGE (11): NO CHANGE\n"], "anno_status": [true], "diff_content": " N = int(input())\n a = list(map(int, input().split()))\n \n sum = 0\n for i in range(N):\n sum ^= a[i]\n \n- print('Yes' if sum == 0 else 'No')\n+print('Yes' if sum == 0 else 'No')\n \n", "FL_content": " N = int(input())\n a = list(map(int, input().split()))\n \n sum = 0\n for i in range(N):\n sum ^= a[i]\n \n- print('Yes' if sum == 0 else 'No')\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u126232616", "problem_id": "p02975", "submission1_id": "s617285756", "submission2_id": "s376108603", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\n\nn = int(input())\nA = list(map(int, input().split()))\nans = \"No\"\nCo = Counter(A)\nif n % 3 != 0 : \n if len(Co.keys()) == 1 and list(Co.keys())[0] == 0:\n ans = \"Yes\" \nelse :\n tr = n \n Va = Co.values()\n print(Va)\n if len(Va) == 3 :\n if Co.most_common()[0][1] == Co.most_common()[1][1] == Co.most_common()[2][1] == tr:\n ans = \"No\"\n elif len(Va) == 2 and Co.most_common()[0][1] == 2 * tr :\n ans = \"Yes\"\n elif len(Va) == 1 and Co.most_common()[0][0] == 1 :\n ans = \"Yes\"\n\nprint(ans)", "code2": "from collections import Counter\n\nn = int(input())\nA = list(map(int, input().split()))\nans = \"No\"\nCo = Counter(A)\nif n % 3 != 0 : \n if len(Co.keys()) == 1 and list(Co.keys())[0] == 0:\n ans = \"Yes\" \nelse :\n tr = n \n Va = Co.values()\n if len(Va) == 3 :\n if Co.most_common()[0][1] == Co.most_common()[1][1] == Co.most_common()[2][1] == tr:\n a,b,c = Co.most_common()[0][0],Co.most_common()[1][0],Co.most_common()[2][0]\n if a^b==c and b^c==a and c^a==b:\n ans = \"Yes\"\n elif len(Va) == 2 and Co.most_common()[0][1] == 2 * tr :\n a, b = Co.most_common()[0][0], Co.most_common()[1][0]\n if a^b==a and a^a==b:\n ans = \"Yes\"\n elif len(Va) == 1 and Co.most_common()[0][0] == 0 :\n ans = \"Yes\"\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563158945", "date2": "1563161388", "bleu_score": "0.6994707966795614", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 41, "total_score": 58, "input": "3\n0 25 2\n", "actual_output": "dict_values([1, 1, 1])\nNo\n", "expected_output": "No\n\n", "anno_code": ["from collections import Counter\n\nn = int(input()) # (0): n=3\nA = list(map(int, input().split())) # (1): A=[0, 25, 2]\nans = \"No\" # (2): ans=No\nCo = Counter(A) # (3): Co=Counter({0: 1, 25: 1, 2: 1})\nif n % 3 != 0 : # (4): NO CHANGE\n if len(Co.keys()) == 1 and list(Co.keys())[0] == 0:\n ans = \"Yes\" \nelse :\n tr = n # (5): tr=3\n Va = Co.values() # (6): Va=dict_values([1, 1, 1])\n print(Va) # (7): NO CHANGE\n if len(Va) == 3 : # (8): NO CHANGE\n if Co.most_common()[0][1] == Co.most_common()[1][1] == Co.most_common()[2][1] == tr: # (9): NO CHANGE\n ans = \"No\"\n elif len(Va) == 2 and Co.most_common()[0][1] == 2 * tr :\n ans = \"Yes\"\n elif len(Va) == 1 and Co.most_common()[0][0] == 1 :\n ans = \"Yes\"\n\nprint(ans)"], "anno_status": [true], "diff_content": " from collections import Counter\n \n n = int(input())\n A = list(map(int, input().split()))\n ans = \"No\"\n Co = Counter(A)\n if n % 3 != 0 : \n if len(Co.keys()) == 1 and list(Co.keys())[0] == 0:\n ans = \"Yes\" \n else :\n tr = n \n Va = Co.values()\n- print(Va)\n if len(Va) == 3 :\n if Co.most_common()[0][1] == Co.most_common()[1][1] == Co.most_common()[2][1] == tr:\n- ans = \"No\"\n+ a,b,c = Co.most_common()[0][0],Co.most_common()[1][0],Co.most_common()[2][0]\n+ if a^b==c and b^c==a and c^a==b:\n+ ans = \"Yes\"\n elif len(Va) == 2 and Co.most_common()[0][1] == 2 * tr :\n+ a, b = Co.most_common()[0][0], Co.most_common()[1][0]\n+ if a^b==a and a^a==b:\n+ ans = \"Yes\"\n+ elif len(Va) == 1 and Co.most_common()[0][0] == 0 :\n ans = \"Yes\"\n- elif len(Va) == 1 and Co.most_common()[0][0] == 1 :\n- ans = \"Yes\"\n-\n print(ans)\n", "FL_content": " from collections import Counter\n \n n = int(input())\n A = list(map(int, input().split()))\n ans = \"No\"\n Co = Counter(A)\n if n % 3 != 0 : \n if len(Co.keys()) == 1 and list(Co.keys())[0] == 0:\n ans = \"Yes\" \n else :\n tr = n \n Va = Co.values()\n- print(Va)\n if len(Va) == 3 :\n if Co.most_common()[0][1] == Co.most_common()[1][1] == Co.most_common()[2][1] == tr:\n- ans = \"No\"\n elif len(Va) == 2 and Co.most_common()[0][1] == 2 * tr :\n ans = \"Yes\"\n- elif len(Va) == 1 and Co.most_common()[0][0] == 1 :\n- ans = \"Yes\"\n-\n print(ans)\n", "added_lines": 7, "removed_lines": 5, "code1_lines": 22 }, { "user_id": "u852084108", "problem_id": "p02975", "submission1_id": "s247903623", "submission2_id": "s338792371", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndata = {}\nN = int(input())\nfor i in input().split():\n if i not in data:\n data.update({i: 1})\n else:\n data[str(i)] += 1\n\nok = 0\n\nif len(data.items()) > 3:\n pass\nelif len(data.items()) == 1:\n if list(data.keys())[0] == \"0\":\n ok = 1\nelif len(data.items()) == 2:\n print(data)\n if \"0\" in data.keys() and data[\"0\"] == N/3:\n ok = 1\nelse:\n sum = 0\n for i, count in data.items():\n if not count == N/3:\n ok = -1\n break\n sum = sum ^ int(i)\n if ok == 0 and sum == 0:\n ok = 1\n\nif ok == -1:\n ok = 0\nprint(\"Yes\" if ok else \"No\")\n\n", "code2": "\ndata = {}\nN = int(input())\nfor i in input().split():\n if i not in data:\n data.update({i: 1})\n else:\n data[str(i)] += 1\n\nok = 0\n\nif len(data.keys()) > 3:\n pass\nelif len(data.keys()) == 1:\n if list(data.keys())[0] == \"0\":\n ok = 1\nelif len(data.keys()) == 2:\n if \"0\" in data.keys() and data[\"0\"] == N/3:\n ok = 1\nelse:\n sum = 0\n for i, count in data.items():\n if not count == N/3:\n ok = -1\n break\n sum = sum ^ int(i)\n if ok == 0 and sum == 0:\n ok = 1\n\nif ok == -1:\n ok = 0\nprint(\"Yes\" if ok else \"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566941747", "date2": "1566941911", "bleu_score": "0.9463079136779838", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 51, "total_score": 58, "input": "4\n1 4 1 1\n", "actual_output": "{'1': 3, '4': 1}\nNo\n", "expected_output": "No\n\n", "anno_code": ["\ndata = {} # (0): data={}\nN = int(input()) # (1): N=4\nfor i in input().split(): # (2): i=1 (5): i=4 ... (14): NO CHANGE\n if i not in data: # (3): NO CHANGE (6): NO CHANGE ... (12): NO CHANGE\n data.update({i: 1}) # (4): data={'1': 1} (7): data={'1': 1, '4': 1}\n else:\n data[str(i)] += 1 # (10): data={'1': 2, '4': 1} (13): data={'1': 3, '4': 1}\n\nok = 0 # (15): ok=0\n\nif len(data.items()) > 3: # (16): NO CHANGE\n pass\nelif len(data.items()) == 1: # (17): NO CHANGE\n if list(data.keys())[0] == \"0\":\n ok = 1\nelif len(data.items()) == 2: # (18): NO CHANGE\n print(data) # (19): NO CHANGE\n if \"0\" in data.keys() and data[\"0\"] == N/3: # (20): NO CHANGE\n ok = 1\nelse:\n sum = 0\n for i, count in data.items():\n if not count == N/3:\n ok = -1\n break\n sum = sum ^ int(i)\n if ok == 0 and sum == 0:\n ok = 1\n\nif ok == -1: # (21): NO CHANGE\n ok = 0\nprint(\"Yes\" if ok else \"No\")\n\n"], "anno_status": [true], "diff_content": " \n data = {}\n N = int(input())\n for i in input().split():\n if i not in data:\n data.update({i: 1})\n else:\n data[str(i)] += 1\n \n ok = 0\n \n-if len(data.items()) > 3:\n+if len(data.keys()) > 3:\n pass\n-elif len(data.items()) == 1:\n+elif len(data.keys()) == 1:\n if list(data.keys())[0] == \"0\":\n ok = 1\n-elif len(data.items()) == 2:\n- print(data)\n+elif len(data.keys()) == 2:\n if \"0\" in data.keys() and data[\"0\"] == N/3:\n ok = 1\n else:\n sum = 0\n for i, count in data.items():\n if not count == N/3:\n ok = -1\n break\n sum = sum ^ int(i)\n if ok == 0 and sum == 0:\n ok = 1\n \n if ok == -1:\n ok = 0\n print(\"Yes\" if ok else \"No\")\n \n-\n", "FL_content": " \n data = {}\n N = int(input())\n for i in input().split():\n if i not in data:\n data.update({i: 1})\n else:\n data[str(i)] += 1\n \n ok = 0\n \n-if len(data.items()) > 3:\n pass\n-elif len(data.items()) == 1:\n if list(data.keys())[0] == \"0\":\n ok = 1\n-elif len(data.items()) == 2:\n- print(data)\n if \"0\" in data.keys() and data[\"0\"] == N/3:\n ok = 1\n else:\n sum = 0\n for i, count in data.items():\n if not count == N/3:\n ok = -1\n break\n sum = sum ^ int(i)\n if ok == 0 and sum == 0:\n ok = 1\n \n if ok == -1:\n ok = 0\n print(\"Yes\" if ok else \"No\")\n \n-\n", "added_lines": 3, "removed_lines": 5, "code1_lines": 35 }, { "user_id": "u131411061", "problem_id": "p02916", "submission1_id": "s963746134", "submission2_id": "s596826092", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\nC = list(map(int,input().split()))\n\nres = 0\nprev = -1\nfor i in range(N):\n\tres += B[A[i]-1]\n\tif prev+1 == A[i]-1:\n\t\tres += C[prev]\n\tprev = A[i]-1 \nprint(res)", "code2": "N = int(input())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\nC = list(map(int,input().split()))\n \nans = 0\ntmp = -1\nfor a in A:\n ans += B[a-1]\n if a-tmp == 1:\n ans += C[tmp-1]\n tmp = a\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596641906", "date2": "1596641946", "bleu_score": "0.6924632189000911", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1], "code1_test_score": 86, "total_score": 103, "input": "2\n1 0\n18 74\n56\n", "actual_output": "148\n", "expected_output": "92\n\n", "anno_code": ["N = int(input()) # (0): N=2\nA = list(map(int,input().split())) # (1): A=[1, 0]\nB = list(map(int,input().split())) # (2): B=[18, 74]\nC = list(map(int,input().split())) # (3): C=[56]\n\nres = 0 # (4): res=0\nprev = -1 # (5): prev=-1\nfor i in range(N): # (6): i=0 (11): i=1 (15): NO CHANGE\n\tres += B[A[i]-1] # (7): res=18 (12): res=148\n\tif prev+1 == A[i]-1: # (8): NO CHANGE (13): NO CHANGE\n\t\tres += C[prev] # (9): res=74\n\tprev = A[i]-1 # (10): prev=0 (14): prev=-1\nprint(res)"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int,input().split()))\n B = list(map(int,input().split()))\n C = list(map(int,input().split()))\n-\n-res = 0\n-prev = -1\n-for i in range(N):\n-\tres += B[A[i]-1]\n-\tif prev+1 == A[i]-1:\n-\t\tres += C[prev]\n-\tprev = A[i]-1 \n-print(res)\n+ \n+ans = 0\n+tmp = -1\n+for a in A:\n+ ans += B[a-1]\n+ if a-tmp == 1:\n+ ans += C[tmp-1]\n+ tmp = a\n+print(ans)\n", "FL_content": " N = int(input())\n A = list(map(int,input().split()))\n B = list(map(int,input().split()))\n C = list(map(int,input().split()))\n-\n-res = 0\n-prev = -1\n-for i in range(N):\n-\tres += B[A[i]-1]\n-\tif prev+1 == A[i]-1:\n-\t\tres += C[prev]\n-\tprev = A[i]-1 \n-print(res)\n", "added_lines": 9, "removed_lines": 9, "code1_lines": 13 }, { "user_id": "u491462774", "problem_id": "p02916", "submission1_id": "s670450263", "submission2_id": "s534131457", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\nc = list(map(int,input().split()))\nsum_satisfaction = sum(b)\n\nfor i in range(1,n):\n if(i < n-1 and a[i] == a[i-1] + 1 ):\n sum_satisfaction = sum_satisfaction + c[i]\nprint(sum_satisfaction)", "code2": "n = int(input())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\nc = list(map(int,input().split()))\nsum_satisfaction = sum(b)\n\nfor i in range(0,n-1):\n if(a[i+1] - a[i] == 1 ):\n sum_satisfaction = sum_satisfaction + c[a[i]-1]\n \nprint(sum_satisfaction)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591320700", "date2": "1591322081", "bleu_score": "0.9207782553072054", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1], "code1_test_score": 77, "total_score": 103, "input": "3\n3 1 2\n0 5 3\n3 6\n", "actual_output": "8\n", "expected_output": "11\n\n", "anno_code": ["n = int(input()) # (0): n=3\na = list(map(int,input().split())) # (1): a=[3, 1, 2]\nb = list(map(int,input().split())) # (2): b=[0, 5, 3]\nc = list(map(int,input().split())) # (3): c=[3, 6]\nsum_satisfaction = sum(b) # (4): sum_satisfaction=8\n\nfor i in range(1,n): # (5): i=1 (7): i=2 (9): NO CHANGE\n if(i < n-1 and a[i] == a[i-1] + 1 ): # (6): NO CHANGE (8): NO CHANGE\n sum_satisfaction = sum_satisfaction + c[i]\nprint(sum_satisfaction)"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int,input().split()))\n b = list(map(int,input().split()))\n c = list(map(int,input().split()))\n sum_satisfaction = sum(b)\n \n-for i in range(1,n):\n- if(i < n-1 and a[i] == a[i-1] + 1 ):\n- sum_satisfaction = sum_satisfaction + c[i]\n+for i in range(0,n-1):\n+ if(a[i+1] - a[i] == 1 ):\n+ sum_satisfaction = sum_satisfaction + c[a[i]-1]\n+ \n print(sum_satisfaction)\n", "FL_content": " n = int(input())\n a = list(map(int,input().split()))\n b = list(map(int,input().split()))\n c = list(map(int,input().split()))\n sum_satisfaction = sum(b)\n \n-for i in range(1,n):\n- if(i < n-1 and a[i] == a[i-1] + 1 ):\n- sum_satisfaction = sum_satisfaction + c[i]\n print(sum_satisfaction)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 10 }, { "user_id": "u188138642", "problem_id": "p02916", "submission1_id": "s353009705", "submission2_id": "s139916689", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nans = 0\ni = -1\nfor j in range(n):\n if a[j]-1 == i+1:\n ans += c[i]\n i = a[j] - 1\n ans += b[i]\nprint(ans)\n", "code2": "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nans = 0\ni = -2\nfor j in range(n):\n if a[j]-1 == i+1:\n ans += c[i]\n i = a[j] - 1\n ans += b[i]\nprint(ans)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598488926", "date2": "1598490006", "bleu_score": "0.9897431450598241", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1], "code1_test_score": 86, "total_score": 103, "input": "2\n1 2\n10 95\n31\n", "actual_output": "167\n", "expected_output": "136\n\n", "anno_code": ["n = int(input()) # (0): n=2\na = list(map(int, input().split())) # (1): a=[1, 2]\nb = list(map(int, input().split())) # (2): b=[10, 95]\nc = list(map(int, input().split())) # (3): c=[31]\n\nans = 0 # (4): ans=0\ni = -1 # (5): i=-1\nfor j in range(n): # (6): j=0 (11): j=1 (16): NO CHANGE\n if a[j]-1 == i+1: # (7): NO CHANGE (12): NO CHANGE\n ans += c[i] # (8): ans=31 (13): ans=72\n i = a[j] - 1 # (9): i=0 (14): i=1\n ans += b[i] # (10): ans=41 (15): ans=167\nprint(ans)\n"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n c = list(map(int, input().split()))\n \n ans = 0\n-i = -1\n+i = -2\n for j in range(n):\n if a[j]-1 == i+1:\n ans += c[i]\n i = a[j] - 1\n ans += b[i]\n print(ans)\n \n", "FL_content": " n = int(input())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n c = list(map(int, input().split()))\n \n ans = 0\n-i = -1\n for j in range(n):\n if a[j]-1 == i+1:\n ans += c[i]\n i = a[j] - 1\n ans += b[i]\n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 14 }, { "user_id": "u336564899", "problem_id": "p02916", "submission1_id": "s930634817", "submission2_id": "s734992045", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\n\nans = sum(B)\n\nfor i in range(N-1):\n if A[i] == A[i+1] - 1:\n print(str(A[i])+ \" : \" +str(A[i+1]))\n ans += C[A[i]-1]\n\nprint(ans)\n", "code2": "N = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\n\nans = sum(B)\n\nfor i in range(N-1):\n if A[i]+1 == A[i+1]:\n \n ans += C[A[i]-1]\n\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1578120507", "date2": "1578120842", "bleu_score": "0.8275239383229507", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0], "code1_test_score": 16, "total_score": 103, "input": "4\n2 3 4 1\n7 1 1 24\n45 9 16\n", "actual_output": "2 : 3\n3 : 4\n58\n", "expected_output": "58\n\n", "anno_code": ["N = int(input()) # (0): N=4\nA = list(map(int, input().split())) # (1): A=[2, 3, 4, 1]\nB = list(map(int, input().split())) # (2): B=[7, 1, 1, 24]\nC = list(map(int, input().split())) # (3): C=[45, 9, 16]\n\nans = sum(B) # (4): ans=33\n\nfor i in range(N-1): # (5): i=0 (9): i=1 ... (15): NO CHANGE\n if A[i] == A[i+1] - 1: # (6): NO CHANGE (10): NO CHANGE (14): NO CHANGE\n print(str(A[i])+ \" : \" +str(A[i+1])) # (7): NO CHANGE (11): NO CHANGE\n ans += C[A[i]-1] # (8): ans=42 (12): ans=58\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n C = list(map(int, input().split()))\n \n ans = sum(B)\n \n for i in range(N-1):\n- if A[i] == A[i+1] - 1:\n- print(str(A[i])+ \" : \" +str(A[i+1]))\n+ if A[i]+1 == A[i+1]:\n+ \n ans += C[A[i]-1]\n \n print(ans)\n \n", "FL_content": " N = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n C = list(map(int, input().split()))\n \n ans = sum(B)\n \n for i in range(N-1):\n- if A[i] == A[i+1] - 1:\n- print(str(A[i])+ \" : \" +str(A[i+1]))\n ans += C[A[i]-1]\n \n print(ans)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 14 }, { "user_id": "u369073975", "problem_id": "p02916", "submission1_id": "s822559130", "submission2_id": "s764389103", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\nC = list(map(int,input().split()))\n \nans = sum(B) \nfor i in range(N-1):\n if A[i+1] - A[i] ==1:\n ans += C[i-1]\nprint(ans)\n", "code2": "N = int(input())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\nC = list(map(int,input().split()))\n \nans = sum(B) \nfor i in range(N-1):\n if A[i+1] - A[i] ==1:\n ans += C[A[i]-1]\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569347087", "date2": "1569348279", "bleu_score": "0.9771566346773642", "code1_test_status": [1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0], "code1_test_score": 44, "total_score": 103, "input": "4\n2 3 4 1\n7 5 1 77\n45 9 8\n", "actual_output": "143\n", "expected_output": "107\n\n", "anno_code": ["N = int(input()) # (0): N=4\nA = list(map(int,input().split())) # (1): A=[2, 3, 4, 1]\nB = list(map(int,input().split())) # (2): B=[7, 5, 1, 77]\nC = list(map(int,input().split())) # (3): C=[45, 9, 8]\n \nans = sum(B) # (4): ans=90\nfor i in range(N-1): # (5): i=0 (8): i=1 ... (13): NO CHANGE\n if A[i+1] - A[i] ==1: # (6): NO CHANGE (9): NO CHANGE (12): NO CHANGE\n ans += C[i-1] # (7): ans=98 (10): ans=143\nprint(ans)\n"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int,input().split()))\n B = list(map(int,input().split()))\n C = list(map(int,input().split()))\n \n ans = sum(B) \n for i in range(N-1):\n if A[i+1] - A[i] ==1:\n- ans += C[i-1]\n+ ans += C[A[i]-1]\n print(ans)\n \n", "FL_content": " N = int(input())\n A = list(map(int,input().split()))\n B = list(map(int,input().split()))\n C = list(map(int,input().split()))\n \n ans = sum(B) \n for i in range(N-1):\n if A[i+1] - A[i] ==1:\n- ans += C[i-1]\n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u629540524", "problem_id": "p02916", "submission1_id": "s140948200", "submission2_id": "s330736304", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na,b,c = [list(map(int,input().split())) for i in range(3)]\nx = 0\nd = -10\nfor i in range(n):\n x += b[a[i]-1]\n if i-1 == d:\n x+= c[d]\n if d != 0:\n d=i\nprint(x)", "code2": "n = int(input())\na,b,c = [list(map(int,input().split())) for i in range(3)]\nx = 0\nd = -10\nfor i in range(n):\n y = b[a[i]-1]\n x += y\n if a[i]-1 == d:\n x+= c[d-1]\n d = a[i]\nprint(x)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598563292", "date2": "1598564285", "bleu_score": "0.8894821634820492", "code1_test_status": [0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0], "code1_test_score": 21, "total_score": 103, "input": "4\n2 3 4 1\n20 5 1 24\n45 9 16\n", "actual_output": "95\n", "expected_output": "75\n\n", "anno_code": ["n = int(input()) # (0): n=4\na,b,c = [list(map(int,input().split())) for i in range(3)] # (1): a=[2, 3, 4, 1], b=[20, 5, 1, 24], c=[45, 9, 16]\nx = 0 # (2): x=0\nd = -10 # (3): d=-10\nfor i in range(n): # (4): i=0 (9): i=1 ... (22): NO CHANGE\n x += b[a[i]-1] # (5): x=5 (10): x=6 ... (19): x=95\n if i-1 == d: # (6): NO CHANGE (11): NO CHANGE ... (20): NO CHANGE\n x+= c[d] # (12): x=51\n if d != 0: # (7): NO CHANGE (13): NO CHANGE ... (21): NO CHANGE\n d=i # (8): d=0\nprint(x)"], "anno_status": [true], "diff_content": " n = int(input())\n a,b,c = [list(map(int,input().split())) for i in range(3)]\n x = 0\n d = -10\n for i in range(n):\n- x += b[a[i]-1]\n- if i-1 == d:\n- x+= c[d]\n- if d != 0:\n- d=i\n+ y = b[a[i]-1]\n+ x += y\n+ if a[i]-1 == d:\n+ x+= c[d-1]\n+ d = a[i]\n print(x)\n", "FL_content": " n = int(input())\n a,b,c = [list(map(int,input().split())) for i in range(3)]\n x = 0\n d = -10\n for i in range(n):\n- x += b[a[i]-1]\n- if i-1 == d:\n- x+= c[d]\n- if d != 0:\n- d=i\n print(x)\n", "added_lines": 5, "removed_lines": 5, "code1_lines": 11 }, { "user_id": "u642528832", "problem_id": "p02916", "submission1_id": "s633504969", "submission2_id": "s756762340", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nla = list(map(int,input().split()))\nlb = list(map(int,input().split()))\nlc = list(map(int,input().split()))\n\ncon = 0\n\nfor i in range(len(la)-1):\n if la[(i+1)%3]==la[i]+1:\n con += lc[la[i]-1]\n\nprint(sum(lb)+con)", "code2": "n = int(input())\nla = list(map(int,input().split()))\nlb = list(map(int,input().split()))\nlc = list(map(int,input().split()))\n\ncon = 0\n\nfor i in range(n-1):\n if la[i+1]==la[i]+1:\n con += lc[la[i]-1]\n\nprint(sum(lb)+con)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595214467", "date2": "1595214687", "bleu_score": "0.9344136003469655", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 98, "total_score": 103, "input": "4\n2 3 0 1\n7 5 4 24\n45 9 21\n", "actual_output": "49\n", "expected_output": "70\n\n", "anno_code": ["n = int(input()) # (0): n=4\nla = list(map(int,input().split())) # (1): la=[2, 3, 0, 1]\nlb = list(map(int,input().split())) # (2): lb=[7, 5, 4, 24]\nlc = list(map(int,input().split())) # (3): lc=[45, 9, 21]\n\ncon = 0 # (4): con=0\n\nfor i in range(len(la)-1): # (5): i=0 (8): i=1 ... (12): NO CHANGE\n if la[(i+1)%3]==la[i]+1: # (6): NO CHANGE (9): NO CHANGE (11): NO CHANGE\n con += lc[la[i]-1] # (7): con=9\n\nprint(sum(lb)+con)"], "anno_status": [true], "diff_content": " n = int(input())\n la = list(map(int,input().split()))\n lb = list(map(int,input().split()))\n lc = list(map(int,input().split()))\n \n con = 0\n \n-for i in range(len(la)-1):\n- if la[(i+1)%3]==la[i]+1:\n+for i in range(n-1):\n+ if la[i+1]==la[i]+1:\n con += lc[la[i]-1]\n \n print(sum(lb)+con)\n", "FL_content": " n = int(input())\n la = list(map(int,input().split()))\n lb = list(map(int,input().split()))\n lc = list(map(int,input().split()))\n \n con = 0\n \n-for i in range(len(la)-1):\n- if la[(i+1)%3]==la[i]+1:\n con += lc[la[i]-1]\n \n print(sum(lb)+con)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 12 }, { "user_id": "u687053495", "problem_id": "p02916", "submission1_id": "s137574413", "submission2_id": "s467639503", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nans = 0\nfor i in range(n):\n ai = a[i]\n ans += b[ai - 1]\n if ai < len(c) and i != n - 1:\n ans += c[ai - 1]\n\nprint(ans)", "code2": "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nans = sum(b)\nfor i in range(1, n):\n if a[i] == a[i - 1] + 1:\n ans += c[a[i - 1] - 1]\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568254470", "date2": "1568255048", "bleu_score": "0.806191413778694", "code1_test_status": [1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0], "code1_test_score": 37, "total_score": 103, "input": "4\n2 3 4 1\n7 1 2 48\n45 9 16\n", "actual_output": "67\n", "expected_output": "83\n\n", "anno_code": ["n = int(input()) # (0): n=4\na = list(map(int, input().split())) # (1): a=[2, 3, 4, 1]\nb = list(map(int, input().split())) # (2): b=[7, 1, 2, 48]\nc = list(map(int, input().split())) # (3): c=[45, 9, 16]\n\nans = 0 # (4): ans=0\nfor i in range(n): # (5): i=0 (10): i=1 ... (22): NO CHANGE\n ai = a[i] # (6): ai=2 (11): ai=3 ... (19): ai=1\n ans += b[ai - 1] # (7): ans=1 (12): ans=12 ... (20): ans=67\n if ai < len(c) and i != n - 1: # (8): NO CHANGE (13): NO CHANGE ... (21): NO CHANGE\n ans += c[ai - 1] # (9): ans=10\n\nprint(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n c = list(map(int, input().split()))\n \n-ans = 0\n-for i in range(n):\n- ai = a[i]\n- ans += b[ai - 1]\n- if ai < len(c) and i != n - 1:\n- ans += c[ai - 1]\n+ans = sum(b)\n+for i in range(1, n):\n+ if a[i] == a[i - 1] + 1:\n+ ans += c[a[i - 1] - 1]\n \n print(ans)\n", "FL_content": " n = int(input())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n c = list(map(int, input().split()))\n \n-ans = 0\n-for i in range(n):\n- ai = a[i]\n- ans += b[ai - 1]\n- if ai < len(c) and i != n - 1:\n- ans += c[ai - 1]\n \n print(ans)\n", "added_lines": 4, "removed_lines": 6, "code1_lines": 13 }, { "user_id": "u847758719", "problem_id": "p02916", "submission1_id": "s906488466", "submission2_id": "s274691462", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = input().split()\nb = input().split()\nc = input().split()\n\nresult = 0\nj = 0\nfor i in a:\n m = int(i) - 1\n result += int(b[m])\n if (not (m == 0)) and (j + 1 == m):\n result += int(c[j])\n j = m\nprint(result)", "code2": "n = int(input())\na = input().split()\nb = input().split()\nc = input().split()\n\nresult = 0\nj = 0\nisFirst = True\nfor i in a:\n m = int(i) - 1\n result += int(b[m])\n if (not (isFirst)) and (j + 1 == m):\n result += int(c[j])\n j = m\n isFirst = False\nprint(result)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567909611", "date2": "1567909873", "bleu_score": "0.8422643784700724", "code1_test_status": [1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0], "code1_test_score": 32, "total_score": 103, "input": "4\n2 3 4 1\n14 10 1 70\n8 6 16\n", "actual_output": "125\n", "expected_output": "117\n\n", "anno_code": ["n = int(input()) # (0): n=4\na = input().split() # (1): a=['2', '3', '4', '1']\nb = input().split() # (2): b=['14', '10', '1', '70']\nc = input().split() # (3): c=['8', '6', '16']\n\nresult = 0 # (4): result=0\nj = 0 # (5): j=0\nfor i in a: # (6): i=2 (12): i=3 ... (29): NO CHANGE\n m = int(i) - 1 # (7): m=1 (13): m=2 ... (25): m=0\n result += int(b[m]) # (8): result=10 (14): result=19 ... (26): result=125\n if (not (m == 0)) and (j + 1 == m): # (9): NO CHANGE (15): NO CHANGE ... (27): NO CHANGE\n result += int(c[j]) # (10): result=18 (16): result=25 (22): result=111\n j = m # (11): j=1 (17): j=2 ... (28): j=0\nprint(result)"], "anno_status": [true], "diff_content": " n = int(input())\n a = input().split()\n b = input().split()\n c = input().split()\n \n result = 0\n j = 0\n+isFirst = True\n for i in a:\n m = int(i) - 1\n result += int(b[m])\n- if (not (m == 0)) and (j + 1 == m):\n+ if (not (isFirst)) and (j + 1 == m):\n result += int(c[j])\n j = m\n+ isFirst = False\n print(result)\n", "FL_content": " n = int(input())\n a = input().split()\n b = input().split()\n c = input().split()\n \n result = 0\n j = 0\n for i in a:\n m = int(i) - 1\n result += int(b[m])\n- if (not (m == 0)) and (j + 1 == m):\n result += int(c[j])\n j = m\n print(result)\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 14 }, { "user_id": "u198998746", "problem_id": "p02916", "submission1_id": "s677245956", "submission2_id": "s125737863", "status1": "Wrong Answer", "status2": "Accepted", "code1": "num = int(input())\nindex = list(map(int, input().split()))\npoint = list(map(int, input().split()))\nadd = list(map(int, input().split()))\n\ntotal = 0\nfor i in range(num):\n total += point[index[i]-1]\n\nfor j in range(num-1):\n if index[j+1] == index[j]+ 1:\n total += add[j]\n\nprint(total)", "code2": "num = int(input())\nindex = list(map(int, input().split()))\npoint = list(map(int, input().split()))\nadd = list(map(int, input().split()))\n\n\ntotal = 0\nfor i in range(num):\n total += point[index[i]-1]\n\nfor j in range(num-1):\n if index[j+1] == index[j]+ 1:\n total += add[index[j]-1]\n\nprint(total)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586494760", "date2": "1586494920", "bleu_score": "0.9601857701286821", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0], "code1_test_score": 25, "total_score": 103, "input": "3\n3 1 2\n1 1 0\n3 16\n", "actual_output": "18\n", "expected_output": "5\n\n", "anno_code": ["num = int(input()) # (0): num=3\nindex = list(map(int, input().split())) # (1): index=[3, 1, 2]\npoint = list(map(int, input().split())) # (2): point=[1, 1, 0]\nadd = list(map(int, input().split())) # (3): add=[3, 16]\n\ntotal = 0 # (4): total=0\nfor i in range(num): # (5): i=0 (7): i=1 ... (11): NO CHANGE\n total += point[index[i]-1] # (6): NO CHANGE (8): total=1 (10): total=2\n\nfor j in range(num-1): # (12): j=0 (14): j=1 (17): NO CHANGE\n if index[j+1] == index[j]+ 1: # (13): NO CHANGE (15): NO CHANGE\n total += add[j] # (16): total=18\n\nprint(total)"], "anno_status": [true], "diff_content": " num = int(input())\n index = list(map(int, input().split()))\n point = list(map(int, input().split()))\n add = list(map(int, input().split()))\n \n+\n total = 0\n for i in range(num):\n total += point[index[i]-1]\n \n for j in range(num-1):\n if index[j+1] == index[j]+ 1:\n- total += add[j]\n+ total += add[index[j]-1]\n \n print(total)\n", "FL_content": " num = int(input())\n index = list(map(int, input().split()))\n point = list(map(int, input().split()))\n add = list(map(int, input().split()))\n \n total = 0\n for i in range(num):\n total += point[index[i]-1]\n \n for j in range(num-1):\n if index[j+1] == index[j]+ 1:\n- total += add[j]\n \n print(total)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 14 }, { "user_id": "u757827098", "problem_id": "p02410", "submission1_id": "s681956776", "submission2_id": "s515347797", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m =[int(r) for r in input().split()]\n\nmatrix = []\nfor ni in range(n):\n matrix.append([int(a)for a in input().split()])\n\nvector = []\nfor mi in range(m):\n vector.append(int(input()))\n\nfor i in range(len(matrix)):\n\n sum = 0\n for j in range(len(matrix[i])):\n\n sum += matrix[i][j] * vector[j]", "code2": "n,m =[int(r) for r in input().split()]\n\nmatrix = []\nfor ni in range(n):\n matrix.append([int(a)for a in input().split()])\n\nvector = []\nfor mi in range(m):\n vector.append(int(input()))\n\nfor ni in range(n):\n\n sum = 0\n for mi in range(m):\n sum += matrix[ni][mi] * vector[mi]\n\n print(sum)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1470112853", "date2": "1470113014", "bleu_score": "0.8851677329098987", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 4\n0 7 -13 0\n0 0 0 1\n4 2 2 0\n1\n1\n3\n-1\n", "actual_output": "no output\n", "expected_output": "-32\n-1\n12\n\n", "anno_code": ["n,m =[int(r) for r in input().split()] # (0): n=3, m=4\n\nmatrix = [] # (1): matrix=[]\nfor ni in range(n): # (2): ni=0 (4): ni=1 ... (8): NO CHANGE\n matrix.append([int(a)for a in input().split()]) # (3): matrix=[[0, 7, -13, 0]] (5): matrix (7): matrix\n\nvector = [] # (9): vector=[]\nfor mi in range(m): # (10): mi=0 (12): mi=1 ... (18): NO CHANGE\n vector.append(int(input())) # (11): vector=[1] (13): vector=[1, 1] ... (17): vector=[1, 1, 3, -1]\n\nfor i in range(len(matrix)): # (19): i=0 (30): i=1 (41): i=2\n\n sum = 0 # (20): sum=0 (31): sum=0 (42): sum=0\n for j in range(len(matrix[i])): # (21): j=0 (23): j=1 ... (51): NO CHANGE\n\n sum += matrix[i][j] * vector[j] # (22): NO CHANGE (24): sum=7 ... (50): NO CHANGE\n"], "anno_status": [true], "diff_content": " n,m =[int(r) for r in input().split()]\n \n matrix = []\n for ni in range(n):\n matrix.append([int(a)for a in input().split()])\n \n vector = []\n for mi in range(m):\n vector.append(int(input()))\n \n-for i in range(len(matrix)):\n+for ni in range(n):\n \n sum = 0\n- for j in range(len(matrix[i])):\n+ for mi in range(m):\n+ sum += matrix[ni][mi] * vector[mi]\n \n- sum += matrix[i][j] * vector[j]\n+ print(sum)\n", "FL_content": " n,m =[int(r) for r in input().split()]\n \n matrix = []\n for ni in range(n):\n matrix.append([int(a)for a in input().split()])\n \n vector = []\n for mi in range(m):\n vector.append(int(input()))\n \n-for i in range(len(matrix)):\n \n sum = 0\n- for j in range(len(matrix[i])):\n \n- sum += matrix[i][j] * vector[j]\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 16 }, { "user_id": "u104931506", "problem_id": "p02410", "submission1_id": "s034132855", "submission2_id": "s616395618", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = list(map(int, input().split()))\nA = [[0 for w in range(m)] for h in range(n)]\nB = [0 for h in range(m)]\nfor i in range(n):\n A[i] = list(map(int, input().split()))\nfor i in range(m):\n B[i] = int(input())\n\nfor i in range(n):\n c = 0\n for j in range(m):\n c += A[i][j] * B[j]\nprint(c)", "code2": "n, m = list(map(int, input().split()))\nA = [[0 for w in range(m)] for h in range(n)]\nB = [0 for h in range(m)]\nfor i in range(n):\n A[i] = list(map(int, input().split()))\nfor i in range(m):\n B[i] = int(input())\n\nfor i in range(n):\n c = 0\n for j in range(m):\n c += A[i][j] * B[j]\n print(c)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1464638935", "date2": "1464638944", "bleu_score": "0.9820933910095244", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 4\n1 4 -2 1\n0 3 0 -1\n4 1 0 0\n0\n-2\n3\n0\n", "actual_output": "-2\n", "expected_output": "-14\n-6\n-2\n\n", "anno_code": ["n, m = list(map(int, input().split())) # (0): n=3, m=4\nA = [[0 for w in range(m)] for h in range(n)] # (1): A\nB = [0 for h in range(m)] # (2): B=[0, 0, 0, 0]\nfor i in range(n): # (3): i=0 (5): i=1 ... (9): NO CHANGE\n A[i] = list(map(int, input().split())) # (4): A=[[1, 4, -2, 1], [0, 0, 0, 0], [0, 0, 0, 0]] (6): A (8): A\nfor i in range(m): # (10): i=0 (12): i=1 ... (18): NO CHANGE\n B[i] = int(input()) # (11): NO CHANGE (13): B=[0, -2, 0, 0] ... (17): NO CHANGE\n\nfor i in range(n): # (19): i=0 (30): i=1 ... (52): NO CHANGE\n c = 0 # (20): c=0 (31): c=0 (42): c=0\n for j in range(m): # (21): j=0 (23): j=1 ... (51): NO CHANGE\n c += A[i][j] * B[j] # (22): NO CHANGE (24): c=-8 ... (50): NO CHANGE\nprint(c)"], "anno_status": [true], "diff_content": " n, m = list(map(int, input().split()))\n A = [[0 for w in range(m)] for h in range(n)]\n B = [0 for h in range(m)]\n for i in range(n):\n A[i] = list(map(int, input().split()))\n for i in range(m):\n B[i] = int(input())\n \n for i in range(n):\n c = 0\n for j in range(m):\n c += A[i][j] * B[j]\n-print(c)\n+ print(c)\n", "FL_content": " n, m = list(map(int, input().split()))\n A = [[0 for w in range(m)] for h in range(n)]\n B = [0 for h in range(m)]\n for i in range(n):\n A[i] = list(map(int, input().split()))\n for i in range(m):\n B[i] = int(input())\n \n for i in range(n):\n c = 0\n for j in range(m):\n c += A[i][j] * B[j]\n-print(c)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u510829608", "problem_id": "p02410", "submission1_id": "s305059089", "submission2_id": "s972809458", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = []; b = []; c = []\nn, m = map(int, input().split())\n\nfor i in range(n):\n\trow = map(int, input().split())\n\ta.append(list(row))\n\nfor j in range(m):\n\tcol = int(input())\n\tb.append(col)\n\nfor k in range(n):\n\ttemp = 0\n\tfor l in range(m):\n\t\ttemp += a[k][l] * b[l] \n\tc.append(temp)\n\nprint(c)", "code2": "a = []; b = []; c = []\nn, m = map(int, input().split())\n\nfor i in range(n):\n\trow = map(int, input().split())\n\ta.append(list(row))\n\nfor j in range(m):\n\tcol = int(input())\n\tb.append(col)\n\nfor k in range(n):\n\ttemp = 0\n\tfor l in range(m):\n\t\ttemp += a[k][l] * b[l] \n\tc.append(temp)\n\nfor ind in range(n):\n\tprint(c[ind])", "original_language1": "Python3", "original_language2": "Python3", "date1": "1470112881", "date2": "1470113083", "bleu_score": "0.9060673779578519", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 4\n1 4 -2 1\n0 3 0 1\n4 2 1 0\n1\n1\n3\n-1\n", "actual_output": "[-2, 2, 9]\n", "expected_output": "-2\n2\n9\n\n", "anno_code": ["a = []; b = []; c = [] # (0): a=[], b=[], c=[]\nn, m = map(int, input().split()) # (1): n=3, m=4\n\nfor i in range(n): # (2): i=0 (5): i=1 ... (11): NO CHANGE\n\trow = map(int, input().split()) # (3): row= (6): row= (9): row=\n\ta.append(list(row)) # (4): a=[[1, 4, -2, 1]] (7): a (10): a\n\nfor j in range(m): # (12): j=0 (15): j=1 ... (24): NO CHANGE\n\tcol = int(input()) # (13): col=1 (16): NO CHANGE ... (22): col=-1\n\tb.append(col) # (14): b=[1] (17): b=[1, 1] ... (23): b=[1, 1, 3, -1]\n\nfor k in range(n): # (25): k=0 (37): k=1 ... (61): NO CHANGE\n\ttemp = 0 # (26): temp=0 (38): temp=0 (50): temp=0\n\tfor l in range(m): # (27): l=0 (29): l=1 ... (59): NO CHANGE\n\t\ttemp += a[k][l] * b[l] # (28): temp=1 (30): temp=5 ... (58): NO CHANGE\n\tc.append(temp) # (36): c=[-2] (48): c=[-2, 2] (60): c=[-2, 2, 9]\n\nprint(c)"], "anno_status": [true], "diff_content": " a = []; b = []; c = []\n n, m = map(int, input().split())\n \n for i in range(n):\n \trow = map(int, input().split())\n \ta.append(list(row))\n \n for j in range(m):\n \tcol = int(input())\n \tb.append(col)\n \n for k in range(n):\n \ttemp = 0\n \tfor l in range(m):\n \t\ttemp += a[k][l] * b[l] \n \tc.append(temp)\n \n-print(c)\n+for ind in range(n):\n+\tprint(c[ind])\n", "FL_content": " a = []; b = []; c = []\n n, m = map(int, input().split())\n \n for i in range(n):\n \trow = map(int, input().split())\n \ta.append(list(row))\n \n for j in range(m):\n \tcol = int(input())\n \tb.append(col)\n \n for k in range(n):\n \ttemp = 0\n \tfor l in range(m):\n \t\ttemp += a[k][l] * b[l] \n \tc.append(temp)\n \n-print(c)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u027874809", "problem_id": "p02410", "submission1_id": "s288482567", "submission2_id": "s392509213", "status1": "Wrong Answer", "status2": "Accepted", "code1": "vec1 = []\nvec2 = []\n\nn, m = map(int, input().split())\nfor x in range(1, n+1):\n vec1.append(list(map(int, input().split())))\n\nfor y in range(m):\n vec2.append(int(input()))\n\nfor j, z in zip(vec1, vec2):\n print(sum(j)+z)\n\n", "code2": "vec1 = []\nvec2 = []\n\nn, m = map(int, input().split())\nfor x in range(1, n+1):\n vec1.append(list(map(int, input().split())))\n\nfor y in range(m):\n vec2.append(int(input()))\n\nfor j in vec1:\n result = 0\n for w, z in zip(j, vec2):\n result += w * z\n print(result)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1522376291", "date2": "1522378419", "bleu_score": "0.7678749400261176", "code1_test_status": [0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 3, "total_score": 101, "input": "3 4\n0 1 0 1\n1 0 0 2\n8 1 1 0\n1\n2\n0\n0\n", "actual_output": "3\n5\n10\n", "expected_output": "2\n1\n10\n\n", "anno_code": ["vec1 = [] # (0): vec1=[]\nvec2 = [] # (1): vec2=[]\n\nn, m = map(int, input().split()) # (2): n=3, m=4\nfor x in range(1, n+1): # (3): x=1 (5): x=2 ... (9): NO CHANGE\n vec1.append(list(map(int, input().split()))) # (4): vec1=[[0, 1, 0, 1]] (6): vec1 (8): vec1\n\nfor y in range(m): # (10): y=0 (12): y=1 ... (18): NO CHANGE\n vec2.append(int(input())) # (11): vec2=[1] (13): vec2=[1, 2] ... (17): vec2=[1, 2, 0, 0]\n\nfor j, z in zip(vec1, vec2): # (19): j=[0, 1, 0, 1], z=1 (21): j=[1, 0, 0, 2], z=2 (23): j=[8, 1, 1, 0], z=0\n print(sum(j)+z) # (20): NO CHANGE (22): NO CHANGE (24): NO CHANGE\n\n"], "anno_status": [true], "diff_content": " vec1 = []\n vec2 = []\n \n n, m = map(int, input().split())\n for x in range(1, n+1):\n vec1.append(list(map(int, input().split())))\n \n for y in range(m):\n vec2.append(int(input()))\n \n-for j, z in zip(vec1, vec2):\n- print(sum(j)+z)\n+for j in vec1:\n+ result = 0\n+ for w, z in zip(j, vec2):\n+ result += w * z\n+ print(result)\n \n \n", "FL_content": " vec1 = []\n vec2 = []\n \n n, m = map(int, input().split())\n for x in range(1, n+1):\n vec1.append(list(map(int, input().split())))\n \n for y in range(m):\n vec2.append(int(input()))\n \n-for j, z in zip(vec1, vec2):\n- print(sum(j)+z)\n \n \n", "added_lines": 5, "removed_lines": 2, "code1_lines": 14 }, { "user_id": "u610816226", "problem_id": "p02410", "submission1_id": "s033768142", "submission2_id": "s630286297", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\nn_l = []\nans = [0, 0, 0]\n\nfor _ in range(n):\n l = list(map(int, input().split()))\n n_l.append(l)\nfor x in range(m):\n p = int(input())\n n_l[:0] *= p\nfor i in n_l:\n print(sum(i))\n", "code2": "n, m = map(int, input().split())\nn_l = []\nans = [0, 0, 0]\n\nfor _ in range(n):\n l = list(map(int, input().split()))\n n_l.append(l)\nfor x in range(m):\n p = int(input())\n for o in range(n):\n n_l[o][x] *= p\nfor i in n_l:\n print(sum(i))\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556868788", "date2": "1556870831", "bleu_score": "0.8722257626902015", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 4\n1 4 0 1\n0 3 1 2\n4 1 1 0\n0\n-1\n3\n-1\n", "actual_output": "6\n6\n6\n", "expected_output": "-5\n-2\n2\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=3, m=4\nn_l = [] # (1): n_l=[]\nans = [0, 0, 0] # (2): ans=[0, 0, 0]\n\nfor _ in range(n): # (3): _=0 (6): _=1 ... (12): NO CHANGE\n l = list(map(int, input().split())) # (4): l=[1, 4, 0, 1] (7): l=[0, 3, 1, 2] (10): l=[4, 1, 1, 0]\n n_l.append(l) # (5): n_l=[[1, 4, 0, 1]] (8): n_l (11): n_l\nfor x in range(m): # (13): x=0 (16): x=1 ... (25): NO CHANGE\n p = int(input()) # (14): p=0 (17): p=-1 ... (23): p=-1\n n_l[:0] *= p # (15): NO CHANGE (18): NO CHANGE ... (24): NO CHANGE\nfor i in n_l: # (26): i=[1, 4, 0, 1] (28): i=[0, 3, 1, 2] (30): i=[4, 1, 1, 0]\n print(sum(i)) # (27): NO CHANGE (29): NO CHANGE (31): NO CHANGE\n"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n n_l = []\n ans = [0, 0, 0]\n \n for _ in range(n):\n l = list(map(int, input().split()))\n n_l.append(l)\n for x in range(m):\n p = int(input())\n- n_l[:0] *= p\n+ for o in range(n):\n+ n_l[o][x] *= p\n for i in n_l:\n print(sum(i))\n \n", "FL_content": " n, m = map(int, input().split())\n n_l = []\n ans = [0, 0, 0]\n \n for _ in range(n):\n l = list(map(int, input().split()))\n n_l.append(l)\n for x in range(m):\n p = int(input())\n- n_l[:0] *= p\n for i in n_l:\n print(sum(i))\n \n", "added_lines": 2, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u606989659", "problem_id": "p02410", "submission1_id": "s009633858", "submission2_id": "s707862866", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m = map(int,input().split())\n\na_list = []\nb_list = []\nc_list = []\n\nfor a in range(n):\n a_list.append(list(map(int,input().split())))\n\nfor b in range(n):\n b_list.append(int(input()))\n\nfor c in range(n):\n c_list.append([])\n for d in range(m):\n c_list[c].append((a_list[c][d] * b_list[c]))\n\nc_list = list(map(sum,c_list))\n\nfor c in c_list:\n print(c)", "code2": "n,m = map(int,input().split())\n\na_list = []\nb_list = []\nc_list = []\n\nfor a in range(n):\n a_list.append(list(map(int,input().split())))\n\nfor b in range(m):\n b_list.append(int(input()))\n\nfor c in range(n):\n c_list.append([])\n for d in range(m):\n c_list[c].append((a_list[c][d] * b_list[d]))\n\nc_list = list(map(sum,c_list))\n\nfor c in c_list:\n print(c)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1492850415", "date2": "1492850937", "bleu_score": "0.986394023590951", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 4\n1 4 0 2\n0 3 0 1\n4 1 1 0\n1\n2\n12\n0\n", "actual_output": "7\n8\n72\n", "expected_output": "9\n6\n18\n\n", "anno_code": ["n,m = map(int,input().split()) # (0): n=3, m=4\n\na_list = [] # (1): a_list=[]\nb_list = [] # (2): b_list=[]\nc_list = [] # (3): c_list=[]\n\nfor a in range(n): # (4): a=0 (6): a=1 ... (10): NO CHANGE\n a_list.append(list(map(int,input().split()))) # (5): a_list=[[1, 4, 0, 2]] (7): a_list (9): a_list\n\nfor b in range(n): # (11): b=0 (13): b=1 ... (17): NO CHANGE\n b_list.append(int(input())) # (12): b_list=[1] (14): b_list=[1, 2] (16): b_list=[1, 2, 12]\n\nfor c in range(n): # (18): c=0 (29): c=1 ... (51): NO CHANGE\n c_list.append([]) # (19): c_list=[[]] (30): c_list (41): c_list\n for d in range(m): # (20): d=0 (22): d=1 ... (50): NO CHANGE\n c_list[c].append((a_list[c][d] * b_list[c])) # (21): c_list (23): c_list ... (49): c_list\n\nc_list = list(map(sum,c_list)) # (52): c_list=[7, 8, 72]\n\nfor c in c_list: # (53): c=7 (55): c=8 (57): c=72\n print(c) # (54): NO CHANGE (56): NO CHANGE (58): NO CHANGE\n"], "anno_status": [true], "diff_content": " n,m = map(int,input().split())\n \n a_list = []\n b_list = []\n c_list = []\n \n for a in range(n):\n a_list.append(list(map(int,input().split())))\n \n-for b in range(n):\n+for b in range(m):\n b_list.append(int(input()))\n \n for c in range(n):\n c_list.append([])\n for d in range(m):\n- c_list[c].append((a_list[c][d] * b_list[c]))\n+ c_list[c].append((a_list[c][d] * b_list[d]))\n \n c_list = list(map(sum,c_list))\n \n for c in c_list:\n print(c)\n", "FL_content": " n,m = map(int,input().split())\n \n a_list = []\n b_list = []\n c_list = []\n \n for a in range(n):\n a_list.append(list(map(int,input().split())))\n \n-for b in range(n):\n b_list.append(int(input()))\n \n for c in range(n):\n c_list.append([])\n for d in range(m):\n- c_list[c].append((a_list[c][d] * b_list[c]))\n \n c_list = list(map(sum,c_list))\n \n for c in c_list:\n print(c)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 21 }, { "user_id": "u610816226", "problem_id": "p02410", "submission1_id": "s727161014", "submission2_id": "s630286297", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\nn_l = []\nans = [0, 0, 0]\n\nfor _ in range(n):\n l = list(map(int, input().split()))\n n_l.append(l)\nfor x in range(m):\n p = int(input())\n for o in range(n):\n n_l[o] *= p\nfor i in n_l:\n print(sum(i))\n", "code2": "n, m = map(int, input().split())\nn_l = []\nans = [0, 0, 0]\n\nfor _ in range(n):\n l = list(map(int, input().split()))\n n_l.append(l)\nfor x in range(m):\n p = int(input())\n for o in range(n):\n n_l[o][x] *= p\nfor i in n_l:\n print(sum(i))\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556870607", "date2": "1556870831", "bleu_score": "0.9851287744977599", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 4\n1 1 0 1\n0 3 1 1\n0 0 1 -1\n1\n2\n0\n0\n", "actual_output": "0\n0\n0\n", "expected_output": "3\n6\n0\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=3, m=4\nn_l = [] # (1): n_l=[]\nans = [0, 0, 0] # (2): ans=[0, 0, 0]\n\nfor _ in range(n): # (3): _=0 (6): _=1 ... (12): NO CHANGE\n l = list(map(int, input().split())) # (4): l=[1, 1, 0, 1] (7): l=[0, 3, 1, 1] (10): l=[0, 0, 1, -1]\n n_l.append(l) # (5): n_l=[[1, 1, 0, 1]] (8): n_l (11): n_l\nfor x in range(m): # (13): x=0 (22): x=1 ... (49): NO CHANGE\n p = int(input()) # (14): p=1 (23): p=2 ... (41): NO CHANGE\n for o in range(n): # (15): o=0 (17): o=1 ... (48): NO CHANGE\n n_l[o] *= p # (16): NO CHANGE (18): NO CHANGE ... (47): NO CHANGE\nfor i in n_l: # (50): i=[] (52): NO CHANGE (54): NO CHANGE\n print(sum(i)) # (51): NO CHANGE (53): NO CHANGE (55): NO CHANGE\n"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n n_l = []\n ans = [0, 0, 0]\n \n for _ in range(n):\n l = list(map(int, input().split()))\n n_l.append(l)\n for x in range(m):\n p = int(input())\n for o in range(n):\n- n_l[o] *= p\n+ n_l[o][x] *= p\n for i in n_l:\n print(sum(i))\n \n", "FL_content": " n, m = map(int, input().split())\n n_l = []\n ans = [0, 0, 0]\n \n for _ in range(n):\n l = list(map(int, input().split()))\n n_l.append(l)\n for x in range(m):\n p = int(input())\n for o in range(n):\n- n_l[o] *= p\n for i in n_l:\n print(sum(i))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 14 }, { "user_id": "u088372268", "problem_id": "p02410", "submission1_id": "s307431150", "submission2_id": "s273130919", "status1": "Wrong Answer", "status2": "Accepted", "code1": "data = list(map(int, list(input().split())))\nrow = data[0]\ncolumn = data[1]\nmatrix = [[0 for i in range(column)] for j in range(row)]\nvector = [[0] for k in range(column)]\nvector_multi = [[0] for l in range(row)]\n\nfor i in range(row):\n data_row = list(map(int, list(input().split())))\n print(data_row)\n for j in range(column):\n matrix[i][j] = data_row[j]\n\nfor i in range(column):\n vector[i] = int(input())\n\nfor i in range(row): \n element = 0\n for j in range(column):\n element += matrix[i][j] * vector[j]\n vector_multi[i][0] = element\n\nfor i in vector_multi:\n print(i[0])\n\n", "code2": "data = list(map(int, list(input().split())))\nrow = data[0]\ncolumn = data[1]\nmatrix = [[0 for i in range(column)] for j in range(row)]\nvector = [[0] for k in range(column)]\nvector_multi = [[0] for l in range(row)]\n\nfor i in range(row):\n data_row = list(map(int, list(input().split())))\n for j in range(column):\n matrix[i][j] = data_row[j]\n\nfor i in range(column):\n vector[i] = int(input())\n\nfor i in range(row): \n element = 0\n for j in range(column):\n element += matrix[i][j] * vector[j]\n vector_multi[i][0] = element\n\nfor i in vector_multi:\n print(i[0])\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1514987255", "date2": "1514987942", "bleu_score": "0.9666698050429988", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 4\n-1 4 0 1\n0 0 0 6\n8 0 1 -1\n1\n2\n0\n-1\n", "actual_output": "[-1, 4, 0, 1]\n[0, 0, 0, 6]\n[8, 0, 1, -1]\n6\n-6\n9\n", "expected_output": "6\n-6\n9\n\n", "anno_code": ["data = list(map(int, list(input().split()))) # (0): data=[3, 4]\nrow = data[0] # (1): row=3\ncolumn = data[1] # (2): column=4\nmatrix = [[0 for i in range(column)] for j in range(row)] # (3): matrix\nvector = [[0] for k in range(column)] # (4): vector\nvector_multi = [[0] for l in range(row)] # (5): vector_multi\n\nfor i in range(row): # (6): i=0 (18): i=1 ... (42): NO CHANGE\n data_row = list(map(int, list(input().split()))) # (7): data_row=[-1, 4, 0, 1] (19): data_row=[0, 0, 0, 6] (31): data_row=[8, 0, 1, -1]\n print(data_row) # (8): NO CHANGE (20): NO CHANGE (32): NO CHANGE\n for j in range(column): # (9): j=0 (11): j=1 ... (41): NO CHANGE\n matrix[i][j] = data_row[j] # (10): matrix (12): matrix ... (40): matrix\n\nfor i in range(column): # (43): i=0 (45): vector=[1, [0], [0], [0]], i=1 ... (51): NO CHANGE\n vector[i] = int(input()) # (44): vector=[1, [0], [0], [0]] (46): vector=[1, 2, [0], [0]] ... (50): vector=[1, 2, 0, -1]\n\nfor i in range(row): # (52): i=0 (64): i=1 ... (88): NO CHANGE\n element = 0 # (53): element=0 (65): element=0 (77): element=0\n for j in range(column): # (54): j=0 (56): j=1 ... (86): NO CHANGE\n element += matrix[i][j] * vector[j] # (55): element=-1 (57): element=7 ... (85): element=9\n vector_multi[i][0] = element # (63): vector_multi=[[6], [0], [0]] (75): vector_multi (87): vector_multi\n\nfor i in vector_multi: # (89): i=[6] (91): i=[-6] (93): i=[9]\n print(i[0]) # (90): NO CHANGE (92): NO CHANGE (94): NO CHANGE\n\n"], "anno_status": [true], "diff_content": " data = list(map(int, list(input().split())))\n row = data[0]\n column = data[1]\n matrix = [[0 for i in range(column)] for j in range(row)]\n vector = [[0] for k in range(column)]\n vector_multi = [[0] for l in range(row)]\n \n for i in range(row):\n data_row = list(map(int, list(input().split())))\n- print(data_row)\n for j in range(column):\n matrix[i][j] = data_row[j]\n \n for i in range(column):\n vector[i] = int(input())\n \n for i in range(row): \n element = 0\n for j in range(column):\n element += matrix[i][j] * vector[j]\n vector_multi[i][0] = element\n \n for i in vector_multi:\n print(i[0])\n \n \n", "FL_content": " data = list(map(int, list(input().split())))\n row = data[0]\n column = data[1]\n matrix = [[0 for i in range(column)] for j in range(row)]\n vector = [[0] for k in range(column)]\n vector_multi = [[0] for l in range(row)]\n \n for i in range(row):\n data_row = list(map(int, list(input().split())))\n- print(data_row)\n for j in range(column):\n matrix[i][j] = data_row[j]\n \n for i in range(column):\n vector[i] = int(input())\n \n for i in range(row): \n element = 0\n for j in range(column):\n element += matrix[i][j] * vector[j]\n vector_multi[i][0] = element\n \n for i in vector_multi:\n print(i[0])\n \n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 26 }, { "user_id": "u756468156", "problem_id": "p02410", "submission1_id": "s371777798", "submission2_id": "s503588176", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\nA = [list(map(int, input().split())) for _ in range(n)]\nb= [int(input()) for _ in range(m)]\nc = []\n\nfor i in range(n):\n bi = b[i]\n for y in A[i]:\n bi += y\n c.append(bi)\n\nprint(*[ci for ci in c], sep = \"\\n\")", "code2": "n, m = map(int, input().split())\nA = [list(map(int, input().split())) for _ in range(n)]\nb= [int(input()) for _ in range(m)]\nc = []\n\nfor x in range(n):\n ci = 0\n for y in range(m):\n ci += A[x][y] * b[y]\n c.append(ci)\n\nprint(*[ci for ci in c], sep = \"\\n\")", "original_language1": "Python3", "original_language2": "Python3", "date1": "1467101859", "date2": "1467102241", "bleu_score": "0.8737742023820458", "code1_test_status": [0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 3, "total_score": 101, "input": "3 4\n1 4 0 1\n0 3 0 1\n4 1 1 0\n1\n3\n3\n0\n", "actual_output": "7\n7\n9\n", "expected_output": "13\n9\n10\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=3, m=4\nA = [list(map(int, input().split())) for _ in range(n)] # (1): A\nb= [int(input()) for _ in range(m)] # (2): b=[1, 3, 3, 0]\nc = [] # (3): c=[]\n\nfor i in range(n): # (4): i=0 (16): i=1 ... (40): NO CHANGE\n bi = b[i] # (5): bi=1 (17): bi=3 (29): bi=3\n for y in A[i]: # (6): y=1 (8): y=4 ... (38): NO CHANGE\n bi += y # (7): bi=2 (9): bi=6 ... (37): NO CHANGE\n c.append(bi) # (15): c=[7] (27): c=[7, 7] (39): c=[7, 7, 9]\n\nprint(*[ci for ci in c], sep = \"\\n\")"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n A = [list(map(int, input().split())) for _ in range(n)]\n b= [int(input()) for _ in range(m)]\n c = []\n \n-for i in range(n):\n- bi = b[i]\n- for y in A[i]:\n- bi += y\n- c.append(bi)\n+for x in range(n):\n+ ci = 0\n+ for y in range(m):\n+ ci += A[x][y] * b[y]\n+ c.append(ci)\n \n print(*[ci for ci in c], sep = \"\\n\")\n", "FL_content": " n, m = map(int, input().split())\n A = [list(map(int, input().split())) for _ in range(n)]\n b= [int(input()) for _ in range(m)]\n c = []\n \n-for i in range(n):\n- bi = b[i]\n- for y in A[i]:\n- bi += y\n- c.append(bi)\n \n print(*[ci for ci in c], sep = \"\\n\")\n", "added_lines": 5, "removed_lines": 5, "code1_lines": 12 }, { "user_id": "u400765446", "problem_id": "p02410", "submission1_id": "s595442826", "submission2_id": "s625587857", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n\n m, n = tuple(map(int, input().split()))\n a = [[0 for j in range(n)] for i in range(m)]\n b = [0 for j in range(n)]\n c = [0 for i in range(m)]\n\n for i in range(m):\n tmplst = list(map(int, input().split()))\n for j in range(n):\n a[i][j] = tmplst[j]\n\n for j in range(n):\n b[j] = int(input())\n\n for i in range(m):\n for j in range(n):\n c[i] += a[i][j] * b[j]\n print(c[i])\n\n\n\nif __name__ == '__main__':\n main()\n", "code2": "def main():\n\n m, n = tuple(map(int, input().split()))\n a = [[0 for j in range(n)] for i in range(m)]\n b = [0 for j in range(n)]\n c = [0 for i in range(m)]\n\n for i in range(m):\n tmplst = list(map(int, input().split()))\n for j in range(n):\n a[i][j] = tmplst[j]\n\n for j in range(n):\n b[j] = int(input())\n\n for i in range(m):\n for j in range(n):\n c[i] += a[i][j] * b[j]\n print(c[i])\n\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1530886806", "date2": "1530886850", "bleu_score": "0.9920000428377432", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 4\n1 2 0 1\n0 3 0 1\n4 1 1 0\n1\n2\n3\n0\n", "actual_output": "1\n5\n5\n5\n0\n6\n6\n6\n4\n6\n9\n9\n", "expected_output": "5\n6\n9\n", "anno_code": ["def main(): # (0): main=\n\n m, n = tuple(map(int, input().split()))\n a = [[0 for j in range(n)] for i in range(m)]\n b = [0 for j in range(n)]\n c = [0 for i in range(m)]\n\n for i in range(m):\n tmplst = list(map(int, input().split()))\n for j in range(n):\n a[i][j] = tmplst[j]\n\n for j in range(n):\n b[j] = int(input())\n\n for i in range(m):\n for j in range(n):\n c[i] += a[i][j] * b[j]\n print(c[i])\n\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " def main():\n \n m, n = tuple(map(int, input().split()))\n a = [[0 for j in range(n)] for i in range(m)]\n b = [0 for j in range(n)]\n c = [0 for i in range(m)]\n \n for i in range(m):\n tmplst = list(map(int, input().split()))\n for j in range(n):\n a[i][j] = tmplst[j]\n \n for j in range(n):\n b[j] = int(input())\n \n for i in range(m):\n for j in range(n):\n c[i] += a[i][j] * b[j]\n- print(c[i])\n+ print(c[i])\n \n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " def main():\n \n m, n = tuple(map(int, input().split()))\n a = [[0 for j in range(n)] for i in range(m)]\n b = [0 for j in range(n)]\n c = [0 for i in range(m)]\n \n for i in range(m):\n tmplst = list(map(int, input().split()))\n for j in range(n):\n a[i][j] = tmplst[j]\n \n for j in range(n):\n b[j] = int(input())\n \n for i in range(m):\n for j in range(n):\n c[i] += a[i][j] * b[j]\n- print(c[i])\n \n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 25 }, { "user_id": "u797673668", "problem_id": "p00687", "submission1_id": "s907080031", "submission2_id": "s252178819", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n n, a, b = map(int, input().split())\n if not n:\n break\n dp = [False] * (n + abs(a - b))\n dp[1:n + 1] = [True] * n\n for i in range(n - min(a, b)):\n if not dp[i]:\n dp[i + a] = False\n dp[i + b] = False\n print(dp.count(True))", "code2": "while True:\n n, a, b = map(int, input().split())\n if not n:\n break\n if a > b:\n a, b = b, a\n dp = [False] * (n + b - a + 1)\n dp[1:n + 1] = [True] * n\n for i in range(n - a + 1):\n if not dp[i]:\n dp[i + a] = False\n dp[i + b] = False\n print(dp.count(True))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1488451548", "date2": "1488451897", "bleu_score": "0.8565783029605176", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1], "code1_test_score": 65, "total_score": 101, "input": "10 2 3\n28 3 5\n100 10 48\n0 0 0\n", "actual_output": "1\n4\n84\n", "expected_output": "1\n4\n83\n\n", "anno_code": ["while True: # (0): NO CHANGE (37): NO CHANGE ... (351): NO CHANGE\n n, a, b = map(int, input().split()) # (1): n=10, a=2, b=3 (38): n=28, a=3, b=5 ... (352): n=0, a=0, b=0\n if not n: # (2): NO CHANGE (39): NO CHANGE ... (353): NO CHANGE\n break\n dp = [False] * (n + abs(a - b)) # (3): dp=[False, False, False, False, False, False, False, False, False, False, False] (40): dp=[False, False, ..., False, False] (139): dp=[False, False, ..., False, False]\n dp[1:n + 1] = [True] * n # (4): dp=[False, True, True, True, True, True, True, True, True, True, True] (41): dp=[False, True, ..., True, False] (140): dp=[False, True, ..., False, False]\n for i in range(n - min(a, b)): # (5): i=0 (9): i=1 ... (349): NO CHANGE\n if not dp[i]: # (6): NO CHANGE (10): NO CHANGE ... (348): NO CHANGE\n dp[i + a] = False # (7): dp=[False, True, False, True, True, True, True, True, True, True, True] (13): dp=[False, True, False, False, False, True, True, True, True, True, True] ... (345): NO CHANGE\n dp[i + b] = False # (8): dp=[False, True, False, False, True, True, True, True, True, True, True] (14): dp=[False, True, False, False, False, False, True, True, True, True, True] ... (346): NO CHANGE\n print(dp.count(True)) # (36): NO CHANGE (135): NO CHANGE (350): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n n, a, b = map(int, input().split())\n if not n:\n break\n- dp = [False] * (n + abs(a - b))\n+ if a > b:\n+ a, b = b, a\n+ dp = [False] * (n + b - a + 1)\n dp[1:n + 1] = [True] * n\n- for i in range(n - min(a, b)):\n+ for i in range(n - a + 1):\n if not dp[i]:\n dp[i + a] = False\n dp[i + b] = False\n print(dp.count(True))\n", "FL_content": " while True:\n n, a, b = map(int, input().split())\n if not n:\n break\n- dp = [False] * (n + abs(a - b))\n dp[1:n + 1] = [True] * n\n- for i in range(n - min(a, b)):\n if not dp[i]:\n dp[i + a] = False\n dp[i + b] = False\n print(dp.count(True))\n", "added_lines": 4, "removed_lines": 2, "code1_lines": 11 }, { "user_id": "u506554532", "problem_id": "p00722", "submission1_id": "s189572657", "submission2_id": "s928588072", "status1": "Wrong Answer", "status2": "Accepted", "code1": "MAXN = 10**6\nsieve = [1 for i in range(MAXN+1)]\nn = 2\nwhile n*n <= MAXN:\n if sieve[n]:\n for i in range(2*n,MAXN+1,n):\n sieve[i] = 0\n n += 1\n\nwhile True:\n a,d,n = map(int,input().split())\n if n == 0: break\n cnt = 0\n for i in range(a,MAXN+1,d):\n if sieve[i]:\n cnt += 1\n if cnt == n:\n print(i)\n break", "code2": "MAXN = 10**6\nsieve = [0]*2 + [1]*MAXN\nn = 2\nwhile n*n <= MAXN:\n if sieve[n]:\n for i in range(2*n,MAXN+1,n):\n sieve[i] = 0\n n += 1\n\nwhile True:\n a,d,n = map(int,input().split())\n if n == 0: break\n cnt = 0\n for i in range(a,MAXN+1,d):\n if sieve[i]:\n cnt += 1\n if cnt == n:\n print(i)\n break", "original_language1": "Python3", "original_language2": "Python3", "date1": "1513068322", "date2": "1513068460", "bleu_score": "0.9427123898830535", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "367 186 151\n179 10 152\n271 37 39\n103 230 1\n27 104 185\n55 87 85\n1 1 1\n9075 337 210\n307 24 79\n331 346 345\n259 170 79\n37 58 102\n0 0 0\n", "actual_output": "92809\n4909\n12037\n103\n93523\n46861\n1\n899429\n5107\n725201\n48029\n24919\n", "expected_output": "92809\n4909\n12037\n103\n93523\n46861\n2\n899429\n5107\n725201\n48029\n24919\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " MAXN = 10**6\n-sieve = [1 for i in range(MAXN+1)]\n+sieve = [0]*2 + [1]*MAXN\n n = 2\n while n*n <= MAXN:\n if sieve[n]:\n for i in range(2*n,MAXN+1,n):\n sieve[i] = 0\n n += 1\n \n while True:\n a,d,n = map(int,input().split())\n if n == 0: break\n cnt = 0\n for i in range(a,MAXN+1,d):\n if sieve[i]:\n cnt += 1\n if cnt == n:\n print(i)\n break\n", "FL_content": " MAXN = 10**6\n-sieve = [1 for i in range(MAXN+1)]\n n = 2\n while n*n <= MAXN:\n if sieve[n]:\n for i in range(2*n,MAXN+1,n):\n sieve[i] = 0\n n += 1\n \n while True:\n a,d,n = map(int,input().split())\n if n == 0: break\n cnt = 0\n for i in range(a,MAXN+1,d):\n if sieve[i]:\n cnt += 1\n if cnt == n:\n print(i)\n break\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 19 }, { "user_id": "u026155812", "problem_id": "p03730", "submission1_id": "s751680384", "submission2_id": "s471526267", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = [int(i) for i in input().split()]\na = 0\n\nfor i in range(B):\n if (A*i)%B == C:\n a += 1\n print('YES')\nif a == 0:\n print('NO')", "code2": "A, B, C = [int(i) for i in input().split()]\n\nfor i in range(B):\n if (A*i)%B == C:\n print('YES')\n break\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1544297046", "date2": "1544297275", "bleu_score": "0.8356274393592087", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 81, "total_score": 92, "input": "338 13 0\n", "actual_output": "YES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\n", "expected_output": "YES\n\n", "anno_code": ["A, B, C = [int(i) for i in input().split()] # (0): A=338, B=13, C=0\na = 0 # (1): a=0\n\nfor i in range(B): # (2): i=0 (6): i=1 ... (54): NO CHANGE\n if (A*i)%B == C: # (3): NO CHANGE (7): NO CHANGE ... (51): NO CHANGE\n a += 1 # (4): a=1 (8): a=2 ... (52): a=13\n print('YES') # (5): NO CHANGE (9): NO CHANGE ... (53): NO CHANGE\nif a == 0:\n print('NO')"], "anno_status": [true], "diff_content": " A, B, C = [int(i) for i in input().split()]\n-a = 0\n \n for i in range(B):\n if (A*i)%B == C:\n- a += 1\n print('YES')\n-if a == 0:\n+ break\n+else:\n print('NO')\n", "FL_content": " A, B, C = [int(i) for i in input().split()]\n-a = 0\n \n for i in range(B):\n if (A*i)%B == C:\n- a += 1\n print('YES')\n-if a == 0:\n print('NO')\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 9 }, { "user_id": "u200887663", "problem_id": "p03730", "submission1_id": "s944910793", "submission2_id": "s283828367", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=map(int,input().split())\nst=\"NO\"\nfor i in range(a,b*a+1):\n if i%b==0:\n st=\"YES\"\n break\n\nprint(st)\n\n\n", "code2": "a,b,c=map(int,input().split())\nst=\"NO\"\nfor i in range(1,b+1):\n temp=i*a\n if temp % b ==c:\n st=\"YES\"\n break\n\nprint(st)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572925573", "date2": "1572926512", "bleu_score": "0.7911132239710585", "code1_test_status": [0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 74, "total_score": 92, "input": "33 42 5\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["a,b,c=map(int,input().split()) # (0): a=33, b=42, c=5\nst=\"NO\" # (1): st=NO\nfor i in range(a,b*a+1): # (2): i=33 (4): i=34 ... (20): i=42\n if i%b==0: # (3): NO CHANGE (5): NO CHANGE ... (21): NO CHANGE\n st=\"YES\" # (22): st=YES\n break # (23): NO CHANGE\n\nprint(st)\n\n\n"], "anno_status": [true], "diff_content": " a,b,c=map(int,input().split())\n st=\"NO\"\n-for i in range(a,b*a+1):\n- if i%b==0:\n+for i in range(1,b+1):\n+ temp=i*a\n+ if temp % b ==c:\n st=\"YES\"\n break\n \n print(st)\n \n-\n-\n", "FL_content": " a,b,c=map(int,input().split())\n st=\"NO\"\n-for i in range(a,b*a+1):\n- if i%b==0:\n st=\"YES\"\n break\n \n print(st)\n \n-\n-\n", "added_lines": 3, "removed_lines": 4, "code1_lines": 11 }, { "user_id": "u341926204", "problem_id": "p03730", "submission1_id": "s234306838", "submission2_id": "s046268974", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def b():\n a, b, c = map(int, input().split())\n i = 2\n while i <= c:\n if a*i % b == c:\n print('YES')\n break\n i += 1\n else: print('NO')\n\nb()", "code2": "def b():\n a, b, c = map(int, input().split())\n for i in range(2, 200):\n if a*i % b == c:\n print('YES')\n break\n else: print('NO')\n\nb()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1493519092", "date2": "1493519216", "bleu_score": "0.8060929289298935", "code1_test_status": [1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1], "code1_test_score": 37, "total_score": 92, "input": "38 13 0\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["def b(): # (0): b=\n a, b, c = map(int, input().split()) # (2): a=38, b=13, c=0\n i = 2 # (3): i=2\n while i <= c: # (4): NO CHANGE\n if a*i % b == c:\n print('YES')\n break\n i += 1\n else: print('NO')\n\nb() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " def b():\n a, b, c = map(int, input().split())\n- i = 2\n- while i <= c:\n+ for i in range(2, 200):\n if a*i % b == c:\n print('YES')\n break\n- i += 1\n else: print('NO')\n \n b()\n", "FL_content": " def b():\n a, b, c = map(int, input().split())\n- i = 2\n- while i <= c:\n if a*i % b == c:\n print('YES')\n break\n- i += 1\n else: print('NO')\n \n b()\n", "added_lines": 1, "removed_lines": 3, "code1_lines": 11 }, { "user_id": "u787059958", "problem_id": "p03730", "submission1_id": "s415187103", "submission2_id": "s906699957", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c = map(int, input().split())\nt = False\nfor i in range(1,b+1):\n if((a+i)%b==c):\n t=True\n break\n\nif(t):\n print('Yes')\nelse:\n print('No')", "code2": "a,b,c = map(int, input().split())\nt = False\nfor i in range(1,b+1):\n if((a*i)%b==c):\n t=True\n break\n\nif(t):\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565734299", "date2": "1565734488", "bleu_score": "0.9482701961140227", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 92, "input": "77 63 36\n", "actual_output": "Yes\n", "expected_output": "NO\n\n", "anno_code": ["a,b,c = map(int, input().split()) # (0): a=77, b=63, c=36\nt = False # (1): t=False\nfor i in range(1,b+1): # (2): i=1 (4): i=2 ... (44): i=22\n if((a+i)%b==c): # (3): NO CHANGE (5): NO CHANGE ... (45): NO CHANGE\n t=True # (46): t=True\n break # (47): NO CHANGE\n\nif(t): # (48): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " a,b,c = map(int, input().split())\n t = False\n for i in range(1,b+1):\n- if((a+i)%b==c):\n+ if((a*i)%b==c):\n t=True\n break\n \n if(t):\n- print('Yes')\n+ print('YES')\n else:\n- print('No')\n+ print('NO')\n", "FL_content": " a,b,c = map(int, input().split())\n t = False\n for i in range(1,b+1):\n- if((a+i)%b==c):\n t=True\n break\n \n if(t):\n- print('Yes')\n else:\n- print('No')\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 11 }, { "user_id": "u945181840", "problem_id": "p03730", "submission1_id": "s531838621", "submission2_id": "s825576532", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = map(int, input().split())\nr = set([])\n\ntemp = A % B\n\nwhile temp not in r:\n r.add(temp)\n temp = temp * A % B\n\nif C in r:\n print('YES')\nelse:\n print('NO')", "code2": "A, B, C = map(int, input().split())\nr = set([])\n\ntemp = A % B\n\nwhile temp not in r:\n r.add(temp)\n temp = (temp + A) % B\n\nif C in r:\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569633877", "date2": "1569633987", "bleu_score": "0.9581785063807154", "code1_test_status": [1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1], "code1_test_score": 48, "total_score": 92, "input": "14 9 0\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["A, B, C = map(int, input().split()) # (0): A=14, B=9, C=0\nr = set([]) # (1): r=set()\n\ntemp = A % B # (2): temp=5\n\nwhile temp not in r: # (3): NO CHANGE (6): NO CHANGE ... (21): NO CHANGE\n r.add(temp) # (4): r={5} (7): r={5, 7} ... (19): r={1, 2, 4, 5, 7, 8}\n temp = temp * A % B # (5): temp=7 (8): temp=8 ... (20): temp=5\n\nif C in r: # (22): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " A, B, C = map(int, input().split())\n r = set([])\n \n temp = A % B\n \n while temp not in r:\n r.add(temp)\n- temp = temp * A % B\n+ temp = (temp + A) % B\n \n if C in r:\n print('YES')\n else:\n print('NO')\n", "FL_content": " A, B, C = map(int, input().split())\n r = set([])\n \n temp = A % B\n \n while temp not in r:\n r.add(temp)\n- temp = temp * A % B\n \n if C in r:\n print('YES')\n else:\n print('NO')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u350093546", "problem_id": "p03730", "submission1_id": "s656550317", "submission2_id": "s062945141", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=map(int,input().split())\nx=0\nfor i in range(b):\n x+=a\n if a%b==c:\n print('YES')\n x='-1'\n break\nif x!='-1':\n print('NO')", "code2": "a,b,c=map(int,input().split())\nx=0\nfor i in range(b):\n x+=a\n if x%b==c:\n print('YES')\n x='-1'\n break\nif x!='-1':\n print('NO')", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1591611761", "date2": "1591612007", "bleu_score": "0.931506892120709", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 3, "total_score": 92, "input": "117 55 1\n", "actual_output": "no output\n", "expected_output": "YES\n\n", "anno_code": ["a,b,c=map(int,input().split()) # (0): a=117, b=55, c=1\nx=0 # (1): x=0\nfor i in range(b): # (2): i=0\n x+=a # (3): x=117\n if a%b==c: # (4): NO CHANGE\n print('YES')\n x='-1' # (5): x=-1\n break # (6): NO CHANGE\nif x!='-1':\n print('NO')"], "anno_status": [true], "diff_content": " a,b,c=map(int,input().split())\n x=0\n for i in range(b):\n x+=a\n- if a%b==c:\n+ if x%b==c:\n print('YES')\n- x='-1'\n- break\n+ x='-1'\n+ break\n if x!='-1':\n print('NO')\n", "FL_content": " a,b,c=map(int,input().split())\n x=0\n for i in range(b):\n x+=a\n- if a%b==c:\n print('YES')\n- x='-1'\n- break\n if x!='-1':\n print('NO')\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 10 }, { "user_id": "u109490423", "problem_id": "p03730", "submission1_id": "s179341163", "submission2_id": "s492645264", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=list(map(int,input().split()))\nflag=0\nfor itr in range(100000):\n if (a*itr)%b==c: \n print('NO')\n flag=1\n break\nif flag==0: print('YES')\n ", "code2": "a,b,c=list(map(int,input().split()))\nflag=0\nfor itr in range(1,100000):\n if (a*itr)%b==c: \n print('YES')\n flag=1\n break\nif flag==0: print('NO')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595558891", "date2": "1595559055", "bleu_score": "0.965830491859015", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 92, "input": "67 77 58\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["a,b,c=list(map(int,input().split())) # (0): a=67, b=77, c=58\nflag=0 # (1): flag=0\nfor itr in range(100000): # (2): itr=0 (4): itr=1 ... (52): itr=25\n if (a*itr)%b==c: # (3): NO CHANGE (5): NO CHANGE ... (53): NO CHANGE\n print('NO') # (54): NO CHANGE\n flag=1 # (55): flag=1\n break # (56): NO CHANGE\nif flag==0: print('YES')\n "], "anno_status": [true], "diff_content": " a,b,c=list(map(int,input().split()))\n flag=0\n-for itr in range(100000):\n+for itr in range(1,100000):\n if (a*itr)%b==c: \n- print('NO')\n+ print('YES')\n flag=1\n break\n-if flag==0: print('YES')\n- \n+if flag==0: print('NO')\n", "FL_content": " a,b,c=list(map(int,input().split()))\n flag=0\n-for itr in range(100000):\n if (a*itr)%b==c: \n- print('NO')\n flag=1\n break\n-if flag==0: print('YES')\n- \n", "added_lines": 3, "removed_lines": 4, "code1_lines": 9 }, { "user_id": "u721970149", "problem_id": "p03730", "submission1_id": "s276038000", "submission2_id": "s756371860", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = map(int,input().split())\n\nans = \"No\"\n\nfor i in range(1,B+1) :\n if (A*i)%B == C :\n ans = \"Yes\"\n\nprint(ans)\n", "code2": "A, B, C = map(int,input().split())\n\nans = \"NO\"\n\nfor i in range(1,B+1) :\n if (A*i)%B == C :\n ans = \"YES\"\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582403615", "date2": "1582403646", "bleu_score": "0.9514641493683826", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 92, "input": "1 010 2\n", "actual_output": "Yes\n", "expected_output": "YES\n\n", "anno_code": ["A, B, C = map(int,input().split()) # (0): A=1, B=10, C=2\n\nans = \"No\" # (1): ans=No\n\nfor i in range(1,B+1) : # (2): i=1 (4): i=2 ... (23): NO CHANGE\n if (A*i)%B == C : # (3): NO CHANGE (5): NO CHANGE ... (22): NO CHANGE\n ans = \"Yes\" # (6): ans=Yes\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " A, B, C = map(int,input().split())\n \n-ans = \"No\"\n+ans = \"NO\"\n \n for i in range(1,B+1) :\n if (A*i)%B == C :\n- ans = \"Yes\"\n+ ans = \"YES\"\n \n print(ans)\n \n", "FL_content": " A, B, C = map(int,input().split())\n \n-ans = \"No\"\n \n for i in range(1,B+1) :\n if (A*i)%B == C :\n- ans = \"Yes\"\n \n print(ans)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u511457539", "problem_id": "p03730", "submission1_id": "s942489677", "submission2_id": "s701510292", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = map(int, input().split())\n\nfor i in range(1000):\n if A*i%B == C:\n print(\"Yes\")\n exit()\n\nprint(\"No\")\n", "code2": "A, B, C = map(int, input().split())\n\nfor i in range(1000):\n if A*i%B == C:\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590628605", "date2": "1590628674", "bleu_score": "0.9518537708170803", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 92, "input": "153 42 0\n", "actual_output": "Yes\n", "expected_output": "YES\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " A, B, C = map(int, input().split())\n \n for i in range(1000):\n if A*i%B == C:\n- print(\"Yes\")\n+ print(\"YES\")\n exit()\n \n-print(\"No\")\n+print(\"NO\")\n \n", "FL_content": " A, B, C = map(int, input().split())\n \n for i in range(1000):\n if A*i%B == C:\n- print(\"Yes\")\n exit()\n \n-print(\"No\")\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u026155812", "problem_id": "p03730", "submission1_id": "s887101206", "submission2_id": "s471526267", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = [int(i) for i in input().split()]\na = 0\n\nfor i in range(B):\n if A*i%B == C:\n a += 1\n print('YES')\nif a == 0:\n print('NO')", "code2": "A, B, C = [int(i) for i in input().split()]\n\nfor i in range(B):\n if (A*i)%B == C:\n print('YES')\n break\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1544296943", "date2": "1544297275", "bleu_score": "0.8134678484881147", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 81, "total_score": 92, "input": "459 30 0\n", "actual_output": "YES\nYES\nYES\n", "expected_output": "YES\n\n", "anno_code": ["A, B, C = [int(i) for i in input().split()] # (0): A=459, B=30, C=0\na = 0 # (1): a=0\n\nfor i in range(B): # (2): i=0 (6): i=1 ... (68): NO CHANGE\n if A*i%B == C: # (3): NO CHANGE (7): NO CHANGE ... (67): NO CHANGE\n a += 1 # (4): a=1 (26): a=2 (48): a=3\n print('YES') # (5): NO CHANGE (27): NO CHANGE (49): NO CHANGE\nif a == 0:\n print('NO')"], "anno_status": [true], "diff_content": " A, B, C = [int(i) for i in input().split()]\n-a = 0\n \n for i in range(B):\n- if A*i%B == C:\n- a += 1\n+ if (A*i)%B == C:\n print('YES')\n-if a == 0:\n+ break\n+else:\n print('NO')\n", "FL_content": " A, B, C = [int(i) for i in input().split()]\n-a = 0\n \n for i in range(B):\n- if A*i%B == C:\n- a += 1\n print('YES')\n-if a == 0:\n print('NO')\n", "added_lines": 3, "removed_lines": 4, "code1_lines": 9 }, { "user_id": "u549579601", "problem_id": "p03523", "submission1_id": "s709175893", "submission2_id": "s759919964", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = 'AKIHABARA'\n\nimport itertools\n\nA = []\nfor i in range(1, len(list(s))+1):\n B = itertools.combinations(s, i)\n for j in B:\n A.append(\"\".join(j))\nif input() in A:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "s = 'AKIHABARA'\n\nimport itertools\n\nA = []\nfor i in range(1, len(list(s))+1):\n B = itertools.combinations(s, i)\n for j in B:\n string = \"\".join(j)\n if 'K' in string and 'I' in string and 'H' in string and 'B' in string and 'R' in string:\n A.append(string)\nif input() in A:\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586487036", "date2": "1586487212", "bleu_score": "0.6024347804804293", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "AAJIAHBA@RA\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["s = 'AKIHABARA' # (0): s=AKIHABARA, itertools=\n\nimport itertools\n\nA = [] # (1): A=[]\nfor i in range(1, len(list(s))+1): # (2): i=1 (23): i=2 ... (1051): NO CHANGE\n B = itertools.combinations(s, i) # (3): B= (24): B= ... (1047): B=\n for j in B: # (4): j=('A',) (6): j=('K',) ... (1050): NO CHANGE\n A.append(\"\".join(j)) # (5): A=['A'] (7): A=['A', 'K'] ... (1049): A=[A, K, ..., KIHABARA, AKIHABARA]\nif input() in A: # (1052): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " s = 'AKIHABARA'\n \n import itertools\n \n A = []\n for i in range(1, len(list(s))+1):\n B = itertools.combinations(s, i)\n for j in B:\n- A.append(\"\".join(j))\n+ string = \"\".join(j)\n+ if 'K' in string and 'I' in string and 'H' in string and 'B' in string and 'R' in string:\n+ A.append(string)\n if input() in A:\n- print(\"Yes\")\n+ print(\"YES\")\n else:\n- print(\"No\")\n+ print(\"NO\")\n", "FL_content": " s = 'AKIHABARA'\n \n import itertools\n \n A = []\n for i in range(1, len(list(s))+1):\n B = itertools.combinations(s, i)\n for j in B:\n- A.append(\"\".join(j))\n if input() in A:\n- print(\"Yes\")\n else:\n- print(\"No\")\n", "added_lines": 5, "removed_lines": 3, "code1_lines": 13 }, { "user_id": "u699089116", "problem_id": "p03523", "submission1_id": "s716449822", "submission2_id": "s116972158", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import re\ns = input()\n\npattern = r\"A?KIHA?BA?RA?\"\n\nprint(\"Yes\" if re.search(pattern, s) else \"No\")", "code2": "import re\ns = input()\n\npattern = r\"^A?KIHA?BA?RA?$\"\n\nprint(\"YES\" if re.search(pattern, s) else \"NO\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1584419512", "date2": "1584419732", "bleu_score": "0.8893224662479466", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "PBHIJ\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["import re\ns = input() # (0): s=PBHIJ\n\npattern = r\"A?KIHA?BA?RA?\" # (1): pattern=A?KIHA?BA?RA?\n\nprint(\"Yes\" if re.search(pattern, s) else \"No\")"], "anno_status": [true], "diff_content": " import re\n s = input()\n \n-pattern = r\"A?KIHA?BA?RA?\"\n+pattern = r\"^A?KIHA?BA?RA?$\"\n \n-print(\"Yes\" if re.search(pattern, s) else \"No\")\n+print(\"YES\" if re.search(pattern, s) else \"NO\")\n", "FL_content": " import re\n s = input()\n \n-pattern = r\"A?KIHA?BA?RA?\"\n \n-print(\"Yes\" if re.search(pattern, s) else \"No\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u126823513", "problem_id": "p03523", "submission1_id": "s791167387", "submission2_id": "s603102942", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\nif s.replace(\"A\", \"\") == 'AKIHABARA'.replace(\"A\", \"\"):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n", "code2": "import re\n\ns = input()\n\n\nif re.match('A?KIHA?BA?RA?$', s):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569721026", "date2": "1569721878", "bleu_score": "0.6034728463715504", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 101, "total_score": 102, "input": "AAKIAHBAARA\n", "actual_output": "YES\n", "expected_output": "NO\n", "anno_code": ["s = input() # (0): s=AAKIAHBAARA\n\nif s.replace(\"A\", \"\") == 'AKIHABARA'.replace(\"A\", \"\"): # (1): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n"], "anno_status": [true], "diff_content": "+import re\n+\n s = input()\n \n-if s.replace(\"A\", \"\") == 'AKIHABARA'.replace(\"A\", \"\"):\n+\n+if re.match('A?KIHA?BA?RA?$', s):\n print(\"YES\")\n else:\n print(\"NO\")\n \n \n \n", "FL_content": " s = input()\n \n-if s.replace(\"A\", \"\") == 'AKIHABARA'.replace(\"A\", \"\"):\n print(\"YES\")\n else:\n print(\"NO\")\n \n \n \n", "added_lines": 4, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u984529214", "problem_id": "p03523", "submission1_id": "s695871062", "submission2_id": "s867687911", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import re\nakb_re = re.compile(r'A?KIHA?BA?RA?$')\n\ns = input()\nmo = akb_re.match(s)\nif mo == None:\n print('No')\nelse:\n print('Yes')\n", "code2": "import re\nakb_re = re.compile(r'A?KIHA?BA?RA?$')\n\ns = input()\nmo = akb_re.match(s)\nif mo == None:\n print('NO')\nelse:\n print('YES')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591280849", "date2": "1591280892", "bleu_score": "0.9540661273198089", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "IAB@@BHJQ\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["import re\nakb_re = re.compile(r'A?KIHA?BA?RA?$') # (0): akb_re=re.compile('A?KIHA?BA?RA?$')\n\ns = input() # (1): s=IAB@@BHJQ\nmo = akb_re.match(s) # (2): mo=None\nif mo == None: # (3): NO CHANGE\n print('No')\nelse:\n print('Yes')\n"], "anno_status": [true], "diff_content": " import re\n akb_re = re.compile(r'A?KIHA?BA?RA?$')\n \n s = input()\n mo = akb_re.match(s)\n if mo == None:\n- print('No')\n+ print('NO')\n else:\n- print('Yes')\n+ print('YES')\n \n", "FL_content": " import re\n akb_re = re.compile(r'A?KIHA?BA?RA?$')\n \n s = input()\n mo = akb_re.match(s)\n if mo == None:\n- print('No')\n else:\n- print('Yes')\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u201660334", "problem_id": "p03523", "submission1_id": "s748584472", "submission2_id": "s329060952", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import re\n\ns = input()\nregex = re.compile(r\"A?KIHA?BA?RA?\")\nif regex.match(s):\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "import re\n\ns = input()\nregex = re.compile(r\"A?KIHA?BA?RA?\")\nif regex.fullmatch(s):\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597392594", "date2": "1597393061", "bleu_score": "0.9052348398866766", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "PIKBH\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["import re\n\ns = input() # (0): s=PIKBH\nregex = re.compile(r\"A?KIHA?BA?RA?\") # (1): regex=re.compile('A?KIHA?BA?RA?')\nif regex.match(s): # (2): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " import re\n \n s = input()\n regex = re.compile(r\"A?KIHA?BA?RA?\")\n-if regex.match(s):\n- print(\"Yes\")\n+if regex.fullmatch(s):\n+ print(\"YES\")\n else:\n- print(\"No\")\n+ print(\"NO\")\n", "FL_content": " import re\n \n s = input()\n regex = re.compile(r\"A?KIHA?BA?RA?\")\n-if regex.match(s):\n- print(\"Yes\")\n else:\n- print(\"No\")\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u644778646", "problem_id": "p03523", "submission1_id": "s347254734", "submission2_id": "s424341439", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n s = input()\n l = [\"K\", \"I\", \"H\", \"B\", \"R\"]\n for i in range(len(l)):\n if l[i] not in s:\n print(\"NO\")\n\n c = 0\n ac = 0\n for i in range(len(s)):\n if c == 0:\n if s[i] == \"K\":\n c = 1\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 1:\n if s[i] != \"I\":\n print(\"NO\")\n exit()\n c = 2\n elif c == 2:\n if s[i] != \"H\":\n print(\"NO\")\n exit()\n c = 3\n elif c == 3:\n if s[i] == \"B\":\n c = 4\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 4:\n if s[i] == \"R\":\n c = 5\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 5:\n if s[i] == \"A\":\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n print(\"YES\")\n\n\nif __name__ == '__main__':\n main()\n", "code2": "def main():\n s = input()\n l = [\"K\", \"I\", \"H\", \"B\", \"R\"]\n for i in range(len(l)):\n if l[i] not in s:\n print(\"NO\")\n exit()\n\n c = 0\n ac = 0\n for i in range(len(s)):\n if c == 0:\n if s[i] == \"K\":\n c = 1\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n else:\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 1:\n if s[i] != \"I\":\n print(\"NO\")\n exit()\n c = 2\n elif c == 2:\n if s[i] != \"H\":\n print(\"NO\")\n exit()\n c = 3\n elif c == 3:\n if s[i] == \"B\":\n c = 4\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n else:\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 4:\n if s[i] == \"R\":\n c = 5\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n else:\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 5:\n if s[i] == \"A\":\n ac += 1\n else:\n print(\"NO\")\n exit()\n if ac > 1:\n print(\"NO\")\n exit()\n print(\"YES\")\n\n\nif __name__ == '__main__':\n main()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567873790", "date2": "1567876211", "bleu_score": "0.9032455933731395", "code1_test_status": [1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 9, "total_score": 102, "input": "DSAJI\n", "actual_output": "NO\nNO\nNO\nNO\nNO\n", "expected_output": "NO\n\n", "anno_code": ["def main(): # (0): main=\n s = input()\n l = [\"K\", \"I\", \"H\", \"B\", \"R\"]\n for i in range(len(l)):\n if l[i] not in s:\n print(\"NO\")\n\n c = 0\n ac = 0\n for i in range(len(s)):\n if c == 0:\n if s[i] == \"K\":\n c = 1\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 1:\n if s[i] != \"I\":\n print(\"NO\")\n exit()\n c = 2\n elif c == 2:\n if s[i] != \"H\":\n print(\"NO\")\n exit()\n c = 3\n elif c == 3:\n if s[i] == \"B\":\n c = 4\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 4:\n if s[i] == \"R\":\n c = 5\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 5:\n if s[i] == \"A\":\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n print(\"YES\")\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " def main():\n s = input()\n l = [\"K\", \"I\", \"H\", \"B\", \"R\"]\n for i in range(len(l)):\n if l[i] not in s:\n print(\"NO\")\n+ exit()\n \n c = 0\n ac = 0\n for i in range(len(s)):\n if c == 0:\n if s[i] == \"K\":\n c = 1\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n- ac += 1\n+ else:\n+ ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 1:\n if s[i] != \"I\":\n print(\"NO\")\n exit()\n c = 2\n elif c == 2:\n if s[i] != \"H\":\n print(\"NO\")\n exit()\n c = 3\n elif c == 3:\n if s[i] == \"B\":\n c = 4\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n- ac += 1\n+ else:\n+ ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 4:\n if s[i] == \"R\":\n c = 5\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n- ac += 1\n+ else:\n+ ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 5:\n if s[i] == \"A\":\n ac += 1\n+ else:\n+ print(\"NO\")\n+ exit()\n if ac > 1:\n print(\"NO\")\n exit()\n print(\"YES\")\n \n \n if __name__ == '__main__':\n main()\n-\n", "FL_content": " def main():\n s = input()\n l = [\"K\", \"I\", \"H\", \"B\", \"R\"]\n for i in range(len(l)):\n if l[i] not in s:\n print(\"NO\")\n \n c = 0\n ac = 0\n for i in range(len(s)):\n if c == 0:\n if s[i] == \"K\":\n c = 1\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n- ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 1:\n if s[i] != \"I\":\n print(\"NO\")\n exit()\n c = 2\n elif c == 2:\n if s[i] != \"H\":\n print(\"NO\")\n exit()\n c = 3\n elif c == 3:\n if s[i] == \"B\":\n c = 4\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n- ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 4:\n if s[i] == \"R\":\n c = 5\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n- ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 5:\n if s[i] == \"A\":\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n print(\"YES\")\n \n \n if __name__ == '__main__':\n main()\n-\n", "added_lines": 10, "removed_lines": 4, "code1_lines": 65 }, { "user_id": "u146575240", "problem_id": "p03523", "submission1_id": "s339328655", "submission2_id": "s563442790", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nS = str(input())\n\n\n\nif S.find('AA') == -1 or S.find('KA') == -1 or S.find('IA') == -1:\n S2 = S.replace('A','')\n if S2 == 'KIHBR':\n print('YES')\n else:\n print('NO')\nelse:\n print('NO')", "code2": "\nS = str(input())\n\n\n\nif S.find('AA') == -1 :\n if S.find('KA') == -1 :\n if S.find('IA') == -1:\n S2 = S.replace('A','')\n if S2 == 'KIHBR':\n print('YES')\n else:\n print('NO')\n else:\n print('NO')\n else:\n print('NO')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567273149", "date2": "1567274001", "bleu_score": "0.6062149647349748", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 101, "total_score": 102, "input": "AAKIAHBAARA\n", "actual_output": "YES\n", "expected_output": "NO\n", "anno_code": ["\nS = str(input()) # (0): S=AAKIAHBAARA\n\n\n\nif S.find('AA') == -1 or S.find('KA') == -1 or S.find('IA') == -1: # (1): NO CHANGE\n S2 = S.replace('A','') # (2): S2=KIHBR\n if S2 == 'KIHBR': # (3): NO CHANGE\n print('YES')\n else:\n print('NO')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " \n S = str(input())\n \n \n \n-if S.find('AA') == -1 or S.find('KA') == -1 or S.find('IA') == -1:\n- S2 = S.replace('A','')\n- if S2 == 'KIHBR':\n- print('YES')\n+if S.find('AA') == -1 :\n+ if S.find('KA') == -1 :\n+ if S.find('IA') == -1:\n+ S2 = S.replace('A','')\n+ if S2 == 'KIHBR':\n+ print('YES')\n+ else:\n+ print('NO')\n+ else:\n+ print('NO')\n else:\n print('NO')\n else:\n print('NO')\n", "FL_content": " \n S = str(input())\n \n \n \n-if S.find('AA') == -1 or S.find('KA') == -1 or S.find('IA') == -1:\n- S2 = S.replace('A','')\n- if S2 == 'KIHBR':\n- print('YES')\n else:\n print('NO')\n else:\n print('NO')\n", "added_lines": 10, "removed_lines": 4, "code1_lines": 13 }, { "user_id": "u902576227", "problem_id": "p03523", "submission1_id": "s030736452", "submission2_id": "s342713726", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ns = input()\ntf = [True, False]\nf = False\nfor i in range(2):\n for j in range(2):\n for k in range(2):\n for l in range(2):\n for m in range(2):\n tmp = \"\"\n if tf[i]:\n tmp+=\"A\"\n tmp+=\"KI\"\n if tf[j]:\n tmp += \"A\"\n tmp += \"H\"\n if tf[k]:\n tmp += \"A\"\n tmp += \"B\"\n if tf[l]:\n tmp += \"A\"\n tmp += \"R\"\n if tf[m]:\n tmp += \"A\"\n if tmp == s:\n f = True\nprint(\"Yes\" if f else \"No\")", "code2": "\ns = input()\ntf = [True, False]\nf = False\nfor i in range(2):\n for j in range(2):\n for k in range(2):\n for l in range(2):\n for m in range(2):\n tmp = \"\"\n if tf[i]:\n tmp += \"A\"\n tmp += \"KIH\"\n if tf[k]:\n tmp += \"A\"\n tmp += \"B\"\n if tf[l]:\n tmp += \"A\"\n tmp += \"R\"\n if tf[m]:\n tmp += \"A\"\n if tmp == s:\n f = True\nprint(\"YES\" if f else \"NO\")\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1577803799", "date2": "1577803910", "bleu_score": "0.8599196805022437", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "PKIAG\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["\ns = input() # (0): s=PKIAG\ntf = [True, False] # (1): tf=[True, False]\nf = False # (2): f=False\nfor i in range(2): # (3): i=0 (273): i=1 (527): NO CHANGE\n for j in range(2): # (4): j=0 (142): j=1 ... (526): NO CHANGE\n for k in range(2): # (5): k=0 (75): k=1 ... (525): NO CHANGE\n for l in range(2): # (6): l=0 (41): l=1 ... (524): NO CHANGE\n for m in range(2): # (7): m=0 (24): m=1 ... (523): NO CHANGE\n tmp = \"\" # (8): tmp= (25): tmp= ... (512): tmp=\n if tf[i]: # (9): NO CHANGE (26): NO CHANGE ... (513): NO CHANGE\n tmp+=\"A\" # (10): tmp=A (27): tmp=A ... (259): tmp=A\n tmp+=\"KI\" # (11): tmp=AKI (28): tmp=AKI ... (514): tmp=KI\n if tf[j]: # (12): NO CHANGE (29): NO CHANGE ... (515): NO CHANGE\n tmp += \"A\" # (13): tmp=AKIA (30): tmp=AKIA ... (393): tmp=KIA\n tmp += \"H\" # (14): tmp=AKIAH (31): tmp=AKIAH ... (516): tmp=KIH\n if tf[k]: # (15): NO CHANGE (32): NO CHANGE ... (517): NO CHANGE\n tmp += \"A\" # (16): tmp=AKIAHA (33): tmp=AKIAHA ... (459): tmp=KIHA\n tmp += \"B\" # (17): tmp=AKIAHAB (34): tmp=AKIAHAB ... (518): tmp=KIHB\n if tf[l]: # (18): NO CHANGE (35): NO CHANGE ... (519): NO CHANGE\n tmp += \"A\" # (19): tmp=AKIAHABA (36): tmp=AKIAHABA ... (492): tmp=KIHBA\n tmp += \"R\" # (20): tmp=AKIAHABAR (37): tmp=AKIAHABAR ... (520): tmp=KIHBR\n if tf[m]: # (21): NO CHANGE (38): NO CHANGE ... (521): NO CHANGE\n tmp += \"A\" # (22): tmp=AKIAHABARA (56): tmp=AKIAHABRA ... (509): tmp=KIHBRA\n if tmp == s: # (23): NO CHANGE (39): NO CHANGE ... (522): NO CHANGE\n f = True\nprint(\"Yes\" if f else \"No\")"], "anno_status": [true], "diff_content": " \n s = input()\n tf = [True, False]\n f = False\n for i in range(2):\n for j in range(2):\n for k in range(2):\n for l in range(2):\n for m in range(2):\n tmp = \"\"\n if tf[i]:\n- tmp+=\"A\"\n- tmp+=\"KI\"\n- if tf[j]:\n tmp += \"A\"\n- tmp += \"H\"\n+ tmp += \"KIH\"\n if tf[k]:\n tmp += \"A\"\n tmp += \"B\"\n if tf[l]:\n tmp += \"A\"\n tmp += \"R\"\n if tf[m]:\n tmp += \"A\"\n if tmp == s:\n f = True\n-print(\"Yes\" if f else \"No\")\n+print(\"YES\" if f else \"NO\")\n+\n", "FL_content": " \n s = input()\n tf = [True, False]\n f = False\n for i in range(2):\n for j in range(2):\n for k in range(2):\n for l in range(2):\n for m in range(2):\n tmp = \"\"\n if tf[i]:\n- tmp+=\"A\"\n- tmp+=\"KI\"\n- if tf[j]:\n tmp += \"A\"\n- tmp += \"H\"\n if tf[k]:\n tmp += \"A\"\n tmp += \"B\"\n if tf[l]:\n tmp += \"A\"\n tmp += \"R\"\n if tf[m]:\n tmp += \"A\"\n if tmp == s:\n f = True\n-print(\"Yes\" if f else \"No\")\n", "added_lines": 3, "removed_lines": 5, "code1_lines": 27 }, { "user_id": "u638795007", "problem_id": "p03523", "submission1_id": "s215444266", "submission2_id": "s356314213", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def examA():\n S = SI()\n T = \"AKIHABARA\"\n ans = \"YES\"\n L = len(T); cur = 0\n for s in S:\n if cur>=L:\n ans = \"NO\"\n break\n while(cur=L:\n ans = \"NO\"\n break\n cur += 1\n if d[\"K\"]<1 or d[\"I\"]<1 or d[\"H\"]<1 or d[\"B\"]<1 or d[\"R\"]<1:\n ans = \"NO\"\n print(ans)\n return\n\n\nimport sys,copy,bisect,itertools,heapq,math\nfrom heapq import heappop,heappush,heapify\nfrom collections import Counter,defaultdict,deque\ndef I(): return int(sys.stdin.readline())\ndef LI(): return list(map(int,sys.stdin.readline().split()))\ndef LSI(): return list(map(str,sys.stdin.readline().split()))\ndef LS(): return sys.stdin.readline().split()\ndef SI(): return sys.stdin.readline().strip()\nmod = 10**9 + 7\ninf = float('inf')\n\nif __name__ == '__main__':\n examA()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1576287131", "date2": "1576287599", "bleu_score": "0.839415781050483", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 100, "total_score": 102, "input": "AKHBAAARH\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["def examA(): # (0): examA=, sys=, copy=, bisect=, itertools=, heapq=, math=, heappop=, heappush=, heapify=, Counter=, defaultdict=, deque=, I=, LI=, LSI=, LS=, SI=\n S = SI()\n T = \"AKIHABARA\"\n ans = \"YES\"\n L = len(T); cur = 0\n for s in S:\n if cur>=L:\n ans = \"NO\"\n break\n while(cur=L:\n- ans = \"NO\"\n- break\n+ d[s] +=1\n while(cur=L:\n+ ans = \"NO\"\n+ break\n+ cur += 1\n+ if d[\"K\"]<1 or d[\"I\"]<1 or d[\"H\"]<1 or d[\"B\"]<1 or d[\"R\"]<1:\n+ ans = \"NO\"\n print(ans)\n return\n \n \n import sys,copy,bisect,itertools,heapq,math\n from heapq import heappop,heappush,heapify\n from collections import Counter,defaultdict,deque\n def I(): return int(sys.stdin.readline())\n def LI(): return list(map(int,sys.stdin.readline().split()))\n def LSI(): return list(map(str,sys.stdin.readline().split()))\n def LS(): return sys.stdin.readline().split()\n def SI(): return sys.stdin.readline().strip()\n mod = 10**9 + 7\n inf = float('inf')\n \n if __name__ == '__main__':\n examA()\n \n", "FL_content": " def examA():\n S = SI()\n T = \"AKIHABARA\"\n ans = \"YES\"\n L = len(T); cur = 0\n for s in S:\n- if cur>=L:\n- ans = \"NO\"\n- break\n while(cur\n N, M = map(int, input().split())\n A_B = [list(map(int, input().split()))[::-1] for _ in range(N)]\n logging.info(\"Hello!\")\n\n sorted_A_B = sorted(A_B, reverse=True)\n logging.info(sorted_A_B)\n\n\n total = 0\n for i in range(N):\n if sorted_A_B[i][1] + i <= M:\n total += sorted_A_B[i][0]\n\n\n print(total)\n \nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " import logging\n+import heapq\n \n logging.basicConfig(level=logging.INFO, format=\"%(message)s\")\n \n \n-dp = [0 for _ in range(100000)]\n \n def main():\n N, M = map(int, input().split())\n- A_B = [list(map(int, input().split()))[::-1] for _ in range(N)]\n+ A_B = [list(map(int, input().split())) for _ in range(N)]\n logging.info(\"Hello!\")\n \n- sorted_A_B = sorted(A_B, reverse=True)\n- logging.info(sorted_A_B)\n+ A_B.sort()\n+ logging.info(A_B)\n \n \n+ heap_Q = []\n+ curr = 0\n total = 0\n- for i in range(N):\n- if sorted_A_B[i][1] + i <= M:\n- total += sorted_A_B[i][0]\n+ for i in range(1, M + 1):\n+ while curr < N and A_B[curr][0] <= i:\n+ heapq.heappush(heap_Q, A_B[curr][1] * (-1))\n+ curr += 1\n \n+ if heap_Q:\n+ total += (-1) * heapq.heappop(heap_Q)\n \n print(total)\n \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": " import logging\n \n logging.basicConfig(level=logging.INFO, format=\"%(message)s\")\n \n \n-dp = [0 for _ in range(100000)]\n \n def main():\n N, M = map(int, input().split())\n- A_B = [list(map(int, input().split()))[::-1] for _ in range(N)]\n logging.info(\"Hello!\")\n \n- sorted_A_B = sorted(A_B, reverse=True)\n- logging.info(sorted_A_B)\n \n \n total = 0\n- for i in range(N):\n- if sorted_A_B[i][1] + i <= M:\n- total += sorted_A_B[i][0]\n \n \n print(total)\n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 12, "removed_lines": 7, "code1_lines": 27 }, { "user_id": "u423585790", "problem_id": "p02948", "submission1_id": "s507960250", "submission2_id": "s994316654", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nfrom collections import defaultdict,deque\nfrom heapq import heappush, heappop\nfrom bisect import *\nimport sys, random, itertools, math\nsys.setrecursionlimit(10**5)\ninput = sys.stdin.readline\nsqrt = math.sqrt\ndef LI(): return list(map(int, input().split()))\ndef LF(): return list(map(float, input().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, input().split()))\ndef II(): return int(input())\ndef IF(): return float(input())\ndef LS(): return list(map(list, input().split()))\ndef S(): return list(input().rstrip())\ndef IR(n): return [II() for _ in range(n)]\ndef LIR(n): return [LI() for _ in range(n)]\ndef FR(n): return [IF() for _ in range(n)]\ndef LFR(n): return [LI() for _ in range(n)]\ndef LIR_(n): return [LI_() for _ in range(n)]\ndef SR(n): return [S() for _ in range(n)]\ndef LSR(n): return [LS() for _ in range(n)]\nmod = 1000000007\ninf = float('INF')\n\n\ndef A():\n a, b = LI()\n print(max(a + b, a - b, a * b))\n return\n\n\ndef B():\n k, x = LI()\n ans = []\n for i in range(x - k + 1, x + k):\n ans.append(i)\n print(*ans)\n return\n\n\ndef C():\n n = II()\n d = defaultdict(int)\n for _ in range(n):\n s = S()\n s.sort()\n d[tuple(s)] += 1\n ans = 0\n for i in d.values():\n ans += i * (i - 1) \n print(ans)\n return\n\n\ndef D():\n n, m = LI()\n ab = LIR(n)\n ab.sort(key=lambda x: (x[1], x[0]), reverse=True)\n ans = 0\n for i in range(n):\n if m >= ab[i][0]:\n ans += ab[i][1]\n m -= 1\n print(ans)\n return\n\n\ndef E():\n return\n\n\ndef F():\n return\n\n\nif __name__ == '__main__':\n D()\n", "code2": "\nfrom collections import defaultdict,deque\nfrom heapq import heappush, heappop\nfrom bisect import *\nimport sys, random, itertools, math\nsys.setrecursionlimit(10**5)\ninput = sys.stdin.readline\nsqrt = math.sqrt\ndef LI(): return list(map(int, input().split()))\ndef LF(): return list(map(float, input().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, input().split()))\ndef II(): return int(input())\ndef IF(): return float(input())\ndef LS(): return list(map(list, input().split()))\ndef S(): return list(input().rstrip())\ndef IR(n): return [II() for _ in range(n)]\ndef LIR(n): return [LI() for _ in range(n)]\ndef FR(n): return [IF() for _ in range(n)]\ndef LFR(n): return [LI() for _ in range(n)]\ndef LIR_(n): return [LI_() for _ in range(n)]\ndef SR(n): return [S() for _ in range(n)]\ndef LSR(n): return [LS() for _ in range(n)]\nmod = 1000000007\ninf = float('INF')\n\n\ndef A():\n a, b = LI()\n print(max(a + b, a - b, a * b))\n return\n\n\ndef B():\n k, x = LI()\n ans = []\n for i in range(x - k + 1, x + k):\n ans.append(i)\n print(*ans)\n return\n\n\ndef C():\n n = II()\n d = defaultdict(int)\n for _ in range(n):\n s = S()\n s.sort()\n d[tuple(s)] += 1\n ans = 0\n for i in d.values():\n ans += i * (i - 1) \n print(ans)\n return\n\n\n\n\n\ndef D():\n n, m = LI()\n q = []\n d = defaultdict(list)\n ans = 0\n for _ in range(n):\n a, b = LI()\n d[a].append(b)\n for i in range(m):\n for di in d[i+1]:\n heappush(q, -di)\n if q:\n ans -= heappop(q)\n print(ans)\n return\n\n\ndef E():\n return\n\n\ndef F():\n return\n\n\nif __name__ == '__main__':\n D()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1569523896", "date2": "1569524925", "bleu_score": "0.9196496586209593", "code1_test_status": [1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 98, "total_score": 102, "input": "3 5\n4 3\n4 1\n2 2\n", "actual_output": "5\n", "expected_output": "6\n\n", "anno_code": ["\nfrom collections import defaultdict,deque\nfrom heapq import heappush, heappop\nfrom bisect import *\nimport sys, random, itertools, math\nsys.setrecursionlimit(10**5) # (0): NO CHANGE\ninput = sys.stdin.readline # (1): input=\nsqrt = math.sqrt # (2): sqrt=, LI=, LF=, LI_=, II=, IF=, LS=, S=, IR=, LIR=, FR=, LFR=, LIR_=, SR=, LSR=\ndef LI(): return list(map(int, input().split()))\ndef LF(): return list(map(float, input().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, input().split()))\ndef II(): return int(input())\ndef IF(): return float(input())\ndef LS(): return list(map(list, input().split()))\ndef S(): return list(input().rstrip())\ndef IR(n): return [II() for _ in range(n)]\ndef LIR(n): return [LI() for _ in range(n)]\ndef FR(n): return [IF() for _ in range(n)]\ndef LFR(n): return [LI() for _ in range(n)]\ndef LIR_(n): return [LI_() for _ in range(n)]\ndef SR(n): return [S() for _ in range(n)]\ndef LSR(n): return [LS() for _ in range(n)]\nmod = 1000000007 # (3): mod=1000000007\ninf = float('INF') # (4): inf=inf\n\n\ndef A(): # (5): A=\n a, b = LI()\n print(max(a + b, a - b, a * b))\n return\n\n\ndef B(): # (6): B=\n k, x = LI()\n ans = []\n for i in range(x - k + 1, x + k):\n ans.append(i)\n print(*ans)\n return\n\n\ndef C(): # (7): C=\n n = II()\n d = defaultdict(int)\n for _ in range(n):\n s = S()\n s.sort()\n d[tuple(s)] += 1\n ans = 0\n for i in d.values():\n ans += i * (i - 1) \n print(ans)\n return\n\n\ndef D(): # (8): D=\n n, m = LI()\n ab = LIR(n)\n ab.sort(key=lambda x: (x[1], x[0]), reverse=True)\n ans = 0\n for i in range(n):\n if m >= ab[i][0]:\n ans += ab[i][1]\n m -= 1\n print(ans)\n return\n\n\ndef E(): # (9): E=\n return\n\n\ndef F(): # (10): F=\n return\n\n\nif __name__ == '__main__':\n D()\n"], "anno_status": [false], "diff_content": " \n from collections import defaultdict,deque\n from heapq import heappush, heappop\n from bisect import *\n import sys, random, itertools, math\n sys.setrecursionlimit(10**5)\n input = sys.stdin.readline\n sqrt = math.sqrt\n def LI(): return list(map(int, input().split()))\n def LF(): return list(map(float, input().split()))\n def LI_(): return list(map(lambda x: int(x)-1, input().split()))\n def II(): return int(input())\n def IF(): return float(input())\n def LS(): return list(map(list, input().split()))\n def S(): return list(input().rstrip())\n def IR(n): return [II() for _ in range(n)]\n def LIR(n): return [LI() for _ in range(n)]\n def FR(n): return [IF() for _ in range(n)]\n def LFR(n): return [LI() for _ in range(n)]\n def LIR_(n): return [LI_() for _ in range(n)]\n def SR(n): return [S() for _ in range(n)]\n def LSR(n): return [LS() for _ in range(n)]\n mod = 1000000007\n inf = float('INF')\n \n \n def A():\n a, b = LI()\n print(max(a + b, a - b, a * b))\n return\n \n \n def B():\n k, x = LI()\n ans = []\n for i in range(x - k + 1, x + k):\n ans.append(i)\n print(*ans)\n return\n \n \n def C():\n n = II()\n d = defaultdict(int)\n for _ in range(n):\n s = S()\n s.sort()\n d[tuple(s)] += 1\n ans = 0\n for i in d.values():\n ans += i * (i - 1) \n print(ans)\n return\n \n \n+\n+\n+\n def D():\n n, m = LI()\n- ab = LIR(n)\n- ab.sort(key=lambda x: (x[1], x[0]), reverse=True)\n+ q = []\n+ d = defaultdict(list)\n ans = 0\n- for i in range(n):\n- if m >= ab[i][0]:\n- ans += ab[i][1]\n- m -= 1\n+ for _ in range(n):\n+ a, b = LI()\n+ d[a].append(b)\n+ for i in range(m):\n+ for di in d[i+1]:\n+ heappush(q, -di)\n+ if q:\n+ ans -= heappop(q)\n print(ans)\n return\n \n \n def E():\n return\n \n \n def F():\n return\n \n \n if __name__ == '__main__':\n D()\n \n", "FL_content": " \n from collections import defaultdict,deque\n from heapq import heappush, heappop\n from bisect import *\n import sys, random, itertools, math\n sys.setrecursionlimit(10**5)\n input = sys.stdin.readline\n sqrt = math.sqrt\n def LI(): return list(map(int, input().split()))\n def LF(): return list(map(float, input().split()))\n def LI_(): return list(map(lambda x: int(x)-1, input().split()))\n def II(): return int(input())\n def IF(): return float(input())\n def LS(): return list(map(list, input().split()))\n def S(): return list(input().rstrip())\n def IR(n): return [II() for _ in range(n)]\n def LIR(n): return [LI() for _ in range(n)]\n def FR(n): return [IF() for _ in range(n)]\n def LFR(n): return [LI() for _ in range(n)]\n def LIR_(n): return [LI_() for _ in range(n)]\n def SR(n): return [S() for _ in range(n)]\n def LSR(n): return [LS() for _ in range(n)]\n mod = 1000000007\n inf = float('INF')\n \n \n def A():\n a, b = LI()\n print(max(a + b, a - b, a * b))\n return\n \n \n def B():\n k, x = LI()\n ans = []\n for i in range(x - k + 1, x + k):\n ans.append(i)\n print(*ans)\n return\n \n \n def C():\n n = II()\n d = defaultdict(int)\n for _ in range(n):\n s = S()\n s.sort()\n d[tuple(s)] += 1\n ans = 0\n for i in d.values():\n ans += i * (i - 1) \n print(ans)\n return\n \n \n def D():\n n, m = LI()\n- ab = LIR(n)\n- ab.sort(key=lambda x: (x[1], x[0]), reverse=True)\n ans = 0\n- for i in range(n):\n- if m >= ab[i][0]:\n- ans += ab[i][1]\n- m -= 1\n print(ans)\n return\n \n \n def E():\n return\n \n \n def F():\n return\n \n \n if __name__ == '__main__':\n D()\n \n", "added_lines": 13, "removed_lines": 6, "code1_lines": 79 }, { "user_id": "u922901775", "problem_id": "p02948", "submission1_id": "s638581473", "submission2_id": "s500788709", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nimport heapq\nfrom collections import defaultdict\n\n\ndef solve(N: int, M: int, A: \"List[int]\", B: \"List[int]\"):\n Q = defaultdict(list)\n Q2 = []\n for a, b in zip(A, B):\n heapq.heappush(Q[a], -b)\n \n for a in Q.keys():\n rank = M-a+1\n for i, b in enumerate(Q[a]):\n if i >= rank:\n break\n score = i + a\n Q2.append((b, score))\n Q2.sort()\n\n count = 0\n res = 0\n for b, score in Q2:\n if count >= M:\n break\n if count >= score:\n continue\n res -= b\n count += 1\n print(res)\n return\n\n\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n N = int(next(tokens)) \n M = int(next(tokens)) \n A = [int()] * (N) \n B = [int()] * (N) \n for i in range(N):\n A[i] = int(next(tokens))\n B[i] = int(next(tokens))\n solve(N, M, A, B)\n\nif __name__ == '__main__':\n main()\n", "code2": "\nimport sys\nimport heapq\nfrom collections import defaultdict\n\n\ndef solve(N: int, M: int, A: \"List[int]\", B: \"List[int]\"):\n \n L = [] \n Q = defaultdict(list)\n for a, b in zip(A, B):\n heapq.heappush(Q[a], -b)\n \n res = 0\n for d in range(1, M+1):\n for b in Q[d]:\n heapq.heappush(L, b)\n if len(L) == 0:\n continue\n b = heapq.heappop(L)\n res -= b\n\n print(res)\n\n\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n N = int(next(tokens)) \n M = int(next(tokens)) \n A = [int()] * (N) \n B = [int()] * (N) \n for i in range(N):\n A[i] = int(next(tokens))\n B[i] = int(next(tokens))\n solve(N, M, A, B)\n\nif __name__ == '__main__':\n main()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1565490140", "date2": "1565492005", "bleu_score": "0.7352471547296464", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 102, "input": "5 5\n1 2\n1 0\n1 4\n1 1\n2 5\n", "actual_output": "7\n", "expected_output": "12\n\n", "anno_code": ["\nimport sys\nimport heapq\nfrom collections import defaultdict\n\n\ndef solve(N: int, M: int, A: \"List[int]\", B: \"List[int]\"): # (0): solve=\n Q = defaultdict(list)\n Q2 = []\n for a, b in zip(A, B):\n heapq.heappush(Q[a], -b)\n \n for a in Q.keys():\n rank = M-a+1\n for i, b in enumerate(Q[a]):\n if i >= rank:\n break\n score = i + a\n Q2.append((b, score))\n Q2.sort()\n\n count = 0\n res = 0\n for b, score in Q2:\n if count >= M:\n break\n if count >= score:\n continue\n res -= b\n count += 1\n print(res)\n return\n\n\n\ndef main(): # (1): main=\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n N = int(next(tokens)) \n M = int(next(tokens)) \n A = [int()] * (N) \n B = [int()] * (N) \n for i in range(N):\n A[i] = int(next(tokens))\n B[i] = int(next(tokens))\n solve(N, M, A, B)\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " \n import sys\n import heapq\n from collections import defaultdict\n \n \n def solve(N: int, M: int, A: \"List[int]\", B: \"List[int]\"):\n+ \n+ L = [] \n Q = defaultdict(list)\n- Q2 = []\n for a, b in zip(A, B):\n heapq.heappush(Q[a], -b)\n \n- for a in Q.keys():\n- rank = M-a+1\n- for i, b in enumerate(Q[a]):\n- if i >= rank:\n- break\n- score = i + a\n- Q2.append((b, score))\n- Q2.sort()\n-\n- count = 0\n res = 0\n- for b, score in Q2:\n- if count >= M:\n- break\n- if count >= score:\n+ for d in range(1, M+1):\n+ for b in Q[d]:\n+ heapq.heappush(L, b)\n+ if len(L) == 0:\n continue\n+ b = heapq.heappop(L)\n res -= b\n- count += 1\n+\n print(res)\n- return\n \n \n \n def main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n N = int(next(tokens)) \n M = int(next(tokens)) \n A = [int()] * (N) \n B = [int()] * (N) \n for i in range(N):\n A[i] = int(next(tokens))\n B[i] = int(next(tokens))\n solve(N, M, A, B)\n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " \n import sys\n import heapq\n from collections import defaultdict\n \n \n def solve(N: int, M: int, A: \"List[int]\", B: \"List[int]\"):\n Q = defaultdict(list)\n- Q2 = []\n for a, b in zip(A, B):\n heapq.heappush(Q[a], -b)\n \n- for a in Q.keys():\n- rank = M-a+1\n- for i, b in enumerate(Q[a]):\n- if i >= rank:\n- break\n- score = i + a\n- Q2.append((b, score))\n- Q2.sort()\n-\n- count = 0\n res = 0\n- for b, score in Q2:\n- if count >= M:\n- break\n- if count >= score:\n continue\n res -= b\n- count += 1\n print(res)\n- return\n \n \n \n def main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n N = int(next(tokens)) \n M = int(next(tokens)) \n A = [int()] * (N) \n B = [int()] * (N) \n for i in range(N):\n A[i] = int(next(tokens))\n B[i] = int(next(tokens))\n solve(N, M, A, B)\n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 8, "removed_lines": 17, "code1_lines": 53 }, { "user_id": "u475991121", "problem_id": "p02948", "submission1_id": "s246324255", "submission2_id": "s357759759", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\npay = []\nfor _ in range(n):\n a, b = map(int, input().split())\n pay.append((b, a))\npay = sorted(pay, reverse=True)\ndays = 0\nans = 0\nfor i in range(n):\n if days + pay[i][1] <= m:\n days += 1\n ans += pay[i][0]\nprint(ans)", "code2": "from heapq import *\nn, m = map(int, input().split())\npay = []\nfor _ in range(n):\n a, b = map(int, input().split())\n pay.append((a, b))\npay = sorted(pay, reverse=True)\nq = []\nans = 0\nfor i in range(1, m+1):\n while pay and pay[-1][0] <= i:\n a, b = pay.pop()\n heappush(q, -b)\n if q:\n b = -heappop(q)\n ans += b\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565491310", "date2": "1565517174", "bleu_score": "0.6457238013480002", "code1_test_status": [1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 98, "total_score": 102, "input": "3 4\n4 3\n3 0\n2 4\n", "actual_output": "4\n", "expected_output": "7\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=3, m=4\npay = [] # (1): pay=[]\nfor _ in range(n): # (2): _=0 (5): _=1 ... (11): NO CHANGE\n a, b = map(int, input().split()) # (3): a=4, b=3 (6): a=3, b=0 (9): a=2, b=4\n pay.append((b, a)) # (4): pay=[(3, 4)] (7): pay=[(3, 4), (0, 3)] (10): pay=[(3, 4), (0, 3), (4, 2)]\npay = sorted(pay, reverse=True) # (12): pay=[(4, 2), (3, 4), (0, 3)]\ndays = 0 # (13): days=0\nans = 0 # (14): ans=0\nfor i in range(n): # (15): i=0 (19): i=1 ... (25): NO CHANGE\n if days + pay[i][1] <= m: # (16): NO CHANGE (20): NO CHANGE (22): NO CHANGE\n days += 1 # (17): days=1 (23): days=2\n ans += pay[i][0] # (18): ans=4 (24): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": "+from heapq import *\n n, m = map(int, input().split())\n pay = []\n for _ in range(n):\n a, b = map(int, input().split())\n- pay.append((b, a))\n+ pay.append((a, b))\n pay = sorted(pay, reverse=True)\n-days = 0\n+q = []\n ans = 0\n-for i in range(n):\n- if days + pay[i][1] <= m:\n- days += 1\n- ans += pay[i][0]\n+for i in range(1, m+1):\n+ while pay and pay[-1][0] <= i:\n+ a, b = pay.pop()\n+ heappush(q, -b)\n+ if q:\n+ b = -heappop(q)\n+ ans += b\n print(ans)\n", "FL_content": " n, m = map(int, input().split())\n pay = []\n for _ in range(n):\n a, b = map(int, input().split())\n- pay.append((b, a))\n pay = sorted(pay, reverse=True)\n-days = 0\n ans = 0\n-for i in range(n):\n- if days + pay[i][1] <= m:\n- days += 1\n- ans += pay[i][0]\n print(ans)\n", "added_lines": 10, "removed_lines": 6, "code1_lines": 13 }, { "user_id": "u593019570", "problem_id": "p02948", "submission1_id": "s454502631", "submission2_id": "s706109876", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\n\nn,m = map(int,input().split())\n\na = [[] for i in range(100000)]\nd = []\nheapq.heapify(d)\n\nfor _ in range(n):\n b,c = map(int,input().split())\n a[b-1].append(-1 * c)\n\n\n\nans = 0\nfor i in range(m):\n for j in range(len(a[i])):\n heapq.heappush(d,a[i][j])\n if d == []:\n break\n ans -= heapq.heappop(d)\n\nprint(ans)", "code2": "import heapq\n\nn,m = map(int,input().split())\n\na = [[] for i in range(100000)]\nd = []\nheapq.heapify(d)\n\nfor _ in range(n):\n b,c = map(int,input().split())\n a[b-1].append(-1 * c)\n\n\n\nans = 0\nfor i in range(m):\n for j in range(len(a[i])):\n heapq.heappush(d,a[i][j])\n if d != []:\n ans -= heapq.heappop(d)\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566921281", "date2": "1566921376", "bleu_score": "0.9635122759576695", "code1_test_status": [1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 92, "total_score": 102, "input": "3 4\n4 3\n3 0\n3 2\n", "actual_output": "0\n", "expected_output": "5\n\n", "anno_code": ["import heapq\n\nn,m = map(int,input().split()) # (0): n=3, m=4\n\na = [[] for i in range(100000)] # (1): a\nd = [] # (2): d=[]\nheapq.heapify(d) # (3): NO CHANGE\n\nfor _ in range(n): # (4): _=0 (7): a, _=1 ... (13): a\n b,c = map(int,input().split()) # (5): b=4, c=3 (8): a=[[], [], [], [-3], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], []], b=3, c=0 (11): a, c=2\n a[b-1].append(-1 * c) # (6): a=[[], [], [], [-3], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], []] (9): a (12): a\n\n\n\nans = 0 # (14): a, ans=0\nfor i in range(m): # (15): a, i=0\n for j in range(len(a[i])): # (16): a\n heapq.heappush(d,a[i][j])\n if d == []: # (17): a\n break # (18): a\n ans -= heapq.heappop(d)\n\nprint(ans)"], "anno_status": [false], "diff_content": " import heapq\n \n n,m = map(int,input().split())\n \n a = [[] for i in range(100000)]\n d = []\n heapq.heapify(d)\n \n for _ in range(n):\n b,c = map(int,input().split())\n a[b-1].append(-1 * c)\n \n \n \n ans = 0\n for i in range(m):\n for j in range(len(a[i])):\n heapq.heappush(d,a[i][j])\n- if d == []:\n- break\n- ans -= heapq.heappop(d)\n+ if d != []:\n+ ans -= heapq.heappop(d)\n \n print(ans)\n", "FL_content": " import heapq\n \n n,m = map(int,input().split())\n \n a = [[] for i in range(100000)]\n d = []\n heapq.heapify(d)\n \n for _ in range(n):\n b,c = map(int,input().split())\n a[b-1].append(-1 * c)\n \n \n \n ans = 0\n for i in range(m):\n for j in range(len(a[i])):\n heapq.heappush(d,a[i][j])\n- if d == []:\n- break\n- ans -= heapq.heappop(d)\n \n print(ans)\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 23 }, { "user_id": "u316322317", "problem_id": "p02948", "submission1_id": "s836999504", "submission2_id": "s216908269", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\nn,m=map(int,input().split())\nl=[]\nfor i in range(n):\n a,b=map(int,input().split())\n l.append([a,b])\nl.sort()\nl.append([0,0])\nans=0\nk=[]\nj=0\nfor i in range(1,m+1):\n while j<=n and l[j][0]<=i:\n heapq.heappush(k, l[j][1])\n j+=1\n if len(k)!=0:\n \tans+=k[-1]\n \tk.pop(-1)\nprint(ans)", "code2": "import heapq\nn,m=map(int,input().split())\nl=[]\nfor i in range(n):\n a,b=map(int,input().split())\n l.append([a,b])\nl.sort()\nl.append([0,0])\nans=0\nk=[]\nj=0\nfor i in range(1,m+1):\n while j<=n and l[j][0]<=i:\n heapq.heappush(k, -1*l[j][1])\n j+=1\n if len(k)!=0:\n \tans+=-1*k[0]\n \theapq.heappop(k)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565494289", "date2": "1565494396", "bleu_score": "0.924705079851252", "code1_test_status": [0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 94, "total_score": 102, "input": "3 4\n4 3\n4 0\n3 2\n", "actual_output": "2\n", "expected_output": "5\n\n", "anno_code": ["import heapq\nn,m=map(int,input().split()) # (0): n=3, m=4\nl=[] # (1): l=[]\nfor i in range(n): # (2): i=0 (5): i=1 ... (11): NO CHANGE\n a,b=map(int,input().split()) # (3): a=4, b=3 (6): b=0 (9): a=3, b=2\n l.append([a,b]) # (4): l=[[4, 3]] (7): l (10): l\nl.sort() # (12): l\nl.append([0,0]) # (13): l\nans=0 # (14): ans=0\nk=[] # (15): k=[]\nj=0 # (16): j=0\nfor i in range(1,m+1): # (17): i=1 (20): i=2 ... (45): NO CHANGE\n while j<=n and l[j][0]<=i: # (18): NO CHANGE (21): NO CHANGE ... (41): NO CHANGE\n heapq.heappush(k, l[j][1]) # (25): k=[2] (33): k=[0] ... (39): k=[0, 3, 0]\n j+=1 # (26): j=1 (34): j=2 ... (40): j=4\n if len(k)!=0: # (19): NO CHANGE (22): NO CHANGE ... (42): NO CHANGE\n \tans+=k[-1] # (29): ans=2 (43): NO CHANGE\n \tk.pop(-1) # (30): k=[] (44): k=[0, 3]\nprint(ans)"], "anno_status": [true], "diff_content": " import heapq\n n,m=map(int,input().split())\n l=[]\n for i in range(n):\n a,b=map(int,input().split())\n l.append([a,b])\n l.sort()\n l.append([0,0])\n ans=0\n k=[]\n j=0\n for i in range(1,m+1):\n while j<=n and l[j][0]<=i:\n- heapq.heappush(k, l[j][1])\n+ heapq.heappush(k, -1*l[j][1])\n j+=1\n if len(k)!=0:\n- \tans+=k[-1]\n- \tk.pop(-1)\n+ \tans+=-1*k[0]\n+ \theapq.heappop(k)\n print(ans)\n", "FL_content": " import heapq\n n,m=map(int,input().split())\n l=[]\n for i in range(n):\n a,b=map(int,input().split())\n l.append([a,b])\n l.sort()\n l.append([0,0])\n ans=0\n k=[]\n j=0\n for i in range(1,m+1):\n while j<=n and l[j][0]<=i:\n- heapq.heappush(k, l[j][1])\n j+=1\n if len(k)!=0:\n- \tans+=k[-1]\n- \tk.pop(-1)\n print(ans)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 19 }, { "user_id": "u424776185", "problem_id": "p02948", "submission1_id": "s484708961", "submission2_id": "s452880572", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n [N, M] = [int(number) for number in input().split()]\n part_times = []\n for i in range(N):\n [a, b] = [int(number) for number in input().split()]\n \n part_times.append([b, a])\n \n part_times = sorted(part_times, key = lambda x: (x[0], x[1]))\n print(part_times)\n money = 0\n day = 0\n\n \n\n for part_time in part_times:\n [b,a] = part_time\n if a + day <= M:\n day += a\n money += b\n else:\n continue\n print(money)\n\nif __name__ == '__main__':\n main()\n", "code2": "import heapq\n\ndef main():\n [N, M] = [int(number) for number in input().split()]\n part_times = []\n for i in range(N):\n job= [int(number) for number in input().split()]\n part_times.append(job)\n part_times = [part_time for part_time in sorted(part_times, key = lambda x: x[0])] \n money = 0\n hp = []\n for day in range(M):\n while part_times != [] and part_times[0][0] <= day + 1:\n part_time = part_times[0]\n heapq.heappush(hp, - part_time[1])\n part_times.pop(0)\n if hp != []:\n money -= heapq.heappop(hp)\n\n print(money)\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565491180", "date2": "1567993692", "bleu_score": "0.731066815371781", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "3 0\n4 1\n3 1\n2 3\n", "actual_output": "[[1, 3], [1, 4], [3, 2]]\n0\n", "expected_output": "0\n\n", "anno_code": ["def main(): # (0): main=\n [N, M] = [int(number) for number in input().split()]\n part_times = []\n for i in range(N):\n [a, b] = [int(number) for number in input().split()]\n \n part_times.append([b, a])\n \n part_times = sorted(part_times, key = lambda x: (x[0], x[1]))\n print(part_times)\n money = 0\n day = 0\n\n \n\n for part_time in part_times:\n [b,a] = part_time\n if a + day <= M:\n day += a\n money += b\n else:\n continue\n print(money)\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": "+import heapq\n+\n def main():\n [N, M] = [int(number) for number in input().split()]\n part_times = []\n for i in range(N):\n- [a, b] = [int(number) for number in input().split()]\n- \n- part_times.append([b, a])\n- \n- part_times = sorted(part_times, key = lambda x: (x[0], x[1]))\n- print(part_times)\n+ job= [int(number) for number in input().split()]\n+ part_times.append(job)\n+ part_times = [part_time for part_time in sorted(part_times, key = lambda x: x[0])] \n money = 0\n- day = 0\n-\n- \n+ hp = []\n+ for day in range(M):\n+ while part_times != [] and part_times[0][0] <= day + 1:\n+ part_time = part_times[0]\n+ heapq.heappush(hp, - part_time[1])\n+ part_times.pop(0)\n+ if hp != []:\n+ money -= heapq.heappop(hp)\n \n- for part_time in part_times:\n- [b,a] = part_time\n- if a + day <= M:\n- day += a\n- money += b\n- else:\n- continue\n print(money)\n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " def main():\n [N, M] = [int(number) for number in input().split()]\n part_times = []\n for i in range(N):\n- [a, b] = [int(number) for number in input().split()]\n- \n- part_times.append([b, a])\n- \n- part_times = sorted(part_times, key = lambda x: (x[0], x[1]))\n- print(part_times)\n money = 0\n- day = 0\n-\n- \n \n- for part_time in part_times:\n- [b,a] = part_time\n- if a + day <= M:\n- day += a\n- money += b\n- else:\n- continue\n print(money)\n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 13, "removed_lines": 16, "code1_lines": 27 }, { "user_id": "u047535298", "problem_id": "p02948", "submission1_id": "s474487274", "submission2_id": "s165700334", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\nW = [tuple(map(int, input().split())) for i in range(N)]\nW.sort(key=lambda x: -1000000*x[1]-x[0])\n\nday = 0\nans = 0\nfor i in range(N):\n if M-day-W[i][0] >= 0:\n ans += W[i][1]\n day += 1\n if day >= M:\n break\n\nprint(ans)", "code2": "import heapq\nN, M = map(int, input().split())\nW = [tuple(map(int, input().split())) for i in range(N)]\nW.sort()\nh = []\n\nj = 0\nans = 0\nfor i in range(M+1):\n while j < N and W[j][0] < i+1:\n heapq.heappush(h, (-W[j][1], W[j][1]))\n j += 1\n if h:\n p = heapq.heappop(h)\n ans += p[1]\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566267856", "date2": "1566269265", "bleu_score": "0.6174973655274477", "code1_test_status": [1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 98, "total_score": 102, "input": "3 4\n4 3\n3 0\n3 4\n", "actual_output": "4\n", "expected_output": "7\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=3, M=4\nW = [tuple(map(int, input().split())) for i in range(N)] # (1): W=[(4, 3), (3, 0), (3, 4)]\nW.sort(key=lambda x: -1000000*x[1]-x[0]) # (2): W=[(3, 4), (4, 3), (3, 0)]\n\nday = 0 # (3): day=0\nans = 0 # (4): ans=0\nfor i in range(N): # (5): i=0 (10): i=1 ... (18): NO CHANGE\n if M-day-W[i][0] >= 0: # (6): NO CHANGE (11): NO CHANGE (14): NO CHANGE\n ans += W[i][1] # (7): ans=4 (15): NO CHANGE\n day += 1 # (8): day=1 (16): day=2\n if day >= M: # (9): NO CHANGE (12): NO CHANGE (17): NO CHANGE\n break\n\nprint(ans)"], "anno_status": [true], "diff_content": "+import heapq\n N, M = map(int, input().split())\n W = [tuple(map(int, input().split())) for i in range(N)]\n-W.sort(key=lambda x: -1000000*x[1]-x[0])\n+W.sort()\n+h = []\n \n-day = 0\n+j = 0\n ans = 0\n-for i in range(N):\n- if M-day-W[i][0] >= 0:\n- ans += W[i][1]\n- day += 1\n- if day >= M:\n- break\n+for i in range(M+1):\n+ while j < N and W[j][0] < i+1:\n+ heapq.heappush(h, (-W[j][1], W[j][1]))\n+ j += 1\n+ if h:\n+ p = heapq.heappop(h)\n+ ans += p[1]\n \n print(ans)\n", "FL_content": " N, M = map(int, input().split())\n W = [tuple(map(int, input().split())) for i in range(N)]\n-W.sort(key=lambda x: -1000000*x[1]-x[0])\n \n-day = 0\n ans = 0\n-for i in range(N):\n- if M-day-W[i][0] >= 0:\n- ans += W[i][1]\n- day += 1\n- if day >= M:\n- break\n \n print(ans)\n", "added_lines": 11, "removed_lines": 8, "code1_lines": 14 }, { "user_id": "u756829954", "problem_id": "p02948", "submission1_id": "s398926151", "submission2_id": "s610647320", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def p_d():\n n, m = map(int, input().split())\n a = []\n b = []\n ans = 0\n\n for _ in range(n):\n s = list(map(int, input().split()))\n a.append(s[0])\n b.append(s[1])\n\n lv = [a[i] * b[i] for i in range(len(a))]\n li = sorted(zip(lv, a, b), reverse=True)\n\n for i in range(m):\n for j in range(len(li)):\n if li[j][1] <= m - i:\n ans += li.pop(j)[2]\n break\n\n print(ans)\n\n\nif __name__ == '__main__':\n p_d()\n", "code2": "from heapq import heappop, heappush\n\n\ndef p_d():\n n, m = map(int, input().split())\n ab = [tuple(map(int, input().split())) for _ in range(n)]\n\n ab.sort()\n ans = 0\n j = 0\n H = []\n\n for i in range(1, m + 1):\n while j < n and ab[j][0] <= i:\n heappush(H, -ab[j][1])\n j += 1\n\n if H:\n ans -= heappop(H)\n\n print(ans)\n\n\nif __name__ == '__main__':\n p_d()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565489931", "date2": "1565497334", "bleu_score": "0.6190288595937959", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 101, "total_score": 102, "input": "3 4\n4 3\n3 1\n2 4\n", "actual_output": "7\n", "expected_output": "8\n\n", "anno_code": ["def p_d(): # (0): p_d=\n n, m = map(int, input().split())\n a = []\n b = []\n ans = 0\n\n for _ in range(n):\n s = list(map(int, input().split()))\n a.append(s[0])\n b.append(s[1])\n\n lv = [a[i] * b[i] for i in range(len(a))]\n li = sorted(zip(lv, a, b), reverse=True)\n\n for i in range(m):\n for j in range(len(li)):\n if li[j][1] <= m - i:\n ans += li.pop(j)[2]\n break\n\n print(ans)\n\n\nif __name__ == '__main__':\n p_d()\n"], "anno_status": [true], "diff_content": "+from heapq import heappop, heappush\n+\n+\n def p_d():\n n, m = map(int, input().split())\n- a = []\n- b = []\n- ans = 0\n+ ab = [tuple(map(int, input().split())) for _ in range(n)]\n \n- for _ in range(n):\n- s = list(map(int, input().split()))\n- a.append(s[0])\n- b.append(s[1])\n+ ab.sort()\n+ ans = 0\n+ j = 0\n+ H = []\n \n- lv = [a[i] * b[i] for i in range(len(a))]\n- li = sorted(zip(lv, a, b), reverse=True)\n+ for i in range(1, m + 1):\n+ while j < n and ab[j][0] <= i:\n+ heappush(H, -ab[j][1])\n+ j += 1\n \n- for i in range(m):\n- for j in range(len(li)):\n- if li[j][1] <= m - i:\n- ans += li.pop(j)[2]\n- break\n+ if H:\n+ ans -= heappop(H)\n \n print(ans)\n \n \n if __name__ == '__main__':\n p_d()\n \n", "FL_content": " def p_d():\n n, m = map(int, input().split())\n- a = []\n- b = []\n- ans = 0\n \n- for _ in range(n):\n- s = list(map(int, input().split()))\n- a.append(s[0])\n- b.append(s[1])\n \n- lv = [a[i] * b[i] for i in range(len(a))]\n- li = sorted(zip(lv, a, b), reverse=True)\n \n- for i in range(m):\n- for j in range(len(li)):\n- if li[j][1] <= m - i:\n- ans += li.pop(j)[2]\n- break\n \n print(ans)\n \n \n if __name__ == '__main__':\n p_d()\n \n", "added_lines": 14, "removed_lines": 14, "code1_lines": 26 }, { "user_id": "u764600134", "problem_id": "p02948", "submission1_id": "s658620853", "submission2_id": "s150861604", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\n\n\nfrom heapq import heapify, heappop\n\ndef solve(N, M, jobs):\n heapify(jobs)\n ans = 0\n while jobs:\n B, A = heappop(jobs)\n A, B = -A, -B\n if M >= A:\n M -= 1\n ans += B\n return ans\n\n\ndef main(args):\n N, M = map(int, input().split())\n jobs = []\n for _ in range(N):\n A, B = map(int, input().split())\n jobs.append([-B, -A])\n ans = solve(N, M, jobs)\n print(ans)\n\n\nif __name__ == '__main__':\n main(sys.argv[1:])\n", "code2": "\n\nimport sys\n\n\nfrom heapq import heapify, heappop, heappush\n\ndef solve(N, M, jobs):\n heapify(jobs)\n availables = []\n ans = 0\n for day in range(1, M+1):\n while jobs and jobs[0][0] <= day:\n A, B = heappop(jobs)\n heappush(availables, (-B))\n if availables:\n ans -= heappop(availables)\n return ans\n\n\ndef main(args):\n N, M = map(int, input().split())\n jobs = []\n for _ in range(N):\n A, B = map(int, input().split())\n jobs.append((A, B))\n ans = solve(N, M, jobs)\n print(ans)\n\n\nif __name__ == '__main__':\n main(sys.argv[1:])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584316205", "date2": "1584317520", "bleu_score": "0.7635762077339971", "code1_test_status": [1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 98, "total_score": 102, "input": "3 4\n4 3\n3 0\n2 4\n", "actual_output": "4\n", "expected_output": "7\n\n", "anno_code": ["\n\nimport sys\n\n\nfrom heapq import heapify, heappop\n\ndef solve(N, M, jobs): # (0): solve=\n heapify(jobs)\n ans = 0\n while jobs:\n B, A = heappop(jobs)\n A, B = -A, -B\n if M >= A:\n M -= 1\n ans += B\n return ans\n\n\ndef main(args): # (1): main=\n N, M = map(int, input().split())\n jobs = []\n for _ in range(N):\n A, B = map(int, input().split())\n jobs.append([-B, -A])\n ans = solve(N, M, jobs)\n print(ans)\n\n\nif __name__ == '__main__':\n main(sys.argv[1:])\n"], "anno_status": [true], "diff_content": " \n \n import sys\n \n \n-from heapq import heapify, heappop\n+from heapq import heapify, heappop, heappush\n \n def solve(N, M, jobs):\n heapify(jobs)\n+ availables = []\n ans = 0\n- while jobs:\n- B, A = heappop(jobs)\n- A, B = -A, -B\n- if M >= A:\n- M -= 1\n- ans += B\n+ for day in range(1, M+1):\n+ while jobs and jobs[0][0] <= day:\n+ A, B = heappop(jobs)\n+ heappush(availables, (-B))\n+ if availables:\n+ ans -= heappop(availables)\n return ans\n \n \n def main(args):\n N, M = map(int, input().split())\n jobs = []\n for _ in range(N):\n A, B = map(int, input().split())\n- jobs.append([-B, -A])\n+ jobs.append((A, B))\n ans = solve(N, M, jobs)\n print(ans)\n \n \n if __name__ == '__main__':\n main(sys.argv[1:])\n \n", "FL_content": " \n \n import sys\n \n \n-from heapq import heapify, heappop\n \n def solve(N, M, jobs):\n heapify(jobs)\n ans = 0\n- while jobs:\n- B, A = heappop(jobs)\n- A, B = -A, -B\n- if M >= A:\n- M -= 1\n- ans += B\n return ans\n \n \n def main(args):\n N, M = map(int, input().split())\n jobs = []\n for _ in range(N):\n A, B = map(int, input().split())\n- jobs.append([-B, -A])\n ans = solve(N, M, jobs)\n print(ans)\n \n \n if __name__ == '__main__':\n main(sys.argv[1:])\n \n", "added_lines": 9, "removed_lines": 8, "code1_lines": 32 }, { "user_id": "u498511622", "problem_id": "p02420", "submission1_id": "s035326002", "submission2_id": "s721968323", "status1": "Wrong Answer", "status2": "Accepted", "code1": "al=input()\nm=int(input())\nfor i in range(m):\n n = int(input())\n if n=='-':\n break\n else:\n al= al[n:] + al[:n]\nprint(al)", "code2": "while True:\n al=input()\n if al=='-':\n break\n else:\n m=int(input())\n for i in range(m):\n n = int(input())\n al= al[n:] + al[:n]\n print(al)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1502023821", "date2": "1502023963", "bleu_score": "0.7988446762118908", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "a`ac\n3\n1\n4\n1\nvwxzz\n2\n0\n1\n-\n", "actual_output": "aca`\n", "expected_output": "aca`\nwxzzv\n\n", "anno_code": ["al=input() # (0): al=a`ac\nm=int(input()) # (1): m=3\nfor i in range(m): # (2): i=0 (6): i=1 ... (14): NO CHANGE\n n = int(input()) # (3): n=1 (7): n=4 (11): n=1\n if n=='-': # (4): NO CHANGE (8): NO CHANGE (12): NO CHANGE\n break\n else:\n al= al[n:] + al[:n] # (5): al=`aca (9): NO CHANGE (13): al=aca`\nprint(al)"], "anno_status": [true], "diff_content": "-al=input()\n-m=int(input())\n-for i in range(m):\n- n = int(input())\n- if n=='-':\n- break\n- else:\n+while True:\n+ al=input()\n+ if al=='-':\n+ break\n+ else:\n+ m=int(input())\n+ for i in range(m):\n+ n = int(input())\n al= al[n:] + al[:n]\n-print(al)\n+ print(al)\n", "FL_content": "-al=input()\n-m=int(input())\n-for i in range(m):\n- n = int(input())\n- if n=='-':\n- break\n- else:\n al= al[n:] + al[:n]\n-print(al)\n", "added_lines": 9, "removed_lines": 8, "code1_lines": 9 }, { "user_id": "u805716376", "problem_id": "p02420", "submission1_id": "s639450457", "submission2_id": "s246393668", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while 1:\n a = input()\n if a == '-':\n break\n n = int(input())\n for i in range(n):\n h = int(input())\n a = a[h:] + a[:h]\n print(a)\n print(a)\n", "code2": "while 1:\n a = input()\n if a == '-':\n break\n n = int(input())\n for i in range(n):\n h = int(input())\n a = a[h:] + a[:h]\n print(a)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556724141", "date2": "1556724212", "bleu_score": "0.9015330854347995", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "aaac\n3\n1\n0\n2\nvyxyz\n2\n1\n5\n-\n", "actual_output": "aaca\naaca\ncaaa\ncaaa\nyxyzv\nyxyzv\nyxyzv\n", "expected_output": "caaa\nyxyzv\n\n", "anno_code": ["while 1: # (0): NO CHANGE (18): NO CHANGE (32): NO CHANGE\n a = input() # (1): a=aaac (19): a=vyxyz (33): a=-\n if a == '-': # (2): NO CHANGE (20): NO CHANGE (34): NO CHANGE\n break\n n = int(input()) # (3): n=3 (21): n=2\n for i in range(n): # (4): i=0 (8): i=1 ... (30): NO CHANGE\n h = int(input()) # (5): h=1 (9): h=0 ... (27): h=5\n a = a[h:] + a[:h] # (6): a=aaca (10): NO CHANGE ... (28): NO CHANGE\n print(a) # (7): NO CHANGE (11): NO CHANGE ... (29): NO CHANGE\n print(a) # (17): NO CHANGE (31): NO CHANGE\n"], "anno_status": [true], "diff_content": " while 1:\n a = input()\n if a == '-':\n break\n n = int(input())\n for i in range(n):\n h = int(input())\n a = a[h:] + a[:h]\n- print(a)\n print(a)\n \n", "FL_content": " while 1:\n a = input()\n if a == '-':\n break\n n = int(input())\n for i in range(n):\n h = int(input())\n a = a[h:] + a[:h]\n- print(a)\n print(a)\n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u067975558", "problem_id": "p02420", "submission1_id": "s466443071", "submission2_id": "s462606582", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = []\nn = []\nwhile True:\n hoge = input()\n if len(hoge) == 1:\n if hoge == '-':\n break\n s[0] = s[0].replace(s[0],s[0][int(hoge):]+s[0][:int(hoge)])\n else:\n s += [hoge]\nfor i in s: print(i)", "code2": "s = []\nwhile True:\n hoge = input()\n if hoge == '-':\n break\n num = int(input())\n for i in range(num):\n h = int(input())\n hoge = hoge.replace(hoge,hoge[h:] + hoge[:h])\n s += [hoge]\nfor i in s: print(i)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1423192587", "date2": "1423198398", "bleu_score": "0.6903926189370615", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "caaa\n3\n1\n-2\n2\nwwxyz\n2\n3\n4\n-\n", "actual_output": "acaa\n-2\nwwxyz\n", "expected_output": "aaac\nxyzww\n\n", "anno_code": ["s = [] # (0): s=[]\nn = [] # (1): n=[]\nwhile True: # (2): NO CHANGE (6): NO CHANGE ... (44): NO CHANGE\n hoge = input() # (3): hoge=caaa (7): hoge=3 ... (45): hoge=-\n if len(hoge) == 1: # (4): NO CHANGE (8): NO CHANGE ... (46): NO CHANGE\n if hoge == '-': # (9): NO CHANGE (14): NO CHANGE ... (47): NO CHANGE\n break # (48): NO CHANGE\n s[0] = s[0].replace(s[0],s[0][int(hoge):]+s[0][:int(hoge)]) # (10): s=['acaa'] (15): s=['caaa'] ... (43): NO CHANGE\n else:\n s += [hoge] # (5): s=['caaa'] (19): s=['caaa', '-2'] (28): s=['aaca', '-2', 'wwxyz']\nfor i in s: print(i) # (49): i=acaa (50): i=-2 (51): i=wwxyz\n"], "anno_status": [true], "diff_content": " s = []\n-n = []\n while True:\n hoge = input()\n- if len(hoge) == 1:\n- if hoge == '-':\n- break\n- s[0] = s[0].replace(s[0],s[0][int(hoge):]+s[0][:int(hoge)])\n- else:\n- s += [hoge]\n+ if hoge == '-':\n+ break\n+ num = int(input())\n+ for i in range(num):\n+ h = int(input())\n+ hoge = hoge.replace(hoge,hoge[h:] + hoge[:h])\n+ s += [hoge]\n for i in s: print(i)\n", "FL_content": " s = []\n-n = []\n while True:\n hoge = input()\n- if len(hoge) == 1:\n- if hoge == '-':\n- break\n- s[0] = s[0].replace(s[0],s[0][int(hoge):]+s[0][:int(hoge)])\n- else:\n- s += [hoge]\n for i in s: print(i)\n", "added_lines": 7, "removed_lines": 7, "code1_lines": 11 }, { "user_id": "u587193722", "problem_id": "p02420", "submission1_id": "s001213161", "submission2_id": "s135208956", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n s = input()\n if s == '-':\n break\n m = int(input())\n for mi in range(m):\n h = int(input())\n\n s = s[:h] + s[h:]\n print(s)", "code2": "while True:\n s = input()\n if s == '-':\n break\n m = int(input())\n for mi in range(m):\n h = int(input())\n\n s = s[h:] + s[:h]\n print(s)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1470290490", "date2": "1470290690", "bleu_score": "0.990876258870529", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0], "code1_test_score": 7, "total_score": 101, "input": "caaa\n3\n2\n0\n2\nvwxyz\n2\n3\n1\n-\n", "actual_output": "caaa\nvwxyz\n", "expected_output": "caaa\nzvwxy\n\n", "anno_code": ["while True: # (0): NO CHANGE (15): NO CHANGE (27): NO CHANGE\n s = input() # (1): s=caaa (16): s=vwxyz (28): s=-\n if s == '-': # (2): NO CHANGE (17): NO CHANGE (29): NO CHANGE\n break\n m = int(input()) # (3): m=3 (18): m=2\n for mi in range(m): # (4): mi=0 (7): mi=1 ... (25): NO CHANGE\n h = int(input()) # (5): h=2 (8): h=0 ... (23): h=1\n\n s = s[:h] + s[h:] # (6): NO CHANGE (9): NO CHANGE ... (24): NO CHANGE\n print(s) # (14): NO CHANGE (26): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n s = input()\n if s == '-':\n break\n m = int(input())\n for mi in range(m):\n h = int(input())\n \n- s = s[:h] + s[h:]\n+ s = s[h:] + s[:h]\n print(s)\n", "FL_content": " while True:\n s = input()\n if s == '-':\n break\n m = int(input())\n for mi in range(m):\n h = int(input())\n \n- s = s[:h] + s[h:]\n print(s)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u671553883", "problem_id": "p02420", "submission1_id": "s193790289", "submission2_id": "s980398420", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n s = input()\n if s == '-':\n break\n\n m = int(input())\n for mi in range(m):\n h = int(input())\n s = s[:h] + s[h:]\n\n print(s)", "code2": "while True:\n s = input()\n if s == '-':\n break\n\n m = int(input())\n for mi in range(m):\n h = int(input())\n s = s[h:] + s[:h]\n\n print(s)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1470290403", "date2": "1470290440", "bleu_score": "0.9909314219443269", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0], "code1_test_score": 7, "total_score": 101, "input": "caaa\n3\n1\n-3\n2\nwwxyz\n2\n4\n4\n-\n", "actual_output": "caaa\nwwxyz\n", "expected_output": "caaa\nyzwwx\n\n", "anno_code": ["while True: # (0): NO CHANGE (15): NO CHANGE (27): NO CHANGE\n s = input() # (1): s=caaa (16): s=wwxyz (28): s=-\n if s == '-': # (2): NO CHANGE (17): NO CHANGE (29): NO CHANGE\n break\n\n m = int(input()) # (3): m=3 (18): m=2\n for mi in range(m): # (4): mi=0 (7): mi=1 ... (25): NO CHANGE\n h = int(input()) # (5): h=1 (8): h=-3 ... (23): NO CHANGE\n s = s[:h] + s[h:] # (6): NO CHANGE (9): NO CHANGE ... (24): NO CHANGE\n\n print(s) # (14): NO CHANGE (26): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n s = input()\n if s == '-':\n break\n \n m = int(input())\n for mi in range(m):\n h = int(input())\n- s = s[:h] + s[h:]\n+ s = s[h:] + s[:h]\n \n print(s)\n", "FL_content": " while True:\n s = input()\n if s == '-':\n break\n \n m = int(input())\n for mi in range(m):\n h = int(input())\n- s = s[:h] + s[h:]\n \n print(s)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u535719732", "problem_id": "p02420", "submission1_id": "s603580998", "submission2_id": "s431146096", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n data = input()\n if(data == \"-\"):break\n m = int(input())\n tmp = []\n flag = False\n for i in range(m):\n num = int(input())\n if(flag):\n tmp = data[num:] + data[:num] \n flag = True\n data = \"\"\n else:\n data = tmp[num:] + tmp[:num]\n flag = False\n tmp = \"\"\n", "code2": "while True:\n data = input()\n if(data == \"-\"):break\n m = int(input())\n tmp = []\n\n for i in range(m):\n num = int(input())\n if(len(tmp) == 0):\n tmp = data[num:] + data[:num]\n data = \"\"\n else:\n data = tmp[num:] + tmp[:num]\n tmp = \"\"\n if(data): print(data)\n else: print(tmp)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1559296290", "date2": "1559297037", "bleu_score": "0.8286454418725804", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "aaac\n3\n1\n2\n2\nvxxyz\n2\n3\n4\n-\n", "actual_output": "", "expected_output": "aaca\nxyzvx\n\n", "anno_code": ["while True: # (0): NO CHANGE (25): NO CHANGE (44): NO CHANGE\n data = input() # (1): data=aaac (26): data=vxxyz (45): data=-\n if(data == \"-\"):break # (2): NO CHANGE (27): NO CHANGE\n m = int(input()) # (3): m=3 (28): m=2\n tmp = [] # (4): tmp=[] (29): tmp=[]\n flag = False # (5): flag=False (30): NO CHANGE\n for i in range(m): # (6): i=0 (12): i=1 ... (43): NO CHANGE\n num = int(input()) # (7): num=1 (13): num=2 ... (38): num=4\n if(flag): # (8): NO CHANGE (14): NO CHANGE ... (39): NO CHANGE\n tmp = data[num:] + data[:num] \n flag = True\n data = \"\"\n else:\n data = tmp[num:] + tmp[:num] # (9): data=[] (15): data= ... (40): data=\n flag = False # (10): NO CHANGE (16): NO CHANGE ... (41): NO CHANGE\n tmp = \"\" # (11): tmp= (17): NO CHANGE ... (42): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n data = input()\n if(data == \"-\"):break\n m = int(input())\n tmp = []\n- flag = False\n+\n for i in range(m):\n num = int(input())\n- if(flag):\n- tmp = data[num:] + data[:num] \n- flag = True\n+ if(len(tmp) == 0):\n+ tmp = data[num:] + data[:num]\n data = \"\"\n else:\n data = tmp[num:] + tmp[:num]\n- flag = False\n tmp = \"\"\n+ if(data): print(data)\n+ else: print(tmp)\n \n", "FL_content": " while True:\n data = input()\n if(data == \"-\"):break\n m = int(input())\n tmp = []\n- flag = False\n for i in range(m):\n num = int(input())\n- if(flag):\n- tmp = data[num:] + data[:num] \n- flag = True\n data = \"\"\n else:\n data = tmp[num:] + tmp[:num]\n- flag = False\n tmp = \"\"\n \n", "added_lines": 5, "removed_lines": 5, "code1_lines": 17 }, { "user_id": "u986478725", "problem_id": "p02420", "submission1_id": "s643214879", "submission2_id": "s245245936", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\ndef numinput():\n a = input().split()\n for i in range(len(a)):\n a[i] = int(a[i])\n return a\n\ndef main():\n while True:\n string = input()\n if string == \"-\": break\n n = int(input()) \n for i in range(n):\n h = int(input())\n front = string[0 : h]\n back = string[h : len(string) - h]\n string = back + front\n print(string)\n\nif __name__ == \"__main__\":\n main()\n", "code2": "\n\ndef main():\n while True:\n string = input()\n if string == \"-\": break\n n = int(input()) \n for i in range(n):\n h = int(input())\n front = string[0 : h] \n back = string[h : len(string)] \n string = back + front\n print(string)\n\nif __name__ == \"__main__\":\n main()\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1527343884", "date2": "1527344466", "bleu_score": "0.7211265111950147", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "acaa\n3\n1\n0\n2\nyzxwv\n2\n2\n2\n-\n", "actual_output": "ca\nxy\n", "expected_output": "aaca\nvyzxw\n\n", "anno_code": ["\n\ndef numinput(): # (0): numinput=\n a = input().split()\n for i in range(len(a)):\n a[i] = int(a[i])\n return a\n\ndef main(): # (1): main=\n while True:\n string = input()\n if string == \"-\": break\n n = int(input()) \n for i in range(n):\n h = int(input())\n front = string[0 : h]\n back = string[h : len(string) - h]\n string = back + front\n print(string)\n\nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " \n \n-def numinput():\n- a = input().split()\n- for i in range(len(a)):\n- a[i] = int(a[i])\n- return a\n-\n def main():\n while True:\n string = input()\n if string == \"-\": break\n n = int(input()) \n for i in range(n):\n h = int(input())\n- front = string[0 : h]\n- back = string[h : len(string) - h]\n+ front = string[0 : h] \n+ back = string[h : len(string)] \n string = back + front\n print(string)\n \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": " \n \n-def numinput():\n- a = input().split()\n- for i in range(len(a)):\n- a[i] = int(a[i])\n- return a\n-\n def main():\n while True:\n string = input()\n if string == \"-\": break\n n = int(input()) \n for i in range(n):\n h = int(input())\n- front = string[0 : h]\n- back = string[h : len(string) - h]\n string = back + front\n print(string)\n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 2, "removed_lines": 8, "code1_lines": 23 }, { "user_id": "u198574985", "problem_id": "p02420", "submission1_id": "s591516738", "submission2_id": "s305785355", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n\n string = str(input())\n box = \"\"\n \n \n if string == \"-\":\n break\n \n shuffle = int(input())\n\n h = [0]*shuffle\n\n for a in range(shuffle):\n h[a] = int(input())\n\n for b in range(shuffle):\n box = string[0:h[b]]\n string = string[h[b]:]\n string = string+box\n box = \"\"\n print(string)\n\n print(string)\n", "code2": "while True:\n\n string = str(input())\n box = \"\"\n \n \n if string == \"-\":\n break\n \n shuffle = int(input())\n\n h = [0]*shuffle\n\n for a in range(shuffle):\n h[a] = int(input())\n\n for b in range(shuffle):\n box = string[0:h[b]]\n string = string[h[b]:]\n string = string+box\n box = \"\"\n\n print(string)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1545337568", "date2": "1545337595", "bleu_score": "0.939232427678793", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "aaac\n3\n1\n2\n1\nvwxyz\n2\n2\n4\n-\n", "actual_output": "aaca\ncaaa\naaac\naaac\nxyzvw\nwxyzv\nwxyzv\n", "expected_output": "aaac\nwxyzv\n\n", "anno_code": ["while True: # (0): NO CHANGE (33): NO CHANGE (58): NO CHANGE\n\n string = str(input()) # (1): string=aaac (34): string=vwxyz (59): string=-\n box = \"\" # (2): box= (35): NO CHANGE (60): NO CHANGE\n \n \n if string == \"-\": # (3): NO CHANGE (36): NO CHANGE (61): NO CHANGE\n break\n \n shuffle = int(input()) # (4): shuffle=3 (37): shuffle=2\n\n h = [0]*shuffle # (5): h=[0, 0, 0] (38): h=[0, 0]\n\n for a in range(shuffle): # (6): a=0 (8): a=1 ... (43): NO CHANGE\n h[a] = int(input()) # (7): h=[1, 0, 0] (9): h=[1, 2, 0] ... (42): h=[2, 4]\n\n for b in range(shuffle): # (13): b=0 (19): b=1 ... (56): NO CHANGE\n box = string[0:h[b]] # (14): box=a (20): box=aa ... (51): box=xyzv\n string = string[h[b]:] # (15): string=aac (21): string=ca ... (52): string=w\n string = string+box # (16): string=aaca (22): string=caaa ... (53): string=wxyzv\n box = \"\" # (17): box= (23): box= ... (54): box=\n print(string) # (18): NO CHANGE (24): NO CHANGE ... (55): NO CHANGE\n\n print(string) # (32): NO CHANGE (57): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n \n string = str(input())\n box = \"\"\n \n \n if string == \"-\":\n break\n \n shuffle = int(input())\n \n h = [0]*shuffle\n \n for a in range(shuffle):\n h[a] = int(input())\n \n for b in range(shuffle):\n box = string[0:h[b]]\n string = string[h[b]:]\n string = string+box\n box = \"\"\n- print(string)\n \n print(string)\n \n", "FL_content": " while True:\n \n string = str(input())\n box = \"\"\n \n \n if string == \"-\":\n break\n \n shuffle = int(input())\n \n h = [0]*shuffle\n \n for a in range(shuffle):\n h[a] = int(input())\n \n for b in range(shuffle):\n box = string[0:h[b]]\n string = string[h[b]:]\n string = string+box\n box = \"\"\n- print(string)\n \n print(string)\n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 25 }, { "user_id": "u088337682", "problem_id": "p02420", "submission1_id": "s660259242", "submission2_id": "s892620699", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n S = input()\n if S == \"-\":break\n m = int(input())\n sum = 0\n for i in range(m):sum+=int(input())\n if sum%len(S)==0:print(S)\n else:\n print(S[len(S)-sum%len(S)-1:]+S[:len(S)-sum%len(S)-1])\n", "code2": "while True:\n S = input()\n if S == \"-\":break\n m = int(input())\n sum = 0\n for i in range(m):sum+=int(input())\n if sum%len(S)==0:print(S)\n else:\n print(S[sum%len(S):]+S[:sum%len(S)])\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1545579311", "date2": "1545622715", "bleu_score": "0.8901200860814824", "code1_test_status": [1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1], "code1_test_score": 16, "total_score": 101, "input": "ca`a\n3\n1\n3\n2\nvwxyz\n2\n2\n4\n-\n", "actual_output": "a`ac\nyzvwx\n", "expected_output": "`aca\nwxyzv\n\n", "anno_code": ["while True: # (0): NO CHANGE (11): NO CHANGE (21): NO CHANGE\n S = input() # (1): S=ca`a (12): S=vwxyz (22): S=-\n if S == \"-\":break # (2): NO CHANGE (13): NO CHANGE\n m = int(input()) # (3): m=3 (14): m=2\n sum = 0 # (4): sum=0 (15): sum=0\n for i in range(m):sum+=int(input()) # (5): sum=1, i=0 (6): sum=4, i=1 ... (18): NO CHANGE\n if sum%len(S)==0:print(S) # (9): NO CHANGE (19): NO CHANGE\n else:\n print(S[len(S)-sum%len(S)-1:]+S[:len(S)-sum%len(S)-1]) # (10): NO CHANGE (20): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n S = input()\n if S == \"-\":break\n m = int(input())\n sum = 0\n for i in range(m):sum+=int(input())\n if sum%len(S)==0:print(S)\n else:\n- print(S[len(S)-sum%len(S)-1:]+S[:len(S)-sum%len(S)-1])\n+ print(S[sum%len(S):]+S[:sum%len(S)])\n \n", "FL_content": " while True:\n S = input()\n if S == \"-\":break\n m = int(input())\n sum = 0\n for i in range(m):sum+=int(input())\n if sum%len(S)==0:print(S)\n else:\n- print(S[len(S)-sum%len(S)-1:]+S[:len(S)-sum%len(S)-1])\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u350064373", "problem_id": "p02420", "submission1_id": "s325884976", "submission2_id": "s550826854", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n card = input()\n if card == \"-\":\n break\n for i in range(int(input())):\n h = int(input())\n card = card.lstrip(card[:h]) + card[:h]\n print(card)", "code2": "while True:\n card = input()\n if card == \"-\":\n break\n for i in range(int(input())):\n h = int(input())\n card = card[h:] + card[:h]\n print(card)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1502022130", "date2": "1502022891", "bleu_score": "0.9076780349496731", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0], "code1_test_score": 22, "total_score": 101, "input": "caaa\n3\n2\n0\n2\nvwxyz\n2\n1\n0\n-\n", "actual_output": "ca\nwxyzv\n", "expected_output": "caaa\nwxyzv\n\n", "anno_code": ["while True: # (0): NO CHANGE (14): NO CHANGE (25): NO CHANGE\n card = input() # (1): card=caaa (15): card=vwxyz (26): card=-\n if card == \"-\": # (2): NO CHANGE (16): NO CHANGE (27): NO CHANGE\n break\n for i in range(int(input())): # (3): i=0 (6): i=1 ... (23): NO CHANGE\n h = int(input()) # (4): h=2 (7): h=0 ... (21): h=0\n card = card.lstrip(card[:h]) + card[:h] # (5): card=ca (8): NO CHANGE ... (22): NO CHANGE\n print(card) # (13): NO CHANGE (24): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n card = input()\n if card == \"-\":\n break\n for i in range(int(input())):\n h = int(input())\n- card = card.lstrip(card[:h]) + card[:h]\n+ card = card[h:] + card[:h]\n print(card)\n", "FL_content": " while True:\n card = input()\n if card == \"-\":\n break\n for i in range(int(input())):\n h = int(input())\n- card = card.lstrip(card[:h]) + card[:h]\n print(card)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u811709035", "problem_id": "p02639", "submission1_id": "s210042147", "submission2_id": "s731940192", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nn = []\n\nn = input().split()\n\nfor i in range(5):\n n[i] = int(n[i])\n\nprint(n)\nfor i in range(5):\n if n[i] == 0:\n print(i+1)", "code2": "\nn = []\n\nn = input().split()\n\nfor i in range(5):\n n[i] = int(n[i])\n\nfor i in range(5):\n if n[i] == 0:\n print(i+1)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592183719", "date2": "1592183869", "bleu_score": "0.9253795267496048", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "[0, 2, 3, 4, 5]\n1\n", "expected_output": "1\n", "anno_code": ["\nn = [] # (0): n=[]\n\nn = input().split() # (1): n=['0', '2', '3', '4', '5']\n\nfor i in range(5): # (2): i=0 (4): i=1 ... (12): NO CHANGE\n n[i] = int(n[i]) # (3): NO CHANGE (5): NO CHANGE ... (11): n=[0, 2, 3, 4, 5]\n\nprint(n) # (13): NO CHANGE\nfor i in range(5): # (14): i=0 (17): i=1 ... (23): i=4\n if n[i] == 0: # (15): NO CHANGE (18): NO CHANGE ... (24): NO CHANGE\n print(i+1) # (16): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n n = []\n \n n = input().split()\n \n for i in range(5):\n n[i] = int(n[i])\n \n-print(n)\n for i in range(5):\n if n[i] == 0:\n print(i+1)\n", "FL_content": " \n n = []\n \n n = input().split()\n \n for i in range(5):\n n[i] = int(n[i])\n \n-print(n)\n for i in range(5):\n if n[i] == 0:\n print(i+1)\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 12 }, { "user_id": "u149475724", "problem_id": "p02639", "submission1_id": "s802544753", "submission2_id": "s902163887", "status1": "Wrong Answer", "status2": "Accepted", "code1": "user_input = list(map(int, input().split()))\n\n\nindexOfZero = [x for x in range(0, 5) if user_input[x] == 0]\nprint(indexOfZero[0])", "code2": "user_input = list(map(int, input().split()))\n\n\nindexOfZero = [x for x in range(0, 5) if user_input[x] == 0]\nprint(indexOfZero[0] + 1)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597735042", "date2": "1597735137", "bleu_score": "0.9638477598135974", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "0\n", "expected_output": "1\n", "anno_code": ["user_input = list(map(int, input().split())) # (0): user_input=[0, 2, 3, 4, 5]\n\n\nindexOfZero = [x for x in range(0, 5) if user_input[x] == 0] # (1): indexOfZero=[0]\nprint(indexOfZero[0])"], "anno_status": [true], "diff_content": " user_input = list(map(int, input().split()))\n \n \n indexOfZero = [x for x in range(0, 5) if user_input[x] == 0]\n-print(indexOfZero[0])\n+print(indexOfZero[0] + 1)\n", "FL_content": " user_input = list(map(int, input().split()))\n \n \n indexOfZero = [x for x in range(0, 5) if user_input[x] == 0]\n-print(indexOfZero[0])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u334533374", "problem_id": "p02639", "submission1_id": "s455392214", "submission2_id": "s069762653", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x = map(int,input().split())\ny =15\nprint(y)\nprint(y-sum(x))", "code2": "x = map(int,input().split())\ny =15\nprint(y-sum(x))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592228187", "date2": "1592228216", "bleu_score": "0.8352702114112719", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "15\n1\n", "expected_output": "1\n", "anno_code": ["x = map(int,input().split()) # (0): x=\ny =15 # (1): y=15\nprint(y) # (2): NO CHANGE\nprint(y-sum(x))"], "anno_status": [true], "diff_content": " x = map(int,input().split())\n y =15\n-print(y)\n print(y-sum(x))\n", "FL_content": " x = map(int,input().split())\n y =15\n-print(y)\n print(y-sum(x))\n", "added_lines": 0, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u854931881", "problem_id": "p02639", "submission1_id": "s838409936", "submission2_id": "s274082340", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=list(map(int,input().split()))\nfor i in range(len(n)):\n if n[i]==0:\n print(i)\n break", "code2": "n=list(map(int,input().split()))\nfor i in range(len(n)):\n if n[i]==0:\n print(i+1)\n break", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598462929", "date2": "1598462972", "bleu_score": "0.9601961388479883", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "0\n", "expected_output": "1\n", "anno_code": ["n=list(map(int,input().split())) # (0): n=[0, 2, 3, 4, 5]\nfor i in range(len(n)): # (1): i=0\n if n[i]==0: # (2): NO CHANGE\n print(i) # (3): NO CHANGE\n break"], "anno_status": [true], "diff_content": " n=list(map(int,input().split()))\n for i in range(len(n)):\n if n[i]==0:\n- print(i)\n+ print(i+1)\n break\n", "FL_content": " n=list(map(int,input().split()))\n for i in range(len(n)):\n if n[i]==0:\n- print(i)\n break\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u389188163", "problem_id": "p02639", "submission1_id": "s408380405", "submission2_id": "s529852030", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x1, x2, x3, x4, x5 = map(int, input().split())\n\nl = [x1, x2, x3, x4, x5]\nls = [str(n) for n in l]\ns = ''.join(ls).find('0')\nprint(s)", "code2": "x1, x2, x3, x4, x5 = map(int, input().split())\n\nl = [x1, x2, x3, x4, x5]\nls = [str(n) for n in l]\ns = ''.join(ls).find('0')\nprint(s+1)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592270409", "date2": "1592270534", "bleu_score": "0.9792167288591885", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "0\n", "expected_output": "1\n", "anno_code": ["x1, x2, x3, x4, x5 = map(int, input().split()) # (0): x1=0, x2=2, x3=3, x4=4, x5=5\n\nl = [x1, x2, x3, x4, x5] # (1): l=[0, 2, 3, 4, 5]\nls = [str(n) for n in l] # (2): ls=['0', '2', '3', '4', '5']\ns = ''.join(ls).find('0') # (3): s=0\nprint(s)"], "anno_status": [true], "diff_content": " x1, x2, x3, x4, x5 = map(int, input().split())\n \n l = [x1, x2, x3, x4, x5]\n ls = [str(n) for n in l]\n s = ''.join(ls).find('0')\n-print(s)\n+print(s+1)\n", "FL_content": " x1, x2, x3, x4, x5 = map(int, input().split())\n \n l = [x1, x2, x3, x4, x5]\n ls = [str(n) for n in l]\n s = ''.join(ls).find('0')\n-print(s)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u930847736", "problem_id": "p02639", "submission1_id": "s706022455", "submission2_id": "s098853308", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x = list(map(int, input().split()))\nif x[0] == 0: print(1)\nif x[1] == 0: print(2)\nif x[2] == 0: print(3)\nif x[3] == 0: print(4)\nif x[4]: print(5)", "code2": "x = list(map(int, input().split()))\nif x[0] == 0: print(1)\nif x[1] == 0: print(2)\nif x[2] == 0: print(3)\nif x[3] == 0: print(4)\nif x[4] == 0: print(5)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592458155", "date2": "1592458193", "bleu_score": "0.9561374825240697", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "1\n5\n", "expected_output": "1\n", "anno_code": ["x = list(map(int, input().split())) # (0): x=[0, 2, 3, 4, 5]\nif x[0] == 0: print(1) # (1): NO CHANGE\nif x[1] == 0: print(2) # (2): NO CHANGE\nif x[2] == 0: print(3) # (3): NO CHANGE\nif x[3] == 0: print(4) # (4): NO CHANGE\nif x[4]: print(5)"], "anno_status": [true], "diff_content": " x = list(map(int, input().split()))\n if x[0] == 0: print(1)\n if x[1] == 0: print(2)\n if x[2] == 0: print(3)\n if x[3] == 0: print(4)\n-if x[4]: print(5)\n+if x[4] == 0: print(5)\n", "FL_content": " x = list(map(int, input().split()))\n if x[0] == 0: print(1)\n if x[1] == 0: print(2)\n if x[2] == 0: print(3)\n if x[3] == 0: print(4)\n-if x[4]: print(5)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u497158316", "problem_id": "p02639", "submission1_id": "s961880649", "submission2_id": "s752436382", "status1": "Wrong Answer", "status2": "Accepted", "code1": "num = input().split()\nfor i in range(0,len(num)):\n if num[i] == 0:\n print(i+1)\n ", "code2": "num = input().split()\nfor i in range(0,len(num)):\n if int(num[i]) == 0:\n print(i+1)\n \n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592182914", "date2": "1592182967", "bleu_score": "0.898729961522176", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "", "expected_output": "1\n", "anno_code": ["num = input().split() # (0): num=['0', '2', '3', '4', '5']\nfor i in range(0,len(num)): # (1): i=0 (3): i=1 ... (9): i=4\n if num[i] == 0: # (2): NO CHANGE (4): NO CHANGE ... (10): NO CHANGE\n print(i+1)\n "], "anno_status": [true], "diff_content": " num = input().split()\n for i in range(0,len(num)):\n- if num[i] == 0:\n+ if int(num[i]) == 0:\n print(i+1)\n \n+\n", "FL_content": " num = input().split()\n for i in range(0,len(num)):\n- if num[i] == 0:\n print(i+1)\n \n", "added_lines": 2, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u362127784", "problem_id": "p02639", "submission1_id": "s714891394", "submission2_id": "s213001171", "status1": "Wrong Answer", "status2": "Accepted", "code1": "li = list(map(int,input().split()))\nfor i in range(0,5):\n if li[i] == 0:\n print(i)", "code2": "li = list(map(int,input().split()))\nfor i in range(0,5):\n if li[i] == 0:\n print(i + 1)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592182872", "date2": "1592182938", "bleu_score": "0.9462563573746322", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "0\n", "expected_output": "1\n", "anno_code": ["li = list(map(int,input().split())) # (0): li=[0, 2, 3, 4, 5]\nfor i in range(0,5): # (1): i=0 (4): i=1 ... (10): i=4\n if li[i] == 0: # (2): NO CHANGE (5): NO CHANGE ... (11): NO CHANGE\n print(i) # (3): NO CHANGE\n"], "anno_status": [true], "diff_content": " li = list(map(int,input().split()))\n for i in range(0,5):\n if li[i] == 0:\n- print(i)\n+ print(i + 1)\n", "FL_content": " li = list(map(int,input().split()))\n for i in range(0,5):\n if li[i] == 0:\n- print(i)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 4 }, { "user_id": "u055244973", "problem_id": "p02639", "submission1_id": "s005950643", "submission2_id": "s472282425", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C, D, E = map(int, input().split())\n\nresult = 15 - (A+B+C+D+E)", "code2": "A, B, C, D, E = map(int, input().split())\n\nresult = 15 - (A+B+C+D+E)\nprint(result)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592183562", "date2": "1592183637", "bleu_score": "0.8159123638897062", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "", "expected_output": "1\n", "anno_code": ["A, B, C, D, E = map(int, input().split()) # (0): A=0, B=2, C=3, D=4, E=5\n\nresult = 15 - (A+B+C+D+E)"], "anno_status": [true], "diff_content": " A, B, C, D, E = map(int, input().split())\n \n result = 15 - (A+B+C+D+E)\n+print(result)\n+\n", "FL_content": " A, B, C, D, E = map(int, input().split())\n \n result = 15 - (A+B+C+D+E)\n", "added_lines": 2, "removed_lines": 0, "code1_lines": 3 }, { "user_id": "u683956577", "problem_id": "p02639", "submission1_id": "s965300566", "submission2_id": "s247381250", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nstdin = sys.stdin\n\nni = lambda: int(ns())\nna = lambda: list(map(int, stdin.readline().split()))\nns = lambda: stdin.readline().rstrip() \n\nx = na()\nc = 0\nfor i in x:\n c += 1\n if i == 0:\n c = i\nprint(c+1)\n", "code2": "import sys\n\nstdin = sys.stdin\n\nni = lambda: int(ns())\nna = lambda: list(map(int, stdin.readline().split()))\nns = lambda: stdin.readline().rstrip() \n\nx = na()\n\nfor i in range(5):\n if x[i] == 0:\n print(i+1)\n \n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592183060", "date2": "1592183247", "bleu_score": "0.8706408567973304", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "5\n", "expected_output": "1\n", "anno_code": ["import sys\n\nstdin = sys.stdin # (0): stdin=<_io.TextIOWrapper name='../../test/autoComment2\\\\Dev\\\\p02639\\\\input_s965300566.txt' mode='r' encoding='utf-8'>\n\nni = lambda: int(ns()) # (1): ni= at 0x0000021FF84F9BD0>\nna = lambda: list(map(int, stdin.readline().split())) # (2): na= at 0x0000021FF84F9B40>\nns = lambda: stdin.readline().rstrip() # (3): ns= at 0x0000021FF84F9C60>\n\nx = na() # (4): x=[0, 2, 3, 4, 5]\nc = 0 # (5): c=0\nfor i in x: # (6): i=0 (10): i=2 ... (22): NO CHANGE\n c += 1 # (7): c=1 (11): c=1 ... (20): c=4\n if i == 0: # (8): NO CHANGE (12): NO CHANGE ... (21): NO CHANGE\n c = i # (9): c=0\nprint(c+1)\n"], "anno_status": [true], "diff_content": " import sys\n \n stdin = sys.stdin\n \n ni = lambda: int(ns())\n na = lambda: list(map(int, stdin.readline().split()))\n ns = lambda: stdin.readline().rstrip() \n \n x = na()\n-c = 0\n-for i in x:\n- c += 1\n- if i == 0:\n- c = i\n-print(c+1)\n+\n+for i in range(5):\n+ if x[i] == 0:\n+ print(i+1)\n+ \n \n", "FL_content": " import sys\n \n stdin = sys.stdin\n \n ni = lambda: int(ns())\n na = lambda: list(map(int, stdin.readline().split()))\n ns = lambda: stdin.readline().rstrip() \n \n x = na()\n-c = 0\n-for i in x:\n- c += 1\n- if i == 0:\n- c = i\n-print(c+1)\n \n", "added_lines": 5, "removed_lines": 6, "code1_lines": 16 }, { "user_id": "u321613164", "problem_id": "p02933", "submission1_id": "s424657122", "submission2_id": "s256675745", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\ns = input()\nif a >= 3200:\n print(s)\nelse:\n print(\"Red\")", "code2": "a = int(input())\ns = input()\nif a >= 3200:\n print(s)\nelse:\n print(\"red\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566697788", "date2": "1566697913", "bleu_score": "0.9651391201669045", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 101, "total_score": 103, "input": "3199\npink\n", "actual_output": "Red\n", "expected_output": "red\n", "anno_code": ["a = int(input()) # (0): a=3199\ns = input() # (1): s=pink\nif a >= 3200: # (2): NO CHANGE\n print(s)\nelse:\n print(\"Red\")"], "anno_status": [true], "diff_content": " a = int(input())\n s = input()\n if a >= 3200:\n print(s)\n else:\n- print(\"Red\")\n+ print(\"red\")\n", "FL_content": " a = int(input())\n s = input()\n if a >= 3200:\n print(s)\n else:\n- print(\"Red\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u511854420", "problem_id": "p02933", "submission1_id": "s338220890", "submission2_id": "s598332749", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\ns = input()\nif a < 3200:\n print(s)\nelse:\n print(\"red\")", "code2": "a = int(input())\ns = input()\nif a >= 3200:\n print(s)\nelse:\n print(\"red\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566349905", "date2": "1566349970", "bleu_score": "0.9513372234174611", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 1, "total_score": 103, "input": "4049\nqdd\n", "actual_output": "red\n", "expected_output": "qdd\n\n", "anno_code": ["a = int(input()) # (0): a=4049\ns = input() # (1): s=qdd\nif a < 3200: # (2): NO CHANGE\n print(s)\nelse:\n print(\"red\")"], "anno_status": [true], "diff_content": " a = int(input())\n s = input()\n-if a < 3200:\n+if a >= 3200:\n print(s)\n else:\n print(\"red\")\n", "FL_content": " a = int(input())\n s = input()\n-if a < 3200:\n print(s)\n else:\n print(\"red\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u114366889", "problem_id": "p02933", "submission1_id": "s931000513", "submission2_id": "s942892890", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\ns = str(input())\nif a > 3200:\n\tprint(s)\nelse:\n\tprint('red')", "code2": "a = int(input())\ns = str(input())\nif a >= 3200:\n\tprint(s)\nelse:\n\tprint('red')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566177028", "date2": "1566177123", "bleu_score": "0.9665395661812441", "code1_test_status": [1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1], "code1_test_score": 53, "total_score": 103, "input": "3200\nnhoo\n", "actual_output": "red\n", "expected_output": "nhoo\n\n", "anno_code": ["a = int(input()) # (0): a=3200\ns = str(input()) # (1): s=nhoo\nif a > 3200: # (2): NO CHANGE\n\tprint(s)\nelse:\n\tprint('red')"], "anno_status": [true], "diff_content": " a = int(input())\n s = str(input())\n-if a > 3200:\n+if a >= 3200:\n \tprint(s)\n else:\n \tprint('red')\n", "FL_content": " a = int(input())\n s = str(input())\n-if a > 3200:\n \tprint(s)\n else:\n \tprint('red')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u662449766", "problem_id": "p02933", "submission1_id": "s198789123", "submission2_id": "s556751469", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\ninput = sys.stdin.readline\n\n\ndef main():\n a = int(input())\n s = input().strip()\n print(\"red\" if a < 3200 else a)\n\n\nif __name__ == \"__main__\":\n main()\n", "code2": "import sys\n\ninput = sys.stdin.readline\n\n\ndef main():\n a = int(input())\n s = input().strip()\n print(\"red\" if a < 3200 else s)\n\n\nif __name__ == \"__main__\":\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566176572", "date2": "1566176649", "bleu_score": "0.9854426852008968", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 2, "total_score": 103, "input": "4049\nabp\n", "actual_output": "4049\n", "expected_output": "abp\n\n", "anno_code": ["import sys\n\ninput = sys.stdin.readline # (0): input=\n\n\ndef main(): # (1): main=\n a = int(input())\n s = input().strip()\n print(\"red\" if a < 3200 else a)\n\n\nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " import sys\n \n input = sys.stdin.readline\n \n \n def main():\n a = int(input())\n s = input().strip()\n- print(\"red\" if a < 3200 else a)\n+ print(\"red\" if a < 3200 else s)\n \n \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": " import sys\n \n input = sys.stdin.readline\n \n \n def main():\n a = int(input())\n s = input().strip()\n- print(\"red\" if a < 3200 else a)\n \n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 14 }, { "user_id": "u178432859", "problem_id": "p02933", "submission1_id": "s408028237", "submission2_id": "s623927079", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\nb = input()\nif a >= 3200:\n print(\"red\")\nelse:\n print(b)", "code2": "a = int(input())\nb = input()\nif a >= 3200:\n print(b)\nelse: \n print(\"red\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574119846", "date2": "1574119913", "bleu_score": "0.8987560303334583", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 1, "total_score": 103, "input": "4049\nbap\n", "actual_output": "red\n", "expected_output": "bap\n\n", "anno_code": ["a = int(input()) # (0): a=4049\nb = input() # (1): b=bap\nif a >= 3200: # (2): NO CHANGE\n print(\"red\")\nelse:\n print(b)"], "anno_status": [true], "diff_content": " a = int(input())\n b = input()\n if a >= 3200:\n- print(\"red\")\n-else:\n- print(b)\n+ print(b)\n+else: \n+ print(\"red\")\n", "FL_content": " a = int(input())\n b = input()\n if a >= 3200:\n- print(\"red\")\n-else:\n- print(b)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 6 }, { "user_id": "u603324902", "problem_id": "p02933", "submission1_id": "s087198533", "submission2_id": "s210709344", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\ns = str(input())\n\nif a <=3200:\n print(s)\nelse:\n print(\"red\")", "code2": "a = int(input())\ns = str(input())\n\nif a >=3200:\n print(s)\nelse:\n print(\"red\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566176797", "date2": "1566176913", "bleu_score": "0.9572799132941563", "code1_test_status": [0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0], "code1_test_score": 51, "total_score": 103, "input": "4049\nqdd\n", "actual_output": "red\n", "expected_output": "qdd\n\n", "anno_code": ["a = int(input()) # (0): a=4049\ns = str(input()) # (1): s=qdd\n\nif a <=3200: # (2): NO CHANGE\n print(s)\nelse:\n print(\"red\")"], "anno_status": [true], "diff_content": " a = int(input())\n s = str(input())\n \n-if a <=3200:\n+if a >=3200:\n print(s)\n else:\n print(\"red\")\n+\n", "FL_content": " a = int(input())\n s = str(input())\n \n-if a <=3200:\n print(s)\n else:\n print(\"red\")\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u301337088", "problem_id": "p02933", "submission1_id": "s544485610", "submission2_id": "s878352844", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\na = int(input())\n\nif a >= 3200:\n print('pink')\n\nelif a < 3200:\n print('red')", "code2": "a = int(input())\ns = input()\n\nif a < 3200:\n print('red')\n\nelse:\n print(s)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598289615", "date2": "1598291400", "bleu_score": "0.7289791507927132", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 3, "total_score": 103, "input": "4049\nrdc\n", "actual_output": "pink\n", "expected_output": "rdc\n\n", "anno_code": ["\n\n\n\na = int(input()) # (0): a=4049\n\nif a >= 3200: # (1): NO CHANGE\n print('pink')\n\nelif a < 3200:\n print('red')"], "anno_status": [true], "diff_content": "-\n-\n-\n-\n a = int(input())\n+s = input()\n \n-if a >= 3200:\n- print('pink')\n-\n-elif a < 3200:\n+if a < 3200:\n print('red')\n+\n+else:\n+ print(s)\n", "FL_content": "-\n-\n-\n-\n a = int(input())\n \n-if a >= 3200:\n- print('pink')\n-\n-elif a < 3200:\n print('red')\n", "added_lines": 5, "removed_lines": 8, "code1_lines": 11 }, { "user_id": "u135116520", "problem_id": "p02933", "submission1_id": "s777630432", "submission2_id": "s697491924", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=int(input())\ns=input()\nif a>=3200: \n print(a)\nelse:\n print(\"red\")", "code2": "a=int(input())\ns=input()\nif 2800<=a<3200:\n print(\"red\")\nelif 3200<=a<5000:\n print(s)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577039181", "date2": "1577039322", "bleu_score": "0.6541751251140129", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 2, "total_score": 103, "input": "3200\nogom\n", "actual_output": "3200\n", "expected_output": "ogom\n\n", "anno_code": ["a=int(input()) # (0): a=3200\ns=input() # (1): s=ogom\nif a>=3200: # (2): NO CHANGE\n print(a)\nelse:\n print(\"red\")"], "anno_status": [true], "diff_content": " a=int(input())\n s=input()\n-if a>=3200: \n- print(a)\n-else:\n+if 2800<=a<3200:\n print(\"red\")\n+elif 3200<=a<5000:\n+ print(s)\n", "FL_content": " a=int(input())\n s=input()\n-if a>=3200: \n- print(a)\n-else:\n print(\"red\")\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 6 }, { "user_id": "u013594089", "problem_id": "p02933", "submission1_id": "s619301622", "submission2_id": "s598361471", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\ns = input()\nif a >= 3200:\n\tprint(a)\nelse:\n\tprint(\"red\")", "code2": "a = int(input())\ns = input()\nif a >= 3200:\n\tprint(s)\nelse:\n\tprint(\"red\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567190822", "date2": "1567190857", "bleu_score": "0.9641384561775734", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 2, "total_score": 103, "input": "4049\ncqa\n", "actual_output": "4049\n", "expected_output": "cqa\n\n", "anno_code": ["a = int(input()) # (0): a=4049\ns = input() # (1): s=cqa\nif a >= 3200: # (2): NO CHANGE\n\tprint(a)\nelse:\n\tprint(\"red\")"], "anno_status": [true], "diff_content": " a = int(input())\n s = input()\n if a >= 3200:\n-\tprint(a)\n+\tprint(s)\n else:\n \tprint(\"red\")\n", "FL_content": " a = int(input())\n s = input()\n if a >= 3200:\n-\tprint(a)\n else:\n \tprint(\"red\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u553070631", "problem_id": "p02933", "submission1_id": "s059056361", "submission2_id": "s278554063", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=int(input())\ns=input()\n\nif a >=3200:\n print('red')\nelse:\n print(s)", "code2": "a=int(input())\ns=input()\n\nif a >=3200:\n print(s)\nelse:\n print('red')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569725821", "date2": "1569725892", "bleu_score": "0.9819093526942501", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 1, "total_score": 103, "input": "4049\nbcq\n", "actual_output": "red\n", "expected_output": "bcq\n\n", "anno_code": ["a=int(input()) # (0): a=4049\ns=input() # (1): s=bcq\n\nif a >=3200: # (2): NO CHANGE\n print('red')\nelse:\n print(s)"], "anno_status": [true], "diff_content": " a=int(input())\n s=input()\n \n if a >=3200:\n- print('red')\n-else:\n print(s)\n+else:\n+ print('red')\n+\n", "FL_content": " a=int(input())\n s=input()\n \n if a >=3200:\n- print('red')\n-else:\n print(s)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u527993431", "problem_id": "p03012", "submission1_id": "s438372287", "submission2_id": "s908791509", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A = int(input())\nW = list(map(int,input().split()))\ntmp = 0\nans = 0\nwa = 0\n\nfor i in range (A):\n wa += W[i]\nfor i in range (A):\n tmp += W[i]\n tmp_r = wa-tmp\n if i == 0:\n ans = tmp\n if ans > abs(tmp-tmp_r):\n ans = abs(tmp-tmp_r)\nprint(ans)", "code2": "A = int(input())\nW = list(map(int,input().split()))\ntmp = 0\nans = 0\nwa = 0\n\nfor i in range (A):\n wa += W[i]\nfor i in range (A):\n tmp += W[i]\n tmp_r = wa-tmp\n if i == 0:\n ans = abs(tmp-tmp_r)\n if ans > abs(tmp-tmp_r):\n ans = abs(tmp-tmp_r)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577566274", "date2": "1577566711", "bleu_score": "0.9492973426535558", "code1_test_status": [0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 19, "total_score": 100, "input": "8\n1 5 38 0 0 1 235 5\n", "actual_output": "1\n", "expected_output": "195\n\n", "anno_code": ["A = int(input()) # (0): A=8\nW = list(map(int,input().split())) # (1): W=[1, 5, 38, 0, 0, 1, 235, 5]\ntmp = 0 # (2): tmp=0\nans = 0 # (3): ans=0\nwa = 0 # (4): wa=0\n\nfor i in range (A): # (5): i=0 (7): i=1 ... (21): NO CHANGE\n wa += W[i] # (6): wa=1 (8): wa=6 ... (20): wa=285\nfor i in range (A): # (22): i=0 (28): i=1 ... (63): NO CHANGE\n tmp += W[i] # (23): tmp=1 (29): tmp=6 ... (59): tmp=285\n tmp_r = wa-tmp # (24): tmp_r=284 (30): tmp_r=279 ... (60): tmp_r=0\n if i == 0: # (25): NO CHANGE (31): NO CHANGE ... (61): NO CHANGE\n ans = tmp # (26): ans=1\n if ans > abs(tmp-tmp_r): # (27): NO CHANGE (32): NO CHANGE ... (62): NO CHANGE\n ans = abs(tmp-tmp_r)\nprint(ans)"], "anno_status": [true], "diff_content": " A = int(input())\n W = list(map(int,input().split()))\n tmp = 0\n ans = 0\n wa = 0\n \n for i in range (A):\n wa += W[i]\n for i in range (A):\n tmp += W[i]\n tmp_r = wa-tmp\n if i == 0:\n- ans = tmp\n+ ans = abs(tmp-tmp_r)\n if ans > abs(tmp-tmp_r):\n ans = abs(tmp-tmp_r)\n print(ans)\n", "FL_content": " A = int(input())\n W = list(map(int,input().split()))\n tmp = 0\n ans = 0\n wa = 0\n \n for i in range (A):\n wa += W[i]\n for i in range (A):\n tmp += W[i]\n tmp_r = wa-tmp\n if i == 0:\n- ans = tmp\n if ans > abs(tmp-tmp_r):\n ans = abs(tmp-tmp_r)\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u703499662", "problem_id": "p03012", "submission1_id": "s119931274", "submission2_id": "s936418809", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nd=input().split()\nd=list(map(int,d))\ns1=[]\ns2=0\ndifn=10000000000000000000\ndif=0\ni=0\nwhile i<=len(d):\n s1.append(d[0])\n d.remove(d[0])\n s2=sum(d)\n if sum(s1)>=s2:\n dif=sum(s1)-s2\n elif s2>sum(s1):\n dif=s2-sum(s1)\n if dif=s2:\n dif=sum(s1)-s2\n elif s2>sum(s1):\n dif=s2-sum(s1)\n if dif<=difn:\n difn=dif\n else:\n break\n i+=1\nprint(difn)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560131014", "date2": "1560133770", "bleu_score": "0.9661472048489393", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1], "code1_test_score": 34, "total_score": 100, "input": "8\n56 0 33 7 1 11 140 4\n", "actual_output": "140\n", "expected_output": "36\n\n", "anno_code": ["n=int(input()) # (0): n=8\nd=input().split() # (1): d=['56', '0', '33', '7', '1', '11', '140', '4']\nd=list(map(int,d)) # (2): d=[56, 0, 33, 7, 1, 11, 140, 4]\ns1=[] # (3): s1=[]\ns2=0 # (4): s2=0\ndifn=10000000000000000000 # (5): difn=10000000000000000000\ndif=0 # (6): dif=0\ni=0 # (7): i=0\nwhile i<=len(d): # (8): NO CHANGE (18): NO CHANGE\n s1.append(d[0]) # (9): s1=[56] (19): s1=[56, 0]\n d.remove(d[0]) # (10): d=[0, 33, 7, 1, 11, 140, 4] (20): d=[33, 7, 1, 11, 140, 4]\n s2=sum(d) # (11): s2=196 (21): NO CHANGE\n if sum(s1)>=s2: # (12): NO CHANGE (22): NO CHANGE\n dif=sum(s1)-s2\n elif s2>sum(s1): # (13): NO CHANGE (23): NO CHANGE\n dif=s2-sum(s1) # (14): dif=140 (24): NO CHANGE\n if dif=s2:\n dif=sum(s1)-s2\n elif s2>sum(s1):\n dif=s2-sum(s1)\n- if dif=s2:\n dif=sum(s1)-s2\n elif s2>sum(s1):\n dif=s2-sum(s1)\n- if dif diff:\n min_v = diff\nprint(min_v)", "code2": "n=0\nt_list=[]\ntry:\n n=int(input())\n t_list = [int(n) for n in input().split(' ')]\nexcept:\n print('age,price must be numbers')\n sys.exit(1)\n\nmin_v = 10000\nfor i in range(n):\n diff = abs(sum(t_list[0:i]) - sum(t_list[i:n]))\n if min_v > diff:\n min_v = diff\nprint(min_v)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560130787", "date2": "1560130854", "bleu_score": "0.9255617524705966", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "8\n1 5 10 0 1 0 190 0\n", "actual_output": "10000\n", "expected_output": "173\n\n", "anno_code": ["n=0 # (0): n=0\nt_list=[] # (1): t_list=[]\ntry: # (2): NO CHANGE\n t_list = [int(n) for n in input().split(' ')] # (3): t_list=[8]\nexcept:\n print('age,price must be numbers')\n sys.exit(1)\n\nmin_v = 10000 # (4): min_v=10000\nfor i in range(n): # (5): NO CHANGE\n diff = abs(sum(t_list[0:i]) - sum(t_list[i:n]))\n if min_v > diff:\n min_v = diff\nprint(min_v)"], "anno_status": [true], "diff_content": " n=0\n t_list=[]\n try:\n- t_list = [int(n) for n in input().split(' ')]\n+ n=int(input())\n+ t_list = [int(n) for n in input().split(' ')]\n except:\n print('age,price must be numbers')\n sys.exit(1)\n \n min_v = 10000\n for i in range(n):\n diff = abs(sum(t_list[0:i]) - sum(t_list[i:n]))\n if min_v > diff:\n min_v = diff\n print(min_v)\n", "FL_content": " n=0\n t_list=[]\n try:\n- t_list = [int(n) for n in input().split(' ')]\n except:\n print('age,price must be numbers')\n sys.exit(1)\n \n min_v = 10000\n for i in range(n):\n diff = abs(sum(t_list[0:i]) - sum(t_list[i:n]))\n if min_v > diff:\n min_v = diff\n print(min_v)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 14 }, { "user_id": "u033524082", "problem_id": "p03012", "submission1_id": "s311289913", "submission2_id": "s787374097", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nl=list(map(int,input().split()))\ns=sum(l)\nm=[]\nfor i in range(1,n-1):\n m.append(abs(-sum(l[:i])*2))\nprint(min(m))", "code2": "n=int(input())\nl=list(map(int,input().split()))\ns=sum(l)\nm=[]\nfor i in range(n):\n m.append(abs(s-sum(l[:i+1])*2))\nprint(min(m))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565473573", "date2": "1565474310", "bleu_score": "0.9297405003874497", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 1, "total_score": 100, "input": "8\n1 5 22 0 1 1 106 3\n", "actual_output": "2\n", "expected_output": "79\n\n", "anno_code": ["n=int(input()) # (0): n=8\nl=list(map(int,input().split())) # (1): l=[1, 5, 22, 0, 1, 1, 106, 3]\ns=sum(l) # (2): s=139\nm=[] # (3): m=[]\nfor i in range(1,n-1): # (4): i=1 (6): i=2 ... (16): NO CHANGE\n m.append(abs(-sum(l[:i])*2)) # (5): m=[2] (7): m=[2, 12] ... (15): m=[2, 12, 56, 56, 58, 60]\nprint(min(m))"], "anno_status": [true], "diff_content": " n=int(input())\n l=list(map(int,input().split()))\n s=sum(l)\n m=[]\n-for i in range(1,n-1):\n- m.append(abs(-sum(l[:i])*2))\n+for i in range(n):\n+ m.append(abs(s-sum(l[:i+1])*2))\n print(min(m))\n", "FL_content": " n=int(input())\n l=list(map(int,input().split()))\n s=sum(l)\n m=[]\n-for i in range(1,n-1):\n- m.append(abs(-sum(l[:i])*2))\n print(min(m))\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 7 }, { "user_id": "u460185449", "problem_id": "p03012", "submission1_id": "s466983457", "submission2_id": "s811740409", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nW = list(map(int,input().split()))\nprint(W)\nans = 10 ** 9\nfor i in range(1,N):\n ans = min(ans, abs(sum(W[:i]) - sum(W[i:])))\nprint(ans)\n \n ", "code2": "N = int(input())\nW = list(map(int,input().split()))\nans = 10 ** 9\nfor i in range(1,N):\n ans = min(ans, abs(sum(W[:i]) - sum(W[i:])))\nprint(ans)\n \n ", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589126556", "date2": "1589126586", "bleu_score": "0.9504201648849708", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "8\n1 5 1 0 1 0 106 4\n", "actual_output": "[1, 5, 1, 0, 1, 0, 106, 4]\n102\n", "expected_output": "102\n\n", "anno_code": ["N = int(input()) # (0): N=8\nW = list(map(int,input().split())) # (1): W=[1, 5, 1, 0, 1, 0, 106, 4]\nprint(W) # (2): NO CHANGE\nans = 10 ** 9 # (3): ans=1000000000\nfor i in range(1,N): # (4): i=1 (6): i=2 ... (18): NO CHANGE\n ans = min(ans, abs(sum(W[:i]) - sum(W[i:]))) # (5): ans=116 (7): ans=106 ... (17): NO CHANGE\nprint(ans)\n \n "], "anno_status": [true], "diff_content": " N = int(input())\n W = list(map(int,input().split()))\n-print(W)\n ans = 10 ** 9\n for i in range(1,N):\n ans = min(ans, abs(sum(W[:i]) - sum(W[i:])))\n print(ans)\n \n \n", "FL_content": " N = int(input())\n W = list(map(int,input().split()))\n-print(W)\n ans = 10 ** 9\n for i in range(1,N):\n ans = min(ans, abs(sum(W[:i]) - sum(W[i:])))\n print(ans)\n \n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u079022116", "problem_id": "p03012", "submission1_id": "s065071812", "submission2_id": "s270523521", "status1": "Wrong Answer", "status2": "Accepted", "code1": "ans = 0\nn = int(input())\nw = list(map(int,input().split()))\nmid = sum(w)\nans = 0\nfor i in w:\n ans += i\n if mid <= ans:\n print(ans-(sum(w)-ans))\n break", "code2": "n = int(input())\nw = list(map(int,input().split()))\nans = []\ns = 0\nfor i in range(n):\n s += w[i]\n ans.append(abs(s-sum(w[i+1:])))\nprint(min(ans))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579913897", "date2": "1579914794", "bleu_score": "0.6086887302504811", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "8\n1 5 38 0 0 1 235 5\n", "actual_output": "285\n", "expected_output": "195\n\n", "anno_code": ["ans = 0 # (0): ans=0\nn = int(input()) # (1): n=8\nw = list(map(int,input().split())) # (2): w=[1, 5, 38, 0, 0, 1, 235, 5]\nmid = sum(w) # (3): mid=285\nans = 0 # (4): NO CHANGE\nfor i in w: # (5): i=1 (8): i=5 ... (26): i=5\n ans += i # (6): ans=1 (9): ans=6 ... (27): ans=285\n if mid <= ans: # (7): NO CHANGE (10): NO CHANGE ... (28): NO CHANGE\n print(ans-(sum(w)-ans)) # (29): NO CHANGE\n break"], "anno_status": [true], "diff_content": "-ans = 0\n n = int(input())\n w = list(map(int,input().split()))\n-mid = sum(w)\n-ans = 0\n-for i in w:\n- ans += i\n- if mid <= ans:\n- print(ans-(sum(w)-ans))\n- break\n+ans = []\n+s = 0\n+for i in range(n):\n+ s += w[i]\n+ ans.append(abs(s-sum(w[i+1:])))\n+print(min(ans))\n", "FL_content": "-ans = 0\n n = int(input())\n w = list(map(int,input().split()))\n-mid = sum(w)\n-ans = 0\n-for i in w:\n- ans += i\n- if mid <= ans:\n- print(ans-(sum(w)-ans))\n- break\n", "added_lines": 6, "removed_lines": 8, "code1_lines": 10 }, { "user_id": "u277353449", "problem_id": "p03012", "submission1_id": "s222167970", "submission2_id": "s604028110", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=input().split()\ndel a[0]\nfor i in range(0,len(a)):\n a[i]=int(a[i])\nb=0\nc=0\nanswer=sum(a)\nfor i in range(0,len(a)):\n b=b+a[i]\n c=sum(a)-b\n if (b-c>=0 and answer>b-c):\n answer=b-c\n if (c-b>0 and answer>c-b):\n answer=c-b\nprint(answer)", "code2": "b=input()\na=input().split()\nfor i in range(0,len(a)):\n a[i]=int(a[i])\nb=0\nc=0\nanswer=sum(a)\nfor i in range(0,len(a)):\n b=b+a[i]\n c=sum(a)-b\n if (b-c>=0 and answer>b-c):\n answer=b-c\n elif (c-b>0 and answer>c-b):\n answer=c-b\nprint(answer)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560133451", "date2": "1560135233", "bleu_score": "0.9495937721580872", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "8\n47 30 99 2 5 2 102 4\n", "actual_output": "0\n", "expected_output": "61\n\n", "anno_code": ["a=input().split() # (0): a=['8']\ndel a[0] # (1): a=[]\nfor i in range(0,len(a)): # (2): NO CHANGE\n a[i]=int(a[i])\nb=0 # (3): b=0\nc=0 # (4): c=0\nanswer=sum(a) # (5): answer=0\nfor i in range(0,len(a)): # (6): NO CHANGE\n b=b+a[i]\n c=sum(a)-b\n if (b-c>=0 and answer>b-c):\n answer=b-c\n if (c-b>0 and answer>c-b):\n answer=c-b\nprint(answer)"], "anno_status": [true], "diff_content": "+b=input()\n a=input().split()\n-del a[0]\n for i in range(0,len(a)):\n a[i]=int(a[i])\n b=0\n c=0\n answer=sum(a)\n for i in range(0,len(a)):\n b=b+a[i]\n c=sum(a)-b\n if (b-c>=0 and answer>b-c):\n answer=b-c\n- if (c-b>0 and answer>c-b):\n+ elif (c-b>0 and answer>c-b):\n answer=c-b\n print(answer)\n", "FL_content": " a=input().split()\n-del a[0]\n for i in range(0,len(a)):\n a[i]=int(a[i])\n b=0\n c=0\n answer=sum(a)\n for i in range(0,len(a)):\n b=b+a[i]\n c=sum(a)-b\n if (b-c>=0 and answer>b-c):\n answer=b-c\n- if (c-b>0 and answer>c-b):\n answer=c-b\n print(answer)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 15 }, { "user_id": "u750651325", "problem_id": "p03012", "submission1_id": "s635519933", "submission2_id": "s040083051", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport math\nimport itertools\nimport bisect\nfrom copy import copy\nfrom collections import deque,Counter\nfrom decimal import Decimal\ndef s(): return input()\ndef i(): return int(input())\ndef S(): return input().split()\ndef I(): return map(int,input().split())\ndef X(): return list(input())\ndef L(): return list(input().split())\ndef l(): return list(map(int,input().split()))\ndef lcm(a,b): return a*b\nsys.setrecursionlimit(10 ** 9)\nmod = 10**9+7\n\nN = i()\nS = l()\nS.sort()\nans1 = 0\nans2 = sum(S)\nsa = 1000000000\ni=0\n\nfor i in range(N):\n ans1 += S[i]\n ans2 -= S[i]\n sa = min(sa,abs(ans2-ans1))\n i += 1\n\nprint(sa)\n", "code2": "import sys\nimport math\nimport itertools\nimport bisect\nfrom copy import copy\nfrom collections import deque,Counter\nfrom decimal import Decimal\ndef s(): return input()\ndef i(): return int(input())\ndef S(): return input().split()\ndef I(): return map(int,input().split())\ndef X(): return list(input())\ndef L(): return list(input().split())\ndef l(): return list(map(int,input().split()))\ndef lcm(a,b): return a*b\nsys.setrecursionlimit(10 ** 9)\nmod = 10**9+7\n\nN = i()\nS = l()\nsa = 1000000000\n\nfor i in range(1,N):\n sa = min(sa,abs(sum(S[:i])-sum(S[i:])))\n\nprint(sa)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593230409", "date2": "1593258437", "bleu_score": "0.8572014708000434", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 4, "total_score": 100, "input": "8\n1 5 1 0 1 0 106 4\n", "actual_output": "94\n", "expected_output": "102\n\n", "anno_code": ["import sys\nimport math\nimport itertools\nimport bisect\nfrom copy import copy\nfrom collections import deque,Counter\nfrom decimal import Decimal\ndef s(): return input()\ndef i(): return int(input())\ndef S(): return input().split()\ndef I(): return map(int,input().split())\ndef X(): return list(input())\ndef L(): return list(input().split())\ndef l(): return list(map(int,input().split()))\ndef lcm(a,b): return a*b\nsys.setrecursionlimit(10 ** 9) # (0): NO CHANGE\nmod = 10**9+7 # (1): mod=1000000007\n\nN = i() # (2): N=8\nS = l() # (3): S=[1, 5, 1, 0, 1, 0, 106, 4]\nS.sort() # (4): S=[0, 0, 1, 1, 1, 4, 5, 106]\nans1 = 0 # (5): ans1=0\nans2 = sum(S) # (6): ans2=118\nsa = 1000000000 # (7): sa=1000000000\ni=0 # (8): i=0\n\nfor i in range(N): # (9): NO CHANGE (14): NO CHANGE ... (49): NO CHANGE\n ans1 += S[i] # (10): NO CHANGE (15): NO CHANGE ... (45): ans1=118\n ans2 -= S[i] # (11): NO CHANGE (16): NO CHANGE ... (46): ans2=0\n sa = min(sa,abs(ans2-ans1)) # (12): sa=118 (17): NO CHANGE ... (47): NO CHANGE\n i += 1 # (13): i=1 (18): i=2 ... (48): i=8\n\nprint(sa)\n"], "anno_status": [true], "diff_content": " import sys\n import math\n import itertools\n import bisect\n from copy import copy\n from collections import deque,Counter\n from decimal import Decimal\n def s(): return input()\n def i(): return int(input())\n def S(): return input().split()\n def I(): return map(int,input().split())\n def X(): return list(input())\n def L(): return list(input().split())\n def l(): return list(map(int,input().split()))\n def lcm(a,b): return a*b\n sys.setrecursionlimit(10 ** 9)\n mod = 10**9+7\n \n N = i()\n S = l()\n-S.sort()\n-ans1 = 0\n-ans2 = sum(S)\n sa = 1000000000\n-i=0\n \n-for i in range(N):\n- ans1 += S[i]\n- ans2 -= S[i]\n- sa = min(sa,abs(ans2-ans1))\n- i += 1\n+for i in range(1,N):\n+ sa = min(sa,abs(sum(S[:i])-sum(S[i:])))\n \n print(sa)\n \n", "FL_content": " import sys\n import math\n import itertools\n import bisect\n from copy import copy\n from collections import deque,Counter\n from decimal import Decimal\n def s(): return input()\n def i(): return int(input())\n def S(): return input().split()\n def I(): return map(int,input().split())\n def X(): return list(input())\n def L(): return list(input().split())\n def l(): return list(map(int,input().split()))\n def lcm(a,b): return a*b\n sys.setrecursionlimit(10 ** 9)\n mod = 10**9+7\n \n N = i()\n S = l()\n-S.sort()\n-ans1 = 0\n-ans2 = sum(S)\n sa = 1000000000\n-i=0\n \n-for i in range(N):\n- ans1 += S[i]\n- ans2 -= S[i]\n- sa = min(sa,abs(ans2-ans1))\n- i += 1\n \n print(sa)\n \n", "added_lines": 2, "removed_lines": 9, "code1_lines": 34 }, { "user_id": "u941284252", "problem_id": "p03129", "submission1_id": "s240151979", "submission2_id": "s222321070", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K = (int(x) for x in input().split())\nif(K==0):\n print(\"YES\")\n exit()\nif(N-2 >= 10):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\n", "code2": "N,K = (int(x) for x in input().split())\nif((N+1)/2 >= K):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1550001495", "date2": "1550001943", "bleu_score": "0.6428433888354146", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 48, "total_score": 60, "input": "151 97\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["N,K = (int(x) for x in input().split()) # (0): N=151, K=97\nif(K==0): # (1): NO CHANGE\n print(\"YES\")\n exit()\nif(N-2 >= 10): # (2): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\n"], "anno_status": [true], "diff_content": " N,K = (int(x) for x in input().split())\n-if(K==0):\n- print(\"YES\")\n- exit()\n-if(N-2 >= 10):\n+if((N+1)/2 >= K):\n print(\"YES\")\n else:\n print(\"NO\")\n \n \n \n \n", "FL_content": " N,K = (int(x) for x in input().split())\n-if(K==0):\n- print(\"YES\")\n- exit()\n-if(N-2 >= 10):\n print(\"YES\")\n else:\n print(\"NO\")\n \n \n \n \n", "added_lines": 1, "removed_lines": 4, "code1_lines": 12 }, { "user_id": "u569742427", "problem_id": "p03129", "submission1_id": "s136866082", "submission2_id": "s446386867", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K=map(int,input().split())\n\nans='NO'\n\nif N%2==0 and K<=(N/2):\n ans=''\nif N%2==1 and K<=((N/2)+1) :\n ans='YES'\n\nprint(ans)\n", "code2": "N,K=map(int,input().split())\n\nans='NO'\n\nif N%2==0 and K<=(N/2):\n ans='YES'\nif N%2==1 and K<=((N+1)/2) :\n ans='YES'\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549765053", "date2": "1549765249", "bleu_score": "0.9364384969226234", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1], "code1_test_score": 52, "total_score": 60, "input": "70 10\n", "actual_output": "\n", "expected_output": "YES\n\n", "anno_code": ["N,K=map(int,input().split()) # (0): N=70, K=10\n\nans='NO' # (1): ans=NO\n\nif N%2==0 and K<=(N/2): # (2): NO CHANGE\n ans='' # (3): ans=\nif N%2==1 and K<=((N/2)+1) : # (4): NO CHANGE\n ans='YES'\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " N,K=map(int,input().split())\n \n ans='NO'\n \n if N%2==0 and K<=(N/2):\n- ans=''\n-if N%2==1 and K<=((N/2)+1) :\n+ ans='YES'\n+if N%2==1 and K<=((N+1)/2) :\n ans='YES'\n \n print(ans)\n \n", "FL_content": " N,K=map(int,input().split())\n \n ans='NO'\n \n if N%2==0 and K<=(N/2):\n- ans=''\n-if N%2==1 and K<=((N/2)+1) :\n ans='YES'\n \n print(ans)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 11 }, { "user_id": "u749770850", "problem_id": "p03129", "submission1_id": "s806949686", "submission2_id": "s254725479", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int, input().split())\nprint( \"YES\" if n -k >= 1 else \"NO\")", "code2": "n, k = map(int, input().split())\n\nif k * 2 -1 <= n:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584246708", "date2": "1584247396", "bleu_score": "0.601688432330959", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 51, "total_score": 60, "input": "51 27\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["n, k = map(int, input().split()) # (0): n=51, k=27\nprint( \"YES\" if n -k >= 1 else \"NO\")"], "anno_status": [true], "diff_content": " n, k = map(int, input().split())\n-print( \"YES\" if n -k >= 1 else \"NO\")\n+\n+if k * 2 -1 <= n:\n+\tprint(\"YES\")\n+else:\n+\tprint(\"NO\")\n", "FL_content": " n, k = map(int, input().split())\n-print( \"YES\" if n -k >= 1 else \"NO\")\n", "added_lines": 5, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u052746401", "problem_id": "p03129", "submission1_id": "s240700877", "submission2_id": "s147407905", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int, input().split())\n\nif N > K:\n print('YES')\nelse:\n print('NO')\n", "code2": "N, K = map(int, input().split())\n\nif (N % 2 == 0 and N \n print('YES')\nelse:\n print('NO')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549764116", "date2": "1549764523", "bleu_score": "0.806746586426211", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 51, "total_score": 60, "input": "87 50\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["N, K = map(int, input().split()) # (0): N=87, K=50\n\nif N > K: # (1): NO CHANGE\n print('YES')\nelse:\n print('NO')\n"], "anno_status": [true], "diff_content": " N, K = map(int, input().split())\n \n-if N > K:\n+if (N % 2 == 0 and N \n print('YES')\n else:\n print('NO')\n \n", "FL_content": " N, K = map(int, input().split())\n \n-if N > K:\n print('YES')\n else:\n print('NO')\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u335664637", "problem_id": "p03129", "submission1_id": "s839223054", "submission2_id": "s626986195", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=input()\nN=int(a.split()[0])\nK=int(a.split()[1])\n\nif(N>(K/2-1)):\n print('YES')\nelse:\n print('NO')", "code2": "a=input()\nN=int(a.split()[0])\nK=int(a.split()[1])\n\nif((N/2+1)>K):\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549764341", "date2": "1549764439", "bleu_score": "0.9197759485877773", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 49, "total_score": 60, "input": "10 19\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["a=input() # (0): a=10 19\nN=int(a.split()[0]) # (1): N=10\nK=int(a.split()[1]) # (2): K=19\n\nif(N>(K/2-1)): # (3): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " a=input()\n N=int(a.split()[0])\n K=int(a.split()[1])\n \n-if(N>(K/2-1)):\n+if((N/2+1)>K):\n print('YES')\n else:\n print('NO')\n", "FL_content": " a=input()\n N=int(a.split()[0])\n K=int(a.split()[1])\n \n-if(N>(K/2-1)):\n print('YES')\n else:\n print('NO')\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u185243955", "problem_id": "p03129", "submission1_id": "s837004104", "submission2_id": "s215292024", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nN,K = [int(x) for x in input().split()]\nif K <= math.ceil(N/2):\n print('Yes')\nelse:\n print('No')\n", "code2": "import math\n\nN,K = [int(x) for x in input().split()]\nif K <= math.ceil(N/2):\n print('YES')\nelse:\n print('NO')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549765261", "date2": "1549766021", "bleu_score": "0.9471903838236817", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 60, "input": "77 50\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["import math\n\nN,K = [int(x) for x in input().split()] # (0): N=77, K=50\nif K <= math.ceil(N/2): # (1): NO CHANGE\n print('Yes')\nelse:\n print('No')\n"], "anno_status": [true], "diff_content": " import math\n \n N,K = [int(x) for x in input().split()]\n if K <= math.ceil(N/2):\n- print('Yes')\n+ print('YES')\n else:\n- print('No')\n+ print('NO')\n \n", "FL_content": " import math\n \n N,K = [int(x) for x in input().split()]\n if K <= math.ceil(N/2):\n- print('Yes')\n else:\n- print('No')\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u257974487", "problem_id": "p03129", "submission1_id": "s437213118", "submission2_id": "s540147343", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b = map(int, input().split())\nif a > b:\n print(\"YES\")\nelse:\n print(\"NO\")", "code2": "a, b = map(int, input().split())\nif a >= 2 * b - 1:\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549920088", "date2": "1549920212", "bleu_score": "0.866627220670795", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 51, "total_score": 60, "input": "87 50\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["a, b = map(int, input().split()) # (0): a=87, b=50\nif a > b: # (1): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")"], "anno_status": [true], "diff_content": " a, b = map(int, input().split())\n-if a > b:\n+if a >= 2 * b - 1:\n print(\"YES\")\n else:\n print(\"NO\")\n", "FL_content": " a, b = map(int, input().split())\n-if a > b:\n print(\"YES\")\n else:\n print(\"NO\")\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u404561212", "problem_id": "p03129", "submission1_id": "s177371784", "submission2_id": "s871899883", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = list(map(int, input().split()))\nnum = 0\n\nfor n in range(1,N+1):\n if n%2!=0:\n num += 1\nif num < K:\n print(\"No\")\nelse:\n print(\"Yes\")", "code2": "N, K = list(map(int, input().split()))\nnum = 0\n\nfor n in range(1,N+1):\n if n%2!=0:\n num += 1\nif num= K:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "\n\nN, K = map(int, input().split())\n\nif int((N+1) /2) >= K:\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1550090543", "date2": "1550090914", "bleu_score": "0.9393209005037124", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 60, "input": "98 50\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["\n\nN, K = map(int, input().split()) # (0): N=98, K=50\n\nif int((N+1) /2) >= K: # (1): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " \n \n N, K = map(int, input().split())\n \n if int((N+1) /2) >= K:\n- print(\"Yes\")\n+ print(\"YES\")\n else:\n- print(\"No\")\n+ print(\"NO\")\n", "FL_content": " \n \n N, K = map(int, input().split())\n \n if int((N+1) /2) >= K:\n- print(\"Yes\")\n else:\n- print(\"No\")\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 8 }, { "user_id": "u922489088", "problem_id": "p00591", "submission1_id": "s219821779", "submission2_id": "s925137112", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nwhile True:\n n = int(sys.stdin.readline().rstrip())\n if n == 0:\n break;\n students = []\n for i in range(n):\n students.append(sys.stdin.readline().rstrip().split(' '))\n s_list=[[min(row)==s for s in row] for row in students]\n t_list=[[max(col)==s for s in col] for col in zip(*students)]\n ret = 0\n for i,data in enumerate(zip(s_list, zip(*t_list))):\n for j,d in enumerate(zip(*data)):\n if all(d):\n ret = students[i][j]\n break;\n print(ret)", "code2": "import sys\n\nwhile True:\n n = int(sys.stdin.readline().rstrip())\n if n == 0:\n break;\n students = []\n for i in range(n):\n students.append(list(map(int, sys.stdin.readline().rstrip().split(' '))))\n s_list=[[min(row)==s for s in row] for row in students]\n t_list=[[max(col)==s for s in col] for col in zip(*students)]\n ret = [0]\n for i,data in enumerate(zip(s_list, zip(*t_list))):\n for j,d in enumerate(zip(*data)):\n if all(d):\n ret.append(students[i][j])\n print(max(ret))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1503915229", "date2": "1503915640", "bleu_score": "0.9311086070999376", "code1_test_status": [0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 23, "total_score": 101, "input": "3\n1 2 3\n4 1 6\n7 10 13\n3\n1 2 3\n7 8 10\n4 5 6\n0\n", "actual_output": "0\n0\n", "expected_output": "7\n7\n\n", "anno_code": ["import sys\n\nwhile True: # (0): NO CHANGE (40): NO CHANGE (80): NO CHANGE\n n = int(sys.stdin.readline().rstrip()) # (1): n=3 (41): NO CHANGE (81): n=0\n if n == 0: # (2): NO CHANGE (42): NO CHANGE (82): NO CHANGE\n break;\n students = [] # (3): students=[] (43): students=[]\n for i in range(n): # (4): i=0 (6): i=1 ... (50): NO CHANGE\n students.append(sys.stdin.readline().rstrip().split(' ')) # (5): students (7): students ... (49): students\n s_list=[[min(row)==s for s in row] for row in students] # (11): s_list (51): s_list\n t_list=[[max(col)==s for s in col] for col in zip(*students)] # (12): t_list (52): t_list\n ret = 0 # (13): ret=0 (53): NO CHANGE\n for i,data in enumerate(zip(s_list, zip(*t_list))): # (14): i=0, data=([True, False, False], (False, True, False)) (22): i=1, data=([False, True, False], (False, False, True)) ... (78): NO CHANGE\n for j,d in enumerate(zip(*data)): # (15): j=0, d=(True, False) (17): j=1, d=(False, True) ... (77): NO CHANGE\n if all(d): # (16): NO CHANGE (18): NO CHANGE ... (76): NO CHANGE\n ret = students[i][j]\n break;\n print(ret) # (39): NO CHANGE (79): NO CHANGE\n"], "anno_status": [true], "diff_content": " import sys\n \n while True:\n n = int(sys.stdin.readline().rstrip())\n if n == 0:\n break;\n students = []\n for i in range(n):\n- students.append(sys.stdin.readline().rstrip().split(' '))\n+ students.append(list(map(int, sys.stdin.readline().rstrip().split(' '))))\n s_list=[[min(row)==s for s in row] for row in students]\n t_list=[[max(col)==s for s in col] for col in zip(*students)]\n- ret = 0\n+ ret = [0]\n for i,data in enumerate(zip(s_list, zip(*t_list))):\n for j,d in enumerate(zip(*data)):\n if all(d):\n- ret = students[i][j]\n- break;\n- print(ret)\n+ ret.append(students[i][j])\n+ print(max(ret))\n", "FL_content": " import sys\n \n while True:\n n = int(sys.stdin.readline().rstrip())\n if n == 0:\n break;\n students = []\n for i in range(n):\n- students.append(sys.stdin.readline().rstrip().split(' '))\n s_list=[[min(row)==s for s in row] for row in students]\n t_list=[[max(col)==s for s in col] for col in zip(*students)]\n- ret = 0\n for i,data in enumerate(zip(s_list, zip(*t_list))):\n for j,d in enumerate(zip(*data)):\n if all(d):\n- ret = students[i][j]\n- break;\n- print(ret)\n", "added_lines": 4, "removed_lines": 5, "code1_lines": 18 }, { "user_id": "u797673668", "problem_id": "p00591", "submission1_id": "s031154297", "submission2_id": "s838179137", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n n = int(input())\n if not n:\n break\n a = [list(map(int, input().split())) for j in range(n)]\n c = [max(a[i][j] for i in range(n)) for j in range(n)]\n r = [min(a[i]) for i in range(n)]\n\n print(*(c[j] for i in range(n) for j, x in enumerate(a[i]) if x == r[i] and c[j] == r[i]))", "code2": "while True:\n n = int(input())\n if not n: break\n a = [list(map(int, input().split())) for _ in range(n)]\n s = max(min(a[i]) for i in range(n))\n c = [max(a[i][j] for i in range(n)) for j in range(n)]\n for j in range(n):\n if c[j] == s:\n print(s)\n break\n else:\n print(0)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1460962228", "date2": "1460963359", "bleu_score": "0.7737244853691625", "code1_test_status": [1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1], "code1_test_score": 65, "total_score": 101, "input": "3\n1 2 3\n4 10 6\n7 5 9\n3\n1 2 3\n1 8 9\n4 5 6\n0\n", "actual_output": "\n4\n", "expected_output": "0\n4\n\n", "anno_code": ["while True: # (0): NO CHANGE (7): NO CHANGE (14): NO CHANGE\n n = int(input()) # (1): n=3 (8): NO CHANGE (15): n=0\n if not n: # (2): NO CHANGE (9): NO CHANGE (16): NO CHANGE\n break\n a = [list(map(int, input().split())) for j in range(n)] # (3): a (10): a\n c = [max(a[i][j] for i in range(n)) for j in range(n)] # (4): c=[7, 10, 9] (11): c=[4, 8, 9]\n r = [min(a[i]) for i in range(n)] # (5): r=[1, 4, 5] (12): r=[1, 1, 4]\n\n print(*(c[j] for i in range(n) for j, x in enumerate(a[i]) if x == r[i] and c[j] == r[i])) # (6): NO CHANGE (13): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n n = int(input())\n- if not n:\n- break\n- a = [list(map(int, input().split())) for j in range(n)]\n+ if not n: break\n+ a = [list(map(int, input().split())) for _ in range(n)]\n+ s = max(min(a[i]) for i in range(n))\n c = [max(a[i][j] for i in range(n)) for j in range(n)]\n- r = [min(a[i]) for i in range(n)]\n-\n- print(*(c[j] for i in range(n) for j, x in enumerate(a[i]) if x == r[i] and c[j] == r[i]))\n+ for j in range(n):\n+ if c[j] == s:\n+ print(s)\n+ break\n+ else:\n+ print(0)\n", "FL_content": " while True:\n n = int(input())\n- if not n:\n- break\n- a = [list(map(int, input().split())) for j in range(n)]\n c = [max(a[i][j] for i in range(n)) for j in range(n)]\n- r = [min(a[i]) for i in range(n)]\n-\n- print(*(c[j] for i in range(n) for j, x in enumerate(a[i]) if x == r[i] and c[j] == r[i]))\n", "added_lines": 9, "removed_lines": 6, "code1_lines": 9 }, { "user_id": "u285681431", "problem_id": "p02536", "submission1_id": "s195877644", "submission2_id": "s683929514", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\n\n\n\n\nclass UnionFind:\n\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n\n def find(self, v): \n if self.parents[v] < 0:\n return v\n else:\n self.parents[v] = self.find(self.parents[v])\n return self.parents[v]\n\n def unite(self, u, v): \n u = self.find(u)\n v = self.find(v)\n if u == v:\n return\n if self.parents[u] > self.parents[v]: \n u, v = v, u\n self.parents[u] += self.parents[v]\n self.parents[v] = u\n\n def size(self, v): \n return -self.parents[self.find(v)]\n\n def same(self, u, v): \n return self.find(u) == self.find(v)\n\n\nN, M = map(int, input().split())\nG = [[] for _ in range(N)]\nuf = UnionFind(N)\n\nfor _ in range(M):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n uf.unite(a, b)\n\nroot_list = []\nfor i in range(N):\n r = uf.find(i)\n root_list.append(r)\n\nroot_list = list(set(root_list))\nnum = len(root_list)\n\n\n\n\n\ndef comb(n, r): \n if r < 0 or r > n:\n return 0\n else:\n n1 = math.factorial(n)\n n21 = math.factorial(n - r)\n n22 = math.factorial(r)\n ans = n1 \n return ans\n\n\n\nans = comb(num, 2)\nprint(ans)\n", "code2": "import math\n\n\n\nclass UnionFind:\n\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n\n def find(self, v): \n if self.parents[v] < 0:\n return v\n else:\n self.parents[v] = self.find(self.parents[v])\n return self.parents[v]\n\n def unite(self, u, v): \n u = self.find(u)\n v = self.find(v)\n if u == v:\n return\n if self.parents[u] > self.parents[v]: \n u, v = v, u\n self.parents[u] += self.parents[v]\n self.parents[v] = u\n\n def size(self, v): \n return -self.parents[self.find(v)]\n\n def same(self, u, v): \n return self.find(u) == self.find(v)\n\n\n\n\n\n\ndef comb(n, r): \n if r < 0 or r > n:\n return 0\n else:\n n1 = math.factorial(n)\n n21 = math.factorial(n - r)\n n22 = math.factorial(r)\n ans = n1 \n return ans\n\n\nN, M = map(int, input().split())\nuf = UnionFind(N)\n\nfor _ in range(M):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n uf.unite(a, b)\n\nroot_list = []\nfor i in range(N):\n r = uf.find(i)\n root_list.append(r)\n\nroot_list = list(set(root_list))\nnum = len(root_list)\n\nans = num - 1\nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601169374", "date2": "1601169476", "bleu_score": "0.9657020744705149", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 90, "input": "50 1\n2 5\n", "actual_output": "608281864034267560872252163321295376887552831379210240000000000\n", "expected_output": "48\n\n", "anno_code": ["import math\n\n\n\n\n\nclass UnionFind: # (0): UnionFind=\n\n def __init__(self, n):\n self.n = n # (4): NO CHANGE\n self.parents = [-1] * n # (5): math=, UnionFind=, N=50, M=1, G, uf=\n\n def find(self, v): \n if self.parents[v] < 0: # (12): u=1, v=4 (14): u=1 ... (221): math=, UnionFind=, N=50, M=1, G=[[], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], []], uf=, _=0, a=1, b=4, root_list=[0, 1, ..., 47, 48], i=49, r=49\n return v\n else:\n self.parents[v] = self.find(self.parents[v]) # (40): v=1\n return self.parents[v]\n\n def unite(self, u, v): \n u = self.find(u) # (11): v=1\n v = self.find(v) # (13): NO CHANGE\n if u == v: # (15): NO CHANGE\n return\n if self.parents[u] > self.parents[v]: # (16): NO CHANGE\n u, v = v, u\n self.parents[u] += self.parents[v] # (17): NO CHANGE\n self.parents[v] = u # (18): math=, UnionFind=, N=50, M=1, G, uf=, _=0, a=1, b=4\n\n def size(self, v): \n return -self.parents[self.find(v)]\n\n def same(self, u, v): \n return self.find(u) == self.find(v)\n\n\nN, M = map(int, input().split()) # (1): N=50, M=1\nG = [[] for _ in range(N)] # (2): G\nuf = UnionFind(N) # (3): self=, n=50\n\nfor _ in range(M): # (6): _=0 (19): NO CHANGE\n a, b = map(int, input().split()) # (7): a=2, b=5\n a -= 1 # (8): a=1\n b -= 1 # (9): b=4\n uf.unite(a, b) # (10): self=, u=1, v=4\n\nroot_list = [] # (20): root_list=[]\nfor i in range(N): # (21): i=0 (25): i=1 ... (223): NO CHANGE\n r = uf.find(i) # (22): self=, v=0 (26): self=, v=1 ... (220): self=, v=49\n root_list.append(r) # (24): root_list=[0] (28): root_list=[0, 1] ... (222): root_list=[0, 1, ..., 48, 49]\n\nroot_list = list(set(root_list)) # (224): root_list=[0, 1, ..., 48, 49]\nnum = len(root_list) # (225): num=49\n\n\n\n\n\ndef comb(n, r): # (226): comb=\n if r < 0 or r > n: # (228): NO CHANGE\n return 0\n else:\n n1 = math.factorial(n) # (229): n1=608281864034267560872252163321295376887552831379210240000000000\n n21 = math.factorial(n - r) # (230): n21=258623241511168180642964355153611979969197632389120000000000\n n22 = math.factorial(r) # (231): n22=2\n ans = n1 # (232): math=, UnionFind=, N=50, M=1, G=[[], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], []], uf=, _=0, a=1, b=4, root_list=[0, 1, ..., 48, 49], i=49, r=49, num=49, comb=, ans=608281864034267560872252163321295376887552831379210240000000000\n return ans\n\n\n\nans = comb(num, 2) # (227): n=49, r=2\nprint(ans)\n"], "anno_status": [false], "diff_content": " import math\n \n \n \n-\n-\n class UnionFind:\n \n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, v): \n if self.parents[v] < 0:\n return v\n else:\n self.parents[v] = self.find(self.parents[v])\n return self.parents[v]\n \n def unite(self, u, v): \n u = self.find(u)\n v = self.find(v)\n if u == v:\n return\n if self.parents[u] > self.parents[v]: \n u, v = v, u\n self.parents[u] += self.parents[v]\n self.parents[v] = u\n \n def size(self, v): \n return -self.parents[self.find(v)]\n \n def same(self, u, v): \n return self.find(u) == self.find(v)\n \n \n+\n+\n+\n+\n+def comb(n, r): \n+ if r < 0 or r > n:\n+ return 0\n+ else:\n+ n1 = math.factorial(n)\n+ n21 = math.factorial(n - r)\n+ n22 = math.factorial(r)\n+ ans = n1 \n+ return ans\n+\n+\n N, M = map(int, input().split())\n-G = [[] for _ in range(N)]\n uf = UnionFind(N)\n \n for _ in range(M):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n uf.unite(a, b)\n \n root_list = []\n for i in range(N):\n r = uf.find(i)\n root_list.append(r)\n \n root_list = list(set(root_list))\n num = len(root_list)\n \n-\n-\n-\n-\n-def comb(n, r): \n- if r < 0 or r > n:\n- return 0\n- else:\n- n1 = math.factorial(n)\n- n21 = math.factorial(n - r)\n- n22 = math.factorial(r)\n- ans = n1 \n- return ans\n-\n-\n-\n-ans = comb(num, 2)\n+ans = num - 1\n print(ans)\n \n", "FL_content": " import math\n \n \n \n-\n-\n class UnionFind:\n \n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, v): \n if self.parents[v] < 0:\n return v\n else:\n self.parents[v] = self.find(self.parents[v])\n return self.parents[v]\n \n def unite(self, u, v): \n u = self.find(u)\n v = self.find(v)\n if u == v:\n return\n if self.parents[u] > self.parents[v]: \n u, v = v, u\n self.parents[u] += self.parents[v]\n self.parents[v] = u\n \n def size(self, v): \n return -self.parents[self.find(v)]\n \n def same(self, u, v): \n return self.find(u) == self.find(v)\n \n \n N, M = map(int, input().split())\n-G = [[] for _ in range(N)]\n uf = UnionFind(N)\n \n for _ in range(M):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n uf.unite(a, b)\n \n root_list = []\n for i in range(N):\n r = uf.find(i)\n root_list.append(r)\n \n root_list = list(set(root_list))\n num = len(root_list)\n \n-\n-\n-\n-\n-def comb(n, r): \n- if r < 0 or r > n:\n- return 0\n- else:\n- n1 = math.factorial(n)\n- n21 = math.factorial(n - r)\n- n22 = math.factorial(r)\n- ans = n1 \n- return ans\n-\n-\n-\n-ans = comb(num, 2)\n print(ans)\n \n", "added_lines": 16, "removed_lines": 20, "code1_lines": 73 }, { "user_id": "u187516587", "problem_id": "p02536", "submission1_id": "s496203560", "submission2_id": "s709908482", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ndef input():\n return sys.stdin.readline()[:-1]\nN,M=map(int,input().split())\nsys.setrecursionlimit(200000)\nclass uf:\n def __init__(self,n):\n self.n=n\n self.l=[-1]*n\n def ro(self,n): \n if self.l[n]<0:\n return n\n r=self.ro(self.l[n])\n self.l[n]=r\n return r\n def me(self,a,b): \n ra=self.ro(a)\n rb=self.ro(b)\n if self.l[ra]>self.l[rb]:\n ra,rb=rb,ra\n if ra!=rb:\n self.l[ra]+=self.l[rb]\n self.l[rb]=ra\n def size(self,n):\n return -self.l[self.ro(n)]\n def sa(self,a,b): \n return self.ro(a)==self.ro(b)\n def rl(self): \n return [i for i,v in enumerate(self.l) if v<0]\n \n def len(self): \n return len(self.rl())\n def ul(self):\n d={n:i for i,n in enumerate(self.rl())}\n m=[[]for i in range(self.len())]\n for i in range(self.n):\n m[d[self.ro(i)]].append(i)\n return m\n def __str__(self):\n return f\"{self.ul()}\"\n def __setitem__(self,i,v):\n self.l[i]=v\nu=uf(N)\nfor i in range(M):\n u.me(*map(lambda x: int(x)-1,input().split()))\nprint(N-u.len())", "code2": "import sys\ndef input():\n return sys.stdin.readline()[:-1]\nN,M=map(int,input().split())\nsys.setrecursionlimit(200000)\nclass uf:\n def __init__(self,n):\n self.n=n\n self.l=[-1]*n\n def ro(self,n): \n if self.l[n]<0:\n return n\n r=self.ro(self.l[n])\n self.l[n]=r\n return r\n def me(self,a,b): \n ra=self.ro(a)\n rb=self.ro(b)\n if self.l[ra]>self.l[rb]:\n ra,rb=rb,ra\n if ra!=rb:\n self.l[ra]+=self.l[rb]\n self.l[rb]=ra\n def size(self,n):\n return -self.l[self.ro(n)]\n def sa(self,a,b): \n return self.ro(a)==self.ro(b)\n def rl(self): \n return [i for i,v in enumerate(self.l) if v<0]\n \n def len(self): \n return len(self.rl())\n def ul(self):\n d={n:i for i,n in enumerate(self.rl())}\n m=[[]for i in range(self.len())]\n for i in range(self.n):\n m[d[self.ro(i)]].append(i)\n return m\n def __str__(self):\n return f\"{self.ul()}\"\n def __setitem__(self,i,v):\n self.l[i]=v\nu=uf(N)\nfor i in range(M):\n u.me(*map(lambda x: int(x)-1,input().split()))\nprint(u.len()-1)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601487973", "date2": "1601488061", "bleu_score": "0.9966902756500268", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 90, "input": "34 1\n2 13\n", "actual_output": "1\n", "expected_output": "32\n\n", "anno_code": ["import sys\ndef input(): # (0): input=\n return sys.stdin.readline()[:-1]\nN,M=map(int,input().split()) # (1): N=34, M=1\nsys.setrecursionlimit(200000) # (2): NO CHANGE\nclass uf: # (3): uf=\n def __init__(self,n):\n self.n=n # (5): NO CHANGE\n self.l=[-1]*n # (6): sys=, input=, N=34, M=1, uf=, u\n def ro(self,n): \n if self.l[n]<0: # (10): a=1, b=12, ra=1 (12): a=1, b=12, ra=1, rb=12\n return n\n r=self.ro(self.l[n])\n self.l[n]=r\n return r\n def me(self,a,b): \n ra=self.ro(a) # (9): n=1\n rb=self.ro(b) # (11): n=12\n if self.l[ra]>self.l[rb]: # (13): NO CHANGE\n ra,rb=rb,ra\n if ra!=rb: # (14): NO CHANGE\n self.l[ra]+=self.l[rb] # (15): NO CHANGE\n self.l[rb]=ra # (16): sys=, input=, N=34, M=1, uf=, u, i=0\n def size(self,n):\n return -self.l[self.ro(n)]\n def sa(self,a,b): \n return self.ro(a)==self.ro(b)\n def rl(self): \n return [i for i,v in enumerate(self.l) if v<0]\n \n def len(self): \n return len(self.rl())\n def ul(self):\n d={n:i for i,n in enumerate(self.rl())}\n m=[[]for i in range(self.len())]\n for i in range(self.n):\n m[d[self.ro(i)]].append(i)\n return m\n def __str__(self):\n return f\"{self.ul()}\"\n def __setitem__(self,i,v):\n self.l[i]=v\nu=uf(N) # (4): self, n=34\nfor i in range(M): # (7): i=0 (17): NO CHANGE\n u.me(*map(lambda x: int(x)-1,input().split())) # (8): self, a=1, b=12\nprint(N-u.len())"], "anno_status": [false], "diff_content": " import sys\n def input():\n return sys.stdin.readline()[:-1]\n N,M=map(int,input().split())\n sys.setrecursionlimit(200000)\n class uf:\n def __init__(self,n):\n self.n=n\n self.l=[-1]*n\n def ro(self,n): \n if self.l[n]<0:\n return n\n r=self.ro(self.l[n])\n self.l[n]=r\n return r\n def me(self,a,b): \n ra=self.ro(a)\n rb=self.ro(b)\n if self.l[ra]>self.l[rb]:\n ra,rb=rb,ra\n if ra!=rb:\n self.l[ra]+=self.l[rb]\n self.l[rb]=ra\n def size(self,n):\n return -self.l[self.ro(n)]\n def sa(self,a,b): \n return self.ro(a)==self.ro(b)\n def rl(self): \n return [i for i,v in enumerate(self.l) if v<0]\n \n def len(self): \n return len(self.rl())\n def ul(self):\n d={n:i for i,n in enumerate(self.rl())}\n m=[[]for i in range(self.len())]\n for i in range(self.n):\n m[d[self.ro(i)]].append(i)\n return m\n def __str__(self):\n return f\"{self.ul()}\"\n def __setitem__(self,i,v):\n self.l[i]=v\n u=uf(N)\n for i in range(M):\n u.me(*map(lambda x: int(x)-1,input().split()))\n-print(N-u.len())\n+print(u.len()-1)\n", "FL_content": " import sys\n def input():\n return sys.stdin.readline()[:-1]\n N,M=map(int,input().split())\n sys.setrecursionlimit(200000)\n class uf:\n def __init__(self,n):\n self.n=n\n self.l=[-1]*n\n def ro(self,n): \n if self.l[n]<0:\n return n\n r=self.ro(self.l[n])\n self.l[n]=r\n return r\n def me(self,a,b): \n ra=self.ro(a)\n rb=self.ro(b)\n if self.l[ra]>self.l[rb]:\n ra,rb=rb,ra\n if ra!=rb:\n self.l[ra]+=self.l[rb]\n self.l[rb]=ra\n def size(self,n):\n return -self.l[self.ro(n)]\n def sa(self,a,b): \n return self.ro(a)==self.ro(b)\n def rl(self): \n return [i for i,v in enumerate(self.l) if v<0]\n \n def len(self): \n return len(self.rl())\n def ul(self):\n d={n:i for i,n in enumerate(self.rl())}\n m=[[]for i in range(self.len())]\n for i in range(self.n):\n m[d[self.ro(i)]].append(i)\n return m\n def __str__(self):\n return f\"{self.ul()}\"\n def __setitem__(self,i,v):\n self.l[i]=v\n u=uf(N)\n for i in range(M):\n u.me(*map(lambda x: int(x)-1,input().split()))\n-print(N-u.len())\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 46 }, { "user_id": "u325282913", "problem_id": "p02536", "submission1_id": "s572488360", "submission2_id": "s842874791", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nclass UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n def size(self, x):\n return -self.parents[self.find(x)]\n def same(self, x, y):\n return self.find(x) == self.find(y)\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n def group_count(self):\n return len(self.roots())\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n\n\nN, M = map(int, input().split())\nuf = UnionFind(N)\nans = 0\nfor i in range(M):\n A, B = map(int, input().split())\n if not uf.same(A-1,B-1):\n ans += 1\n else:\n uf.union(A-1,B-1)\nprint(ans)", "code2": "class UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n def size(self, x):\n return -self.parents[self.find(x)]\n def same(self, x, y):\n return self.find(x) == self.find(y)\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n def group_count(self):\n return len(self.roots())\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n\n\nN, M = map(int, input().split())\nuf = UnionFind(N)\nans = 0\nfor i in range(M):\n A, B = map(int, input().split())\n uf.union(A-1,B-1)\nprint(uf.group_count()-1)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601168806", "date2": "1601168911", "bleu_score": "0.9541932878845013", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 90, "input": "27 1\n1 1\n", "actual_output": "0\n", "expected_output": "26\n\n", "anno_code": ["\nclass UnionFind(): # (0): UnionFind=\n def __init__(self, n):\n self.n = n # (3): NO CHANGE\n self.parents = [-1] * n # (4): UnionFind=, N=27, M=1, uf=0: [0] 1: [1] 2: [2] 3: [3] 4: [4] 5: [5] 6: [6] 7: [7] 8: [8] 9: [9] 10: [10] 11: [11] 12: [12] 13: [13] 14: [14] 15: [15] 16: [16] 17: [17] 18: [18] 19: [19] 20: [20] 21: [21] 22: [22] 23: [23] 24: [24] 25: [25] 26: [26]\n def find(self, x):\n if self.parents[x] < 0: # (9): NO CHANGE (10): UnionFind=, N=27, M=1, uf=0: [0] 1: [1] 2: [2] 3: [3] 4: [4] 5: [5] 6: [6] 7: [7] 8: [8] 9: [9] 10: [10] 11: [11] 12: [12] 13: [13] 14: [14] 15: [15] 16: [16] 17: [17] 18: [18] 19: [19] 20: [20] 21: [21] 22: [22] 23: [23] 24: [24] 25: [25] 26: [26], ans=0, i=0, A=1, B=1 ... (15): y=0\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n def union(self, x, y):\n x = self.find(x) # (12): NO CHANGE\n y = self.find(y) # (14): NO CHANGE\n if x == y: # (16): NO CHANGE\n return # (17): UnionFind=, N=27, M=1, uf=0: [0] 1: [1] 2: [2] 3: [3] 4: [4] 5: [5] 6: [6] 7: [7] 8: [8] 9: [9] 10: [10] 11: [11] 12: [12] 13: [13] 14: [14] 15: [15] 16: [16] 17: [17] 18: [18] 19: [19] 20: [20] 21: [21] 22: [22] 23: [23] 24: [24] 25: [25] 26: [26], ans=0, i=0, A=1, B=1\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n def size(self, x):\n return -self.parents[self.find(x)]\n def same(self, x, y):\n return self.find(x) == self.find(y)\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n def group_count(self):\n return len(self.roots())\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n\n\nN, M = map(int, input().split()) # (1): N=27, M=1\nuf = UnionFind(N) # (2): self=0: [0] 1: [1] 2: [2] 3: [3] 4: [4] 5: [5] 6: [6] 7: [7] 8: [8] 9: [9] 10: [10] 11: [11] 12: [12] 13: [13] 14: [14] 15: [15] 16: [16] 17: [17] 18: [18] 19: [19] 20: [20] 21: [21] 22: [22] 23: [23] 24: [24] 25: [25] 26: [26], n=27\nans = 0 # (5): ans=0\nfor i in range(M): # (6): i=0 (18): NO CHANGE\n A, B = map(int, input().split()) # (7): A=1, B=1\n if not uf.same(A-1,B-1): # (8): self=0: [0] 1: [1] 2: [2] 3: [3] 4: [4] 5: [5] 6: [6] 7: [7] 8: [8] 9: [9] 10: [10] 11: [11] 12: [12] 13: [13] 14: [14] 15: [15] 16: [16] 17: [17] 18: [18] 19: [19] 20: [20] 21: [21] 22: [22] 23: [23] 24: [24] 25: [25] 26: [26], x=0\n ans += 1\n else:\n uf.union(A-1,B-1) # (11): self=0: [0] 1: [1] 2: [2] 3: [3] 4: [4] 5: [5] 6: [6] 7: [7] 8: [8] 9: [9] 10: [10] 11: [11] 12: [12] 13: [13] 14: [14] 15: [15] 16: [16] 17: [17] 18: [18] 19: [19] 20: [20] 21: [21] 22: [22] 23: [23] 24: [24] 25: [25] 26: [26], x=0, y=0\nprint(ans)"], "anno_status": [false], "diff_content": "-\n class UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n def size(self, x):\n return -self.parents[self.find(x)]\n def same(self, x, y):\n return self.find(x) == self.find(y)\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n def group_count(self):\n return len(self.roots())\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n \n \n N, M = map(int, input().split())\n uf = UnionFind(N)\n ans = 0\n for i in range(M):\n A, B = map(int, input().split())\n- if not uf.same(A-1,B-1):\n- ans += 1\n- else:\n- uf.union(A-1,B-1)\n-print(ans)\n+ uf.union(A-1,B-1)\n+print(uf.group_count()-1)\n", "FL_content": "-\n class UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n def size(self, x):\n return -self.parents[self.find(x)]\n def same(self, x, y):\n return self.find(x) == self.find(y)\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n def group_count(self):\n return len(self.roots())\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n \n \n N, M = map(int, input().split())\n uf = UnionFind(N)\n ans = 0\n for i in range(M):\n A, B = map(int, input().split())\n- if not uf.same(A-1,B-1):\n- ans += 1\n- else:\n- uf.union(A-1,B-1)\n-print(ans)\n", "added_lines": 2, "removed_lines": 6, "code1_lines": 47 }, { "user_id": "u344276999", "problem_id": "p02536", "submission1_id": "s233953844", "submission2_id": "s598323519", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nclass UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n\n if x == y:\n return\n\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n\n def size(self, x):\n return -self.parents[self.find(x)]\n\n def same(self, x, y):\n return self.find(x) == self.find(y)\n\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n\n def group_count(self):\n return len(self.roots())\n\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n\n\ndef main():\n N, M = [int(i) for i in input().split()]\n uf = UnionFind(N)\n for i in range(M):\n A,B = [int(i) for i in input().split()]\n uf.union(A-1,B-1)\n print(N-uf.group_count())\n\nif __name__ == \"__main__\":\n main()", "code2": "\nclass UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n\n if x == y:\n return\n\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n\n def size(self, x):\n return -self.parents[self.find(x)]\n\n def same(self, x, y):\n return self.find(x) == self.find(y)\n\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n\n def group_count(self):\n return len(self.roots())\n\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n\n\ndef main():\n N, M = [int(i) for i in input().split()]\n uf = UnionFind(N)\n for i in range(M):\n A,B = [int(i) for i in input().split()]\n uf.union(A-1,B-1)\n print(uf.group_count()-1)\n\nif __name__ == \"__main__\":\n main()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1601171737", "date2": "1601171872", "bleu_score": "0.9965831936604791", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 90, "input": "18 1\n1 2\n", "actual_output": "1\n", "expected_output": "16\n\n", "anno_code": ["\nclass UnionFind(): # (0): UnionFind=\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n\n if x == y:\n return\n\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n\n def size(self, x):\n return -self.parents[self.find(x)]\n\n def same(self, x, y):\n return self.find(x) == self.find(y)\n\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n\n def group_count(self):\n return len(self.roots())\n\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n\n\ndef main(): # (1): main=\n N, M = [int(i) for i in input().split()]\n uf = UnionFind(N)\n for i in range(M):\n A,B = [int(i) for i in input().split()]\n uf.union(A-1,B-1)\n print(N-uf.group_count())\n\nif __name__ == \"__main__\":\n main()"], "anno_status": [false], "diff_content": " \n class UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n \n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n \n if x == y:\n return\n \n if self.parents[x] > self.parents[y]:\n x, y = y, x\n \n self.parents[x] += self.parents[y]\n self.parents[y] = x\n \n def size(self, x):\n return -self.parents[self.find(x)]\n \n def same(self, x, y):\n return self.find(x) == self.find(y)\n \n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n \n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n \n def group_count(self):\n return len(self.roots())\n \n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n \n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n \n \n def main():\n N, M = [int(i) for i in input().split()]\n uf = UnionFind(N)\n for i in range(M):\n A,B = [int(i) for i in input().split()]\n uf.union(A-1,B-1)\n- print(N-uf.group_count())\n+ print(uf.group_count()-1)\n \n if __name__ == \"__main__\":\n main()\n", "FL_content": " \n class UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n \n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n \n if x == y:\n return\n \n if self.parents[x] > self.parents[y]:\n x, y = y, x\n \n self.parents[x] += self.parents[y]\n self.parents[y] = x\n \n def size(self, x):\n return -self.parents[self.find(x)]\n \n def same(self, x, y):\n return self.find(x) == self.find(y)\n \n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n \n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n \n def group_count(self):\n return len(self.roots())\n \n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n \n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n \n \n def main():\n N, M = [int(i) for i in input().split()]\n uf = UnionFind(N)\n for i in range(M):\n A,B = [int(i) for i in input().split()]\n uf.union(A-1,B-1)\n- print(N-uf.group_count())\n \n if __name__ == \"__main__\":\n main()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 59 }, { "user_id": "u430726059", "problem_id": "p02536", "submission1_id": "s711493104", "submission2_id": "s747708610", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class UnionFind():\n \n \n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, x):\n \n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n \n def unite(self, x, y):\n \n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n \n def size(self, x):\n \n return -self.parents[self.find(x)]\n \n def same(self, x, y):\n \n return self.find(x) == self.find(y)\n \n def members(self, x):\n \n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n \n def roots(self):\n \n return [i for i, x in enumerate(self.parents) if x < 0]\n \n def group_count(self):\n \n return len(self.roots())\n \nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\n \n \n \nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\nn,m=map(int,input().split())\nu=UnionFind(n)\nfor i in range(m):\n a,b=map(int,input().split())\n a-=1\n b-=1\n u.unite(a,b)\nprint(n-len(u.roots()))", "code2": "class UnionFind():\n \n \n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, x):\n \n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n \n def unite(self, x, y):\n \n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n \n def size(self, x):\n \n return -self.parents[self.find(x)]\n \n def same(self, x, y):\n \n return self.find(x) == self.find(y)\n \n def members(self, x):\n \n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n \n def roots(self):\n \n return [i for i, x in enumerate(self.parents) if x < 0]\n \n def group_count(self):\n \n return len(self.roots())\n \nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\n \n \n \nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\nn,m=map(int,input().split())\nu=UnionFind(n)\nfor i in range(m):\n a,b=map(int,input().split())\n a-=1\n b-=1\n u.unite(a,b)\nprint(len(u.roots())-1)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1601170627", "date2": "1601170853", "bleu_score": "0.9968957596679202", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 90, "input": "13 1\n4 2\n", "actual_output": "1\n", "expected_output": "11\n\n", "anno_code": ["class UnionFind(): # (0): UnionFind=, sys=\n \n \n def __init__(self, n):\n self.n = n # (7): NO CHANGE\n self.parents = [-1] * n # (8): UnionFind=, sys=, input=, m=1, u=\n \n def find(self, x):\n \n if self.parents[x] < 0: # (15): y=1 (17): x=3, y=1\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n \n def unite(self, x, y):\n \n x = self.find(x) # (14): NO CHANGE\n y = self.find(y) # (16): x=1\n if x == y: # (18): NO CHANGE\n return\n if self.parents[x] > self.parents[y]: # (19): NO CHANGE\n x, y = y, x\n self.parents[x] += self.parents[y] # (20): NO CHANGE\n self.parents[y] = x # (21): UnionFind=, sys=, input=, n=13, m=1, u=, i=0, a=3, b=1\n \n def size(self, x):\n \n return -self.parents[self.find(x)]\n \n def same(self, x, y):\n \n return self.find(x) == self.find(y)\n \n def members(self, x):\n \n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n \n def roots(self):\n \n return [i for i, x in enumerate(self.parents) if x < 0]\n \n def group_count(self):\n \n return len(self.roots())\n \nimport sys\nsys.setrecursionlimit(10**9) # (1): NO CHANGE\ninput = sys.stdin.readline # (2): input=\n \n \n \nimport sys\nsys.setrecursionlimit(10**9) # (3): NO CHANGE\ninput = sys.stdin.readline # (4): NO CHANGE\nn,m=map(int,input().split()) # (5): n=13, m=1\nu=UnionFind(n) # (6): self=\nfor i in range(m): # (9): i=0 (22): NO CHANGE\n a,b=map(int,input().split()) # (10): a=4, b=2\n a-=1 # (11): a=3\n b-=1 # (12): b=1\n u.unite(a,b) # (13): self=, x=3, y=1\nprint(n-len(u.roots()))"], "anno_status": [false], "diff_content": " class UnionFind():\n \n \n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, x):\n \n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n \n def unite(self, x, y):\n \n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n \n def size(self, x):\n \n return -self.parents[self.find(x)]\n \n def same(self, x, y):\n \n return self.find(x) == self.find(y)\n \n def members(self, x):\n \n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n \n def roots(self):\n \n return [i for i, x in enumerate(self.parents) if x < 0]\n \n def group_count(self):\n \n return len(self.roots())\n \n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n \n \n \n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n n,m=map(int,input().split())\n u=UnionFind(n)\n for i in range(m):\n a,b=map(int,input().split())\n a-=1\n b-=1\n u.unite(a,b)\n-print(n-len(u.roots()))\n+print(len(u.roots())-1)\n", "FL_content": " class UnionFind():\n \n \n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, x):\n \n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n \n def unite(self, x, y):\n \n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n \n def size(self, x):\n \n return -self.parents[self.find(x)]\n \n def same(self, x, y):\n \n return self.find(x) == self.find(y)\n \n def members(self, x):\n \n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n \n def roots(self):\n \n return [i for i, x in enumerate(self.parents) if x < 0]\n \n def group_count(self):\n \n return len(self.roots())\n \n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n \n \n \n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n n,m=map(int,input().split())\n u=UnionFind(n)\n for i in range(m):\n a,b=map(int,input().split())\n a-=1\n b-=1\n u.unite(a,b)\n-print(n-len(u.roots()))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 64 }, { "user_id": "u787792408", "problem_id": "p02536", "submission1_id": "s586570388", "submission2_id": "s231824049", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m = map(int,input().split())\n\nans = 0\n\nclass UnionFind:\n def __init__(self,n):\n self.root = [i for i in range(n+1)]\n\n def Root_Find(self,x):\n if self.root[x] == x:\n return x\n else:\n self.root[x] = self.Root_Find(self.root[x])\n return self.root[x]\n\n def Unite(self,x,y):\n x = self.Root_Find(x)\n y = self.Root_Find(y)\n if x == y:\n return\n self.root[y] = x\n\ntree = UnionFind(n)\n\nfor i in range(m):\n a,b = map(int,input().split())\n tree.Unite(a,b)\n \nans = len(list(set(tree.root))) - 1\nprint(ans)", "code2": "n,m = map(int,input().split())\n\nans = 0\n\nclass UnionFind:\n def __init__(self,n):\n self.root = [i for i in range(n+1)]\n\n def Root_Find(self,x):\n if self.root[x] == x:\n return x\n else:\n self.root[x] = self.Root_Find(self.root[x])\n return self.root[x]\n\n def Unite(self,x,y):\n x = self.Root_Find(x)\n y = self.Root_Find(y)\n if x == y:\n return\n self.root[y] = x\n\ntree = UnionFind(n)\n\nfor i in range(m):\n a,b = map(int,input().split())\n tree.Unite(a,b)\n\nfor i in range(n+1):\n tree.Root_Find(i)\n\nans = len(list(set(tree.root))) - 2\nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601191605", "date2": "1601192172", "bleu_score": "0.930822391674332", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 90, "input": "5 1\n1 1\n", "actual_output": "5\n", "expected_output": "4\n\n", "anno_code": ["n,m = map(int,input().split()) # (0): n=5, m=1\n\nans = 0 # (1): ans=0\n\nclass UnionFind: # (2): UnionFind=\n def __init__(self,n):\n self.root = [i for i in range(n+1)] # (4): m=1, ans=0, UnionFind=, tree=\n\n def Root_Find(self,x):\n if self.root[x] == x: # (9): y=1 (11): y=1\n return x\n else:\n self.root[x] = self.Root_Find(self.root[x])\n return self.root[x]\n\n def Unite(self,x,y):\n x = self.Root_Find(x) # (8): NO CHANGE\n y = self.Root_Find(y) # (10): NO CHANGE\n if x == y: # (12): NO CHANGE\n return # (13): n=5, m=1, ans=0, UnionFind=, tree=, i=0, a=1, b=1\n self.root[y] = x\n\ntree = UnionFind(n) # (3): self=\n\nfor i in range(m): # (5): i=0 (14): NO CHANGE\n a,b = map(int,input().split()) # (6): a=1, b=1\n tree.Unite(a,b) # (7): self=, x=1, y=1\n \nans = len(list(set(tree.root))) - 1 # (15): ans=5\nprint(ans)"], "anno_status": [true], "diff_content": " n,m = map(int,input().split())\n \n ans = 0\n \n class UnionFind:\n def __init__(self,n):\n self.root = [i for i in range(n+1)]\n \n def Root_Find(self,x):\n if self.root[x] == x:\n return x\n else:\n self.root[x] = self.Root_Find(self.root[x])\n return self.root[x]\n \n def Unite(self,x,y):\n x = self.Root_Find(x)\n y = self.Root_Find(y)\n if x == y:\n return\n self.root[y] = x\n \n tree = UnionFind(n)\n \n for i in range(m):\n a,b = map(int,input().split())\n tree.Unite(a,b)\n- \n-ans = len(list(set(tree.root))) - 1\n+\n+for i in range(n+1):\n+ tree.Root_Find(i)\n+\n+ans = len(list(set(tree.root))) - 2\n print(ans)\n", "FL_content": " n,m = map(int,input().split())\n \n ans = 0\n \n class UnionFind:\n def __init__(self,n):\n self.root = [i for i in range(n+1)]\n \n def Root_Find(self,x):\n if self.root[x] == x:\n return x\n else:\n self.root[x] = self.Root_Find(self.root[x])\n return self.root[x]\n \n def Unite(self,x,y):\n x = self.Root_Find(x)\n y = self.Root_Find(y)\n if x == y:\n return\n self.root[y] = x\n \n tree = UnionFind(n)\n \n for i in range(m):\n a,b = map(int,input().split())\n tree.Unite(a,b)\n- \n-ans = len(list(set(tree.root))) - 1\n print(ans)\n", "added_lines": 5, "removed_lines": 2, "code1_lines": 30 }, { "user_id": "u536017058", "problem_id": "p02536", "submission1_id": "s052588276", "submission2_id": "s850695324", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class UnionFind:\n __slots__ = [\"_data_size\", \"_roots\"]\n \n def __init__(self, data_size: int) -> None:\n self._data_size = data_size\n self._roots = [-1] * data_size\n \n def __getitem__(self, x: int) -> int:\n while self._roots[x] >= 0:\n x = self._roots[x]\n return x\n \n def is_connected(self, x: int, y: int) -> bool:\n return self[x] == self[y]\n \n def unite(self, x: int, y: int) -> None:\n x, y = self[x], self[y]\n if x == y:\n return\n if self._roots[x] > self._roots[y]:\n x, y = y, x\n self._roots[x] += self._roots[y]\n self._roots[y] = x\n \n \nimport sys\n \nreadline = sys.stdin.readline\n \nN, Q = map(int, readline().split())\ntree = UnionFind(N)\nres = []\nans=0\nfor _ in range(Q):\n u, v = map(int, readline().split())\n tree.unite(u-1, v-1)\nfor u in range(1,N):\n \n if not tree.is_connected(u, 0):\n ans+=1\n tree.unite(u-1, 0)\nprint(ans)\n", "code2": "class UnionFind:\n __slots__ = [\"_data_size\", \"_roots\"]\n \n def __init__(self, data_size: int) -> None:\n self._data_size = data_size\n self._roots = [-1] * data_size\n \n def __getitem__(self, x: int) -> int:\n while self._roots[x] >= 0:\n x = self._roots[x]\n return x\n \n def is_connected(self, x: int, y: int) -> bool:\n return self[x] == self[y]\n \n def unite(self, x: int, y: int) -> None:\n x, y = self[x], self[y]\n if x == y:\n return\n if self._roots[x] > self._roots[y]:\n x, y = y, x\n self._roots[x] += self._roots[y]\n self._roots[y] = x\n \n \nimport sys\n \nreadline = sys.stdin.readline\n \nN, Q = map(int, readline().split())\ntree = UnionFind(N)\nres = []\nans=0\nfor _ in range(Q):\n u, v = map(int, readline().split())\n tree.unite(u-1, v-1)\nfor u in range(1,N):\n if not tree.is_connected(u, 0):\n ans+=1\n tree.unite(u, 0)\nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601170975", "date2": "1601171158", "bleu_score": "0.99319687513348", "code1_test_status": [1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 83, "total_score": 90, "input": "6 1\n3 4\n", "actual_output": "5\n", "expected_output": "4\n\n", "anno_code": ["class UnionFind: # (0): UnionFind=, sys=\n __slots__ = [\"_data_size\", \"_roots\"]\n \n def __init__(self, data_size: int) -> None:\n self._data_size = data_size # (4): NO CHANGE\n self._roots = [-1] * data_size # (5): UnionFind=, sys=, readline=, N=6, Q=1, tree=\n \n def __getitem__(self, x: int) -> int:\n while self._roots[x] >= 0: # (12): x=3 (13): x=2, y=3 ... (99): x=4, y=2\n x = self._roots[x] # (46): x=2 (49): x=1 ... (98): x=2\n return x\n \n def is_connected(self, x: int, y: int) -> bool:\n return self[x] == self[y]\n \n def unite(self, x: int, y: int) -> None:\n x, y = self[x], self[y] # (11): NO CHANGE (25): NO CHANGE ... (93): NO CHANGE\n if x == y: # (14): NO CHANGE (28): NO CHANGE ... (100): NO CHANGE\n return # (29): UnionFind=, sys=, readline=, N=6, Q=1, tree=, res=[], ans=1, _=0, u=1, v=4 (82): UnionFind=, sys=, readline=, N=6, Q=1, tree=, res=[], ans=4, _=0, u=4, v=4\n if self._roots[x] > self._roots[y]: # (15): NO CHANGE (40): NO CHANGE ... (101): NO CHANGE\n x, y = y, x # (102): x=2, y=4\n self._roots[x] += self._roots[y] # (16): NO CHANGE (41): NO CHANGE ... (103): NO CHANGE\n self._roots[y] = x # (17): UnionFind=, sys=, readline=, N=6, Q=1, tree=, res=[], ans=0, _=0, u=3, v=4 (42): UnionFind=, sys=, readline=, N=6, Q=1, tree=, res=[], ans=2, _=0, u=2, v=4 ... (104): UnionFind=, sys=, readline=, N=6, Q=1, tree=, res=[], ans=5, _=0, u=5, v=4\n \n \nimport sys\n \nreadline = sys.stdin.readline # (1): readline=\n \nN, Q = map(int, readline().split()) # (2): N=6, Q=1\ntree = UnionFind(N) # (3): self=, data_size=6\nres = [] # (6): res=[]\nans=0 # (7): ans=0\nfor _ in range(Q): # (8): _=0 (18): NO CHANGE\n u, v = map(int, readline().split()) # (9): u=3, v=4\n tree.unite(u-1, v-1) # (10): self=, x=2, y=3\nfor u in range(1,N): # (19): u=1 (30): u=2 ... (105): NO CHANGE\n \n if not tree.is_connected(u, 0): # (20): self=, x=1 (31): self=, x=2 ... (84): self=, x=5\n ans+=1 # (23): ans=1 (34): ans=2 ... (91): ans=5\n tree.unite(u-1, 0) # (24): self=, x=0, y=0 (35): self=, x=1, y=0 ... (92): self=, x=4, y=0\nprint(ans)\n"], "anno_status": [false], "diff_content": " class UnionFind:\n __slots__ = [\"_data_size\", \"_roots\"]\n \n def __init__(self, data_size: int) -> None:\n self._data_size = data_size\n self._roots = [-1] * data_size\n \n def __getitem__(self, x: int) -> int:\n while self._roots[x] >= 0:\n x = self._roots[x]\n return x\n \n def is_connected(self, x: int, y: int) -> bool:\n return self[x] == self[y]\n \n def unite(self, x: int, y: int) -> None:\n x, y = self[x], self[y]\n if x == y:\n return\n if self._roots[x] > self._roots[y]:\n x, y = y, x\n self._roots[x] += self._roots[y]\n self._roots[y] = x\n \n \n import sys\n \n readline = sys.stdin.readline\n \n N, Q = map(int, readline().split())\n tree = UnionFind(N)\n res = []\n ans=0\n for _ in range(Q):\n u, v = map(int, readline().split())\n tree.unite(u-1, v-1)\n for u in range(1,N):\n- \n if not tree.is_connected(u, 0):\n ans+=1\n- tree.unite(u-1, 0)\n+ tree.unite(u, 0)\n print(ans)\n \n", "FL_content": " class UnionFind:\n __slots__ = [\"_data_size\", \"_roots\"]\n \n def __init__(self, data_size: int) -> None:\n self._data_size = data_size\n self._roots = [-1] * data_size\n \n def __getitem__(self, x: int) -> int:\n while self._roots[x] >= 0:\n x = self._roots[x]\n return x\n \n def is_connected(self, x: int, y: int) -> bool:\n return self[x] == self[y]\n \n def unite(self, x: int, y: int) -> None:\n x, y = self[x], self[y]\n if x == y:\n return\n if self._roots[x] > self._roots[y]:\n x, y = y, x\n self._roots[x] += self._roots[y]\n self._roots[y] = x\n \n \n import sys\n \n readline = sys.stdin.readline\n \n N, Q = map(int, readline().split())\n tree = UnionFind(N)\n res = []\n ans=0\n for _ in range(Q):\n u, v = map(int, readline().split())\n tree.unite(u-1, v-1)\n for u in range(1,N):\n- \n if not tree.is_connected(u, 0):\n ans+=1\n- tree.unite(u-1, 0)\n print(ans)\n \n", "added_lines": 1, "removed_lines": 2, "code1_lines": 43 }, { "user_id": "u467463073", "problem_id": "p02536", "submission1_id": "s248364858", "submission2_id": "s694658836", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n\n if x == y:\n return\n\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n\n def size(self, x):\n return -self.parents[self.find(x)]\n\n def same(self, x, y):\n return self.find(x) == self.find(y)\n\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n\n def group_count(self):\n return len(self.roots())\n\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n\nN,M = map(int,input().split())\nAB= [list(map(int,input().split())) for _ in range(M)]\n\nuf = UnionFind(N)\nfor ab in AB:\n uf.union(ab[0]-1,ab[1]-1)\nprint(N-uf.group_count())", "code2": "class UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n\n if x == y:\n return\n\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n\n def size(self, x):\n return -self.parents[self.find(x)]\n\n def same(self, x, y):\n return self.find(x) == self.find(y)\n\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n\n def group_count(self):\n return len(self.roots())\n\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n\nN,M = map(int,input().split())\nAB= [list(map(int,input().split())) for _ in range(M)]\n\nuf = UnionFind(N)\nfor ab in AB:\n uf.union(ab[0]-1,ab[1]-1)\nprint(uf.group_count()-1)\n\n\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1601169602", "date2": "1601169998", "bleu_score": "0.994704836681692", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 90, "input": "42 1\n1 6\n", "actual_output": "1\n", "expected_output": "40\n\n", "anno_code": ["class UnionFind(): # (0): UnionFind=\n def __init__(self, n):\n self.n = n # (4): NO CHANGE\n self.parents = [-1] * n # (5): UnionFind=, N=42, M=1, AB\n\n def find(self, x):\n if self.parents[x] < 0: # (9): y=5 (11): x=0, y=5\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n\n def union(self, x, y):\n x = self.find(x) # (8): NO CHANGE\n y = self.find(y) # (10): x=5\n\n if x == y: # (12): NO CHANGE\n return\n\n if self.parents[x] > self.parents[y]: # (13): NO CHANGE\n x, y = y, x\n\n self.parents[x] += self.parents[y] # (14): NO CHANGE\n self.parents[y] = x # (15): UnionFind=, N=42, M=1, AB, ab=[1, 6]\n\n def size(self, x):\n return -self.parents[self.find(x)]\n\n def same(self, x, y):\n return self.find(x) == self.find(y)\n\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n\n def group_count(self):\n return len(self.roots())\n\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n\nN,M = map(int,input().split()) # (1): N=42, M=1\nAB= [list(map(int,input().split())) for _ in range(M)] # (2): AB\n\nuf = UnionFind(N) # (3): self=0: [0, 5] 1: [1] 2: [2] 3: [3] 4: [4] 6: [6] 7: [7] 8: [8] 9: [9] 10: [10] 11: [11] 12: [12] 13: [13] 14: [14] 15: [15] 16: [16] 17: [17] 18: [18] 19: [19] 20: [20] 21: [21] 22: [22] 23: [23] 24: [24] 25: [25] 26: [26] 27: [27] 28: [28] 29: [29] 30: [30] 31: [31] 32: [32] 33: [33] 34: [34] 35: [35] 36: [36] 37: [37] 38: [38] 39: [39] 40: [40] 41: [41], n=42\nfor ab in AB: # (6): ab=[1, 6] (16): NO CHANGE\n uf.union(ab[0]-1,ab[1]-1) # (7): self=0: [0, 5] 1: [1] 2: [2] 3: [3] 4: [4] 6: [6] 7: [7] 8: [8] 9: [9] 10: [10] 11: [11] 12: [12] 13: [13] 14: [14] 15: [15] 16: [16] 17: [17] 18: [18] 19: [19] 20: [20] 21: [21] 22: [22] 23: [23] 24: [24] 25: [25] 26: [26] 27: [27] 28: [28] 29: [29] 30: [30] 31: [31] 32: [32] 33: [33] 34: [34] 35: [35] 36: [36] 37: [37] 38: [38] 39: [39] 40: [40] 41: [41], x=0, y=5\nprint(N-uf.group_count())"], "anno_status": [false], "diff_content": " class UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n \n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n \n if x == y:\n return\n \n if self.parents[x] > self.parents[y]:\n x, y = y, x\n \n self.parents[x] += self.parents[y]\n self.parents[y] = x\n \n def size(self, x):\n return -self.parents[self.find(x)]\n \n def same(self, x, y):\n return self.find(x) == self.find(y)\n \n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n \n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n \n def group_count(self):\n return len(self.roots())\n \n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n \n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n \n N,M = map(int,input().split())\n AB= [list(map(int,input().split())) for _ in range(M)]\n \n uf = UnionFind(N)\n for ab in AB:\n uf.union(ab[0]-1,ab[1]-1)\n-print(N-uf.group_count())\n+print(uf.group_count()-1)\n+\n+\n+\n", "FL_content": " class UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n \n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n \n if x == y:\n return\n \n if self.parents[x] > self.parents[y]:\n x, y = y, x\n \n self.parents[x] += self.parents[y]\n self.parents[y] = x\n \n def size(self, x):\n return -self.parents[self.find(x)]\n \n def same(self, x, y):\n return self.find(x) == self.find(y)\n \n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n \n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n \n def group_count(self):\n return len(self.roots())\n \n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n \n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n \n N,M = map(int,input().split())\n AB= [list(map(int,input().split())) for _ in range(M)]\n \n uf = UnionFind(N)\n for ab in AB:\n uf.union(ab[0]-1,ab[1]-1)\n-print(N-uf.group_count())\n", "added_lines": 4, "removed_lines": 1, "code1_lines": 54 }, { "user_id": "u102655885", "problem_id": "p02536", "submission1_id": "s561277202", "submission2_id": "s132965694", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nclass UnionFind:\n def __init__(self, size):\n self.parent_indexes = [-1] * size\n \n def find(self, n):\n if self.parent_indexes[n] < 0:\n return n\n \n \n self.parent_indexes[n] = self.find(self.parent_indexes[n])\n return self.parent_indexes[n] \n \n def union(self, n1, n2):\n if self.same_group(n1, n2):\n return False\n \n \n if self.size(n1) >= self.size(n2):\n tmp = self.size(n2)\n self.parent_indexes[self.find(n2)] = self.find(n1)\n self.parent_indexes[self.find(n1)] -= tmp\n return True\n \n \n tmp = self.size(n1)\n self.parent_indexes[self.find(n1)] = self.find(n2)\n self.parent_indexes[self.find(n2)] -= tmp\n return True\n \n \n def size(self, n):\n return -self.parent_indexes[self.find(n)]\n \n def same_group(self, n1, n2):\n return self.find(n1) == self.find(n2)\n\nn, m = map(lambda x: int(x), input().split())\n\n\nuf = UnionFind(n)\n\nfor _ in range(m):\n a, b = map(lambda x: int(x), input().split())\n uf.union(a-1, b-1)\n \nnum_parents = 0\n \nfor p_index in uf.parent_indexes:\n if p_index < 0:\n num_parents += 1\nprint(math.ceil((math.log2(num_parents))))", "code2": "import math\n\nclass UnionFind:\n def __init__(self, size):\n self.parent_indexes = [-1] * size\n \n def find(self, n):\n if self.parent_indexes[n] < 0:\n return n\n \n \n self.parent_indexes[n] = self.find(self.parent_indexes[n])\n return self.parent_indexes[n] \n \n def union(self, n1, n2):\n if self.same_group(n1, n2):\n return False\n \n \n if self.size(n1) >= self.size(n2):\n tmp = self.size(n2)\n self.parent_indexes[self.find(n2)] = self.find(n1)\n self.parent_indexes[self.find(n1)] -= tmp\n return True\n \n \n tmp = self.size(n1)\n self.parent_indexes[self.find(n1)] = self.find(n2)\n self.parent_indexes[self.find(n2)] -= tmp\n return True\n \n \n def size(self, n):\n return -self.parent_indexes[self.find(n)]\n \n def same_group(self, n1, n2):\n return self.find(n1) == self.find(n2)\n\nn, m = map(lambda x: int(x), input().split())\n\n\nuf = UnionFind(n)\n\nfor _ in range(m):\n a, b = map(lambda x: int(x), input().split())\n uf.union(a-1, b-1)\n \nnum_parents = 0\n \nfor p_index in uf.parent_indexes:\n if p_index < 0:\n num_parents += 1\n\nprint(num_parents - 1)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1601169480", "date2": "1601169789", "bleu_score": "0.9797077305005434", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 4, "total_score": 90, "input": "79 1\n2 9\n", "actual_output": "7\n", "expected_output": "77\n\n", "anno_code": ["import math\n\nclass UnionFind: # (0): UnionFind=\n def __init__(self, size):\n self.parent_indexes = [-1] * size # (3): math=, UnionFind=, n=79, m=1, uf=\n \n def find(self, n):\n if self.parent_indexes[n] < 0: # (8): n=8 (9): n1=1, n2=8 ... (19): math=, UnionFind=, n=79, m=1, uf=, _=0, a=2, b=9\n return n\n \n \n self.parent_indexes[n] = self.find(self.parent_indexes[n])\n return self.parent_indexes[n] \n \n def union(self, n1, n2):\n if self.same_group(n1, n2): # (7): n=1\n return False\n \n \n if self.size(n1) >= self.size(n2): # (10): n=1\n tmp = self.size(n2) # (13): n=8\n self.parent_indexes[self.find(n2)] = self.find(n1) # (15): n=1\n self.parent_indexes[self.find(n1)] -= tmp # (18): n=1\n return True\n \n \n tmp = self.size(n1)\n self.parent_indexes[self.find(n1)] = self.find(n2)\n self.parent_indexes[self.find(n2)] -= tmp\n return True\n \n \n def size(self, n):\n return -self.parent_indexes[self.find(n)]\n \n def same_group(self, n1, n2):\n return self.find(n1) == self.find(n2)\n\nn, m = map(lambda x: int(x), input().split()) # (1): n=79, m=1\n\n\nuf = UnionFind(n) # (2): self=, size=79\n\nfor _ in range(m): # (4): _=0 (20): NO CHANGE\n a, b = map(lambda x: int(x), input().split()) # (5): a=2, b=9\n uf.union(a-1, b-1) # (6): self=, n1=1, n2=8\n \nnum_parents = 0 # (21): num_parents=0\n \nfor p_index in uf.parent_indexes: # (22): p_index=-1 (25): p_index=-2 ... (258): NO CHANGE\n if p_index < 0: # (23): NO CHANGE (26): NO CHANGE ... (256): NO CHANGE\n num_parents += 1 # (24): num_parents=1 (27): num_parents=2 ... (257): num_parents=78\nprint(math.ceil((math.log2(num_parents))))"], "anno_status": [false], "diff_content": " import math\n \n class UnionFind:\n def __init__(self, size):\n self.parent_indexes = [-1] * size\n \n def find(self, n):\n if self.parent_indexes[n] < 0:\n return n\n \n \n self.parent_indexes[n] = self.find(self.parent_indexes[n])\n return self.parent_indexes[n] \n \n def union(self, n1, n2):\n if self.same_group(n1, n2):\n return False\n \n \n if self.size(n1) >= self.size(n2):\n tmp = self.size(n2)\n self.parent_indexes[self.find(n2)] = self.find(n1)\n self.parent_indexes[self.find(n1)] -= tmp\n return True\n \n \n tmp = self.size(n1)\n self.parent_indexes[self.find(n1)] = self.find(n2)\n self.parent_indexes[self.find(n2)] -= tmp\n return True\n \n \n def size(self, n):\n return -self.parent_indexes[self.find(n)]\n \n def same_group(self, n1, n2):\n return self.find(n1) == self.find(n2)\n \n n, m = map(lambda x: int(x), input().split())\n \n \n uf = UnionFind(n)\n \n for _ in range(m):\n a, b = map(lambda x: int(x), input().split())\n uf.union(a-1, b-1)\n \n num_parents = 0\n \n for p_index in uf.parent_indexes:\n if p_index < 0:\n num_parents += 1\n-print(math.ceil((math.log2(num_parents))))\n+\n+print(num_parents - 1)\n", "FL_content": " import math\n \n class UnionFind:\n def __init__(self, size):\n self.parent_indexes = [-1] * size\n \n def find(self, n):\n if self.parent_indexes[n] < 0:\n return n\n \n \n self.parent_indexes[n] = self.find(self.parent_indexes[n])\n return self.parent_indexes[n] \n \n def union(self, n1, n2):\n if self.same_group(n1, n2):\n return False\n \n \n if self.size(n1) >= self.size(n2):\n tmp = self.size(n2)\n self.parent_indexes[self.find(n2)] = self.find(n1)\n self.parent_indexes[self.find(n1)] -= tmp\n return True\n \n \n tmp = self.size(n1)\n self.parent_indexes[self.find(n1)] = self.find(n2)\n self.parent_indexes[self.find(n2)] -= tmp\n return True\n \n \n def size(self, n):\n return -self.parent_indexes[self.find(n)]\n \n def same_group(self, n1, n2):\n return self.find(n1) == self.find(n2)\n \n n, m = map(lambda x: int(x), input().split())\n \n \n uf = UnionFind(n)\n \n for _ in range(m):\n a, b = map(lambda x: int(x), input().split())\n uf.union(a-1, b-1)\n \n num_parents = 0\n \n for p_index in uf.parent_indexes:\n if p_index < 0:\n num_parents += 1\n-print(math.ceil((math.log2(num_parents))))\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 53 }, { "user_id": "u252828980", "problem_id": "p02536", "submission1_id": "s918476426", "submission2_id": "s552872716", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m = map(int,input().split())\n\nclass Unionfind:\n \n def __init__(self,n):\n self.uf = [-1]*n\n \n def find(self,x):\n if self.uf[x] < 0:\n return x\n else:\n self.uf[x] = self.find(self.uf[x])\n return self.uf[x]\n \n def same(self,x,y):\n return self.find(x) == self.find(y)\n \n def union(self,x,y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return False\n if self.uf[x] > self.uf[y]:\n x,y = y,x\n self.uf[x] += self.uf[y]\n self.uf[y] = x\n return True\n \n def size(self,x):\n x = self.find(x)\n return -self.uf[x]\n\nd = Unionfind(n)\n\nfor i in range(m):\n a,b = map(int,input().split())\n d.union(a-1,b-1)\n \nL = []\nfor i in range(n):\n c = d.size(i)\n L.append(c)\nprint(len(set(L))-1)", "code2": "n,m = map(int,input().split())\n\nclass Unionfind:\n \n def __init__(self,n):\n self.uf = [-1]*n\n \n def find(self,x):\n if self.uf[x] < 0:\n return x\n else:\n self.uf[x] = self.find(self.uf[x])\n return self.uf[x]\n \n def same(self,x,y):\n return self.find(x) == self.find(y)\n \n def union(self,x,y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return False\n if self.uf[x] > self.uf[y]:\n x,y = y,x\n self.uf[x] += self.uf[y]\n self.uf[y] = x\n return True\n \n def size(self,x):\n x = self.find(x)\n return -self.uf[x]\n\nd = Unionfind(n)\n\nfor i in range(m):\n a,b = map(int,input().split())\n d.union(a-1,b-1)\n \nL = []\nfor i in range(n):\n c = d.find(i)\n L.append(c)\n\nprint(len(set(L))-1)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1601219336", "date2": "1601219799", "bleu_score": "0.9917431301829578", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 90, "input": "3 1\n3 3\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["n,m = map(int,input().split()) # (0): n=3, m=1\n\nclass Unionfind: # (1): Unionfind=\n \n def __init__(self,n):\n self.uf = [-1]*n # (3): m=1, Unionfind=, d=\n \n def find(self,x):\n if self.uf[x] < 0: # (8): y=2 (10): y=2 ... (27): n=3, m=1, Unionfind=, d=, i=2, a=3, b=3, L=[1, 1], c=1\n return x\n else:\n self.uf[x] = self.find(self.uf[x])\n return self.uf[x]\n \n def same(self,x,y):\n return self.find(x) == self.find(y)\n \n def union(self,x,y):\n x = self.find(x) # (7): NO CHANGE\n y = self.find(y) # (9): NO CHANGE\n if x == y: # (11): n=3, m=1, Unionfind=, d=, i=0, a=3, b=3\n return False\n if self.uf[x] > self.uf[y]:\n x,y = y,x\n self.uf[x] += self.uf[y]\n self.uf[y] = x\n return True\n \n def size(self,x):\n x = self.find(x) # (16): NO CHANGE (21): NO CHANGE (26): NO CHANGE\n return -self.uf[x]\n\nd = Unionfind(n) # (2): self=\n\nfor i in range(m): # (4): i=0 (12): NO CHANGE\n a,b = map(int,input().split()) # (5): a=3, b=3\n d.union(a-1,b-1) # (6): self=, x=2, y=2\n \nL = [] # (13): L=[]\nfor i in range(n): # (14): NO CHANGE (19): i=1 ... (29): NO CHANGE\n c = d.size(i) # (15): self=, x=0 (20): self=, x=1 (25): self=, x=2\n L.append(c) # (18): L=[1] (23): L=[1, 1] (28): L=[1, 1, 1]\nprint(len(set(L))-1)"], "anno_status": [true], "diff_content": " n,m = map(int,input().split())\n \n class Unionfind:\n \n def __init__(self,n):\n self.uf = [-1]*n\n \n def find(self,x):\n if self.uf[x] < 0:\n return x\n else:\n self.uf[x] = self.find(self.uf[x])\n return self.uf[x]\n \n def same(self,x,y):\n return self.find(x) == self.find(y)\n \n def union(self,x,y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return False\n if self.uf[x] > self.uf[y]:\n x,y = y,x\n self.uf[x] += self.uf[y]\n self.uf[y] = x\n return True\n \n def size(self,x):\n x = self.find(x)\n return -self.uf[x]\n \n d = Unionfind(n)\n \n for i in range(m):\n a,b = map(int,input().split())\n d.union(a-1,b-1)\n \n L = []\n for i in range(n):\n- c = d.size(i)\n+ c = d.find(i)\n L.append(c)\n+\n print(len(set(L))-1)\n", "FL_content": " n,m = map(int,input().split())\n \n class Unionfind:\n \n def __init__(self,n):\n self.uf = [-1]*n\n \n def find(self,x):\n if self.uf[x] < 0:\n return x\n else:\n self.uf[x] = self.find(self.uf[x])\n return self.uf[x]\n \n def same(self,x,y):\n return self.find(x) == self.find(y)\n \n def union(self,x,y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return False\n if self.uf[x] > self.uf[y]:\n x,y = y,x\n self.uf[x] += self.uf[y]\n self.uf[y] = x\n return True\n \n def size(self,x):\n x = self.find(x)\n return -self.uf[x]\n \n d = Unionfind(n)\n \n for i in range(m):\n a,b = map(int,input().split())\n d.union(a-1,b-1)\n \n L = []\n for i in range(n):\n- c = d.size(i)\n L.append(c)\n print(len(set(L))-1)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 43 }, { "user_id": "u940139461", "problem_id": "p03419", "submission1_id": "s994317798", "submission2_id": "s256071548", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nn, m = map(int, input().split())\n\nperemeter = 0\nif n == 1 or m == 1:\n peremeter += 2\nelse:\n if n - 1 > 0:\n peremeter += (n - 1) * 2\n if m - 1 > 0:\n peremeter += (m - 1) * 2\nans = n * m - peremeter\nprint(ans)", "code2": "\n\nn, m = map(int, input().split())\n\nperemeter = 0\nif n == 1 and m == 1:\n pass \nelif n == 1 or m == 1:\n peremeter += 2\nelse:\n peremeter += (n - 1) * 2\n peremeter += (m - 1) * 2\nans = n * m - peremeter\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1588264667", "date2": "1588265094", "bleu_score": "0.8611262209220072", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 69, "total_score": 78, "input": "69 -1\n", "actual_output": "-205\n", "expected_output": "-201\n\n", "anno_code": ["\n\nn, m = map(int, input().split()) # (0): n=69, m=-1\n\nperemeter = 0 # (1): peremeter=0\nif n == 1 or m == 1: # (2): NO CHANGE\n peremeter += 2\nelse:\n if n - 1 > 0: # (3): NO CHANGE\n peremeter += (n - 1) * 2 # (4): peremeter=136\n if m - 1 > 0: # (5): NO CHANGE\n peremeter += (m - 1) * 2\nans = n * m - peremeter # (6): ans=-205\nprint(ans)"], "anno_status": [true], "diff_content": " \n \n n, m = map(int, input().split())\n \n peremeter = 0\n-if n == 1 or m == 1:\n+if n == 1 and m == 1:\n+ pass \n+elif n == 1 or m == 1:\n peremeter += 2\n else:\n- if n - 1 > 0:\n- peremeter += (n - 1) * 2\n- if m - 1 > 0:\n- peremeter += (m - 1) * 2\n+ peremeter += (n - 1) * 2\n+ peremeter += (m - 1) * 2\n ans = n * m - peremeter\n print(ans)\n", "FL_content": " \n \n n, m = map(int, input().split())\n \n peremeter = 0\n-if n == 1 or m == 1:\n peremeter += 2\n else:\n- if n - 1 > 0:\n- peremeter += (n - 1) * 2\n- if m - 1 > 0:\n- peremeter += (m - 1) * 2\n ans = n * m - peremeter\n print(ans)\n", "added_lines": 5, "removed_lines": 5, "code1_lines": 14 }, { "user_id": "u954774382", "problem_id": "p03419", "submission1_id": "s892458369", "submission2_id": "s082272209", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop, heappush\nfrom math import *\nfrom collections import defaultdict as dd, deque, Counter as C\nfrom itertools import combinations as comb, permutations as perm\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nfrom time import perf_counter\nfrom fractions import Fraction\n\n\n\nmod = int(pow(10, 9) + 7)\nmod2 = 998244353\ndef data(): return sys.stdin.readline().strip()\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\ndef l(): return list(sp())\ndef sl(): return list(ssp())\ndef sp(): return map(int, data().split())\ndef ssp(): return map(str, data().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n\n\n\n\n\n\n\n\n\nn,m=l()\nif(n==1 and m==1):\n print(1)\n exit()\nif(n<=2 and m<=2):\n print(0)\n exit()\nif(n==2):\n print((m-2)*2)\n exit()\nif(m==2):\n print((n-2)*2)\n exit()\nprint(max(1,n-2)*max(1,m-2))\n\n", "code2": "import sys\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop, heappush\nfrom math import *\nfrom collections import defaultdict as dd, deque, Counter as C\nfrom itertools import combinations as comb, permutations as perm\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nfrom time import perf_counter\nfrom fractions import Fraction\n\n\n\nmod = int(pow(10, 9) + 7)\nmod2 = 998244353\ndef data(): return sys.stdin.readline().strip()\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\ndef l(): return list(sp())\ndef sl(): return list(ssp())\ndef sp(): return map(int, data().split())\ndef ssp(): return map(str, data().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n\n\n\n\n\n\n\n\n\nn,m=l()\nif(n>m):\n n,m=m,n\nif(n==1 and m==1):\n print(1)\n exit()\nif(n==1 and m!=1):\n print(m-2)\n exit()\nprint((n-2)*(m-2))\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591043438", "date2": "1591043724", "bleu_score": "0.9135326464354874", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 69, "total_score": 78, "input": "40 -1\n", "actual_output": "38\n", "expected_output": "-114\n\n", "anno_code": ["import sys\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop, heappush\nfrom math import *\nfrom collections import defaultdict as dd, deque, Counter as C\nfrom itertools import combinations as comb, permutations as perm\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nfrom time import perf_counter\nfrom fractions import Fraction\n\n\n\nmod = int(pow(10, 9) + 7) # (0): nan=nan, mod=1000000007\nmod2 = 998244353 # (1): nan=nan, mod2=998244353, data=\ndef data(): return sys.stdin.readline().strip()\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end) # (2): nan=nan, out=, l=, sl=, sp=, ssp=, l1d=, l2d=\ndef l(): return list(sp())\ndef sl(): return list(ssp())\ndef sp(): return map(int, data().split())\ndef ssp(): return map(str, data().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n\n\n\n\n\n\n\n\n\nn,m=l() # (3): nan=nan, n=40, m=-1\nif(n==1 and m==1): # (4): nan=nan\n print(1)\n exit()\nif(n<=2 and m<=2): # (5): nan=nan\n print(0)\n exit()\nif(n==2): # (6): nan=nan\n print((m-2)*2)\n exit()\nif(m==2): # (7): nan=nan\n print((n-2)*2)\n exit()\nprint(max(1,n-2)*max(1,m-2))\n\n"], "anno_status": [true], "diff_content": " import sys\n from functools import lru_cache, cmp_to_key\n from heapq import merge, heapify, heappop, heappush\n from math import *\n from collections import defaultdict as dd, deque, Counter as C\n from itertools import combinations as comb, permutations as perm\n from bisect import bisect_left as bl, bisect_right as br, bisect\n from time import perf_counter\n from fractions import Fraction\n \n \n \n mod = int(pow(10, 9) + 7)\n mod2 = 998244353\n def data(): return sys.stdin.readline().strip()\n def out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\n def l(): return list(sp())\n def sl(): return list(ssp())\n def sp(): return map(int, data().split())\n def ssp(): return map(str, data().split())\n def l1d(n, val=0): return [val for i in range(n)]\n def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n \n \n \n \n \n \n \n \n \n n,m=l()\n+if(n>m):\n+ n,m=m,n\n if(n==1 and m==1):\n print(1)\n exit()\n-if(n<=2 and m<=2):\n- print(0)\n+if(n==1 and m!=1):\n+ print(m-2)\n exit()\n-if(n==2):\n- print((m-2)*2)\n- exit()\n-if(m==2):\n- print((n-2)*2)\n- exit()\n-print(max(1,n-2)*max(1,m-2))\n+print((n-2)*(m-2))\n \n \n", "FL_content": " import sys\n from functools import lru_cache, cmp_to_key\n from heapq import merge, heapify, heappop, heappush\n from math import *\n from collections import defaultdict as dd, deque, Counter as C\n from itertools import combinations as comb, permutations as perm\n from bisect import bisect_left as bl, bisect_right as br, bisect\n from time import perf_counter\n from fractions import Fraction\n \n \n \n mod = int(pow(10, 9) + 7)\n mod2 = 998244353\n def data(): return sys.stdin.readline().strip()\n def out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\n def l(): return list(sp())\n def sl(): return list(ssp())\n def sp(): return map(int, data().split())\n def ssp(): return map(str, data().split())\n def l1d(n, val=0): return [val for i in range(n)]\n def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n \n \n \n \n \n \n \n \n \n n,m=l()\n if(n==1 and m==1):\n print(1)\n exit()\n-if(n<=2 and m<=2):\n- print(0)\n exit()\n-if(n==2):\n- print((m-2)*2)\n- exit()\n-if(m==2):\n- print((n-2)*2)\n- exit()\n-print(max(1,n-2)*max(1,m-2))\n \n \n", "added_lines": 5, "removed_lines": 9, "code1_lines": 47 }, { "user_id": "u189023301", "problem_id": "p03419", "submission1_id": "s153718765", "submission2_id": "s459259784", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m = map(int, input().split())\nif n <= 1 or m <= 1:\n print(max(n-2, m-2, 0))\nelse:\n print((n-2)*(m-2))", "code2": "n,m = map(int, input().split())\nif n == 1 and m==1:\n print(1)\nelif n == 1 or m == 1:\n print(max(n-2, m-2, 0))\nelse:\n print((n-2)*(m-2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568252683", "date2": "1568253200", "bleu_score": "0.7212172748297971", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 69, "total_score": 78, "input": "115 0\n", "actual_output": "113\n", "expected_output": "-226\n\n", "anno_code": ["n,m = map(int, input().split()) # (0): n=115, m=0\nif n <= 1 or m <= 1: # (1): NO CHANGE\n print(max(n-2, m-2, 0))\nelse:\n print((n-2)*(m-2))"], "anno_status": [true], "diff_content": " n,m = map(int, input().split())\n-if n <= 1 or m <= 1:\n+if n == 1 and m==1:\n+ print(1)\n+elif n == 1 or m == 1:\n print(max(n-2, m-2, 0))\n else:\n print((n-2)*(m-2))\n", "FL_content": " n,m = map(int, input().split())\n-if n <= 1 or m <= 1:\n print(max(n-2, m-2, 0))\n else:\n print((n-2)*(m-2))\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u088552457", "problem_id": "p03419", "submission1_id": "s406965612", "submission2_id": "s577528844", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\nif n == 1 and m == 1:\n print(1)\n exit(0)\n\nw = n - 2\nh = m - 2\nif w < 1 or h < 1:\n print(max(w, h))\n exit(0)\n \nprint(w*h)\n", "code2": "n, m = map(int, input().split())\nif n == 1 and m == 1:\n print(1)\n exit(0)\n\nw = n - 2\nh = m - 2\nif n == 1:\n print(h)\n exit(0)\nif m == 1:\n print(w)\n exit(0)\n \nprint(w*h)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584035509", "date2": "1584035643", "bleu_score": "0.7923756430152428", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 69, "total_score": 78, "input": "63 0\n", "actual_output": "61\n", "expected_output": "-122\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " n, m = map(int, input().split())\n if n == 1 and m == 1:\n print(1)\n exit(0)\n \n w = n - 2\n h = m - 2\n-if w < 1 or h < 1:\n- print(max(w, h))\n+if n == 1:\n+ print(h)\n+ exit(0)\n+if m == 1:\n+ print(w)\n exit(0)\n \n print(w*h)\n \n", "FL_content": " n, m = map(int, input().split())\n if n == 1 and m == 1:\n print(1)\n exit(0)\n \n w = n - 2\n h = m - 2\n-if w < 1 or h < 1:\n- print(max(w, h))\n exit(0)\n \n print(w*h)\n \n", "added_lines": 5, "removed_lines": 2, "code1_lines": 13 }, { "user_id": "u655048024", "problem_id": "p03419", "submission1_id": "s521317565", "submission2_id": "s126834767", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m = map(int,input().split())\nif(n==2)or(m==2):\n print(0)\nelif(n==1)or(m==1):\n if(n==1)and(m==1):\n print(1)\n else:\n print(max(0,max(n,m)-2))\nelse:\n print((n-2)*(m-1))", "code2": "n,m = map(int,input().split())\nif(n==2)or(m==2):\n print(0)\nelif(n==1)or(m==1):\n if(n==1)and(m==1):\n print(1)\n else:\n print(max(0,max(n,m)-2))\nelse:\n print((n-2)*(m-2))\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599222136", "date2": "1599222257", "bleu_score": "0.981545919767359", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 78, "input": "527 374\n", "actual_output": "195825\n", "expected_output": "195300\n\n", "anno_code": ["n,m = map(int,input().split()) # (0): n=527, m=374\nif(n==2)or(m==2): # (1): NO CHANGE\n print(0)\nelif(n==1)or(m==1): # (2): NO CHANGE\n if(n==1)and(m==1):\n print(1)\n else:\n print(max(0,max(n,m)-2))\nelse:\n print((n-2)*(m-1))"], "anno_status": [true], "diff_content": " n,m = map(int,input().split())\n if(n==2)or(m==2):\n print(0)\n elif(n==1)or(m==1):\n if(n==1)and(m==1):\n print(1)\n else:\n print(max(0,max(n,m)-2))\n else:\n- print((n-2)*(m-1))\n+ print((n-2)*(m-2))\n+\n", "FL_content": " n,m = map(int,input().split())\n if(n==2)or(m==2):\n print(0)\n elif(n==1)or(m==1):\n if(n==1)and(m==1):\n print(1)\n else:\n print(max(0,max(n,m)-2))\n else:\n- print((n-2)*(m-1))\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u712429027", "problem_id": "p03419", "submission1_id": "s309046209", "submission2_id": "s821173372", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nins = lambda: input().rstrip()\nini = lambda: int(input().rstrip())\ninm = lambda: map(int, input().split())\ninl = lambda: list(map(int, input().split()))\nout = lambda x: print('\\n'.join(map(str, x)))\n\nn, m = inm()\nprint(n*m - min(2, m) * n - (0 if n <= 2 else 2*m - 4))", "code2": "import sys\ninput = sys.stdin.readline\nins = lambda: input().rstrip()\nini = lambda: int(input().rstrip())\ninm = lambda: map(int, input().split())\ninl = lambda: list(map(int, input().split()))\nout = lambda x: print('\\n'.join(map(str, x)))\n\nn, m = inm()\nif n == 1 and m == 1:\n print(1)\nelif n == 1:\n print(m-2)\nelif m == 1:\n print(n-2)\nelse:\n print((m-2) * (n-2))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598516433", "date2": "1598516688", "bleu_score": "0.736811954348878", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 69, "total_score": 78, "input": "48 -1\n", "actual_output": "6\n", "expected_output": "-138\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\nins = lambda: input().rstrip() # (1): ins= at 0x0000023B67069BD0>\nini = lambda: int(input().rstrip()) # (2): ini= at 0x0000023B67069B40>\ninm = lambda: map(int, input().split()) # (3): inm= at 0x0000023B67069C60>\ninl = lambda: list(map(int, input().split())) # (4): inl= at 0x0000023B67069CF0>\nout = lambda x: print('\\n'.join(map(str, x))) # (5): out= at 0x0000023B67069D80>\n\nn, m = inm() # (6): n=48, m=-1\nprint(n*m - min(2, m) * n - (0 if n <= 2 else 2*m - 4))"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n ins = lambda: input().rstrip()\n ini = lambda: int(input().rstrip())\n inm = lambda: map(int, input().split())\n inl = lambda: list(map(int, input().split()))\n out = lambda x: print('\\n'.join(map(str, x)))\n \n n, m = inm()\n-print(n*m - min(2, m) * n - (0 if n <= 2 else 2*m - 4))\n+if n == 1 and m == 1:\n+ print(1)\n+elif n == 1:\n+ print(m-2)\n+elif m == 1:\n+ print(n-2)\n+else:\n+ print((m-2) * (n-2))\n", "FL_content": " import sys\n input = sys.stdin.readline\n ins = lambda: input().rstrip()\n ini = lambda: int(input().rstrip())\n inm = lambda: map(int, input().split())\n inl = lambda: list(map(int, input().split()))\n out = lambda x: print('\\n'.join(map(str, x)))\n \n n, m = inm()\n-print(n*m - min(2, m) * n - (0 if n <= 2 else 2*m - 4))\n", "added_lines": 8, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u028973125", "problem_id": "p03419", "submission1_id": "s417554634", "submission2_id": "s569456151", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nN, M = map(int, sys.stdin.readline().split())\n\nif N > 1 and M > 1:\n four = 4\n six = (N - 2) * 2 + (M - 2) * 2\n nine = N * M - four - six\n print(nine)\nelif N == 2 or M == 2:\n print(0)\nelse:\n two = 2\n three = N * M - two\n print(three)", "code2": "import sys\n\nN, M = map(int, sys.stdin.readline().split())\n\nif N == 1 and M == 1:\n print(1)\nelif N == 1 or M == 1:\n two = 2\n three = N * M - two\n print(three)\nelse:\n four = 4\n six = (N - 2) * 2 + (M - 2) * 2\n nine = N * M - four - six\n print(nine)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596519080", "date2": "1596519213", "bleu_score": "0.9447079716046787", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 69, "total_score": 78, "input": "124 0\n", "actual_output": "-2\n", "expected_output": "-244\n\n", "anno_code": ["import sys\n\nN, M = map(int, sys.stdin.readline().split()) # (0): N=124, M=0\n\nif N > 1 and M > 1: # (1): NO CHANGE\n four = 4\n six = (N - 2) * 2 + (M - 2) * 2\n nine = N * M - four - six\n print(nine)\nelif N == 2 or M == 2: # (2): NO CHANGE\n print(0)\nelse:\n two = 2 # (3): two=2\n three = N * M - two # (4): three=-2\n print(three)"], "anno_status": [true], "diff_content": " import sys\n \n N, M = map(int, sys.stdin.readline().split())\n \n-if N > 1 and M > 1:\n+if N == 1 and M == 1:\n+ print(1)\n+elif N == 1 or M == 1:\n+ two = 2\n+ three = N * M - two\n+ print(three)\n+else:\n four = 4\n six = (N - 2) * 2 + (M - 2) * 2\n nine = N * M - four - six\n print(nine)\n-elif N == 2 or M == 2:\n- print(0)\n-else:\n- two = 2\n- three = N * M - two\n- print(three)\n", "FL_content": " import sys\n \n N, M = map(int, sys.stdin.readline().split())\n \n-if N > 1 and M > 1:\n four = 4\n six = (N - 2) * 2 + (M - 2) * 2\n nine = N * M - four - six\n print(nine)\n-elif N == 2 or M == 2:\n- print(0)\n-else:\n- two = 2\n- three = N * M - two\n- print(three)\n", "added_lines": 7, "removed_lines": 7, "code1_lines": 15 }, { "user_id": "u954774382", "problem_id": "p03419", "submission1_id": "s479663331", "submission2_id": "s082272209", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop, heappush\nfrom math import *\nfrom collections import defaultdict as dd, deque, Counter as C\nfrom itertools import combinations as comb, permutations as perm\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nfrom time import perf_counter\nfrom fractions import Fraction\n\n\n\nmod = int(pow(10, 9) + 7)\nmod2 = 998244353\ndef data(): return sys.stdin.readline().strip()\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\ndef l(): return list(sp())\ndef sl(): return list(ssp())\ndef sp(): return map(int, data().split())\ndef ssp(): return map(str, data().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n\n\n\n\n\n\n\n\n\nn,m=l()\nif(n<=2 and m<=2):\n print(0)\n exit()\nif(n==2):\n print((m-2)*2)\n exit()\nif(m==2):\n print((n-2)*2)\n exit()\nprint(max(1,n-2)*max(1,m-2))\n\n", "code2": "import sys\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop, heappush\nfrom math import *\nfrom collections import defaultdict as dd, deque, Counter as C\nfrom itertools import combinations as comb, permutations as perm\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nfrom time import perf_counter\nfrom fractions import Fraction\n\n\n\nmod = int(pow(10, 9) + 7)\nmod2 = 998244353\ndef data(): return sys.stdin.readline().strip()\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\ndef l(): return list(sp())\ndef sl(): return list(ssp())\ndef sp(): return map(int, data().split())\ndef ssp(): return map(str, data().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n\n\n\n\n\n\n\n\n\nn,m=l()\nif(n>m):\n n,m=m,n\nif(n==1 and m==1):\n print(1)\n exit()\nif(n==1 and m!=1):\n print(m-2)\n exit()\nprint((n-2)*(m-2))\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591043307", "date2": "1591043724", "bleu_score": "0.940555934577418", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 69, "total_score": 78, "input": "124 0\n", "actual_output": "122\n", "expected_output": "-244\n\n", "anno_code": ["import sys\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop, heappush\nfrom math import *\nfrom collections import defaultdict as dd, deque, Counter as C\nfrom itertools import combinations as comb, permutations as perm\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nfrom time import perf_counter\nfrom fractions import Fraction\n\n\n\nmod = int(pow(10, 9) + 7) # (0): nan=nan, mod=1000000007\nmod2 = 998244353 # (1): nan=nan, mod2=998244353, data=\ndef data(): return sys.stdin.readline().strip()\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end) # (2): nan=nan, out=, l=, sl=, sp=, ssp=, l1d=, l2d=\ndef l(): return list(sp())\ndef sl(): return list(ssp())\ndef sp(): return map(int, data().split())\ndef ssp(): return map(str, data().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n\n\n\n\n\n\n\n\n\nn,m=l() # (3): nan=nan, n=124, m=0\nif(n<=2 and m<=2): # (4): nan=nan\n print(0)\n exit()\nif(n==2): # (5): nan=nan\n print((m-2)*2)\n exit()\nif(m==2): # (6): nan=nan\n print((n-2)*2)\n exit()\nprint(max(1,n-2)*max(1,m-2))\n\n"], "anno_status": [true], "diff_content": " import sys\n from functools import lru_cache, cmp_to_key\n from heapq import merge, heapify, heappop, heappush\n from math import *\n from collections import defaultdict as dd, deque, Counter as C\n from itertools import combinations as comb, permutations as perm\n from bisect import bisect_left as bl, bisect_right as br, bisect\n from time import perf_counter\n from fractions import Fraction\n \n \n \n mod = int(pow(10, 9) + 7)\n mod2 = 998244353\n def data(): return sys.stdin.readline().strip()\n def out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\n def l(): return list(sp())\n def sl(): return list(ssp())\n def sp(): return map(int, data().split())\n def ssp(): return map(str, data().split())\n def l1d(n, val=0): return [val for i in range(n)]\n def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n \n \n \n \n \n \n \n \n \n n,m=l()\n-if(n<=2 and m<=2):\n- print(0)\n+if(n>m):\n+ n,m=m,n\n+if(n==1 and m==1):\n+ print(1)\n exit()\n-if(n==2):\n- print((m-2)*2)\n+if(n==1 and m!=1):\n+ print(m-2)\n exit()\n-if(m==2):\n- print((n-2)*2)\n- exit()\n-print(max(1,n-2)*max(1,m-2))\n+print((n-2)*(m-2))\n \n \n", "FL_content": " import sys\n from functools import lru_cache, cmp_to_key\n from heapq import merge, heapify, heappop, heappush\n from math import *\n from collections import defaultdict as dd, deque, Counter as C\n from itertools import combinations as comb, permutations as perm\n from bisect import bisect_left as bl, bisect_right as br, bisect\n from time import perf_counter\n from fractions import Fraction\n \n \n \n mod = int(pow(10, 9) + 7)\n mod2 = 998244353\n def data(): return sys.stdin.readline().strip()\n def out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\n def l(): return list(sp())\n def sl(): return list(ssp())\n def sp(): return map(int, data().split())\n def ssp(): return map(str, data().split())\n def l1d(n, val=0): return [val for i in range(n)]\n def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n \n \n \n \n \n \n \n \n \n n,m=l()\n-if(n<=2 and m<=2):\n- print(0)\n exit()\n-if(n==2):\n- print((m-2)*2)\n exit()\n-if(m==2):\n- print((n-2)*2)\n- exit()\n-print(max(1,n-2)*max(1,m-2))\n \n \n", "added_lines": 7, "removed_lines": 8, "code1_lines": 44 }, { "user_id": "u954774382", "problem_id": "p03419", "submission1_id": "s211179121", "submission2_id": "s082272209", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop, heappush\nfrom math import *\nfrom collections import defaultdict as dd, deque, Counter as C\nfrom itertools import combinations as comb, permutations as perm\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nfrom time import perf_counter\nfrom fractions import Fraction\n\n\n\nmod = int(pow(10, 9) + 7)\nmod2 = 998244353\ndef data(): return sys.stdin.readline().strip()\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\ndef l(): return list(sp())\ndef sl(): return list(ssp())\ndef sp(): return map(int, data().split())\ndef ssp(): return map(str, data().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n\n\n\n\n\n\n\n\n\nn,m=l()\nif(n<=2 and m<=2):\n print(0)\n exit()\nif(n==2):\n print((m-2)*2)\n exit()\nif(n==2):\n print((m-2)*2)\n exit()\nprint(max(1,n-2)*max(1,m-2))\n\n", "code2": "import sys\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop, heappush\nfrom math import *\nfrom collections import defaultdict as dd, deque, Counter as C\nfrom itertools import combinations as comb, permutations as perm\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nfrom time import perf_counter\nfrom fractions import Fraction\n\n\n\nmod = int(pow(10, 9) + 7)\nmod2 = 998244353\ndef data(): return sys.stdin.readline().strip()\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\ndef l(): return list(sp())\ndef sl(): return list(ssp())\ndef sp(): return map(int, data().split())\ndef ssp(): return map(str, data().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n\n\n\n\n\n\n\n\n\nn,m=l()\nif(n>m):\n n,m=m,n\nif(n==1 and m==1):\n print(1)\n exit()\nif(n==1 and m!=1):\n print(m-2)\n exit()\nprint((n-2)*(m-2))\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591043234", "date2": "1591043724", "bleu_score": "0.9410815515310548", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 69, "total_score": 78, "input": "115 0\n", "actual_output": "113\n", "expected_output": "-226\n\n", "anno_code": ["import sys\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop, heappush\nfrom math import *\nfrom collections import defaultdict as dd, deque, Counter as C\nfrom itertools import combinations as comb, permutations as perm\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nfrom time import perf_counter\nfrom fractions import Fraction\n\n\n\nmod = int(pow(10, 9) + 7) # (0): nan=nan, mod=1000000007\nmod2 = 998244353 # (1): nan=nan, mod2=998244353, data=\ndef data(): return sys.stdin.readline().strip()\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end) # (2): nan=nan, out=, l=, sl=, sp=, ssp=, l1d=, l2d=\ndef l(): return list(sp())\ndef sl(): return list(ssp())\ndef sp(): return map(int, data().split())\ndef ssp(): return map(str, data().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n\n\n\n\n\n\n\n\n\nn,m=l() # (3): nan=nan, n=115, m=0\nif(n<=2 and m<=2): # (4): nan=nan\n print(0)\n exit()\nif(n==2): # (5): nan=nan\n print((m-2)*2)\n exit()\nif(n==2): # (6): nan=nan\n print((m-2)*2)\n exit()\nprint(max(1,n-2)*max(1,m-2))\n\n"], "anno_status": [true], "diff_content": " import sys\n from functools import lru_cache, cmp_to_key\n from heapq import merge, heapify, heappop, heappush\n from math import *\n from collections import defaultdict as dd, deque, Counter as C\n from itertools import combinations as comb, permutations as perm\n from bisect import bisect_left as bl, bisect_right as br, bisect\n from time import perf_counter\n from fractions import Fraction\n \n \n \n mod = int(pow(10, 9) + 7)\n mod2 = 998244353\n def data(): return sys.stdin.readline().strip()\n def out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\n def l(): return list(sp())\n def sl(): return list(ssp())\n def sp(): return map(int, data().split())\n def ssp(): return map(str, data().split())\n def l1d(n, val=0): return [val for i in range(n)]\n def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n \n \n \n \n \n \n \n \n \n n,m=l()\n-if(n<=2 and m<=2):\n- print(0)\n+if(n>m):\n+ n,m=m,n\n+if(n==1 and m==1):\n+ print(1)\n exit()\n-if(n==2):\n- print((m-2)*2)\n+if(n==1 and m!=1):\n+ print(m-2)\n exit()\n-if(n==2):\n- print((m-2)*2)\n- exit()\n-print(max(1,n-2)*max(1,m-2))\n+print((n-2)*(m-2))\n \n \n", "FL_content": " import sys\n from functools import lru_cache, cmp_to_key\n from heapq import merge, heapify, heappop, heappush\n from math import *\n from collections import defaultdict as dd, deque, Counter as C\n from itertools import combinations as comb, permutations as perm\n from bisect import bisect_left as bl, bisect_right as br, bisect\n from time import perf_counter\n from fractions import Fraction\n \n \n \n mod = int(pow(10, 9) + 7)\n mod2 = 998244353\n def data(): return sys.stdin.readline().strip()\n def out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\n def l(): return list(sp())\n def sl(): return list(ssp())\n def sp(): return map(int, data().split())\n def ssp(): return map(str, data().split())\n def l1d(n, val=0): return [val for i in range(n)]\n def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n \n \n \n \n \n \n \n \n \n n,m=l()\n-if(n<=2 and m<=2):\n- print(0)\n exit()\n-if(n==2):\n- print((m-2)*2)\n exit()\n-if(n==2):\n- print((m-2)*2)\n- exit()\n-print(max(1,n-2)*max(1,m-2))\n \n \n", "added_lines": 7, "removed_lines": 8, "code1_lines": 44 }, { "user_id": "u364439209", "problem_id": "p03419", "submission1_id": "s691477707", "submission2_id": "s362603299", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split(\" \"))\n\nif M > N:\n tmp = N\n M = N\n N = tmp\n\nif N == 1 and M == 1: print(1)\nelif M == 1: print(N-2)\nelse: print((N-2)*(M-2))", "code2": "N, M = map(int, input().split(\" \"))\n\nif M > N:\n tmp = M\n M = N\n N = tmp\n\nif N == 1 and M == 1: print(1)\nelif M == 1: print(N-2)\nelse: print((N-2)*(M-2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1521326015", "date2": "1521326203", "bleu_score": "0.9842503541065485", "code1_test_status": [0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 52, "total_score": 78, "input": "128 131\n", "actual_output": "15876\n", "expected_output": "16254\n\n", "anno_code": ["N, M = map(int, input().split(\" \")) # (0): N=128, M=131\n\nif M > N: # (1): NO CHANGE\n tmp = N # (2): tmp=128\n M = N # (3): M=128\n N = tmp # (4): NO CHANGE\n\nif N == 1 and M == 1: print(1) # (5): NO CHANGE\nelif M == 1: print(N-2) # (6): NO CHANGE\nelse: print((N-2)*(M-2))"], "anno_status": [true], "diff_content": " N, M = map(int, input().split(\" \"))\n \n if M > N:\n- tmp = N\n+ tmp = M\n M = N\n N = tmp\n \n if N == 1 and M == 1: print(1)\n elif M == 1: print(N-2)\n else: print((N-2)*(M-2))\n", "FL_content": " N, M = map(int, input().split(\" \"))\n \n if M > N:\n- tmp = N\n M = N\n N = tmp\n \n if N == 1 and M == 1: print(1)\n elif M == 1: print(N-2)\n else: print((N-2)*(M-2))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u190405389", "problem_id": "p03291", "submission1_id": "s407220963", "submission2_id": "s238247839", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\nans = 0\n\nrc = [0]\nrq = [0]\nla = [0]\nlq = [0]\nq3 = [1]\nt = 10**9+7\n\nfor i in range(len(s)-1):\n if s[len(s)-i-1]=='C':\n rc.append(rc[-1]+1)\n rq.append(rq[-1])\n elif s[len(s)-i-1]=='?':\n rc.append(rc[-1])\n rq.append(rq[-1]+1)\n else:\n rc.append(rc[-1])\n rq.append(rq[-1])\n if s[i]=='A':\n la.append(la[-1]+1)\n lq.append(lq[-1])\n elif s[i]=='?':\n la.append(la[-1])\n lq.append(lq[-1]+1)\n else:\n la.append(la[-1])\n lq.append(lq[-1])\n q3.append(q3[-1] * 3 % t)\nrc.reverse()\nrq.reverse()\n\nfor i in range(len(s)):\n if s[i]=='B' or s[i]=='?':\n l = q3[lq[i]-1]\n r = q3[rq[i]-1]\n ans += l*r*(3*la[i]+lq[i])*(3*rc[i]+rq[i]) % t\n\nprint(int(ans%t))\n", "code2": "s = input()\n\nans = 0\n\nrc = [0]\nrq = [0]\nla = [0]\nlq = [0]\nq3 = [1]\nt = 10**9+7\n\nfor i in range(len(s)-1):\n if s[len(s)-i-1]=='C':\n rc.append(rc[-1]+1)\n rq.append(rq[-1])\n elif s[len(s)-i-1]=='?':\n rc.append(rc[-1])\n rq.append(rq[-1]+1)\n else:\n rc.append(rc[-1])\n rq.append(rq[-1])\n if s[i]=='A':\n la.append(la[-1]+1)\n lq.append(lq[-1])\n elif s[i]=='?':\n la.append(la[-1])\n lq.append(lq[-1]+1)\n else:\n la.append(la[-1])\n lq.append(lq[-1])\n q3.append(q3[-1] * 3 % t)\nrc.reverse()\nrq.reverse()\n\nq3.append(1/3)\n\nfor i in range(len(s)):\n if s[i]=='B' or s[i]=='?':\n l = q3[lq[i]-1]\n r = q3[rq[i]-1]\n ans += l*r*(3*la[i]+lq[i])*(3*rc[i]+rq[i]) % t\n\nprint(round(ans%t))\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1556733131", "date2": "1556733980", "bleu_score": "0.9718487265146971", "code1_test_status": [0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1], "code1_test_score": 79, "total_score": 103, "input": "@A>C?@B;@AA=???==AA>C?@B;@AA=???==Aint:\n ABC = 'ABC'\n\n dp = [0, 0, 0, 0]\n dp[3] = 1\n\n for c in reversed(S):\n if c == '?':\n m, m1, m2 = 3, 3, 1\n else:\n m, m1, m2 = 1, 1, 0\n for j in range(3):\n \n \n if c == ABC[j]:\n m2 = 1\n dp[j] = m1 * dp[j] + m2 * dp[j+1]\n \n dp[3] = m * dp[3]\n\n return dp[0] % 1000000007\n\n\nif __name__ == \"__main__\":\n S = input()\n ans = we_love_abc(S)\n print(ans)\n", "code2": "def we_love_abc(S: str)->int:\n ABC = 'ABC'\n MOD = 1000000007\n\n dp = [0, 0, 0, 0]\n dp[3] = 1\n\n for c in reversed(S):\n for j in range(3):\n m1 = 3 if c == '?' else 1\n m2 = 1 if c == '?' or c == ABC[j] else 0\n dp[j] = (m1 * dp[j] + m2 * dp[j+1]) % MOD\n dp[3] = (3 if c == '?' else 1) * dp[3]\n dp[3] %= MOD\n\n return dp[0] % MOD\n\n\nif __name__ == \"__main__\":\n S = input()\n ans = we_love_abc(S)\n print(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552154500", "date2": "1552155727", "bleu_score": "0.7811320283327741", "code1_test_status": [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 3, "total_score": 103, "input": "?>????>??@??C;?>@B@?@=?>?\n", "actual_output": "36551331\n", "expected_output": "28579716\n\n", "anno_code": ["def we_love_abc(S: str)->int: # (0): we_love_abc=\n ABC = 'ABC'\n\n dp = [0, 0, 0, 0]\n dp[3] = 1\n\n for c in reversed(S):\n if c == '?':\n m, m1, m2 = 3, 3, 1\n else:\n m, m1, m2 = 1, 1, 0\n for j in range(3):\n \n \n if c == ABC[j]:\n m2 = 1\n dp[j] = m1 * dp[j] + m2 * dp[j+1]\n \n dp[3] = m * dp[3]\n\n return dp[0] % 1000000007\n\n\nif __name__ == \"__main__\":\n S = input()\n ans = we_love_abc(S)\n print(ans)\n"], "anno_status": [true], "diff_content": " def we_love_abc(S: str)->int:\n ABC = 'ABC'\n+ MOD = 1000000007\n \n dp = [0, 0, 0, 0]\n dp[3] = 1\n \n for c in reversed(S):\n- if c == '?':\n- m, m1, m2 = 3, 3, 1\n- else:\n- m, m1, m2 = 1, 1, 0\n for j in range(3):\n- \n- \n- if c == ABC[j]:\n- m2 = 1\n- dp[j] = m1 * dp[j] + m2 * dp[j+1]\n- \n- dp[3] = m * dp[3]\n+ m1 = 3 if c == '?' else 1\n+ m2 = 1 if c == '?' or c == ABC[j] else 0\n+ dp[j] = (m1 * dp[j] + m2 * dp[j+1]) % MOD\n+ dp[3] = (3 if c == '?' else 1) * dp[3]\n+ dp[3] %= MOD\n \n- return dp[0] % 1000000007\n+ return dp[0] % MOD\n \n \n if __name__ == \"__main__\":\n S = input()\n ans = we_love_abc(S)\n print(ans)\n \n", "FL_content": " def we_love_abc(S: str)->int:\n ABC = 'ABC'\n \n dp = [0, 0, 0, 0]\n dp[3] = 1\n \n for c in reversed(S):\n- if c == '?':\n- m, m1, m2 = 3, 3, 1\n- else:\n- m, m1, m2 = 1, 1, 0\n for j in range(3):\n- \n- \n- if c == ABC[j]:\n- m2 = 1\n- dp[j] = m1 * dp[j] + m2 * dp[j+1]\n- \n- dp[3] = m * dp[3]\n \n- return dp[0] % 1000000007\n \n \n if __name__ == \"__main__\":\n S = input()\n ans = we_love_abc(S)\n print(ans)\n \n", "added_lines": 7, "removed_lines": 12, "code1_lines": 28 }, { "user_id": "u316386814", "problem_id": "p03291", "submission1_id": "s735148333", "submission2_id": "s927090554", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nN = len(S)\nMOD = 10 ** 9 + 7\n\ndp = [0, 0, 0, 0]\ndp[0] = 1\n\nfor s in S:\n factor = 3 if s == '?' else 1\n for j, c in zip([2, 1, 0], 'CBA'):\n dp[j + 1] = dp[j + 1] * factor % MOD\n if s == c or s == '?':\n dp[j + 1] += dp[j]\n if s == '?':\n dp[0] = dp[0] % MOD\n\nans = dp[-1] % MOD\n\nprint(ans)", "code2": "S = input()\nN = len(S)\nMOD = 10 ** 9 + 7\n\ndp = [0, 0, 0, 0]\ndp[0] = 1\n\nfor s in S:\n factor = 3 if s == '?' else 1\n for j, c in zip([2, 1, 0], 'CBA'):\n dp[j + 1] = dp[j + 1] * factor % MOD\n if s == c or s == '?':\n dp[j + 1] += dp[j]\n if s == '?':\n dp[0] = (dp[0] * 3) % MOD\n\nans = dp[-1] % MOD\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552195897", "date2": "1552195944", "bleu_score": "0.9759477653238131", "code1_test_status": [1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 7, "total_score": 103, "input": "?D@@=?A?<>?B;?@B@>=A>=>9?\n", "actual_output": "830\n", "expected_output": "2808\n\n", "anno_code": ["S = input() # (0): S=?D@@=?A?<>?B;?@B@>=A>=>9?\nN = len(S) # (1): N=25\nMOD = 10 ** 9 + 7 # (2): MOD=1000000007\n\ndp = [0, 0, 0, 0] # (3): dp=[0, 0, 0, 0]\ndp[0] = 1 # (4): dp=[1, 0, 0, 0]\n\nfor s in S: # (5): s=? (22): s=D ... (358): NO CHANGE\n factor = 3 if s == '?' else 1 # (6): factor=3 (23): factor=1 ... (342): factor=3\n for j, c in zip([2, 1, 0], 'CBA'): # (7): j=2, c=C (11): j=1, c=B ... (355): NO CHANGE\n dp[j + 1] = dp[j + 1] * factor % MOD # (8): NO CHANGE (12): NO CHANGE ... (352): dp=[1, 447, 1541, 830]\n if s == c or s == '?': # (9): NO CHANGE (13): NO CHANGE ... (353): NO CHANGE\n dp[j + 1] += dp[j] # (10): NO CHANGE (14): NO CHANGE ... (354): dp=[1, 448, 1541, 830]\n if s == '?': # (20): NO CHANGE (34): NO CHANGE ... (356): NO CHANGE\n dp[0] = dp[0] % MOD # (21): NO CHANGE (90): NO CHANGE ... (357): NO CHANGE\n\nans = dp[-1] % MOD # (359): ans=830\n\nprint(ans)"], "anno_status": [true], "diff_content": " S = input()\n N = len(S)\n MOD = 10 ** 9 + 7\n \n dp = [0, 0, 0, 0]\n dp[0] = 1\n \n for s in S:\n factor = 3 if s == '?' else 1\n for j, c in zip([2, 1, 0], 'CBA'):\n dp[j + 1] = dp[j + 1] * factor % MOD\n if s == c or s == '?':\n dp[j + 1] += dp[j]\n if s == '?':\n- dp[0] = dp[0] % MOD\n+ dp[0] = (dp[0] * 3) % MOD\n \n ans = dp[-1] % MOD\n \n print(ans)\n", "FL_content": " S = input()\n N = len(S)\n MOD = 10 ** 9 + 7\n \n dp = [0, 0, 0, 0]\n dp[0] = 1\n \n for s in S:\n factor = 3 if s == '?' else 1\n for j, c in zip([2, 1, 0], 'CBA'):\n dp[j + 1] = dp[j + 1] * factor % MOD\n if s == c or s == '?':\n dp[j + 1] += dp[j]\n if s == '?':\n- dp[0] = dp[0] % MOD\n \n ans = dp[-1] % MOD\n \n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 19 }, { "user_id": "u690536347", "problem_id": "p03291", "submission1_id": "s142570317", "submission2_id": "s592796216", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import accumulate as ac\ns=input()\nn=len(s)\nmod=int(1e9)+7\n\n*aca,=ac([0]+[1 if i==\"A\" else 0 for i in s])\n*acc,=ac([0]+[1 if i==\"C\" else 0 for i in s])\n*acq,=ac([0]+[1 if i==\"?\" else 0 for i in s])\n\nv=0\nfor i in range(1,n-1):\n if s[i]==\"B\" or s[i]==\"?\":\n a=aca[i]\n l=acq[i]\n c=acc[n]-acc[i+1]\n r=acq[n]-acq[i+1]\n v+=(a*c*pow(3,l+r,mod))\n if l+r-1>=0:\n v+=(a*r*pow(3,l+r-1,mod))+(l*c*pow(3,l+r-1,mod))\n if l+r-2>=0:\n v+=(l*r*pow(3,l+r-2,mod))\n v%=mod", "code2": "from itertools import accumulate as ac\ns=input()\nn=len(s)\nmod=int(1e9)+7\n\n*aca,=ac([0]+[1 if i==\"A\" else 0 for i in s])\n*acc,=ac([0]+[1 if i==\"C\" else 0 for i in s])\n*acq,=ac([0]+[1 if i==\"?\" else 0 for i in s])\n\nv=0\nfor i in range(1,n-1):\n if s[i]==\"B\" or s[i]==\"?\":\n a=aca[i]\n l=acq[i]\n c=acc[n]-acc[i+1]\n r=acq[n]-acq[i+1]\n v+=(a*c*pow(3,l+r,mod))\n if l+r-1>=0:\n v+=(a*r*pow(3,l+r-1,mod))+(l*c*pow(3,l+r-1,mod))\n if l+r-2>=0:\n v+=(l*r*pow(3,l+r-2,mod))\n v%=mod\nprint(v)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1535811919", "date2": "1535811956", "bleu_score": "0.9821957578130807", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "@>A>=???A?@>;@A=C@@<==@?>\n", "actual_output": "", "expected_output": "954\n\n", "anno_code": ["from itertools import accumulate as ac\ns=input() # (0): s=@>A>=???A?@>;@A=C@@<==@?>\nn=len(s) # (1): n=25\nmod=int(1e9)+7 # (2): mod=1000000007\n\n*aca,=ac([0]+[1 if i==\"A\" else 0 for i in s]) # (3): aca=[0, 0, ..., 3, 3]\n*acc,=ac([0]+[1 if i==\"C\" else 0 for i in s]) # (4): acc=[0, 0, ..., 1, 1]\n*acq,=ac([0]+[1 if i==\"?\" else 0 for i in s]) # (5): acq=[0, 0, ..., 5, 5]\n\nv=0 # (6): v=0\nfor i in range(1,n-1): # (7): i=1 (9): i=2 ... (91): i=23\n if s[i]==\"B\" or s[i]==\"?\": # (8): NO CHANGE (10): NO CHANGE ... (92): NO CHANGE\n a=aca[i] # (17): a=1 (29): NO CHANGE ... (93): a=3\n l=acq[i] # (18): l=0 (30): l=1 ... (94): l=4\n c=acc[n]-acc[i+1] # (19): c=1 (31): NO CHANGE ... (95): c=0\n r=acq[n]-acq[i+1] # (20): r=4 (32): r=3 ... (96): r=0\n v+=(a*c*pow(3,l+r,mod)) # (21): v=81 (33): v=270 ... (97): NO CHANGE\n if l+r-1>=0: # (22): NO CHANGE (34): NO CHANGE ... (98): NO CHANGE\n v+=(a*r*pow(3,l+r-1,mod))+(l*c*pow(3,l+r-1,mod)) # (23): v=189 (35): v=378 ... (99): NO CHANGE\n if l+r-2>=0: # (24): NO CHANGE (36): NO CHANGE ... (100): NO CHANGE\n v+=(l*r*pow(3,l+r-2,mod)) # (25): NO CHANGE (37): v=405 ... (101): NO CHANGE\n v%=mod # (26): NO CHANGE (38): NO CHANGE ... (102): NO CHANGE\n"], "anno_status": [false], "diff_content": " from itertools import accumulate as ac\n s=input()\n n=len(s)\n mod=int(1e9)+7\n \n *aca,=ac([0]+[1 if i==\"A\" else 0 for i in s])\n *acc,=ac([0]+[1 if i==\"C\" else 0 for i in s])\n *acq,=ac([0]+[1 if i==\"?\" else 0 for i in s])\n \n v=0\n for i in range(1,n-1):\n if s[i]==\"B\" or s[i]==\"?\":\n a=aca[i]\n l=acq[i]\n c=acc[n]-acc[i+1]\n r=acq[n]-acq[i+1]\n v+=(a*c*pow(3,l+r,mod))\n if l+r-1>=0:\n v+=(a*r*pow(3,l+r-1,mod))+(l*c*pow(3,l+r-1,mod))\n if l+r-2>=0:\n v+=(l*r*pow(3,l+r-2,mod))\n v%=mod\n+print(v)\n", "FL_content": " from itertools import accumulate as ac\n s=input()\n n=len(s)\n mod=int(1e9)+7\n \n *aca,=ac([0]+[1 if i==\"A\" else 0 for i in s])\n *acc,=ac([0]+[1 if i==\"C\" else 0 for i in s])\n *acq,=ac([0]+[1 if i==\"?\" else 0 for i in s])\n \n v=0\n for i in range(1,n-1):\n if s[i]==\"B\" or s[i]==\"?\":\n a=aca[i]\n l=acq[i]\n c=acc[n]-acc[i+1]\n r=acq[n]-acq[i+1]\n v+=(a*c*pow(3,l+r,mod))\n if l+r-1>=0:\n v+=(a*r*pow(3,l+r-1,mod))+(l*c*pow(3,l+r-1,mod))\n if l+r-2>=0:\n v+=(l*r*pow(3,l+r-2,mod))\n v%=mod\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u947883560", "problem_id": "p03291", "submission1_id": "s690264051", "submission2_id": "s586987777", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nimport itertools\nimport collections\nimport functools\nimport math\nfrom queue import Queue\nINF = float(\"inf\")\n\nMOD = 1000000007 \n\nd = {}\n\n\ndef thpow(q):\n if q < 0:\n return 0\n if q == 0:\n return 1\n if q in d:\n return d[q]\n else:\n d[q] = (3*thpow(q-1)) % MOD\n return d[q]\n\n\ndef solve(S: str):\n dp = [0, 0, 0]\n q = 0\n for ch in S:\n \n a, b, c = dp\n if ch == \"A\":\n dp = [a+1, b, c]\n elif ch == \"B\":\n dp = [a, b+a, c]\n elif ch == \"C\":\n dp = [a, b, c+b]\n elif ch == \"?\":\n dp = [((a*3 % MOD)+thpow(q)) % MOD,\n ((b*3) % MOD+a) % MOD,\n ((c*3) % MOD+b) % MOD]\n q += 1\n \n print(dp[-1])\n return\n\n\ndef main():\n\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n S = next(tokens) \n solve(S)\n\n\nif __name__ == '__main__':\n main()\n", "code2": "\nimport sys\nimport itertools\nimport collections\nimport functools\nimport math\nfrom queue import Queue\nINF = float(\"inf\")\n\nMOD = 1000000007 \n\nd = {}\n\n\ndef thpow(q):\n if q < 0:\n return 0\n if q == 0:\n return 1\n if q in d:\n return d[q]\n else:\n d[q] = (3*thpow(q-1)) % MOD\n return d[q]\n\n\ndef solve(S: str):\n dp = [0, 0, 0]\n q = 0\n for ch in S:\n a, b, c = dp\n if ch == \"A\":\n dp = [(a+thpow(q)) % MOD, b, c]\n elif ch == \"B\":\n dp = [a, (b+a) % MOD, c]\n elif ch == \"C\":\n dp = [a, b, (c+b) % MOD]\n elif ch == \"?\":\n dp = [((a*3 % MOD)+thpow(q)) % MOD,\n ((b*3) % MOD+a) % MOD,\n ((c*3)+b) % MOD]\n q += 1\n \n \n\n \n print(dp[2])\n return\n\n\ndef main():\n\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n S = next(tokens) \n solve(S)\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554856743", "date2": "1554858704", "bleu_score": "0.9570449102540496", "code1_test_status": [1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 19, "total_score": 103, "input": ">??@>????@?>B@A@?@=???\n", "actual_output": "6397029\n", "expected_output": "6751269\n\n", "anno_code": ["\nimport sys\nimport itertools\nimport collections\nimport functools\nimport math\nfrom queue import Queue\nINF = float(\"inf\") # (0): INF=inf\n\nMOD = 1000000007 # (1): MOD=1000000007\n\nd = {} # (2): d={}\n\n\ndef thpow(q): # (3): thpow=\n if q < 0:\n return 0\n if q == 0:\n return 1\n if q in d:\n return d[q]\n else:\n d[q] = (3*thpow(q-1)) % MOD\n return d[q]\n\n\ndef solve(S: str): # (4): solve=\n dp = [0, 0, 0]\n q = 0\n for ch in S:\n \n a, b, c = dp\n if ch == \"A\":\n dp = [a+1, b, c]\n elif ch == \"B\":\n dp = [a, b+a, c]\n elif ch == \"C\":\n dp = [a, b, c+b]\n elif ch == \"?\":\n dp = [((a*3 % MOD)+thpow(q)) % MOD,\n ((b*3) % MOD+a) % MOD,\n ((c*3) % MOD+b) % MOD]\n q += 1\n \n print(dp[-1])\n return\n\n\ndef main(): # (5): main=\n\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n S = next(tokens) \n solve(S)\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [false], "diff_content": " \n import sys\n import itertools\n import collections\n import functools\n import math\n from queue import Queue\n INF = float(\"inf\")\n \n MOD = 1000000007 \n \n d = {}\n \n \n def thpow(q):\n if q < 0:\n return 0\n if q == 0:\n return 1\n if q in d:\n return d[q]\n else:\n d[q] = (3*thpow(q-1)) % MOD\n return d[q]\n \n \n def solve(S: str):\n dp = [0, 0, 0]\n q = 0\n for ch in S:\n- \n a, b, c = dp\n if ch == \"A\":\n- dp = [a+1, b, c]\n+ dp = [(a+thpow(q)) % MOD, b, c]\n elif ch == \"B\":\n- dp = [a, b+a, c]\n+ dp = [a, (b+a) % MOD, c]\n elif ch == \"C\":\n- dp = [a, b, c+b]\n+ dp = [a, b, (c+b) % MOD]\n elif ch == \"?\":\n dp = [((a*3 % MOD)+thpow(q)) % MOD,\n ((b*3) % MOD+a) % MOD,\n- ((c*3) % MOD+b) % MOD]\n+ ((c*3)+b) % MOD]\n q += 1\n+ \n+ \n+\n \n- print(dp[-1])\n+ print(dp[2])\n return\n \n \n def main():\n \n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n S = next(tokens) \n solve(S)\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " \n import sys\n import itertools\n import collections\n import functools\n import math\n from queue import Queue\n INF = float(\"inf\")\n \n MOD = 1000000007 \n \n d = {}\n \n \n def thpow(q):\n if q < 0:\n return 0\n if q == 0:\n return 1\n if q in d:\n return d[q]\n else:\n d[q] = (3*thpow(q-1)) % MOD\n return d[q]\n \n \n def solve(S: str):\n dp = [0, 0, 0]\n q = 0\n for ch in S:\n- \n a, b, c = dp\n if ch == \"A\":\n- dp = [a+1, b, c]\n elif ch == \"B\":\n- dp = [a, b+a, c]\n elif ch == \"C\":\n- dp = [a, b, c+b]\n elif ch == \"?\":\n dp = [((a*3 % MOD)+thpow(q)) % MOD,\n ((b*3) % MOD+a) % MOD,\n- ((c*3) % MOD+b) % MOD]\n q += 1\n \n- print(dp[-1])\n return\n \n \n def main():\n \n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n S = next(tokens) \n solve(S)\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 8, "removed_lines": 6, "code1_lines": 62 }, { "user_id": "u679759899", "problem_id": "p03291", "submission1_id": "s957840790", "submission2_id": "s463668266", "status1": "Wrong Answer", "status2": "Accepted", "code1": "MOD = 10 **9 + 7\ns = input()\n\nn = len(s)\na = [0] * (n+1)\nb = [0] * (n+1)\nc = [0] * (n+1)\n\nfor i in range(n):\n if s[i] == '?':\n a[i+1] = a[i] * 3 + 1\n b[i+1] = b[i] * 3 + a[i]\n c[i+1] = c[i] * 3 + b[i]\n else:\n a[i+1] = a[i]\n b[i+1] = b[i]\n c[i+1] = c[i]\n if s[i] == 'A':\n a[i+1] += 1\n if s[i] == 'B':\n b[i+1] += a[i]\n if s[i] == 'C':\n c[i+1] += b[i]\n a[i+1] = a[i+1] % MOD\n b[i+1] = b[i+1] % MOD\n c[i+1] = c[i+1] % MOD\nprint(c[n])", "code2": "MOD = 10 **9 + 7\ns = input()\n\nn = len(s)\no = [1] * (n+1)\na = [0] * (n+1)\nb = [0] * (n+1)\nc = [0] * (n+1)\n\nfor i in range(n):\n if s[i] == '?':\n o[i+1] = o[i] * 3\n a[i+1] = a[i] * 3 + o[i]\n b[i+1] = b[i] * 3 + a[i]\n c[i+1] = c[i] * 3 + b[i]\n else:\n o[i+1] = o[i]\n a[i+1] = a[i]\n b[i+1] = b[i]\n c[i+1] = c[i]\n if s[i] == 'A':\n a[i+1] += o[i]\n if s[i] == 'B':\n b[i+1] += a[i]\n if s[i] == 'C':\n c[i+1] += b[i]\n o[i+1] = o[i+1] % MOD\n a[i+1] = a[i+1] % MOD\n b[i+1] = b[i+1] % MOD\n c[i+1] = c[i+1] % MOD\nprint(c[n])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566012410", "date2": "1566013183", "bleu_score": "0.8411865537993586", "code1_test_status": [1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 7, "total_score": 103, "input": "??>=>=?B;=@@C??@>@@??A???\n", "actual_output": "215884\n", "expected_output": "498636\n\n", "anno_code": ["MOD = 10 **9 + 7 # (0): MOD=1000000007\ns = input() # (1): s=??>=>=?B;=@@C??@>@@??A???\n\nn = len(s) # (2): n=25\na = [0] * (n+1) # (3): a=[0, 0, ..., 0, 0]\nb = [0] * (n+1) # (4): b=[0, 0, ..., 0, 0]\nc = [0] * (n+1) # (5): c=[0, 0, ..., 0, 0]\n\nfor i in range(n): # (6): i=0 (14): i=1 ... (254): NO CHANGE\n if s[i] == '?': # (7): NO CHANGE (15): NO CHANGE ... (247): NO CHANGE\n a[i+1] = a[i] * 3 + 1 # (8): a=[0, 1, ..., 0, 0] (16): a=[0, 1, ..., 0, 0] ... (248): a=[0, 1, ..., 9850, 29551]\n b[i+1] = b[i] * 3 + a[i] # (9): NO CHANGE (17): b=[0, 0, ..., 0, 0] ... (249): b=[0, 0, ..., 34087, 112111]\n c[i+1] = c[i] * 3 + b[i] # (10): NO CHANGE (18): NO CHANGE ... (250): c=[0, 0, ..., 60599, 215884]\n else:\n a[i+1] = a[i] # (24): a=[0, 1, ..., 0, 0] (35): a=[0, 1, ..., 0, 0] ... (220): a=[0, 1, ..., 0, 0]\n b[i+1] = b[i] # (25): b=[0, 0, ..., 0, 0] (36): b=[0, 0, ..., 0, 0] ... (221): b=[0, 0, ..., 0, 0]\n c[i+1] = c[i] # (26): NO CHANGE (37): NO CHANGE ... (222): c=[0, 0, ..., 0, 0]\n if s[i] == 'A': # (27): NO CHANGE (38): NO CHANGE ... (223): NO CHANGE\n a[i+1] += 1 # (224): a=[0, 1, ..., 0, 0]\n if s[i] == 'B': # (28): NO CHANGE (39): NO CHANGE ... (225): NO CHANGE\n b[i+1] += a[i] # (81): b=[0, 0, ..., 0, 0]\n if s[i] == 'C': # (29): NO CHANGE (40): NO CHANGE ... (226): NO CHANGE\n c[i+1] += b[i] # (138): c=[0, 0, ..., 0, 0]\n a[i+1] = a[i+1] % MOD # (11): NO CHANGE (19): NO CHANGE ... (251): NO CHANGE\n b[i+1] = b[i+1] % MOD # (12): NO CHANGE (20): NO CHANGE ... (252): NO CHANGE\n c[i+1] = c[i+1] % MOD # (13): NO CHANGE (21): NO CHANGE ... (253): NO CHANGE\nprint(c[n])"], "anno_status": [false], "diff_content": " MOD = 10 **9 + 7\n s = input()\n \n n = len(s)\n+o = [1] * (n+1)\n a = [0] * (n+1)\n b = [0] * (n+1)\n c = [0] * (n+1)\n \n for i in range(n):\n if s[i] == '?':\n- a[i+1] = a[i] * 3 + 1\n+ o[i+1] = o[i] * 3\n+ a[i+1] = a[i] * 3 + o[i]\n b[i+1] = b[i] * 3 + a[i]\n c[i+1] = c[i] * 3 + b[i]\n else:\n+ o[i+1] = o[i]\n a[i+1] = a[i]\n b[i+1] = b[i]\n c[i+1] = c[i]\n if s[i] == 'A':\n- a[i+1] += 1\n+ a[i+1] += o[i]\n if s[i] == 'B':\n b[i+1] += a[i]\n if s[i] == 'C':\n c[i+1] += b[i]\n+ o[i+1] = o[i+1] % MOD\n a[i+1] = a[i+1] % MOD\n b[i+1] = b[i+1] % MOD\n c[i+1] = c[i+1] % MOD\n print(c[n])\n", "FL_content": " MOD = 10 **9 + 7\n s = input()\n \n n = len(s)\n a = [0] * (n+1)\n b = [0] * (n+1)\n c = [0] * (n+1)\n \n for i in range(n):\n if s[i] == '?':\n- a[i+1] = a[i] * 3 + 1\n b[i+1] = b[i] * 3 + a[i]\n c[i+1] = c[i] * 3 + b[i]\n else:\n a[i+1] = a[i]\n b[i+1] = b[i]\n c[i+1] = c[i]\n if s[i] == 'A':\n- a[i+1] += 1\n if s[i] == 'B':\n b[i+1] += a[i]\n if s[i] == 'C':\n c[i+1] += b[i]\n a[i+1] = a[i+1] % MOD\n b[i+1] = b[i+1] % MOD\n c[i+1] = c[i+1] % MOD\n print(c[n])\n", "added_lines": 6, "removed_lines": 2, "code1_lines": 27 }, { "user_id": "u652150585", "problem_id": "p03291", "submission1_id": "s333767120", "submission2_id": "s245567337", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\ntable=[[0 for _ in range(4)] for _ in range(len(s)+1)]\nabc='ABC'\nfor i in range(len(s)):\n table[i][0]=1\n for j in range(3):\n if s[i]=='?':\n table[i+1][j+1]=3*table[i][j+1]+table[i][j]\n elif s[i]==abc[j]:\n table[i+1][j+1]=table[i][j+1]+table[i][j]\n else:\n table[i+1][j+1]=table[i][j+1]\n\nprint(table[i+1][j+1]%(10*9+7))", "code2": "s=input()\ntable=[[0 for _ in range(4)] for _ in range(len(s)+1)]\ntable[0][0]=1\nabc='ABC'\nfor i in range(len(s)):\n for j in range(4):\n if s[i]=='?' and j!=0:\n table[i+1][j]=(3*table[i][j]+table[i][j-1])%(10**9+7)\n elif s[i]=='?':\n table[i+1][0]=3*table[i][0]%(10**9+7)\n elif s[i]==abc[j-1] and j!=0:\n table[i+1][j]=(table[i][j]+table[i][j-1])%(10**9+7)\n else:\n table[i+1][j]=table[i][j]%(10**9+7)\n\nprint(table[i+1][j]%(10**9+7))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1545022507", "date2": "1545023947", "bleu_score": "0.7069121726979721", "code1_test_status": [1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 7, "total_score": 103, "input": "?9>=>B=>@B??=>B=>@B?? 0:\n n[i] *= pow3q \n n[i] += pow3q1 * q \n n[i] %= modulo\n if S[i] == '?':\n q += 1\n pow3q1 = pow3q\n pow3q = pow3q * 3 % modulo\n return n\n \ndef nright(S, c):\n \n n = [0 for c in S]\n for i in range(len(S) - 1, 0, -1):\n n[i-1] = n[i] + (1 if S[i] == c else 0)\n\n q = 0 \n pow3q = 1 \n for i in range(len(n) - 1, -1, -1):\n if q > 0:\n n[i] *= pow3q \n n[i] += pow3q1 * q \n n[i] %= modulo\n if S[i] == '?':\n q += 1\n pow3q1 = pow3q\n pow3q = pow3q * 3 % modulo\n return n\n \n \nleft = nleft (S, 'A')\nright = nright(S, 'C')\n \n\nabc = 0\nfor i in range(0, len(S)):\n if S[i] in 'B?':\n abc += left[i] * right[i]\n \nabc = int(abc) % modulo\nprint(abc)\n", "code2": "\n\n \nmodulo = 10 ** 9 + 7\n \nS = input()\n \ndef nleft(S, c):\n \n \n \n n = [0 for c in S]\n for i in range(1, len(S)):\n n[i] = n[i-1] + (1 if S[i-1] == c else 0)\n \n q = 0 \n pow3q = 1 \n for i in range(len(n)):\n if q > 0:\n n[i] *= pow3q \n n[i] += pow3q1 * q \n n[i] %= modulo\n if S[i] == '?':\n q += 1\n pow3q1 = pow3q\n pow3q = pow3q * 3 % modulo\n return n\n \ndef nright(S, c):\n \n n = [0 for c in S]\n for i in range(len(S) - 1, 0, -1):\n n[i-1] = n[i] + (1 if S[i] == c else 0)\n \n q = 0 \n pow3q = 1 \n for i in range(len(n) - 1, -1, -1):\n if q > 0:\n n[i] *= pow3q \n n[i] += pow3q1 * q \n n[i] %= modulo\n if S[i] == '?':\n q += 1\n pow3q1 = pow3q\n pow3q = pow3q * 3 % modulo\n return n\n \n \nleft = nleft (S, 'A')\nright = nright(S, 'C')\n \n\nabc = 0\nfor i in range(0, len(S)):\n if S[i] in 'B?':\n abc += left[i] * right[i]\n \nabc = int(abc) % modulo\nprint(abc)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1533591597", "date2": "1533594555", "bleu_score": "0.9913439974586936", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 101, "total_score": 103, "input": ">?@===A@;=@@C>??@??@=>A>A\n", "actual_output": "603\n", "expected_output": "252\n\n", "anno_code": ["\n\n \nmodulo = 10 ** 9 + 7 # (0): modulo=1000000007\n \nS = input() # (1): S=>?@===A@;=@@C>??@??@=>A>A\n \ndef nleft(S, c): # (2): nleft=\n \n \n \n n = [0 for c in S] # (5): n=[0, 0, ..., 0, 0]\n for i in range(len(S)): # (6): i=0 (8): i=1 ... (56): NO CHANGE\n n[i] = n[i-1] + (1 if S[i-1] == c else 0) # (7): n=[1, 0, ..., 0, 0] (9): n=[1, 1, ..., 0, 0] ... (55): n=[1, 1, ..., 3, 3]\n\n q = 0 # (57): q=0\n pow3q = 1 # (58): pow3q=1\n for i in range(len(n)): # (59): i=0 (62): i=1 ... (218): modulo=1000000007, nleft=, nright=, left=[1, 1, ..., 1134, 1134]\n if q > 0: # (60): NO CHANGE (63): NO CHANGE ... (213): NO CHANGE\n n[i] *= pow3q # (70): n=[1, 1, ..., 3, 3] (76): n=[1, 1, ..., 3, 3] ... (214): n=[1, 1, ..., 1134, 729]\n n[i] += pow3q1 * q # (71): n=[1, 1, ..., 3, 3] (77): n=[1, 1, ..., 3, 3] ... (215): n=[1, 1, ..., 1134, 1134]\n n[i] %= modulo # (72): NO CHANGE (78): NO CHANGE ... (216): NO CHANGE\n if S[i] == '?': # (61): NO CHANGE (64): NO CHANGE ... (217): NO CHANGE\n q += 1 # (65): q=1 (146): q=2 ... (179): q=5\n pow3q1 = pow3q # (66): pow3q1=1 (147): pow3q1=3 ... (180): pow3q1=81\n pow3q = pow3q * 3 % modulo # (67): pow3q=3 (148): pow3q=9 ... (181): pow3q=243\n return n\n \ndef nright(S, c): # (3): nright=\n \n n = [0 for c in S] # (220): n=[0, 0, ..., 0, 0]\n for i in range(len(S) - 1, 0, -1): # (221): i=24 (223): i=23 ... (269): NO CHANGE\n n[i-1] = n[i] + (1 if S[i] == c else 0) # (222): NO CHANGE (224): NO CHANGE ... (268): n=[1, 1, ..., 0, 0]\n\n q = 0 # (270): q=0\n pow3q = 1 # (271): pow3q=1\n for i in range(len(n) - 1, -1, -1): # (272): i=24 (275): i=23 ... (416): modulo=1000000007, nleft=, nright=, left=[1, 1, ..., 1134, 1134], right=[648, 189, ..., 0, 0]\n if q > 0: # (273): NO CHANGE (276): NO CHANGE ... (411): NO CHANGE\n n[i] *= pow3q # (298): NO CHANGE (307): NO CHANGE ... (412): n=[243, 189, ..., 0, 0]\n n[i] += pow3q1 * q # (299): n=[1, 1, ..., 0, 0] (308): n=[1, 1, ..., 0, 0] ... (413): n=[648, 189, ..., 0, 0]\n n[i] %= modulo # (300): NO CHANGE (309): NO CHANGE ... (414): NO CHANGE\n if S[i] == '?': # (274): NO CHANGE (277): NO CHANGE ... (415): NO CHANGE\n q += 1 # (293): q=1 (302): q=2 ... (407): q=5\n pow3q1 = pow3q # (294): pow3q1=1 (303): pow3q1=3 ... (408): pow3q1=81\n pow3q = pow3q * 3 % modulo # (295): pow3q=3 (304): pow3q=9 ... (409): pow3q=243\n return n\n \n \nleft = nleft (S, 'A') # (4): c=A\nright = nright(S, 'C') # (219): c=C\n \n\nabc = 0 # (417): abc=0\nfor i in range(0, len(S)): # (418): i=0 (420): i=1 ... (473): NO CHANGE\n if S[i] in 'B?': # (419): NO CHANGE (421): NO CHANGE ... (472): NO CHANGE\n abc += left[i] * right[i] # (422): abc=189 (449): abc=378 ... (460): NO CHANGE\n \nabc = int(abc) % modulo # (474): NO CHANGE\nprint(abc)\n"], "anno_status": [false], "diff_content": " \n \n \n modulo = 10 ** 9 + 7\n \n S = input()\n \n def nleft(S, c):\n \n \n \n n = [0 for c in S]\n- for i in range(len(S)):\n+ for i in range(1, len(S)):\n n[i] = n[i-1] + (1 if S[i-1] == c else 0)\n-\n+ \n q = 0 \n pow3q = 1 \n for i in range(len(n)):\n if q > 0:\n n[i] *= pow3q \n n[i] += pow3q1 * q \n n[i] %= modulo\n if S[i] == '?':\n q += 1\n pow3q1 = pow3q\n pow3q = pow3q * 3 % modulo\n return n\n \n def nright(S, c):\n \n n = [0 for c in S]\n for i in range(len(S) - 1, 0, -1):\n n[i-1] = n[i] + (1 if S[i] == c else 0)\n-\n+ \n q = 0 \n pow3q = 1 \n for i in range(len(n) - 1, -1, -1):\n if q > 0:\n n[i] *= pow3q \n n[i] += pow3q1 * q \n n[i] %= modulo\n if S[i] == '?':\n q += 1\n pow3q1 = pow3q\n pow3q = pow3q * 3 % modulo\n return n\n \n \n left = nleft (S, 'A')\n right = nright(S, 'C')\n \n \n abc = 0\n for i in range(0, len(S)):\n if S[i] in 'B?':\n abc += left[i] * right[i]\n \n abc = int(abc) % modulo\n print(abc)\n-\n", "FL_content": " \n \n \n modulo = 10 ** 9 + 7\n \n S = input()\n \n def nleft(S, c):\n \n \n \n n = [0 for c in S]\n- for i in range(len(S)):\n n[i] = n[i-1] + (1 if S[i-1] == c else 0)\n-\n q = 0 \n pow3q = 1 \n for i in range(len(n)):\n if q > 0:\n n[i] *= pow3q \n n[i] += pow3q1 * q \n n[i] %= modulo\n if S[i] == '?':\n q += 1\n pow3q1 = pow3q\n pow3q = pow3q * 3 % modulo\n return n\n \n def nright(S, c):\n \n n = [0 for c in S]\n for i in range(len(S) - 1, 0, -1):\n n[i-1] = n[i] + (1 if S[i] == c else 0)\n-\n q = 0 \n pow3q = 1 \n for i in range(len(n) - 1, -1, -1):\n if q > 0:\n n[i] *= pow3q \n n[i] += pow3q1 * q \n n[i] %= modulo\n if S[i] == '?':\n q += 1\n pow3q1 = pow3q\n pow3q = pow3q * 3 % modulo\n return n\n \n \n left = nleft (S, 'A')\n right = nright(S, 'C')\n \n \n abc = 0\n for i in range(0, len(S)):\n if S[i] in 'B?':\n abc += left[i] * right[i]\n \n abc = int(abc) % modulo\n print(abc)\n-\n", "added_lines": 3, "removed_lines": 4, "code1_lines": 60 }, { "user_id": "u102960641", "problem_id": "p03291", "submission1_id": "s715592501", "submission2_id": "s509903005", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(input())\nmod = 10**9 + 7\nabc = 0\nbc = 0\nc = 0\nq = 0\nprint(s[::-1])\nfor i in s[::-1]:\n if i == \"A\":\n abc = (abc + bc) % mod\n if i == \"B\":\n bc = (bc + c) % mod\n if i == \"C\":\n c = (3**q+c) % mod\n if i == \"?\":\n abc = (abc*3 + bc) % mod\n bc = (bc*3 + c) % mod \n c = (3**q + c*3) % mod\n q += 1\nprint(abc)", "code2": "s = input()\nmod = 10**9 + 7\nabc = 0\nbc = 0\nc = 0\nq = 0\nfor i in s[::-1]:\n if i == \"A\":\n abc = (abc + bc) % mod\n if i == \"B\":\n bc = (bc + c) % mod\n if i == \"C\":\n c = (pow(3,q,mod) + c) % mod\n if i == \"?\":\n abc = (abc*3 + bc) % mod\n bc = (bc*3 + c) % mod \n c = (pow(3,q,mod) + c*3) % mod\n q += 1\nprint(int(abc))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1546470484", "date2": "1546472321", "bleu_score": "0.9042655042630222", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "ABDBC\n", "actual_output": "['C', 'B', 'D', 'B', 'A']\n2\n", "expected_output": "2\n\n", "anno_code": ["s = list(input()) # (0): s=['A', 'B', 'D', 'B', 'C']\nmod = 10**9 + 7 # (1): mod=1000000007\nabc = 0 # (2): abc=0\nbc = 0 # (3): bc=0\nc = 0 # (4): c=0\nq = 0 # (5): q=0\nprint(s[::-1]) # (6): NO CHANGE\nfor i in s[::-1]: # (7): i=C (13): i=B ... (36): NO CHANGE\n if i == \"A\": # (8): NO CHANGE (14): NO CHANGE ... (31): NO CHANGE\n abc = (abc + bc) % mod # (32): abc=2\n if i == \"B\": # (9): NO CHANGE (15): NO CHANGE ... (33): NO CHANGE\n bc = (bc + c) % mod # (16): bc=1 (27): bc=2\n if i == \"C\": # (10): NO CHANGE (17): NO CHANGE ... (34): NO CHANGE\n c = (3**q+c) % mod # (11): c=1\n if i == \"?\": # (12): NO CHANGE (18): NO CHANGE ... (35): NO CHANGE\n abc = (abc*3 + bc) % mod\n bc = (bc*3 + c) % mod \n c = (3**q + c*3) % mod\n q += 1\nprint(abc)"], "anno_status": [true], "diff_content": "-s = list(input())\n+s = input()\n mod = 10**9 + 7\n abc = 0\n bc = 0\n c = 0\n q = 0\n-print(s[::-1])\n for i in s[::-1]:\n if i == \"A\":\n abc = (abc + bc) % mod\n if i == \"B\":\n bc = (bc + c) % mod\n if i == \"C\":\n- c = (3**q+c) % mod\n+ c = (pow(3,q,mod) + c) % mod\n if i == \"?\":\n abc = (abc*3 + bc) % mod\n bc = (bc*3 + c) % mod \n- c = (3**q + c*3) % mod\n+ c = (pow(3,q,mod) + c*3) % mod\n q += 1\n-print(abc)\n+print(int(abc))\n+\n", "FL_content": "-s = list(input())\n mod = 10**9 + 7\n abc = 0\n bc = 0\n c = 0\n q = 0\n-print(s[::-1])\n for i in s[::-1]:\n if i == \"A\":\n abc = (abc + bc) % mod\n if i == \"B\":\n bc = (bc + c) % mod\n if i == \"C\":\n- c = (3**q+c) % mod\n if i == \"?\":\n abc = (abc*3 + bc) % mod\n bc = (bc*3 + c) % mod \n- c = (3**q + c*3) % mod\n q += 1\n-print(abc)\n", "added_lines": 5, "removed_lines": 5, "code1_lines": 20 }, { "user_id": "u653005308", "problem_id": "p03291", "submission1_id": "s941710316", "submission2_id": "s548535215", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nabc=\"ABCD\"\nn=len(s)\nmod=10**9+7\ndp=[[0]*4 for i in range(n+1)]\ndp[n][3]=1\nfor i in range(n-1,-1,-1):\n for j in range(4):\n if s[i]=='?' :\n if j==3:\n dp[i][j]=3*dp[i+1][j]\n else :\n dp[i][j]=3*dp[i+1][j]+dp[i+1][j+1]\n elif s[i]==abc[j]:\n if j!=3:\n dp[i][j]=dp[i+1][j]+dp[i+1][j+1]\n else :\n dp[i][j]=dp[i+1][j]\n else :\n dp[i][j]=dp[i+1][j]\n dp[i][j]%=mod\nprint(dp[0][0])", "code2": "s=input()\nabc=\"ABCD\"\nn=len(s)\nmod=10**9+7\ndp=[[0]*4 for i in range(n+1)]\ndp[n][3]=1\nfor i in range(n-1,-1,-1):\n for j in range(4):\n if s[i]=='?' :\n if j==3:\n dp[i][j]=3*dp[i+1][j]\n else :\n dp[i][j]=3*dp[i+1][j]+dp[i+1][j+1]\n elif s[i]==abc[j]:\n if j!=3:\n dp[i][j]=dp[i+1][j]+dp[i+1][j+1]\n else :\n dp[i][j]=dp[i+1][j]\n else :\n dp[i][j]=dp[i+1][j]\n dp[i][j]%=mod\nprint(dp[0][0])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1535614792", "date2": "1535615025", "bleu_score": "0.9923150460572129", "code1_test_status": [1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 87, "total_score": 103, "input": ">???=??>??@??????A@???@?B\n", "actual_output": "3338512362\n", "expected_output": "338512341\n\n", "anno_code": ["s=input() # (0): s=>???=??>??@??????A@???@?B\nabc=\"ABCD\" # (1): abc=ABCD\nn=len(s) # (2): n=25\nmod=10**9+7 # (3): mod=1000000007\ndp=[[0]*4 for i in range(n+1)] # (4): dp\ndp[n][3]=1 # (5): dp\nfor i in range(n-1,-1,-1): # (6): i=24 (26): i=23 ... (483): NO CHANGE\n for j in range(4): # (7): j=0 (11): j=1 ... (481): NO CHANGE\n if s[i]=='?' : # (8): NO CHANGE (12): NO CHANGE ... (478): NO CHANGE\n if j==3: # (29): NO CHANGE (33): NO CHANGE ... (460): NO CHANGE\n dp[i][j]=3*dp[i+1][j] # (42): dp (80): dp ... (461): dp\n else :\n dp[i][j]=3*dp[i+1][j]+dp[i+1][j+1] # (30): NO CHANGE (34): NO CHANGE ... (457): dp\n elif s[i]==abc[j]: # (9): NO CHANGE (13): NO CHANGE ... (479): NO CHANGE\n if j!=3: # (14): NO CHANGE (144): NO CHANGE\n dp[i][j]=dp[i+1][j]+dp[i+1][j+1] # (15): NO CHANGE (145): dp\n else :\n dp[i][j]=dp[i+1][j]\n else :\n dp[i][j]=dp[i+1][j] # (10): NO CHANGE (19): NO CHANGE ... (480): dp\n dp[i][j]%=mod # (25): NO CHANGE (44): NO CHANGE ... (482): NO CHANGE\nprint(dp[0][0])"], "anno_status": [true], "diff_content": " s=input()\n abc=\"ABCD\"\n n=len(s)\n mod=10**9+7\n dp=[[0]*4 for i in range(n+1)]\n dp[n][3]=1\n for i in range(n-1,-1,-1):\n for j in range(4):\n if s[i]=='?' :\n if j==3:\n dp[i][j]=3*dp[i+1][j]\n else :\n dp[i][j]=3*dp[i+1][j]+dp[i+1][j+1]\n elif s[i]==abc[j]:\n if j!=3:\n dp[i][j]=dp[i+1][j]+dp[i+1][j+1]\n else :\n dp[i][j]=dp[i+1][j]\n else :\n dp[i][j]=dp[i+1][j]\n- dp[i][j]%=mod\n+ dp[i][j]%=mod\n print(dp[0][0])\n", "FL_content": " s=input()\n abc=\"ABCD\"\n n=len(s)\n mod=10**9+7\n dp=[[0]*4 for i in range(n+1)]\n dp[n][3]=1\n for i in range(n-1,-1,-1):\n for j in range(4):\n if s[i]=='?' :\n if j==3:\n dp[i][j]=3*dp[i+1][j]\n else :\n dp[i][j]=3*dp[i+1][j]+dp[i+1][j+1]\n elif s[i]==abc[j]:\n if j!=3:\n dp[i][j]=dp[i+1][j]+dp[i+1][j+1]\n else :\n dp[i][j]=dp[i+1][j]\n else :\n dp[i][j]=dp[i+1][j]\n- dp[i][j]%=mod\n print(dp[0][0])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 22 }, { "user_id": "u640123177", "problem_id": "p02843", "submission1_id": "s300619417", "submission2_id": "s403766811", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x = int(input())\na = 0\ni = 0\nwhile a <= x:\n a += 100\n i += 1\ny = x - 100*(a-1)\nif y <= (i-1)*a:\n print(\"1\")\nelse:\n print(\"0\")", "code2": "x = int(input())\na = 0\ni = 0\nwhile a <= x:\n a += 100\n i += 1\na -= 100\ni -= 1\ny = x - a\nif y <= i*5:\n print(\"1\")\nelse:\n print(\"0\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575254062", "date2": "1575255542", "bleu_score": "0.8494856040009963", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0], "code1_test_score": 5, "total_score": 26, "input": "152\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["x = int(input()) # (0): x=152\na = 0 # (1): a=0\ni = 0 # (2): i=0\nwhile a <= x: # (3): NO CHANGE (6): NO CHANGE (9): NO CHANGE\n a += 100 # (4): a=100 (7): a=200\n i += 1 # (5): i=1 (8): i=2\ny = x - 100*(a-1) # (10): y=-19748\nif y <= (i-1)*a: # (11): NO CHANGE\n print(\"1\")\nelse:\n print(\"0\")"], "anno_status": [true], "diff_content": " x = int(input())\n a = 0\n i = 0\n while a <= x:\n a += 100\n i += 1\n-y = x - 100*(a-1)\n-if y <= (i-1)*a:\n+a -= 100\n+i -= 1\n+y = x - a\n+if y <= i*5:\n print(\"1\")\n else:\n print(\"0\")\n+\n", "FL_content": " x = int(input())\n a = 0\n i = 0\n while a <= x:\n a += 100\n i += 1\n-y = x - 100*(a-1)\n-if y <= (i-1)*a:\n print(\"1\")\n else:\n print(\"0\")\n", "added_lines": 5, "removed_lines": 2, "code1_lines": 11 }, { "user_id": "u490992416", "problem_id": "p02843", "submission1_id": "s066453000", "submission2_id": "s660323897", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x = int(input())\nl = int(x/105)\nu = int(x/100)+1\nflag = False\nfor n in range(l, u):\n for a in range(0, u):\n for b in range(n-a, u):\n for c in range(n-a-b, u):\n for d in range(n-a-b-c, u):\n for e in range(n-a-b-c-d, u):\n for f in range(n-a-b-c-d-e, u):\n if 100*a + 101*b + 102*c + 103*d + 104*e + 105*f == x:\n \n flag = True\n break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n\nif flag:\n print('1')\nelse:\n print('0')", "code2": "x = int(input())\nl = int(x/105)\nu = int(x/100)+1\nflag = False\nfor n in range(l, u):\n for a in range(0, u):\n for b in range(0, u-a):\n for c in range(0, u-a-b):\n for d in range(0, u-a-b-c):\n for e in range(0, u-a-b-c-d):\n for f in range(0, u-a-b-c-d-e):\n if 100*a + 101*b + 102*c + 103*d + 104*e + 105*f == x:\n \n flag = True\n break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n\nif flag:\n print('1')\nelse:\n print('0')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575260292", "date2": "1575260363", "bleu_score": "0.9675100140069466", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1], "code1_test_score": 18, "total_score": 26, "input": "420\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " x = int(input())\n l = int(x/105)\n u = int(x/100)+1\n flag = False\n for n in range(l, u):\n for a in range(0, u):\n- for b in range(n-a, u):\n- for c in range(n-a-b, u):\n- for d in range(n-a-b-c, u):\n- for e in range(n-a-b-c-d, u):\n- for f in range(n-a-b-c-d-e, u):\n+ for b in range(0, u-a):\n+ for c in range(0, u-a-b):\n+ for d in range(0, u-a-b-c):\n+ for e in range(0, u-a-b-c-d):\n+ for f in range(0, u-a-b-c-d-e):\n if 100*a + 101*b + 102*c + 103*d + 104*e + 105*f == x:\n \n flag = True\n break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n \n if flag:\n print('1')\n else:\n print('0')\n", "FL_content": " x = int(input())\n l = int(x/105)\n u = int(x/100)+1\n flag = False\n for n in range(l, u):\n for a in range(0, u):\n- for b in range(n-a, u):\n- for c in range(n-a-b, u):\n- for d in range(n-a-b-c, u):\n- for e in range(n-a-b-c-d, u):\n- for f in range(n-a-b-c-d-e, u):\n if 100*a + 101*b + 102*c + 103*d + 104*e + 105*f == x:\n \n flag = True\n break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n \n if flag:\n print('1')\n else:\n print('0')\n", "added_lines": 5, "removed_lines": 5, "code1_lines": 27 }, { "user_id": "u972416428", "problem_id": "p02843", "submission1_id": "s239672733", "submission2_id": "s267224660", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input().strip())\nvalid = { 0: True }\nfor i in range(1, n+1):\n valid[i] = any(valid.get(i-j, False) for j in range(100, 106))\nprint (valid[n])", "code2": "n = int(input().strip())\nvalid = { 0: True }\nfor i in range(1, n+1):\n valid[i] = any(valid.get(i-j, False) for j in range(100, 106))\nprint (1 if valid[i] else 0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575299765", "date2": "1575299911", "bleu_score": "0.9001457924493163", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 26, "input": "474\n", "actual_output": "False\n", "expected_output": "0\n\n", "anno_code": ["n = int(input().strip()) # (0): n=474\nvalid = { 0: True } # (1): valid={0: True}\nfor i in range(1, n+1): # (2): i=1 (4): i=2 ... (950): NO CHANGE\n valid[i] = any(valid.get(i-j, False) for j in range(100, 106)) # (3): valid={0: True, 1: False} (5): valid={0: True, 1: False, 2: False} ... (949): valid={0: True, 1: False, 2: False, 3: False, 4: False, 5: False, 6: False, 7: False, 8: False, 9: False, 10: False, 11: False, 12: False, 13: False, 14: False, 15: False, 16: False, 17: False, 18: False, 19: False, 20: False, 21: False, 22: False, 23: False, 24: False, 25: False, 26: False, 27: False, 28: False, 29: False, 30: False, 31: False, 32: False, 33: False, 34: False, 35: False, 36: False, 37: False, 38: False, 39: False, 40: False, 41: False, 42: False, 43: False, 44: False, 45: False, 46: False, 47: False, 48: False, 49: False, 50: False, 51: False, 52: False, 53: False, 54: False, 55: False, 56: False, 57: False, 58: False, 59: False, 60: False, 61: False, 62: False, 63: False, 64: False, 65: False, 66: False, 67: False, 68: False, 69: False, 70: False, 71: False, 72: False, 73: False, 74: False, 75: False, 76: False, 77: False, 78: False, 79: False, 80: False, 81: False, 82: False, 83: False, 84: False, 85: False, 86: False, 87: False, 88: False, 89: False, 90: False, 91: False, 92: False, 93: False, 94: False, 95: False, 96: False, 97: False, 98: False, 99: False, 100: True, 101: True, 102: True, 103: True, 104: True, 105: True, 106: False, 107: False, 108: False, 109: False, 110: False, 111: False, 112: False, 113: False, 114: False, 115: False, 116: False, 117: False, 118: False, 119: False, 120: False, 121: False, 122: False, 123: False, 124: False, 125: False, 126: False, 127: False, 128: False, 129: False, 130: False, 131: False, 132: False, 133: False, 134: False, 135: False, 136: False, 137: False, 138: False, 139: False, 140: False, 141: False, 142: False, 143: False, 144: False, 145: False, 146: False, 147: False, 148: False, 149: False, 150: False, 151: False, 152: False, 153: False, 154: False, 155: False, 156: False, 157: False, 158: False, 159: False, 160: False, 161: False, 162: False, 163: False, 164: False, 165: False, 166: False, 167: False, 168: False, 169: False, 170: False, 171: False, 172: False, 173: False, 174: False, 175: False, 176: False, 177: False, 178: False, 179: False, 180: False, 181: False, 182: False, 183: False, 184: False, 185: False, 186: False, 187: False, 188: False, 189: False, 190: False, 191: False, 192: False, 193: False, 194: False, 195: False, 196: False, 197: False, 198: False, 199: False, 200: True, 201: True, 202: True, 203: True, 204: True, 205: True, 206: True, 207: True, 208: True, 209: True, 210: True, 211: False, 212: False, 213: False, 214: False, 215: False, 216: False, 217: False, 218: False, 219: False, 220: False, 221: False, 222: False, 223: False, 224: False, 225: False, 226: False, 227: False, 228: False, 229: False, 230: False, 231: False, 232: False, 233: False, 234: False, 235: False, 236: False, 237: False, 238: False, 239: False, 240: False, 241: False, 242: False, 243: False, 244: False, 245: False, 246: False, 247: False, 248: False, 249: False, 250: False, 251: False, 252: False, 253: False, 254: False, 255: False, 256: False, 257: False, 258: False, 259: False, 260: False, 261: False, 262: False, 263: False, 264: False, 265: False, 266: False, 267: False, 268: False, 269: False, 270: False, 271: False, 272: False, 273: False, 274: False, 275: False, 276: False, 277: False, 278: False, 279: False, 280: False, 281: False, 282: False, 283: False, 284: False, 285: False, 286: False, 287: False, 288: False, 289: False, 290: False, 291: False, 292: False, 293: False, 294: False, 295: False, 296: False, 297: False, 298: False, 299: False, 300: True, 301: True, 302: True, 303: True, 304: True, 305: True, 306: True, 307: True, 308: True, 309: True, 310: True, 311: True, 312: True, 313: True, 314: True, 315: True, 316: False, 317: False, 318: False, 319: False, 320: False, 321: False, 322: False, 323: False, 324: False, 325: False, 326: False, 327: False, 328: False, 329: False, 330: False, 331: False, 332: False, 333: False, 334: False, 335: False, 336: False, 337: False, 338: False, 339: False, 340: False, 341: False, 342: False, 343: False, 344: False, 345: False, 346: False, 347: False, 348: False, 349: False, 350: False, 351: False, 352: False, 353: False, 354: False, 355: False, 356: False, 357: False, 358: False, 359: False, 360: False, 361: False, 362: False, 363: False, 364: False, 365: False, 366: False, 367: False, 368: False, 369: False, 370: False, 371: False, 372: False, 373: False, 374: False, 375: False, 376: False, 377: False, 378: False, 379: False, 380: False, 381: False, 382: False, 383: False, 384: False, 385: False, 386: False, 387: False, 388: False, 389: False, 390: False, 391: False, 392: False, 393: False, 394: False, 395: False, 396: False, 397: False, 398: False, 399: False, 400: True, 401: True, 402: True, 403: True, 404: True, 405: True, 406: True, 407: True, 408: True, 409: True, 410: True, 411: True, 412: True, 413: True, 414: True, 415: True, 416: True, 417: True, 418: True, 419: True, 420: True, 421: False, 422: False, 423: False, 424: False, 425: False, 426: False, 427: False, 428: False, 429: False, 430: False, 431: False, 432: False, 433: False, 434: False, 435: False, 436: False, 437: False, 438: False, 439: False, 440: False, 441: False, 442: False, 443: False, 444: False, 445: False, 446: False, 447: False, 448: False, 449: False, 450: False, 451: False, 452: False, 453: False, 454: False, 455: False, 456: False, 457: False, 458: False, 459: False, 460: False, 461: False, 462: False, 463: False, 464: False, 465: False, 466: False, 467: False, 468: False, 469: False, 470: False, 471: False, 472: False, 473: False, 474: False}\nprint (valid[n])"], "anno_status": [false], "diff_content": " n = int(input().strip())\n valid = { 0: True }\n for i in range(1, n+1):\n valid[i] = any(valid.get(i-j, False) for j in range(100, 106))\n-print (valid[n])\n+print (1 if valid[i] else 0)\n", "FL_content": " n = int(input().strip())\n valid = { 0: True }\n for i in range(1, n+1):\n valid[i] = any(valid.get(i-j, False) for j in range(100, 106))\n-print (valid[n])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u333731247", "problem_id": "p02843", "submission1_id": "s759836275", "submission2_id": "s298902635", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X=int(input())\n\nh_num=int(X/100)\nx_s=int(X%100)\n\nans=int(x_s/5)+1\n\nif ans<=h_num:\n print(1)\nelse:\n print(0)", "code2": "X=int(input())\n\nh_num=int(X/100)\nx_s=int(X%100)\n\nans=int(x_s/5)+1\n\nif X%105==0:\n print(1)\nelif ans<=h_num:\n print(1)\nelse:\n print(0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575253751", "date2": "1575253945", "bleu_score": "0.7992686407266096", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 25, "total_score": 26, "input": "420\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["X=int(input()) # (0): X=420\n\nh_num=int(X/100) # (1): h_num=4\nx_s=int(X%100) # (2): x_s=20\n\nans=int(x_s/5)+1 # (3): ans=5\n\nif ans<=h_num: # (4): NO CHANGE\n print(1)\nelse:\n print(0)"], "anno_status": [true], "diff_content": " X=int(input())\n \n h_num=int(X/100)\n x_s=int(X%100)\n \n ans=int(x_s/5)+1\n \n-if ans<=h_num:\n+if X%105==0:\n+ print(1)\n+elif ans<=h_num:\n print(1)\n else:\n print(0)\n", "FL_content": " X=int(input())\n \n h_num=int(X/100)\n x_s=int(X%100)\n \n ans=int(x_s/5)+1\n \n-if ans<=h_num:\n print(1)\n else:\n print(0)\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u785578220", "problem_id": "p02843", "submission1_id": "s389383945", "submission2_id": "s080235693", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x = input()\nx = '000'+x\nz = x[:-2]\ny = x[-2:]\ns = 0\nz = int(z)\ny = int(y)\nL = []\nfor i in range(1,15):\n s +=i\n if s>=y and z>=i:\n print(1)\n exit()\nif z>=14:\n print(1)\n exit()\nprint(0)", "code2": "x = input()\nx = '000'+x\nz = x[:-2]\ny = x[-2:]\ns = 0\nz = int(z)\ny = int(y)\nL = []\nfor i in range(1,21):\n s +=5\n if s>=y and z>=i:\n print(1)\n exit()\nif z>=20:\n print(1)\n exit()\nprint(0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589414510", "date2": "1589414693", "bleu_score": "0.9563169035602996", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 23, "total_score": 26, "input": "420\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["x = input() # (0): x=420\nx = '000'+x # (1): x=000420\nz = x[:-2] # (2): z=0004\ny = x[-2:] # (3): y=20\ns = 0 # (4): s=0\nz = int(z) # (5): z=4\ny = int(y) # (6): y=20\nL = [] # (7): L=[]\nfor i in range(1,15): # (8): i=1 (11): i=2 ... (50): NO CHANGE\n s +=i # (9): s=1 (12): s=3 ... (48): s=105\n if s>=y and z>=i: # (10): NO CHANGE (13): NO CHANGE ... (49): NO CHANGE\n print(1)\n exit()\nif z>=14: # (51): NO CHANGE\n print(1)\n exit()\nprint(0)"], "anno_status": [true], "diff_content": " x = input()\n x = '000'+x\n z = x[:-2]\n y = x[-2:]\n s = 0\n z = int(z)\n y = int(y)\n L = []\n-for i in range(1,15):\n- s +=i\n+for i in range(1,21):\n+ s +=5\n if s>=y and z>=i:\n print(1)\n exit()\n-if z>=14:\n+if z>=20:\n print(1)\n exit()\n print(0)\n", "FL_content": " x = input()\n x = '000'+x\n z = x[:-2]\n y = x[-2:]\n s = 0\n z = int(z)\n y = int(y)\n L = []\n-for i in range(1,15):\n- s +=i\n if s>=y and z>=i:\n print(1)\n exit()\n-if z>=14:\n print(1)\n exit()\n print(0)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 17 }, { "user_id": "u760961723", "problem_id": "p02843", "submission1_id": "s530765036", "submission2_id": "s446300266", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X = int(input())\nif X >2000:\n print(\"1\")\nelse:\n for i in range(1,20,1):\n if not (X in range(100*i,105*i +1)) == False:\n print(\"1\")\n flag = True\n break\n else:\n print(\"0\")", "code2": "X = int(input())\nif X >2000:\n print(\"1\")\nelse:\n flag = False\n for i in range(1,20,1):\n if not (X in range(100*i,105*i +1)) == False:\n print(\"1\")\n flag = True\n break\n if flag ==False:\n print(\"0\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585697321", "date2": "1585697649", "bleu_score": "0.8756671814179192", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 26, "input": "173\n", "actual_output": "0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n", "expected_output": "0\n\n", "anno_code": ["X = int(input()) # (0): X=173\nif X >2000: # (1): NO CHANGE\n print(\"1\")\nelse:\n for i in range(1,20,1): # (2): i=1 (5): i=2 ... (56): i=19\n if not (X in range(100*i,105*i +1)) == False: # (3): NO CHANGE (6): NO CHANGE ... (57): NO CHANGE\n print(\"1\")\n flag = True\n break\n else:\n print(\"0\") # (4): NO CHANGE (7): NO CHANGE ... (58): NO CHANGE\n"], "anno_status": [true], "diff_content": " X = int(input())\n if X >2000:\n print(\"1\")\n else:\n+ flag = False\n for i in range(1,20,1):\n if not (X in range(100*i,105*i +1)) == False:\n print(\"1\")\n flag = True\n break\n- else:\n- print(\"0\")\n+ if flag ==False:\n+ print(\"0\")\n", "FL_content": " X = int(input())\n if X >2000:\n print(\"1\")\n else:\n for i in range(1,20,1):\n if not (X in range(100*i,105*i +1)) == False:\n print(\"1\")\n flag = True\n break\n- else:\n- print(\"0\")\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 11 }, { "user_id": "u024245528", "problem_id": "p02843", "submission1_id": "s238522810", "submission2_id": "s580569756", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import permutations, combinations,combinations_with_replacement,product\n\nX =int(input())\n\ns =str(X/100)\n\ns_list =s.split('.')\n\nA =[0,1,2,3,4,5]\n\nfor h in range(1,int(s_list[0])+1):\n for i in combinations_with_replacement(A,h):\n if sum(i) == int(s_list[1]):\n print(i)\n \n \n\nprint(\"0\")\n", "code2": "from itertools import permutations, combinations,combinations_with_replacement,product\n\nX =int(input())\n\ns =str(X/100)\n\ns_list =s.split('.')\n\nA =[0,1,2,3,4,5]\n\nfor h in range(1,int(s_list[0])+1):\n for i in combinations_with_replacement(A,h):\n if sum(i) == int(s_list[1]):\n \n print(\"1\")\n exit()\n\nprint(\"0\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575255278", "date2": "1575255357", "bleu_score": "0.9661334616565417", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1], "code1_test_score": 21, "total_score": 26, "input": "420\n", "actual_output": "(2,)\n(0, 2)\n(1, 1)\n(0, 0, 2)\n(0, 1, 1)\n(0, 0, 0, 2)\n(0, 0, 1, 1)\n0\n", "expected_output": "1\n\n", "anno_code": ["from itertools import permutations, combinations,combinations_with_replacement,product\n\nX =int(input()) # (0): X=420\n\ns =str(X/100) # (1): s=4.2\n\ns_list =s.split('.') # (2): s_list=['4', '2']\n\nA =[0,1,2,3,4,5] # (3): A=[0, 1, 2, 3, 4, 5]\n\nfor h in range(1,int(s_list[0])+1): # (4): h=1 (19): h=2 ... (437): NO CHANGE\n for i in combinations_with_replacement(A,h): # (5): i=(0,) (7): i=(1,) ... (436): NO CHANGE\n if sum(i) == int(s_list[1]): # (6): NO CHANGE (8): NO CHANGE ... (435): NO CHANGE\n print(i) # (11): NO CHANGE (26): NO CHANGE ... (197): NO CHANGE\n \n \n\nprint(\"0\")\n"], "anno_status": [true], "diff_content": " from itertools import permutations, combinations,combinations_with_replacement,product\n \n X =int(input())\n \n s =str(X/100)\n \n s_list =s.split('.')\n \n A =[0,1,2,3,4,5]\n \n for h in range(1,int(s_list[0])+1):\n for i in combinations_with_replacement(A,h):\n if sum(i) == int(s_list[1]):\n- print(i)\n- \n \n+ print(\"1\")\n+ exit()\n \n print(\"0\")\n \n", "FL_content": " from itertools import permutations, combinations,combinations_with_replacement,product\n \n X =int(input())\n \n s =str(X/100)\n \n s_list =s.split('.')\n \n A =[0,1,2,3,4,5]\n \n for h in range(1,int(s_list[0])+1):\n for i in combinations_with_replacement(A,h):\n if sum(i) == int(s_list[1]):\n- print(i)\n- \n \n \n print(\"0\")\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 19 }, { "user_id": "u740284863", "problem_id": "p02843", "submission1_id": "s822548585", "submission2_id": "s380782817", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import itertools\nn = input()\nif len(n) <= 2:\n print(0)\n exit()\nn = int(str(n)[0:3])\n\nk = int(str(n)[0])\nl = int(str(n)[1:3])\n\nif l < 5*k:\n print(1)\nelse:\n print(0)\n", "code2": "import itertools\nn = input()\nif len(n) <= 2:\n print(0)\n exit()\n\n\nk = int(n[:len(n)-2])\nl = int(n[len(n)-2:])\n\nif l <= 5*k:\n print(1)\nelse:\n print(0)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575252928", "date2": "1575253302", "bleu_score": "0.7758834040567911", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 25, "total_score": 26, "input": "420\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["import itertools\nn = input() # (0): n=420\nif len(n) <= 2: # (1): NO CHANGE\n print(0)\n exit()\nn = int(str(n)[0:3]) # (2): n=420\n\nk = int(str(n)[0]) # (3): k=4\nl = int(str(n)[1:3]) # (4): l=20\n\nif l < 5*k: # (5): NO CHANGE\n print(1)\nelse:\n print(0)\n"], "anno_status": [true], "diff_content": " import itertools\n n = input()\n if len(n) <= 2:\n print(0)\n exit()\n-n = int(str(n)[0:3])\n \n-k = int(str(n)[0])\n-l = int(str(n)[1:3])\n \n-if l < 5*k:\n+k = int(n[:len(n)-2])\n+l = int(n[len(n)-2:])\n+\n+if l <= 5*k:\n print(1)\n else:\n print(0)\n \n", "FL_content": " import itertools\n n = input()\n if len(n) <= 2:\n print(0)\n exit()\n-n = int(str(n)[0:3])\n \n-k = int(str(n)[0])\n-l = int(str(n)[1:3])\n \n-if l < 5*k:\n print(1)\n else:\n print(0)\n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 15 }, { "user_id": "u641446860", "problem_id": "p02843", "submission1_id": "s903700700", "submission2_id": "s238201608", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X = int(input())\na = [100, 101, 102, 103, 104, 105]\ndp = [[False]*100010 for _ in range(10)]\ndp[0][0] = True\nfor i in range(6):\n for j in range(100001):\n dp[i+1][j] |= dp[i][j]\n if j >= a[i]:\n dp[i+1][j] |= dp[i][j-a[i]]\n\nif dp[6][X]:\n print(1)\nelse:\n print(0)", "code2": "X = int(input())\na = [100, 101, 102, 103, 104, 105]\ndp = [[False]*100010 for _ in range(10)]\ndp[0][0] = True\n\nfor j in range(X+1):\n for i in range(6):\n dp[i+1][j] |= dp[i][j]\n if j >= a[i]:\n dp[i+1][j] |= dp[i][j-a[i]]\n dp[i+1][j] |= dp[i+1][j-a[i]]\nif dp[6][X]:\n print(1)\nelse:\n print(0)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1588025576", "date2": "1588039327", "bleu_score": "0.8573583600742151", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 23, "total_score": 26, "input": "622\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " X = int(input())\n a = [100, 101, 102, 103, 104, 105]\n dp = [[False]*100010 for _ in range(10)]\n dp[0][0] = True\n-for i in range(6):\n- for j in range(100001):\n+\n+for j in range(X+1):\n+ for i in range(6):\n dp[i+1][j] |= dp[i][j]\n if j >= a[i]:\n dp[i+1][j] |= dp[i][j-a[i]]\n-\n+ dp[i+1][j] |= dp[i+1][j-a[i]]\n if dp[6][X]:\n print(1)\n else:\n print(0)\n", "FL_content": " X = int(input())\n a = [100, 101, 102, 103, 104, 105]\n dp = [[False]*100010 for _ in range(10)]\n dp[0][0] = True\n-for i in range(6):\n- for j in range(100001):\n dp[i+1][j] |= dp[i][j]\n if j >= a[i]:\n dp[i+1][j] |= dp[i][j-a[i]]\n-\n if dp[6][X]:\n print(1)\n else:\n print(0)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 14 }, { "user_id": "u925814846", "problem_id": "p02843", "submission1_id": "s564408235", "submission2_id": "s135099771", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nleft = n\nn = n%100\npay = 0\nchance = 0\nfor i in range(5, 0,-1):\n\tpay+=n\n\tchance+=(n%i)\n\tn=n/i\n\nif pay>= 1\n\t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n\n\tdef query(self,a,b):\n\t\treturn self.query_(a,b,1,0,self.datSize)\n\n\tdef query_(self,a,b,i,l,r):\n\t\t\n\t\tret = self.UNDEFINED_VAL\n\n\t\ta += self.datSize\n\t\tb += self.datSize\n\t\twhile a < b:\n\t\t\tif b & 1:\n\t\t\t\tb -= 1\n\t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n\n\t\t\tif a & 1:\n\t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n\t\t\t\ta += 1\n\n\t\t\ta >>= 1; b >>= 1\n\n\t\treturn ret\n\n\tdef printTree(self):\n\t\tprint(self.datTree)\n\n\ndef LongestSeaquence(A,K):\n\tN = len(A)\n\tlis = 0\n\n\t\n\tMAX_A = max(A)\n\ttree = SegTree(MAX_A+1,max,0,-1e18)\n\t\n\n\tfor n in range(N):\n\t\tx = A[n]\n\t\tl = max(1,x-K)\n\t\tr = min(MAX_A,x+K)\n\t\ttree.update( x, tree.query(l,r+1)+1 )\n\n\t\n\tlis = tree.query(1,MAX_A)\n\n\treturn lis\n\ndef main():\n\tN,K = map(int,input().split())\n\tA = [ int(input()) for _ in range(N)]\n\n\tprint(LongestSeaquence(A,K))\n\n\n\nif __name__ == \"__main__\":\n\tmain()", "code2": "class SegTree:\n\t\n\tdef __init__(self,size,func,init_val,undef):\n\t\tself.specSize = size\n\t\tself.datSize = 1\n\t\tself.compareFunc = func\t\t\n\t\tself.INIT_VAL = init_val\t\n\t\tself.UNDEFINED_VAL = undef\t\n\t\t\n\t\tself.datSize = 2**size.bit_length()\n\n\t\t\n\t\t\n\t\tself.datTree = [self.INIT_VAL for _ in range(2*self.datSize+1)]\n\n\tdef update(self, i, val ):\n\t\t\n\t\t\n\t\t\n\t\ti += self.datSize\n\t\tself.datTree[i] = val\n\t\twhile 1 < i:\n\t\t\ti >>= 1\n\t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n\n\tdef query(self,a,b):\n\t\treturn self.query_(a,b,0,0,self.datSize)\n\n\tdef query_(self,a,b,i,l,r):\n\t\t\n\t\tret = self.UNDEFINED_VAL\n\n\t\ta += self.datSize\n\t\tb += self.datSize\n\t\twhile a < b:\n\t\t\tif b & 1:\n\t\t\t\tb -= 1\n\t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n\n\t\t\tif a & 1:\n\t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n\t\t\t\ta += 1\n\n\t\t\ta >>= 1; b >>= 1\n\n\t\treturn ret\n\n\tdef printTree(self):\n\t\tprint(self.datTree)\n\n\ndef LongestSeaquence(A,K):\n\tN = len(A)\n\tlis = 0\n\n\t\n\tMAX_A = max(A)\n\ttree = SegTree(MAX_A+1,max,0,-1e18)\n\t\n\n\tfor n in range(N):\n\t\tx = A[n]\n\t\tl = max(0,x-K)\n\t\tr = min(MAX_A,x+K)\n\t\ttmp = tree.query(l,r+1)+1\n\t\ttree.update( x, tmp )\n\t\tlis = max(lis, tmp)\n\n\treturn lis\n\ndef main():\n\tN,K = map(int,input().split())\n\tA = [ int(input()) for _ in range(N)]\n\n\tprint(LongestSeaquence(A,K))\n\n\n\nif __name__ == \"__main__\":\n\tmain()", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601183376", "date2": "1601183918", "bleu_score": "0.9757652811571731", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 81, "total_score": 101, "input": "10 3\n0\n1\n4\n3\n6\n6\n9\n7\n4\n4\n", "actual_output": "9\n", "expected_output": "10\n\n", "anno_code": ["class SegTree: # (0): SegTree=\n\t\n\tdef __init__(self,size,func,init_val,undef):\n\t\tself.specSize = size\n\t\tself.datSize = 1\n\t\tself.compareFunc = func\t\t\n\t\tself.INIT_VAL = init_val\t\n\t\tself.UNDEFINED_VAL = undef\t\n\t\t\n\t\tself.datSize = 2**size.bit_length()\n\n\t\t\n\t\t\n\t\tself.datTree = [self.INIT_VAL for _ in range(2*self.datSize+1)]\n\n\tdef update(self, i, val ):\n\t\t\n\t\t\n\t\t\n\t\ti += self.datSize\n\t\tself.datTree[i] = val\n\t\twhile 1 < i:\n\t\t\ti >>= 1\n\t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n\n\tdef query(self,a,b):\n\t\treturn self.query_(a,b,1,0,self.datSize)\n\n\tdef query_(self,a,b,i,l,r):\n\t\t\n\t\tret = self.UNDEFINED_VAL\n\n\t\ta += self.datSize\n\t\tb += self.datSize\n\t\twhile a < b:\n\t\t\tif b & 1:\n\t\t\t\tb -= 1\n\t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n\n\t\t\tif a & 1:\n\t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n\t\t\t\ta += 1\n\n\t\t\ta >>= 1; b >>= 1\n\n\t\treturn ret\n\n\tdef printTree(self):\n\t\tprint(self.datTree)\n\n\ndef LongestSeaquence(A,K): # (1): LongestSeaquence=\n\tN = len(A)\n\tlis = 0\n\n\t\n\tMAX_A = max(A)\n\ttree = SegTree(MAX_A+1,max,0,-1e18)\n\t\n\n\tfor n in range(N):\n\t\tx = A[n]\n\t\tl = max(1,x-K)\n\t\tr = min(MAX_A,x+K)\n\t\ttree.update( x, tree.query(l,r+1)+1 )\n\n\t\n\tlis = tree.query(1,MAX_A)\n\n\treturn lis\n\ndef main(): # (2): main=\n\tN,K = map(int,input().split())\n\tA = [ int(input()) for _ in range(N)]\n\n\tprint(LongestSeaquence(A,K))\n\n\n\nif __name__ == \"__main__\":\n\tmain()"], "anno_status": [false], "diff_content": " class SegTree:\n \t\n \tdef __init__(self,size,func,init_val,undef):\n \t\tself.specSize = size\n \t\tself.datSize = 1\n \t\tself.compareFunc = func\t\t\n \t\tself.INIT_VAL = init_val\t\n \t\tself.UNDEFINED_VAL = undef\t\n \t\t\n \t\tself.datSize = 2**size.bit_length()\n \n \t\t\n \t\t\n \t\tself.datTree = [self.INIT_VAL for _ in range(2*self.datSize+1)]\n \n \tdef update(self, i, val ):\n \t\t\n \t\t\n \t\t\n \t\ti += self.datSize\n \t\tself.datTree[i] = val\n \t\twhile 1 < i:\n \t\t\ti >>= 1\n \t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n \n \tdef query(self,a,b):\n-\t\treturn self.query_(a,b,1,0,self.datSize)\n+\t\treturn self.query_(a,b,0,0,self.datSize)\n \n \tdef query_(self,a,b,i,l,r):\n \t\t\n \t\tret = self.UNDEFINED_VAL\n \n \t\ta += self.datSize\n \t\tb += self.datSize\n \t\twhile a < b:\n \t\t\tif b & 1:\n \t\t\t\tb -= 1\n \t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n \n \t\t\tif a & 1:\n \t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n \t\t\t\ta += 1\n \n \t\t\ta >>= 1; b >>= 1\n \n \t\treturn ret\n \n \tdef printTree(self):\n \t\tprint(self.datTree)\n \n \n def LongestSeaquence(A,K):\n \tN = len(A)\n \tlis = 0\n \n \t\n \tMAX_A = max(A)\n \ttree = SegTree(MAX_A+1,max,0,-1e18)\n \t\n \n \tfor n in range(N):\n \t\tx = A[n]\n-\t\tl = max(1,x-K)\n+\t\tl = max(0,x-K)\n \t\tr = min(MAX_A,x+K)\n-\t\ttree.update( x, tree.query(l,r+1)+1 )\n-\n-\t\n-\tlis = tree.query(1,MAX_A)\n+\t\ttmp = tree.query(l,r+1)+1\n+\t\ttree.update( x, tmp )\n+\t\tlis = max(lis, tmp)\n \n \treturn lis\n \n def main():\n \tN,K = map(int,input().split())\n \tA = [ int(input()) for _ in range(N)]\n \n \tprint(LongestSeaquence(A,K))\n \n \n \n if __name__ == \"__main__\":\n \tmain()\n", "FL_content": " class SegTree:\n \t\n \tdef __init__(self,size,func,init_val,undef):\n \t\tself.specSize = size\n \t\tself.datSize = 1\n \t\tself.compareFunc = func\t\t\n \t\tself.INIT_VAL = init_val\t\n \t\tself.UNDEFINED_VAL = undef\t\n \t\t\n \t\tself.datSize = 2**size.bit_length()\n \n \t\t\n \t\t\n \t\tself.datTree = [self.INIT_VAL for _ in range(2*self.datSize+1)]\n \n \tdef update(self, i, val ):\n \t\t\n \t\t\n \t\t\n \t\ti += self.datSize\n \t\tself.datTree[i] = val\n \t\twhile 1 < i:\n \t\t\ti >>= 1\n \t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n \n \tdef query(self,a,b):\n-\t\treturn self.query_(a,b,1,0,self.datSize)\n \n \tdef query_(self,a,b,i,l,r):\n \t\t\n \t\tret = self.UNDEFINED_VAL\n \n \t\ta += self.datSize\n \t\tb += self.datSize\n \t\twhile a < b:\n \t\t\tif b & 1:\n \t\t\t\tb -= 1\n \t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n \n \t\t\tif a & 1:\n \t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n \t\t\t\ta += 1\n \n \t\t\ta >>= 1; b >>= 1\n \n \t\treturn ret\n \n \tdef printTree(self):\n \t\tprint(self.datTree)\n \n \n def LongestSeaquence(A,K):\n \tN = len(A)\n \tlis = 0\n \n \t\n \tMAX_A = max(A)\n \ttree = SegTree(MAX_A+1,max,0,-1e18)\n \t\n \n \tfor n in range(N):\n \t\tx = A[n]\n-\t\tl = max(1,x-K)\n \t\tr = min(MAX_A,x+K)\n-\t\ttree.update( x, tree.query(l,r+1)+1 )\n-\n-\t\n-\tlis = tree.query(1,MAX_A)\n \n \treturn lis\n \n def main():\n \tN,K = map(int,input().split())\n \tA = [ int(input()) for _ in range(N)]\n \n \tprint(LongestSeaquence(A,K))\n \n \n \n if __name__ == \"__main__\":\n \tmain()\n", "added_lines": 5, "removed_lines": 6, "code1_lines": 81 }, { "user_id": "u653041271", "problem_id": "p02537", "submission1_id": "s090588966", "submission2_id": "s385750415", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys, bisect, math, itertools, string, queue, copy\n\n\n\n\n\n\n\nmod = 10**9+7\ndef inp(): return int(input())\ndef inpm(): return map(int,input().split())\ndef inpl(): return list(map(int, input().split()))\ndef inpls(): return list(input().split())\ndef inplm(n): return list(int(input()) for _ in range(n))\ndef inplL(n): return [list(input()) for _ in range(n)]\ndef inplT(n): return [tuple(input()) for _ in range(n)]\ndef inpll(n): return [list(map(int, input().split())) for _ in range(n)]\ndef inplt(n): return [tuple(map(int, input().split())) for _ in range(n)]\ndef inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])\n\n\ndef segfunc(x, y):\n return max(x,y)\n\n\n\nide_ele = 0\n\n\nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n\n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n\n def query(self, l, r):\n \n res = self.ide_ele\n\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\nn,k = inpm()\nA = inplm(n)\n\nseg = SegTree([0]*300001, segfunc, ide_ele)\n\nfor a in A:\n seg.update(a-1,seg.query(max(0,a-k-1),min(300001,a+k)) + 1)\n\nprint(seg.query(0,n))", "code2": "import sys, bisect, math, itertools, string, queue, copy\n\n\n\n\n\n\n\nmod = 10**9+7\ndef inp(): return int(input())\ndef inpm(): return map(int,input().split())\ndef inpl(): return list(map(int, input().split()))\ndef inpls(): return list(input().split())\ndef inplm(n): return list(int(input()) for _ in range(n))\ndef inplL(n): return [list(input()) for _ in range(n)]\ndef inplT(n): return [tuple(input()) for _ in range(n)]\ndef inpll(n): return [list(map(int, input().split())) for _ in range(n)]\ndef inplt(n): return [tuple(map(int, input().split())) for _ in range(n)]\ndef inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])\n\n\ndef segfunc(x, y):\n return max(x,y)\n\n\n\nide_ele = 0\n\n\nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n\n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n\n def query(self, l, r):\n \n res = self.ide_ele\n\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\nn,k = inpm()\nA = inplm(n)\n\nseg = SegTree([0]*300001, segfunc, ide_ele)\n\nfor a in A:\n seg.update(a,seg.query(max(0,a-k),min(300001,a+k+1)) + 1)\n\nprint(seg.query(0,300001))", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601444628", "date2": "1601445502", "bleu_score": "0.9933698813974005", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 81, "total_score": 101, "input": "10 3\n0\n1\n4\n0\n6\n6\n9\n7\n4\n4\n", "actual_output": "8\n", "expected_output": "9\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import sys, bisect, math, itertools, string, queue, copy\n \n \n \n \n \n \n \n mod = 10**9+7\n def inp(): return int(input())\n def inpm(): return map(int,input().split())\n def inpl(): return list(map(int, input().split()))\n def inpls(): return list(input().split())\n def inplm(n): return list(int(input()) for _ in range(n))\n def inplL(n): return [list(input()) for _ in range(n)]\n def inplT(n): return [tuple(input()) for _ in range(n)]\n def inpll(n): return [list(map(int, input().split())) for _ in range(n)]\n def inplt(n): return [tuple(map(int, input().split())) for _ in range(n)]\n def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])\n \n \n def segfunc(x, y):\n return max(x,y)\n \n \n \n ide_ele = 0\n \n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n n,k = inpm()\n A = inplm(n)\n \n seg = SegTree([0]*300001, segfunc, ide_ele)\n \n for a in A:\n- seg.update(a-1,seg.query(max(0,a-k-1),min(300001,a+k)) + 1)\n+ seg.update(a,seg.query(max(0,a-k),min(300001,a+k+1)) + 1)\n \n-print(seg.query(0,n))\n+print(seg.query(0,300001))\n", "FL_content": " import sys, bisect, math, itertools, string, queue, copy\n \n \n \n \n \n \n \n mod = 10**9+7\n def inp(): return int(input())\n def inpm(): return map(int,input().split())\n def inpl(): return list(map(int, input().split()))\n def inpls(): return list(input().split())\n def inplm(n): return list(int(input()) for _ in range(n))\n def inplL(n): return [list(input()) for _ in range(n)]\n def inplT(n): return [tuple(input()) for _ in range(n)]\n def inpll(n): return [list(map(int, input().split())) for _ in range(n)]\n def inplt(n): return [tuple(map(int, input().split())) for _ in range(n)]\n def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])\n \n \n def segfunc(x, y):\n return max(x,y)\n \n \n \n ide_ele = 0\n \n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n n,k = inpm()\n A = inplm(n)\n \n seg = SegTree([0]*300001, segfunc, ide_ele)\n \n for a in A:\n- seg.update(a-1,seg.query(max(0,a-k-1),min(300001,a+k)) + 1)\n \n-print(seg.query(0,n))\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 78 }, { "user_id": "u627600101", "problem_id": "p02537", "submission1_id": "s029332411", "submission2_id": "s023286113", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\n\n\n\n\ndef segfunc(x, y):\n return max(x, y)\n\n \n\nide_ele = -1\n\n \nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\n\n\n\nN, K = map(int, input().split())\ntree = [0 for _ in range(400000)]\ntree = SegTree(tree, segfunc, ide_ele)\nfor k in range(N):\n A = int(input())\n A -= 1\n n = tree.query(max(0, A-K), min(400000, A+K+1))\n tree.update(A, n+1)\nprint(tree.query(0, 400000))\n\n\n\n\n\n\n", "code2": "\n\n\n\n\n\n\n\n\ndef segfunc(x, y):\n return max(x, y)\n\n \n\nide_ele = -1\n\n \nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\n\n\n\nN, K = map(int, input().split())\ntree = [0 for _ in range(400000)]\ntree = SegTree(tree, segfunc, ide_ele)\nfor k in range(N):\n A = int(input())\n n = tree.query(max(0, A-K), min(400000, A+K+1))\n tree.update(A, n+1)\nprint(tree.query(0, 400000))\n\n\n\n\n\n\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601171508", "date2": "1601171868", "bleu_score": "0.9934853651353326", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 81, "total_score": 101, "input": "10 3\n1\n5\n2\n0\n1\n6\n9\n8\n4\n2\n", "actual_output": "5\n", "expected_output": "6\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n \n \n \n \n \n \n \n \n def segfunc(x, y):\n return max(x, y)\n \n \n \n ide_ele = -1\n \n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n \n \n \n N, K = map(int, input().split())\n tree = [0 for _ in range(400000)]\n tree = SegTree(tree, segfunc, ide_ele)\n for k in range(N):\n A = int(input())\n- A -= 1\n n = tree.query(max(0, A-K), min(400000, A+K+1))\n tree.update(A, n+1)\n print(tree.query(0, 400000))\n \n \n \n \n \n \n \n", "FL_content": " \n \n \n \n \n \n \n \n \n def segfunc(x, y):\n return max(x, y)\n \n \n \n ide_ele = -1\n \n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n \n \n \n N, K = map(int, input().split())\n tree = [0 for _ in range(400000)]\n tree = SegTree(tree, segfunc, ide_ele)\n for k in range(N):\n A = int(input())\n- A -= 1\n n = tree.query(max(0, A-K), min(400000, A+K+1))\n tree.update(A, n+1)\n print(tree.query(0, 400000))\n \n \n \n \n \n \n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 76 }, { "user_id": "u528045862", "problem_id": "p02537", "submission1_id": "s929575671", "submission2_id": "s371162922", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef segfunc(x, y):\n return max(x, y)\n\n\n\nide_ele = 0\n\n\n\nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n\n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n\n def query(self, l, r):\n \n res = self.ide_ele\n\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\nn, k = map(int, input().split())\nst = SegTree([0] * 300001, segfunc, ide_ele)\nfor _ in range(n):\n a = int(input())\n v = st.query(a - 3, a + 4) + 1\n st.update(a, v)\nprint(st.query(0, 300001))\n", "code2": "\ndef segfunc(x, y):\n return max(x, y)\n\n\n\nide_ele = 0\n\n\n\nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n\n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n\n def query(self, l, r):\n \n res = self.ide_ele\n\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\nn, k = map(int, input().split())\nst = SegTree([0] * 300001, segfunc, ide_ele)\nfor _ in range(n):\n a = int(input())\n v = st.query(max(0, a - k), min(300001, a + k + 1)) + 1\n st.update(a, v)\nprint(st.query(0, 300001))\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601169674", "date2": "1601170219", "bleu_score": "0.9765590983063759", "code1_test_status": [1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1], "code1_test_score": 77, "total_score": 101, "input": "10 1\n1\n8\n0\n3\n8\n11\n9\n7\n6\n1\n", "actual_output": "6\n", "expected_output": "4\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n def segfunc(x, y):\n return max(x, y)\n \n \n \n ide_ele = 0\n \n \n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n n, k = map(int, input().split())\n st = SegTree([0] * 300001, segfunc, ide_ele)\n for _ in range(n):\n a = int(input())\n- v = st.query(a - 3, a + 4) + 1\n+ v = st.query(max(0, a - k), min(300001, a + k + 1)) + 1\n st.update(a, v)\n print(st.query(0, 300001))\n \n", "FL_content": " \n def segfunc(x, y):\n return max(x, y)\n \n \n \n ide_ele = 0\n \n \n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n n, k = map(int, input().split())\n st = SegTree([0] * 300001, segfunc, ide_ele)\n for _ in range(n):\n a = int(input())\n- v = st.query(a - 3, a + 4) + 1\n st.update(a, v)\n print(st.query(0, 300001))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 58 }, { "user_id": "u459798349", "problem_id": "p02537", "submission1_id": "s318530079", "submission2_id": "s311580522", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\ndef segfunc(x, y):\n return max(x,y)\n\n\n\nide_ele = 0\n\n\n\n\nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n\n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n\n def query(self, l, r):\n \n res = self.ide_ele\n\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\n\n\nn,k=map(int,input().split())\nA=[int(input()) for i in range(n)]\n\nT=[0 for i in range(300000+1)]\nT=SegTree(T,segfunc,ide_ele)\n\nfor num in A:\n now=T.query(max(0,num-k),min(num+k+1,n))\n \n T.update(num,now+1)\n\nprint(T.query(0,n+1))\n\n", "code2": "\n\ndef segfunc(x, y):\n return max(x,y)\n\n\n\nide_ele = 0\n\n\n\n\nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n\n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n\n def query(self, l, r):\n \n res = self.ide_ele\n\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\n\n\nn,k=map(int,input().split())\nA=[int(input()) for i in range(n)]\n\nT=[0 for i in range(300000+1)]\nT=SegTree(T,segfunc,ide_ele)\n\nfor num in A:\n now=T.query(max(0,num-k),min(num+k+1,300002))\n \n T.update(num,now+1)\n\nprint(T.query(0,300001))\n\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601176685", "date2": "1601176908", "bleu_score": "0.9896841759230526", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 91, "total_score": 101, "input": "10 3\n0\n5\n4\n3\n8\n11\n9\n7\n6\n2\n", "actual_output": "5\n", "expected_output": "6\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n \n def segfunc(x, y):\n return max(x,y)\n \n \n \n ide_ele = 0\n \n \n \n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n \n \n n,k=map(int,input().split())\n A=[int(input()) for i in range(n)]\n \n T=[0 for i in range(300000+1)]\n T=SegTree(T,segfunc,ide_ele)\n \n for num in A:\n- now=T.query(max(0,num-k),min(num+k+1,n))\n+ now=T.query(max(0,num-k),min(num+k+1,300002))\n \n T.update(num,now+1)\n \n-print(T.query(0,n+1))\n+print(T.query(0,300001))\n \n \n", "FL_content": " \n \n def segfunc(x, y):\n return max(x,y)\n \n \n \n ide_ele = 0\n \n \n \n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n \n \n n,k=map(int,input().split())\n A=[int(input()) for i in range(n)]\n \n T=[0 for i in range(300000+1)]\n T=SegTree(T,segfunc,ide_ele)\n \n for num in A:\n- now=T.query(max(0,num-k),min(num+k+1,n))\n \n T.update(num,now+1)\n \n-print(T.query(0,n+1))\n \n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 68 }, { "user_id": "u476225888", "problem_id": "p02537", "submission1_id": "s860783189", "submission2_id": "s794928131", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys, math\nimport io, os\n\nfrom bisect import bisect_left as bl, bisect_right as br, insort\nfrom heapq import heapify, heappush, heappop\nfrom collections import defaultdict as dd, deque, Counter\n\ndef data(): return sys.stdin.readline().strip()\ndef mdata(): return list(map(int, data().split()))\ndef outl(var): sys.stdout.write('\\n'.join(map(str, var)) + '\\n')\ndef out(var): sys.stdout.write(str(var) + '\\n')\nfrom decimal import Decimal\n\n\nmod = 998244353\nINF=float('inf')\n\n\ndef construct_sum(segtree,a,n,func=max):\n for i in range(n):\n segtree[n + i] = a[i]\n for i in range(n - 1, 0, -1):\n segtree[i] = func(segtree[2 * i], segtree[2 * i + 1])\n\ndef update(pos, x, func=max):\n pos += n-1\n segtree[pos] = x\n while (pos>1):\n pos>>=1\n segtree[pos] = func(segtree[2 * pos], segtree[2 * pos + 1])\n\ndef get(l, r, func=max):\n l += n-1\n r += n-1\n s = 0\n while (l <= r):\n if l & 1:\n s = func(segtree[l],s)\n l+=1\n if (r+1) & 1:\n s = func(segtree[r],s)\n r-=1\n l >>= 1\n r >>= 1\n return s\n\nn,k=mdata()\na=[int(data()) for i in range(n)]\nn=max(a)+1\nsegtree = [0]*(2*n)\nconstruct_sum(segtree,[0]*n,n)\nans=0\nfor i in a:\n a1=get(max(i-k,0),min(i+k,n))+1\n update(i,a1)\n ans=max(ans,a1)\nout(ans)\n\n\n\n\n\n\n", "code2": "import sys, math\nimport io, os\n\nfrom bisect import bisect_left as bl, bisect_right as br, insort\nfrom heapq import heapify, heappush, heappop\nfrom collections import defaultdict as dd, deque, Counter\n\ndef data(): return sys.stdin.readline().strip()\ndef mdata(): return list(map(int, data().split()))\ndef outl(var): sys.stdout.write('\\n'.join(map(str, var)) + '\\n')\ndef out(var): sys.stdout.write(str(var) + '\\n')\nfrom decimal import Decimal\n\n\nmod = 998244353\nINF=float('inf')\n\n\ndef construct_sum(segtree,a,n,func=max):\n for i in range(n):\n segtree[n + i] = a[i]\n for i in range(n - 1, 0, -1):\n segtree[i] = func(segtree[2 * i], segtree[2 * i + 1])\n\ndef update(pos, x, func=max):\n pos += n-1\n segtree[pos] = x\n while (pos>1):\n pos>>=1\n segtree[pos] = func(segtree[2 * pos], segtree[2 * pos + 1])\n\ndef get(l, r, func=max):\n l += n-1\n r += n-1\n s = 0\n while (l <= r):\n if l & 1:\n s = func(segtree[l],s)\n l+=1\n if (r+1) & 1:\n s = func(segtree[r],s)\n r-=1\n l >>= 1\n r >>= 1\n return s\n\nn,k=mdata()\na=[int(data()) for i in range(n)]\nn=max(a)+1\nsegtree = [0]*(2*n)\nconstruct_sum(segtree,[0]*n,n)\nans=0\nfor i in a:\n a1=get(max(i-k+1,1),min(i+k+1,n))+1\n update(i+1,a1)\n ans=max(ans,a1)\nout(ans)\n\n\n\n\n\n\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601230190", "date2": "1601232550", "bleu_score": "0.9907727968664121", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 81, "total_score": 101, "input": "10 3\n0\n1\n3\n0\n5\n9\n9\n7\n4\n4\n", "actual_output": "9\n", "expected_output": "7\n\n", "anno_code": ["import sys, math\nimport io, os\n\nfrom bisect import bisect_left as bl, bisect_right as br, insort\nfrom heapq import heapify, heappush, heappop\nfrom collections import defaultdict as dd, deque, Counter\n\ndef data(): return sys.stdin.readline().strip()\ndef mdata(): return list(map(int, data().split()))\ndef outl(var): sys.stdout.write('\\n'.join(map(str, var)) + '\\n') # (0): outl=\ndef out(var): sys.stdout.write(str(var) + '\\n') # (1): out=, Decimal=\nfrom decimal import Decimal\n\n\nmod = 998244353 # (2): mod=998244353\nINF=float('inf') # (3): INF=inf\n\n\ndef construct_sum(segtree,a,n,func=max): # (4): construct_sum=\n for i in range(n): # (12): i=0 (14): i=1 ... (32): NO CHANGE\n segtree[n + i] = a[i] # (13): NO CHANGE (15): NO CHANGE ... (31): NO CHANGE\n for i in range(n - 1, 0, -1): # (33): NO CHANGE (35): i=8 ... (51): sys=, math=, io=, os=, bl=, br=, insort=, heapify=, heappush=, heappop=, dd=, deque=, Counter=, data=, mdata=, outl=, out=, Decimal=, mod=998244353, INF=inf, construct_sum=, update=, get=, k=3, a=[0, 1, 3, 0, 5, 9, 9, 7, 4, 4]\n segtree[i] = func(segtree[2 * i], segtree[2 * i + 1]) # (34): NO CHANGE (36): NO CHANGE ... (50): NO CHANGE\n\ndef update(pos, x, func=max): # (5): update=\n pos += n-1 # (76): pos=9 (112): pos=10 ... (440): pos=13\n segtree[pos] = x # (77): NO CHANGE (113): NO CHANGE ... (441): NO CHANGE\n while (pos>1): # (78): NO CHANGE (81): NO CHANGE ... (451): sys=, math=, io=, os=, bl=, br=, insort=, heapify=, heappush=, heappop=, dd=, deque=, Counter=, data=, mdata=, outl=, out=, Decimal=, mod=998244353, INF=inf, construct_sum=, update=, get=, n=10, k=3, a=[0, 1, 3, 0, 5, 9, 9, 7, 4, 4], segtree=[0, 9, 7, 9, 7, 2, 9, 4, 7, 6, 2, 0, 3, 9, 4, 0, 7, 0, 6, 0], ans=8, i=4, a1=9\n pos>>=1 # (79): pos=4 (82): pos=2 ... (449): pos=1\n segtree[pos] = func(segtree[2 * pos], segtree[2 * pos + 1]) # (80): NO CHANGE (83): NO CHANGE ... (450): NO CHANGE\n\ndef get(l, r, func=max): # (6): get=\n l += n-1 # (55): l=9 (91): l=9 ... (414): l=10\n r += n-1 # (56): r=12 (92): r=13 ... (415): r=16\n s = 0 # (57): s=0 (93): s=0 ... (416): s=0\n while (l <= r): # (58): NO CHANGE (67): NO CHANGE ... (438): sys=, math=, io=, os=, bl=, br=, insort=, heapify=, heappush=, heappop=, dd=, deque=, Counter=, data=, mdata=, outl=, out=, Decimal=, mod=998244353, INF=inf, construct_sum=, update=, get=, n=10, k=3, a=[0, 1, 3, 0, 5, 9, 9, 7, 4, 4], segtree=[0, 8, 7, 8, 7, 2, 8, 4, 7, 6, 2, 0, 3, 8, 4, 0, 7, 0, 6, 0], ans=8, i=4, a1=9\n if l & 1: # (59): NO CHANGE (68): NO CHANGE ... (432): NO CHANGE\n s = func(segtree[l],s) # (60): NO CHANGE (69): NO CHANGE ... (433): s=8\n l+=1 # (61): l=10 (70): l=6 ... (434): l=4\n if (r+1) & 1: # (62): NO CHANGE (71): NO CHANGE ... (435): NO CHANGE\n s = func(segtree[r],s) # (63): NO CHANGE (106): NO CHANGE ... (420): s=7\n r-=1 # (64): r=11 (107): r=5 ... (421): r=15\n l >>= 1 # (65): l=5 (72): l=3 ... (436): l=2\n r >>= 1 # (66): r=5 (73): r=2 ... (437): r=1\n return s\n\nn,k=mdata() # (7): n=10, k=3\na=[int(data()) for i in range(n)] # (8): a=[0, 1, 3, 0, 5, 9, 9, 7, 4, 4]\nn=max(a)+1 # (9): NO CHANGE\nsegtree = [0]*(2*n) # (10): segtree=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nconstruct_sum(segtree,[0]*n,n) # (11): a=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0], func=\nans=0 # (52): ans=0\nfor i in a: # (53): i=0 (89): i=1 ... (453): NO CHANGE\n a1=get(max(i-k,0),min(i+k,n))+1 # (54): l=0, r=3, func= (90): l=0, r=4, func= ... (413): l=1, r=7, func=\n update(i,a1) # (75): pos=0, x=1, func= (111): pos=1, x=2, func= ... (439): pos=4, x=9, func=\n ans=max(ans,a1) # (88): ans=1 (124): ans=2 ... (452): ans=9\nout(ans) # (454): var=9\n\n\n\n\n\n\n"], "anno_status": [false], "diff_content": " import sys, math\n import io, os\n \n from bisect import bisect_left as bl, bisect_right as br, insort\n from heapq import heapify, heappush, heappop\n from collections import defaultdict as dd, deque, Counter\n \n def data(): return sys.stdin.readline().strip()\n def mdata(): return list(map(int, data().split()))\n def outl(var): sys.stdout.write('\\n'.join(map(str, var)) + '\\n')\n def out(var): sys.stdout.write(str(var) + '\\n')\n from decimal import Decimal\n \n \n mod = 998244353\n INF=float('inf')\n \n \n def construct_sum(segtree,a,n,func=max):\n for i in range(n):\n segtree[n + i] = a[i]\n for i in range(n - 1, 0, -1):\n segtree[i] = func(segtree[2 * i], segtree[2 * i + 1])\n \n def update(pos, x, func=max):\n pos += n-1\n segtree[pos] = x\n while (pos>1):\n pos>>=1\n segtree[pos] = func(segtree[2 * pos], segtree[2 * pos + 1])\n \n def get(l, r, func=max):\n l += n-1\n r += n-1\n s = 0\n while (l <= r):\n if l & 1:\n s = func(segtree[l],s)\n l+=1\n if (r+1) & 1:\n s = func(segtree[r],s)\n r-=1\n l >>= 1\n r >>= 1\n return s\n \n n,k=mdata()\n a=[int(data()) for i in range(n)]\n n=max(a)+1\n segtree = [0]*(2*n)\n construct_sum(segtree,[0]*n,n)\n ans=0\n for i in a:\n- a1=get(max(i-k,0),min(i+k,n))+1\n- update(i,a1)\n+ a1=get(max(i-k+1,1),min(i+k+1,n))+1\n+ update(i+1,a1)\n ans=max(ans,a1)\n out(ans)\n \n \n \n \n \n \n \n", "FL_content": " import sys, math\n import io, os\n \n from bisect import bisect_left as bl, bisect_right as br, insort\n from heapq import heapify, heappush, heappop\n from collections import defaultdict as dd, deque, Counter\n \n def data(): return sys.stdin.readline().strip()\n def mdata(): return list(map(int, data().split()))\n def outl(var): sys.stdout.write('\\n'.join(map(str, var)) + '\\n')\n def out(var): sys.stdout.write(str(var) + '\\n')\n from decimal import Decimal\n \n \n mod = 998244353\n INF=float('inf')\n \n \n def construct_sum(segtree,a,n,func=max):\n for i in range(n):\n segtree[n + i] = a[i]\n for i in range(n - 1, 0, -1):\n segtree[i] = func(segtree[2 * i], segtree[2 * i + 1])\n \n def update(pos, x, func=max):\n pos += n-1\n segtree[pos] = x\n while (pos>1):\n pos>>=1\n segtree[pos] = func(segtree[2 * pos], segtree[2 * pos + 1])\n \n def get(l, r, func=max):\n l += n-1\n r += n-1\n s = 0\n while (l <= r):\n if l & 1:\n s = func(segtree[l],s)\n l+=1\n if (r+1) & 1:\n s = func(segtree[r],s)\n r-=1\n l >>= 1\n r >>= 1\n return s\n \n n,k=mdata()\n a=[int(data()) for i in range(n)]\n n=max(a)+1\n segtree = [0]*(2*n)\n construct_sum(segtree,[0]*n,n)\n ans=0\n for i in a:\n- a1=get(max(i-k,0),min(i+k,n))+1\n- update(i,a1)\n ans=max(ans,a1)\n out(ans)\n \n \n \n \n \n \n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 64 }, { "user_id": "u054514819", "problem_id": "p02537", "submission1_id": "s162336590", "submission2_id": "s177084850", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ndef input(): return sys.stdin.readline().strip()\ndef mapint(): return map(int, input().split())\nsys.setrecursionlimit(10**9)\n\nN, K = mapint()\n\ndef segfunc(x, y):\n return max(x, y)\n\nide_ele = 0\n\nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n\n def update(self, k, x):\n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n\n def query(self, l, r):\n res = self.ide_ele\n\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\nsize = 10**5*3+10\nseg = SegTree([0]*size, segfunc, ide_ele)\nfor _ in range(N):\n a = int(input())\n maxi = seg.query(max(0, a-K-1), min(size, a+K))\n seg.update(a-1, maxi+1)\nprint(seg.query(0, size))", "code2": "import sys\ndef input(): return sys.stdin.readline().strip()\ndef mapint(): return map(int, input().split())\nsys.setrecursionlimit(10**9)\n\nN, K = mapint()\n\ndef segfunc(x, y):\n return max(x, y)\n\nide_ele = 0\n\nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n\n def update(self, k, x):\n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n\n def query(self, l, r):\n res = self.ide_ele\n\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\nsize = 10**5*3+10\nseg = SegTree([0]*size, segfunc, ide_ele)\nfor _ in range(N):\n a = int(input())\n maxi = seg.query(max(0, a-K), min(size, a+K+1))\n seg.update(a, maxi+1)\nprint(seg.query(0, size))", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601171615", "date2": "1601172047", "bleu_score": "0.994527005022855", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 81, "total_score": 101, "input": "10 4\n0\n1\n4\n3\n3\n12\n9\n7\n4\n4\n", "actual_output": "7\n", "expected_output": "8\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import sys\n def input(): return sys.stdin.readline().strip()\n def mapint(): return map(int, input().split())\n sys.setrecursionlimit(10**9)\n \n N, K = mapint()\n \n def segfunc(x, y):\n return max(x, y)\n \n ide_ele = 0\n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n size = 10**5*3+10\n seg = SegTree([0]*size, segfunc, ide_ele)\n for _ in range(N):\n a = int(input())\n- maxi = seg.query(max(0, a-K-1), min(size, a+K))\n- seg.update(a-1, maxi+1)\n+ maxi = seg.query(max(0, a-K), min(size, a+K+1))\n+ seg.update(a, maxi+1)\n print(seg.query(0, size))\n", "FL_content": " import sys\n def input(): return sys.stdin.readline().strip()\n def mapint(): return map(int, input().split())\n sys.setrecursionlimit(10**9)\n \n N, K = mapint()\n \n def segfunc(x, y):\n return max(x, y)\n \n ide_ele = 0\n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n size = 10**5*3+10\n seg = SegTree([0]*size, segfunc, ide_ele)\n for _ in range(N):\n a = int(input())\n- maxi = seg.query(max(0, a-K-1), min(size, a+K))\n- seg.update(a-1, maxi+1)\n print(seg.query(0, size))\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 54 }, { "user_id": "u550061714", "problem_id": "p02537", "submission1_id": "s681878376", "submission2_id": "s050068231", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\n\nclass SegmentTree:\n \n\n def __init__(self, size, f=lambda x, y: max(x, y), default=0):\n self.size = 2 ** (size - 1).bit_length()\n self.default = default\n self.dat = [default] * (self.size * 2)\n self.f = f\n\n def update(self, i, x):\n i += self.size\n self.dat[i] = x\n while i > 0:\n i >>= 1\n self.dat[i] = self.f(self.dat[i * 2], self.dat[i * 2 + 1])\n\n def query(self, l, r):\n l += self.size\n r += self.size\n lres, rres = self.default, self.default\n while l < r:\n if l & 1:\n lres = self.f(lres, self.dat[l])\n l += 1\n\n if r & 1:\n r -= 1\n rres = self.f(self.dat[r], rres)\n l >>= 1\n r >>= 1\n res = self.f(lres, rres)\n return res\n\n\ninput = sys.stdin.buffer.readline\n\nN, K = map(int, input().split())\nMAX = 300010\nB = SegmentTree(MAX)\n\nfor _ in range(N):\n a = int(input())\n m = B.query(max(1, a - K), min(MAX, a + K + 1))\n B.update(a, m + 1)\nprint(B.query(1, MAX))\n", "code2": "import sys\n\n\nclass SegmentTree:\n \n\n def __init__(self, size, f=lambda x, y: max(x, y), default=0):\n self.size = 2 ** (size - 1).bit_length()\n self.default = default\n self.dat = [default] * (self.size * 2)\n self.f = f\n\n def update(self, i, x):\n i += self.size\n self.dat[i] = x\n while i > 0:\n i >>= 1\n self.dat[i] = self.f(self.dat[i * 2], self.dat[i * 2 + 1])\n\n def query(self, l, r):\n l += self.size\n r += self.size\n lres, rres = self.default, self.default\n while l < r:\n if l & 1:\n lres = self.f(lres, self.dat[l])\n l += 1\n\n if r & 1:\n r -= 1\n rres = self.f(self.dat[r], rres)\n l >>= 1\n r >>= 1\n res = self.f(lres, rres)\n return res\n\n\ninput = sys.stdin.buffer.readline\n\nN, K = map(int, input().split())\nMAX = 300010\nB = SegmentTree(MAX)\nfor _ in range(N):\n a = int(input()) + 1\n m = B.query(max(1, a - K), min(MAX, a + K + 1))\n B.update(a, m + 1)\nprint(B.query(1, MAX))\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601170420", "date2": "1601170736", "bleu_score": "0.994353398029145", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 81, "total_score": 101, "input": "10 3\n1\n5\n2\n0\n6\n0\n9\n8\n4\n2\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["import sys\n\n\nclass SegmentTree: # (0): SegmentTree=\n \n\n def __init__(self, size, f=lambda x, y: max(x, y), default=0):\n self.size = 2 ** (size - 1).bit_length() # (5): NO CHANGE\n self.default = default # (6): NO CHANGE\n self.dat = [default] * (self.size * 2) # (7): NO CHANGE\n self.f = f # (8): sys=, SegmentTree=, input=, N=10, K=3, MAX=300010, B=\n\n def update(self, i, x):\n i += self.size # (34): i=524289 (127): i=524293 ... (847): i=524290\n self.dat[i] = x # (35): NO CHANGE (128): NO CHANGE ... (848): NO CHANGE\n while i > 0: # (36): NO CHANGE (39): NO CHANGE ... (909): sys=, SegmentTree=, input=, N=10, K=3, MAX=300010, B=, _=9, a=2, m=3\n i >>= 1 # (37): i=262144 (40): i=131072 ... (907): i=0\n self.dat[i] = self.f(self.dat[i * 2], self.dat[i * 2 + 1]) # (38): NO CHANGE (41): NO CHANGE ... (908): NO CHANGE\n\n def query(self, l, r):\n l += self.size # (12): l=524289 (100): l=524290 ... (912): l=524289\n r += self.size # (13): r=524293 (101): r=524297 ... (913): r=824298\n lres, rres = self.default, self.default # (14): lres=0, rres=0 (102): lres=0, rres=0 ... (914): lres=0, rres=0\n while l < r: # (15): NO CHANGE (24): NO CHANGE ... (1059): NO CHANGE\n if l & 1: # (16): NO CHANGE (25): NO CHANGE ... (1053): NO CHANGE\n lres = self.f(lres, self.dat[l]) # (17): NO CHANGE (26): NO CHANGE ... (1054): NO CHANGE\n l += 1 # (18): l=524290 (27): l=262146 ... (1055): l=6\n\n if r & 1: # (19): NO CHANGE (28): NO CHANGE ... (1056): NO CHANGE\n r -= 1 # (20): r=524292 (106): r=524296 ... (1041): r=24\n rres = self.f(self.dat[r], rres) # (21): NO CHANGE (107): NO CHANGE ... (1042): NO CHANGE\n l >>= 1 # (22): l=262145 (29): l=131073 ... (1057): l=3\n r >>= 1 # (23): r=262146 (30): r=131073 ... (1058): r=3\n res = self.f(lres, rres) # (32): sys=, SegmentTree=, input=, N=10, K=3, MAX=300010, B=, _=0, a=1, m=0 (125): sys=, SegmentTree=, input=, N=10, K=3, MAX=300010, B=, _=1, a=5, m=0 ... (845): sys=, SegmentTree=, input=, N=10, K=3, MAX=300010, B=, _=9, a=2, m=3\n return res\n\n\ninput = sys.stdin.buffer.readline # (1): input=\n\nN, K = map(int, input().split()) # (2): N=10, K=3\nMAX = 300010 # (3): MAX=300010\nB = SegmentTree(MAX) # (4): self=, size=300010, f= at 0x0000014253CB9B40>, default=0\n\nfor _ in range(N): # (9): _=0 (97): _=1 ... (910): NO CHANGE\n a = int(input()) # (10): a=1 (98): a=5 ... (823): a=2\n m = B.query(max(1, a - K), min(MAX, a + K + 1)) # (11): self=, l=1, r=5 (99): self=, l=2, r=9 ... (824): self=, l=1, r=6\n B.update(a, m + 1) # (33): self=, i=1, x=1 (126): self=, i=5, x=1 ... (846): self=, i=2, x=4\nprint(B.query(1, MAX)) # (911): self=, l=1, r=300010\n"], "anno_status": [false], "diff_content": " import sys\n \n \n class SegmentTree:\n \n \n def __init__(self, size, f=lambda x, y: max(x, y), default=0):\n self.size = 2 ** (size - 1).bit_length()\n self.default = default\n self.dat = [default] * (self.size * 2)\n self.f = f\n \n def update(self, i, x):\n i += self.size\n self.dat[i] = x\n while i > 0:\n i >>= 1\n self.dat[i] = self.f(self.dat[i * 2], self.dat[i * 2 + 1])\n \n def query(self, l, r):\n l += self.size\n r += self.size\n lres, rres = self.default, self.default\n while l < r:\n if l & 1:\n lres = self.f(lres, self.dat[l])\n l += 1\n \n if r & 1:\n r -= 1\n rres = self.f(self.dat[r], rres)\n l >>= 1\n r >>= 1\n res = self.f(lres, rres)\n return res\n \n \n input = sys.stdin.buffer.readline\n \n N, K = map(int, input().split())\n MAX = 300010\n B = SegmentTree(MAX)\n-\n for _ in range(N):\n- a = int(input())\n+ a = int(input()) + 1\n m = B.query(max(1, a - K), min(MAX, a + K + 1))\n B.update(a, m + 1)\n print(B.query(1, MAX))\n \n", "FL_content": " import sys\n \n \n class SegmentTree:\n \n \n def __init__(self, size, f=lambda x, y: max(x, y), default=0):\n self.size = 2 ** (size - 1).bit_length()\n self.default = default\n self.dat = [default] * (self.size * 2)\n self.f = f\n \n def update(self, i, x):\n i += self.size\n self.dat[i] = x\n while i > 0:\n i >>= 1\n self.dat[i] = self.f(self.dat[i * 2], self.dat[i * 2 + 1])\n \n def query(self, l, r):\n l += self.size\n r += self.size\n lres, rres = self.default, self.default\n while l < r:\n if l & 1:\n lres = self.f(lres, self.dat[l])\n l += 1\n \n if r & 1:\n r -= 1\n rres = self.f(self.dat[r], rres)\n l >>= 1\n r >>= 1\n res = self.f(lres, rres)\n return res\n \n \n input = sys.stdin.buffer.readline\n \n N, K = map(int, input().split())\n MAX = 300010\n B = SegmentTree(MAX)\n-\n for _ in range(N):\n- a = int(input())\n m = B.query(max(1, a - K), min(MAX, a + K + 1))\n B.update(a, m + 1)\n print(B.query(1, MAX))\n \n", "added_lines": 1, "removed_lines": 2, "code1_lines": 49 }, { "user_id": "u648868410", "problem_id": "p02537", "submission1_id": "s376111038", "submission2_id": "s628284885", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class SegTree:\n\t\n\tdef __init__(self,size,func,init_val,undef):\n\t\tself.specSize = size\n\t\tself.datSize = 1\n\t\tself.compareFunc = func\t\t\n\t\tself.INIT_VAL = init_val\t\n\t\tself.UNDEFINED_VAL = undef\t\n\t\t\n\t\tself.datSize = 2**size.bit_length()\n\n\t\t\n\t\t\n\t\tself.datTree = [self.INIT_VAL for _ in range(2*self.datSize+1)]\n\n\tdef update(self, i, val ):\n\t\t\n\t\t\n\t\t\n\t\ti += self.datSize\n\t\tself.datTree[i] = val\n\t\twhile 1 < i:\n\t\t\ti >>= 1\n\t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n\n\tdef query(self,a,b):\n\t\treturn self.query_(a,b,1,0,self.datSize)\n\n\tdef query_(self,a,b,i,l,r):\n\t\t\n\t\tret = self.UNDEFINED_VAL\n\n\t\ta += self.datSize\n\t\tb += self.datSize\n\t\twhile a < b:\n\t\t\tif b & 1:\n\t\t\t\tb -= 1\n\t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n\n\t\t\tif a & 1:\n\t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n\t\t\t\ta += 1\n\n\t\t\ta >>= 1; b >>= 1\n\n\t\treturn ret\n\n\tdef printTree(self):\n\t\tprint(self.datTree)\n\n\ndef LongestSeaquence(A,K):\n\tN = len(A)\n\tlis = 0\n\n\t\n\tMAX_A = max(A)\n\ttree = SegTree(MAX_A+1,max,0,-1e18)\n\t\n\n\tfor n in range(N):\n\t\tx = A[n]\n\t\tl = max(1,x-K)\n\t\tr = min(MAX_A,x+K)\n\t\ttree.update( x, tree.query(l,r+1)+1 )\n\n\t\n\tlis = tree.query(0,MAX_A+1)\n\n\treturn lis\n\ndef main():\n\tN,K = map(int,input().split())\n\tA = [ int(input()) for _ in range(N)]\n\n\tprint(LongestSeaquence(A,K))\n\n\n\nif __name__ == \"__main__\":\n\tmain()", "code2": "class SegTree:\n\t\n\tdef __init__(self,size,func,init_val,undef):\n\t\tself.specSize = size\n\t\tself.datSize = 1\n\t\tself.compareFunc = func\t\t\n\t\tself.INIT_VAL = init_val\t\n\t\tself.UNDEFINED_VAL = undef\t\n\t\t\n\t\tself.datSize = 2**size.bit_length()\n\n\t\t\n\t\t\n\t\tself.datTree = [self.INIT_VAL for _ in range(2*self.datSize+1)]\n\n\tdef update(self, i, val ):\n\t\t\n\t\t\n\t\t\n\t\ti += self.datSize\n\t\tself.datTree[i] = val\n\t\twhile 1 < i:\n\t\t\ti >>= 1\n\t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n\n\tdef query(self,a,b):\n\t\treturn self.query_(a,b,0,0,self.datSize)\n\n\tdef query_(self,a,b,i,l,r):\n\t\t\n\t\tret = self.UNDEFINED_VAL\n\n\t\ta += self.datSize\n\t\tb += self.datSize\n\t\twhile a < b:\n\t\t\tif b & 1:\n\t\t\t\tb -= 1\n\t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n\n\t\t\tif a & 1:\n\t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n\t\t\t\ta += 1\n\n\t\t\ta >>= 1; b >>= 1\n\n\t\treturn ret\n\n\tdef printTree(self):\n\t\tprint(self.datTree)\n\n\ndef LongestSeaquence(A,K):\n\tN = len(A)\n\tlis = 0\n\n\t\n\tMAX_A = max(A)\n\ttree = SegTree(MAX_A+1,max,0,-1e18)\n\t\n\n\tfor n in range(N):\n\t\tx = A[n]\n\t\tl = max(0,x-K)\n\t\tr = min(MAX_A,x+K)\n\t\ttmp = tree.query(l,r+1)+1\n\t\ttree.update( x, tmp )\n\t\tlis = max(lis, tmp)\n\n\treturn lis\n\ndef main():\n\tN,K = map(int,input().split())\n\tA = [ int(input()) for _ in range(N)]\n\n\tprint(LongestSeaquence(A,K))\n\n\n\nif __name__ == \"__main__\":\n\tmain()", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601183504", "date2": "1601183918", "bleu_score": "0.9765198019877849", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 81, "total_score": 101, "input": "8 0\n0\n2\n4\n0\n5\n6\n13\n7\n4\n4\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["class SegTree: # (0): SegTree=\n\t\n\tdef __init__(self,size,func,init_val,undef):\n\t\tself.specSize = size\n\t\tself.datSize = 1\n\t\tself.compareFunc = func\t\t\n\t\tself.INIT_VAL = init_val\t\n\t\tself.UNDEFINED_VAL = undef\t\n\t\t\n\t\tself.datSize = 2**size.bit_length()\n\n\t\t\n\t\t\n\t\tself.datTree = [self.INIT_VAL for _ in range(2*self.datSize+1)]\n\n\tdef update(self, i, val ):\n\t\t\n\t\t\n\t\t\n\t\ti += self.datSize\n\t\tself.datTree[i] = val\n\t\twhile 1 < i:\n\t\t\ti >>= 1\n\t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n\n\tdef query(self,a,b):\n\t\treturn self.query_(a,b,1,0,self.datSize)\n\n\tdef query_(self,a,b,i,l,r):\n\t\t\n\t\tret = self.UNDEFINED_VAL\n\n\t\ta += self.datSize\n\t\tb += self.datSize\n\t\twhile a < b:\n\t\t\tif b & 1:\n\t\t\t\tb -= 1\n\t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n\n\t\t\tif a & 1:\n\t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n\t\t\t\ta += 1\n\n\t\t\ta >>= 1; b >>= 1\n\n\t\treturn ret\n\n\tdef printTree(self):\n\t\tprint(self.datTree)\n\n\ndef LongestSeaquence(A,K): # (1): LongestSeaquence=\n\tN = len(A)\n\tlis = 0\n\n\t\n\tMAX_A = max(A)\n\ttree = SegTree(MAX_A+1,max,0,-1e18)\n\t\n\n\tfor n in range(N):\n\t\tx = A[n]\n\t\tl = max(1,x-K)\n\t\tr = min(MAX_A,x+K)\n\t\ttree.update( x, tree.query(l,r+1)+1 )\n\n\t\n\tlis = tree.query(0,MAX_A+1)\n\n\treturn lis\n\ndef main(): # (2): main=\n\tN,K = map(int,input().split())\n\tA = [ int(input()) for _ in range(N)]\n\n\tprint(LongestSeaquence(A,K))\n\n\n\nif __name__ == \"__main__\":\n\tmain()"], "anno_status": [false], "diff_content": " class SegTree:\n \t\n \tdef __init__(self,size,func,init_val,undef):\n \t\tself.specSize = size\n \t\tself.datSize = 1\n \t\tself.compareFunc = func\t\t\n \t\tself.INIT_VAL = init_val\t\n \t\tself.UNDEFINED_VAL = undef\t\n \t\t\n \t\tself.datSize = 2**size.bit_length()\n \n \t\t\n \t\t\n \t\tself.datTree = [self.INIT_VAL for _ in range(2*self.datSize+1)]\n \n \tdef update(self, i, val ):\n \t\t\n \t\t\n \t\t\n \t\ti += self.datSize\n \t\tself.datTree[i] = val\n \t\twhile 1 < i:\n \t\t\ti >>= 1\n \t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n \n \tdef query(self,a,b):\n-\t\treturn self.query_(a,b,1,0,self.datSize)\n+\t\treturn self.query_(a,b,0,0,self.datSize)\n \n \tdef query_(self,a,b,i,l,r):\n \t\t\n \t\tret = self.UNDEFINED_VAL\n \n \t\ta += self.datSize\n \t\tb += self.datSize\n \t\twhile a < b:\n \t\t\tif b & 1:\n \t\t\t\tb -= 1\n \t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n \n \t\t\tif a & 1:\n \t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n \t\t\t\ta += 1\n \n \t\t\ta >>= 1; b >>= 1\n \n \t\treturn ret\n \n \tdef printTree(self):\n \t\tprint(self.datTree)\n \n \n def LongestSeaquence(A,K):\n \tN = len(A)\n \tlis = 0\n \n \t\n \tMAX_A = max(A)\n \ttree = SegTree(MAX_A+1,max,0,-1e18)\n \t\n \n \tfor n in range(N):\n \t\tx = A[n]\n-\t\tl = max(1,x-K)\n+\t\tl = max(0,x-K)\n \t\tr = min(MAX_A,x+K)\n-\t\ttree.update( x, tree.query(l,r+1)+1 )\n-\n-\t\n-\tlis = tree.query(0,MAX_A+1)\n+\t\ttmp = tree.query(l,r+1)+1\n+\t\ttree.update( x, tmp )\n+\t\tlis = max(lis, tmp)\n \n \treturn lis\n \n def main():\n \tN,K = map(int,input().split())\n \tA = [ int(input()) for _ in range(N)]\n \n \tprint(LongestSeaquence(A,K))\n \n \n \n if __name__ == \"__main__\":\n \tmain()\n", "FL_content": " class SegTree:\n \t\n \tdef __init__(self,size,func,init_val,undef):\n \t\tself.specSize = size\n \t\tself.datSize = 1\n \t\tself.compareFunc = func\t\t\n \t\tself.INIT_VAL = init_val\t\n \t\tself.UNDEFINED_VAL = undef\t\n \t\t\n \t\tself.datSize = 2**size.bit_length()\n \n \t\t\n \t\t\n \t\tself.datTree = [self.INIT_VAL for _ in range(2*self.datSize+1)]\n \n \tdef update(self, i, val ):\n \t\t\n \t\t\n \t\t\n \t\ti += self.datSize\n \t\tself.datTree[i] = val\n \t\twhile 1 < i:\n \t\t\ti >>= 1\n \t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n \n \tdef query(self,a,b):\n-\t\treturn self.query_(a,b,1,0,self.datSize)\n \n \tdef query_(self,a,b,i,l,r):\n \t\t\n \t\tret = self.UNDEFINED_VAL\n \n \t\ta += self.datSize\n \t\tb += self.datSize\n \t\twhile a < b:\n \t\t\tif b & 1:\n \t\t\t\tb -= 1\n \t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n \n \t\t\tif a & 1:\n \t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n \t\t\t\ta += 1\n \n \t\t\ta >>= 1; b >>= 1\n \n \t\treturn ret\n \n \tdef printTree(self):\n \t\tprint(self.datTree)\n \n \n def LongestSeaquence(A,K):\n \tN = len(A)\n \tlis = 0\n \n \t\n \tMAX_A = max(A)\n \ttree = SegTree(MAX_A+1,max,0,-1e18)\n \t\n \n \tfor n in range(N):\n \t\tx = A[n]\n-\t\tl = max(1,x-K)\n \t\tr = min(MAX_A,x+K)\n-\t\ttree.update( x, tree.query(l,r+1)+1 )\n-\n-\t\n-\tlis = tree.query(0,MAX_A+1)\n \n \treturn lis\n \n def main():\n \tN,K = map(int,input().split())\n \tA = [ int(input()) for _ in range(N)]\n \n \tprint(LongestSeaquence(A,K))\n \n \n \n if __name__ == \"__main__\":\n \tmain()\n", "added_lines": 5, "removed_lines": 6, "code1_lines": 81 }, { "user_id": "u851125702", "problem_id": "p02549", "submission1_id": "s795327876", "submission2_id": "s309685160", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K=map(int,input().split())\nx=998244353\nS=[]\nfor i in range(K):\n l,r=map(int,input().split())\n S.append(l)\n S.append(r)\nS=list(set(S))\ndp=[0 for i in range(N)]\nprint(S)\nfor i in range(N):\n for j in range(len(S)):\n if(i-S[j]>0):\n dp[i]+=dp[i-S[j]]\n dp[i]=dp[i]%x\n elif(i-S[j]==0):\n dp[i]+=1\n dp[i]=dp[i]%x\nprint(dp)", "code2": "N,K=map(int,input().split())\nx=998244353\ndp=[0 for i in range(N)]\nsdp=[0 for i in range(N)]\nL=[]\nR=[]\ndp[0]=1\nsdp[0]=1\nfor i in range(K):\n l,r=map(int,input().split())\n L.append(l)\n R.append(r) \nfor i in range(1,N):\n for j in range(K):\n dp[i]+=(sdp[max(i-L[j],-1)]-sdp[max(i-R[j]-1,-1)])\n dp[i]%=x\n sdp[i]=(sdp[i-1]+dp[i])%x\nprint(dp[-1]%x)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600580151", "date2": "1600630368", "bleu_score": "0.6685329123310874", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "10 2\n1 2\n5 4\n", "actual_output": "[1, 2, 4, 5]\n[0, 1, 2, 3, 6, 11, 20, 36, 65, 118]\n", "expected_output": "55\n\n", "anno_code": ["N,K=map(int,input().split()) # (0): N=10, K=2\nx=998244353 # (1): x=998244353\nS=[] # (2): S=[]\nfor i in range(K): # (3): i=0 (7): i=1 (11): NO CHANGE\n l,r=map(int,input().split()) # (4): l=1, r=2 (8): l=5, r=4\n S.append(l) # (5): S=[1] (9): S=[1, 2, 5]\n S.append(r) # (6): S=[1, 2] (10): S=[1, 2, 5, 4]\nS=list(set(S)) # (12): S=[1, 2, 4, 5]\ndp=[0 for i in range(N)] # (13): dp=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nprint(S) # (14): NO CHANGE\nfor i in range(N): # (15): i=0 (29): i=1 ... (187): NO CHANGE\n for j in range(len(S)): # (16): j=0 (19): j=1 ... (186): NO CHANGE\n if(i-S[j]>0): # (17): NO CHANGE (20): NO CHANGE ... (183): NO CHANGE\n dp[i]+=dp[i-S[j]] # (48): dp=[0, 1, 1, 0, 0, 0, 0, 0, 0, 0] (65): dp=[0, 1, 2, 2, 0, 0, 0, 0, 0, 0] ... (184): dp=[0, 1, 2, 3, 6, 11, 20, 36, 65, 118]\n dp[i]=dp[i]%x # (49): NO CHANGE (66): NO CHANGE ... (185): NO CHANGE\n elif(i-S[j]==0): # (18): NO CHANGE (21): NO CHANGE ... (111): NO CHANGE\n dp[i]+=1 # (33): dp=[0, 1, 0, 0, 0, 0, 0, 0, 0, 0] (53): dp=[0, 1, 2, 0, 0, 0, 0, 0, 0, 0] ... (112): dp=[0, 1, 2, 3, 6, 11, 0, 0, 0, 0]\n dp[i]=dp[i]%x # (34): NO CHANGE (54): NO CHANGE ... (113): NO CHANGE\nprint(dp)"], "anno_status": [true], "diff_content": " N,K=map(int,input().split())\n x=998244353\n-S=[]\n+dp=[0 for i in range(N)]\n+sdp=[0 for i in range(N)]\n+L=[]\n+R=[]\n+dp[0]=1\n+sdp[0]=1\n for i in range(K):\n l,r=map(int,input().split())\n- S.append(l)\n- S.append(r)\n-S=list(set(S))\n-dp=[0 for i in range(N)]\n-print(S)\n-for i in range(N):\n- for j in range(len(S)):\n- if(i-S[j]>0):\n- dp[i]+=dp[i-S[j]]\n- dp[i]=dp[i]%x\n- elif(i-S[j]==0):\n- dp[i]+=1\n- dp[i]=dp[i]%x\n-print(dp)\n+ L.append(l)\n+ R.append(r) \n+for i in range(1,N):\n+ for j in range(K):\n+ dp[i]+=(sdp[max(i-L[j],-1)]-sdp[max(i-R[j]-1,-1)])\n+ dp[i]%=x\n+ sdp[i]=(sdp[i-1]+dp[i])%x\n+print(dp[-1]%x)\n", "FL_content": " N,K=map(int,input().split())\n x=998244353\n-S=[]\n for i in range(K):\n l,r=map(int,input().split())\n- S.append(l)\n- S.append(r)\n-S=list(set(S))\n-dp=[0 for i in range(N)]\n-print(S)\n-for i in range(N):\n- for j in range(len(S)):\n- if(i-S[j]>0):\n- dp[i]+=dp[i-S[j]]\n- dp[i]=dp[i]%x\n- elif(i-S[j]==0):\n- dp[i]+=1\n- dp[i]=dp[i]%x\n-print(dp)\n", "added_lines": 14, "removed_lines": 15, "code1_lines": 19 }, { "user_id": "u894521144", "problem_id": "p02549", "submission1_id": "s996267709", "submission2_id": "s253874306", "status1": "Wrong Answer", "status2": "Accepted", "code1": "mod = 998244353\n\n\ndef main(N, S):\n dp = [0 if n != 0 else 1 for n in range(N)] \n A = [0 if n != 0 else 1 for n in range(N)] \n\n for i in range(1, N): \n for l, r in S: \n if i - l < 0: \n break\n else: \n dp[i] += A[i-l] - A[max(i-r-1, 0)] \n dp[i] %= mod\n A[i] = (A[i-1] + dp[i]) % mod\n print(dp[-1])\n\nif __name__ == '__main__':\n N, K = list(map(int, input().split()))\n S = {tuple(map(int, input().split())) for k in range(K)}\n S = sorted(list(S), key = lambda x:x[0]) \n main(N, S)", "code2": "mod = 998244353\n\n\ndef main(N, S):\n dp = [0 if n != 0 else 1 for n in range(N)] \n A = [0 if n != 0 else 1 for n in range(N)] \n\n for i in range(1, N): \n for l, r in S: \n if i - l < 0: \n break\n else: \n dp[i] += A[i-l] - A[max(i-r, 0)-1] \n dp[i] %= mod\n A[i] = (A[i-1] + dp[i]) % mod\n print(dp[-1])\n\nif __name__ == '__main__':\n N, K = list(map(int, input().split()))\n S = {tuple(map(int, input().split())) for k in range(K)}\n S = sorted(list(S), key = lambda x:x[0]) \n main(N, S)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600692541", "date2": "1600692715", "bleu_score": "0.9928764983134523", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0], "code1_test_score": 23, "total_score": 102, "input": "84 3\n5 4\n1 1\n1 27\n", "actual_output": "0\n", "expected_output": "894733340\n\n", "anno_code": ["mod = 998244353 # (0): mod=998244353\n\n\ndef main(N, S): # (1): main=\n dp = [0 if n != 0 else 1 for n in range(N)] \n A = [0 if n != 0 else 1 for n in range(N)] \n\n for i in range(1, N): \n for l, r in S: \n if i - l < 0: \n break\n else: \n dp[i] += A[i-l] - A[max(i-r-1, 0)] \n dp[i] %= mod\n A[i] = (A[i-1] + dp[i]) % mod\n print(dp[-1])\n\nif __name__ == '__main__':\n N, K = list(map(int, input().split()))\n S = {tuple(map(int, input().split())) for k in range(K)}\n S = sorted(list(S), key = lambda x:x[0]) \n main(N, S)"], "anno_status": [true], "diff_content": " mod = 998244353\n \n \n def main(N, S):\n dp = [0 if n != 0 else 1 for n in range(N)] \n A = [0 if n != 0 else 1 for n in range(N)] \n \n for i in range(1, N): \n for l, r in S: \n if i - l < 0: \n break\n else: \n- dp[i] += A[i-l] - A[max(i-r-1, 0)] \n+ dp[i] += A[i-l] - A[max(i-r, 0)-1] \n dp[i] %= mod\n A[i] = (A[i-1] + dp[i]) % mod\n print(dp[-1])\n \n if __name__ == '__main__':\n N, K = list(map(int, input().split()))\n S = {tuple(map(int, input().split())) for k in range(K)}\n S = sorted(list(S), key = lambda x:x[0]) \n main(N, S)\n", "FL_content": " mod = 998244353\n \n \n def main(N, S):\n dp = [0 if n != 0 else 1 for n in range(N)] \n A = [0 if n != 0 else 1 for n in range(N)] \n \n for i in range(1, N): \n for l, r in S: \n if i - l < 0: \n break\n else: \n- dp[i] += A[i-l] - A[max(i-r-1, 0)] \n dp[i] %= mod\n A[i] = (A[i-1] + dp[i]) % mod\n print(dp[-1])\n \n if __name__ == '__main__':\n N, K = list(map(int, input().split()))\n S = {tuple(map(int, input().split())) for k in range(K)}\n S = sorted(list(S), key = lambda x:x[0]) \n main(N, S)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 22 }, { "user_id": "u440566786", "problem_id": "p02549", "submission1_id": "s583638603", "submission2_id": "s277065011", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nINF = 1 << 60\nMOD = 998244353\nsys.setrecursionlimit(2147483647)\ninput = lambda:sys.stdin.readline().rstrip()\n\nclass SegmentTree(object):\n def __init__(self, A, dot, unit):\n n = 1 << (len(A) - 1).bit_length()\n tree = [unit] * (2 * n)\n for i, v in enumerate(A):\n tree[i + n] = v\n for i in range(n - 1, 0, -1):\n tree[i] = dot(tree[i << 1], tree[i << 1 | 1])\n self._n = n\n self._tree = tree\n self._dot = dot\n self._unit = unit\n\n def __getitem__(self, i):\n return self._tree[i + self._n]\n\n def update(self, i, v):\n i += self._n\n self._tree[i] = v\n while i != 1:\n i >>= 1\n self._tree[i] = self._dot(self._tree[i << 1], self._tree[i << 1 | 1])\n\n def add(self, i, v):\n self.update(i, self[i] + v)\n\n def sum(self, l, r):\n l += self._n\n r += self._n\n l_val = r_val = self._unit\n while l < r:\n if l & 1:\n l_val = self._dot(l_val, self._tree[l])\n l += 1\n if r & 1:\n r -= 1\n r_val = self._dot(self._tree[r], r_val)\n l >>= 1\n r >>= 1\n return self._dot(l_val, r_val)\n\ndef resolve():\n n, k = map(int, input().split())\n\n tree = SegmentTree([0] * n, lambda x, y:(x+y)%MOD, 0)\n tree.update(0, 1)\n D = [tuple(map(int, input().split())) for _ in range(k)]\n\n for i in range(1, n):\n for l, r in D: \n if i - l >= 0:\n tree.add(i, tree.sum(i - r, i - l + 1))\n print(tree[n - 1] % MOD)\nresolve()", "code2": "import sys\nINF = 1 << 60\nMOD = 998244353\nsys.setrecursionlimit(2147483647)\ninput = lambda:sys.stdin.readline().rstrip()\n\nclass SegmentTree(object):\n def __init__(self, A, dot, unit):\n n = 1 << (len(A) - 1).bit_length()\n tree = [unit] * (2 * n)\n for i, v in enumerate(A):\n tree[i + n] = v\n for i in range(n - 1, 0, -1):\n tree[i] = dot(tree[i << 1], tree[i << 1 | 1])\n self._n = n\n self._tree = tree\n self._dot = dot\n self._unit = unit\n\n def __getitem__(self, i):\n return self._tree[i + self._n]\n\n def update(self, i, v):\n i += self._n\n self._tree[i] = v\n while i != 1:\n i >>= 1\n self._tree[i] = self._dot(self._tree[i << 1], self._tree[i << 1 | 1])\n\n def add(self, i, v):\n self.update(i, self[i] + v)\n\n def sum(self, l, r):\n l += self._n\n r += self._n\n l_val = r_val = self._unit\n while l < r:\n if l & 1:\n l_val = self._dot(l_val, self._tree[l])\n l += 1\n if r & 1:\n r -= 1\n r_val = self._dot(self._tree[r], r_val)\n l >>= 1\n r >>= 1\n return self._dot(l_val, r_val)\n\ndef resolve():\n n, k = map(int, input().split())\n D = [tuple(map(int, input().split())) for _ in range(k)]\n tree = SegmentTree([0] * n, lambda x, y : (x + y) % MOD, 0)\n tree.update(0, 1)\n\n for i in range(1, n):\n for l, r in D: \n if i - l >= 0:\n tree.add(i, tree.sum(max(0, i - r), i - l + 1))\n\n print(tree[n - 1] % MOD)\nresolve()", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600549112", "date2": "1600549319", "bleu_score": "0.9848159068212872", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 90, "total_score": 102, "input": "15 2\n1 0\n3 33\n", "actual_output": "119\n", "expected_output": "41\n\n", "anno_code": ["import sys\nINF = 1 << 60 # (0): INF=1152921504606846976\nMOD = 998244353 # (1): MOD=998244353\nsys.setrecursionlimit(2147483647) # (2): NO CHANGE\ninput = lambda:sys.stdin.readline().rstrip() # (3): input= at 0x000001AABDD85BD0>\n\nclass SegmentTree(object): # (4): SegmentTree=\n def __init__(self, A, dot, unit):\n n = 1 << (len(A) - 1).bit_length() # (9): n=16\n tree = [unit] * (2 * n) # (10): tree=[0, 0, ..., 0, 0]\n for i, v in enumerate(A): # (11): i=0, v=0 (13): i=1 ... (41): NO CHANGE\n tree[i + n] = v # (12): NO CHANGE (14): NO CHANGE ... (40): NO CHANGE\n for i in range(n - 1, 0, -1): # (42): i=15 (44): i=14 ... (72): NO CHANGE\n tree[i] = dot(tree[i << 1], tree[i << 1 | 1]) # (43): NO CHANGE (45): NO CHANGE ... (71): NO CHANGE\n self._n = n # (73): NO CHANGE\n self._tree = tree # (74): NO CHANGE\n self._dot = dot # (75): NO CHANGE\n self._unit = unit # (76): n=15, k=2, tree=\n\n def __getitem__(self, i):\n return self._tree[i + self._n]\n\n def update(self, i, v):\n i += self._n # (78): i=16 (103): i=17 ... (1128): i=30\n self._tree[i] = v # (79): NO CHANGE (104): NO CHANGE ... (1129): NO CHANGE\n while i != 1: # (80): NO CHANGE (83): NO CHANGE ... (1142): n=15, k=2, tree=, D=[(1, 0), (3, 33)], i=14, l=3, r=33\n i >>= 1 # (81): i=8 (84): i=4 ... (1140): i=1\n self._tree[i] = self._dot(self._tree[i << 1], self._tree[i << 1 | 1]) # (82): NO CHANGE (85): NO CHANGE ... (1141): NO CHANGE\n\n def add(self, i, v):\n self.update(i, self[i] + v) # (102): NO CHANGE (129): NO CHANGE ... (1127): NO CHANGE\n\n def sum(self, l, r):\n l += self._n # (98): l=17 (125): l=18 ... (1088): l=-3\n r += self._n # (99): r=17 (126): r=18 ... (1089): r=28\n l_val = r_val = self._unit # (100): l_val=0, r_val=0 (127): l_val=0, r_val=0 ... (1090): l_val=0, r_val=0\n while l < r: # (101): i=1, v=0 (128): i=2, v=0 ... (1126): i=14, v=119\n if l & 1: # (179): NO CHANGE (186): NO CHANGE ... (1120): NO CHANGE\n l_val = self._dot(l_val, self._tree[l]) # (187): NO CHANGE (194): NO CHANGE ... (1100): NO CHANGE\n l += 1 # (188): l=-6 (195): l=-2 ... (1101): l=0\n if r & 1: # (180): NO CHANGE (189): NO CHANGE ... (1121): NO CHANGE\n r -= 1 # (181): r=16 (209): r=0 ... (1122): r=0\n r_val = self._dot(self._tree[r], r_val) # (182): r_val=1 (210): NO CHANGE ... (1123): NO CHANGE\n l >>= 1 # (183): l=-7 (190): l=-3 ... (1124): NO CHANGE\n r >>= 1 # (184): r=8 (191): r=4 ... (1125): NO CHANGE\n return self._dot(l_val, r_val)\n\ndef resolve(): # (5): resolve=\n n, k = map(int, input().split()) # (7): n=15, k=2\n\n tree = SegmentTree([0] * n, lambda x, y:(x+y)%MOD, 0) # (8): self=, A=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], dot=. at 0x000001AABDD85F30>, unit=0\n tree.update(0, 1) # (77): self=, i=0, v=1\n D = [tuple(map(int, input().split())) for _ in range(k)] # (93): D=[(1, 0), (3, 33)]\n\n for i in range(1, n): # (94): i=1 (121): i=2 ... (1144): NO CHANGE\n for l, r in D: # (95): l=1, r=0 (118): l=3, r=33 ... (1143): NO CHANGE\n if i - l >= 0: # (96): NO CHANGE (119): NO CHANGE ... (1086): NO CHANGE\n tree.add(i, tree.sum(i - r, i - l + 1)) # (97): self=, r=1 (124): self=, l=2, r=2 ... (1087): self=, l=-19, r=12\n print(tree[n - 1] % MOD)\nresolve() # (6): NO CHANGE\n"], "anno_status": [false], "diff_content": " import sys\n INF = 1 << 60\n MOD = 998244353\n sys.setrecursionlimit(2147483647)\n input = lambda:sys.stdin.readline().rstrip()\n \n class SegmentTree(object):\n def __init__(self, A, dot, unit):\n n = 1 << (len(A) - 1).bit_length()\n tree = [unit] * (2 * n)\n for i, v in enumerate(A):\n tree[i + n] = v\n for i in range(n - 1, 0, -1):\n tree[i] = dot(tree[i << 1], tree[i << 1 | 1])\n self._n = n\n self._tree = tree\n self._dot = dot\n self._unit = unit\n \n def __getitem__(self, i):\n return self._tree[i + self._n]\n \n def update(self, i, v):\n i += self._n\n self._tree[i] = v\n while i != 1:\n i >>= 1\n self._tree[i] = self._dot(self._tree[i << 1], self._tree[i << 1 | 1])\n \n def add(self, i, v):\n self.update(i, self[i] + v)\n \n def sum(self, l, r):\n l += self._n\n r += self._n\n l_val = r_val = self._unit\n while l < r:\n if l & 1:\n l_val = self._dot(l_val, self._tree[l])\n l += 1\n if r & 1:\n r -= 1\n r_val = self._dot(self._tree[r], r_val)\n l >>= 1\n r >>= 1\n return self._dot(l_val, r_val)\n \n def resolve():\n n, k = map(int, input().split())\n-\n- tree = SegmentTree([0] * n, lambda x, y:(x+y)%MOD, 0)\n- tree.update(0, 1)\n D = [tuple(map(int, input().split())) for _ in range(k)]\n+ tree = SegmentTree([0] * n, lambda x, y : (x + y) % MOD, 0)\n+ tree.update(0, 1)\n \n for i in range(1, n):\n for l, r in D: \n if i - l >= 0:\n- tree.add(i, tree.sum(i - r, i - l + 1))\n+ tree.add(i, tree.sum(max(0, i - r), i - l + 1))\n+\n print(tree[n - 1] % MOD)\n resolve()\n", "FL_content": " import sys\n INF = 1 << 60\n MOD = 998244353\n sys.setrecursionlimit(2147483647)\n input = lambda:sys.stdin.readline().rstrip()\n \n class SegmentTree(object):\n def __init__(self, A, dot, unit):\n n = 1 << (len(A) - 1).bit_length()\n tree = [unit] * (2 * n)\n for i, v in enumerate(A):\n tree[i + n] = v\n for i in range(n - 1, 0, -1):\n tree[i] = dot(tree[i << 1], tree[i << 1 | 1])\n self._n = n\n self._tree = tree\n self._dot = dot\n self._unit = unit\n \n def __getitem__(self, i):\n return self._tree[i + self._n]\n \n def update(self, i, v):\n i += self._n\n self._tree[i] = v\n while i != 1:\n i >>= 1\n self._tree[i] = self._dot(self._tree[i << 1], self._tree[i << 1 | 1])\n \n def add(self, i, v):\n self.update(i, self[i] + v)\n \n def sum(self, l, r):\n l += self._n\n r += self._n\n l_val = r_val = self._unit\n while l < r:\n if l & 1:\n l_val = self._dot(l_val, self._tree[l])\n l += 1\n if r & 1:\n r -= 1\n r_val = self._dot(self._tree[r], r_val)\n l >>= 1\n r >>= 1\n return self._dot(l_val, r_val)\n \n def resolve():\n n, k = map(int, input().split())\n-\n- tree = SegmentTree([0] * n, lambda x, y:(x+y)%MOD, 0)\n- tree.update(0, 1)\n D = [tuple(map(int, input().split())) for _ in range(k)]\n \n for i in range(1, n):\n for l, r in D: \n if i - l >= 0:\n- tree.add(i, tree.sum(i - r, i - l + 1))\n print(tree[n - 1] % MOD)\n resolve()\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 60 }, { "user_id": "u634461820", "problem_id": "p02549", "submission1_id": "s252920839", "submission2_id": "s047746430", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nMAX_INT = int(10e12)\nMIN_INT = -MAX_INT\nmod = 998244353\nsys.setrecursionlimit(1000000)\ndef IL(): return list(map(int,input().split()))\ndef SL(): return input().split()\ndef I(): return int(sys.stdin.readline())\ndef S(): return input()\n\nN,K = IL()\nlr = [IL() for i in range(K)]\nlr.sort()\n\ndp = [0]*(N+1)\ndp[1] = 1\ndata = [0]*(N+1)\ndata[1] = 1\n\nfor i in range(2,N+1):\n tmp = 0\n for l,r in lr:\n if tmp >= r:\n continue\n elif l <= tmp < r:\n l = tmp+1\n if 1 <= i-l:\n dp[i] += data[i-l] - data[max(i-r-1, 0)]\n data[i] = (data[i-1] + dp[i]) %mod\nprint(dp[N])", "code2": "import sys\nMAX_INT = int(10e12)\nMIN_INT = -MAX_INT\nmod = 998244353\nsys.setrecursionlimit(1000000)\ndef IL(): return list(map(int,input().split()))\ndef SL(): return input().split()\ndef I(): return int(sys.stdin.readline())\ndef S(): return input()\n\nN,K = IL()\nlr = [IL() for i in range(K)]\nlr.sort()\n\ndp = [0]*(N+1)\ndp[1] = 1\ndata = [0]*(N+1)\ndata[1] = 1\n\nfor i in range(2,N+1):\n tmp = 0\n for l,r in lr:\n if tmp >= r:\n continue\n elif l <= tmp < r:\n l = tmp+1\n if 1 <= i-l:\n dp[i] += data[i-l] - data[max(i-r-1, 0)]\n data[i] = (data[i-1] + dp[i]) %mod\nprint(dp[N] %mod)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600546408", "date2": "1600546482", "bleu_score": "0.9902610991104045", "code1_test_status": [1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 81, "total_score": 102, "input": "60 3\n5 4\n2 6\n3 15\n", "actual_output": "-243878976\n", "expected_output": "754365377\n\n", "anno_code": ["import sys\nMAX_INT = int(10e12) # (0): MAX_INT=10000000000000\nMIN_INT = -MAX_INT # (1): MIN_INT=-10000000000000\nmod = 998244353 # (2): mod=998244353\nsys.setrecursionlimit(1000000) # (3): IL=, SL=, I=, S=\ndef IL(): return list(map(int,input().split()))\ndef SL(): return input().split()\ndef I(): return int(sys.stdin.readline())\ndef S(): return input()\n\nN,K = IL() # (4): N=60, K=3\nlr = [IL() for i in range(K)] # (5): lr\nlr.sort() # (6): lr\n\ndp = [0]*(N+1) # (7): dp=[0, 0, ..., 0, 0]\ndp[1] = 1 # (8): dp=[0, 1, ..., 0, 0]\ndata = [0]*(N+1) # (9): data=[0, 0, ..., 0, 0]\ndata[1] = 1 # (10): data=[0, 1, ..., 0, 0]\n\nfor i in range(2,N+1): # (11): i=2 (27): i=3 ... (1125): NO CHANGE\n tmp = 0 # (12): tmp=0 (28): NO CHANGE ... (1107): NO CHANGE\n for l,r in lr: # (13): l=2, r=6 (17): l=3, r=15 ... (1123): NO CHANGE\n if tmp >= r: # (14): NO CHANGE (18): NO CHANGE ... (1119): NO CHANGE\n continue\n elif l <= tmp < r: # (15): NO CHANGE (19): NO CHANGE ... (1120): NO CHANGE\n l = tmp+1\n if 1 <= i-l: # (16): NO CHANGE (20): NO CHANGE ... (1121): NO CHANGE\n dp[i] += data[i-l] - data[max(i-r-1, 0)] # (33): dp=[0, 1, ..., 0, 0] (50): dp=[0, 1, ..., 0, 0] ... (1122): NO CHANGE\n data[i] = (data[i-1] + dp[i]) %mod # (26): data=[0, 1, ..., 0, 0] (43): data=[0, 1, ..., 0, 0] ... (1124): data=[0, 1, ..., 862962990, 619084014]\nprint(dp[N])"], "anno_status": [false], "diff_content": " import sys\n MAX_INT = int(10e12)\n MIN_INT = -MAX_INT\n mod = 998244353\n sys.setrecursionlimit(1000000)\n def IL(): return list(map(int,input().split()))\n def SL(): return input().split()\n def I(): return int(sys.stdin.readline())\n def S(): return input()\n \n N,K = IL()\n lr = [IL() for i in range(K)]\n lr.sort()\n \n dp = [0]*(N+1)\n dp[1] = 1\n data = [0]*(N+1)\n data[1] = 1\n \n for i in range(2,N+1):\n tmp = 0\n for l,r in lr:\n if tmp >= r:\n continue\n elif l <= tmp < r:\n l = tmp+1\n if 1 <= i-l:\n dp[i] += data[i-l] - data[max(i-r-1, 0)]\n data[i] = (data[i-1] + dp[i]) %mod\n-print(dp[N])\n+print(dp[N] %mod)\n", "FL_content": " import sys\n MAX_INT = int(10e12)\n MIN_INT = -MAX_INT\n mod = 998244353\n sys.setrecursionlimit(1000000)\n def IL(): return list(map(int,input().split()))\n def SL(): return input().split()\n def I(): return int(sys.stdin.readline())\n def S(): return input()\n \n N,K = IL()\n lr = [IL() for i in range(K)]\n lr.sort()\n \n dp = [0]*(N+1)\n dp[1] = 1\n data = [0]*(N+1)\n data[1] = 1\n \n for i in range(2,N+1):\n tmp = 0\n for l,r in lr:\n if tmp >= r:\n continue\n elif l <= tmp < r:\n l = tmp+1\n if 1 <= i-l:\n dp[i] += data[i-l] - data[max(i-r-1, 0)]\n data[i] = (data[i-1] + dp[i]) %mod\n-print(dp[N])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 30 }, { "user_id": "u686036872", "problem_id": "p02549", "submission1_id": "s291847586", "submission2_id": "s990556771", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int, input().split())\n\nDP = [0]*(N+1)\nDP[1] = 1\n\nS = []\nfor i in range(K):\n S.append(list(map(int, input().split())))\n\nfor i in range(2, N+1):\n for l, r in S:\n DP[i] += (DP[max(i-r, 0)] - DP[max(i-l-1, 0)])%998244353\n DP[i] += DP[i-1]\n\nprint(DP[N]%998244353)", "code2": "N, K = map(int, input().split())\n\nDP = [0]*(N+1)\nDP[1] = 1\n\nS = []\nfor i in range(K):\n S.append(list(map(int, input().split())))\n\nfor i in range(2, N+1):\n for l, r in S:\n DP[i] += (DP[max(i-l, 0)] - DP[max(i-r-1, 0)])\n DP[i] += DP[i-1]\n DP[i] %= 998244353\n\nprint((DP[N] - DP[N-1])%998244353)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600641180", "date2": "1600641388", "bleu_score": "0.8948800284708603", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "50 3\n5 4\n1 3\n1 20\n", "actual_output": "829714759\n", "expected_output": "465231607\n\n", "anno_code": ["N, K = map(int, input().split()) # (0): N=50, K=3\n\nDP = [0]*(N+1) # (1): DP=[0, 0, ..., 0, 0]\nDP[1] = 1 # (2): DP=[0, 1, ..., 0, 0]\n\nS = [] # (3): S=[]\nfor i in range(K): # (4): i=0 (6): i=1 ... (10): NO CHANGE\n S.append(list(map(int, input().split()))) # (5): S=[[5, 4]] (7): S (9): S\n\nfor i in range(2, N+1): # (11): NO CHANGE (20): i=3 ... (452): NO CHANGE\n for l, r in S: # (12): l=5, r=4 (14): l=1, r=3 ... (450): NO CHANGE\n DP[i] += (DP[max(i-r, 0)] - DP[max(i-l-1, 0)])%998244353 # (13): NO CHANGE (15): NO CHANGE ... (449): DP=[0, 1, ..., 69187196078, 521379038]\n DP[i] += DP[i-1] # (19): DP=[0, 1, ..., 0, 0] (28): DP=[0, 1, ..., 0, 0] ... (451): DP=[0, 1, ..., 69187196078, 69708575116]\n\nprint(DP[N]%998244353)"], "anno_status": [true], "diff_content": " N, K = map(int, input().split())\n \n DP = [0]*(N+1)\n DP[1] = 1\n \n S = []\n for i in range(K):\n S.append(list(map(int, input().split())))\n \n for i in range(2, N+1):\n for l, r in S:\n- DP[i] += (DP[max(i-r, 0)] - DP[max(i-l-1, 0)])%998244353\n+ DP[i] += (DP[max(i-l, 0)] - DP[max(i-r-1, 0)])\n DP[i] += DP[i-1]\n+ DP[i] %= 998244353\n \n-print(DP[N]%998244353)\n+print((DP[N] - DP[N-1])%998244353)\n", "FL_content": " N, K = map(int, input().split())\n \n DP = [0]*(N+1)\n DP[1] = 1\n \n S = []\n for i in range(K):\n S.append(list(map(int, input().split())))\n \n for i in range(2, N+1):\n for l, r in S:\n- DP[i] += (DP[max(i-r, 0)] - DP[max(i-l-1, 0)])%998244353\n DP[i] += DP[i-1]\n \n-print(DP[N]%998244353)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 15 }, { "user_id": "u216392490", "problem_id": "p02549", "submission1_id": "s828066217", "submission2_id": "s865887487", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nn, k = list(map(int, input().split()))\ns = list()\nfor i in range(k):\n l, r = list(map(int, input().split()))\n s.append((l, r))\n\nmod = 998244353\ni = 1\ndp = [0] * (n+1)\ndp[1] = 1\ndpsum = [0] * (n+1)\ndpsum[1] = 1\nfor i in range(2, n+1):\n for l, r in s:\n li = i-r\n ri = i-l\n if ri < 1: continue\n li = max(li, 1)\n dp[i] += dpsum[ri] - dpsum[li-1]\n dpsum[i] = (dpsum[i-1] + dp[i]) % mod\n \nprint(dp[n])\n", "code2": "\nn, k = list(map(int, input().split()))\ns = list()\nfor i in range(k):\n l, r = list(map(int, input().split()))\n s.append((l, r))\n\nmod = 998244353\ni = 1\ndp = [0] * (n+1)\ndp[1] = 1\ndpsum = [0] * (n+1)\ndpsum[1] = 1\nfor i in range(2, n+1):\n for l, r in s:\n li = i-r\n ri = i-l\n if ri < 1: continue\n li = max(li, 1)\n dp[i] = (dp[i] + dpsum[ri] - dpsum[li-1]) % mod\n dpsum[i] = (dpsum[i-1] + dp[i]) % mod\n \nprint(dp[n])\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600604441", "date2": "1600604557", "bleu_score": "0.9599674979754907", "code1_test_status": [1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 81, "total_score": 102, "input": "84 3\n5 4\n1 3\n1 20\n", "actual_output": "-1383036571\n", "expected_output": "613452135\n\n", "anno_code": ["\nn, k = list(map(int, input().split())) # (0): n=84, k=3\ns = list() # (1): s=[]\nfor i in range(k): # (2): i=0 (5): i=1 ... (11): NO CHANGE\n l, r = list(map(int, input().split())) # (3): l=5, r=4 (6): l=1, r=3 (9): r=20\n s.append((l, r)) # (4): s=[(5, 4)] (7): s=[(5, 4), (1, 3)] (10): s=[(5, 4), (1, 3), (1, 20)]\n\nmod = 998244353 # (12): mod=998244353\ni = 1 # (13): i=1\ndp = [0] * (n+1) # (14): dp=[0, 0, ..., 0, 0]\ndp[1] = 1 # (15): dp=[0, 1, ..., 0, 0]\ndpsum = [0] * (n+1) # (16): dpsum=[0, 0, ..., 0, 0]\ndpsum[1] = 1 # (17): dpsum=[0, 1, ..., 0, 0]\nfor i in range(2, n+1): # (18): i=2 (37): i=3 ... (1753): NO CHANGE\n for l, r in s: # (19): l=5, r=4 (23): l=1, r=3 ... (1751): NO CHANGE\n li = i-r # (20): li=-2 (24): li=-1 ... (1746): li=64\n ri = i-l # (21): ri=-3 (25): ri=1 ... (1747): NO CHANGE\n if ri < 1: continue # (22): NO CHANGE (26): NO CHANGE ... (1748): NO CHANGE\n li = max(li, 1) # (27): li=1 (33): li=1 ... (1749): NO CHANGE\n dp[i] += dpsum[ri] - dpsum[li-1] # (28): dp=[0, 1, ..., 0, 0] (34): dp=[0, 1, ..., 0, 0] ... (1750): dp=[0, 1, ..., 399387422, -1383036571]\n dpsum[i] = (dpsum[i-1] + dp[i]) % mod # (36): dpsum=[0, 1, ..., 0, 0] (55): dpsum=[0, 1, ..., 0, 0] ... (1752): dpsum=[0, 1, ..., 40854599, 654306734]\n \nprint(dp[n])\n"], "anno_status": [true], "diff_content": " \n n, k = list(map(int, input().split()))\n s = list()\n for i in range(k):\n l, r = list(map(int, input().split()))\n s.append((l, r))\n \n mod = 998244353\n i = 1\n dp = [0] * (n+1)\n dp[1] = 1\n dpsum = [0] * (n+1)\n dpsum[1] = 1\n for i in range(2, n+1):\n for l, r in s:\n li = i-r\n ri = i-l\n if ri < 1: continue\n li = max(li, 1)\n- dp[i] += dpsum[ri] - dpsum[li-1]\n+ dp[i] = (dp[i] + dpsum[ri] - dpsum[li-1]) % mod\n dpsum[i] = (dpsum[i-1] + dp[i]) % mod\n \n print(dp[n])\n \n", "FL_content": " \n n, k = list(map(int, input().split()))\n s = list()\n for i in range(k):\n l, r = list(map(int, input().split()))\n s.append((l, r))\n \n mod = 998244353\n i = 1\n dp = [0] * (n+1)\n dp[1] = 1\n dpsum = [0] * (n+1)\n dpsum[1] = 1\n for i in range(2, n+1):\n for l, r in s:\n li = i-r\n ri = i-l\n if ri < 1: continue\n li = max(li, 1)\n- dp[i] += dpsum[ri] - dpsum[li-1]\n dpsum[i] = (dpsum[i-1] + dp[i]) % mod\n \n print(dp[n])\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 24 }, { "user_id": "u711539583", "problem_id": "p02549", "submission1_id": "s126836723", "submission2_id": "s064455256", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int, input().split())\ncum = [0, 1]\ndp = [0, 1]\n\nlr = [list(map(int, input().split())) for _ in range(k)] \nmod = 998244353\n\ndef check(i):\n res = 0\n for l, r in lr:\n if i - l < 1:\n break\n res += cum[i-l] - cum[max(i-r-1,0)]\n res %= mod\n return res\n\n\nfor i in range(2,n+1):\n dp.append(check(i))\n cum.append((cum[-1]+dp[-1])%mod)\n\nprint(dp[-1])", "code2": "n, k = map(int, input().split())\ncum = [0, 1]\ndp = [0, 1]\n\nlr = [list(map(int, input().split())) for _ in range(k)] \nmod = 998244353\n\ndef check(i):\n res = 0\n for l, r in lr:\n if i - l < 1:\n continue\n res += cum[i-l] - cum[max(i-r-1,0)]\n res %= mod\n return res\n\n\nfor i in range(2,n+1):\n dp.append(check(i))\n cum.append((cum[-1]+dp[-1])%mod)\n\nprint(dp[-1])", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600549459", "date2": "1600550833", "bleu_score": "0.9770012996119488", "code1_test_status": [1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 63, "total_score": 102, "input": "84 3\n5 4\n1 2\n1 27\n", "actual_output": "75035283\n", "expected_output": "282478460\n\n", "anno_code": ["n, k = map(int, input().split()) # (0): n=84, k=3\ncum = [0, 1] # (1): cum=[0, 1]\ndp = [0, 1] # (2): dp=[0, 1]\n\nlr = [list(map(int, input().split())) for _ in range(k)] # (3): lr\nmod = 998244353 # (4): mod=998244353\n\ndef check(i): # (5): check=\n res = 0 # (8): res=0 (15): res=0 ... (1362): res=0\n for l, r in lr: # (9): l=5, r=4 (16): l=5, r=4 ... (1375): n=84, k=3, cum=[0, 1, 1, 1, 1, 1, 2, 5, 14, 40, 115, 331, 953, 2744, 7901, 22750, 65506, 188617, 543101, 1563797, 4502774, 12965221, 37331866, 107492824, 309513251, 891207887, 569642131, 401168789, 312298480, 367253308, 700591134, 791230568, 9949689, 327502285, 191276285, 563879161, 365890831, 906396168, 158820522, 110570404, 423558444, 113607713, 230244834, 267153308, 687786705, 834682311, 239861818, 30234952, 249764124, 496465333, 423584828, 913497536, 936269671, 495771945, 4176168, 671578750, 208421472, 253834940, 387579289, 163085827, 225472852, 959581335, 527893187, 794327548, 59266125, 739997726, 268600755, 635965736, 744341038, 852570293, 693255956, 70029169, 666219215, 470719378, 104022794, 613858568, 122847849, 766299773, 263211570, 751533678, 552031590, 897111255, 937379566, 590284005], dp=[0, 1, 0, 0, 0, 0, 1, 3, 9, 26, 75, 216, 622, 1791, 5157, 14849, 42756, 123111, 354484, 1020696, 2938977, 8462447, 24366645, 70160958, 202020427, 581694636, 676678597, 829771011, 909374044, 54954828, 333337826, 90639434, 216963474, 317552596, 862018353, 372602876, 800256023, 540505337, 250668707, 949994235, 312988040, 688293622, 116637121, 36908474, 420633397, 146895606, 403423860, 788617487, 219529172, 246701209, 925363848, 489912708, 22772135, 557746627, 506648576, 667402582, 535087075, 45413468, 133744349, 773750891, 62387025, 734108483, 566556205, 266434361, 263182930, 680731601, 526847382, 367364981, 108375302, 108229255, 838930016, 375017566, 596190046, 802744516, 631547769, 509835774, 507233634, 643451924, 495156150, 488322108, 798742265, 345079665, 40268311, 651148792, 75035283], lr, mod=998244353, check=\n if i - l < 1: # (10): NO CHANGE (17): NO CHANGE ... (1372): NO CHANGE\n break # (11): n=84, k=3, cum=[0, 1], dp=[0, 1, 0], lr, mod=998244353, check= (18): n=84, k=3, cum=[0, 1, 1], dp=[0, 1, 0, 0], lr, mod=998244353, check= ... (32): n=84, k=3, cum=[0, 1, 1, 1, 1], dp=[0, 1, 0, 0, 0, 0], lr, mod=998244353, check=\n res += cum[i-l] - cum[max(i-r-1,0)] # (39): NO CHANGE (43): NO CHANGE ... (1373): res=1073279636\n res %= mod # (40): NO CHANGE (44): NO CHANGE ... (1374): res=75035283\n return res\n\n\nfor i in range(2,n+1): # (6): i=2 (13): i=3 ... (1377): NO CHANGE\n dp.append(check(i)) # (7): NO CHANGE (14): NO CHANGE ... (1361): NO CHANGE\n cum.append((cum[-1]+dp[-1])%mod) # (12): cum=[0, 1, 1] (19): cum=[0, 1, 1, 1] ... (1376): cum=[0, 1, ..., 590284005, 665319288]\n\nprint(dp[-1])"], "anno_status": [false], "diff_content": " n, k = map(int, input().split())\n cum = [0, 1]\n dp = [0, 1]\n \n lr = [list(map(int, input().split())) for _ in range(k)] \n mod = 998244353\n \n def check(i):\n res = 0\n for l, r in lr:\n if i - l < 1:\n- break\n+ continue\n res += cum[i-l] - cum[max(i-r-1,0)]\n res %= mod\n return res\n \n \n for i in range(2,n+1):\n dp.append(check(i))\n cum.append((cum[-1]+dp[-1])%mod)\n \n print(dp[-1])\n", "FL_content": " n, k = map(int, input().split())\n cum = [0, 1]\n dp = [0, 1]\n \n lr = [list(map(int, input().split())) for _ in range(k)] \n mod = 998244353\n \n def check(i):\n res = 0\n for l, r in lr:\n if i - l < 1:\n- break\n res += cum[i-l] - cum[max(i-r-1,0)]\n res %= mod\n return res\n \n \n for i in range(2,n+1):\n dp.append(check(i))\n cum.append((cum[-1]+dp[-1])%mod)\n \n print(dp[-1])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 22 }, { "user_id": "u736470924", "problem_id": "p02549", "submission1_id": "s866113129", "submission2_id": "s064404608", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def resolve():\n n, k = map(int, input().split())\n S = []\n for _ in range(k):\n l1, r1 = map(int, input().split())\n S.append(l1)\n S.append(r1)\n S = list(set(S))\n\n dp = [[0 for i in range(n + 1)] for j in range(len(S) + 1)]\n for i in range(len(S) + 1):\n dp[i][1] = 1\n for i in range(1, len(S) + 1):\n for j in range(2, n + 1):\n if j - S[i - 1] >= 0 and dp[i][j - S[i - 1]] > 0:\n dp[i][j] = dp[i][j - S[i - 1]] + dp[i - 1][j]\n else:\n dp[i][j] = dp[i - 1][j]\n\n print(dp[-1][n] % 998244353)\n\nresolve()\n", "code2": "def resolve():\n n, k = map(int, input().split())\n S = []\n L, R = [], []\n for _ in range(k):\n l1, r1 = map(int, input().split())\n L.append(l1)\n R.append(r1)\n\n dp = [0 for i in range(n + 1)]\n dpsum = [0 for i in range(n + 1)]\n dp[1] = 1\n dpsum[1] = 1\n for i in range(2, n + 1):\n for j in range(k):\n Li = i - R[j]\n Ri = i - L[j]\n if Ri < 0:\n continue\n Li = max(1, Li)\n dp[i] += dpsum[Ri] - dpsum[Li - 1] \n dp[i] %= 998244353\n\n dpsum[i] = (dpsum[i - 1] + dp[i]) % 998244353\n\n print(dp[n])\n\nresolve()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600548185", "date2": "1600700981", "bleu_score": "0.7205831128517812", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0], "code1_test_score": 11, "total_score": 102, "input": "10 1\n1 0\n7 17\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["def resolve(): # (0): resolve=\n n, k = map(int, input().split()) # (2): k=1, n=10\n S = [] # (3): S=[]\n for _ in range(k): # (4): _=0 (8): NO CHANGE\n l1, r1 = map(int, input().split()) # (5): l1=1, r1=0\n S.append(l1) # (6): S=[1]\n S.append(r1) # (7): S=[1, 0]\n S = list(set(S)) # (9): S=[0, 1]\n\n dp = [[0 for i in range(n + 1)] for j in range(len(S) + 1)] # (10): dp\n for i in range(len(S) + 1): # (11): i=0 (13): i=1 ... (17): NO CHANGE\n dp[i][1] = 1 # (12): dp=[[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]] (14): dp (16): dp\n for i in range(1, len(S) + 1): # (18): i=1 (47): i=2 (76): NO CHANGE\n for j in range(2, n + 1): # (19): j=2 (22): j=3 ... (75): NO CHANGE\n if j - S[i - 1] >= 0 and dp[i][j - S[i - 1]] > 0: # (20): NO CHANGE (23): NO CHANGE ... (73): NO CHANGE\n dp[i][j] = dp[i][j - S[i - 1]] + dp[i - 1][j] # (50): dp (53): dp ... (74): dp\n else:\n dp[i][j] = dp[i - 1][j] # (21): NO CHANGE (24): NO CHANGE ... (45): NO CHANGE\n\n print(dp[-1][n] % 998244353)\n\nresolve() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " def resolve():\n n, k = map(int, input().split())\n S = []\n+ L, R = [], []\n for _ in range(k):\n l1, r1 = map(int, input().split())\n- S.append(l1)\n- S.append(r1)\n- S = list(set(S))\n+ L.append(l1)\n+ R.append(r1)\n \n- dp = [[0 for i in range(n + 1)] for j in range(len(S) + 1)]\n- for i in range(len(S) + 1):\n- dp[i][1] = 1\n- for i in range(1, len(S) + 1):\n- for j in range(2, n + 1):\n- if j - S[i - 1] >= 0 and dp[i][j - S[i - 1]] > 0:\n- dp[i][j] = dp[i][j - S[i - 1]] + dp[i - 1][j]\n- else:\n- dp[i][j] = dp[i - 1][j]\n+ dp = [0 for i in range(n + 1)]\n+ dpsum = [0 for i in range(n + 1)]\n+ dp[1] = 1\n+ dpsum[1] = 1\n+ for i in range(2, n + 1):\n+ for j in range(k):\n+ Li = i - R[j]\n+ Ri = i - L[j]\n+ if Ri < 0:\n+ continue\n+ Li = max(1, Li)\n+ dp[i] += dpsum[Ri] - dpsum[Li - 1] \n+ dp[i] %= 998244353\n \n- print(dp[-1][n] % 998244353)\n+ dpsum[i] = (dpsum[i - 1] + dp[i]) % 998244353\n \n-resolve()\n+ print(dp[n])\n \n+resolve()\n", "FL_content": " def resolve():\n n, k = map(int, input().split())\n S = []\n for _ in range(k):\n l1, r1 = map(int, input().split())\n- S.append(l1)\n- S.append(r1)\n- S = list(set(S))\n \n- dp = [[0 for i in range(n + 1)] for j in range(len(S) + 1)]\n- for i in range(len(S) + 1):\n- dp[i][1] = 1\n- for i in range(1, len(S) + 1):\n- for j in range(2, n + 1):\n- if j - S[i - 1] >= 0 and dp[i][j - S[i - 1]] > 0:\n- dp[i][j] = dp[i][j - S[i - 1]] + dp[i - 1][j]\n- else:\n- dp[i][j] = dp[i - 1][j]\n \n- print(dp[-1][n] % 998244353)\n \n-resolve()\n \n", "added_lines": 19, "removed_lines": 14, "code1_lines": 23 }, { "user_id": "u763550415", "problem_id": "p02549", "submission1_id": "s296378125", "submission2_id": "s058759485", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int, input().split())\n\nL = []\nR = []\n\nfor _ in range(K):\n l, r = map(int, input().split())\n L.append(l)\n R.append(r)\n \ndp = [0]*(N+5)\ndp[1] = 1\n\nfor i in range(2, N+1):\n dp[i] = dp[i-1]\n for j in range(K):\n if i-L[j] >= 0:\n dp[i] += dp[i-L[j]]\n if i-R[j]-1 >= 0:\n dp[i] -= dp[i-R[j]-1]\n dp[i] %= 998244353\n \nprint(dp[N]-dp[N-1])", "code2": "N, K = map(int, input().split())\n\nL = []\nR = []\n\nfor _ in range(K):\n l, r = map(int, input().split())\n L.append(l)\n R.append(r)\n \ndp = [0]*(N+5)\ndp[1] = 1\n\nfor i in range(2, N+1):\n dp[i] = dp[i-1]\n for j in range(K):\n if i-L[j] >= 0:\n dp[i] += dp[i-L[j]]\n if i-R[j]-1 >= 0:\n dp[i] -= dp[i-R[j]-1]\n dp[i] %= 998244353\n \nprint((dp[N]-dp[N-1])%998244353)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600583813", "date2": "1600583902", "bleu_score": "0.9662159996377548", "code1_test_status": [1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 81, "total_score": 102, "input": "93 3\n4 4\n3 4\n1 5\n", "actual_output": "-243342204\n", "expected_output": "754902149\n\n", "anno_code": ["N, K = map(int, input().split()) # (0): N=93, K=3\n\nL = [] # (1): L=[]\nR = [] # (2): R=[]\n\nfor _ in range(K): # (3): _=0 (7): _=1 ... (15): NO CHANGE\n l, r = map(int, input().split()) # (4): l=4, r=4 (8): l=3 (12): l=1, r=5\n L.append(l) # (5): L=[4] (9): L=[4, 3] (13): L=[4, 3, 1]\n R.append(r) # (6): R=[4] (10): R=[4, 4] (14): R=[4, 4, 5]\n \ndp = [0]*(N+5) # (16): dp=[0, 0, ..., 0, 0]\ndp[1] = 1 # (17): dp=[0, 1, ..., 0, 0]\n\nfor i in range(2, N+1): # (18): i=2 (34): i=3 ... (1937): NO CHANGE\n dp[i] = dp[i-1] # (19): dp=[0, 1, ..., 0, 0] (35): dp=[0, 1, ..., 0, 0] ... (1917): dp=[0, 1, ..., 0, 0]\n for j in range(K): # (20): j=0 (24): j=1 ... (1936): NO CHANGE\n if i-L[j] >= 0: # (21): NO CHANGE (25): NO CHANGE ... (1931): NO CHANGE\n dp[i] += dp[i-L[j]] # (30): dp=[0, 1, ..., 0, 0] (42): NO CHANGE ... (1932): dp=[0, 1, ..., 0, 0]\n if i-R[j]-1 >= 0: # (22): NO CHANGE (26): NO CHANGE ... (1933): NO CHANGE\n dp[i] -= dp[i-R[j]-1] # (75): NO CHANGE (81): NO CHANGE ... (1934): dp=[0, 1, ..., 0, 0]\n dp[i] %= 998244353 # (23): NO CHANGE (27): NO CHANGE ... (1935): NO CHANGE\n \nprint(dp[N]-dp[N-1])"], "anno_status": [true], "diff_content": " N, K = map(int, input().split())\n \n L = []\n R = []\n \n for _ in range(K):\n l, r = map(int, input().split())\n L.append(l)\n R.append(r)\n \n dp = [0]*(N+5)\n dp[1] = 1\n \n for i in range(2, N+1):\n dp[i] = dp[i-1]\n for j in range(K):\n if i-L[j] >= 0:\n dp[i] += dp[i-L[j]]\n if i-R[j]-1 >= 0:\n dp[i] -= dp[i-R[j]-1]\n dp[i] %= 998244353\n \n-print(dp[N]-dp[N-1])\n+print((dp[N]-dp[N-1])%998244353)\n", "FL_content": " N, K = map(int, input().split())\n \n L = []\n R = []\n \n for _ in range(K):\n l, r = map(int, input().split())\n L.append(l)\n R.append(r)\n \n dp = [0]*(N+5)\n dp[1] = 1\n \n for i in range(2, N+1):\n dp[i] = dp[i-1]\n for j in range(K):\n if i-L[j] >= 0:\n dp[i] += dp[i-L[j]]\n if i-R[j]-1 >= 0:\n dp[i] -= dp[i-R[j]-1]\n dp[i] %= 998244353\n \n-print(dp[N]-dp[N-1])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 23 }, { "user_id": "u419978514", "problem_id": "p02555", "submission1_id": "s651780798", "submission2_id": "s557544618", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=int(input())\na=[0]*2001\nx=(10**9)+7\nif s<3:\n print(0)\n exit()\n \nelif 3<=x<6:\n for i in range(3,6):\n a[i]=1\n \nelse:\n for i in range(6,2001):\n a[i]=(sum(a[3:i-2])+1)%(x)\n\nprint(a[s])\n ", "code2": "s=int(input())\na=[0]*2001\nx=(10**9)+7\nif s<3:\n print(0)\n exit()\n\n \nelse:\n\n for i in range(3,6):\n a[i]=1\n\n for i in range(6,2001):\n a[i]=(sum(a[3:i-2])+1)%(x)\n\nprint(a[s])\n \n\n\n\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600035219", "date2": "1600035569", "bleu_score": "0.8821031678115925", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "1175\n", "actual_output": "248010664\n", "expected_output": "531468532\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " s=int(input())\n a=[0]*2001\n x=(10**9)+7\n if s<3:\n- print(0)\n- exit()\n- \n-elif 3<=x<6:\n- for i in range(3,6):\n- a[i]=1\n+ print(0)\n+ exit()\n+\n \n else:\n- for i in range(6,2001):\n- a[i]=(sum(a[3:i-2])+1)%(x)\n+\n+ for i in range(3,6):\n+ a[i]=1\n+\n+ for i in range(6,2001):\n+ a[i]=(sum(a[3:i-2])+1)%(x)\n \n print(a[s])\n \n+\n+\n+\n+\n", "FL_content": " s=int(input())\n a=[0]*2001\n x=(10**9)+7\n if s<3:\n- print(0)\n- exit()\n- \n-elif 3<=x<6:\n- for i in range(3,6):\n- a[i]=1\n \n else:\n- for i in range(6,2001):\n- a[i]=(sum(a[3:i-2])+1)%(x)\n \n print(a[s])\n \n", "added_lines": 13, "removed_lines": 8, "code1_lines": 17 }, { "user_id": "u306033313", "problem_id": "p02555", "submission1_id": "s753545340", "submission2_id": "s081808320", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = int(input())\n\ntable = [1, 0, 0]\nfor i in range(s):\n table.append(table[i]+table[i+2])\nprint(table[s])", "code2": "s = int(input())\nmod = 10**9+7\ntable = [1, 0, 0]\nfor i in range(s):\n table.append((table[i]+table[i+2])%mod)\nprint(table[s])", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600030705", "date2": "1600030778", "bleu_score": "0.821303075905733", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "1729\n", "actual_output": "20623129494060967456366223709273865563628093762746947890246341055212602771464188569813325316144677694087201739670918472849917544924566330064252812731523016425621144482930837956507880328589243453432111379713861047677638988102574174614354113225747243223940031366884262872309431202186642723\n", "expected_output": "294867501\n", "anno_code": ["s = int(input()) # (0): s=1729\n\ntable = [1, 0, 0] # (1): table=[1, 0, 0]\nfor i in range(s): # (2): i=0 (4): i=1 ... (3460): NO CHANGE\n table.append(table[i]+table[i+2]) # (3): table=[1, 0, 0, 1] (5): table=[1, 0, 0, 1, 1] ... (3459): table=[1, 0, ..., 30224665297765039814071651529294462452793653337596892457982477637171710485383846517629403730764295636737347632055091798655949032796115823857085541275559685577862198670350104381365668379732088814037584830338290786198341055922374357763259701560260902874027969790102344412578234382460300720, 44296399953508511098554639096449937117554579571539729292285129929520296930954554211876262939544448605779249970807983243176012087225003797184772736655568126685831784932343000648044937709928622094187856034378070372539935323865389973396807931418475519679791421540866912521126968788410382398]\nprint(table[s])"], "anno_status": [true], "diff_content": " s = int(input())\n-\n+mod = 10**9+7\n table = [1, 0, 0]\n for i in range(s):\n- table.append(table[i]+table[i+2])\n+ table.append((table[i]+table[i+2])%mod)\n print(table[s])\n", "FL_content": " s = int(input())\n-\n table = [1, 0, 0]\n for i in range(s):\n- table.append(table[i]+table[i+2])\n print(table[s])\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u060432908", "problem_id": "p02555", "submission1_id": "s037035981", "submission2_id": "s085563363", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=int(input())\na=[0]*(s+1)\na[0]=1\nfor i in range(3,s+1):\n a[i]=a[i-3]+a[i-1]\nprint(a[s])\n", "code2": "s=int(input())\na=[0]*(s+1)\na[0]=1\nmod=10**9+7\nfor i in range(3,s+1):\n a[i]=a[i-3]+a[i-1]\nprint(a[s]%mod)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600282749", "date2": "1600282794", "bleu_score": "0.8306469110815197", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "1175\n", "actual_output": "222082587837603619274593483203391180802037866641192048751248765122136742137783076324009281892235152635363849727350867532428947938145250190943173841430893752789035492017850556523457835441497662096\n", "expected_output": "531468532\n\n", "anno_code": ["s=int(input()) # (0): s=1175\na=[0]*(s+1) # (1): a=[0, 0, ..., 0, 0]\na[0]=1 # (2): a=[1, 0, ..., 0, 0]\nfor i in range(3,s+1): # (3): i=3 (5): i=4 ... (2349): NO CHANGE\n a[i]=a[i-3]+a[i-1] # (4): a=[1, 0, ..., 0, 0] (6): a=[1, 0, ..., 0, 0] ... (2348): a=[1, 0, ..., 151533124427675273326248664315745577724209644216272302728291518006463361373946705970034209568937249497738664313353291116196259709064772797621455304105994055257351873614134613660044963440038854511, 222082587837603619274593483203391180802037866641192048751248765122136742137783076324009281892235152635363849727350867532428947938145250190943173841430893752789035492017850556523457835441497662096]\nprint(a[s])\n"], "anno_status": [true], "diff_content": " s=int(input())\n a=[0]*(s+1)\n a[0]=1\n+mod=10**9+7\n for i in range(3,s+1):\n a[i]=a[i-3]+a[i-1]\n-print(a[s])\n+print(a[s]%mod)\n \n", "FL_content": " s=int(input())\n a=[0]*(s+1)\n a[0]=1\n for i in range(3,s+1):\n a[i]=a[i-3]+a[i-1]\n-print(a[s])\n \n", "added_lines": 2, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u919274345", "problem_id": "p02555", "submission1_id": "s008345070", "submission2_id": "s810728712", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = int(input())\n\na = [0] * 2000\na[0] = 0\na[1] = 0\na[2] = 1\na[3] = 1\na[4] = 1\na[5] = 2\nk = 0\nfor i in range(6, S):\n for l in range(2, i-2):\n k += a[l]\n a[i] = 1 + k\n \np = a[S-1] % (10**9 + 7)\nprint(p)", "code2": "S = int(input())\n\na = [0] * 2000\na[0] = 0\na[1] = 0\na[2] = 1\na[3] = 1\na[4] = 1\na[5] = 2\n\nfor i in range(6, S):\n k = 0\n for l in range(2, i-2):\n k += a[l]\n a[i] = 1 + k\n \np = a[S-1] % (10**9 + 7)\nprint(p)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600160823", "date2": "1600161077", "bleu_score": "0.9746032653923553", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "1175\n", "actual_output": "604218241\n", "expected_output": "531468532\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " S = int(input())\n \n a = [0] * 2000\n a[0] = 0\n a[1] = 0\n a[2] = 1\n a[3] = 1\n a[4] = 1\n a[5] = 2\n-k = 0\n+\n for i in range(6, S):\n+ k = 0\n for l in range(2, i-2):\n k += a[l]\n a[i] = 1 + k\n \n p = a[S-1] % (10**9 + 7)\n print(p)\n", "FL_content": " S = int(input())\n \n a = [0] * 2000\n a[0] = 0\n a[1] = 0\n a[2] = 1\n a[3] = 1\n a[4] = 1\n a[5] = 2\n-k = 0\n for i in range(6, S):\n for l in range(2, i-2):\n k += a[l]\n a[i] = 1 + k\n \n p = a[S-1] % (10**9 + 7)\n print(p)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 17 }, { "user_id": "u265506056", "problem_id": "p02555", "submission1_id": "s339144390", "submission2_id": "s067874684", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S=int(input())\nMOD=10**9+7\ndp=[0]*(S+1)\ndp[0]=1\nfor i in range(1,S+1):\n for j in range(0,S-2):\n dp[i]+=dp[j]\n dp[i]%=MOD\nprint(dp[S])", "code2": "S=int(input())\nMOD=10**9+7\ndp=[0]*(S+1)\ndp[0]=1\nfor i in range(1,S+1):\n for j in range(0,i-2):\n dp[i]+=dp[j]\n dp[i]%=MOD\nprint(dp[S])", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600072029", "date2": "1600072256", "bleu_score": "0.9830775224759908", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "1175\n", "actual_output": "245605920\n", "expected_output": "531468532\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " S=int(input())\n MOD=10**9+7\n dp=[0]*(S+1)\n dp[0]=1\n for i in range(1,S+1):\n- for j in range(0,S-2):\n+ for j in range(0,i-2):\n dp[i]+=dp[j]\n dp[i]%=MOD\n print(dp[S])\n", "FL_content": " S=int(input())\n MOD=10**9+7\n dp=[0]*(S+1)\n dp[0]=1\n for i in range(1,S+1):\n- for j in range(0,S-2):\n dp[i]+=dp[j]\n dp[i]%=MOD\n print(dp[S])\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u054825571", "problem_id": "p02555", "submission1_id": "s203892706", "submission2_id": "s222599350", "status1": "Wrong Answer", "status2": "Accepted", "code1": "mod=10**9+7\n\nS=int(input())\nans=0\nL=[-1]*(S+1)\n\ndef f(n):\n if n==0:\n return 1\n elif n<0:\n return 0\n elif L[n]!=-1:\n return L[n]\n else:\n tmp=0\n for i in range(3,10):\n tmp+=f(n-i)\n L[n]=tmp%mod\n return L[n]\nprint(f(S))", "code2": "mod=10**9+7\n\nS=int(input())\nans=0\nL=[-1]*(S+1)\n\ndef f(n):\n if n==0:\n return 1\n elif n<0:\n return 0\n elif L[n]!=-1:\n return L[n]\n else:\n tmp=0\n for i in range(3,n+1):\n tmp+=f(n-i)\n L[n]=tmp\n return tmp\nprint(f(S)%mod)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600028832", "date2": "1600030631", "bleu_score": "0.9569698781029342", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "1729\n", "actual_output": "332215981\n", "expected_output": "294867501\n", "anno_code": ["mod=10**9+7 # (0): mod=1000000007\n\nS=int(input()) # (1): S=1729\nans=0 # (2): ans=0\nL=[-1]*(S+1) # (3): L=[-1, -1, ..., -1, -1]\n\ndef f(n): # (4): f=\n if n==0: # (6): NO CHANGE (12): NO CHANGE ... (65581): NO CHANGE\n return 1\n elif n<0: # (7): NO CHANGE (13): NO CHANGE ... (65582): NO CHANGE\n return 0\n elif L[n]!=-1: # (8): NO CHANGE (14): NO CHANGE ... (65583): n=1729, tmp=3332216002, i=9\n return L[n]\n else:\n tmp=0 # (9): tmp=0 (15): tmp=0 ... (65526): tmp=0\n for i in range(3,10): # (10): i=3 (16): i=3 ... (65584): NO CHANGE\n tmp+=f(n-i) # (11): n=1726 (17): n=1723 ... (65580): n=1720\n L[n]=tmp%mod # (3495): n=4, i=3 (3520): n=7, i=3 ... (65563): n=1729, tmp=1926896794, i=5\n return L[n]\nprint(f(S)) # (5): n=1729\n"], "anno_status": [true], "diff_content": " mod=10**9+7\n \n S=int(input())\n ans=0\n L=[-1]*(S+1)\n \n def f(n):\n if n==0:\n return 1\n elif n<0:\n return 0\n elif L[n]!=-1:\n return L[n]\n else:\n tmp=0\n- for i in range(3,10):\n+ for i in range(3,n+1):\n tmp+=f(n-i)\n- L[n]=tmp%mod\n- return L[n]\n-print(f(S))\n+ L[n]=tmp\n+ return tmp\n+print(f(S)%mod)\n", "FL_content": " mod=10**9+7\n \n S=int(input())\n ans=0\n L=[-1]*(S+1)\n \n def f(n):\n if n==0:\n return 1\n elif n<0:\n return 0\n elif L[n]!=-1:\n return L[n]\n else:\n tmp=0\n- for i in range(3,10):\n tmp+=f(n-i)\n- L[n]=tmp%mod\n- return L[n]\n-print(f(S))\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 20 }, { "user_id": "u539953365", "problem_id": "p02555", "submission1_id": "s111268184", "submission2_id": "s241210603", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import comb\nmod = 10**9 + 7\ns = 1729\nans = 0\nn = 1\nwhile s - 2*n - 1 >= 0:\n ans += comb(s-2*n-1, n-1)\n ans %= mod\n n += 1\nprint(ans)", "code2": "from math import comb\nmod = 10**9 + 7\ns = int(input())\nans = 0\nn = 1\nwhile s - 2*n - 1 >= 0:\n ans += comb(s-2*n-1, n-1)\n ans %= mod\n n += 1\nprint(ans)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600028600", "date2": "1600028706", "bleu_score": "0.9084304021611308", "code1_test_status": [0, 1], "code1_test_score": 1, "total_score": 2, "input": "1175\n", "actual_output": "294867501\n", "expected_output": "531468532\n\n", "anno_code": ["from math import comb\nmod = 10**9 + 7 # (0): mod=1000000007\ns = 1729 # (1): s=1729\nans = 0 # (2): ans=0\nn = 1 # (3): n=1\nwhile s - 2*n - 1 >= 0: # (4): NO CHANGE (8): NO CHANGE ... (3460): NO CHANGE\n ans += comb(s-2*n-1, n-1) # (5): ans=1 (9): ans=1725 ... (3457): NO CHANGE\n ans %= mod # (6): NO CHANGE (10): NO CHANGE ... (3458): NO CHANGE\n n += 1 # (7): n=2 (11): n=3 ... (3459): n=865\nprint(ans)"], "anno_status": [true], "diff_content": " from math import comb\n mod = 10**9 + 7\n-s = 1729\n+s = int(input())\n ans = 0\n n = 1\n while s - 2*n - 1 >= 0:\n ans += comb(s-2*n-1, n-1)\n ans %= mod\n n += 1\n print(ans)\n+\n", "FL_content": " from math import comb\n mod = 10**9 + 7\n-s = 1729\n ans = 0\n n = 1\n while s - 2*n - 1 >= 0:\n ans += comb(s-2*n-1, n-1)\n ans %= mod\n n += 1\n print(ans)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u540877546", "problem_id": "p02555", "submission1_id": "s112626191", "submission2_id": "s455042677", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nn = int(input())\nmod = 10**9+7\ndp = [0]*(n+1)\nfor j in range(3, 10):\n if j <= n:\n dp[j] = 1\n\nfor i in range(3, n+1):\n for j in range(3, 10):\n if i+j <= n:\n dp[i+j] += dp[i]\n dp[i+j] %= mod\nprint(dp[-1])\n", "code2": "n = int(input())\nmod = 10**9+7\ndp = [1]*(n+1)\nif n <= 2:\n print(0)\n exit()\nfor i in range(3):\n dp[i] = 0\n\nfor j in range(3, 10):\n if j <= n:\n dp[j] = 1\n\nfor i in range(3, n+1):\n for j in range(3, n):\n if i+j <= n:\n dp[i+j] += dp[i]\n dp[i+j] %= mod\nprint(dp[-1])\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600029892", "date2": "1600109804", "bleu_score": "0.7654755624715855", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "1175\n", "actual_output": "778758794\n", "expected_output": "531468532\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": "-\n n = int(input())\n mod = 10**9+7\n-dp = [0]*(n+1)\n+dp = [1]*(n+1)\n+if n <= 2:\n+ print(0)\n+ exit()\n+for i in range(3):\n+ dp[i] = 0\n+\n for j in range(3, 10):\n if j <= n:\n dp[j] = 1\n \n for i in range(3, n+1):\n- for j in range(3, 10):\n+ for j in range(3, n):\n if i+j <= n:\n dp[i+j] += dp[i]\n dp[i+j] %= mod\n print(dp[-1])\n \n", "FL_content": "-\n n = int(input())\n mod = 10**9+7\n-dp = [0]*(n+1)\n for j in range(3, 10):\n if j <= n:\n dp[j] = 1\n \n for i in range(3, n+1):\n- for j in range(3, 10):\n if i+j <= n:\n dp[i+j] += dp[i]\n dp[i+j] %= mod\n print(dp[-1])\n \n", "added_lines": 8, "removed_lines": 3, "code1_lines": 15 }, { "user_id": "u008992227", "problem_id": "p02555", "submission1_id": "s933378712", "submission2_id": "s957547756", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import trunc\nimport sys\nimport copy\nfrom collections import deque\nimport collections\nimport itertools\nstdin = sys.stdin\nimport math\n\nmod = 10**9+7\n\nni = lambda: int(ns())\nna = lambda: list(map(int, stdin.readline().split()))\nns = lambda: stdin.readline().rstrip() \n\nn = ni()\n\nmax_div = n\n\nif n < 3:\n print(0)\n exit(0)\nelif n < 6:\n print(1)\n exit(0)\nelif n < 9:\n print(n-4)\n exit(0)\n \n\ns123 = [i for i in range(1, n-7)]\n\nans = n-4\nfor i in range(0, max_div-2):\n tmp = sum(s123[0:len(s123)-i*3])\n ans += tmp\n ans %= mod\n\nprint(ans)\n\n", "code2": "from math import trunc\nimport sys\nimport copy\nfrom collections import deque\nimport collections\nimport itertools\nstdin = sys.stdin\nimport math\n\nmod = 10**9+7\n\nni = lambda: int(ns())\nna = lambda: list(map(int, stdin.readline().split()))\nns = lambda: stdin.readline().rstrip() \n\nn = ni()\n\ns = [0 for _ in range(2001)]\ns[0] = 1\ns[3] = 1\ns[4] = 1\ns[5] = 1\n\nif n < 6:\n print(s[n])\n exit(0)\n\nfor i in range(6, 2001):\n s[i] = s[i-3] + s[i-1]\n s[i] %= mod\n if i==n:\n break\n\nprint(s[n])\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600029608", "date2": "1600031888", "bleu_score": "0.7059585764539151", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "1729\n", "actual_output": "567853324\n", "expected_output": "294867501\n", "anno_code": ["from math import trunc\nimport sys\nimport copy\nfrom collections import deque\nimport collections\nimport itertools\nstdin = sys.stdin # (0): stdin=<_io.TextIOWrapper name='../../test/autoComment2\\\\Dev\\\\p02555\\\\input_s933378712.txt' mode='r' encoding='utf-8'>, math=\nimport math\n\nmod = 10**9+7 # (1): mod=1000000007\n\nni = lambda: int(ns()) # (2): ni= at 0x000002187CAC9BD0>\nna = lambda: list(map(int, stdin.readline().split())) # (3): na= at 0x000002187CAC9B40>\nns = lambda: stdin.readline().rstrip() # (4): ns= at 0x000002187CAC9C60>\n\nn = ni() # (5): n=1729\n\nmax_div = n # (6): max_div=1729\n\nif n < 3: # (7): NO CHANGE\n print(0)\n exit(0)\nelif n < 6: # (8): NO CHANGE\n print(1)\n exit(0)\nelif n < 9: # (9): NO CHANGE\n print(n-4)\n exit(0)\n \n\ns123 = [i for i in range(1, n-7)] # (10): s123=[1, 2, ..., 1720, 1721]\n\nans = n-4 # (11): ans=1725\nfor i in range(0, max_div-2): # (12): i=0 (16): i=1 ... (6920): NO CHANGE\n tmp = sum(s123[0:len(s123)-i*3]) # (13): tmp=1481781 (17): tmp=1476621 ... (6917): NO CHANGE\n ans += tmp # (14): ans=1483506 (18): ans=2960127 ... (6918): NO CHANGE\n ans %= mod # (15): NO CHANGE (19): NO CHANGE ... (6919): NO CHANGE\n\nprint(ans)\n\n"], "anno_status": [true], "diff_content": " from math import trunc\n import sys\n import copy\n from collections import deque\n import collections\n import itertools\n stdin = sys.stdin\n import math\n \n mod = 10**9+7\n \n ni = lambda: int(ns())\n na = lambda: list(map(int, stdin.readline().split()))\n ns = lambda: stdin.readline().rstrip() \n \n n = ni()\n \n-max_div = n\n-\n-if n < 3:\n- print(0)\n- exit(0)\n-elif n < 6:\n- print(1)\n- exit(0)\n-elif n < 9:\n- print(n-4)\n+s = [0 for _ in range(2001)]\n+s[0] = 1\n+s[3] = 1\n+s[4] = 1\n+s[5] = 1\n+\n+if n < 6:\n+ print(s[n])\n exit(0)\n- \n-\n-s123 = [i for i in range(1, n-7)]\n-\n-ans = n-4\n-for i in range(0, max_div-2):\n- tmp = sum(s123[0:len(s123)-i*3])\n- ans += tmp\n- ans %= mod\n \n-print(ans)\n+for i in range(6, 2001):\n+ s[i] = s[i-3] + s[i-1]\n+ s[i] %= mod\n+ if i==n:\n+ break\n \n+print(s[n])\n \n", "FL_content": " from math import trunc\n import sys\n import copy\n from collections import deque\n import collections\n import itertools\n stdin = sys.stdin\n import math\n \n mod = 10**9+7\n \n ni = lambda: int(ns())\n na = lambda: list(map(int, stdin.readline().split()))\n ns = lambda: stdin.readline().rstrip() \n \n n = ni()\n \n-max_div = n\n-\n-if n < 3:\n- print(0)\n- exit(0)\n-elif n < 6:\n- print(1)\n- exit(0)\n-elif n < 9:\n- print(n-4)\n exit(0)\n- \n-\n-s123 = [i for i in range(1, n-7)]\n-\n-ans = n-4\n-for i in range(0, max_div-2):\n- tmp = sum(s123[0:len(s123)-i*3])\n- ans += tmp\n- ans %= mod\n \n-print(ans)\n \n \n", "added_lines": 14, "removed_lines": 20, "code1_lines": 41 }, { "user_id": "u762540523", "problem_id": "p02555", "submission1_id": "s511654012", "submission2_id": "s299370028", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def resolve():\n mod = 10 ** 9 + 7\n s = int(input())\n dp = [0] * (s + 1)\n dp[s] = 1\n for i in range(s, 2, -1):\n dp[i] %= mod\n for j in range(3, 10):\n if i - j >= 0:\n dp[i - j] += dp[i]\n print(dp[0] % mod)\n\n\nif __name__ == '__main__':\n resolve()\n", "code2": "def resolve():\n mod = 10 ** 9 + 7\n s = int(input())\n dp = [0] * (s + 1)\n dp[s] = 1\n for i in range(s, 2, -1):\n dp[i] %= mod\n for j in range(3, i + 1):\n dp[i - j] += dp[i]\n print(dp[0] % mod)\n\n\nif __name__ == '__main__':\n resolve()\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600030815", "date2": "1600030942", "bleu_score": "0.8890139612402265", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "1175\n", "actual_output": "778758794\n", "expected_output": "531468532\n\n", "anno_code": ["def resolve(): # (0): resolve=\n mod = 10 ** 9 + 7\n s = int(input())\n dp = [0] * (s + 1)\n dp[s] = 1\n for i in range(s, 2, -1):\n dp[i] %= mod\n for j in range(3, 10):\n if i - j >= 0:\n dp[i - j] += dp[i]\n print(dp[0] % mod)\n\n\nif __name__ == '__main__':\n resolve()\n"], "anno_status": [true], "diff_content": " def resolve():\n mod = 10 ** 9 + 7\n s = int(input())\n dp = [0] * (s + 1)\n dp[s] = 1\n for i in range(s, 2, -1):\n dp[i] %= mod\n- for j in range(3, 10):\n- if i - j >= 0:\n- dp[i - j] += dp[i]\n+ for j in range(3, i + 1):\n+ dp[i - j] += dp[i]\n print(dp[0] % mod)\n \n \n if __name__ == '__main__':\n resolve()\n \n", "FL_content": " def resolve():\n mod = 10 ** 9 + 7\n s = int(input())\n dp = [0] * (s + 1)\n dp[s] = 1\n for i in range(s, 2, -1):\n dp[i] %= mod\n- for j in range(3, 10):\n- if i - j >= 0:\n- dp[i - j] += dp[i]\n print(dp[0] % mod)\n \n \n if __name__ == '__main__':\n resolve()\n \n", "added_lines": 2, "removed_lines": 3, "code1_lines": 16 }, { "user_id": "u533039576", "problem_id": "p02837", "submission1_id": "s713461682", "submission2_id": "s740830325", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ninfo = [[] for i in range(n)]\nfor i in range(n):\n a = int(input())\n info[i] = [tuple(map(int, input().split())) for _ in range(a)]\n\nans = 0\nfor bit in range(1 << n):\n flag = True\n cnt = 0\n for i in range(n):\n if (bit >> i) & 1:\n t = 0\n cnt += 1\n else:\n t = 1\n for x, y in info[i]:\n b = (bit >> (x - 1)) & 1\n if b != abs(t - y):\n flag = False\n break\n if not flag:\n break\n if flag:\n ans = max(ans, cnt)\n\nprint(ans)\n", "code2": "n = int(input())\ninfo = [[] for i in range(n)]\nfor i in range(n):\n a = int(input())\n info[i] = [tuple(map(int, input().split())) for _ in range(a)]\n\nans = 0\nfor bit in range(1 << n):\n flag = True\n cnt = 0\n for i in range(n):\n if (bit >> i) & 1:\n cnt += 1\n else:\n continue\n\n for x, y in info[i]:\n b = (bit >> (x - 1)) & 1\n if b != y:\n flag = False\n break\n if not flag:\n break\n if flag:\n ans = max(ans, cnt)\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575871266", "date2": "1575871425", "bleu_score": "0.9386825306794612", "code1_test_status": [1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1], "code1_test_score": 48, "total_score": 103, "input": "3\n2\n2 0\n3 0\n2\n3 2\n0 0\n2\n1 1\n1 1\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["n = int(input()) # (0): n=3\ninfo = [[] for i in range(n)] # (1): info\nfor i in range(n): # (2): i=0 (5): info, i=1 ... (11): NO CHANGE\n a = int(input()) # (3): a=2 (6): info (9): info\n info[i] = [tuple(map(int, input().split())) for _ in range(a)] # (4): info=[[(2, 0), (3, 0)], [], []] (7): info (10): info\n\nans = 0 # (12): ans=0\nfor bit in range(1 << n): # (13): bit=0 (27): bit=1 ... (158): NO CHANGE\n flag = True # (14): flag=True (28): flag=True ... (144): flag=True\n cnt = 0 # (15): cnt=0 (29): NO CHANGE ... (145): cnt=0\n for i in range(n): # (16): i=0 (30): NO CHANGE ... (146): i=0\n if (bit >> i) & 1: # (17): NO CHANGE (31): NO CHANGE ... (147): NO CHANGE\n t = 0 # (32): t=0 (75): t=0 ... (148): NO CHANGE\n cnt += 1 # (33): cnt=1 (76): cnt=1 ... (149): cnt=1\n else:\n t = 1 # (18): t=1 (44): t=1 ... (122): t=1\n for x, y in info[i]: # (19): x=2, y=0 (34): NO CHANGE ... (150): x=2, y=0\n b = (bit >> (x - 1)) & 1 # (20): b=0 (35): NO CHANGE ... (151): NO CHANGE\n if b != abs(t - y): # (21): NO CHANGE (36): NO CHANGE ... (152): NO CHANGE\n flag = False # (22): flag=False (48): flag=False ... (153): flag=False\n break # (23): NO CHANGE (49): NO CHANGE ... (154): NO CHANGE\n if not flag: # (24): NO CHANGE (41): NO CHANGE ... (155): NO CHANGE\n break # (25): NO CHANGE (51): NO CHANGE ... (156): NO CHANGE\n if flag: # (26): NO CHANGE (52): NO CHANGE ... (157): NO CHANGE\n ans = max(ans, cnt)\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " n = int(input())\n info = [[] for i in range(n)]\n for i in range(n):\n a = int(input())\n info[i] = [tuple(map(int, input().split())) for _ in range(a)]\n \n ans = 0\n for bit in range(1 << n):\n flag = True\n cnt = 0\n for i in range(n):\n if (bit >> i) & 1:\n- t = 0\n cnt += 1\n else:\n- t = 1\n+ continue\n+\n for x, y in info[i]:\n b = (bit >> (x - 1)) & 1\n- if b != abs(t - y):\n+ if b != y:\n flag = False\n break\n if not flag:\n break\n if flag:\n ans = max(ans, cnt)\n \n print(ans)\n \n", "FL_content": " n = int(input())\n info = [[] for i in range(n)]\n for i in range(n):\n a = int(input())\n info[i] = [tuple(map(int, input().split())) for _ in range(a)]\n \n ans = 0\n for bit in range(1 << n):\n flag = True\n cnt = 0\n for i in range(n):\n if (bit >> i) & 1:\n- t = 0\n cnt += 1\n else:\n- t = 1\n for x, y in info[i]:\n b = (bit >> (x - 1)) & 1\n- if b != abs(t - y):\n flag = False\n break\n if not flag:\n break\n if flag:\n ans = max(ans, cnt)\n \n print(ans)\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 28 }, { "user_id": "u129749062", "problem_id": "p02837", "submission1_id": "s172500670", "submission2_id": "s337302246", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list()\nxy = list()\nflag = True\nnum = 0\noutput=0\nfor i in range(N):\n A.append(int(input()))\n xy.append([list(map(int,input().split())) for _ in range(A[i])])\nfor i in range(2**len(A)):\n flag = True\n num = str(format(i, 'b').zfill(len(A)))\n for j in range(len(A)):\n if ((i>>j)&1) == 1:\n for k in range(len(xy[len(A)-j-1])):\n if int(num[xy[len(A)-1-j][k][0]-1]) != xy[len(A)-1-j][k][1]:\n flag = False\n elif ((i>>j)&1) == 0:\n for k in range(len(xy[len(A)-j-1])):\n if int(num[xy[len(A)-1-j][k][0]-1]) == xy[len(A)-1-j][k][1]:\n flag = False\n if flag == True and output <= str(bin(i)).count('1') :\n output = str(bin(i)).count('1')\nprint(output)\n ", "code2": "N = int(input())\nA = list()\nxy = list()\nflag = True\nnum = 0\noutput=0\nfor i in range(N):\n A.append(int(input()))\n xy.append([list(map(int,input().split())) for _ in range(A[i])])\n \nfor i in range(2**N):\n flag = True\n num = str(format(i, 'b').zfill(N))\n for j in range(N):\n if ((i>>j)&1) == 1:\n for k in range(len(xy[N-j-1])):\n if int(num[xy[N-1-j][k][0]-1]) != xy[N-1-j][k][1]:\n flag = False\n break\n if flag == False:\n break\n if flag == True and output <= str(bin(i)).count('1') :\n output = str(bin(i)).count('1')\nprint(output)\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589150280", "date2": "1589151042", "bleu_score": "0.7466857253527024", "code1_test_status": [1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1], "code1_test_score": 52, "total_score": 103, "input": "3\n2\n2 0\n3 0\n2\n3 1\n1 0\n2\n1 1\n0 0\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = list() # (1): A=[]\nxy = list() # (2): xy=[]\nflag = True # (3): flag=True\nnum = 0 # (4): num=0\noutput=0 # (5): output=0\nfor i in range(N): # (6): i=0 (9): i=1 ... (15): NO CHANGE\n A.append(int(input())) # (7): A=[2] (10): A=[2, 2] (13): A=[2, 2, 2]\n xy.append([list(map(int,input().split())) for _ in range(A[i])]) # (8): xy=[[[2, 0], [3, 0]]] (11): xy (14): xy\nfor i in range(2**len(A)): # (16): i=0 (49): i=1 ... (264): NO CHANGE\n flag = True # (17): NO CHANGE (50): flag=True ... (235): flag=True\n num = str(format(i, 'b').zfill(len(A))) # (18): num=000 (51): num=001 ... (236): num=111\n for j in range(len(A)): # (19): j=0 (28): j=1 ... (262): NO CHANGE\n if ((i>>j)&1) == 1: # (20): NO CHANGE (29): NO CHANGE ... (254): NO CHANGE\n for k in range(len(xy[len(A)-j-1])): # (54): k=0 (57): k=1 ... (261): NO CHANGE\n if int(num[xy[len(A)-1-j][k][0]-1]) != xy[len(A)-1-j][k][1]: # (55): NO CHANGE (58): NO CHANGE ... (259): NO CHANGE\n flag = False # (56): flag=False (59): NO CHANGE ... (260): NO CHANGE\n elif ((i>>j)&1) == 0: # (21): NO CHANGE (30): NO CHANGE ... (207): NO CHANGE\n for k in range(len(xy[len(A)-j-1])): # (22): k=0 (24): k=1 ... (214): NO CHANGE\n if int(num[xy[len(A)-1-j][k][0]-1]) == xy[len(A)-1-j][k][1]: # (23): NO CHANGE (25): NO CHANGE ... (212): NO CHANGE\n flag = False # (26): flag=False (35): NO CHANGE ... (213): NO CHANGE\n if flag == True and output <= str(bin(i)).count('1') : # (48): NO CHANGE (81): NO CHANGE ... (263): NO CHANGE\n output = str(bin(i)).count('1')\nprint(output)\n "], "anno_status": [true], "diff_content": " N = int(input())\n A = list()\n xy = list()\n flag = True\n num = 0\n output=0\n for i in range(N):\n A.append(int(input()))\n xy.append([list(map(int,input().split())) for _ in range(A[i])])\n-for i in range(2**len(A)):\n+ \n+for i in range(2**N):\n flag = True\n- num = str(format(i, 'b').zfill(len(A)))\n- for j in range(len(A)):\n+ num = str(format(i, 'b').zfill(N))\n+ for j in range(N):\n if ((i>>j)&1) == 1:\n- for k in range(len(xy[len(A)-j-1])):\n- if int(num[xy[len(A)-1-j][k][0]-1]) != xy[len(A)-1-j][k][1]:\n- flag = False\n- elif ((i>>j)&1) == 0:\n- for k in range(len(xy[len(A)-j-1])):\n- if int(num[xy[len(A)-1-j][k][0]-1]) == xy[len(A)-1-j][k][1]:\n+ for k in range(len(xy[N-j-1])):\n+ if int(num[xy[N-1-j][k][0]-1]) != xy[N-1-j][k][1]:\n flag = False\n+ break\n+ if flag == False:\n+ break\n if flag == True and output <= str(bin(i)).count('1') :\n output = str(bin(i)).count('1')\n print(output)\n \n", "FL_content": " N = int(input())\n A = list()\n xy = list()\n flag = True\n num = 0\n output=0\n for i in range(N):\n A.append(int(input()))\n xy.append([list(map(int,input().split())) for _ in range(A[i])])\n-for i in range(2**len(A)):\n flag = True\n- num = str(format(i, 'b').zfill(len(A)))\n- for j in range(len(A)):\n if ((i>>j)&1) == 1:\n- for k in range(len(xy[len(A)-j-1])):\n- if int(num[xy[len(A)-1-j][k][0]-1]) != xy[len(A)-1-j][k][1]:\n- flag = False\n- elif ((i>>j)&1) == 0:\n- for k in range(len(xy[len(A)-j-1])):\n- if int(num[xy[len(A)-1-j][k][0]-1]) == xy[len(A)-1-j][k][1]:\n flag = False\n if flag == True and output <= str(bin(i)).count('1') :\n output = str(bin(i)).count('1')\n print(output)\n \n", "added_lines": 9, "removed_lines": 9, "code1_lines": 25 }, { "user_id": "u698868214", "problem_id": "p02837", "submission1_id": "s935786951", "submission2_id": "s922364355", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nevidence = [[] for _ in range(N)]\nfor i in range(N):\n A = int(input())\n for _ in range(A):\n x,y = map(int,input().split())\n evidence[i].append((x-1,y))\nresult = 0\nfor j in range(1,2**N):\n consistent = True\n for k in range(N):\n if (j >> k) & 1 == 0:\n continue\n for x,y in evidence[k]:\n if (j >> x) & 1 != y:\n consistent = False\n break\n if not consistent:\n break\n else:\n result = max(result, bin(i)[2:].count(\"1\"))\nprint(result)", "code2": "N = int(input())\nevidence = [[] for _ in range(N)]\nfor i in range(N):\n A = int(input())\n for _ in range(A):\n x,y = map(int,input().split())\n evidence[i].append((x-1,y))\nresult = 0\nfor j in range(1,2**N):\n consistent = True\n for k in range(N):\n if (j >> k) & 1 == 0:\n continue\n for x,y in evidence[k]:\n if (j >> x) & 1 != y:\n consistent = False\n break\n if not consistent:\n break\n if consistent:\n result = max(result, bin(j)[2:].count(\"1\"))\nprint(result)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592775163", "date2": "1592775279", "bleu_score": "0.9676239038820383", "code1_test_status": [1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 61, "total_score": 103, "input": "3\n1\n3 1\n1\n2 1\n0\n1 0\n", "actual_output": "1\n", "expected_output": "3\n\n", "anno_code": ["N = int(input()) # (0): N=3\nevidence = [[] for _ in range(N)] # (1): evidence\nfor i in range(N): # (2): i=0 (8): evidence, i=1 ... (17): evidence\n A = int(input()) # (3): A=1 (9): evidence (15): evidence, A=0\n for _ in range(A): # (4): _=0 (7): evidence ... (16): evidence\n x,y = map(int,input().split()) # (5): x=3, y=1 (11): evidence, x=2\n evidence[i].append((x-1,y)) # (6): evidence (12): evidence\nresult = 0 # (18): evidence, result=0\nfor j in range(1,2**N): # (19): evidence, j=1 (29): evidence, j=2 ... (123): evidence\n consistent = True # (20): evidence, consistent=True (30): evidence, consistent=True ... (104): evidence\n for k in range(N): # (21): evidence, k=0 (31): evidence ... (121): evidence\n if (j >> k) & 1 == 0: # (22): evidence (32): evidence ... (118): evidence\n continue # (33): evidence (42): evidence ... (90): evidence\n for x,y in evidence[k]: # (23): evidence (36): evidence, x=1 ... (119): evidence\n if (j >> x) & 1 != y: # (24): evidence (37): evidence ... (114): evidence\n consistent = False # (25): evidence, consistent=False (51): evidence, consistent=False\n break # (26): evidence (52): evidence\n if not consistent: # (27): evidence (39): evidence ... (120): evidence\n break # (28): evidence (54): evidence\n else:\n result = max(result, bin(i)[2:].count(\"1\")) # (44): evidence, result=1 (68): evidence ... (122): evidence\nprint(result)"], "anno_status": [true], "diff_content": " N = int(input())\n evidence = [[] for _ in range(N)]\n for i in range(N):\n A = int(input())\n for _ in range(A):\n x,y = map(int,input().split())\n evidence[i].append((x-1,y))\n result = 0\n for j in range(1,2**N):\n consistent = True\n for k in range(N):\n if (j >> k) & 1 == 0:\n continue\n for x,y in evidence[k]:\n if (j >> x) & 1 != y:\n consistent = False\n break\n if not consistent:\n break\n- else:\n- result = max(result, bin(i)[2:].count(\"1\"))\n+ if consistent:\n+ result = max(result, bin(j)[2:].count(\"1\"))\n print(result)\n", "FL_content": " N = int(input())\n evidence = [[] for _ in range(N)]\n for i in range(N):\n A = int(input())\n for _ in range(A):\n x,y = map(int,input().split())\n evidence[i].append((x-1,y))\n result = 0\n for j in range(1,2**N):\n consistent = True\n for k in range(N):\n if (j >> k) & 1 == 0:\n continue\n for x,y in evidence[k]:\n if (j >> x) & 1 != y:\n consistent = False\n break\n if not consistent:\n break\n- else:\n- result = max(result, bin(i)[2:].count(\"1\"))\n print(result)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 22 }, { "user_id": "u677991935", "problem_id": "p02837", "submission1_id": "s005310999", "submission2_id": "s635187171", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nN=int(input())\nxy =[[]for i in range(N)]\nans=0\n\nfor i in range(N):\n A=int(input())\n for j in range(A):\n x, y = map(int, input().split())\n xy[i].append((x,y))\n\n\nfor i in range(2**N):\n ans_kouho=0\n \n flag=1\n \n TorF=[0]*N\n for j in range(N):\n if (i>>j) & 1:\n TorF[j]=1\n\n for j in range(N):\n for k in range(len(xy[j])):\n \n if TorF[j]==0:\n if TorF[xy[j][k][0]-1]==xy[j][k][1]:\n flag=-1\n break\n else:\n if TorF[xy[j][k][0]-1]!=xy[j][k][1]:\n flag=-1\n break\n \n if flag==1:\n \n ans_kouho=TorF.count(1)\n if(ans>j) & 1:\n TorF[j]=1\n\n for j in range(N):\n for k in range(len(xy[j])):\n \n if TorF[j]==1:\n if TorF[xy[j][k][0]-1]!=xy[j][k][1]:\n flag=-1\n break\n \n if flag==1:\n \n ans_kouho=TorF.count(1)\n if(ans>j) & 1: # (36): NO CHANGE (38): NO CHANGE ... (297): NO CHANGE\n TorF[j]=1 # (74): TorF=[1, 0, 0] (113): TorF=[0, 1, 0] ... (298): TorF=[1, 1, 1]\n\n for j in range(N): # (42): j=0 (48): j=1 ... (321): NO CHANGE\n for k in range(len(xy[j])): # (43): k=0 (49): NO CHANGE ... (316): k=1\n \n if TorF[j]==0: # (44): NO CHANGE (50): NO CHANGE ... (317): NO CHANGE\n if TorF[xy[j][k][0]-1]==xy[j][k][1]: # (45): NO CHANGE (51): NO CHANGE ... (270): NO CHANGE\n flag=-1 # (46): flag=-1 (55): NO CHANGE ... (239): NO CHANGE\n break # (47): NO CHANGE (56): NO CHANGE ... (240): NO CHANGE\n else:\n if TorF[xy[j][k][0]-1]!=xy[j][k][1]: # (83): NO CHANGE (86): NO CHANGE ... (318): NO CHANGE\n flag=-1 # (130): NO CHANGE (159): flag=-1 ... (319): NO CHANGE\n break # (131): NO CHANGE (160): NO CHANGE ... (320): NO CHANGE\n \n if flag==1: # (67): NO CHANGE (104): NO CHANGE ... (322): NO CHANGE\n \n ans_kouho=TorF.count(1)\n if(ans>j) & 1:\n TorF[j]=1\n \n for j in range(N):\n for k in range(len(xy[j])):\n \n- if TorF[j]==0:\n- if TorF[xy[j][k][0]-1]==xy[j][k][1]:\n- flag=-1\n- break\n- else:\n+ if TorF[j]==1:\n if TorF[xy[j][k][0]-1]!=xy[j][k][1]:\n flag=-1\n break\n \n if flag==1:\n \n ans_kouho=TorF.count(1)\n if(ans>j) & 1:\n TorF[j]=1\n \n for j in range(N):\n for k in range(len(xy[j])):\n \n- if TorF[j]==0:\n- if TorF[xy[j][k][0]-1]==xy[j][k][1]:\n- flag=-1\n- break\n- else:\n if TorF[xy[j][k][0]-1]!=xy[j][k][1]:\n flag=-1\n break\n \n if flag==1:\n \n ans_kouho=TorF.count(1)\n if(ans> j) & 1:\n if not j+1 in honest_p:\n \thonest_p.append(j+1)\n if not j+1 in doubt_honest_p:\n \tdoubt_honest_p.append(j+1)\n for k in a[j]:\n p = k[0]\n t = k[1]\n if t:\n if not p in honest_p:\n \thonest_p.append(p)\n else:\n if not p in unkind_p: \n \tunkind_p.append(p)\n else:\n if not j+1 in unkind_p:\n unkind_p.append(j+1)\n if not j+1 in doubt_unkind_p:\n \tdoubt_unkind_p.append(j+1)\n if len(list(set(honest_p) & set(unkind_p))) != 0:\n contradiction = True\n if not contradiction and max_honest <= len(doubt_honest_p):\n max_honest = len(doubt_honest_p)\n \nprint(max_honest)", "code2": "N = int(input())\na = [[] for _ in range(N)]\nfor i in range(N):\n A_i = int(input())\n for j in range(A_i):\n a[i].append(list(map(int, input().split())))\n \nmax_honest = 0\nfor i in range(2**N):\n contradiction = False\n honest_p = []\n unkind_p = []\n doubt_honest_p = []\n doubt_unkind_p = []\n length = len(format(2**N-1, \"b\"))\n bin_num = format(i, \"b\").zfill(length)\n for j in range(length):\n if (i >> j) & 1:\n if not j+1 in honest_p:\n \thonest_p.append(j+1)\n if not j+1 in doubt_honest_p:\n \tdoubt_honest_p.append(j+1)\n for k in a[j]:\n p = k[0]\n t = k[1]\n if t:\n if not p in honest_p:\n \thonest_p.append(p)\n else:\n if not p in unkind_p: \n \tunkind_p.append(p)\n else:\n if not j+1 in unkind_p:\n unkind_p.append(j+1)\n if not j+1 in doubt_unkind_p:\n \tdoubt_unkind_p.append(j+1)\n if len(list(set(honest_p) & set(unkind_p))) != 0:\n contradiction = True\n if not contradiction and max_honest <= len(doubt_honest_p):\n max_honest = len(doubt_honest_p)\n \nprint(max_honest)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576688722", "date2": "1576694739", "bleu_score": "0.9929168596308554", "code1_test_status": [1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0], "code1_test_score": 28, "total_score": 103, "input": "3\n1\n3 1\n1\n1 0\n1\n2 0\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["N = int(input()) # (0): N=3\na = [[] for _ in range(N)] # (1): a\nfor i in range(N): # (2): i=0 (7): a, i=1 ... (17): NO CHANGE\n A_i = int(input()) # (3): A_i=1 (8): a (13): a\n for j in range(A_i): # (4): j=0 (6): a ... (16): NO CHANGE\n a[i].append(list(map(int, input().split()))) # (5): a=[[[3, 1]], [], []] (10): a (15): a\n \nfor i in range(2**N): # (18): i=0 (49): i=1 ... (344): NO CHANGE\n contradiction = False # (19): contradiction=False (50): NO CHANGE ... (294): contradiction=False\n max_honest = 0 # (20): max_honest=0 (51): NO CHANGE ... (295): NO CHANGE\n honest_p = [] # (21): honest_p=[] (52): NO CHANGE ... (296): honest_p=[]\n unkind_p = [] # (22): unkind_p=[] (53): unkind_p=[] ... (297): unkind_p=[]\n doubt_honest_p = [] # (23): doubt_honest_p=[] (54): NO CHANGE ... (298): doubt_honest_p=[]\n doubt_unkind_p = [] # (24): doubt_unkind_p=[] (55): doubt_unkind_p=[] ... (299): doubt_unkind_p=[]\n length = len(format(2**N-1, \"b\")) # (25): length=3 (56): NO CHANGE ... (300): NO CHANGE\n bin_num = format(i, \"b\").zfill(length) # (26): bin_num=000 (57): bin_num=001 ... (301): bin_num=111\n for j in range(length): # (27): NO CHANGE (33): j=1 ... (340): NO CHANGE\n if (i >> j) & 1: # (28): NO CHANGE (34): NO CHANGE ... (329): NO CHANGE\n if not j+1 in honest_p: # (60): NO CHANGE (104): NO CHANGE ... (330): NO CHANGE\n \thonest_p.append(j+1) # (61): honest_p=[1] (105): honest_p=[2] ... (318): honest_p=[1, 3, 2]\n if not j+1 in doubt_honest_p: # (62): NO CHANGE (106): NO CHANGE ... (331): NO CHANGE\n \tdoubt_honest_p.append(j+1) # (63): doubt_honest_p=[1] (107): doubt_honest_p=[2] ... (332): doubt_honest_p=[1, 2, 3]\n for k in a[j]: # (64): k=[3, 1] (70): NO CHANGE ... (339): NO CHANGE\n p = k[0] # (65): p=3 (109): p=1 ... (334): p=2\n t = k[1] # (66): t=1 (110): t=0 ... (335): NO CHANGE\n if t: # (67): NO CHANGE (111): NO CHANGE ... (336): NO CHANGE\n if not p in honest_p: # (68): NO CHANGE (143): NO CHANGE ... (312): NO CHANGE\n \thonest_p.append(p) # (69): honest_p=[1, 3] (144): honest_p=[1, 3] ... (313): honest_p=[1, 3]\n else:\n if not p in unkind_p: # (112): NO CHANGE (156): NO CHANGE ... (337): NO CHANGE\n \tunkind_p.append(p) # (157): unkind_p=[1] (287): unkind_p=[1, 2] ... (338): unkind_p=[1, 2]\n else:\n if not j+1 in unkind_p: # (29): NO CHANGE (35): NO CHANGE ... (260): NO CHANGE\n unkind_p.append(j+1) # (30): unkind_p=[1] (36): unkind_p=[1, 2] ... (261): unkind_p=[1]\n if not j+1 in doubt_unkind_p: # (31): NO CHANGE (37): NO CHANGE ... (262): NO CHANGE\n \tdoubt_unkind_p.append(j+1) # (32): doubt_unkind_p=[1] (38): doubt_unkind_p=[1, 2] ... (263): doubt_unkind_p=[1]\n if len(list(set(honest_p) & set(unkind_p))) != 0: # (46): NO CHANGE (84): NO CHANGE ... (341): NO CHANGE\n contradiction = True # (85): contradiction=True (167): contradiction=True ... (342): contradiction=True\n if not contradiction and max_honest <= len(doubt_honest_p): # (47): NO CHANGE (86): NO CHANGE ... (343): NO CHANGE\n max_honest = len(doubt_honest_p) # (48): NO CHANGE (123): max_honest=1 ... (248): max_honest=2\n \nprint(max_honest)"], "anno_status": [false], "diff_content": " N = int(input())\n a = [[] for _ in range(N)]\n for i in range(N):\n A_i = int(input())\n for j in range(A_i):\n a[i].append(list(map(int, input().split())))\n- \n+ \n+max_honest = 0\n for i in range(2**N):\n contradiction = False\n- max_honest = 0\n honest_p = []\n unkind_p = []\n doubt_honest_p = []\n doubt_unkind_p = []\n length = len(format(2**N-1, \"b\"))\n bin_num = format(i, \"b\").zfill(length)\n for j in range(length):\n if (i >> j) & 1:\n if not j+1 in honest_p:\n \thonest_p.append(j+1)\n if not j+1 in doubt_honest_p:\n \tdoubt_honest_p.append(j+1)\n for k in a[j]:\n p = k[0]\n t = k[1]\n if t:\n if not p in honest_p:\n \thonest_p.append(p)\n else:\n if not p in unkind_p: \n \tunkind_p.append(p)\n else:\n if not j+1 in unkind_p:\n unkind_p.append(j+1)\n if not j+1 in doubt_unkind_p:\n \tdoubt_unkind_p.append(j+1)\n if len(list(set(honest_p) & set(unkind_p))) != 0:\n contradiction = True\n if not contradiction and max_honest <= len(doubt_honest_p):\n max_honest = len(doubt_honest_p)\n \n print(max_honest)\n", "FL_content": " N = int(input())\n a = [[] for _ in range(N)]\n for i in range(N):\n A_i = int(input())\n for j in range(A_i):\n a[i].append(list(map(int, input().split())))\n- \n for i in range(2**N):\n contradiction = False\n- max_honest = 0\n honest_p = []\n unkind_p = []\n doubt_honest_p = []\n doubt_unkind_p = []\n length = len(format(2**N-1, \"b\"))\n bin_num = format(i, \"b\").zfill(length)\n for j in range(length):\n if (i >> j) & 1:\n if not j+1 in honest_p:\n \thonest_p.append(j+1)\n if not j+1 in doubt_honest_p:\n \tdoubt_honest_p.append(j+1)\n for k in a[j]:\n p = k[0]\n t = k[1]\n if t:\n if not p in honest_p:\n \thonest_p.append(p)\n else:\n if not p in unkind_p: \n \tunkind_p.append(p)\n else:\n if not j+1 in unkind_p:\n unkind_p.append(j+1)\n if not j+1 in doubt_unkind_p:\n \tdoubt_unkind_p.append(j+1)\n if len(list(set(honest_p) & set(unkind_p))) != 0:\n contradiction = True\n if not contradiction and max_honest <= len(doubt_honest_p):\n max_honest = len(doubt_honest_p)\n \n print(max_honest)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 42 }, { "user_id": "u157020659", "problem_id": "p02837", "submission1_id": "s856111186", "submission2_id": "s099611698", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\n\ndef trust_remark(i, r):\n \n people = [-1] * n\n people[i] = 1\n for x, y in r:\n people[x - 1] = y\n return people\n\ndef check(x, y):\n new_list = []\n for a, b in zip(x, y):\n if abs(a) != abs(b):\n return False\n else:\n new_list.append(max(a, b))\n return new_list\n\nremarks = []\nfor i in range(n):\n a = int(input())\n r = [tuple(map(int, input().split())) for _ in range(a)]\n remarks.append(trust_remark(i, r))\n\ndp = []\ncnt_max = 0\nfor i, r_i in enumerate(remarks):\n if i in dp: continue\n cnt = 0\n tmp = [0] * i + r_i[i:]\n for j, r_j in enumerate(remarks[i:]):\n j += i\n if r_i[j] == 0: continue\n if check(tmp, r_j):\n tmp = check(tmp, r_j)\n cnt += 1\n elif r_i[j] == -1:\n tmp[j] = 0\n continue\n else:\n cnt = 0\n break\n if cnt != 0:\n for j, x in enumerate(tmp):\n if x == 1: dp.append(j)\n cnt_max = max(cnt, cnt_max)\n\nprint(cnt_max)", "code2": "n = int(input())\n\n\ndef make_remark_list(i, r):\n \n people = [-1] * n\n people[i] = 1\n for x, y in r:\n people[x - 1] = y\n return people\n\n\ndef check(x, y):\n new_list = []\n for a, b in zip(x, y):\n a, b = min(a, b), max(a, b)\n if (a, b) == (0, 1):\n return False\n elif (a, b) == (-1, 0):\n new_list.append(0)\n else:\n new_list.append(max(a, b))\n return new_list\n\n\nremarks = []\nfor i in range(n):\n a = int(input())\n r = [tuple(map(int, input().split())) for _ in range(a)]\n remarks.append(make_remark_list(i, r))\n\ndef max_count(r, cnt, i = 0):\n tmp = r\n for j, r_j in enumerate(remarks):\n if j < i: continue\n if tmp[j] == 0:\n continue\n elif tmp[j] == 1:\n if check(tmp, r_j):\n tmp = check(tmp, r_j)\n cnt += 1\n else:\n cnt = 0\n break\n else:\n tmp[j] = 1\n if check(tmp, r_j):\n cnt_1, tmp_1 = max_count(tmp, cnt, j)\n tmp[j] = 0\n cnt_0, tmp_0 = max_count(tmp, cnt, j)\n if cnt_0 > cnt_1:\n return cnt_0, tmp_0\n else:\n return cnt_1, tmp_1\n else:\n tmp[j] = 0\n return cnt, tmp\n\nr = [-1] * n\ncnt, r = max_count(r, 0)\nprint(cnt)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586323499", "date2": "1586382994", "bleu_score": "0.6479336043898812", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 88, "total_score": 103, "input": "3\n1\n3 1\n1\n2 1\n1\n1 0\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["n = int(input()) # (0): n=3\n\ndef trust_remark(i, r): # (1): trust_remark=\n \n people = [-1] * n # (8): people=[-1, -1, -1] (17): people=[-1, -1, -1] (26): people=[-1, -1, -1]\n people[i] = 1 # (9): people=[1, -1, -1] (18): people=[-1, 1, -1] (27): people=[-1, -1, 1]\n for x, y in r: # (10): x=3, y=1 (12): n=3, trust_remark=, check=, remarks=[[1, -1, 1]], a=1 ... (30): n=3, trust_remark=, check=, remarks, a=1\n people[x - 1] = y # (11): people=[1, -1, 1] (20): NO CHANGE (29): people=[0, -1, 1]\n return people\n\ndef check(x, y): # (2): check=\n new_list = [] # (42): new_list=[] (54): new_list=[] ... (128): new_list=[]\n for a, b in zip(x, y): # (43): a=1, b=1 (46): a=-1, b=-1 ... (132): b=-1\n if abs(a) != abs(b): # (44): NO CHANGE (47): NO CHANGE ... (133): n=3, trust_remark=, check=, remarks=[[1, -1, 1], [-1, 1, -1], [0, -1, 1]], i=2, a=1, r=[(1, 0)], dp=[], cnt_max=0, r_i=[0, -1, 1], cnt=0, tmp=[0, 0, 1], j=2, r_j=[0, -1, 1]\n return False\n else:\n new_list.append(max(a, b)) # (45): new_list=[1] (48): new_list=[1, -1] ... (131): new_list=[0]\n return new_list\n\nremarks = [] # (3): remarks=[]\nfor i in range(n): # (4): i=0 (13): i=1 ... (31): NO CHANGE\n a = int(input()) # (5): a=1 (14): NO CHANGE (23): NO CHANGE\n r = [tuple(map(int, input().split())) for _ in range(a)] # (6): r=[(3, 1)] (15): r=[(2, 1)] (24): r=[(1, 0)]\n remarks.append(trust_remark(i, r)) # (7): NO CHANGE (16): NO CHANGE (25): NO CHANGE\n\ndp = [] # (32): dp=[]\ncnt_max = 0 # (33): cnt_max=0\nfor i, r_i in enumerate(remarks): # (34): i=0, r_i=[1, -1, 1] (105): i=1, r_i=[-1, 1, -1] ... (138): NO CHANGE\n if i in dp: continue # (35): NO CHANGE (106): NO CHANGE (121): NO CHANGE\n cnt = 0 # (36): cnt=0 (107): NO CHANGE (122): NO CHANGE\n tmp = [0] * i + r_i[i:] # (37): tmp=[1, -1, 1] (108): tmp=[0, 1, -1] (123): tmp=[0, 0, 1]\n for j, r_j in enumerate(remarks[i:]): # (38): j=0, r_j=[1, -1, 1] (66): j=1, r_j=[-1, 1, -1] ... (124): j=0, r_j=[0, -1, 1]\n j += i # (39): NO CHANGE (67): NO CHANGE ... (125): j=2\n if r_i[j] == 0: continue # (40): NO CHANGE (68): NO CHANGE ... (126): NO CHANGE\n if check(tmp, r_j): # (41): x=[1, -1, 1], y=[1, -1, 1] (69): x=[1, -1, 1], y=[-1, 1, -1] ... (127): x=[0, 0, 1], y=[0, -1, 1]\n tmp = check(tmp, r_j) # (53): x=[1, -1, 1], y=[1, -1, 1] (81): x=[1, -1, 1], y=[-1, 1, -1]\n cnt += 1 # (65): cnt=1 (93): cnt=2\n elif r_i[j] == -1: # (101): NO CHANGE (116): NO CHANGE (134): NO CHANGE\n tmp[j] = 0\n continue\n else:\n cnt = 0 # (102): cnt=0 (117): NO CHANGE (135): NO CHANGE\n break # (103): NO CHANGE (118): NO CHANGE (136): NO CHANGE\n if cnt != 0: # (104): NO CHANGE (119): NO CHANGE (137): NO CHANGE\n for j, x in enumerate(tmp):\n if x == 1: dp.append(j)\n cnt_max = max(cnt, cnt_max)\n\nprint(cnt_max)"], "anno_status": [false], "diff_content": " n = int(input())\n \n-def trust_remark(i, r):\n+\n+def make_remark_list(i, r):\n \n people = [-1] * n\n people[i] = 1\n for x, y in r:\n people[x - 1] = y\n return people\n \n+\n def check(x, y):\n new_list = []\n for a, b in zip(x, y):\n- if abs(a) != abs(b):\n+ a, b = min(a, b), max(a, b)\n+ if (a, b) == (0, 1):\n return False\n+ elif (a, b) == (-1, 0):\n+ new_list.append(0)\n else:\n new_list.append(max(a, b))\n return new_list\n \n+\n remarks = []\n for i in range(n):\n a = int(input())\n r = [tuple(map(int, input().split())) for _ in range(a)]\n- remarks.append(trust_remark(i, r))\n-\n-dp = []\n-cnt_max = 0\n-for i, r_i in enumerate(remarks):\n- if i in dp: continue\n- cnt = 0\n- tmp = [0] * i + r_i[i:]\n- for j, r_j in enumerate(remarks[i:]):\n- j += i\n- if r_i[j] == 0: continue\n- if check(tmp, r_j):\n- tmp = check(tmp, r_j)\n- cnt += 1\n- elif r_i[j] == -1:\n- tmp[j] = 0\n+ remarks.append(make_remark_list(i, r))\n+\n+def max_count(r, cnt, i = 0):\n+ tmp = r\n+ for j, r_j in enumerate(remarks):\n+ if j < i: continue\n+ if tmp[j] == 0:\n continue\n+ elif tmp[j] == 1:\n+ if check(tmp, r_j):\n+ tmp = check(tmp, r_j)\n+ cnt += 1\n+ else:\n+ cnt = 0\n+ break\n else:\n- cnt = 0\n- break\n- if cnt != 0:\n- for j, x in enumerate(tmp):\n- if x == 1: dp.append(j)\n- cnt_max = max(cnt, cnt_max)\n-\n-print(cnt_max)\n+ tmp[j] = 1\n+ if check(tmp, r_j):\n+ cnt_1, tmp_1 = max_count(tmp, cnt, j)\n+ tmp[j] = 0\n+ cnt_0, tmp_0 = max_count(tmp, cnt, j)\n+ if cnt_0 > cnt_1:\n+ return cnt_0, tmp_0\n+ else:\n+ return cnt_1, tmp_1\n+ else:\n+ tmp[j] = 0\n+ return cnt, tmp\n+\n+r = [-1] * n\n+cnt, r = max_count(r, 0)\n+print(cnt)\n", "FL_content": " n = int(input())\n \n-def trust_remark(i, r):\n \n people = [-1] * n\n people[i] = 1\n for x, y in r:\n people[x - 1] = y\n return people\n \n def check(x, y):\n new_list = []\n for a, b in zip(x, y):\n- if abs(a) != abs(b):\n return False\n else:\n new_list.append(max(a, b))\n return new_list\n \n remarks = []\n for i in range(n):\n a = int(input())\n r = [tuple(map(int, input().split())) for _ in range(a)]\n- remarks.append(trust_remark(i, r))\n-\n-dp = []\n-cnt_max = 0\n-for i, r_i in enumerate(remarks):\n- if i in dp: continue\n- cnt = 0\n- tmp = [0] * i + r_i[i:]\n- for j, r_j in enumerate(remarks[i:]):\n- j += i\n- if r_i[j] == 0: continue\n- if check(tmp, r_j):\n- tmp = check(tmp, r_j)\n- cnt += 1\n- elif r_i[j] == -1:\n- tmp[j] = 0\n continue\n else:\n- cnt = 0\n- break\n- if cnt != 0:\n- for j, x in enumerate(tmp):\n- if x == 1: dp.append(j)\n- cnt_max = max(cnt, cnt_max)\n-\n-print(cnt_max)\n", "added_lines": 38, "removed_lines": 26, "code1_lines": 49 }, { "user_id": "u813102292", "problem_id": "p02837", "submission1_id": "s719093831", "submission2_id": "s670925636", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = [dict() for _ in range(N)] \nfor i in range(N):\n a = int(input())\n for j in range(a):\n x, y = map(int, input().split())\n x -= 1\n A[i][x] = y\n\n\nres = 0\nfor i in range(1,2 ** N):\n i_bin = bin(i)[2:]\n i_bin = i_bin.zfill(N)\n p = [0] * N\n for j in range(N):\n p[j] = int(i_bin[j])\n for j in range(N):\n x = i_bin[j]\n if x == '1':\n for k, v in A[j].items():\n p[k] = v\n \n \n isPossible = True\n for j in range(N):\n if int(i_bin[j]) != p[j]: \n isPossible = False\n break\n if isPossible:\n res = max(res, sum(p))\n\nprint(res)", "code2": "N = int(input())\nA = [dict() for _ in range(N)] \nfor i in range(N):\n a = int(input())\n for j in range(a):\n x, y = map(int, input().split())\n x -= 1\n A[i][x] = y\n\n\nres = 0\nfor i in range(1,2 ** N):\n i_bin = bin(i)[2:]\n i_bin = i_bin.zfill(N)\n p = [0] * N\n for j in range(N):\n p[j] = int(i_bin[j])\n isPossible = True\n for j in range(N):\n x = i_bin[j]\n if x == '1':\n for k, v in A[j].items():\n if p[k] != v:\n isPossible = False\n break\n if isPossible:\n res = max(res, sum(p))\n\nprint(res)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575860291", "date2": "1575860498", "bleu_score": "0.9084934785320817", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 103, "input": "3\n1\n3 1\n1\n1 1\n1\n1 0\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = [dict() for _ in range(N)] # (1): A=[{}, {}, {}]\nfor i in range(N): # (2): i=0 (9): i=1 ... (23): NO CHANGE\n a = int(input()) # (3): a=1 (10): NO CHANGE (17): NO CHANGE\n for j in range(a): # (4): j=0 (8): NO CHANGE ... (22): NO CHANGE\n x, y = map(int, input().split()) # (5): x=3, y=1 (12): x=1 (19): x=1, y=0\n x -= 1 # (6): x=2 (13): x=0 (20): x=0\n A[i][x] = y # (7): A=[{2: 1}, {}, {}] (14): A=[{2: 1}, {0: 1}, {}] (21): A=[{2: 1}, {0: 1}, {0: 0}]\n\n\nres = 0 # (24): res=0\nfor i in range(1,2 ** N): # (25): i=1 (59): i=2 ... (266): NO CHANGE\n i_bin = bin(i)[2:] # (26): i_bin=1 (60): i_bin=10 ... (231): i_bin=111\n i_bin = i_bin.zfill(N) # (27): i_bin=001 (61): i_bin=010 ... (232): NO CHANGE\n p = [0] * N # (28): p=[0, 0, 0] (62): p=[0, 0, 0] ... (233): p=[0, 0, 0]\n for j in range(N): # (29): NO CHANGE (31): j=1 ... (240): NO CHANGE\n p[j] = int(i_bin[j]) # (30): NO CHANGE (32): NO CHANGE ... (239): p=[1, 1, 1]\n for j in range(N): # (36): j=0 (39): j=1 ... (259): NO CHANGE\n x = i_bin[j] # (37): x=0 (40): NO CHANGE ... (254): NO CHANGE\n if x == '1': # (38): NO CHANGE (41): NO CHANGE ... (255): NO CHANGE\n for k, v in A[j].items(): # (45): k=0, v=0 (47): NO CHANGE ... (258): NO CHANGE\n p[k] = v # (46): NO CHANGE (77): p=[1, 1, 0] ... (257): p=[0, 1, 1]\n \n \n isPossible = True # (49): isPossible=True (83): NO CHANGE ... (260): isPossible=True\n for j in range(N): # (50): j=0 (52): j=1 ... (261): j=0\n if int(i_bin[j]) != p[j]: # (51): NO CHANGE (53): NO CHANGE ... (262): NO CHANGE\n isPossible = False # (86): isPossible=False (157): isPossible=False ... (263): isPossible=False\n break # (87): NO CHANGE (158): NO CHANGE ... (264): NO CHANGE\n if isPossible: # (57): NO CHANGE (88): NO CHANGE ... (265): NO CHANGE\n res = max(res, sum(p)) # (58): res=1 (125): res=2\n\nprint(res)"], "anno_status": [false], "diff_content": " N = int(input())\n A = [dict() for _ in range(N)] \n for i in range(N):\n a = int(input())\n for j in range(a):\n x, y = map(int, input().split())\n x -= 1\n A[i][x] = y\n \n \n res = 0\n for i in range(1,2 ** N):\n i_bin = bin(i)[2:]\n i_bin = i_bin.zfill(N)\n p = [0] * N\n for j in range(N):\n p[j] = int(i_bin[j])\n+ isPossible = True\n for j in range(N):\n x = i_bin[j]\n if x == '1':\n for k, v in A[j].items():\n- p[k] = v\n- \n- \n- isPossible = True\n- for j in range(N):\n- if int(i_bin[j]) != p[j]: \n- isPossible = False\n- break\n+ if p[k] != v:\n+ isPossible = False\n+ break\n if isPossible:\n res = max(res, sum(p))\n \n print(res)\n", "FL_content": " N = int(input())\n A = [dict() for _ in range(N)] \n for i in range(N):\n a = int(input())\n for j in range(a):\n x, y = map(int, input().split())\n x -= 1\n A[i][x] = y\n \n \n res = 0\n for i in range(1,2 ** N):\n i_bin = bin(i)[2:]\n i_bin = i_bin.zfill(N)\n p = [0] * N\n for j in range(N):\n p[j] = int(i_bin[j])\n for j in range(N):\n x = i_bin[j]\n if x == '1':\n for k, v in A[j].items():\n- p[k] = v\n- \n- \n- isPossible = True\n- for j in range(N):\n- if int(i_bin[j]) != p[j]: \n- isPossible = False\n- break\n if isPossible:\n res = max(res, sum(p))\n \n print(res)\n", "added_lines": 4, "removed_lines": 8, "code1_lines": 33 }, { "user_id": "u829249049", "problem_id": "p02837", "submission1_id": "s695743237", "submission2_id": "s137340713", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nALL=[]\nfor i in range(N):\n A=int(input())\n XY=[]\n for k in range(A):\n x,y=map(int,input().split())\n XY+=[[x,y]]\n ALL+=[XY]\nans=0 \nfor i in range(2**N):\n people=[-1]*N\n anssub=0\n for k in range(N):\n if ((i >> k) & 1):\n if people[k]==1:\n people[k]=-2 \n people[k]=0\n anssub+=1\n for t in ALL[k]:\n if people[t[0]-1]!=t[1] and people[t[0]-1]!=-1:\n people[t[0]-1]=-2\n else:\n people[t[0]-1]=t[1]\n else:\n if people[k]==0:\n people[k]=-2\n people[k]=1 \n for t in ALL[k]:\n if t[1]==0:\n if people[t[0]-1]!=1 and people[t[0]-1]!=-1:\n people[t[0]-1]=-2\n else:\n people[t[0]-1]=1\n else:\n if people[t[0]-1]!=0 and people[t[0]-1]!=-1:\n people[t[0]-1]=-2\n else:\n people[t[0]-1]=0\n if not -2 in people:\n ans=max(ans,anssub)\nprint(ans) ", "code2": "N=int(input())\nALL=[]\nfor i in range(N):\n A=int(input())\n XY=[]\n for k in range(A):\n x,y=map(int,input().split())\n XY+=[[x,y]]\n ALL+=[XY]\nans=0 \nfor i in range(2**N):\n people=[-1]*N\n anssub=0\n for k in range(N):\n if ((i >> k) & 1):\n if people[k]==0 or people[k]==-2:\n people[k]=-2 \n else:\n people[k]=1\n anssub+=1\n for t in ALL[k]:\n if people[t[0]-1]!=t[1] and people[t[0]-1]!=-1:\n people[t[0]-1]=-2\n else:\n people[t[0]-1]=t[1]\n else:\n if people[k]==1 or people[k]==-2:\n people[k]=-2\n else:\n people[k]=0 \n if not -2 in people:\n ans=max(ans,anssub)\nprint(ans) ", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589935909", "date2": "1589938740", "bleu_score": "0.6786547889269854", "code1_test_status": [0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0], "code1_test_score": 17, "total_score": 103, "input": "3\n2\n2 0\n3 0\n2\n2 1\n1 0\n2\n1 1\n2 0\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["N=int(input()) # (0): N=3\nALL=[] # (1): ALL=[]\nfor i in range(N): # (2): i=0 (13): i=1 ... (35): NO CHANGE\n A=int(input()) # (3): A=2 (14): NO CHANGE (25): NO CHANGE\n XY=[] # (4): XY=[] (15): XY=[] (26): XY=[]\n for k in range(A): # (5): k=0 (8): k=1 ... (33): NO CHANGE\n x,y=map(int,input().split()) # (6): x=2, y=0 (9): x=3 ... (31): x=2, y=0\n XY+=[[x,y]] # (7): XY (10): XY ... (32): XY\n ALL+=[XY] # (12): ALL=[[[2, 0], [3, 0]]] (23): ALL (34): ALL\nans=0 # (36): ans=0\nfor i in range(2**N): # (37): i=0 (81): i=1 ... (385): NO CHANGE\n people=[-1]*N # (38): people=[-1, -1, -1] (82): people=[-1, -1, -1] ... (345): people=[-1, -1, -1]\n anssub=0 # (39): anssub=0 (83): NO CHANGE ... (346): anssub=0\n for k in range(N): # (40): k=0 (53): k=1 ... (383): NO CHANGE\n if ((i >> k) & 1): # (41): NO CHANGE (54): NO CHANGE ... (372): NO CHANGE\n if people[k]==1: # (86): NO CHANGE (144): NO CHANGE ... (373): NO CHANGE\n people[k]=-2 # (145): people=[1, -2, 1] (245): people=[1, -2, -2] ... (332): people=[-2, -2, -2]\n people[k]=0 # (87): people=[0, -1, -1] (146): people=[1, 0, 1] ... (374): NO CHANGE\n anssub+=1 # (88): anssub=1 (147): anssub=1 ... (375): anssub=3\n for t in ALL[k]: # (89): NO CHANGE (92): t=[3, 0] ... (382): NO CHANGE\n if people[t[0]-1]!=t[1] and people[t[0]-1]!=-1: # (90): NO CHANGE (93): NO CHANGE ... (380): NO CHANGE\n people[t[0]-1]=-2 # (150): people=[1, -2, 1] (153): people=[-2, -2, 1] ... (381): NO CHANGE\n else:\n people[t[0]-1]=t[1] # (91): people=[0, 0, -1] (94): people=[0, 0, 0] ... (369): NO CHANGE\n else:\n if people[k]==0: # (42): NO CHANGE (55): NO CHANGE ... (305): NO CHANGE\n people[k]=-2 # (99): people=[0, -2, 0] (113): people=[-2, -2, -2] ... (275): people=[0, -2, 0]\n people[k]=1 # (43): people=[1, -1, -1] (56): NO CHANGE ... (306): people=[1, -1, -1]\n for t in ALL[k]: # (44): t=[2, 0] (48): t=[3, 0] ... (315): NO CHANGE\n if t[1]==0: # (45): NO CHANGE (49): NO CHANGE ... (312): NO CHANGE\n if people[t[0]-1]!=1 and people[t[0]-1]!=-1: # (46): NO CHANGE (50): NO CHANGE ... (313): NO CHANGE\n people[t[0]-1]=-2 # (77): NO CHANGE (108): people=[-2, -2, 0] ... (284): people=[-2, -2, 0]\n else:\n people[t[0]-1]=1 # (47): people=[1, 1, -1] (51): people=[1, 1, 1] ... (314): people=[1, 1, 1]\n else:\n if people[t[0]-1]!=0 and people[t[0]-1]!=-1: # (59): NO CHANGE (72): NO CHANGE ... (279): NO CHANGE\n people[t[0]-1]=-2 # (60): people=[1, -2, 1] (73): people=[-2, -2, 1] ... (280): people=[0, -2, 0]\n else:\n people[t[0]-1]=0 # (205): NO CHANGE\n if not -2 in people: # (80): NO CHANGE (125): NO CHANGE ... (384): NO CHANGE\n ans=max(ans,anssub)\nprint(ans) "], "anno_status": [false], "diff_content": " N=int(input())\n ALL=[]\n for i in range(N):\n A=int(input())\n XY=[]\n for k in range(A):\n x,y=map(int,input().split())\n XY+=[[x,y]]\n ALL+=[XY]\n ans=0 \n for i in range(2**N):\n people=[-1]*N\n anssub=0\n for k in range(N):\n if ((i >> k) & 1):\n- if people[k]==1:\n+ if people[k]==0 or people[k]==-2:\n people[k]=-2 \n- people[k]=0\n+ else:\n+ people[k]=1\n anssub+=1\n for t in ALL[k]:\n if people[t[0]-1]!=t[1] and people[t[0]-1]!=-1:\n people[t[0]-1]=-2\n else:\n people[t[0]-1]=t[1]\n else:\n- if people[k]==0:\n+ if people[k]==1 or people[k]==-2:\n people[k]=-2\n- people[k]=1 \n- for t in ALL[k]:\n- if t[1]==0:\n- if people[t[0]-1]!=1 and people[t[0]-1]!=-1:\n- people[t[0]-1]=-2\n- else:\n- people[t[0]-1]=1\n- else:\n- if people[t[0]-1]!=0 and people[t[0]-1]!=-1:\n- people[t[0]-1]=-2\n- else:\n- people[t[0]-1]=0\n+ else:\n+ people[k]=0 \n if not -2 in people:\n ans=max(ans,anssub)\n-print(ans) \n+print(ans) \n", "FL_content": " N=int(input())\n ALL=[]\n for i in range(N):\n A=int(input())\n XY=[]\n for k in range(A):\n x,y=map(int,input().split())\n XY+=[[x,y]]\n ALL+=[XY]\n ans=0 \n for i in range(2**N):\n people=[-1]*N\n anssub=0\n for k in range(N):\n if ((i >> k) & 1):\n- if people[k]==1:\n people[k]=-2 \n- people[k]=0\n anssub+=1\n for t in ALL[k]:\n if people[t[0]-1]!=t[1] and people[t[0]-1]!=-1:\n people[t[0]-1]=-2\n else:\n people[t[0]-1]=t[1]\n else:\n- if people[k]==0:\n people[k]=-2\n- people[k]=1 \n- for t in ALL[k]:\n- if t[1]==0:\n- if people[t[0]-1]!=1 and people[t[0]-1]!=-1:\n- people[t[0]-1]=-2\n- else:\n- people[t[0]-1]=1\n- else:\n- if people[t[0]-1]!=0 and people[t[0]-1]!=-1:\n- people[t[0]-1]=-2\n- else:\n- people[t[0]-1]=0\n if not -2 in people:\n ans=max(ans,anssub)\n-print(ans) \n", "added_lines": 7, "removed_lines": 16, "code1_lines": 42 }, { "user_id": "u256464928", "problem_id": "p02837", "submission1_id": "s580925072", "submission2_id": "s601399158", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nlist = [list() for _ in range(N)]\n\nfor i in range(N):\n a = int(input())\n for j in range(a):\n x,y = map(int,input().split())\n list[i].append([x,y])\n\n\nans = 0\nfor i in range(2**N):\n flg = False\n do = [0] * N\n for j in range(N):\n if ((i >> j) & 1):\n do[j] = 1\n \n P = [-1] * N\n for n in range(N):\n if flg:break\n for p in list[n]:\n if P[p[0]-1] == -1:\n \n \n if do[n] == 1:\n P[p[0]-1] = p[1]\n else:\n if p[1] == 1:\n P[p[0]-1] = 0\n else:\n P[p[0]-1] = 1\n if P[p[0]-1] != do[p[0]-1]:\n flg = True\n else:\n if P[p[0]-1] != do[p[0]-1]:\n flg = True\n \n \n elif do[n] == 1 and P[p[0]-1] != p[1]:\n flg = True\n elif do[n] == 0 and P[p[0]-1] == p[1]:\n flg = True\n if flg:break\n \n if flg:\n continue\n \n ans = max(ans,sum(do))\n \nprint(ans)\n\n\n\n", "code2": "N = int(input())\nlist = [list() for _ in range(N)]\nif N == 1:\n print(1)\n exit()\n\nfor i in range(N):\n a = int(input())\n for j in range(a):\n x,y = map(int,input().split())\n list[i].append([x,y])\n\nans = 0\nfor i in range(2**N):\n flg = False\n do = [0] * N\n for j in range(N):\n if ((i >> j) & 1):\n do[j] = 1\n P = [-1] * N\n for n in range(N):\n if flg:break\n for p in list[n]:\n if P[p[0]-1] == -1:\n if do[n] == 1:\n P[p[0]-1] = p[1]\n if P[p[0]-1] != do[p[0]-1]:\n flg = True\n \n \n \n \n \n else:\n if do[n] == 1 and P[p[0]-1] != p[1]:\n flg = True\n if flg:\n continue\n ans = max(ans,sum(do))\nprint(ans)\n\n\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575862283", "date2": "1575867939", "bleu_score": "0.707596934195474", "code1_test_status": [1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1], "code1_test_score": 51, "total_score": 103, "input": "3\n2\n2 1\n3 1\n2\n3 1\n1 0\n2\n1 0\n2 0\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["N = int(input()) # (0): N=3\nlist = [list() for _ in range(N)] # (1): list\n\nfor i in range(N): # (2): i=0 (11): list, i=1 ... (29): NO CHANGE\n a = int(input()) # (3): a=2 (12): list (21): list\n for j in range(a): # (4): j=0 (7): list, j=1 ... (28): NO CHANGE\n x,y = map(int,input().split()) # (5): x=2, y=1 (8): list=[[[2, 1]], [], []], x=3 ... (26): list, x=2\n list[i].append([x,y]) # (6): list (9): list ... (27): list\n\n\nans = 0 # (30): ans=0\nfor i in range(2**N): # (31): i=0 (79): i=1 ... (296): NO CHANGE\n flg = False # (32): flg=False (80): flg=False ... (249): flg=False\n do = [0] * N # (33): do=[0, 0, 0] (81): NO CHANGE ... (250): do=[0, 0, 0]\n for j in range(N): # (34): j=0 (36): j=1 ... (260): NO CHANGE\n if ((i >> j) & 1): # (35): NO CHANGE (37): NO CHANGE ... (258): NO CHANGE\n do[j] = 1 # (84): do=[1, 0, 0] (111): do=[0, 1, 0] ... (259): do=[1, 1, 1]\n \n P = [-1] * N # (41): P=[-1, -1, -1] (90): P=[-1, -1, -1] ... (261): P=[-1, -1, -1]\n for n in range(N): # (42): n=0 (59): n=1 ... (292): n=2\n if flg:break # (43): NO CHANGE (60): NO CHANGE ... (293): NO CHANGE\n for p in list[n]: # (44): p=[2, 1] (51): p=[3, 1] ... (285): p=[1, 0]\n if P[p[0]-1] == -1: # (45): NO CHANGE (52): NO CHANGE ... (286): NO CHANGE\n \n \n if do[n] == 1: # (46): NO CHANGE (53): NO CHANGE ... (287): NO CHANGE\n P[p[0]-1] = p[1] # (96): P=[-1, 1, -1] (148): P=[-1, 1, -1] ... (288): P=[0, 1, 1]\n else:\n if p[1] == 1: # (47): NO CHANGE (54): NO CHANGE ... (239): NO CHANGE\n P[p[0]-1] = 0 # (48): P=[-1, 0, -1] (55): P=[-1, 0, 0] ... (240): P=[-1, 0, -1]\n else:\n P[p[0]-1] = 1 # (71): P=[1, 0, 0]\n if P[p[0]-1] != do[p[0]-1]: # (49): NO CHANGE (56): NO CHANGE ... (289): NO CHANGE\n flg = True # (73): flg=True (98): flg=True ... (290): flg=True\n else:\n if P[p[0]-1] != do[p[0]-1]: # (63): NO CHANGE (281): NO CHANGE\n flg = True\n \n \n elif do[n] == 1 and P[p[0]-1] != p[1]: # (64): NO CHANGE (282): NO CHANGE\n flg = True\n elif do[n] == 0 and P[p[0]-1] == p[1]: # (65): NO CHANGE (283): NO CHANGE\n flg = True\n if flg:break # (50): NO CHANGE (57): NO CHANGE ... (291): NO CHANGE\n \n if flg: # (77): NO CHANGE (102): NO CHANGE ... (294): NO CHANGE\n continue # (78): NO CHANGE (103): NO CHANGE ... (295): NO CHANGE\n \n ans = max(ans,sum(do))\n \nprint(ans)\n\n\n\n"], "anno_status": [false], "diff_content": " N = int(input())\n list = [list() for _ in range(N)]\n+if N == 1:\n+ print(1)\n+ exit()\n \n for i in range(N):\n a = int(input())\n for j in range(a):\n x,y = map(int,input().split())\n list[i].append([x,y])\n \n-\n ans = 0\n for i in range(2**N):\n flg = False\n do = [0] * N\n for j in range(N):\n if ((i >> j) & 1):\n do[j] = 1\n- \n P = [-1] * N\n for n in range(N):\n if flg:break\n for p in list[n]:\n if P[p[0]-1] == -1:\n- \n- \n if do[n] == 1:\n P[p[0]-1] = p[1]\n- else:\n- if p[1] == 1:\n- P[p[0]-1] = 0\n- else:\n- P[p[0]-1] = 1\n- if P[p[0]-1] != do[p[0]-1]:\n- flg = True\n- else:\n- if P[p[0]-1] != do[p[0]-1]:\n- flg = True\n+ if P[p[0]-1] != do[p[0]-1]:\n+ flg = True\n \n \n- elif do[n] == 1 and P[p[0]-1] != p[1]:\n- flg = True\n- elif do[n] == 0 and P[p[0]-1] == p[1]:\n+ \n+ \n+ \n+ else:\n+ if do[n] == 1 and P[p[0]-1] != p[1]:\n flg = True\n- if flg:break\n- \n if flg:\n continue\n- \n ans = max(ans,sum(do))\n- \n print(ans)\n \n \n \n \n", "FL_content": " N = int(input())\n list = [list() for _ in range(N)]\n \n for i in range(N):\n a = int(input())\n for j in range(a):\n x,y = map(int,input().split())\n list[i].append([x,y])\n \n-\n ans = 0\n for i in range(2**N):\n flg = False\n do = [0] * N\n for j in range(N):\n if ((i >> j) & 1):\n do[j] = 1\n- \n P = [-1] * N\n for n in range(N):\n if flg:break\n for p in list[n]:\n if P[p[0]-1] == -1:\n- \n- \n if do[n] == 1:\n P[p[0]-1] = p[1]\n- else:\n- if p[1] == 1:\n- P[p[0]-1] = 0\n- else:\n- P[p[0]-1] = 1\n- if P[p[0]-1] != do[p[0]-1]:\n- flg = True\n- else:\n- if P[p[0]-1] != do[p[0]-1]:\n- flg = True\n \n \n- elif do[n] == 1 and P[p[0]-1] != p[1]:\n- flg = True\n- elif do[n] == 0 and P[p[0]-1] == p[1]:\n flg = True\n- if flg:break\n- \n if flg:\n continue\n- \n ans = max(ans,sum(do))\n- \n print(ans)\n \n \n \n \n", "added_lines": 10, "removed_lines": 21, "code1_lines": 55 }, { "user_id": "u733738237", "problem_id": "p02837", "submission1_id": "s587380817", "submission2_id": "s568234290", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\ntestimony_list=[[[0,0] for _ in range(n-1)] for i in range(n)]\nfor i in range(n):\n\ta=int(input())\n\tfor j in range(a):\n\t\tx,y=map(int,input().split())\n\t\ttestimony_list[i][j][0]=x-1\n\t\ttestimony_list[i][j][1]=y\nprint(testimony_list)\n\nans=0\nfor i in range(2**n):\n\tkind_l=[0 for _ in range(n)]\n\tfor j in range(n):\n\t\tif ((i>>j) & 1):\n\t\t\tkind_l[j]=1\n\tprint(kind_l)\n\tfor k in range(n):\n\t\tif kind_l[k]==1:\n\t\t\tfor m in range(a):\n\t\t\t\tsubject=testimony_list[k][m][0]\n\t\t\t\tjudge=testimony_list[k][m][1]\n\t\t\t\tif kind_l[subject]!=judge:\n\t\t\t\t\tkind_l=[0 for _ in range(n)]\n\t\t\t\t\tbreak\n\tans=max(ans,sum(kind_l))\nprint(ans)", "code2": "n=int(input())\ntestimony_list=[[[-1,0] for _ in range(n-1)] for i in range(n)]\nfor i in range(n):\n\ta=int(input())\n\tfor j in range(a):\n\t\tx,y=map(int,input().split())\n\t\ttestimony_list[i][j][0]=x-1\n\t\ttestimony_list[i][j][1]=y\n\nans=0\nfor i in range(2**n):\n\tkind_l=[0 for _ in range(n)]\n\tfor j in range(n):\n\t\tif ((i>>j) & 1):\n\t\t\tkind_l[j]=1\n\tflag=True\n\tfor k in range(n):\n\t\tif kind_l[k]:\n\t\t\tfor m in range(n-1):\n\t\t\t\tsubject=testimony_list[k][m][0]\n\t\t\t\tjudge=testimony_list[k][m][1]\n\t\t\t\tif subject==-1:continue\n\t\t\t\tif kind_l[subject]!=judge:\n\t\t\t\t\tflag=False\n\tif flag:\n\t\tans=max(ans,sum(kind_l))\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577327735", "date2": "1577330504", "bleu_score": "0.8792853132352446", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "3\n2\n2 1\n3 1\n2\n3 1\n1 0\n2\n1 0\n1 0\n", "actual_output": "[[[1, 1], [2, 1]], [[2, 1], [0, 0]], [[0, 0], [0, 0]]]\n[0, 0, 0]\n[1, 0, 0]\n[0, 1, 0]\n[1, 1, 0]\n[0, 0, 1]\n[1, 0, 1]\n[0, 1, 1]\n[1, 1, 1]\n2\n", "expected_output": "2\n\n", "anno_code": ["n=int(input()) # (0): n=3\ntestimony_list=[[[0,0] for _ in range(n-1)] for i in range(n)] # (1): testimony_list\nfor i in range(n): # (2): i=0 (13): i=1 ... (35): NO CHANGE\n\ta=int(input()) # (3): a=2 (14): NO CHANGE (25): NO CHANGE\n\tfor j in range(a): # (4): j=0 (8): j=1 ... (34): NO CHANGE\n\t\tx,y=map(int,input().split()) # (5): x=2, y=1 (9): x=3 ... (31): NO CHANGE\n\t\ttestimony_list[i][j][0]=x-1 # (6): testimony_list (10): testimony_list ... (32): NO CHANGE\n\t\ttestimony_list[i][j][1]=y # (7): testimony_list (11): testimony_list ... (33): NO CHANGE\nprint(testimony_list) # (36): NO CHANGE\n\nans=0 # (37): ans=0\nfor i in range(2**n): # (38): i=0 (56): i=1 ... (268): NO CHANGE\n\tkind_l=[0 for _ in range(n)] # (39): kind_l=[0, 0, 0] (57): NO CHANGE ... (229): kind_l=[0, 0, 0]\n\tfor j in range(n): # (40): j=0 (42): j=1 ... (239): NO CHANGE\n\t\tif ((i>>j) & 1): # (41): NO CHANGE (43): NO CHANGE ... (237): NO CHANGE\n\t\t\tkind_l[j]=1 # (60): kind_l=[1, 0, 0] (87): kind_l=[0, 1, 0] ... (238): kind_l=[1, 1, 1]\n\tprint(kind_l) # (47): NO CHANGE (66): NO CHANGE ... (240): NO CHANGE\n\tfor k in range(n): # (48): k=0 (50): k=1 ... (266): NO CHANGE\n\t\tif kind_l[k]==1: # (49): NO CHANGE (51): NO CHANGE ... (265): NO CHANGE\n\t\t\tfor m in range(a): # (69): m=0 (96): NO CHANGE ... (258): m=1\n\t\t\t\tsubject=testimony_list[k][m][0] # (70): subject=1 (97): subject=2 ... (259): subject=0\n\t\t\t\tjudge=testimony_list[k][m][1] # (71): judge=1 (98): NO CHANGE ... (260): judge=0\n\t\t\t\tif kind_l[subject]!=judge: # (72): NO CHANGE (99): NO CHANGE ... (261): NO CHANGE\n\t\t\t\t\tkind_l=[0 for _ in range(n)] # (73): kind_l=[0, 0, 0] (100): kind_l=[0, 0, 0] ... (262): kind_l=[0, 0, 0]\n\t\t\t\t\tbreak # (74): NO CHANGE (101): NO CHANGE ... (263): NO CHANGE\n\tans=max(ans,sum(kind_l)) # (55): NO CHANGE (80): NO CHANGE ... (267): NO CHANGE\nprint(ans)"], "anno_status": [false], "diff_content": " n=int(input())\n-testimony_list=[[[0,0] for _ in range(n-1)] for i in range(n)]\n+testimony_list=[[[-1,0] for _ in range(n-1)] for i in range(n)]\n for i in range(n):\n \ta=int(input())\n \tfor j in range(a):\n \t\tx,y=map(int,input().split())\n \t\ttestimony_list[i][j][0]=x-1\n \t\ttestimony_list[i][j][1]=y\n-print(testimony_list)\n \n ans=0\n for i in range(2**n):\n \tkind_l=[0 for _ in range(n)]\n \tfor j in range(n):\n \t\tif ((i>>j) & 1):\n \t\t\tkind_l[j]=1\n-\tprint(kind_l)\n+\tflag=True\n \tfor k in range(n):\n-\t\tif kind_l[k]==1:\n-\t\t\tfor m in range(a):\n+\t\tif kind_l[k]:\n+\t\t\tfor m in range(n-1):\n \t\t\t\tsubject=testimony_list[k][m][0]\n \t\t\t\tjudge=testimony_list[k][m][1]\n+\t\t\t\tif subject==-1:continue\n \t\t\t\tif kind_l[subject]!=judge:\n-\t\t\t\t\tkind_l=[0 for _ in range(n)]\n-\t\t\t\t\tbreak\n-\tans=max(ans,sum(kind_l))\n+\t\t\t\t\tflag=False\n+\tif flag:\n+\t\tans=max(ans,sum(kind_l))\n print(ans)\n", "FL_content": " n=int(input())\n-testimony_list=[[[0,0] for _ in range(n-1)] for i in range(n)]\n for i in range(n):\n \ta=int(input())\n \tfor j in range(a):\n \t\tx,y=map(int,input().split())\n \t\ttestimony_list[i][j][0]=x-1\n \t\ttestimony_list[i][j][1]=y\n-print(testimony_list)\n \n ans=0\n for i in range(2**n):\n \tkind_l=[0 for _ in range(n)]\n \tfor j in range(n):\n \t\tif ((i>>j) & 1):\n \t\t\tkind_l[j]=1\n-\tprint(kind_l)\n \tfor k in range(n):\n-\t\tif kind_l[k]==1:\n-\t\t\tfor m in range(a):\n \t\t\t\tsubject=testimony_list[k][m][0]\n \t\t\t\tjudge=testimony_list[k][m][1]\n \t\t\t\tif kind_l[subject]!=judge:\n-\t\t\t\t\tkind_l=[0 for _ in range(n)]\n-\t\t\t\t\tbreak\n-\tans=max(ans,sum(kind_l))\n print(ans)\n", "added_lines": 8, "removed_lines": 8, "code1_lines": 27 }, { "user_id": "u102461423", "problem_id": "p03313", "submission1_id": "s977893688", "submission2_id": "s723557840", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nfrom heapq import heappushpop\n\nN = int(input())\nA = [int(x) for x in input().split()]\n\n\n\n\nB = []\nfor n,a in enumerate(A):\n arr = [(0,0),(a,n)]\n m = n\n while m:\n bit = m & (-m)\n (x,i),(y,j) = B[n-bit]\n heappushpop(arr,(x,i))\n heappushpop(arr,(y,j))\n m -= bit\n B.append(arr)\n\nanswer = [0]\nfor (x,i),(y,j) in B[1:]:\n z = answer[-1]\n if z < x + y:\n z = x + y\n answer.append(z)\nprint('\\n'.join(map(str,answer[1:])))\n\n", "code2": "import sys\ninput = sys.stdin.readline\nfrom heapq import heappushpop\n\nN = int(input())\nA = [int(x) for x in input().split()]\n\n\n\n\nB = []\nfor n,a in enumerate(A):\n arr = [(0,0),(a,n)]\n m = n\n while m:\n bit = m & (-m)\n (x,i),(y,j) = B[n-bit]\n if (x,i) != arr[-1]:\n heappushpop(arr,(x,i))\n if (y,j) != arr[-1]:\n heappushpop(arr,(y,j))\n m -= bit\n B.append(arr)\n\nanswer = [0]\nfor (x,i),(y,j) in B[1:]:\n z = answer[-1]\n if z < x + y:\n z = x + y\n answer.append(z)\nprint('\\n'.join(map(str,answer[1:])))\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1562906985", "date2": "1562907112", "bleu_score": "0.8857138297265591", "code1_test_status": [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 3, "total_score": 103, "input": "3\n12 210 47 33 0 9 17 66\n", "actual_output": "222\n222\n257\n257\n257\n257\n420\n", "expected_output": "222\n222\n257\n257\n257\n257\n276\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n from heapq import heappushpop\n \n N = int(input())\n A = [int(x) for x in input().split()]\n \n \n \n \n B = []\n for n,a in enumerate(A):\n arr = [(0,0),(a,n)]\n m = n\n while m:\n bit = m & (-m)\n (x,i),(y,j) = B[n-bit]\n- heappushpop(arr,(x,i))\n- heappushpop(arr,(y,j))\n+ if (x,i) != arr[-1]:\n+ heappushpop(arr,(x,i))\n+ if (y,j) != arr[-1]:\n+ heappushpop(arr,(y,j))\n m -= bit\n B.append(arr)\n \n answer = [0]\n for (x,i),(y,j) in B[1:]:\n z = answer[-1]\n if z < x + y:\n z = x + y\n answer.append(z)\n print('\\n'.join(map(str,answer[1:])))\n \n \n", "FL_content": " import sys\n input = sys.stdin.readline\n from heapq import heappushpop\n \n N = int(input())\n A = [int(x) for x in input().split()]\n \n \n \n \n B = []\n for n,a in enumerate(A):\n arr = [(0,0),(a,n)]\n m = n\n while m:\n bit = m & (-m)\n (x,i),(y,j) = B[n-bit]\n- heappushpop(arr,(x,i))\n- heappushpop(arr,(y,j))\n m -= bit\n B.append(arr)\n \n answer = [0]\n for (x,i),(y,j) in B[1:]:\n z = answer[-1]\n if z < x + y:\n z = x + y\n answer.append(z)\n print('\\n'.join(map(str,answer[1:])))\n \n \n", "added_lines": 4, "removed_lines": 2, "code1_lines": 31 }, { "user_id": "u819048695", "problem_id": "p03313", "submission1_id": "s091809122", "submission2_id": "s870573826", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nA=list(map(int,input().split()))\ndata=[[] for i in range(2**N)]\ndata[0]=[0,0]\nif A[1]>A[0]:\n data[1]=[1,0]\nelse:\n data[1]=[0,1]\nans=[0]*2**N\nans[1]=sum(A[0:2])\nfor i in range(2,2**N):\n ans[i]=ans[i-1]\n h=[[A[i],i]]\n for j in range(N):\n if i&(1<ans[i]:\n ans[i]=h[0][0]+h[1][0]\n data[i]=[h[0][1],h[1][1]]\n else:\n data[i]=data[i-1][:]\nfor i in range(1,2**N):\n print(ans[i])", "code2": "N=int(input())\nA=list(map(int,input().split()))+[0]\n\ndata=[[] for i in range(2**N)]\n\nfor i in range(1,2**N):\n for j in range(N):\n if i&(1<=A[a]:\n a,b=c,d\n elif A[c]>A[a]:\n a,b=c,a\n elif A[a]>=A[c]>A[b] and a!=c:\n b=c\n elif A[a]>=A[d]>A[b] and a!=d:\n b=d\n MAX[k]=a\n semiMAX[k]=b\n K.append(max(K[-1],A[a]+A[b]))\n\nfor u in K:\n print(u)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1578674872", "date2": "1580744786", "bleu_score": "0.6254154579229406", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 12, "total_score": 103, "input": "3\n3 312 59 33 0 9 17 82\n", "actual_output": "315\n315\n345\n345\n345\n345\n394\n", "expected_output": "315\n315\n371\n371\n371\n371\n394\n\n", "anno_code": ["N=int(input()) # (0): N=3\nA=list(map(int,input().split())) # (1): A=[3, 312, 59, 33, 0, 9, 17, 82]\ndata=[[] for i in range(2**N)] # (2): data\ndata[0]=[0,0] # (3): data\nif A[1]>A[0]: # (4): data\n data[1]=[1,0] # (5): data\nelse:\n data[1]=[0,1]\nans=[0]*2**N # (6): data, ans=[0, 0, 0, 0, 0, 0, 0, 0]\nans[1]=sum(A[0:2]) # (7): data, ans=[0, 315, 0, 0, 0, 0, 0, 0]\nfor i in range(2,2**N): # (8): data=[[0, 0], [1, 0], [], [], [], [], [], []], i=2 (31): data, i=3 ... (184): NO CHANGE\n ans[i]=ans[i-1] # (9): data=[[0, 0], [1, 0], [], [], [], [], [], []], ans=[0, 315, 315, 0, 0, 0, 0, 0] (32): data=[[0, 0], [1, 0], [1, 0], [], [], [], [], []], ans=[0, 315, 315, 315, 0, 0, 0, 0] ... (148): data, ans=[0, 315, 315, 345, 345, 345, 345, 345]\n h=[[A[i],i]] # (10): data=[[0, 0], [1, 0], [], [], [], [], [], []], h (33): data, h ... (149): data=[[0, 0], [1, 0], [1, 0], [1, 3], [1, 3], [1, 3], [1, 3], []], h\n for j in range(N): # (11): data, j=0 (14): data, j=1 ... (179): data\n if i&(1<ans[i]: # (29): data (59): data ... (181): data\n ans[i]=h[0][0]+h[1][0] # (60): data=[[0, 0], [1, 0], [1, 0], [], [], [], [], []], ans=[0, 315, 315, 345, 0, 0, 0, 0] (182): data, ans=[0, 315, 315, 345, 345, 345, 345, 394]\n data[i]=[h[0][1],h[1][1]] # (61): data (183): data\n else:\n data[i]=data[i-1][:] # (30): data (84): data ... (146): data\nfor i in range(1,2**N): # (185): i=1 (187): i=2 ... (197): i=7\n print(ans[i]) # (186): NO CHANGE (188): NO CHANGE ... (198): NO CHANGE\n"], "anno_status": [false], "diff_content": " N=int(input())\n-A=list(map(int,input().split()))\n+A=list(map(int,input().split()))+[0]\n+\n data=[[] for i in range(2**N)]\n-data[0]=[0,0]\n-if A[1]>A[0]:\n- data[1]=[1,0]\n-else:\n- data[1]=[0,1]\n-ans=[0]*2**N\n-ans[1]=sum(A[0:2])\n-for i in range(2,2**N):\n- ans[i]=ans[i-1]\n- h=[[A[i],i]]\n+\n+for i in range(1,2**N):\n for j in range(N):\n if i&(1<ans[i]:\n- ans[i]=h[0][0]+h[1][0]\n- data[i]=[h[0][1],h[1][1]]\n- else:\n- data[i]=data[i-1][:]\n-for i in range(1,2**N):\n- print(ans[i])\n+ data[i].append(i-(1<=A[a]:\n+ a,b=c,d\n+ elif A[c]>A[a]:\n+ a,b=c,a\n+ elif A[a]>=A[c]>A[b] and a!=c:\n+ b=c\n+ elif A[a]>=A[d]>A[b] and a!=d:\n+ b=d\n+ MAX[k]=a\n+ semiMAX[k]=b\n+ K.append(max(K[-1],A[a]+A[b]))\n+\n+for u in K:\n+ print(u)\n", "FL_content": " N=int(input())\n-A=list(map(int,input().split()))\n data=[[] for i in range(2**N)]\n-data[0]=[0,0]\n-if A[1]>A[0]:\n- data[1]=[1,0]\n-else:\n- data[1]=[0,1]\n-ans=[0]*2**N\n-ans[1]=sum(A[0:2])\n-for i in range(2,2**N):\n- ans[i]=ans[i-1]\n- h=[[A[i],i]]\n for j in range(N):\n if i&(1<ans[i]:\n- ans[i]=h[0][0]+h[1][0]\n- data[i]=[h[0][1],h[1][1]]\n- else:\n- data[i]=data[i-1][:]\n-for i in range(1,2**N):\n- print(ans[i])\n", "added_lines": 39, "removed_lines": 28, "code1_lines": 34 }, { "user_id": "u141610915", "problem_id": "p03313", "submission1_id": "s575987890", "submission2_id": "s431962847", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nN = int(input())\na = list(map(int, input().split()))\nzeta = a[: ]\nzeta2 = [0] * (1 << N)\nfor i in range(N):\n for j in range(1 << N):\n if (1 << i) & j:\n if zeta[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = zeta[j]\n zeta[j] = zeta[(1 << i) ^ j]\n elif zeta2[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = zeta[(1 << i) ^ j]\n\nfor i in range((1 << N) - 1):\n zeta[i + 1] = max(zeta[i + 1], zeta[i])\n zeta2[i + 1] = max(zeta2[i + 1], zeta2[i])\n\nfor i in range(1, 1 << N): print(zeta[i] + zeta2[i])", "code2": "import sys\ninput = sys.stdin.readline\nN = int(input())\na = list(map(int, input().split()))\nzeta = a[: ]\nzeta2 = [0] * (1 << N)\nfor i in range(N):\n for j in range(1 << N):\n if (1 << i) & j:\n if zeta[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = max(zeta[j], zeta2[(1 << i) ^ j])\n zeta[j] = zeta[(1 << i) ^ j]\n elif zeta2[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = zeta[(1 << i) ^ j]\n\nres = 0\nfor i in range(1, 1 << N):\n res = max(res, zeta[i] + zeta2[i])\n print(res)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1588799883", "date2": "1588800345", "bleu_score": "0.8326776171286672", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 53, "total_score": 103, "input": "4\n16 9 4 19 82 17 90 42 0 1 41 188 332 80 31 3\n", "actual_output": "25\n25\n35\n98\n99\n172\n172\n172\n172\n172\n270\n414\n414\n422\n520\n", "expected_output": "25\n25\n35\n98\n99\n172\n172\n172\n172\n172\n229\n414\n414\n422\n520\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\nN = int(input()) # (1): N=4\na = list(map(int, input().split())) # (2): a=[16, 9, 4, 19, 82, 17, 90, 42, 0, 1, 41, 188, 332, 80, 31, 3]\nzeta = a[: ] # (3): zeta=[16, 9, 4, 19, 82, 17, 90, 42, 0, 1, 41, 188, 332, 80, 31, 3]\nzeta2 = [0] * (1 << N) # (4): zeta2=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(N): # (5): i=0 (62): i=1 ... (227): NO CHANGE\n for j in range(1 << N): # (6): j=0 (8): j=1 ... (226): NO CHANGE\n if (1 << i) & j: # (7): NO CHANGE (9): NO CHANGE ... (223): NO CHANGE\n if zeta[j] < zeta[(1 << i) ^ j]: # (10): NO CHANGE (17): NO CHANGE ... (224): NO CHANGE\n zeta2[j] = zeta[j] # (11): zeta2=[0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (25): zeta2=[0, 9, 0, 4, 0, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (196): zeta2=[0, 9, 4, 16, 16, 17, 82, 82, 0, 1, 0, 41, 0, 80, 41, 188]\n zeta[j] = zeta[(1 << i) ^ j] # (12): zeta=[16, 16, 4, 19, 82, 17, 90, 42, 0, 1, 41, 188, 332, 80, 31, 3] (26): zeta=[16, 16, 4, 19, 82, 82, 90, 42, 0, 1, 41, 188, 332, 80, 31, 3] ... (197): zeta=[16, 16, 16, 19, 82, 82, 90, 90, 16, 16, 41, 188, 332, 332, 332, 332]\n elif zeta2[j] < zeta[(1 << i) ^ j]: # (18): NO CHANGE (39): NO CHANGE ... (225): NO CHANGE\n zeta2[j] = zeta[(1 << i) ^ j] # (19): zeta2=[0, 9, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (46): zeta2=[0, 9, 0, 4, 0, 17, 0, 42, 0, 0, 0, 41, 0, 0, 0, 0] ... (221): zeta2=[0, 9, 4, 16, 16, 17, 82, 82, 0, 1, 16, 41, 82, 82, 90, 188]\n\nfor i in range((1 << N) - 1): # (228): i=0 (231): i=1 ... (273): NO CHANGE\n zeta[i + 1] = max(zeta[i + 1], zeta[i]) # (229): NO CHANGE (232): NO CHANGE ... (271): NO CHANGE\n zeta2[i + 1] = max(zeta2[i + 1], zeta2[i]) # (230): NO CHANGE (233): zeta2=[0, 9, 9, 16, 16, 17, 82, 82, 0, 1, 16, 41, 82, 82, 90, 188] ... (272): NO CHANGE\n\nfor i in range(1, 1 << N): print(zeta[i] + zeta2[i]) # (274): i=1 (275): i=2 ... (288): i=15\n"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n N = int(input())\n a = list(map(int, input().split()))\n zeta = a[: ]\n zeta2 = [0] * (1 << N)\n for i in range(N):\n for j in range(1 << N):\n if (1 << i) & j:\n if zeta[j] < zeta[(1 << i) ^ j]:\n- zeta2[j] = zeta[j]\n+ zeta2[j] = max(zeta[j], zeta2[(1 << i) ^ j])\n zeta[j] = zeta[(1 << i) ^ j]\n elif zeta2[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = zeta[(1 << i) ^ j]\n \n-for i in range((1 << N) - 1):\n- zeta[i + 1] = max(zeta[i + 1], zeta[i])\n- zeta2[i + 1] = max(zeta2[i + 1], zeta2[i])\n-\n-for i in range(1, 1 << N): print(zeta[i] + zeta2[i])\n+res = 0\n+for i in range(1, 1 << N):\n+ res = max(res, zeta[i] + zeta2[i])\n+ print(res)\n", "FL_content": " import sys\n input = sys.stdin.readline\n N = int(input())\n a = list(map(int, input().split()))\n zeta = a[: ]\n zeta2 = [0] * (1 << N)\n for i in range(N):\n for j in range(1 << N):\n if (1 << i) & j:\n if zeta[j] < zeta[(1 << i) ^ j]:\n- zeta2[j] = zeta[j]\n zeta[j] = zeta[(1 << i) ^ j]\n elif zeta2[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = zeta[(1 << i) ^ j]\n \n-for i in range((1 << N) - 1):\n- zeta[i + 1] = max(zeta[i + 1], zeta[i])\n- zeta2[i + 1] = max(zeta2[i + 1], zeta2[i])\n-\n-for i in range(1, 1 << N): print(zeta[i] + zeta2[i])\n", "added_lines": 5, "removed_lines": 6, "code1_lines": 20 }, { "user_id": "u389910364", "problem_id": "p03313", "submission1_id": "s670005400", "submission2_id": "s670005542", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import itertools\nimport os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\n\nsys.setrecursionlimit(10 ** 9)\nINF = float(\"inf\")\nIINF = 10 ** 18\nMOD = 10 ** 9 + 7\n\n\n\ndef cummax(it, first=-float('inf')):\n \n cm = first\n ret = []\n for v in it:\n cm = max(v, cm)\n ret.append(cm)\n return ret\n\n\nN = int(sys.stdin.buffer.readline())\nA = list(map(int, sys.stdin.buffer.readline().split()))\n\n\n\ndp = [None] * (2 ** N)\nfor k in range(1, 2 ** N):\n dp[k] = (A[0], 0), (A[k], k)\n\ndigits = []\nk = 1\nwhile k < 2 ** N:\n digits.append(k)\n k <<= 1\n\nfor bit in range(2, N + 1):\n for ds in itertools.combinations(digits, bit):\n k = sum(ds)\n for rm in ds:\n pass\n \n \n \n \n\nans = [0] * (2 ** N)\nfor k in range(1, 2 ** N):\n (a1, _), (a2, _) = dp[k]\n ans[k] = a1 + a2\n\nans = cummax(ans[1:])\nprint(*ans, sep='\\n')\n", "code2": "import os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\n\nsys.setrecursionlimit(10 ** 9)\nINF = float(\"inf\")\nIINF = 10 ** 18\nMOD = 10 ** 9 + 7\n\n\n\ndef cummax(it, first=-float('inf')):\n \n cm = first\n ret = []\n for v in it:\n cm = max(v, cm)\n ret.append(cm)\n return ret\n\n\nN = int(sys.stdin.buffer.readline())\nA = list(map(int, sys.stdin.buffer.readline().split()))\nSIZE = 2 ** N\n\n\n\ndp = [None] * SIZE\nfor k in range(1, SIZE):\n dp[k] = list(sorted([(A[0], 0), (A[k], k)]))\n\nfor k in range(1, SIZE):\n mask = k\n while mask < SIZE - 1:\n \n next_k = (mask + 1) | k\n mask |= next_k\n\n a1, a2 = dp[k]\n b1, b2 = dp[next_k]\n if a1 > b2:\n \n dp[next_k] = dp[k]\n elif b1 > a2:\n \n pass\n elif a2 > b2:\n dp[next_k] = b2, a2\n elif b2 > a2:\n dp[next_k] = a2, b2\n\nans = [0] * SIZE\nfor k in range(1, SIZE):\n (a1, _), (a2, _) = dp[k]\n ans[k] = a1 + a2\n\nans = cummax(ans[1:])\nprint(*ans, sep='\\n')\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575525133", "date2": "1575610013", "bleu_score": "0.7207804108146525", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "4\n7 2 0 1 19 3 25 34 -3 -2 43 215 11 6 28 1\n", "actual_output": "9\n9\n9\n26\n26\n32\n41\n41\n41\n50\n222\n222\n222\n222\n222\n", "expected_output": "9\n9\n9\n26\n26\n44\n59\n59\n59\n59\n258\n258\n258\n258\n258\n\n", "anno_code": ["import itertools\nimport os\nimport sys\n\nif os.getenv(\"LOCAL\"): # (0): NO CHANGE\n sys.stdin = open(\"_in.txt\", \"r\")\n\nsys.setrecursionlimit(10 ** 9) # (1): NO CHANGE\nINF = float(\"inf\") # (2): INF=inf\nIINF = 10 ** 18 # (3): IINF=1000000000000000000\nMOD = 10 ** 9 + 7 # (4): MOD=1000000007\n\n\n\ndef cummax(it, first=-float('inf')): # (5): cummax=\n \n cm = first # (199): cm=-inf\n ret = [] # (200): ret=[]\n for v in it: # (201): v=9 (204): v=7 ... (246): itertools=, os=, sys=, INF=inf, IINF=1000000000000000000, MOD=1000000007, cummax=, N=4, A=[7, 2, 0, 1, 19, 3, 25, 34, -3, -2, 43, 215, 11, 6, 28, 1], dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=15, digits=[1, 2, 4, 8], bit=4, ds=(1, 2, 4, 8), rm=8, ans=[9, 9, 9, 26, 26, 32, 41, 41, 41, 50, 222, 222, 222, 222, 222], a1=7, _=15, a2=1\n cm = max(v, cm) # (202): cm=9 (205): NO CHANGE ... (244): NO CHANGE\n ret.append(cm) # (203): ret=[9] (206): ret=[9, 9] ... (245): ret=[9, 9, 9, 26, 26, 32, 41, 41, 41, 50, 222, 222, 222, 222, 222]\n return ret\n\n\nN = int(sys.stdin.buffer.readline()) # (6): N=4\nA = list(map(int, sys.stdin.buffer.readline().split())) # (7): A=[7, 2, 0, 1, 19, 3, 25, 34, -3, -2, 43, 215, 11, 6, 28, 1]\n\n\n\ndp = [None] * (2 ** N) # (8): dp=[None, None, None, None, None, None, None, None, None, None, None, None, None, None, None, None]\nfor k in range(1, 2 ** N): # (9): k=1 (11): dp=[None, ((7, 0), (2, 1)), None, None, None, None, None, None, None, None, None, None, None, None, None, None], k=2 ... (39): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))]\n dp[k] = (A[0], 0), (A[k], k) # (10): dp=[None, ((7, 0), (2, 1)), None, None, None, None, None, None, None, None, None, None, None, None, None, None] (12): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), None, None, None, None, None, None, None, None, None, None, None, None, None] ... (38): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))]\n\ndigits = [] # (40): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], digits=[]\nk = 1 # (41): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=1\nwhile k < 2 ** N: # (42): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))] (45): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))] ... (54): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))]\n digits.append(k) # (43): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], digits=[1] (46): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], digits=[1, 2] ... (52): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], digits=[1, 2, 4, 8]\n k <<= 1 # (44): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=2 (47): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=4 ... (53): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=16\n\nfor bit in range(2, N + 1): # (55): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], bit=2 (99): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], bit=3 ... (150): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))]\n for ds in itertools.combinations(digits, bit): # (56): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], ds=(1, 2) (63): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], ds=(1, 4) ... (149): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))]\n k = sum(ds) # (57): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=3 (64): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=5 ... (139): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=15\n for rm in ds: # (58): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], rm=1 (60): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], rm=2 ... (148): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))]\n pass # (59): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))] (61): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))] ... (147): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))]\n \n \n \n \n\nans = [0] * (2 ** N) # (151): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], ans=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor k in range(1, 2 ** N): # (152): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=1 (155): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=2 ... (197): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))]\n (a1, _), (a2, _) = dp[k] # (153): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], a1=7, _=1, a2=2 (156): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], _=2, a2=0 ... (195): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], _=15, a2=1\n ans[k] = a1 + a2 # (154): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], ans=[0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (157): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], ans=[0, 9, 7, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (196): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], ans=[0, 9, 7, 8, 26, 10, 32, 41, 4, 5, 50, 222, 18, 13, 35, 8]\n\nans = cummax(ans[1:]) # (198): it=[9, 7, 8, 26, 10, 32, 41, 4, 5, 50, 222, 18, 13, 35, 8], first=-inf\nprint(*ans, sep='\\n')\n"], "anno_status": [false], "diff_content": "-import itertools\n import os\n import sys\n \n if os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\n \n sys.setrecursionlimit(10 ** 9)\n INF = float(\"inf\")\n IINF = 10 ** 18\n MOD = 10 ** 9 + 7\n \n \n \n def cummax(it, first=-float('inf')):\n \n cm = first\n ret = []\n for v in it:\n cm = max(v, cm)\n ret.append(cm)\n return ret\n \n \n N = int(sys.stdin.buffer.readline())\n A = list(map(int, sys.stdin.buffer.readline().split()))\n+SIZE = 2 ** N\n \n \n \n-dp = [None] * (2 ** N)\n-for k in range(1, 2 ** N):\n- dp[k] = (A[0], 0), (A[k], k)\n+dp = [None] * SIZE\n+for k in range(1, SIZE):\n+ dp[k] = list(sorted([(A[0], 0), (A[k], k)]))\n \n-digits = []\n-k = 1\n-while k < 2 ** N:\n- digits.append(k)\n- k <<= 1\n+for k in range(1, SIZE):\n+ mask = k\n+ while mask < SIZE - 1:\n+ \n+ next_k = (mask + 1) | k\n+ mask |= next_k\n \n-for bit in range(2, N + 1):\n- for ds in itertools.combinations(digits, bit):\n- k = sum(ds)\n- for rm in ds:\n- pass\n- \n- \n+ a1, a2 = dp[k]\n+ b1, b2 = dp[next_k]\n+ if a1 > b2:\n \n+ dp[next_k] = dp[k]\n+ elif b1 > a2:\n \n+ pass\n+ elif a2 > b2:\n+ dp[next_k] = b2, a2\n+ elif b2 > a2:\n+ dp[next_k] = a2, b2\n \n-ans = [0] * (2 ** N)\n-for k in range(1, 2 ** N):\n+ans = [0] * SIZE\n+for k in range(1, SIZE):\n (a1, _), (a2, _) = dp[k]\n ans[k] = a1 + a2\n \n ans = cummax(ans[1:])\n print(*ans, sep='\\n')\n \n", "FL_content": "-import itertools\n import os\n import sys\n \n if os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\n \n sys.setrecursionlimit(10 ** 9)\n INF = float(\"inf\")\n IINF = 10 ** 18\n MOD = 10 ** 9 + 7\n \n \n \n def cummax(it, first=-float('inf')):\n \n cm = first\n ret = []\n for v in it:\n cm = max(v, cm)\n ret.append(cm)\n return ret\n \n \n N = int(sys.stdin.buffer.readline())\n A = list(map(int, sys.stdin.buffer.readline().split()))\n \n \n \n-dp = [None] * (2 ** N)\n-for k in range(1, 2 ** N):\n- dp[k] = (A[0], 0), (A[k], k)\n \n-digits = []\n-k = 1\n-while k < 2 ** N:\n- digits.append(k)\n- k <<= 1\n \n-for bit in range(2, N + 1):\n- for ds in itertools.combinations(digits, bit):\n- k = sum(ds)\n- for rm in ds:\n- pass\n- \n- \n \n \n \n-ans = [0] * (2 ** N)\n-for k in range(1, 2 ** N):\n (a1, _), (a2, _) = dp[k]\n ans[k] = a1 + a2\n \n ans = cummax(ans[1:])\n print(*ans, sep='\\n')\n \n", "added_lines": 22, "removed_lines": 18, "code1_lines": 57 }, { "user_id": "u794173881", "problem_id": "p03313", "submission1_id": "s955219007", "submission2_id": "s817713011", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def max2(a, b, c, d):\n vals = sorted((a, b, c, d), reverse=True)\n return vals[0], vals[1]\n\n\nn = int(input())\na = list(map(int, input().split()))\n\ndp = [[0] * (1 << n) for i in range(n + 1)]\ndq = [[0] * (1 << n) for i in range(n + 1)]\nfor i in range(1 << n):\n dp[0][i] = a[i]\n\nfor i in range(n):\n for bit_state in range(1 << n):\n if (1 << i) & bit_state:\n first, second = max2(dp[i][bit_state], dq[i][bit_state], dp[i][bit_state ^ (1 << i)], dq[i][bit_state ^ (1 << i)])\n else:\n first, second = dp[i][bit_state], dq[i][bit_state]\n dp[i + 1][bit_state], dq[i + 1][bit_state] = first, second\n \nfor i in range((1 << n) - 1):\n dp[-1][i + 1] = max(dp[-1][i + 1], dp[-1][i])\n dq[-1][i + 1] = max(dq[-1][i + 1], dq[-1][i])\n\n\n\nfor i in range(1, 1 << n):\n print(dp[-1][i] + dq[-1][i])", "code2": "def max2(a, b, c, d):\n vals = sorted((a, b, c, d), reverse=True)\n return vals[0], vals[1]\n\n\nn = int(input())\na = list(map(int, input().split()))\n\ndp = [[0] * (1 << n) for i in range(n + 1)]\ndq = [[0] * (1 << n) for i in range(n + 1)]\nfor i in range(1 << n):\n dp[0][i] = a[i]\n\nfor i in range(n):\n for bit_state in range(1 << n):\n if (1 << i) & bit_state:\n first, second = max2(dp[i][bit_state], dq[i][bit_state], dp[i][bit_state ^ (1 << i)], dq[i][bit_state ^ (1 << i)])\n else:\n first, second = dp[i][bit_state], dq[i][bit_state]\n dp[i + 1][bit_state], dq[i + 1][bit_state] = first, second\n\nans = 0\nfor i in range(1, 1 << n):\n ans = max(ans, dp[-1][i] + dq[-1][i])\n print(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589258327", "date2": "1589259073", "bleu_score": "0.84027833397205", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 53, "total_score": 103, "input": "4\n16 7 2 19 82 17 45 53 0 0 41 175 332 60 31 3\n", "actual_output": "23\n23\n35\n98\n99\n127\n135\n135\n135\n135\n228\n414\n414\n414\n507\n", "expected_output": "23\n23\n35\n98\n99\n127\n135\n135\n135\n135\n216\n414\n414\n414\n507\n\n", "anno_code": ["def max2(a, b, c, d): # (0): max2=\n vals = sorted((a, b, c, d), reverse=True) # (46): max2=, n=4, a=[16, 7, 2, 19, 82, 17, 45, 53, 0, 0, 41, 175, 332, 60, 31, 3], dp=[[16, 7, 2, 19, 82, 17, 45, 53, 0, 0, 41, 175, 332, 60, 31, 3], [16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], dq=[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], i=0, bit_state=1, first=16, second=7 (55): max2=, n=4, a=[16, 7, 2, 19, 82, 17, 45, 53, 0, 0, 41, 175, 332, 60, 31, 3], dp=[[16, 7, 2, 19, 82, 17, 45, 53, 0, 0, 41, 175, 332, 60, 31, 3], [16, 16, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], dq=[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 7, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], i=0, bit_state=3, first=19, second=2 ... (331): max2=, n=4, a=[16, 7, 2, 19, 82, 17, 45, 53, 0, 0, 41, 175, 332, 60, 31, 3], dp=[[16, 7, 2, 19, 82, 17, 45, 53, 0, 0, 41, 175, 332, 60, 31, 3], [16, 16, 2, 19, 82, 82, 45, 53, 0, 0, 41, 175, 332, 332, 31, 31], [16, 16, 16, 19, 82, 82, 82, 82, 0, 0, 41, 175, 332, 332, 332, 332], [16, 16, 16, 19, 82, 82, 82, 82, 0, 0, 41, 175, 332, 332, 332, 332], [16, 16, 16, 19, 82, 82, 82, 82, 16, 16, 41, 175, 332, 332, 332, 0]], dq, i=3, bit_state=15, first=332, second=175\n return vals[0], vals[1]\n\n\nn = int(input()) # (1): n=4\na = list(map(int, input().split())) # (2): a=[16, 7, 2, 19, 82, 17, 45, 53, 0, 0, 41, 175, 332, 60, 31, 3]\n\ndp = [[0] * (1 << n) for i in range(n + 1)] # (3): dp\ndq = [[0] * (1 << n) for i in range(n + 1)] # (4): dq\nfor i in range(1 << n): # (5): i=0 (7): i=1 ... (37): NO CHANGE\n dp[0][i] = a[i] # (6): dp (8): dp ... (36): dp\n\nfor i in range(n): # (38): i=0 (112): i=1 ... (334): NO CHANGE\n for bit_state in range(1 << n): # (39): bit_state=0 (43): bit_state=1 ... (333): NO CHANGE\n if (1 << i) & bit_state: # (40): NO CHANGE (44): NO CHANGE ... (329): NO CHANGE\n first, second = max2(dp[i][bit_state], dq[i][bit_state], dp[i][bit_state ^ (1 << i)], dq[i][bit_state ^ (1 << i)]) # (45): a=7, b=0, c=16, d=0 (54): a=19, b=0, c=2, d=0 ... (330): a=332, b=175, c=82, d=53\n else:\n first, second = dp[i][bit_state], dq[i][bit_state] # (41): first=16, second=0 (50): first=2, second=0 ... (291): second=53\n dp[i + 1][bit_state], dq[i + 1][bit_state] = first, second # (42): dp (47): dp, dq ... (332): dp=[[16, 7, 2, 19, 82, 17, 45, 53, 0, 0, 41, 175, 332, 60, 31, 3], [16, 16, 2, 19, 82, 82, 45, 53, 0, 0, 41, 175, 332, 332, 31, 31], [16, 16, 16, 19, 82, 82, 82, 82, 0, 0, 41, 175, 332, 332, 332, 332], [16, 16, 16, 19, 82, 82, 82, 82, 0, 0, 41, 175, 332, 332, 332, 332], [16, 16, 16, 19, 82, 82, 82, 82, 16, 16, 41, 175, 332, 332, 332, 332]], dq\n \nfor i in range((1 << n) - 1): # (335): i=0 (338): i=1 ... (380): NO CHANGE\n dp[-1][i + 1] = max(dp[-1][i + 1], dp[-1][i]) # (336): NO CHANGE (339): NO CHANGE ... (378): NO CHANGE\n dq[-1][i + 1] = max(dq[-1][i + 1], dq[-1][i]) # (337): NO CHANGE (340): dq ... (379): NO CHANGE\n\n\n\nfor i in range(1, 1 << n): # (381): i=1 (383): i=2 ... (409): i=15\n print(dp[-1][i] + dq[-1][i]) # (382): NO CHANGE (384): NO CHANGE ... (410): NO CHANGE\n"], "anno_status": [false], "diff_content": " def max2(a, b, c, d):\n vals = sorted((a, b, c, d), reverse=True)\n return vals[0], vals[1]\n \n \n n = int(input())\n a = list(map(int, input().split()))\n \n dp = [[0] * (1 << n) for i in range(n + 1)]\n dq = [[0] * (1 << n) for i in range(n + 1)]\n for i in range(1 << n):\n dp[0][i] = a[i]\n \n for i in range(n):\n for bit_state in range(1 << n):\n if (1 << i) & bit_state:\n first, second = max2(dp[i][bit_state], dq[i][bit_state], dp[i][bit_state ^ (1 << i)], dq[i][bit_state ^ (1 << i)])\n else:\n first, second = dp[i][bit_state], dq[i][bit_state]\n dp[i + 1][bit_state], dq[i + 1][bit_state] = first, second\n- \n-for i in range((1 << n) - 1):\n- dp[-1][i + 1] = max(dp[-1][i + 1], dp[-1][i])\n- dq[-1][i + 1] = max(dq[-1][i + 1], dq[-1][i])\n-\n-\n \n+ans = 0\n for i in range(1, 1 << n):\n- print(dp[-1][i] + dq[-1][i])\n+ ans = max(ans, dp[-1][i] + dq[-1][i])\n+ print(ans)\n", "FL_content": " def max2(a, b, c, d):\n vals = sorted((a, b, c, d), reverse=True)\n return vals[0], vals[1]\n \n \n n = int(input())\n a = list(map(int, input().split()))\n \n dp = [[0] * (1 << n) for i in range(n + 1)]\n dq = [[0] * (1 << n) for i in range(n + 1)]\n for i in range(1 << n):\n dp[0][i] = a[i]\n \n for i in range(n):\n for bit_state in range(1 << n):\n if (1 << i) & bit_state:\n first, second = max2(dp[i][bit_state], dq[i][bit_state], dp[i][bit_state ^ (1 << i)], dq[i][bit_state ^ (1 << i)])\n else:\n first, second = dp[i][bit_state], dq[i][bit_state]\n dp[i + 1][bit_state], dq[i + 1][bit_state] = first, second\n- \n-for i in range((1 << n) - 1):\n- dp[-1][i + 1] = max(dp[-1][i + 1], dp[-1][i])\n- dq[-1][i + 1] = max(dq[-1][i + 1], dq[-1][i])\n-\n-\n \n for i in range(1, 1 << n):\n- print(dp[-1][i] + dq[-1][i])\n", "added_lines": 3, "removed_lines": 7, "code1_lines": 29 }, { "user_id": "u062147869", "problem_id": "p03313", "submission1_id": "s179002735", "submission2_id": "s793967945", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from copy import deepcopy\nN=int(input())\nA=[int(i) for i in input().split()]\n\ndef chmax(a,b):\n if a[0]\n if a[0], N=3, A=[2, 312, 111, 33, 0, 9, 17, 82], chmax=, dp=[(2, 0), (312, 2), (111, 2), (312, 111), (2, 0), (312, 9), (111, 17), (312, 111)], i=2, j=7\n return b\n elif a[0], N=3, A=[2, 312, 111, 33, 0, 9, 17, 82], chmax=, dp=[(2, 0), (312, 2), (111, 0), (111, 33), (0, 0), (9, 0), (17, 0), (82, 0)], i=0, j=3 (54): deepcopy=, N=3, A=[2, 312, 111, 33, 0, 9, 17, 82], chmax=, dp=[(2, 0), (312, 2), (111, 2), (312, 111), (0, 0), (9, 0), (17, 0), (82, 17)], i=1, j=3 ... (98): deepcopy=, N=3, A=[2, 312, 111, 33, 0, 9, 17, 82], chmax=, dp=[(2, 0), (312, 2), (111, 2), (312, 111), (2, 0), (312, 9), (111, 17), (82, 17)], i=2, j=6\n elif a[1], N=3, A=[2, 312, 111, 33, 0, 9, 17, 82], chmax=, dp=[(2, 0), (312, 2), (111, 0), (33, 0), (0, 0), (9, 0), (17, 0), (82, 0)], i=0, j=1 (28): deepcopy=, N=3, A=[2, 312, 111, 33, 0, 9, 17, 82], chmax=, dp=[(2, 0), (312, 2), (111, 0), (111, 33), (0, 0), (9, 0), (17, 0), (82, 0)], i=0, j=5 ... (70): deepcopy=, N=3, A=[2, 312, 111, 33, 0, 9, 17, 82], chmax=, dp=[(2, 0), (312, 2), (111, 2), (312, 111), (0, 0), (9, 0), (17, 0), (82, 17)], i=1, j=7\n return (a[0],b[0])\n else:\n return a\ndp=[(A[i],0) for i in range(1<\nN = int(input()) # (1): N=4\na = list(map(int, input().split())) # (2): a=[16, 1, 1, 112, 32, 17, 97, 8, 1, 1, 25, 72, 84, 17, 56, 82]\nzeta = a[: ] # (3): zeta=[16, 1, 1, 112, 32, 17, 97, 8, 1, 1, 25, 72, 84, 17, 56, 82]\nzeta2 = [0] * (1 << N) # (4): zeta2=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(N): # (5): i=0 (63): i=1 ... (231): NO CHANGE\n for j in range(1 << N): # (6): j=0 (8): j=1 ... (230): NO CHANGE\n if (1 << i) & j: # (7): NO CHANGE (9): NO CHANGE ... (226): NO CHANGE\n if zeta[j] < zeta[(1 << i) ^ j]: # (10): NO CHANGE (17): NO CHANGE ... (227): NO CHANGE\n zeta2[j] = max(zeta[j], zeta2[(1 << i) ^ j]) # (11): zeta2=[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (25): zeta2=[0, 1, 0, 1, 0, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (228): zeta2=[0, 1, 1, 16, 16, 17, 32, 97, 1, 1, 16, 72, 32, 32, 84, 97]\n zeta[j] = zeta[(1 << i) ^ j] # (12): zeta=[16, 16, 1, 112, 32, 17, 97, 8, 1, 1, 25, 72, 84, 17, 56, 82] (26): zeta=[16, 16, 1, 112, 32, 32, 97, 8, 1, 1, 25, 72, 84, 17, 56, 82] ... (229): zeta=[16, 16, 16, 112, 32, 32, 97, 112, 16, 16, 25, 112, 84, 84, 97, 112]\n elif zeta2[j] < zeta[(1 << i) ^ j]: # (18): NO CHANGE (39): NO CHANGE ... (218): NO CHANGE\n zeta2[j] = zeta[(1 << i) ^ j] # (19): zeta2=[0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (40): zeta2=[0, 1, 0, 1, 0, 17, 0, 8, 0, 1, 0, 0, 0, 0, 0, 0] ... (219): zeta2=[0, 1, 1, 16, 16, 17, 32, 97, 1, 1, 16, 72, 32, 32, 56, 82]\n\nfor i in range((1 << N) - 1): # (232): i=0 (235): i=1 ... (277): NO CHANGE\n zeta[i + 1] = max(zeta[i + 1], zeta[i]) # (233): NO CHANGE (236): NO CHANGE ... (275): NO CHANGE\n zeta2[i + 1] = max(zeta2[i + 1], zeta2[i]) # (234): NO CHANGE (237): NO CHANGE ... (276): NO CHANGE\n\nfor i in range(1, 1 << N): print(zeta[i] + zeta2[i]) # (278): i=1 (279): i=2 ... (292): i=15\n"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n N = int(input())\n a = list(map(int, input().split()))\n zeta = a[: ]\n zeta2 = [0] * (1 << N)\n for i in range(N):\n for j in range(1 << N):\n if (1 << i) & j:\n if zeta[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = max(zeta[j], zeta2[(1 << i) ^ j])\n zeta[j] = zeta[(1 << i) ^ j]\n elif zeta2[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = zeta[(1 << i) ^ j]\n \n-for i in range((1 << N) - 1):\n- zeta[i + 1] = max(zeta[i + 1], zeta[i])\n- zeta2[i + 1] = max(zeta2[i + 1], zeta2[i])\n-\n-for i in range(1, 1 << N): print(zeta[i] + zeta2[i])\n+res = 0\n+for i in range(1, 1 << N):\n+ res = max(res, zeta[i] + zeta2[i])\n+ print(res)\n", "FL_content": " import sys\n input = sys.stdin.readline\n N = int(input())\n a = list(map(int, input().split()))\n zeta = a[: ]\n zeta2 = [0] * (1 << N)\n for i in range(N):\n for j in range(1 << N):\n if (1 << i) & j:\n if zeta[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = max(zeta[j], zeta2[(1 << i) ^ j])\n zeta[j] = zeta[(1 << i) ^ j]\n elif zeta2[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = zeta[(1 << i) ^ j]\n \n-for i in range((1 << N) - 1):\n- zeta[i + 1] = max(zeta[i + 1], zeta[i])\n- zeta2[i + 1] = max(zeta2[i + 1], zeta2[i])\n-\n-for i in range(1, 1 << N): print(zeta[i] + zeta2[i])\n", "added_lines": 4, "removed_lines": 5, "code1_lines": 20 }, { "user_id": "u357230322", "problem_id": "p02865", "submission1_id": "s294286329", "submission2_id": "s306644077", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nif n%2==0:\n print((n/2)-1)\nelse:\n print((n-1)/2)", "code2": "n=int(input())\nif n%2==0:\n print(int((n/2)-1))\nelse:\n print(int((n-1)/2))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573355968", "date2": "1573356812", "bleu_score": "0.8419798704006486", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 46, "input": "11230\n", "actual_output": "5614.0\n", "expected_output": "5614\n\n", "anno_code": ["n=int(input()) # (0): n=11230\nif n%2==0: # (1): NO CHANGE\n print((n/2)-1)\nelse:\n print((n-1)/2)"], "anno_status": [true], "diff_content": " n=int(input())\n if n%2==0:\n- print((n/2)-1)\n+ print(int((n/2)-1))\n else:\n- print((n-1)/2)\n+ print(int((n-1)/2))\n+\n", "FL_content": " n=int(input())\n if n%2==0:\n- print((n/2)-1)\n else:\n- print((n-1)/2)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u246975555", "problem_id": "p02865", "submission1_id": "s642419882", "submission2_id": "s367690282", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nif n % 2 == 0:\n print(n/2 - 1)\nelse:\n print((n-1)/2)", "code2": "n = int(input())\nif n % 2 == 0:\n print(int(n/2 - 1))\nelse:\n print(int((n-1)/2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573499691", "date2": "1573499747", "bleu_score": "0.8645261500563438", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 46, "input": "825\n", "actual_output": "412.0\n", "expected_output": "412\n\n", "anno_code": ["n = int(input()) # (0): n=825\nif n % 2 == 0: # (1): NO CHANGE\n print(n/2 - 1)\nelse:\n print((n-1)/2)"], "anno_status": [true], "diff_content": " n = int(input())\n if n % 2 == 0:\n- print(n/2 - 1)\n+ print(int(n/2 - 1))\n else:\n- print((n-1)/2)\n+ print(int((n-1)/2))\n", "FL_content": " n = int(input())\n if n % 2 == 0:\n- print(n/2 - 1)\n else:\n- print((n-1)/2)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u148551245", "problem_id": "p02865", "submission1_id": "s245785026", "submission2_id": "s406527640", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nif n % 2 == 0:\n print((n - 1) / 2)\nelse:\n print((n - 1) / 2 - 1)", "code2": "n = int(input())\nif n % 2 == 1:\n print(int((n - 1) / 2))\nelse:\n print(int(n / 2 - 1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573351437", "date2": "1573352078", "bleu_score": "0.8440051448445851", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 46, "input": "27115\n", "actual_output": "13556.0\n", "expected_output": "13557\n\n", "anno_code": ["n = int(input()) # (0): n=27115\nif n % 2 == 0: # (1): NO CHANGE\n print((n - 1) / 2)\nelse:\n print((n - 1) / 2 - 1)"], "anno_status": [true], "diff_content": " n = int(input())\n-if n % 2 == 0:\n- print((n - 1) / 2)\n+if n % 2 == 1:\n+ print(int((n - 1) / 2))\n else:\n- print((n - 1) / 2 - 1)\n+ print(int(n / 2 - 1))\n", "FL_content": " n = int(input())\n-if n % 2 == 0:\n- print((n - 1) / 2)\n else:\n- print((n - 1) / 2 - 1)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 5 }, { "user_id": "u169138653", "problem_id": "p02865", "submission1_id": "s478786720", "submission2_id": "s016354485", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nif n%2==0:\n print(n/2-1)\nelse:\n print((n-1)/2)", "code2": "n=int(input())\nif n%2==0:\n print(int(n/2)-1)\nelse:\n print(int((n-1)/2))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573351651", "date2": "1573352140", "bleu_score": "0.8271094002583693", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 46, "input": "64455\n", "actual_output": "32227.0\n", "expected_output": "32227\n\n", "anno_code": ["n=int(input()) # (0): n=64455\nif n%2==0: # (1): NO CHANGE\n print(n/2-1)\nelse:\n print((n-1)/2)"], "anno_status": [true], "diff_content": " n=int(input())\n if n%2==0:\n- print(n/2-1)\n+ print(int(n/2)-1)\n else:\n- print((n-1)/2)\n+ print(int((n-1)/2))\n+\n", "FL_content": " n=int(input())\n if n%2==0:\n- print(n/2-1)\n else:\n- print((n-1)/2)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u991269553", "problem_id": "p02865", "submission1_id": "s293510680", "submission2_id": "s057564070", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = n/2\nprint(int(round(a)-1))", "code2": "import math\nn = int(input())\na = n/2\nprint(math.ceil(a)-1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573357963", "date2": "1573358229", "bleu_score": "0.6161954572478545", "code1_test_status": [1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1], "code1_test_score": 31, "total_score": 46, "input": "1339977\n", "actual_output": "669987\n", "expected_output": "669988\n\n", "anno_code": ["n = int(input()) # (0): n=1339977\na = n/2 # (1): a=669988.5\nprint(int(round(a)-1))"], "anno_status": [true], "diff_content": "+import math\n n = int(input())\n a = n/2\n-print(int(round(a)-1))\n+print(math.ceil(a)-1)\n", "FL_content": " n = int(input())\n a = n/2\n-print(int(round(a)-1))\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u858670323", "problem_id": "p02865", "submission1_id": "s472749224", "submission2_id": "s930941616", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nif N % 2 == 0:\n print(N/2 -1)\nelse:\n print((N+1)/2-1)", "code2": "N = int(input())\nif N % 2 == 0:\n print(int(N/2 -1))\nelse:\n print(int((N+1)/2-1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573353506", "date2": "1573353564", "bleu_score": "0.8725600545514082", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 46, "input": "23008\n", "actual_output": "11503.0\n", "expected_output": "11503\n\n", "anno_code": ["N = int(input()) # (0): N=23008\nif N % 2 == 0: # (1): NO CHANGE\n print(N/2 -1)\nelse:\n print((N+1)/2-1)"], "anno_status": [true], "diff_content": " N = int(input())\n if N % 2 == 0:\n- print(N/2 -1)\n+ print(int(N/2 -1))\n else:\n- print((N+1)/2-1)\n+ print(int((N+1)/2-1))\n", "FL_content": " N = int(input())\n if N % 2 == 0:\n- print(N/2 -1)\n else:\n- print((N+1)/2-1)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u121921603", "problem_id": "p02865", "submission1_id": "s714047246", "submission2_id": "s775572162", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nif n%2 == 0:\n print(n>>1-1)\nelse:\n print(n>>1)\n", "code2": "n=int(input())\nif n%2 == 0:\n print((n>>1)-1)\nelse:\n print(n>>1)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1573351529", "date2": "1573351653", "bleu_score": "0.9370299028591313", "code1_test_status": [1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 31, "total_score": 46, "input": "1412384\n", "actual_output": "1412384\n", "expected_output": "706191\n\n", "anno_code": ["n=int(input()) # (0): n=1412384\nif n%2 == 0: # (1): NO CHANGE\n print(n>>1-1)\nelse:\n print(n>>1)\n"], "anno_status": [true], "diff_content": " n=int(input())\n if n%2 == 0:\n- print(n>>1-1)\n+ print((n>>1)-1)\n else:\n print(n>>1)\n \n", "FL_content": " n=int(input())\n if n%2 == 0:\n- print(n>>1-1)\n else:\n print(n>>1)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u385244248", "problem_id": "p02865", "submission1_id": "s467964171", "submission2_id": "s509473812", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nif N%2 ==1:\n print(int(N+1)/2-1)\nelse:\n print(int(N/2)-1)\n \n", "code2": "N = int(input())\nif N%2 == 0:\n print(int((N/2)-1))\nelse:\n print(int((N+1)/2)-1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575577617", "date2": "1575579714", "bleu_score": "0.8157345170518987", "code1_test_status": [0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 15, "total_score": 46, "input": "999999\n", "actual_output": "499999.0\n", "expected_output": "499999\n", "anno_code": ["N = int(input()) # (0): N=999999\nif N%2 ==1: # (1): NO CHANGE\n print(int(N+1)/2-1)\nelse:\n print(int(N/2)-1)\n \n"], "anno_status": [true], "diff_content": " N = int(input())\n-if N%2 ==1:\n- print(int(N+1)/2-1)\n+if N%2 == 0:\n+ print(int((N/2)-1))\n else:\n- print(int(N/2)-1)\n- \n-\n+ print(int((N+1)/2)-1)\n", "FL_content": " N = int(input())\n-if N%2 ==1:\n- print(int(N+1)/2-1)\n else:\n- print(int(N/2)-1)\n- \n-\n", "added_lines": 3, "removed_lines": 5, "code1_lines": 7 }, { "user_id": "u896775745", "problem_id": "p02865", "submission1_id": "s315525727", "submission2_id": "s015011296", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nN = int(input())\nans = N/2\n\nif N == 1:\n\tprint(1)\nelse:\n\tprint(math.floor(ans))", "code2": "import math\n\nN = int(input())\nans = math.floor(N / 2)\n\nif N % 2 == 0:\n print(ans - 1)\nelse:\n print(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573476112", "date2": "1573476623", "bleu_score": "0.7029013068600114", "code1_test_status": [1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 31, "total_score": 46, "input": "133044\n", "actual_output": "66522\n", "expected_output": "66521\n\n", "anno_code": ["import math\n\nN = int(input()) # (0): N=133044\nans = N/2 # (1): ans=66522.0\n\nif N == 1: # (2): NO CHANGE\n\tprint(1)\nelse:\n\tprint(math.floor(ans))"], "anno_status": [true], "diff_content": " import math\n \n N = int(input())\n-ans = N/2\n+ans = math.floor(N / 2)\n \n-if N == 1:\n-\tprint(1)\n+if N % 2 == 0:\n+ print(ans - 1)\n else:\n-\tprint(math.floor(ans))\n+ print(ans)\n", "FL_content": " import math\n \n N = int(input())\n-ans = N/2\n \n-if N == 1:\n-\tprint(1)\n else:\n-\tprint(math.floor(ans))\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 9 }, { "user_id": "u148551245", "problem_id": "p02865", "submission1_id": "s602554238", "submission2_id": "s406527640", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nif n % 2 == 1:\n print((n + 1) / 2 - 1)\nelse:\n print(n / 2 - 1)", "code2": "n = int(input())\nif n % 2 == 1:\n print(int((n - 1) / 2))\nelse:\n print(int(n / 2 - 1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573351642", "date2": "1573352078", "bleu_score": "0.8625275891906243", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 46, "input": "999999\n", "actual_output": "499999.0\n", "expected_output": "499999\n", "anno_code": ["n = int(input()) # (0): n=999999\nif n % 2 == 1: # (1): NO CHANGE\n print((n + 1) / 2 - 1)\nelse:\n print(n / 2 - 1)"], "anno_status": [true], "diff_content": " n = int(input())\n if n % 2 == 1:\n- print((n + 1) / 2 - 1)\n+ print(int((n - 1) / 2))\n else:\n- print(n / 2 - 1)\n+ print(int(n / 2 - 1))\n", "FL_content": " n = int(input())\n if n % 2 == 1:\n- print((n + 1) / 2 - 1)\n else:\n- print(n / 2 - 1)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 5 }, { "user_id": "u067729694", "problem_id": "p03003", "submission1_id": "s825777877", "submission2_id": "s161709927", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\nS = list(map(int, input().split()))\nT = list(map(int, input().split()))\n\ndp = [[0 for i in range(M+1)] for j in range(N+1)] \ndp_sum = [[0 for i in range(M+1)] for j in range(N+1)] \n\n\nfor i, s in enumerate(S):\n for j, t in enumerate(T):\n if s == t:\n dp[i+1][j+1] = dp_sum[i][j] + 1 \n dp_sum[i+1][j+1] = dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]\n \nprint(dp_sum[N][M]+1)\n\n", "code2": "N, M = map(int, input().split())\nS = list(map(int, input().split()))\nT = list(map(int, input().split()))\n\nMOD = 10**9+7\n\ndp = [[0 for i in range(M+1)] for j in range(N+1)] \ndp_sum = [[0 for i in range(M+1)] for j in range(N+1)] \n\n\nret = 0\nfor i, s in enumerate(S):\n for j, t in enumerate(T):\n if s == t:\n dp[i+1][j+1] = dp_sum[i][j] + 1 \n dp_sum[i+1][j+1] = (dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]) % MOD\n \nprint(dp_sum[N][M]+1)\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1566035477", "date2": "1566035792", "bleu_score": "0.9280138261142716", "code1_test_status": [1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0], "code1_test_score": 57, "total_score": 105, "input": "20 20\n1 1 1 0 2 1 1 1 0 1 2 1 1 1 1 1 1 1 1 1\n1 1 1 2 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1\n", "actual_output": "3836684440\n", "expected_output": "836684419\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=20, M=20\nS = list(map(int, input().split())) # (1): S=[1, 1, 1, 0, 2, 1, 1, 1, 0, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]\nT = list(map(int, input().split())) # (2): T=[1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]\n\ndp = [[0 for i in range(M+1)] for j in range(N+1)] # (3): dp\ndp_sum = [[0 for i in range(M+1)] for j in range(N+1)] # (4): dp_sum\n\n\nfor i, s in enumerate(S): # (5): i=0, s=1 (85): i=1 ... (1537): NO CHANGE\n for j, t in enumerate(T): # (6): j=0, t=1 (10): j=1 ... (1536): NO CHANGE\n if s == t: # (7): NO CHANGE (11): NO CHANGE ... (1533): NO CHANGE\n dp[i+1][j+1] = dp_sum[i][j] + 1 # (8): dp (12): dp ... (1534): dp\n dp_sum[i+1][j+1] = dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j] # (9): dp_sum (13): dp_sum ... (1535): dp_sum\n \nprint(dp_sum[N][M]+1)\n\n"], "anno_status": [true], "diff_content": " N, M = map(int, input().split())\n S = list(map(int, input().split()))\n T = list(map(int, input().split()))\n \n+MOD = 10**9+7\n+\n dp = [[0 for i in range(M+1)] for j in range(N+1)] \n dp_sum = [[0 for i in range(M+1)] for j in range(N+1)] \n \n \n+ret = 0\n for i, s in enumerate(S):\n for j, t in enumerate(T):\n if s == t:\n dp[i+1][j+1] = dp_sum[i][j] + 1 \n- dp_sum[i+1][j+1] = dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]\n+ dp_sum[i+1][j+1] = (dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]) % MOD\n \n print(dp_sum[N][M]+1)\n \n \n", "FL_content": " N, M = map(int, input().split())\n S = list(map(int, input().split()))\n T = list(map(int, input().split()))\n \n dp = [[0 for i in range(M+1)] for j in range(N+1)] \n dp_sum = [[0 for i in range(M+1)] for j in range(N+1)] \n \n \n for i, s in enumerate(S):\n for j, t in enumerate(T):\n if s == t:\n dp[i+1][j+1] = dp_sum[i][j] + 1 \n- dp_sum[i+1][j+1] = dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]\n \n print(dp_sum[N][M]+1)\n \n \n", "added_lines": 4, "removed_lines": 1, "code1_lines": 17 }, { "user_id": "u983918956", "problem_id": "p03003", "submission1_id": "s108480356", "submission2_id": "s728237857", "status1": "Wrong Answer", "status2": "Accepted", "code1": "mod = 10**9 + 7\n\nN,M = map(int,input().split())\nS = \"\".join(input().split())\nT = \"\".join(input().split())\n\ndp = [[0]*(M+1) for _ in range(N+1)]\ndp[0][0] = 1\nfor i in range(1,N+1):\n dp[i][0] = 1\nfor j in range(1,M+1):\n dp[0][j] = 1\nfor i in range(1,N+1):\n for j in range(1,M+1):\n if S[i-1] == T[j-1]:\n dp[i][j] = dp[i][j-1] + dp[i-1][j]\n else:\n dp[i][j] = dp[i][j-1] + dp[i-1][j] - dp[i-1][j-1]\n dp[i][j] %= mod\n\nans = dp[N][M]\nprint(ans)", "code2": "mod = 10**9 + 7\n\nN,M = map(int,input().split())\nS = input().split()\nT = input().split()\n\ndp = [[-1]*(M+1) for _ in range(N+1)]\ndp[0][0] = 1\nfor i in range(1,N+1):\n dp[i][0] = 1\nfor j in range(1,M+1):\n dp[0][j] = 1\n\nfor i in range(1,N+1):\n for j in range(1,M+1):\n if S[i-1] == T[j-1]:\n dp[i][j] = dp[i][j-1] + dp[i-1][j]\n else:\n dp[i][j] = dp[i][j-1] + dp[i-1][j] - dp[i-1][j-1]\n dp[i][j] %= mod\n\nans = dp[N][M]\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1562455611", "date2": "1563063989", "bleu_score": "0.9466458279211082", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 65, "total_score": 105, "input": "10 9\n14 6 5 7 9 9 8 5 6 7\n17 6 8 0 5 7 9 9 7\n", "actual_output": "130\n", "expected_output": "125\n\n", "anno_code": ["mod = 10**9 + 7 # (0): mod=1000000007\n\nN,M = map(int,input().split()) # (1): N=10, M=9\nS = \"\".join(input().split()) # (2): S=14657998567\nT = \"\".join(input().split()) # (3): T=1768057997\n\ndp = [[0]*(M+1) for _ in range(N+1)] # (4): dp\ndp[0][0] = 1 # (5): dp\nfor i in range(1,N+1): # (6): i=1 (8): i=2 ... (26): NO CHANGE\n dp[i][0] = 1 # (7): dp (9): dp ... (25): dp\nfor j in range(1,M+1): # (27): j=1 (29): j=2 ... (45): NO CHANGE\n dp[0][j] = 1 # (28): dp (30): dp ... (44): dp\nfor i in range(1,N+1): # (46): i=1 (84): i=2 ... (426): NO CHANGE\n for j in range(1,M+1): # (47): j=1 (51): j=2 ... (425): NO CHANGE\n if S[i-1] == T[j-1]: # (48): NO CHANGE (52): NO CHANGE ... (422): NO CHANGE\n dp[i][j] = dp[i][j-1] + dp[i-1][j] # (49): dp (133): dp ... (399): dp\n else:\n dp[i][j] = dp[i][j-1] + dp[i-1][j] - dp[i-1][j-1] # (53): dp (57): dp ... (423): dp\n dp[i][j] %= mod # (50): NO CHANGE (54): NO CHANGE ... (424): NO CHANGE\n\nans = dp[N][M] # (427): ans=130\nprint(ans)"], "anno_status": [false], "diff_content": " mod = 10**9 + 7\n \n N,M = map(int,input().split())\n-S = \"\".join(input().split())\n-T = \"\".join(input().split())\n+S = input().split()\n+T = input().split()\n \n-dp = [[0]*(M+1) for _ in range(N+1)]\n+dp = [[-1]*(M+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(1,N+1):\n dp[i][0] = 1\n for j in range(1,M+1):\n dp[0][j] = 1\n+\n for i in range(1,N+1):\n for j in range(1,M+1):\n if S[i-1] == T[j-1]:\n dp[i][j] = dp[i][j-1] + dp[i-1][j]\n else:\n dp[i][j] = dp[i][j-1] + dp[i-1][j] - dp[i-1][j-1]\n dp[i][j] %= mod\n \n ans = dp[N][M]\n print(ans)\n", "FL_content": " mod = 10**9 + 7\n \n N,M = map(int,input().split())\n-S = \"\".join(input().split())\n-T = \"\".join(input().split())\n \n-dp = [[0]*(M+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(1,N+1):\n dp[i][0] = 1\n for j in range(1,M+1):\n dp[0][j] = 1\n for i in range(1,N+1):\n for j in range(1,M+1):\n if S[i-1] == T[j-1]:\n dp[i][j] = dp[i][j-1] + dp[i-1][j]\n else:\n dp[i][j] = dp[i][j-1] + dp[i-1][j] - dp[i-1][j-1]\n dp[i][j] %= mod\n \n ans = dp[N][M]\n print(ans)\n", "added_lines": 4, "removed_lines": 3, "code1_lines": 22 }, { "user_id": "u813102292", "problem_id": "p03003", "submission1_id": "s261859106", "submission2_id": "s874521161", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict as dd\nused = dd(int)\n\nN, M = map(int, input().split())\nMOD = 10**9 + 7\ns = list(map(int, input().split()))\nt = list(map(int, input().split()))\n\ndp = [[0 for i in range(M+1)] for j in range(N+1)]\nfor j in range(M):\n dp[1][j + 1] = dp[1][j] + 1 if s[0] == t[j] else dp[1][j]\n\nfor i in range(N):\n dp[i + 1][1] = dp[i][1] + 1 if t[0] == s[i] else dp[i][1]\n\nused[s[0]] = 1\nif N > 1 and M > 1:\n for i in range(1, N):\n used[s[i]] = 1\n for j in range(1, M):\n if used[t[j]] == 1:\n dp[i + 1][j + 1] = dp[i][j + 1] + dp[i + 1][j]\n used[t[j]] = 2\n if s[i] == t[j]:\n dp[i+1][j+1] += 1\n else:\n dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j])\n \nprint((dp[N][M] + 1)%MOD)\n", "code2": "N, M = map(int, input().split())\nMOD = 10**9 + 7\ns = list(map(int, input().split()))\nt = list(map(int, input().split()))\n\ndp = [[0 for i in range(M+1)] for j in range(N+1)]\nfor j in range(M):\n dp[1][j + 1] = dp[1][j] + 1 if s[0] == t[j] else dp[1][j]\n\nfor i in range(N):\n dp[i + 1][1] = dp[i][1] + 1 if t[0] == s[i] else dp[i][1]\n\nfor i in range(1, N):\n for j in range(1, M):\n if s[i] == t[j]:\n dp[i + 1][j + 1] = (dp[i][j + 1] + dp[i + 1][j] + 1)%MOD\n else:\n dp[i + 1][j + 1] = (dp[i][j+1] + dp[i+1][j] - dp[i][j])%MOD\n \nprint((dp[N][M] + 1)%MOD)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1560740837", "date2": "1560743610", "bleu_score": "0.6574738059775687", "code1_test_status": [0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0], "code1_test_score": 7, "total_score": 105, "input": "10 9\n9 6 5 12 5 9 8 5 6 7\n8 2 14 7 5 7 9 9 2\n", "actual_output": "6\n", "expected_output": "23\n\n", "anno_code": ["from collections import defaultdict as dd\nused = dd(int) # (0): used=defaultdict(, {})\n\nN, M = map(int, input().split()) # (1): N=10, M=9\nMOD = 10**9 + 7 # (2): MOD=1000000007\ns = list(map(int, input().split())) # (3): s=[9, 6, 5, 12, 5, 9, 8, 5, 6, 7]\nt = list(map(int, input().split())) # (4): t=[8, 2, 14, 7, 5, 7, 9, 9, 2]\n\ndp = [[0 for i in range(M+1)] for j in range(N+1)] # (5): dp\nfor j in range(M): # (6): j=0 (8): j=1 ... (24): NO CHANGE\n dp[1][j + 1] = dp[1][j] + 1 if s[0] == t[j] else dp[1][j] # (7): NO CHANGE (9): NO CHANGE ... (23): dp\n\nfor i in range(N): # (25): i=0 (27): i=1 ... (45): NO CHANGE\n dp[i + 1][1] = dp[i][1] + 1 if t[0] == s[i] else dp[i][1] # (26): NO CHANGE (28): NO CHANGE ... (44): dp\n\nused[s[0]] = 1 # (46): used=defaultdict(, {9: 1})\nif N > 1 and M > 1: # (47): NO CHANGE\n for i in range(1, N): # (48): i=1 (77): i=2 ... (308): NO CHANGE\n used[s[i]] = 1 # (49): used=defaultdict(, {9: 1, 6: 1}) (78): used=defaultdict(, {9: 2, 6: 1, 2: 0, 14: 0, 7: 0, 5: 1}) ... (279): used=defaultdict(, {9: 2, 6: 1, 2: 0, 14: 0, 7: 1, 5: 2, 12: 1, 8: 1})\n for j in range(1, M): # (50): j=1 (53): j=2 ... (307): NO CHANGE\n if used[t[j]] == 1: # (51): used=defaultdict(, {9: 1, 6: 1, 2: 0}) (54): used=defaultdict(, {9: 1, 6: 1, 2: 0, 14: 0}) ... (305): NO CHANGE\n dp[i + 1][j + 1] = dp[i][j + 1] + dp[i + 1][j] # (67): dp (90): NO CHANGE ... (288): dp\n used[t[j]] = 2 # (68): used=defaultdict(, {9: 2, 6: 1, 2: 0, 14: 0, 7: 0, 5: 0}) (91): used=defaultdict(, {9: 2, 6: 1, 2: 0, 14: 0, 7: 0, 5: 2}) ... (289): used=defaultdict(, {9: 2, 6: 1, 2: 0, 14: 0, 7: 2, 5: 2, 12: 1, 8: 1})\n if s[i] == t[j]: # (69): NO CHANGE (92): NO CHANGE ... (290): NO CHANGE\n dp[i+1][j+1] += 1 # (93): dp (150): dp ... (291): dp\n else:\n dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]) # (52): NO CHANGE (55): NO CHANGE ... (306): dp\n \nprint((dp[N][M] + 1)%MOD)\n"], "anno_status": [false], "diff_content": "-from collections import defaultdict as dd\n-used = dd(int)\n-\n N, M = map(int, input().split())\n MOD = 10**9 + 7\n s = list(map(int, input().split()))\n t = list(map(int, input().split()))\n \n dp = [[0 for i in range(M+1)] for j in range(N+1)]\n for j in range(M):\n dp[1][j + 1] = dp[1][j] + 1 if s[0] == t[j] else dp[1][j]\n \n for i in range(N):\n dp[i + 1][1] = dp[i][1] + 1 if t[0] == s[i] else dp[i][1]\n \n-used[s[0]] = 1\n-if N > 1 and M > 1:\n- for i in range(1, N):\n- used[s[i]] = 1\n- for j in range(1, M):\n- if used[t[j]] == 1:\n- dp[i + 1][j + 1] = dp[i][j + 1] + dp[i + 1][j]\n- used[t[j]] = 2\n- if s[i] == t[j]:\n- dp[i+1][j+1] += 1\n- else:\n- dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j])\n+for i in range(1, N):\n+ for j in range(1, M):\n+ if s[i] == t[j]:\n+ dp[i + 1][j + 1] = (dp[i][j + 1] + dp[i + 1][j] + 1)%MOD\n+ else:\n+ dp[i + 1][j + 1] = (dp[i][j+1] + dp[i+1][j] - dp[i][j])%MOD\n \n print((dp[N][M] + 1)%MOD)\n \n", "FL_content": "-from collections import defaultdict as dd\n-used = dd(int)\n-\n N, M = map(int, input().split())\n MOD = 10**9 + 7\n s = list(map(int, input().split()))\n t = list(map(int, input().split()))\n \n dp = [[0 for i in range(M+1)] for j in range(N+1)]\n for j in range(M):\n dp[1][j + 1] = dp[1][j] + 1 if s[0] == t[j] else dp[1][j]\n \n for i in range(N):\n dp[i + 1][1] = dp[i][1] + 1 if t[0] == s[i] else dp[i][1]\n \n-used[s[0]] = 1\n-if N > 1 and M > 1:\n- for i in range(1, N):\n- used[s[i]] = 1\n- for j in range(1, M):\n- if used[t[j]] == 1:\n- dp[i + 1][j + 1] = dp[i][j + 1] + dp[i + 1][j]\n- used[t[j]] = 2\n- if s[i] == t[j]:\n- dp[i+1][j+1] += 1\n- else:\n- dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j])\n \n print((dp[N][M] + 1)%MOD)\n \n", "added_lines": 6, "removed_lines": 15, "code1_lines": 30 }, { "user_id": "u089230684", "problem_id": "p03003", "submission1_id": "s073653293", "submission2_id": "s579834667", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nfrom math import ceil\n\ndef input():\n return sys.stdin.readline().strip()\n\ndef iinput():\n return int(input())\n\ndef finput():\n return float(input())\n\ndef tinput():\n return input().split()\n\ndef rinput():\n return map(int, tinput())\n\ndef rlinput():\n return list(rinput())\n\ndef nok(a, b):\n m = a * b\n while a != 0 and b != 0:\n if a > b:\n a %= b\n else:\n b %= a\n return m \n\n\ndef main():\n mod = 1e9 + 7\n n, m = rinput()\n s = rlinput()\n t = rlinput()\n a = [1] * (m + 1)\n for j in s:\n d = a[:]\n k = 0\n for i, v in enumerate(t):\n d[i] = (k + d[i]) % mod\n if j == v:\n k = (k + a[i]) % mod\n d[-1] = (k + d[-1]) % mod\n a = d[:]\n print(a[-1])\n \n \n \nmain()", "code2": "import sys\nfrom math import ceil\n\ndef input():\n return sys.stdin.readline().strip()\n\ndef iinput():\n return int(input())\n\ndef finput():\n return float(input())\n\ndef tinput():\n return input().split()\n\ndef rinput():\n return map(int, tinput())\n\ndef rlinput():\n return list(rinput())\n\ndef nok(a, b):\n m = a * b\n while a != 0 and b != 0:\n if a > b:\n a %= b\n else:\n b %= a\n return m \n\n\ndef main():\n mod = 1e9 + 7\n n, m = rinput()\n s = rlinput()\n t = rlinput()\n a = [1] * (m + 1)\n for j in s:\n d = a[:]\n k = 0\n for i, v in enumerate(t):\n d[i] = (k + d[i]) % mod\n if j == v:\n k = (k + a[i]) % mod\n d[-1] = (k + d[-1]) % mod\n a = d[:]\n print(int(a[-1]))\n \n \n \nmain()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566975685", "date2": "1566975792", "bleu_score": "0.9929731077507992", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 105, "input": "20 20\n1 1 1 1 1 1 1 0 1 1 1 1 2 1 1 1 1 1 1 -1\n1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 0 1 2\n", "actual_output": "556030426.0\n", "expected_output": "556030426\n\n", "anno_code": ["import sys\nfrom math import ceil\n\ndef input(): # (0): input=\n return sys.stdin.readline().strip()\n\ndef iinput(): # (1): iinput=\n return int(input())\n\ndef finput(): # (2): finput=\n return float(input())\n\ndef tinput(): # (3): tinput=\n return input().split()\n\ndef rinput(): # (4): rinput=\n return map(int, tinput())\n\ndef rlinput(): # (5): rlinput=\n return list(rinput())\n\ndef nok(a, b): # (6): nok=\n m = a * b\n while a != 0 and b != 0:\n if a > b:\n a %= b\n else:\n b %= a\n return m \n\n\ndef main(): # (7): main=\n mod = 1e9 + 7 # (9): mod=1000000007.0\n n, m = rinput() # (10): n=20, m=20\n s = rlinput() # (11): s=[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, -1]\n t = rlinput() # (12): t=[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 2]\n a = [1] * (m + 1) # (13): a=[1, 1, ..., 1, 1]\n for j in s: # (14): j=1 (96): NO CHANGE ... (1610): NO CHANGE\n d = a[:] # (15): d=[1, 1, ..., 1, 1] (97): NO CHANGE ... (1545): NO CHANGE\n k = 0 # (16): k=0 (98): k=0 ... (1546): k=0\n for i, v in enumerate(t): # (17): i=0, v=1 (21): i=1 ... (1607): NO CHANGE\n d[i] = (k + d[i]) % mod # (18): NO CHANGE (22): d=[1.0, 2.0, ..., 1, 1] ... (1605): NO CHANGE\n if j == v: # (19): NO CHANGE (23): NO CHANGE ... (1606): NO CHANGE\n k = (k + a[i]) % mod # (20): k=1.0 (24): k=2.0 ... (1537): k=730481688.0\n d[-1] = (k + d[-1]) % mod # (94): d=[1.0, 2.0, ..., 17.0, 17.0] (176): d=[1.0, 3.0, ..., 153.0, 153.0] ... (1608): NO CHANGE\n a = d[:] # (95): a=[1.0, 2.0, ..., 17.0, 17.0] (177): a=[1.0, 3.0, ..., 153.0, 153.0] ... (1609): NO CHANGE\n print(a[-1])\n \n \n \nmain() # (8): NO CHANGE\n"], "anno_status": [false], "diff_content": " import sys\n from math import ceil\n \n def input():\n return sys.stdin.readline().strip()\n \n def iinput():\n return int(input())\n \n def finput():\n return float(input())\n \n def tinput():\n return input().split()\n \n def rinput():\n return map(int, tinput())\n \n def rlinput():\n return list(rinput())\n \n def nok(a, b):\n m = a * b\n while a != 0 and b != 0:\n if a > b:\n a %= b\n else:\n b %= a\n return m \n \n \n def main():\n mod = 1e9 + 7\n n, m = rinput()\n s = rlinput()\n t = rlinput()\n a = [1] * (m + 1)\n for j in s:\n d = a[:]\n k = 0\n for i, v in enumerate(t):\n d[i] = (k + d[i]) % mod\n if j == v:\n k = (k + a[i]) % mod\n d[-1] = (k + d[-1]) % mod\n a = d[:]\n- print(a[-1])\n+ print(int(a[-1]))\n \n \n \n main()\n", "FL_content": " import sys\n from math import ceil\n \n def input():\n return sys.stdin.readline().strip()\n \n def iinput():\n return int(input())\n \n def finput():\n return float(input())\n \n def tinput():\n return input().split()\n \n def rinput():\n return map(int, tinput())\n \n def rlinput():\n return list(rinput())\n \n def nok(a, b):\n m = a * b\n while a != 0 and b != 0:\n if a > b:\n a %= b\n else:\n b %= a\n return m \n \n \n def main():\n mod = 1e9 + 7\n n, m = rinput()\n s = rlinput()\n t = rlinput()\n a = [1] * (m + 1)\n for j in s:\n d = a[:]\n k = 0\n for i, v in enumerate(t):\n d[i] = (k + d[i]) % mod\n if j == v:\n k = (k + a[i]) % mod\n d[-1] = (k + d[-1]) % mod\n a = d[:]\n- print(a[-1])\n \n \n \n main()\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 51 }, { "user_id": "u398846051", "problem_id": "p03003", "submission1_id": "s747517651", "submission2_id": "s002546735", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\ns = list(map(int, input().split()))\nt = list(map(int, input().split()))\ndp = [[0] * (m+2) for _ in range(n+2)]\nmod = 1000000007\ndp[0][0] = 1\nfor i in range(1, n+1):\n for j in range(1, m+1):\n dp[i][j] = (dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]) % mod\n if s[i-1] == t[j-1]:\n dp[i][j] += 1 + dp[i-1][j-1]\n dp[i][j] %= mod\nprint(dp[n][m])\n", "code2": "n, m = map(int, input().split())\ns = list(map(int, input().split()))\nt = list(map(int, input().split()))\ndp = [[0] * (m+2) for _ in range(n+2)]\nmod = 1000000007\n\nfor i in range(n+1):\n dp[i][0] = 1\nfor i in range(m+1):\n dp[0][i] = 1\n\nfor i in range(1, n+1):\n for j in range(1, m+1):\n dp[i][j] = (dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]) % mod\n if s[i-1] == t[j-1]:\n dp[i][j] += dp[i-1][j-1]\n dp[i][j] %= mod\nprint(dp[n][m])\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1560766592", "date2": "1560766940", "bleu_score": "0.8581596183818463", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 105, "input": "20 20\n1 1 1 1 1 1 1 0 1 1 1 1 2 1 1 1 1 1 1 -1\n1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 2\n", "actual_output": "150262454\n", "expected_output": "150262455\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=20, m=20\ns = list(map(int, input().split())) # (1): s=[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, -1]\nt = list(map(int, input().split())) # (2): t=[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 2]\ndp = [[0] * (m+2) for _ in range(n+2)] # (3): dp\nmod = 1000000007 # (4): mod=1000000007\ndp[0][0] = 1 # (5): dp\nfor i in range(1, n+1): # (6): i=1 (102): i=2 ... (1830): NO CHANGE\n for j in range(1, m+1): # (7): j=1 (12): j=2 ... (1829): NO CHANGE\n dp[i][j] = (dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]) % mod # (8): dp (13): dp ... (1827): dp\n if s[i-1] == t[j-1]: # (9): NO CHANGE (14): NO CHANGE ... (1828): NO CHANGE\n dp[i][j] += 1 + dp[i-1][j-1] # (10): dp (15): dp ... (1762): dp\n dp[i][j] %= mod # (11): dp (16): NO CHANGE ... (1763): dp\nprint(dp[n][m])\n"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n s = list(map(int, input().split()))\n t = list(map(int, input().split()))\n dp = [[0] * (m+2) for _ in range(n+2)]\n mod = 1000000007\n-dp[0][0] = 1\n+\n+for i in range(n+1):\n+ dp[i][0] = 1\n+for i in range(m+1):\n+ dp[0][i] = 1\n+\n for i in range(1, n+1):\n for j in range(1, m+1):\n dp[i][j] = (dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]) % mod\n if s[i-1] == t[j-1]:\n- dp[i][j] += 1 + dp[i-1][j-1]\n+ dp[i][j] += dp[i-1][j-1]\n dp[i][j] %= mod\n print(dp[n][m])\n \n", "FL_content": " n, m = map(int, input().split())\n s = list(map(int, input().split()))\n t = list(map(int, input().split()))\n dp = [[0] * (m+2) for _ in range(n+2)]\n mod = 1000000007\n-dp[0][0] = 1\n for i in range(1, n+1):\n for j in range(1, m+1):\n dp[i][j] = (dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]) % mod\n if s[i-1] == t[j-1]:\n- dp[i][j] += 1 + dp[i-1][j-1]\n dp[i][j] %= mod\n print(dp[n][m])\n \n", "added_lines": 7, "removed_lines": 2, "code1_lines": 14 }, { "user_id": "u398846051", "problem_id": "p03003", "submission1_id": "s381185930", "submission2_id": "s002546735", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\ns = list(map(int, input().split()))\nt = list(map(int, input().split()))\ndp = [[0] * (m+2) for _ in range(n+2)]\ndp[0][0] = 1\nfor i in range(1, n+1):\n for j in range(1, m+1):\n dp[i][j] = dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]\n if s[i-1] == t[j-1]:\n dp[i][j] += 1 + dp[i-1][j-1]\nprint(dp[n][m])\n", "code2": "n, m = map(int, input().split())\ns = list(map(int, input().split()))\nt = list(map(int, input().split()))\ndp = [[0] * (m+2) for _ in range(n+2)]\nmod = 1000000007\n\nfor i in range(n+1):\n dp[i][0] = 1\nfor i in range(m+1):\n dp[0][i] = 1\n\nfor i in range(1, n+1):\n for j in range(1, m+1):\n dp[i][j] = (dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]) % mod\n if s[i-1] == t[j-1]:\n dp[i][j] += dp[i-1][j-1]\n dp[i][j] %= mod\nprint(dp[n][m])\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1560766440", "date2": "1560766940", "bleu_score": "0.7404844821517166", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 105, "input": "10 9\n9 6 5 12 5 9 8 5 6 7\n8 2 14 7 5 7 9 9 2\n", "actual_output": "7\n", "expected_output": "23\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=10, m=9\ns = list(map(int, input().split())) # (1): s=[9, 6, 5, 12, 5, 9, 8, 5, 6, 7]\nt = list(map(int, input().split())) # (2): t=[8, 2, 14, 7, 5, 7, 9, 9, 2]\ndp = [[0] * (m+2) for _ in range(n+2)] # (3): dp\ndp[0][0] = 1 # (4): dp\nfor i in range(1, n+1): # (5): i=1 (36): i=2 ... (305): NO CHANGE\n for j in range(1, m+1): # (6): j=1 (9): j=2 ... (304): NO CHANGE\n dp[i][j] = dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1] # (7): dp (10): dp ... (302): dp\n if s[i-1] == t[j-1]: # (8): NO CHANGE (11): NO CHANGE ... (303): NO CHANGE\n dp[i][j] += 1 + dp[i-1][j-1] # (27): dp (31): dp ... (294): dp\nprint(dp[n][m])\n"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n s = list(map(int, input().split()))\n t = list(map(int, input().split()))\n dp = [[0] * (m+2) for _ in range(n+2)]\n-dp[0][0] = 1\n+mod = 1000000007\n+\n+for i in range(n+1):\n+ dp[i][0] = 1\n+for i in range(m+1):\n+ dp[0][i] = 1\n+\n for i in range(1, n+1):\n for j in range(1, m+1):\n- dp[i][j] = dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]\n+ dp[i][j] = (dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]) % mod\n if s[i-1] == t[j-1]:\n- dp[i][j] += 1 + dp[i-1][j-1]\n+ dp[i][j] += dp[i-1][j-1]\n+ dp[i][j] %= mod\n print(dp[n][m])\n \n", "FL_content": " n, m = map(int, input().split())\n s = list(map(int, input().split()))\n t = list(map(int, input().split()))\n dp = [[0] * (m+2) for _ in range(n+2)]\n-dp[0][0] = 1\n for i in range(1, n+1):\n for j in range(1, m+1):\n- dp[i][j] = dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]\n if s[i-1] == t[j-1]:\n- dp[i][j] += 1 + dp[i-1][j-1]\n print(dp[n][m])\n \n", "added_lines": 10, "removed_lines": 3, "code1_lines": 12 }, { "user_id": "u894258749", "problem_id": "p03003", "submission1_id": "s503440961", "submission2_id": "s427126016", "status1": "Wrong Answer", "status2": "Accepted", "code1": "inpl = lambda: list(map(int,input().split()))\nN, M = inpl()\nS = inpl()\nT = inpl()\n\ntotal = [0]*(N+1)*(M+1)\nfor i in range(N):\n\tfor j in range(M):\n\t\tif S[i] == T[j]:\n\t\t\tn = total[(M+1)*i+j] + 1\n\t\telse:\n\t\t\tn = 0\n\t\ttotal[(M+1)*(i+1)+(j+1)] = n + total[(M+1)*i+(j+1)] + total[(M+1)*(i+1)+j] - total[(M+1)*i+j]\nprint(total[-1]+1)", "code2": "inpl = lambda: list(map(int,input().split()))\nMOD = 10**9 + 7\nN, M = inpl()\nS = inpl()\nT = inpl()\n\ntotal = [0]*(N+1)*(M+1)\nfor i in range(N):\n\tfor j in range(M):\n\t\tif S[i] == T[j]:\n\t\t\tn = total[(M+1)*i+j] + 1\n\t\telse:\n\t\t\tn = 0\n\t\ttotal[(M+1)*(i+1)+(j+1)] = (n + total[(M+1)*i+(j+1)] + total[(M+1)*(i+1)+j] - total[(M+1)*i+j]) % MOD\nprint((total[-1]+1) % MOD)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1560892997", "date2": "1560893239", "bleu_score": "0.8969336114475487", "code1_test_status": [1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0], "code1_test_score": 57, "total_score": 105, "input": "20 20\n1 1 1 1 1 1 1 0 1 1 1 1 2 1 1 1 1 1 1 1\n1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n", "actual_output": "17761869048\n", "expected_output": "761868929\n\n", "anno_code": ["inpl = lambda: list(map(int,input().split())) # (0): inpl= at 0x000001905DDD9BD0>\nN, M = inpl() # (1): N=20, M=20\nS = inpl() # (2): S=[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1]\nT = inpl() # (3): T=[1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]\n\ntotal = [0]*(N+1)*(M+1) # (4): total=[0, 0, ..., 0, 0]\nfor i in range(N): # (5): i=0 (87): i=1 ... (1645): NO CHANGE\n\tfor j in range(M): # (6): j=0 (10): j=1 ... (1644): NO CHANGE\n\t\tif S[i] == T[j]: # (7): NO CHANGE (11): NO CHANGE ... (1641): NO CHANGE\n\t\t\tn = total[(M+1)*i+j] + 1 # (8): n=1 (12): NO CHANGE ... (1642): n=4557319746\n\t\telse:\n\t\t\tn = 0 # (20): n=0 (102): n=0 ... (1578): n=0\n\t\ttotal[(M+1)*(i+1)+(j+1)] = n + total[(M+1)*i+(j+1)] + total[(M+1)*(i+1)+j] - total[(M+1)*i+j] # (9): total=[0, 0, ..., 0, 0] (13): total=[0, 0, ..., 0, 0] ... (1643): total=[0, 0, ..., 9137213315, 17761869047]\nprint(total[-1]+1)"], "anno_status": [true], "diff_content": " inpl = lambda: list(map(int,input().split()))\n+MOD = 10**9 + 7\n N, M = inpl()\n S = inpl()\n T = inpl()\n \n total = [0]*(N+1)*(M+1)\n for i in range(N):\n \tfor j in range(M):\n \t\tif S[i] == T[j]:\n \t\t\tn = total[(M+1)*i+j] + 1\n \t\telse:\n \t\t\tn = 0\n-\t\ttotal[(M+1)*(i+1)+(j+1)] = n + total[(M+1)*i+(j+1)] + total[(M+1)*(i+1)+j] - total[(M+1)*i+j]\n-print(total[-1]+1)\n+\t\ttotal[(M+1)*(i+1)+(j+1)] = (n + total[(M+1)*i+(j+1)] + total[(M+1)*(i+1)+j] - total[(M+1)*i+j]) % MOD\n+print((total[-1]+1) % MOD)\n", "FL_content": " inpl = lambda: list(map(int,input().split()))\n N, M = inpl()\n S = inpl()\n T = inpl()\n \n total = [0]*(N+1)*(M+1)\n for i in range(N):\n \tfor j in range(M):\n \t\tif S[i] == T[j]:\n \t\t\tn = total[(M+1)*i+j] + 1\n \t\telse:\n \t\t\tn = 0\n-\t\ttotal[(M+1)*(i+1)+(j+1)] = n + total[(M+1)*i+(j+1)] + total[(M+1)*(i+1)+j] - total[(M+1)*i+j]\n-print(total[-1]+1)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 14 }, { "user_id": "u067729694", "problem_id": "p03003", "submission1_id": "s156184943", "submission2_id": "s161709927", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\nS = list(map(int, input().split()))\nT = list(map(int, input().split()))\n\ndp = [[0 for i in range(M+1)] for j in range(N+1)] \ndp_sum = [[0 for i in range(M+1)] for j in range(N+1)] \n\n\nfor i, s in enumerate(S):\n for j, t in enumerate(T):\n if s == t:\n dp[i+1][j+1] = dp_sum[i][j] + 1 \n else:\n dp[i+1][j+1] = 0\n dp_sum[i+1][j+1] = dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]\n \nprint(dp_sum[N][M]+1)\n\n", "code2": "N, M = map(int, input().split())\nS = list(map(int, input().split()))\nT = list(map(int, input().split()))\n\nMOD = 10**9+7\n\ndp = [[0 for i in range(M+1)] for j in range(N+1)] \ndp_sum = [[0 for i in range(M+1)] for j in range(N+1)] \n\n\nret = 0\nfor i, s in enumerate(S):\n for j, t in enumerate(T):\n if s == t:\n dp[i+1][j+1] = dp_sum[i][j] + 1 \n dp_sum[i+1][j+1] = (dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]) % MOD\n \nprint(dp_sum[N][M]+1)\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1566035328", "date2": "1566035792", "bleu_score": "0.9163918012383347", "code1_test_status": [1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0], "code1_test_score": 57, "total_score": 105, "input": "20 20\n1 1 0 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1\n1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n", "actual_output": "17672631900\n", "expected_output": "672631781\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=20, M=20\nS = list(map(int, input().split())) # (1): S=[1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]\nT = list(map(int, input().split())) # (2): T=[1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]\n\ndp = [[0 for i in range(M+1)] for j in range(N+1)] # (3): dp\ndp_sum = [[0 for i in range(M+1)] for j in range(N+1)] # (4): dp_sum\n\n\nfor i, s in enumerate(S): # (5): i=0, s=1 (87): i=1 ... (1645): NO CHANGE\n for j, t in enumerate(T): # (6): j=0, t=1 (10): j=1 ... (1644): NO CHANGE\n if s == t: # (7): NO CHANGE (11): NO CHANGE ... (1641): NO CHANGE\n dp[i+1][j+1] = dp_sum[i][j] + 1 # (8): dp (12): dp ... (1642): dp\n else:\n dp[i+1][j+1] = 0 # (16): NO CHANGE (98): NO CHANGE ... (1574): NO CHANGE\n dp_sum[i+1][j+1] = dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j] # (9): dp_sum (13): dp_sum ... (1643): dp_sum\n \nprint(dp_sum[N][M]+1)\n\n"], "anno_status": [false], "diff_content": " N, M = map(int, input().split())\n S = list(map(int, input().split()))\n T = list(map(int, input().split()))\n \n+MOD = 10**9+7\n+\n dp = [[0 for i in range(M+1)] for j in range(N+1)] \n dp_sum = [[0 for i in range(M+1)] for j in range(N+1)] \n \n \n+ret = 0\n for i, s in enumerate(S):\n for j, t in enumerate(T):\n if s == t:\n dp[i+1][j+1] = dp_sum[i][j] + 1 \n- else:\n- dp[i+1][j+1] = 0\n- dp_sum[i+1][j+1] = dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]\n+ dp_sum[i+1][j+1] = (dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]) % MOD\n \n print(dp_sum[N][M]+1)\n \n \n", "FL_content": " N, M = map(int, input().split())\n S = list(map(int, input().split()))\n T = list(map(int, input().split()))\n \n dp = [[0 for i in range(M+1)] for j in range(N+1)] \n dp_sum = [[0 for i in range(M+1)] for j in range(N+1)] \n \n \n for i, s in enumerate(S):\n for j, t in enumerate(T):\n if s == t:\n dp[i+1][j+1] = dp_sum[i][j] + 1 \n- else:\n- dp[i+1][j+1] = 0\n- dp_sum[i+1][j+1] = dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]\n \n print(dp_sum[N][M]+1)\n \n \n", "added_lines": 4, "removed_lines": 3, "code1_lines": 19 }, { "user_id": "u941407962", "problem_id": "p03003", "submission1_id": "s176645919", "submission2_id": "s453824855", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\nss = input()\nts = input()\nd = [[1] * (m+1) for _ in range(n+1)]\nfor i in range(n):\n for j in range(m):\n d[i+1][j+1] = d[i][j+1] + d[i+1][j] - (ss[2*i] != ts[2*j])*d[i][j]\nprint(d[n][m]%(10**9+7))", "code2": "n, m = map(int, input().split())\nss = input().split()\nts = input().split()\nd = [[1] * (m+1) for _ in range(n+1)]\nfor i in range(n):\n for j in range(m):\n d[i+1][j+1] = (d[i][j+1] + d[i+1][j] - (ss[i] != ts[j])*d[i][j]) % (10**9+7)\nprint(d[n][m])\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1570334729", "date2": "1570335068", "bleu_score": "0.8811836855710645", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 65, "total_score": 105, "input": "10 9\n9 6 5 12 5 9 8 5 6 7\n8 2 8 7 5 12 9 9 7\n", "actual_output": "336\n", "expected_output": "49\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=10, m=9\nss = input() # (1): ss=9 6 5 12 5 9 8 5 6 7\nts = input() # (2): ts=8 2 8 7 5 12 9 9 7\nd = [[1] * (m+1) for _ in range(n+1)] # (3): d\nfor i in range(n): # (4): i=0 (24): i=1 ... (204): NO CHANGE\n for j in range(m): # (5): j=0 (7): j=1 ... (203): NO CHANGE\n d[i+1][j+1] = d[i][j+1] + d[i+1][j] - (ss[2*i] != ts[2*j])*d[i][j] # (6): NO CHANGE (8): NO CHANGE ... (202): d\nprint(d[n][m]%(10**9+7))"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n-ss = input()\n-ts = input()\n+ss = input().split()\n+ts = input().split()\n d = [[1] * (m+1) for _ in range(n+1)]\n for i in range(n):\n for j in range(m):\n- d[i+1][j+1] = d[i][j+1] + d[i+1][j] - (ss[2*i] != ts[2*j])*d[i][j]\n-print(d[n][m]%(10**9+7))\n+ d[i+1][j+1] = (d[i][j+1] + d[i+1][j] - (ss[i] != ts[j])*d[i][j]) % (10**9+7)\n+print(d[n][m])\n+\n", "FL_content": " n, m = map(int, input().split())\n-ss = input()\n-ts = input()\n d = [[1] * (m+1) for _ in range(n+1)]\n for i in range(n):\n for j in range(m):\n- d[i+1][j+1] = d[i][j+1] + d[i+1][j] - (ss[2*i] != ts[2*j])*d[i][j]\n-print(d[n][m]%(10**9+7))\n", "added_lines": 5, "removed_lines": 4, "code1_lines": 8 }, { "user_id": "u691018832", "problem_id": "p03437", "submission1_id": "s246952041", "submission2_id": "s273373395", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nx, y = map(int, input().split())\nif y%x == 0:\n ans = -1\nelse:\n ans = x\nprint(ans)", "code2": "import sys\ninput = sys.stdin.readline\n\nx, y = map(int, input().split())\nif x%y == 0:\n ans = -1\nelse:\n ans = x\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559836946", "date2": "1559837372", "bleu_score": "0.9695503019761654", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 24, "total_score": 25, "input": "-6 12\n", "actual_output": "-1\n", "expected_output": "-6\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\nx, y = map(int, input().split()) # (1): x=-6, y=12\nif y%x == 0: # (2): NO CHANGE\n ans = -1 # (3): ans=-1\nelse:\n ans = x\nprint(ans)"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n \n x, y = map(int, input().split())\n-if y%x == 0:\n+if x%y == 0:\n ans = -1\n else:\n ans = x\n print(ans)\n", "FL_content": " import sys\n input = sys.stdin.readline\n \n x, y = map(int, input().split())\n-if y%x == 0:\n ans = -1\n else:\n ans = x\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 9 }, { "user_id": "u835924161", "problem_id": "p03437", "submission1_id": "s909854599", "submission2_id": "s409696114", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y=map(int,input().split())\nif y%x==0:\n\tprint(-1)\nelse:\n\tprint(x)", "code2": "x,y=map(int,input().split())\nif x%y==0:\n\tprint(-1)\nelse:\n\tprint(x)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1581594644", "date2": "1581594913", "bleu_score": "0.9406015835370575", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 24, "total_score": 25, "input": "-6 12\n", "actual_output": "-1\n", "expected_output": "-6\n\n", "anno_code": ["x,y=map(int,input().split()) # (0): x=-6, y=12\nif y%x==0: # (1): NO CHANGE\n\tprint(-1)\nelse:\n\tprint(x)"], "anno_status": [true], "diff_content": " x,y=map(int,input().split())\n-if y%x==0:\n+if x%y==0:\n \tprint(-1)\n else:\n \tprint(x)\n", "FL_content": " x,y=map(int,input().split())\n-if y%x==0:\n \tprint(-1)\n else:\n \tprint(x)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u151107315", "problem_id": "p03437", "submission1_id": "s233676892", "submission2_id": "s505718843", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X, Y = map(int, input().split())\nprint(-1 if Y % X == 0 else X)\n", "code2": "X, Y = map(int, input().split())\nprint(-1 if X % Y == 0 else X)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1581629191", "date2": "1581629567", "bleu_score": "0.9495013458695685", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 24, "total_score": 25, "input": "-6 12\n", "actual_output": "-1\n", "expected_output": "-6\n\n", "anno_code": ["X, Y = map(int, input().split()) # (0): X=-6, Y=12\nprint(-1 if Y % X == 0 else X)\n"], "anno_status": [true], "diff_content": " X, Y = map(int, input().split())\n-print(-1 if Y % X == 0 else X)\n+print(-1 if X % Y == 0 else X)\n \n", "FL_content": " X, Y = map(int, input().split())\n-print(-1 if Y % X == 0 else X)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 3 }, { "user_id": "u198062737", "problem_id": "p03437", "submission1_id": "s815355703", "submission2_id": "s188772678", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X, Y = map(int,input().split(\" \"))\nif Y%X == 0:\n print(-1)\nelse:\n print(X)", "code2": "X, Y = map(int,input().split(\" \"))\nif X%Y == 0:\n print(-1)\nelse:\n print(X)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1543862476", "date2": "1543862559", "bleu_score": "0.9487277412175072", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 24, "total_score": 25, "input": "-6 12\n", "actual_output": "-1\n", "expected_output": "-6\n\n", "anno_code": ["X, Y = map(int,input().split(\" \")) # (0): X=-6, Y=12\nif Y%X == 0: # (1): NO CHANGE\n print(-1)\nelse:\n print(X)"], "anno_status": [true], "diff_content": " X, Y = map(int,input().split(\" \"))\n-if Y%X == 0:\n+if X%Y == 0:\n print(-1)\n else:\n print(X)\n", "FL_content": " X, Y = map(int,input().split(\" \"))\n-if Y%X == 0:\n print(-1)\n else:\n print(X)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 5 }, { "user_id": "u630511239", "problem_id": "p03437", "submission1_id": "s819063335", "submission2_id": "s171624133", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X, Y = map(int, input().split())\nif Y % X == 0 or X % Y == 0:\n ans = -1\nelse:\n ans = X\nif ans > 10**18:\n ans = -1\nif X == 1 and Y != 1:\n ans = Y + 1\nprint(ans)", "code2": "X, Y = map(int, input().split())\nif X % Y == 0:\n ans = -1\nelif Y % X == 0:\n ans = X * (Y\nelse:\n ans = X\nif ans > 10**18:\n ans = -1\nif X == 1 and Y != 1:\n ans = Y + 1\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593171620", "date2": "1593172184", "bleu_score": "0.8759433950524602", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 24, "total_score": 25, "input": "-6 12\n", "actual_output": "-1\n", "expected_output": "-6\n\n", "anno_code": ["X, Y = map(int, input().split()) # (0): X=-6, Y=12\nif Y % X == 0 or X % Y == 0: # (1): NO CHANGE\n ans = -1 # (2): ans=-1\nelse:\n ans = X\nif ans > 10**18: # (3): NO CHANGE\n ans = -1\nif X == 1 and Y != 1: # (4): NO CHANGE\n ans = Y + 1\nprint(ans)"], "anno_status": [true], "diff_content": " X, Y = map(int, input().split())\n-if Y % X == 0 or X % Y == 0:\n+if X % Y == 0:\n ans = -1\n+elif Y % X == 0:\n+ ans = X * (Y\n else:\n ans = X\n if ans > 10**18:\n ans = -1\n if X == 1 and Y != 1:\n ans = Y + 1\n print(ans)\n", "FL_content": " X, Y = map(int, input().split())\n-if Y % X == 0 or X % Y == 0:\n ans = -1\n else:\n ans = X\n if ans > 10**18:\n ans = -1\n if X == 1 and Y != 1:\n ans = Y + 1\n print(ans)\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u346812984", "problem_id": "p03437", "submission1_id": "s234444159", "submission2_id": "s512892767", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X, Y = map(int, input().split())\nif Y % X == 0:\n print(-1)\nelse:\n print(X)\n", "code2": "X, Y = map(int, input().split())\nif X % Y == 0:\n print(-1)\nelse:\n print(X)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587948649", "date2": "1587948855", "bleu_score": "0.9607478081901534", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 24, "total_score": 25, "input": "-6 12\n", "actual_output": "-1\n", "expected_output": "-6\n\n", "anno_code": ["X, Y = map(int, input().split()) # (0): X=-6, Y=12\nif Y % X == 0: # (1): NO CHANGE\n print(-1)\nelse:\n print(X)\n"], "anno_status": [true], "diff_content": " X, Y = map(int, input().split())\n-if Y % X == 0:\n+if X % Y == 0:\n print(-1)\n else:\n print(X)\n \n", "FL_content": " X, Y = map(int, input().split())\n-if Y % X == 0:\n print(-1)\n else:\n print(X)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u556589653", "problem_id": "p03437", "submission1_id": "s900241938", "submission2_id": "s717122642", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X,Y = map(int,input().split())\nif Y%X == 0:\n print(-1)\nelse:\n print(X)\n", "code2": "X,Y=map(int,input().split())\nif X%Y!=0:\n print(X)\nelse:\n print(-1)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571772404", "date2": "1583076112", "bleu_score": "0.8326821565758437", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 24, "total_score": 25, "input": "-6 12\n", "actual_output": "-1\n", "expected_output": "-6\n\n", "anno_code": ["X,Y = map(int,input().split()) # (0): X=-6, Y=12\nif Y%X == 0: # (1): NO CHANGE\n print(-1)\nelse:\n print(X)\n"], "anno_status": [true], "diff_content": "-X,Y = map(int,input().split())\n-if Y%X == 0:\n- print(-1)\n+X,Y=map(int,input().split())\n+if X%Y!=0:\n+ print(X)\n else:\n- print(X)\n+ print(-1)\n \n", "FL_content": "-X,Y = map(int,input().split())\n-if Y%X == 0:\n- print(-1)\n else:\n- print(X)\n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 6 }, { "user_id": "u425177436", "problem_id": "p03437", "submission1_id": "s093184521", "submission2_id": "s097971439", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y=map(int,input().split())\nprint(x if y%x!=0 else -1)", "code2": "x,y=map(int,input().split())\nprint(x if x%y!=0 else -1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1517717232", "date2": "1517717588", "bleu_score": "0.9280556628566694", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 24, "total_score": 25, "input": "-6 12\n", "actual_output": "-1\n", "expected_output": "-6\n\n", "anno_code": ["x,y=map(int,input().split()) # (0): x=-6, y=12\nprint(x if y%x!=0 else -1)"], "anno_status": [true], "diff_content": " x,y=map(int,input().split())\n-print(x if y%x!=0 else -1)\n+print(x if x%y!=0 else -1)\n", "FL_content": " x,y=map(int,input().split())\n-print(x if y%x!=0 else -1)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 2 }, { "user_id": "u394731058", "problem_id": "p03437", "submission1_id": "s442464429", "submission2_id": "s843585586", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\ninput = sys.stdin.readline\n\ndef main():\n X, Y = map(int, input().split())\n if X == Y:\n print(-1)\n else:\n for i in range(2,10**1):\n if X*i%Y != 0:\n print(X*i)\n exit()\n\nif __name__ == '__main__':\n main()", "code2": "import sys\n\ninput = sys.stdin.readline\n\ndef main():\n X, Y = map(int, input().split())\n if X%Y == 0:\n print(-1)\n else:\n print(X)\n\nif __name__ == '__main__':\n main()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590810505", "date2": "1590810641", "bleu_score": "0.6045142587740295", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 25, "input": "41 9\n", "actual_output": "82\n", "expected_output": "41\n\n", "anno_code": ["import sys\n\ninput = sys.stdin.readline # (0): input=\n\ndef main(): # (1): main=\n X, Y = map(int, input().split())\n if X == Y:\n print(-1)\n else:\n for i in range(2,10**1):\n if X*i%Y != 0:\n print(X*i)\n exit()\n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " import sys\n \n input = sys.stdin.readline\n \n def main():\n X, Y = map(int, input().split())\n- if X == Y:\n+ if X%Y == 0:\n print(-1)\n else:\n- for i in range(2,10**1):\n- if X*i%Y != 0:\n- print(X*i)\n- exit()\n+ print(X)\n \n if __name__ == '__main__':\n main()\n", "FL_content": " import sys\n \n input = sys.stdin.readline\n \n def main():\n X, Y = map(int, input().split())\n- if X == Y:\n print(-1)\n else:\n- for i in range(2,10**1):\n- if X*i%Y != 0:\n- print(X*i)\n- exit()\n \n if __name__ == '__main__':\n main()\n", "added_lines": 2, "removed_lines": 5, "code1_lines": 16 }, { "user_id": "u569272329", "problem_id": "p03437", "submission1_id": "s937889218", "submission2_id": "s031425955", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X, Y = map(int, input().split())\nif (X % Y == 0) or (Y % X == 0):\n print(-1)\nelse:\n print(X * 2)\n", "code2": "X, Y = map(int, input().split())\nif (X % Y == 0):\n print(-1)\nelse:\n print(X)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560656717", "date2": "1560657655", "bleu_score": "0.7736689917386741", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 25, "input": "46 6\n", "actual_output": "92\n", "expected_output": "46\n\n", "anno_code": ["X, Y = map(int, input().split()) # (0): X=46, Y=6\nif (X % Y == 0) or (Y % X == 0): # (1): NO CHANGE\n print(-1)\nelse:\n print(X * 2)\n"], "anno_status": [true], "diff_content": " X, Y = map(int, input().split())\n-if (X % Y == 0) or (Y % X == 0):\n+if (X % Y == 0):\n print(-1)\n else:\n- print(X * 2)\n+ print(X)\n \n", "FL_content": " X, Y = map(int, input().split())\n-if (X % Y == 0) or (Y % X == 0):\n print(-1)\n else:\n- print(X * 2)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 6 }, { "user_id": "u562935282", "problem_id": "p03617", "submission1_id": "s647054128", "submission2_id": "s309844241", "status1": "Wrong Answer", "status2": "Accepted", "code1": "q, h, s, d = map(int, input().split())\nn = int(input())\n\nhalf = min(2 * q, h)\none = min(2 * half, s)\ntwo = min(2 * one, d)\n\nl = zip([2, 1, 0.5, 0.25], [two, one, half, q])\n\nans = 0\nrest = n\nfor vol, cost in l:\n ans += rest \n rest %= vol\nprint(int(ans))", "code2": "q, h, s, d = map(int, input().split())\nn = int(input())\n\nhalf = min(2 * q, h)\none = min(2 * half, s)\ntwo = min(2 * one, d)\n\nl = zip([2, 1, 0.5, 0.25], [two, one, half, q])\n\nans = 0\nrest = n\nfor vol, cost in l:\n ans += (rest \n rest %= vol\n if rest == 0:\n print(ans)\n break", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1536014054", "date2": "1536015098", "bleu_score": "0.8545946411651143", "code1_test_status": [0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 2, "total_score": 104, "input": "10000 1011 110 14\n-2\n", "actual_output": "-2\n", "expected_output": "-14\n\n", "anno_code": ["q, h, s, d = map(int, input().split()) # (0): q=10000, h=1011, s=110, d=14\nn = int(input()) # (1): n=-2\n\nhalf = min(2 * q, h) # (2): half=1011\none = min(2 * half, s) # (3): one=110\ntwo = min(2 * one, d) # (4): two=14\n\nl = zip([2, 1, 0.5, 0.25], [two, one, half, q]) # (5): l=\n\nans = 0 # (6): ans=0\nrest = n # (7): rest=-2\nfor vol, cost in l: # (8): vol=2, cost=14 (11): vol=1, cost=110 ... (20): NO CHANGE\n ans += rest # (9): ans=-2 (12): NO CHANGE ... (18): NO CHANGE\n rest %= vol # (10): rest=0 (13): NO CHANGE ... (19): NO CHANGE\nprint(int(ans))"], "anno_status": [true], "diff_content": " q, h, s, d = map(int, input().split())\n n = int(input())\n \n half = min(2 * q, h)\n one = min(2 * half, s)\n two = min(2 * one, d)\n \n l = zip([2, 1, 0.5, 0.25], [two, one, half, q])\n \n ans = 0\n rest = n\n for vol, cost in l:\n- ans += rest \n+ ans += (rest \n rest %= vol\n-print(int(ans))\n+ if rest == 0:\n+ print(ans)\n+ break\n", "FL_content": " q, h, s, d = map(int, input().split())\n n = int(input())\n \n half = min(2 * q, h)\n one = min(2 * half, s)\n two = min(2 * one, d)\n \n l = zip([2, 1, 0.5, 0.25], [two, one, half, q])\n \n ans = 0\n rest = n\n for vol, cost in l:\n- ans += rest \n rest %= vol\n-print(int(ans))\n", "added_lines": 4, "removed_lines": 2, "code1_lines": 15 }, { "user_id": "u284102701", "problem_id": "p03617", "submission1_id": "s608965143", "submission2_id": "s692880439", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = input().split(\" \")\nb = list(map(int, a))\nc = int(input())\nans = 0\nr = min([b[0] * 4, b[1] * 2, b[2]])\nr2 = min([b[0]*8,b[1]*4,b[2]*2, b[3]])\n\n\n\n\nif c%2==1:\n\tans=r+((c-1)/2)*r2\nelse :\n\tans=c\nprint(int(ans))\n", "code2": "b=list(map(int,input().split()))\nc = int(input())\nans = 0\nr = min([b[0]*4, b[1]*2, b[2]])\nr2 = min([b[0]*8,b[1]*4,b[2]*2, b[3]])\n\n\n\n\n\n\nif c%2==1:\n\tprint(((c-1)\nelse :\n\tprint((c\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1518711253", "date2": "1518711463", "bleu_score": "0.7289024888043498", "code1_test_status": [1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 64, "total_score": 104, "input": "3065533 854010 10742875 54687163\n27604\n", "actual_output": "27604\n", "expected_output": "47148184080\n\n", "anno_code": ["a = input().split(\" \") # (0): a=['3065533', '854010', '10742875', '54687163']\nb = list(map(int, a)) # (1): b=[3065533, 854010, 10742875, 54687163]\nc = int(input()) # (2): c=27604\nans = 0 # (3): ans=0\nr = min([b[0] * 4, b[1] * 2, b[2]]) # (4): r=1708020\nr2 = min([b[0]*8,b[1]*4,b[2]*2, b[3]]) # (5): r2=3416040\n\n\n\n\nif c%2==1: # (6): NO CHANGE\n\tans=r+((c-1)/2)*r2\nelse :\n\tans=c # (7): ans=27604\nprint(int(ans))\n"], "anno_status": [true], "diff_content": "-a = input().split(\" \")\n-b = list(map(int, a))\n+b=list(map(int,input().split()))\n c = int(input())\n ans = 0\n-r = min([b[0] * 4, b[1] * 2, b[2]])\n+r = min([b[0]*4, b[1]*2, b[2]])\n r2 = min([b[0]*8,b[1]*4,b[2]*2, b[3]])\n \n \n \n \n+\n+\n if c%2==1:\n-\tans=r+((c-1)/2)*r2\n+\tprint(((c-1)\n else :\n-\tans=c\n-print(int(ans))\n+\tprint((c\n \n", "FL_content": "-a = input().split(\" \")\n-b = list(map(int, a))\n c = int(input())\n ans = 0\n-r = min([b[0] * 4, b[1] * 2, b[2]])\n r2 = min([b[0]*8,b[1]*4,b[2]*2, b[3]])\n \n \n \n \n if c%2==1:\n-\tans=r+((c-1)/2)*r2\n else :\n-\tans=c\n-print(int(ans))\n \n", "added_lines": 6, "removed_lines": 6, "code1_lines": 16 }, { "user_id": "u370331385", "problem_id": "p03617", "submission1_id": "s841911943", "submission2_id": "s529915919", "status1": "Wrong Answer", "status2": "Accepted", "code1": "Q,H,R,S = map(int,input().split())\nN = int(input())\n\nefficient_num,efficient_cost = 0,8*Q\nif(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H\nif(efficient_cost > 2*R): efficient_num,efficient_cost = 2,2*R\nif(efficient_cost > S): efficient_num,efficient_cost = 3,S\n\n\nmin_cost = 0\nn = N\nif(efficient_num == 0): min_cost = int(n/0.25)*2*Q\nelif(efficient_num == 1): min_cost = int(n/0.50)*2*H\nelif(efficient_num == 2): min_cost = n*2*R\nelif(efficient_num == 3): min_cost = int((n/2)*2*S)\n\n\nif(N%2 == 0):\n print(min_cost)\n\nelse:\n \n efficient_num,efficient_cost = 0,8*Q\n if(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H\n if(efficient_cost > 2*R): efficient_num,efficient_cost = 2,2*R\n \n if(efficient_num == 0): min_cost += int(1/0.25)*Q\n elif(efficient_num == 1): min_cost += int(1/0.50)*H\n elif(efficient_num == 2): min_cost += 1*R\n print(min_cost)", "code2": "Q,H,S,D = map(int,input().split())\nN = int(input())\n\nefficient_num,efficient_cost = 0,8*Q\nif(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H\nif(efficient_cost > 2*S): efficient_num,efficient_cost = 2,2*S\nif(efficient_cost > D): efficient_num,efficient_cost = 3,D\n\n\nmin_cost = 0\n\nif(N%2 == 0):\n if(efficient_num == 0): min_cost = int(N/0.25)*Q\n elif(efficient_num == 1): min_cost = int(N/0.50)*H\n elif(efficient_num == 2): min_cost = N*S\n elif(efficient_num == 3): min_cost = (N\n \n\nelse:\n N = 2*(N\n if(efficient_num == 0): min_cost = int(N/0.25)*Q\n elif(efficient_num == 1): min_cost = int(N/0.50)*H\n elif(efficient_num == 2): min_cost = N*S\n elif(efficient_num == 3): min_cost = (N\n \n \n efficient_num,efficient_cost = 0,8*Q\n if(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H\n if(efficient_cost > 2*S): efficient_num,efficient_cost = 2,2*S\n \n if(efficient_num == 0): min_cost += int(1/0.25)*Q\n elif(efficient_num == 1): min_cost += int(1/0.50)*H\n elif(efficient_num == 2): min_cost += 1*S\n \nprint(min_cost)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554872680", "date2": "1554873246", "bleu_score": "0.7800524045292728", "code1_test_status": [0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 14, "total_score": 104, "input": "91259 3187 23088 2979879\n16689\n", "actual_output": "212757746\n", "expected_output": "106375686\n\n", "anno_code": ["Q,H,R,S = map(int,input().split()) # (0): Q=91259, H=3187, R=23088, S=2979879\nN = int(input()) # (1): N=16689\n\nefficient_num,efficient_cost = 0,8*Q # (2): efficient_num=0, efficient_cost=730072\nif(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H # (3): efficient_num=1, efficient_cost=12748\nif(efficient_cost > 2*R): efficient_num,efficient_cost = 2,2*R # (4): NO CHANGE\nif(efficient_cost > S): efficient_num,efficient_cost = 3,S # (5): NO CHANGE\n\n\nmin_cost = 0 # (6): min_cost=0\nn = N # (7): n=16689\nif(efficient_num == 0): min_cost = int(n/0.25)*2*Q # (8): NO CHANGE\nelif(efficient_num == 1): min_cost = int(n/0.50)*2*H # (9): min_cost=212751372\nelif(efficient_num == 2): min_cost = n*2*R\nelif(efficient_num == 3): min_cost = int((n/2)*2*S)\n\n\nif(N%2 == 0): # (10): NO CHANGE\n print(min_cost)\n\nelse:\n \n efficient_num,efficient_cost = 0,8*Q # (11): efficient_num=0, efficient_cost=730072\n if(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H # (12): efficient_num=1, efficient_cost=12748\n if(efficient_cost > 2*R): efficient_num,efficient_cost = 2,2*R # (13): NO CHANGE\n \n if(efficient_num == 0): min_cost += int(1/0.25)*Q # (14): NO CHANGE\n elif(efficient_num == 1): min_cost += int(1/0.50)*H # (15): min_cost=212757746\n elif(efficient_num == 2): min_cost += 1*R\n print(min_cost)"], "anno_status": [false], "diff_content": "-Q,H,R,S = map(int,input().split())\n+Q,H,S,D = map(int,input().split())\n N = int(input())\n \n efficient_num,efficient_cost = 0,8*Q\n if(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H\n-if(efficient_cost > 2*R): efficient_num,efficient_cost = 2,2*R\n-if(efficient_cost > S): efficient_num,efficient_cost = 3,S\n+if(efficient_cost > 2*S): efficient_num,efficient_cost = 2,2*S\n+if(efficient_cost > D): efficient_num,efficient_cost = 3,D\n \n \n min_cost = 0\n-n = N\n-if(efficient_num == 0): min_cost = int(n/0.25)*2*Q\n-elif(efficient_num == 1): min_cost = int(n/0.50)*2*H\n-elif(efficient_num == 2): min_cost = n*2*R\n-elif(efficient_num == 3): min_cost = int((n/2)*2*S)\n-\n \n if(N%2 == 0):\n- print(min_cost)\n+ if(efficient_num == 0): min_cost = int(N/0.25)*Q\n+ elif(efficient_num == 1): min_cost = int(N/0.50)*H\n+ elif(efficient_num == 2): min_cost = N*S\n+ elif(efficient_num == 3): min_cost = (N\n+ \n \n else:\n+ N = 2*(N\n+ if(efficient_num == 0): min_cost = int(N/0.25)*Q\n+ elif(efficient_num == 1): min_cost = int(N/0.50)*H\n+ elif(efficient_num == 2): min_cost = N*S\n+ elif(efficient_num == 3): min_cost = (N\n+ \n+ \n+ efficient_num,efficient_cost = 0,8*Q\n+ if(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H\n+ if(efficient_cost > 2*S): efficient_num,efficient_cost = 2,2*S\n \n- efficient_num,efficient_cost = 0,8*Q\n- if(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H\n- if(efficient_cost > 2*R): efficient_num,efficient_cost = 2,2*R\n- \n- if(efficient_num == 0): min_cost += int(1/0.25)*Q\n- elif(efficient_num == 1): min_cost += int(1/0.50)*H\n- elif(efficient_num == 2): min_cost += 1*R\n- print(min_cost)\n+ if(efficient_num == 0): min_cost += int(1/0.25)*Q\n+ elif(efficient_num == 1): min_cost += int(1/0.50)*H\n+ elif(efficient_num == 2): min_cost += 1*S\n+ \n+print(min_cost)\n", "FL_content": "-Q,H,R,S = map(int,input().split())\n N = int(input())\n \n efficient_num,efficient_cost = 0,8*Q\n if(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H\n-if(efficient_cost > 2*R): efficient_num,efficient_cost = 2,2*R\n-if(efficient_cost > S): efficient_num,efficient_cost = 3,S\n \n \n min_cost = 0\n-n = N\n-if(efficient_num == 0): min_cost = int(n/0.25)*2*Q\n-elif(efficient_num == 1): min_cost = int(n/0.50)*2*H\n-elif(efficient_num == 2): min_cost = n*2*R\n-elif(efficient_num == 3): min_cost = int((n/2)*2*S)\n-\n \n if(N%2 == 0):\n- print(min_cost)\n \n else:\n \n- efficient_num,efficient_cost = 0,8*Q\n- if(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H\n- if(efficient_cost > 2*R): efficient_num,efficient_cost = 2,2*R\n- \n- if(efficient_num == 0): min_cost += int(1/0.25)*Q\n- elif(efficient_num == 1): min_cost += int(1/0.50)*H\n- elif(efficient_num == 2): min_cost += 1*R\n- print(min_cost)\n", "added_lines": 23, "removed_lines": 18, "code1_lines": 30 }, { "user_id": "u263753244", "problem_id": "p03617", "submission1_id": "s707525454", "submission2_id": "s028435468", "status1": "Wrong Answer", "status2": "Accepted", "code1": "q,h,s,d=map(int,input().split())\nn=int(input())\n\nl=min(q*n*8,h*n*4,s*n*2,d*n)\nif l != d*n:\n print(int(l/2))\nelse:\n m=min(q*4,h*2,s)\n print(int((d*(n-1)/2)+m) if n%2==1 else int(l/2))", "code2": "q,h,s,d=map(int,input().split())\nn=int(input())\nl=min(q*n*4,h*n*2,s*n,d*n\nif l != d*n\n print(l)\nelse:\n m=min(q*4,h*2,s)\n print(int((d*(n-1)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586124603", "date2": "1586143064", "bleu_score": "0.7045773535312374", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 80, "total_score": 104, "input": "11100 0010 111 -2\n-1\n", "actual_output": "-44400\n", "expected_output": "22\n\n", "anno_code": ["q,h,s,d=map(int,input().split()) # (0): q=11100, h=10, s=111, d=-2\nn=int(input()) # (1): n=-1\n\nl=min(q*n*8,h*n*4,s*n*2,d*n) # (2): l=-88800\nif l != d*n: # (3): NO CHANGE\n print(int(l/2))\nelse:\n m=min(q*4,h*2,s)\n print(int((d*(n-1)/2)+m) if n%2==1 else int(l/2))"], "anno_status": [true], "diff_content": " q,h,s,d=map(int,input().split())\n n=int(input())\n-\n-l=min(q*n*8,h*n*4,s*n*2,d*n)\n-if l != d*n:\n- print(int(l/2))\n+l=min(q*n*4,h*n*2,s*n,d*n\n+if l != d*n\n+ print(l)\n else:\n m=min(q*4,h*2,s)\n- print(int((d*(n-1)/2)+m) if n%2==1 else int(l/2))\n+ print(int((d*(n-1)\n", "FL_content": " q,h,s,d=map(int,input().split())\n n=int(input())\n-\n-l=min(q*n*8,h*n*4,s*n*2,d*n)\n-if l != d*n:\n- print(int(l/2))\n else:\n m=min(q*4,h*2,s)\n- print(int((d*(n-1)/2)+m) if n%2==1 else int(l/2))\n", "added_lines": 4, "removed_lines": 5, "code1_lines": 9 }, { "user_id": "u482157295", "problem_id": "p03617", "submission1_id": "s127521709", "submission2_id": "s306555147", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nq,h,s,d = map(int,input().split())\nn = int(input())\nvalue = [0]*4\nvalue[0] = q*4\nvalue[1] = h*2\nvalue[2] = s\nvalue[3] = d/2\ndum = min(value)\nind = value.index(dum)\nif ind == 0:\n print(value[0]*n)\nelif ind == 1:\n print(value[1]*n)\nelif ind == 2:\n print(value[2]*n)\nelse:\n if n == 1:\n value.sort()\n print(value[1])\n elif n%2 == 0:\n print(math.floor(value[3]*n))\n else:\n dum1 = n\n value.sort()\n print(math.floor(value[1]+dum1))", "code2": "import math\nq,h,s,d = map(int,input().split())\nn = int(input())\nvalue = [0]*4\nvalue[0] = q*4\nvalue[1] = h*2\nvalue[2] = s\nvalue[3] = d/2\ndum = min(value)\nind = value.index(dum)\nif ind == 0:\n print(value[0]*n)\nelif ind == 1:\n print(value[1]*n)\nelif ind == 2:\n print(value[2]*n)\nelse:\n if n == 1:\n value.sort()\n print(value[1])\n elif n%2 == 0:\n print(math.floor(d*n\n else:\n dum1 = (n\n value.sort()\n print(math.floor(value[1]+dum1))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1590539418", "date2": "1590542069", "bleu_score": "0.9710686285723217", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 85, "total_score": 104, "input": "11100 0010 111 -2\n-1\n", "actual_output": "19\n", "expected_output": "22\n\n", "anno_code": ["import math\nq,h,s,d = map(int,input().split()) # (0): q=11100, h=10, s=111, d=-2\nn = int(input()) # (1): n=-1\nvalue = [0]*4 # (2): value=[0, 0, 0, 0]\nvalue[0] = q*4 # (3): value=[44400, 0, 0, 0]\nvalue[1] = h*2 # (4): value=[44400, 20, 0, 0]\nvalue[2] = s # (5): value=[44400, 20, 111, 0]\nvalue[3] = d/2 # (6): value=[44400, 20, 111, -1.0]\ndum = min(value) # (7): dum=-1.0\nind = value.index(dum) # (8): ind=3\nif ind == 0: # (9): NO CHANGE\n print(value[0]*n)\nelif ind == 1: # (10): NO CHANGE\n print(value[1]*n)\nelif ind == 2: # (11): NO CHANGE\n print(value[2]*n)\nelse:\n if n == 1: # (12): NO CHANGE\n value.sort()\n print(value[1])\n elif n%2 == 0: # (13): NO CHANGE\n print(math.floor(value[3]*n))\n else:\n dum1 = n # (14): dum1=-1\n value.sort() # (15): value=[-1.0, 20, 111, 44400]\n print(math.floor(value[1]+dum1))"], "anno_status": [true], "diff_content": " import math\n q,h,s,d = map(int,input().split())\n n = int(input())\n value = [0]*4\n value[0] = q*4\n value[1] = h*2\n value[2] = s\n value[3] = d/2\n dum = min(value)\n ind = value.index(dum)\n if ind == 0:\n print(value[0]*n)\n elif ind == 1:\n print(value[1]*n)\n elif ind == 2:\n print(value[2]*n)\n else:\n if n == 1:\n value.sort()\n print(value[1])\n elif n%2 == 0:\n- print(math.floor(value[3]*n))\n+ print(math.floor(d*n\n else:\n- dum1 = n\n+ dum1 = (n\n value.sort()\n print(math.floor(value[1]+dum1))\n", "FL_content": " import math\n q,h,s,d = map(int,input().split())\n n = int(input())\n value = [0]*4\n value[0] = q*4\n value[1] = h*2\n value[2] = s\n value[3] = d/2\n dum = min(value)\n ind = value.index(dum)\n if ind == 0:\n print(value[0]*n)\n elif ind == 1:\n print(value[1]*n)\n elif ind == 2:\n print(value[2]*n)\n else:\n if n == 1:\n value.sort()\n print(value[1])\n elif n%2 == 0:\n- print(math.floor(value[3]*n))\n else:\n- dum1 = n\n value.sort()\n print(math.floor(value[1]+dum1))\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 26 }, { "user_id": "u215743476", "problem_id": "p03617", "submission1_id": "s183952961", "submission2_id": "s483533822", "status1": "Wrong Answer", "status2": "Accepted", "code1": "q, h, s, d = map(int, input().split())\nn = int(input())\n\nif n % 2 == 0:\n l = [4*q*n, 2*h*n, s*n, d*n/2]\n l.sort()\n print(int(l[0]))\nelse:\n l = [4*q*(n-1), 2*h*(n-1), s*(n-1), d*(n-1)/2]\n l_rest = [4*q, 2*h, s]\n l.sort()\n l_rest.sort()\n print(int(l[0]+l_rest[0]))\n", "code2": "q, h, s, d = map(int, input().split())\nn = int(input())\n\nif n % 2 == 0:\n l = [4*q*n, 2*h*n, s*n, d*(n\n l.sort()\n print(int(l[0]))\nelse:\n l = [4*q*(n-1), 2*h*(n-1), s*(n-1), d*((n-1)\n l_rest = [4*q, 2*h, s]\n l.sort()\n l_rest.sort()\n if n > 1:\n print(int(l[0]+l_rest[0]))\n elif n == 1:\n print(l_rest[0])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571783197", "date2": "1571783572", "bleu_score": "0.8102982920554523", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 80, "total_score": 104, "input": "01100 0111 000 -5\n-6\n", "actual_output": "-26400\n", "expected_output": "15\n\n", "anno_code": ["q, h, s, d = map(int, input().split()) # (0): q=1100, h=111, s=0, d=-5\nn = int(input()) # (1): n=-6\n\nif n % 2 == 0: # (2): NO CHANGE\n l = [4*q*n, 2*h*n, s*n, d*n/2] # (3): l=[-26400, -1332, 0, 15.0]\n l.sort() # (4): NO CHANGE\n print(int(l[0]))\nelse:\n l = [4*q*(n-1), 2*h*(n-1), s*(n-1), d*(n-1)/2]\n l_rest = [4*q, 2*h, s]\n l.sort()\n l_rest.sort()\n print(int(l[0]+l_rest[0]))\n"], "anno_status": [true], "diff_content": " q, h, s, d = map(int, input().split())\n n = int(input())\n \n if n % 2 == 0:\n- l = [4*q*n, 2*h*n, s*n, d*n/2]\n+ l = [4*q*n, 2*h*n, s*n, d*(n\n l.sort()\n print(int(l[0]))\n else:\n- l = [4*q*(n-1), 2*h*(n-1), s*(n-1), d*(n-1)/2]\n+ l = [4*q*(n-1), 2*h*(n-1), s*(n-1), d*((n-1)\n l_rest = [4*q, 2*h, s]\n l.sort()\n l_rest.sort()\n- print(int(l[0]+l_rest[0]))\n-\n+ if n > 1:\n+ print(int(l[0]+l_rest[0]))\n+ elif n == 1:\n+ print(l_rest[0])\n", "FL_content": " q, h, s, d = map(int, input().split())\n n = int(input())\n \n if n % 2 == 0:\n- l = [4*q*n, 2*h*n, s*n, d*n/2]\n l.sort()\n print(int(l[0]))\n else:\n- l = [4*q*(n-1), 2*h*(n-1), s*(n-1), d*(n-1)/2]\n l_rest = [4*q, 2*h, s]\n l.sort()\n l_rest.sort()\n- print(int(l[0]+l_rest[0]))\n-\n", "added_lines": 6, "removed_lines": 4, "code1_lines": 14 }, { "user_id": "u263753244", "problem_id": "p03617", "submission1_id": "s043524178", "submission2_id": "s028435468", "status1": "Wrong Answer", "status2": "Accepted", "code1": "q,h,s,d=map(int,input().split())\nn=int(input())\nl=min(q*n*4,h*n*2,s*n,d*n/2)\nif l != d*n/2:\n print(l)\nelse:\n m=min(q*4,h*2,s)\n print((d*(n-1)/2)+m if n%2==1 else l)", "code2": "q,h,s,d=map(int,input().split())\nn=int(input())\nl=min(q*n*4,h*n*2,s*n,d*n\nif l != d*n\n print(l)\nelse:\n m=min(q*4,h*2,s)\n print(int((d*(n-1)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586123985", "date2": "1586143064", "bleu_score": "0.806790311790577", "code1_test_status": [1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0], "code1_test_score": 70, "total_score": 104, "input": "11100 0010 111 -2\n-1\n", "actual_output": "-44400\n", "expected_output": "22\n\n", "anno_code": ["q,h,s,d=map(int,input().split()) # (0): q=11100, h=10, s=111, d=-2\nn=int(input()) # (1): n=-1\nl=min(q*n*4,h*n*2,s*n,d*n/2) # (2): l=-44400\nif l != d*n/2: # (3): NO CHANGE\n print(l)\nelse:\n m=min(q*4,h*2,s)\n print((d*(n-1)/2)+m if n%2==1 else l)"], "anno_status": [true], "diff_content": " q,h,s,d=map(int,input().split())\n n=int(input())\n-l=min(q*n*4,h*n*2,s*n,d*n/2)\n-if l != d*n/2:\n+l=min(q*n*4,h*n*2,s*n,d*n\n+if l != d*n\n print(l)\n else:\n m=min(q*4,h*2,s)\n- print((d*(n-1)/2)+m if n%2==1 else l)\n+ print(int((d*(n-1)\n", "FL_content": " q,h,s,d=map(int,input().split())\n n=int(input())\n-l=min(q*n*4,h*n*2,s*n,d*n/2)\n-if l != d*n/2:\n print(l)\n else:\n m=min(q*4,h*2,s)\n- print((d*(n-1)/2)+m if n%2==1 else l)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u423585790", "problem_id": "p03617", "submission1_id": "s626871032", "submission2_id": "s961171707", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nfrom collections import defaultdict,deque\nfrom heapq import heappush, heappop\nfrom bisect import bisect_left, bisect_right\nimport sys, random, itertools, math\nsys.setrecursionlimit(10**5)\ninput = sys.stdin.readline\nsqrt = math.sqrt\ndef LI(): return list(map(int, input().split()))\ndef LF(): return list(map(float, input().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, input().split()))\ndef II(): return int(input())\ndef IF(): return float(input())\ndef LS(): return list(map(list, input().split()))\ndef S(): return list(input().rstrip())\ndef IR(n): return [II() for _ in range(n)]\ndef LIR(n): return [LI() for _ in range(n)]\ndef FR(n): return [IF() for _ in range(n)]\ndef LFR(n): return [LI() for _ in range(n)]\ndef LIR_(n): return [LI_() for _ in range(n)]\ndef SR(n): return [S() for _ in range(n)]\ndef LSR(n): return [LS() for _ in range(n)]\nmod = 1000000007\ninf = 1e10\n\n\ndef solve():\n q, h, s, d = LI()\n n = II()\n q4 = q * 4\n h2 = h * 2\n l1 = min(q4, h2, s)\n l2 = min(l1 * 2, d)\n print((n >> 1) * l2 + (n & 1 * l1))\n \n return\n\n\n\nif __name__ == '__main__':\n solve()\n", "code2": "\nfrom collections import defaultdict,deque\nfrom heapq import heappush, heappop\nfrom bisect import bisect_left, bisect_right\nimport sys, random, itertools, math\nsys.setrecursionlimit(10**5)\ninput = sys.stdin.readline\nsqrt = math.sqrt\ndef LI(): return list(map(int, input().split()))\ndef LF(): return list(map(float, input().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, input().split()))\ndef II(): return int(input())\ndef IF(): return float(input())\ndef LS(): return list(map(list, input().split()))\ndef S(): return list(input().rstrip())\ndef IR(n): return [II() for _ in range(n)]\ndef LIR(n): return [LI() for _ in range(n)]\ndef FR(n): return [IF() for _ in range(n)]\ndef LFR(n): return [LI() for _ in range(n)]\ndef LIR_(n): return [LI_() for _ in range(n)]\ndef SR(n): return [S() for _ in range(n)]\ndef LSR(n): return [LS() for _ in range(n)]\nmod = 1000000007\ninf = 1e10\n\n\ndef solve():\n q, h, s, d = LI()\n n = II()\n q4 = q * 4\n h2 = h * 2\n l1 = min(q4, h2, s)\n l2 = min(l1 * 2, d)\n print((n >> 1) * l2 + (n & 1) * l1)\n \n return\n\n\n\nif __name__ == '__main__':\n solve()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1578090843", "date2": "1578090915", "bleu_score": "0.997287106071775", "code1_test_status": [0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 26, "total_score": 104, "input": "41015 95070 23088 46307626\n30432\n", "actual_output": "702635040\n", "expected_output": "702614016\n\n", "anno_code": ["\nfrom collections import defaultdict,deque\nfrom heapq import heappush, heappop\nfrom bisect import bisect_left, bisect_right\nimport sys, random, itertools, math\nsys.setrecursionlimit(10**5) # (0): NO CHANGE\ninput = sys.stdin.readline # (1): input=\nsqrt = math.sqrt # (2): sqrt=, LI=, LF=, LI_=, II=, IF=, LS=, S=, IR=, LIR=, FR=, LFR=, LIR_=, SR=, LSR=\ndef LI(): return list(map(int, input().split()))\ndef LF(): return list(map(float, input().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, input().split()))\ndef II(): return int(input())\ndef IF(): return float(input())\ndef LS(): return list(map(list, input().split()))\ndef S(): return list(input().rstrip())\ndef IR(n): return [II() for _ in range(n)]\ndef LIR(n): return [LI() for _ in range(n)]\ndef FR(n): return [IF() for _ in range(n)]\ndef LFR(n): return [LI() for _ in range(n)]\ndef LIR_(n): return [LI_() for _ in range(n)]\ndef SR(n): return [S() for _ in range(n)]\ndef LSR(n): return [LS() for _ in range(n)]\nmod = 1000000007 # (3): mod=1000000007\ninf = 1e10 # (4): inf=10000000000.0\n\n\ndef solve(): # (5): solve=\n q, h, s, d = LI()\n n = II()\n q4 = q * 4\n h2 = h * 2\n l1 = min(q4, h2, s)\n l2 = min(l1 * 2, d)\n print((n >> 1) * l2 + (n & 1 * l1))\n \n return\n\n\n\nif __name__ == '__main__':\n solve()\n"], "anno_status": [false], "diff_content": " \n from collections import defaultdict,deque\n from heapq import heappush, heappop\n from bisect import bisect_left, bisect_right\n import sys, random, itertools, math\n sys.setrecursionlimit(10**5)\n input = sys.stdin.readline\n sqrt = math.sqrt\n def LI(): return list(map(int, input().split()))\n def LF(): return list(map(float, input().split()))\n def LI_(): return list(map(lambda x: int(x)-1, input().split()))\n def II(): return int(input())\n def IF(): return float(input())\n def LS(): return list(map(list, input().split()))\n def S(): return list(input().rstrip())\n def IR(n): return [II() for _ in range(n)]\n def LIR(n): return [LI() for _ in range(n)]\n def FR(n): return [IF() for _ in range(n)]\n def LFR(n): return [LI() for _ in range(n)]\n def LIR_(n): return [LI_() for _ in range(n)]\n def SR(n): return [S() for _ in range(n)]\n def LSR(n): return [LS() for _ in range(n)]\n mod = 1000000007\n inf = 1e10\n \n \n def solve():\n q, h, s, d = LI()\n n = II()\n q4 = q * 4\n h2 = h * 2\n l1 = min(q4, h2, s)\n l2 = min(l1 * 2, d)\n- print((n >> 1) * l2 + (n & 1 * l1))\n+ print((n >> 1) * l2 + (n & 1) * l1)\n \n return\n \n \n \n if __name__ == '__main__':\n solve()\n \n", "FL_content": " \n from collections import defaultdict,deque\n from heapq import heappush, heappop\n from bisect import bisect_left, bisect_right\n import sys, random, itertools, math\n sys.setrecursionlimit(10**5)\n input = sys.stdin.readline\n sqrt = math.sqrt\n def LI(): return list(map(int, input().split()))\n def LF(): return list(map(float, input().split()))\n def LI_(): return list(map(lambda x: int(x)-1, input().split()))\n def II(): return int(input())\n def IF(): return float(input())\n def LS(): return list(map(list, input().split()))\n def S(): return list(input().rstrip())\n def IR(n): return [II() for _ in range(n)]\n def LIR(n): return [LI() for _ in range(n)]\n def FR(n): return [IF() for _ in range(n)]\n def LFR(n): return [LI() for _ in range(n)]\n def LIR_(n): return [LI_() for _ in range(n)]\n def SR(n): return [S() for _ in range(n)]\n def LSR(n): return [LS() for _ in range(n)]\n mod = 1000000007\n inf = 1e10\n \n \n def solve():\n q, h, s, d = LI()\n n = II()\n q4 = q * 4\n h2 = h * 2\n l1 = min(q4, h2, s)\n l2 = min(l1 * 2, d)\n- print((n >> 1) * l2 + (n & 1 * l1))\n \n return\n \n \n \n if __name__ == '__main__':\n solve()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 42 }, { "user_id": "u030726788", "problem_id": "p03617", "submission1_id": "s302143005", "submission2_id": "s057118139", "status1": "Wrong Answer", "status2": "Accepted", "code1": "q,h,s,d=map(int,input().split())\nn=int(input())\ncospa=[[q/0.25,0.25,q],[h/0.5,0.5,h],[s,1.0,s],[d/2,2.0,d]]\ncospa.sort()\nmoney=0\nfor i in range(4):\n if(n>=cospa[i][1]):\n x=n\n money+=x*cospa[i][2]\n n%=cospa[i][1]\nprint(int(money))", "code2": "q,h,s,d=map(int,input().split())\nn=int(input())\ncospa=[[q/0.25,0.25,q],[h/0.5,0.5,h],[s,1.0,s],[d/2,2.0,d]]\ncospa.sort()\nmoney=0\nfor i in range(4):\n if(n>=cospa[i][1]):\n x=int(n\n money+=int(x*cospa[i][2])\n n%=cospa[i][1]\nprint(int(money))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1522883028", "date2": "1522883724", "bleu_score": "0.9450688388497887", "code1_test_status": [0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0], "code1_test_score": 29, "total_score": 104, "input": "3065533 854010 10742875 54687163\n69254\n", "actual_output": "59143608540\n", "expected_output": "118287217080\n\n", "anno_code": ["q,h,s,d=map(int,input().split()) # (0): q=3065533, h=854010, s=10742875, d=54687163\nn=int(input()) # (1): n=69254\ncospa=[[q/0.25,0.25,q],[h/0.5,0.5,h],[s,1.0,s],[d/2,2.0,d]] # (2): cospa\ncospa.sort() # (3): cospa\nmoney=0 # (4): money=0\nfor i in range(4): # (5): i=0 (10): i=1 ... (16): NO CHANGE\n if(n>=cospa[i][1]): # (6): NO CHANGE (11): NO CHANGE ... (15): NO CHANGE\n x=n # (7): x=69254\n money+=x*cospa[i][2] # (8): money=59143608540\n n%=cospa[i][1] # (9): n=0.0\nprint(int(money))"], "anno_status": [true], "diff_content": " q,h,s,d=map(int,input().split())\n n=int(input())\n cospa=[[q/0.25,0.25,q],[h/0.5,0.5,h],[s,1.0,s],[d/2,2.0,d]]\n cospa.sort()\n money=0\n for i in range(4):\n if(n>=cospa[i][1]):\n- x=n\n- money+=x*cospa[i][2]\n+ x=int(n\n+ money+=int(x*cospa[i][2])\n n%=cospa[i][1]\n print(int(money))\n", "FL_content": " q,h,s,d=map(int,input().split())\n n=int(input())\n cospa=[[q/0.25,0.25,q],[h/0.5,0.5,h],[s,1.0,s],[d/2,2.0,d]]\n cospa.sort()\n money=0\n for i in range(4):\n if(n>=cospa[i][1]):\n- x=n\n- money+=x*cospa[i][2]\n n%=cospa[i][1]\n print(int(money))\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 11 }, { "user_id": "u859125915", "problem_id": "p03617", "submission1_id": "s129630402", "submission2_id": "s886869842", "status1": "Wrong Answer", "status2": "Accepted", "code1": "q,h,s,d=map(int,input().split())\nn=int(input())\n \nl=min(q*n*8,h*n*4,s*n*2,d*n)\nif l != d*n:\n print(l/2)\nelse:\n m=min(q*4,h*2,s)\n print((d*(n-1)/2)+m if n%2==1 else l/2)", "code2": "q,h,s,d=map(int,input().split())\nn=int(input())\n \nl=min(q*n*8,h*n*4,s*n*2,d*n)\nif l != d*n:\n print(l\nelse:\n m=min(q*4,h*2,s)\n print((d*(n-1))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586133048", "date2": "1586133280", "bleu_score": "0.824813999693215", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 104, "input": "20 30 126 63\n1\n", "actual_output": "60.0\n", "expected_output": "60\n\n", "anno_code": ["q,h,s,d=map(int,input().split()) # (0): q=20, h=30, s=126, d=63\nn=int(input()) # (1): n=1\n \nl=min(q*n*8,h*n*4,s*n*2,d*n) # (2): l=63\nif l != d*n: # (3): NO CHANGE\n print(l/2)\nelse:\n m=min(q*4,h*2,s) # (4): m=60\n print((d*(n-1)/2)+m if n%2==1 else l/2)"], "anno_status": [true], "diff_content": " q,h,s,d=map(int,input().split())\n n=int(input())\n \n l=min(q*n*8,h*n*4,s*n*2,d*n)\n if l != d*n:\n- print(l/2)\n+ print(l\n else:\n m=min(q*4,h*2,s)\n- print((d*(n-1)/2)+m if n%2==1 else l/2)\n+ print((d*(n-1))\n+\n", "FL_content": " q,h,s,d=map(int,input().split())\n n=int(input())\n \n l=min(q*n*8,h*n*4,s*n*2,d*n)\n if l != d*n:\n- print(l/2)\n else:\n m=min(q*4,h*2,s)\n- print((d*(n-1)/2)+m if n%2==1 else l/2)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u100813820", "problem_id": "p02413", "submission1_id": "s697242338", "submission2_id": "s987936642", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nr,c = map( int,input().split() )\n\ndata = []\ncsum = [0]*c\n\nfor i in range(r):\n\tdata.append( list(map( int,input().split() )) )\n\nfor i in range( r ):\n\tfor j in range(c):\n\t\tprint(\"{0} \".format(data[i][j]), end=\"\")\n\t\tcsum[j] +=data[i][j]\n\tprint( sum(data[i]) )\n\n\n\n\n", "code2": "\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nr,c = map( int,input().split() )\n\ndata = []\ncsum = [0]*c\n\nfor i in range(r):\n\tdata.append( list(map( int,input().split() )) )\n\nfor i in range( r ):\n\tfor j in range(c):\n\t\tprint(\"{0} \".format(data[i][j]), end=\"\")\n\t\tcsum[j] +=data[i][j]\n\tprint( sum(data[i]) )\n\nfor j in range(c):\n\tprint(\"{0} \".format( csum[j] ), end=\"\" )\n\nprint( sum(csum) )", "original_language1": "Python3", "original_language2": "Python3", "date1": "1463626428", "date2": "1463626439", "bleu_score": "0.800235121248693", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "4 5\n1 1 11 8 8\n2 2 2 4 5\n3 5 0 0 2\n2 9 4 8 1\n", "actual_output": "1 1 11 8 8 29\n2 2 2 4 5 15\n3 5 0 0 2 10\n2 9 4 8 1 24\n", "expected_output": "1 1 11 8 8 29\n2 2 2 4 5 15\n3 5 0 0 2 10\n2 9 4 8 1 24\n8 17 17 20 16 78\n\n", "anno_code": ["\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nr,c = map( int,input().split() ) # (0): r=4, c=5\n\ndata = [] # (1): data=[]\ncsum = [0]*c # (2): csum=[0, 0, 0, 0, 0]\n\nfor i in range(r): # (3): i=0 (5): i=1 ... (11): NO CHANGE\n\tdata.append( list(map( int,input().split() )) ) # (4): data (6): data ... (10): data\n\nfor i in range( r ): # (12): i=0 (30): i=1 ... (66): i=3\n\tfor j in range(c): # (13): j=0 (16): j=1 ... (82): NO CHANGE\n\t\tprint(\"{0} \".format(data[i][j]), end=\"\") # (14): NO CHANGE (17): NO CHANGE ... (80): NO CHANGE\n\t\tcsum[j] +=data[i][j] # (15): csum=[1, 0, 0, 0, 0] (18): csum=[1, 1, 0, 0, 0] ... (81): csum=[8, 17, 17, 20, 16]\n\tprint( sum(data[i]) ) # (29): NO CHANGE (47): NO CHANGE ... (83): NO CHANGE\n\n\n\n\n"], "anno_status": [true], "diff_content": " \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n r,c = map( int,input().split() )\n \n data = []\n csum = [0]*c\n \n for i in range(r):\n \tdata.append( list(map( int,input().split() )) )\n \n for i in range( r ):\n \tfor j in range(c):\n \t\tprint(\"{0} \".format(data[i][j]), end=\"\")\n \t\tcsum[j] +=data[i][j]\n \tprint( sum(data[i]) )\n \n+for j in range(c):\n+\tprint(\"{0} \".format( csum[j] ), end=\"\" )\n \n-\n-\n-\n+print( sum(csum) )\n", "FL_content": " \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n r,c = map( int,input().split() )\n \n data = []\n csum = [0]*c\n \n for i in range(r):\n \tdata.append( list(map( int,input().split() )) )\n \n for i in range( r ):\n \tfor j in range(c):\n \t\tprint(\"{0} \".format(data[i][j]), end=\"\")\n \t\tcsum[j] +=data[i][j]\n \tprint( sum(data[i]) )\n \n \n-\n-\n-\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 75 }, { "user_id": "u131984977", "problem_id": "p02413", "submission1_id": "s551865630", "submission2_id": "s262392587", "status1": "Wrong Answer", "status2": "Accepted", "code1": "(r, c) = [int(i) for i in input().split()]\n\nct = [0 for d in range(c)]\ntmp = []\nfor rc in range(r):\n tmp = [int(i) for i in input().split()]\n total = 0\n for cc in range(c):\n ct[cc] += tmp[cc]\n total += tmp[cc]\n print(tmp[cc], end=' ')\n print(total)\ntotal = sum(ct)\nprint(' '.join([str(i) for i in tmp]), total)", "code2": "(r, c) = [int(i) for i in input().split()]\n\nct = [0 for d in range(c)]\ntmp = []\nfor rc in range(r):\n tmp = [int(i) for i in input().split()]\n total = 0\n for cc in range(c):\n ct[cc] += tmp[cc]\n total += tmp[cc]\n print(tmp[cc], end=' ')\n print(total)\ntotal = sum(ct)\nprint(' '.join([str(i) for i in ct]), total)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1423019825", "date2": "1423019950", "bleu_score": "0.987539700461717", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 2, "total_score": 101, "input": "4 5\n2 1 3 4 13\n2 2 2 5 5\n3 3 0 1 1\n2 6 4 1 11\n", "actual_output": "2 1 3 4 13 23\n2 2 2 5 5 16\n3 3 0 1 1 8\n2 6 4 1 11 24\n2 6 4 1 11 71\n", "expected_output": "2 1 3 4 13 23\n2 2 2 5 5 16\n3 3 0 1 1 8\n2 6 4 1 11 24\n9 12 9 11 30 71\n\n", "anno_code": ["(r, c) = [int(i) for i in input().split()] # (0): r=4, c=5\n\nct = [0 for d in range(c)] # (1): ct=[0, 0, 0, 0, 0]\ntmp = [] # (2): tmp=[]\nfor rc in range(r): # (3): rc=0 (28): rc=1 ... (103): NO CHANGE\n tmp = [int(i) for i in input().split()] # (4): tmp=[2, 1, 3, 4, 13] (29): tmp=[2, 2, 2, 5, 5] ... (79): tmp=[2, 6, 4, 1, 11]\n total = 0 # (5): total=0 (30): total=0 ... (80): total=0\n for cc in range(c): # (6): cc=0 (10): cc=1 ... (101): NO CHANGE\n ct[cc] += tmp[cc] # (7): ct=[2, 0, 0, 0, 0] (11): ct=[2, 1, 0, 0, 0] ... (98): ct=[9, 12, 9, 11, 30]\n total += tmp[cc] # (8): total=2 (12): total=3 ... (99): total=24\n print(tmp[cc], end=' ') # (9): NO CHANGE (13): NO CHANGE ... (100): NO CHANGE\n print(total) # (27): NO CHANGE (52): NO CHANGE ... (102): NO CHANGE\ntotal = sum(ct) # (104): total=71\nprint(' '.join([str(i) for i in tmp]), total)"], "anno_status": [true], "diff_content": " (r, c) = [int(i) for i in input().split()]\n \n ct = [0 for d in range(c)]\n tmp = []\n for rc in range(r):\n tmp = [int(i) for i in input().split()]\n total = 0\n for cc in range(c):\n ct[cc] += tmp[cc]\n total += tmp[cc]\n print(tmp[cc], end=' ')\n print(total)\n total = sum(ct)\n-print(' '.join([str(i) for i in tmp]), total)\n+print(' '.join([str(i) for i in ct]), total)\n", "FL_content": " (r, c) = [int(i) for i in input().split()]\n \n ct = [0 for d in range(c)]\n tmp = []\n for rc in range(r):\n tmp = [int(i) for i in input().split()]\n total = 0\n for cc in range(c):\n ct[cc] += tmp[cc]\n total += tmp[cc]\n print(tmp[cc], end=' ')\n print(total)\n total = sum(ct)\n-print(' '.join([str(i) for i in tmp]), total)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 14 }, { "user_id": "u628732336", "problem_id": "p02413", "submission1_id": "s835234408", "submission2_id": "s000455519", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r, c = [int(i) for i in input().split()]\n\ndata = []\nsum_row = [0] * (c + 1)\n\nfor ri in range(r):\n data.append([int(i) for i in input().split()])\n data[ri].append(sum(data[ri]))\n print(\" \".join([str(d) for d in data[ri]]))\n for ci in range(c + 1):\n sum_row[ci] += data[ri][ci]\n\nprint(\" \".join([str(s) for s in sum_row]))\n\nfrom pprint import pprint\npprint(data)\npprint(sum_row)", "code2": "r, c = [int(i) for i in input().split()]\n\ndata = []\nsum_row = [0] * (c + 1)\n\nfor ri in range(r):\n data.append([int(i) for i in input().split()])\n data[ri].append(sum(data[ri]))\n print(\" \".join([str(d) for d in data[ri]]))\n for ci in range(c + 1):\n sum_row[ci] += data[ri][ci]\n\nprint(\" \".join([str(s) for s in sum_row]))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1470199481", "date2": "1470199498", "bleu_score": "0.8473169312608667", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "4 5\n4 1 3 5 0\n4 4 1 6 10\n3 4 0 1 3\n2 0 4 18 5\n", "actual_output": "4 1 3 5 0 13\n4 4 1 6 10 25\n3 4 0 1 3 11\n2 0 4 18 5 29\n13 9 8 30 18 78\n[[4, 1, 3, 5, 0, 13],\n [4, 4, 1, 6, 10, 25],\n [3, 4, 0, 1, 3, 11],\n [2, 0, 4, 18, 5, 29]]\n[13, 9, 8, 30, 18, 78]\n", "expected_output": "4 1 3 5 0 13\n4 4 1 6 10 25\n3 4 0 1 3 11\n2 0 4 18 5 29\n13 9 8 30 18 78\n\n", "anno_code": ["r, c = [int(i) for i in input().split()] # (0): r=4, c=5\n\ndata = [] # (1): data=[]\nsum_row = [0] * (c + 1) # (2): sum_row=[0, 0, 0, 0, 0, 0]\n\nfor ri in range(r): # (3): ri=0 (20): ri=1 ... (71): NO CHANGE\n data.append([int(i) for i in input().split()]) # (4): data (21): data ... (55): data\n data[ri].append(sum(data[ri])) # (5): data (22): data ... (56): data\n print(\" \".join([str(d) for d in data[ri]])) # (6): NO CHANGE (23): NO CHANGE ... (57): NO CHANGE\n for ci in range(c + 1): # (7): ci=0 (9): ci=1 ... (70): NO CHANGE\n sum_row[ci] += data[ri][ci] # (8): sum_row=[4, 0, 0, 0, 0, 0] (10): sum_row=[4, 1, 0, 0, 0, 0] ... (69): sum_row=[13, 9, 8, 30, 18, 78]\n\nprint(\" \".join([str(s) for s in sum_row])) # (72): pprint=\n\nfrom pprint import pprint\npprint(data) # (73): NO CHANGE\npprint(sum_row)"], "anno_status": [true], "diff_content": " r, c = [int(i) for i in input().split()]\n \n data = []\n sum_row = [0] * (c + 1)\n \n for ri in range(r):\n data.append([int(i) for i in input().split()])\n data[ri].append(sum(data[ri]))\n print(\" \".join([str(d) for d in data[ri]]))\n for ci in range(c + 1):\n sum_row[ci] += data[ri][ci]\n \n print(\" \".join([str(s) for s in sum_row]))\n-\n-from pprint import pprint\n-pprint(data)\n-pprint(sum_row)\n", "FL_content": " r, c = [int(i) for i in input().split()]\n \n data = []\n sum_row = [0] * (c + 1)\n \n for ri in range(r):\n data.append([int(i) for i in input().split()])\n data[ri].append(sum(data[ri]))\n print(\" \".join([str(d) for d in data[ri]]))\n for ci in range(c + 1):\n sum_row[ci] += data[ri][ci]\n \n print(\" \".join([str(s) for s in sum_row]))\n-\n-from pprint import pprint\n-pprint(data)\n-pprint(sum_row)\n", "added_lines": 0, "removed_lines": 4, "code1_lines": 17 }, { "user_id": "u663910047", "problem_id": "p02413", "submission1_id": "s377563832", "submission2_id": "s349191573", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m = map(int,(input().split()))\na = []\nfor i in range(n):\n k = [int(i) for i in input().split()]\n k.append(sum(k))\n a.append(k)\n\nfor j in a:\n print(' '.join(map(str, j)))", "code2": "n,m = map(int,(input().split()))\na = []\ns = []\nfor i in range(m):\n s.append(0)\n\nfor i in range(n):\n k = [int(i) for i in input().split()]\n k.append(sum(k))\n a.append(k)\n for j in range(m):\n s[j] += k[j]\n\ns.append(sum(s))\na.append(s)\n\nfor j in a:\n print(' '.join(map(str, j)))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1500195852", "date2": "1500196870", "bleu_score": "0.607186674424615", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "4 5\n1 0 1 5 8\n2 2 2 4 5\n3 3 0 1 1\n2 3 4 4 0\n", "actual_output": "1 0 1 5 8 15\n2 2 2 4 5 15\n3 3 0 1 1 8\n2 3 4 4 0 13\n", "expected_output": "1 0 1 5 8 15\n2 2 2 4 5 15\n3 3 0 1 1 8\n2 3 4 4 0 13\n8 8 7 14 14 51\n\n", "anno_code": ["n,m = map(int,(input().split())) # (0): n=4, m=5\na = [] # (1): a=[]\nfor i in range(n): # (2): i=0 (6): i=1 ... (18): NO CHANGE\n k = [int(i) for i in input().split()] # (3): k=[1, 0, 1, 5, 8] (7): k=[2, 2, 2, 4, 5] ... (15): k=[2, 3, 4, 4, 0]\n k.append(sum(k)) # (4): k=[1, 0, 1, 5, 8, 15] (8): k=[2, 2, 2, 4, 5, 15] ... (16): k=[2, 3, 4, 4, 0, 13]\n a.append(k) # (5): a (9): a ... (17): a\n\nfor j in a: # (19): j=[1, 0, 1, 5, 8, 15] (21): j=[2, 2, 2, 4, 5, 15] ... (25): j=[2, 3, 4, 4, 0, 13]\n print(' '.join(map(str, j))) # (20): NO CHANGE (22): NO CHANGE ... (26): NO CHANGE\n"], "anno_status": [true], "diff_content": " n,m = map(int,(input().split()))\n a = []\n+s = []\n+for i in range(m):\n+ s.append(0)\n+\n for i in range(n):\n k = [int(i) for i in input().split()]\n k.append(sum(k))\n a.append(k)\n+ for j in range(m):\n+ s[j] += k[j]\n+\n+s.append(sum(s))\n+a.append(s)\n \n for j in a:\n print(' '.join(map(str, j)))\n", "FL_content": " n,m = map(int,(input().split()))\n a = []\n for i in range(n):\n k = [int(i) for i in input().split()]\n k.append(sum(k))\n a.append(k)\n \n for j in a:\n print(' '.join(map(str, j)))\n", "added_lines": 9, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u662822413", "problem_id": "p02413", "submission1_id": "s806947045", "submission2_id": "s745798785", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H,W = map(int,input().split())\ntable = [[0]*(W+1) for i in range(H+1)]\n\nfor row in range(H):\n work = list(map(int,input().split()))\n for col in range(W):\n table[row][col] = work[col]\n\nfor row in range(H):\n for col in range(W):\n table[row][W] += table[row][col]\n\nfor col in range(W):\n for row in range(H):\n table[H][col] += table[row][col]\n\nfor row in range(H+1):\n print(\"%d\"%(table[row][0]),end=\"\")\n for col in range(1,W+1):\n print(\" %d\"%(table[row][col]),end=\"\")\n print()\n \n\n", "code2": "H,W = map(int,input().split())\ntable = [[0]*(W+1) for i in range(H+1)]\n\nfor row in range(H):\n work = list(map(int,input().split()))\n for col in range(W):\n table[row][col] = work[col]\n\nfor row in range(H):\n for col in range(W):\n table[row][W] += table[row][col]\n\nfor col in range(W+1):\n for row in range(H):\n table[H][col] += table[row][col]\n\nfor row in range(H+1):\n print(\"%d\"%(table[row][0]),end=\"\")\n for col in range(1,W+1):\n print(\" %d\"%(table[row][col]),end=\"\")\n print()\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556539658", "date2": "1556540581", "bleu_score": "0.9866936654847834", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 101, "input": "4 5\n1 1 3 4 8\n2 2 2 4 5\n3 3 0 1 2\n2 6 0 8 6\n", "actual_output": "1 1 3 4 8 17\n2 2 2 4 5 15\n3 3 0 1 2 9\n2 6 0 8 6 22\n8 12 5 17 21 0\n", "expected_output": "1 1 3 4 8 17\n2 2 2 4 5 15\n3 3 0 1 2 9\n2 6 0 8 6 22\n8 12 5 17 21 63\n\n", "anno_code": ["H,W = map(int,input().split()) # (0): H=4, W=5\ntable = [[0]*(W+1) for i in range(H+1)] # (1): table\n\nfor row in range(H): # (2): row=0 (15): row=1 ... (54): NO CHANGE\n work = list(map(int,input().split())) # (3): work=[1, 1, 3, 4, 8] (16): work=[2, 2, 2, 4, 5] ... (42): work=[2, 6, 0, 8, 6]\n for col in range(W): # (4): col=0 (6): col=1 ... (53): NO CHANGE\n table[row][col] = work[col] # (5): table (7): table ... (52): table\n\nfor row in range(H): # (55): row=0 (67): row=1 ... (103): NO CHANGE\n for col in range(W): # (56): col=0 (58): col=1 ... (102): NO CHANGE\n table[row][W] += table[row][col] # (57): table (59): table ... (101): table\n\nfor col in range(W): # (104): col=0 (114): col=1 ... (154): NO CHANGE\n for row in range(H): # (105): row=0 (107): row=1 ... (153): NO CHANGE\n table[H][col] += table[row][col] # (106): table (108): table ... (152): table\n\nfor row in range(H+1): # (155): row=0 (169): row=1 ... (211): row=4\n print(\"%d\"%(table[row][0]),end=\"\") # (156): NO CHANGE (170): NO CHANGE ... (212): NO CHANGE\n for col in range(1,W+1): # (157): col=1 (159): col=2 ... (223): NO CHANGE\n print(\" %d\"%(table[row][col]),end=\"\") # (158): NO CHANGE (160): NO CHANGE ... (222): NO CHANGE\n print() # (168): NO CHANGE (182): NO CHANGE ... (224): NO CHANGE\n \n\n"], "anno_status": [true], "diff_content": " H,W = map(int,input().split())\n table = [[0]*(W+1) for i in range(H+1)]\n \n for row in range(H):\n work = list(map(int,input().split()))\n for col in range(W):\n table[row][col] = work[col]\n \n for row in range(H):\n for col in range(W):\n table[row][W] += table[row][col]\n \n-for col in range(W):\n+for col in range(W+1):\n for row in range(H):\n table[H][col] += table[row][col]\n \n for row in range(H+1):\n print(\"%d\"%(table[row][0]),end=\"\")\n for col in range(1,W+1):\n print(\" %d\"%(table[row][col]),end=\"\")\n print()\n- \n \n \n", "FL_content": " H,W = map(int,input().split())\n table = [[0]*(W+1) for i in range(H+1)]\n \n for row in range(H):\n work = list(map(int,input().split()))\n for col in range(W):\n table[row][col] = work[col]\n \n for row in range(H):\n for col in range(W):\n table[row][W] += table[row][col]\n \n-for col in range(W):\n for row in range(H):\n table[H][col] += table[row][col]\n \n for row in range(H+1):\n print(\"%d\"%(table[row][0]),end=\"\")\n for col in range(1,W+1):\n print(\" %d\"%(table[row][col]),end=\"\")\n print()\n- \n \n \n", "added_lines": 1, "removed_lines": 2, "code1_lines": 24 }, { "user_id": "u711765449", "problem_id": "p02413", "submission1_id": "s880110997", "submission2_id": "s597119797", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r,c = map(int,input().split(' '))\narr = [[0 for i in range(c+1)] for i in range(r+1)]\n\nfor i in range(r):\n row = list(map(int,input().split(' ')))\n for j in range(c):\n arr[i][j] = row[j]\n\nfor i in range(r):\n for j in range(c):\n arr[i][-1] += arr[i][j]\nfor i in range(c):\n for j in range(r):\n arr[-1][i] += arr[j][i]\nfor i in range(r+1):\n arr[-1][-1] += arr[-1][i]\n\nfor i in range(r+1):\n for j in range(c):\n print(arr[i][j],end = ' ')\n print(arr[i][-1])", "code2": "r,c = map(int,input().split(' '))\narr = [[0 for i in range(c+1)] for i in range(r+1)]\n\nfor i in range(r):\n row = list(map(int,input().split(' ')))\n for j in range(c):\n arr[i][j] = row[j]\n\nfor i in range(r):\n for j in range(c):\n arr[i][-1] += arr[i][j]\nfor i in range(c):\n for j in range(r):\n arr[-1][i] += arr[j][i]\n \nif c == 1:\n for i in range(r):\n arr[-1][-1] += arr[i][0]\nelif r == 1:\n for i in range(c):\n arr[-1][-1] += arr[0][i]\nelse:\n for i in range(r):\n arr[-1][-1] += arr[i][-1]\n \nfor i in range(r+1):\n for j in range(c):\n print(arr[i][j],end = ' ')\n print(arr[i][-1])", "original_language1": "Python3", "original_language2": "Python3", "date1": "1484662852", "date2": "1484663899", "bleu_score": "0.746737517726397", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 96, "total_score": 101, "input": "1 5\n-2 0 2 3 9\n2 0 2 2 4\n3 0 0 1 1\n1 4 4 8 -1\n", "actual_output": "-2 0 2 3 9 12\n-2 0 2 3 9 -2\n", "expected_output": "-2 0 2 3 9 12\n-2 0 2 3 9 12\n\n", "anno_code": ["r,c = map(int,input().split(' ')) # (0): r=1, c=5\narr = [[0 for i in range(c+1)] for i in range(r+1)] # (1): arr\n\nfor i in range(r): # (2): i=0 (15): NO CHANGE\n row = list(map(int,input().split(' '))) # (3): row=[-2, 0, 2, 3, 9]\n for j in range(c): # (4): j=0 (6): j=1 ... (14): NO CHANGE\n arr[i][j] = row[j] # (5): arr (7): NO CHANGE ... (13): arr\n\nfor i in range(r): # (16): NO CHANGE (28): NO CHANGE\n for j in range(c): # (17): j=0 (19): j=1 ... (27): NO CHANGE\n arr[i][-1] += arr[i][j] # (18): arr (20): NO CHANGE ... (26): arr\nfor i in range(c): # (29): NO CHANGE (33): i=1 ... (49): NO CHANGE\n for j in range(r): # (30): j=0 (32): NO CHANGE ... (48): NO CHANGE\n arr[-1][i] += arr[j][i] # (31): arr (35): NO CHANGE ... (47): arr\nfor i in range(r+1): # (50): i=0 (52): i=1 (54): NO CHANGE\n arr[-1][-1] += arr[-1][i] # (51): arr (53): NO CHANGE\n\nfor i in range(r+1): # (55): i=0 (68): i=1\n for j in range(c): # (56): NO CHANGE (58): j=1 ... (79): NO CHANGE\n print(arr[i][j],end = ' ') # (57): NO CHANGE (59): NO CHANGE ... (78): NO CHANGE\n print(arr[i][-1]) # (67): NO CHANGE (80): NO CHANGE\n"], "anno_status": [true], "diff_content": " r,c = map(int,input().split(' '))\n arr = [[0 for i in range(c+1)] for i in range(r+1)]\n \n for i in range(r):\n row = list(map(int,input().split(' ')))\n for j in range(c):\n arr[i][j] = row[j]\n \n for i in range(r):\n for j in range(c):\n arr[i][-1] += arr[i][j]\n for i in range(c):\n for j in range(r):\n arr[-1][i] += arr[j][i]\n-for i in range(r+1):\n- arr[-1][-1] += arr[-1][i]\n-\n+ \n+if c == 1:\n+ for i in range(r):\n+ arr[-1][-1] += arr[i][0]\n+elif r == 1:\n+ for i in range(c):\n+ arr[-1][-1] += arr[0][i]\n+else:\n+ for i in range(r):\n+ arr[-1][-1] += arr[i][-1]\n+ \n for i in range(r+1):\n for j in range(c):\n print(arr[i][j],end = ' ')\n print(arr[i][-1])\n", "FL_content": " r,c = map(int,input().split(' '))\n arr = [[0 for i in range(c+1)] for i in range(r+1)]\n \n for i in range(r):\n row = list(map(int,input().split(' ')))\n for j in range(c):\n arr[i][j] = row[j]\n \n for i in range(r):\n for j in range(c):\n arr[i][-1] += arr[i][j]\n for i in range(c):\n for j in range(r):\n arr[-1][i] += arr[j][i]\n-for i in range(r+1):\n- arr[-1][-1] += arr[-1][i]\n-\n for i in range(r+1):\n for j in range(c):\n print(arr[i][j],end = ' ')\n print(arr[i][-1])\n", "added_lines": 11, "removed_lines": 3, "code1_lines": 21 }, { "user_id": "u805716376", "problem_id": "p02413", "submission1_id": "s172290525", "submission2_id": "s089662963", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\na = []\nb = []\nfor i in range(n):\n a += [list(map(int, input().split()))]\n print(a)\n a[i] += [sum(a[i])]\nfor i in range(m+1):\n b += [sum(x[i] for x in a)]\na += [b]\nfor i in range(n+1):\n print(*a[i])\n", "code2": "n, m = map(int, input().split())\na = []\nb = []\nfor i in range(n):\n a += [list(map(int, input().split()))]\n a[i] += [sum(a[i])]\nfor i in range(m+1):\n b += [sum(x[i] for x in a)]\na += [b]\nfor i in range(n+1):\n print(*a[i])\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556717723", "date2": "1556717764", "bleu_score": "0.9457339451341047", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 101, "input": "4 5\n4 1 3 1 13\n0 2 2 12 5\n3 6 1 1 1\n2 6 3 1 21\n", "actual_output": "[[4, 1, 3, 1, 13]]\n[[4, 1, 3, 1, 13, 22], [0, 2, 2, 12, 5]]\n[[4, 1, 3, 1, 13, 22], [0, 2, 2, 12, 5, 21], [3, 6, 1, 1, 1]]\n[[4, 1, 3, 1, 13, 22], [0, 2, 2, 12, 5, 21], [3, 6, 1, 1, 1, 12], [2, 6, 3, 1, 21]]\n4 1 3 1 13 22\n0 2 2 12 5 21\n3 6 1 1 1 12\n2 6 3 1 21 33\n9 15 9 15 40 88\n", "expected_output": "4 1 3 1 13 22\n0 2 2 12 5 21\n3 6 1 1 1 12\n2 6 3 1 21 33\n9 15 9 15 40 88\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=4, m=5\na = [] # (1): a=[]\nb = [] # (2): b=[]\nfor i in range(n): # (3): i=0 (7): i=1 ... (19): NO CHANGE\n a += [list(map(int, input().split()))] # (4): a (8): a ... (16): a\n print(a) # (5): NO CHANGE (9): a ... (17): a\n a[i] += [sum(a[i])] # (6): a (10): a ... (18): a\nfor i in range(m+1): # (20): i=0 (22): i=1 ... (32): NO CHANGE\n b += [sum(x[i] for x in a)] # (21): b=[9] (23): b=[9, 15] ... (31): b=[9, 15, 9, 15, 40, 88]\na += [b] # (33): a\nfor i in range(n+1): # (34): i=0 (36): i=1 ... (42): i=4\n print(*a[i]) # (35): NO CHANGE (37): NO CHANGE ... (43): NO CHANGE\n"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n a = []\n b = []\n for i in range(n):\n a += [list(map(int, input().split()))]\n- print(a)\n a[i] += [sum(a[i])]\n for i in range(m+1):\n b += [sum(x[i] for x in a)]\n a += [b]\n for i in range(n+1):\n print(*a[i])\n \n", "FL_content": " n, m = map(int, input().split())\n a = []\n b = []\n for i in range(n):\n a += [list(map(int, input().split()))]\n- print(a)\n a[i] += [sum(a[i])]\n for i in range(m+1):\n b += [sum(x[i] for x in a)]\n a += [b]\n for i in range(n+1):\n print(*a[i])\n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u603049633", "problem_id": "p02413", "submission1_id": "s095312383", "submission2_id": "s558652475", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r,c = map(int, input().split())\nL=[]\nfor i in range(r):\n al = input()\n print(al, end=\"\")\n AL = list(map(int, al.split()))\n S = sum(AL)\n print(\" \" + str(S))\n AL. append(S)\n L.append(AL)\n\nfor i in range(c):\n S = 0\n for j in range(r):\n S += L[j][i]\n print(str(S) + \" \", end=\"\")\nprint()", "code2": "r,c = map(int, input().split())\nL=[]\nfor i in range(r):\n al = input()\n print(al, end=\"\")\n AL = list(map(int, al.split()))\n S = sum(AL)\n print(\" \" + str(S))\n AL. append(S)\n L.append(AL)\n\nfor i in range(c):\n S = 0\n for j in range(r):\n S += L[j][i]\n print(str(S) + \" \", end=\"\")\n\nS = 0\nfor j in range(r):\n S += L[j][-1]\nprint(str(S))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1495678207", "date2": "1495678699", "bleu_score": "0.8523369642628769", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "4 5\n1 1 3 4 8\n2 2 2 4 5\n3 3 0 1 2\n2 6 4 8 6\n", "actual_output": "1 1 3 4 8 17\n2 2 2 4 5 15\n3 3 0 1 2 9\n2 6 4 8 6 26\n8 12 9 17 21 \n", "expected_output": "1 1 3 4 8 17\n2 2 2 4 5 15\n3 3 0 1 2 9\n2 6 4 8 6 26\n8 12 9 17 21 67\n\n", "anno_code": ["r,c = map(int, input().split()) # (0): r=4, c=5\nL=[] # (1): L=[]\nfor i in range(r): # (2): i=0 (10): i=1 ... (34): NO CHANGE\n al = input() # (3): al=1 1 3 4 8 (11): al=2 2 2 4 5 ... (27): al=2 6 4 8 6\n print(al, end=\"\") # (4): NO CHANGE (12): NO CHANGE ... (28): NO CHANGE\n AL = list(map(int, al.split())) # (5): AL=[1, 1, 3, 4, 8] (13): AL=[2, 2, 2, 4, 5] ... (29): AL=[2, 6, 4, 8, 6]\n S = sum(AL) # (6): S=17 (14): S=15 ... (30): S=26\n print(\" \" + str(S)) # (7): NO CHANGE (15): NO CHANGE ... (31): NO CHANGE\n AL. append(S) # (8): AL=[1, 1, 3, 4, 8, 17] (16): AL=[2, 2, 2, 4, 5, 15] ... (32): AL=[2, 6, 4, 8, 6, 26]\n L.append(AL) # (9): L (17): L ... (33): L\n\nfor i in range(c): # (35): i=0 (47): i=1 ... (95): NO CHANGE\n S = 0 # (36): S=0 (48): S=0 ... (84): S=0\n for j in range(r): # (37): j=0 (39): j=1 ... (93): NO CHANGE\n S += L[j][i] # (38): S=1 (40): S=3 ... (92): S=21\n print(str(S) + \" \", end=\"\") # (46): NO CHANGE (58): NO CHANGE ... (94): NO CHANGE\nprint()"], "anno_status": [true], "diff_content": " r,c = map(int, input().split())\n L=[]\n for i in range(r):\n al = input()\n print(al, end=\"\")\n AL = list(map(int, al.split()))\n S = sum(AL)\n print(\" \" + str(S))\n AL. append(S)\n L.append(AL)\n \n for i in range(c):\n S = 0\n for j in range(r):\n S += L[j][i]\n print(str(S) + \" \", end=\"\")\n-print()\n+\n+S = 0\n+for j in range(r):\n+ S += L[j][-1]\n+print(str(S))\n", "FL_content": " r,c = map(int, input().split())\n L=[]\n for i in range(r):\n al = input()\n print(al, end=\"\")\n AL = list(map(int, al.split()))\n S = sum(AL)\n print(\" \" + str(S))\n AL. append(S)\n L.append(AL)\n \n for i in range(c):\n S = 0\n for j in range(r):\n S += L[j][i]\n print(str(S) + \" \", end=\"\")\n-print()\n", "added_lines": 5, "removed_lines": 1, "code1_lines": 17 }, { "user_id": "u527848444", "problem_id": "p02413", "submission1_id": "s229031665", "submission2_id": "s350105792", "status1": "Wrong Answer", "status2": "Accepted", "code1": "(r,c) = [int(i) for i in input().split()]\n\ntable = []\nfor rc in range(r):\n table.append([int(i) for i in input().split()])\n\ntable.append([0 for _ in range(c)])\n\nfor rc in range(r):\n row_total = 0\n for cc in range(c):\n table[r][cc] += table[rc][cc]\n row_total += table[rc][cc]\n\n table[rc].append(row_total)\n\nfor row in table:\n for column in row:\n print(column,end=' ')\n\n print()", "code2": "(r,c) = [int(i) for i in input().split()]\n\ntable = []\nfor rc in range(r):\n table.append([int(i) for i in input().split()])\n\ntable.append([0 for _ in range(c + 1)])\n\nfor rc in range(r):\n row_total = 0\n for cc in range(c):\n table[r][cc] += table[rc][cc]\n row_total += table[rc][cc]\n\n table[rc].append(row_total)\n table[r][c] += row_total\n\nfor row in table:\n print(' '.join([str(column) for column in row]))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1424659755", "date2": "1424660293", "bleu_score": "0.888709167182624", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "4 5\n1 1 3 4 8\n2 2 2 4 5\n3 3 0 1 2\n2 6 4 8 6\n", "actual_output": "1 1 3 4 8 17 \n2 2 2 4 5 15 \n3 3 0 1 2 9 \n2 6 4 8 6 26 \n8 12 9 17 21 \n", "expected_output": "1 1 3 4 8 17\n2 2 2 4 5 15\n3 3 0 1 2 9\n2 6 4 8 6 26\n8 12 9 17 21 67\n\n", "anno_code": ["(r,c) = [int(i) for i in input().split()] # (0): r=4, c=5\n\ntable = [] # (1): table=[]\nfor rc in range(r): # (2): rc=0 (4): rc=1 ... (10): NO CHANGE\n table.append([int(i) for i in input().split()]) # (3): table (5): table ... (9): table\n\ntable.append([0 for _ in range(c)]) # (11): table\n\nfor rc in range(r): # (12): rc=0 (31): table, rc=1 ... (88): table\n row_total = 0 # (13): row_total=0 (32): table=[[1, 1, 3, 4, 8, 17], [2, 2, 2, 4, 5], [3, 3, 0, 1, 2], [2, 6, 4, 8, 6], [1, 1, 3, 4, 8]], row_total=0 ... (70): table, row_total=0\n for cc in range(c): # (14): cc=0 (17): cc=1 ... (86): table\n table[r][cc] += table[rc][cc] # (15): table (18): table ... (84): table\n row_total += table[rc][cc] # (16): row_total=1 (19): row_total=2 ... (85): table, row_total=26\n\n table[rc].append(row_total) # (30): table (49): table ... (87): table\n\nfor row in table: # (89): table, row=[1, 1, 3, 4, 8, 17] (104): table, row=[2, 2, 2, 4, 5, 15] ... (149): table, row=[8, 12, 9, 17, 21]\n for column in row: # (90): table, column=1 (92): table ... (160): table\n print(column,end=' ') # (91): table (93): table ... (159): table\n\n print() # (103): table (118): table ... (161): table\n"], "anno_status": [true], "diff_content": " (r,c) = [int(i) for i in input().split()]\n \n table = []\n for rc in range(r):\n table.append([int(i) for i in input().split()])\n \n-table.append([0 for _ in range(c)])\n+table.append([0 for _ in range(c + 1)])\n \n for rc in range(r):\n row_total = 0\n for cc in range(c):\n table[r][cc] += table[rc][cc]\n row_total += table[rc][cc]\n \n table[rc].append(row_total)\n+ table[r][c] += row_total\n \n for row in table:\n- for column in row:\n- print(column,end=' ')\n-\n- print()\n+ print(' '.join([str(column) for column in row]))\n", "FL_content": " (r,c) = [int(i) for i in input().split()]\n \n table = []\n for rc in range(r):\n table.append([int(i) for i in input().split()])\n \n-table.append([0 for _ in range(c)])\n \n for rc in range(r):\n row_total = 0\n for cc in range(c):\n table[r][cc] += table[rc][cc]\n row_total += table[rc][cc]\n \n table[rc].append(row_total)\n \n for row in table:\n- for column in row:\n- print(column,end=' ')\n-\n- print()\n", "added_lines": 3, "removed_lines": 5, "code1_lines": 21 }, { "user_id": "u539753516", "problem_id": "p02413", "submission1_id": "s956520173", "submission2_id": "s050160440", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r,c=map(int, input().split())\nfor i in range(r):\n a=list(map(int, input().split()))\n a.append(sum(a))\n print(*a)\n", "code2": "r,c=map(int, input().split())\ntotal=[0]*(c+1)\nfor i in range(r):\n a=list(map(int, input().split()))\n a.append(sum(a))\n print(*a)\n for j in range(c+1):\n total[j]+=a[j]\nprint(*total)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1531242738", "date2": "1531271809", "bleu_score": "0.605757069751726", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "4 5\n2 1 3 5 1\n4 3 1 6 10\n3 4 0 1 2\n2 6 4 21 5\n", "actual_output": "2 1 3 5 1 12\n4 3 1 6 10 24\n3 4 0 1 2 10\n2 6 4 21 5 38\n", "expected_output": "2 1 3 5 1 12\n4 3 1 6 10 24\n3 4 0 1 2 10\n2 6 4 21 5 38\n11 14 8 33 18 84\n\n", "anno_code": ["r,c=map(int, input().split()) # (0): r=4, c=5\nfor i in range(r): # (1): i=0 (5): i=1 ... (13): i=3\n a=list(map(int, input().split())) # (2): a=[2, 1, 3, 5, 1] (6): a=[4, 3, 1, 6, 10] ... (14): a=[2, 6, 4, 21, 5]\n a.append(sum(a)) # (3): a=[2, 1, 3, 5, 1, 12] (7): a=[4, 3, 1, 6, 10, 24] ... (15): a=[2, 6, 4, 21, 5, 38]\n print(*a) # (4): NO CHANGE (8): NO CHANGE ... (16): NO CHANGE\n"], "anno_status": [true], "diff_content": " r,c=map(int, input().split())\n+total=[0]*(c+1)\n for i in range(r):\n a=list(map(int, input().split()))\n a.append(sum(a))\n print(*a)\n+ for j in range(c+1):\n+ total[j]+=a[j]\n+print(*total)\n \n", "FL_content": " r,c=map(int, input().split())\n for i in range(r):\n a=list(map(int, input().split()))\n a.append(sum(a))\n print(*a)\n \n", "added_lines": 4, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u545368057", "problem_id": "p02867", "submission1_id": "s147530812", "submission2_id": "s203335472", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\n\nfrom collections import defaultdict\nclass UnionFind:\n def __init__(self, n):\n class KeyDict(dict):\n \n def __missing__(self,key):\n self[key] = key\n return key\n self.parent = KeyDict()\n self.rank = defaultdict(int)\n self.weight = defaultdict(int)\n\n \n def find(self, x):\n if self.parent[x] == x:\n return x\n else:\n \n \n y = self.find(self.parent[x]) \n self.weight[x] += self.weight[self.parent[x]] \n self.parent[x] = y \n return self.parent[x]\n\n \n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n \n if self.rank[x] < self.rank[y]:\n self.parent[x] = y\n else:\n self.parent[y] = x\n \n if self.rank[x] == self.rank[y]:\n self.rank[x] += 1\n\n \n def weighted_union(self, x, y, w):\n \n px = self.find(x)\n py = self.find(y)\n \n \n if self.rank[px] < self.rank[py]:\n self.parent[px] = py\n self.weight[px] = - w - self.weight[x] + self.weight[y]\n else:\n self.parent[py] = px\n self.weight[py] = w + self.weight[x] - self.weight[y]\n if self.rank[px] == self.rank[py]:\n self.rank[px] += 1\n return 0\n\n \n def judge(self, x, y):\n return self.find(x) == self.find(y)\n\nN = int(input())\nAs = list(map(int, input().split()))\nBs = list(map(int, input().split()))\nAs_ind = [(a,i) for i,a in enumerate(As)]\nBs_ind = [(b,i) for i,b in enumerate(Bs)]\nAs_ind.sort()\nBs_ind.sort()\n\n\nuf = UnionFind(N)\nd_list = defaultdict(list)\nfor A,B in zip(As_ind,Bs_ind):\n \n if A[0] > B[0]:\n print(\"No\")\n exit()\n uf.union(A[1],B[1])\n d_list[uf.find(A[1])].append(A[0])\n\n\nd_ans = defaultdict(int)\nfor i in range(N):\n root = uf.find(i)\n d_ans[root] += 1\nif len(d_ans) >= 2:\n print(\"Yes\")\nelse:\n \n for k in d_list.keys():\n if len(d_list[k]) > len(set(d_list[k])):\n print(\"Yes\")\n exit()\n print(\"No\")", "code2": "\n\n\n\n\n\nfrom collections import defaultdict\nclass UnionFind:\n def __init__(self, n):\n class KeyDict(dict):\n \n def __missing__(self,key):\n self[key] = key\n return key\n self.parent = KeyDict()\n self.rank = defaultdict(int)\n self.weight = defaultdict(int)\n\n \n def find(self, x):\n if self.parent[x] == x:\n return x\n else:\n \n \n y = self.find(self.parent[x]) \n self.weight[x] += self.weight[self.parent[x]] \n self.parent[x] = y \n return self.parent[x]\n\n \n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n \n if self.rank[x] < self.rank[y]:\n self.parent[x] = y\n else:\n self.parent[y] = x\n \n if self.rank[x] == self.rank[y]:\n self.rank[x] += 1\n\n \n def weighted_union(self, x, y, w):\n \n px = self.find(x)\n py = self.find(y)\n \n \n if self.rank[px] < self.rank[py]:\n self.parent[px] = py\n self.weight[px] = - w - self.weight[x] + self.weight[y]\n else:\n self.parent[py] = px\n self.weight[py] = w + self.weight[x] - self.weight[y]\n if self.rank[px] == self.rank[py]:\n self.rank[px] += 1\n return 0\n\n \n def judge(self, x, y):\n return self.find(x) == self.find(y)\n\nN = int(input())\nAs = list(map(int, input().split()))\nBs = list(map(int, input().split()))\nAs_ind = [(a,i) for i,a in enumerate(As)]\nBs_ind = [(b,i) for i,b in enumerate(Bs)]\nAs_ind.sort()\nBs_ind.sort()\n\n\n\nuf = UnionFind(N)\ncnt = 0\nfor A,B in zip(As_ind,Bs_ind):\n \n if A[0] > B[0]:\n print(\"No\")\n exit()\n uf.union(A[1],B[1])\n\n\nd_ans = defaultdict(int)\n\nfor i in range(N):\n root = uf.find(i)\n d_ans[root] += 1\nif len(d_ans) >= 2:\n print(\"Yes\")\nelse:\n \n \n \n for i in range(1,N):\n if As_ind[i][0] <= Bs_ind[i-1][0]:\n print(\"Yes\")\n exit()\n print(\"No\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1573357541", "date2": "1573502239", "bleu_score": "0.9510753352732632", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 96, "total_score": 103, "input": "3\n0 -3 2\n-1 18 8\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["\n\n\n\n\n\nfrom collections import defaultdict\nclass UnionFind: # (0): UnionFind=\n def __init__(self, n):\n class KeyDict(dict): # (9): KeyDict=\n \n def __missing__(self,key):\n self[key] = key # (19): self=, x=1, y=0 (22): self=, x=1, y=0 (40): self=, x=1, y=2\n return key\n self.parent = KeyDict() # (10): NO CHANGE\n self.rank = defaultdict(int) # (11): NO CHANGE\n self.weight = defaultdict(int) # (12): defaultdict=, UnionFind=, N=3, As=[0, -3, 2], Bs=[-1, 18, 8], As_ind=[(-3, 1), (0, 0), (2, 2)], Bs_ind=[(-1, 0), (8, 2), (18, 1)], uf=\n\n \n def find(self, x):\n if self.parent[x] == x: # (18): self={}, key=1 (21): self={1: 1}, key=0 ... (89): x=2, y=1\n return x\n else:\n \n \n y = self.find(self.parent[x]) # (34): x=1 (46): x=1 ... (88): x=1\n self.weight[x] += self.weight[self.parent[x]] # (36): NO CHANGE (48): NO CHANGE ... (90): NO CHANGE\n self.parent[x] = y # (37): x=1, y=2 (49): defaultdict=, UnionFind=, N=3, As=[0, -3, 2], Bs=[-1, 18, 8], As_ind=[(-3, 1), (0, 0), (2, 2)], Bs_ind=[(-1, 0), (8, 2), (18, 1)], uf=, d_list=defaultdict(, {1: [-3, 0]}), A=(0, 0), B=(8, 2) ... (91): defaultdict=, UnionFind=, N=3, As=[0, -3, 2], Bs=[-1, 18, 8], As_ind=[(-3, 1), (0, 0), (2, 2)], Bs_ind=[(-1, 0), (8, 2), (18, 1)], uf=, d_list=defaultdict(, {1: [-3, 0, 2]}), A=(2, 2), B=(18, 1), d_ans=defaultdict(, {1: 2}), i=2, root=1\n return self.parent[x]\n\n \n def union(self, x, y):\n x = self.find(x) # (17): NO CHANGE (32): NO CHANGE (53): NO CHANGE\n y = self.find(y) # (20): x=0 (38): x=2 (59): NO CHANGE\n \n if self.rank[x] < self.rank[y]: # (23): NO CHANGE (41): NO CHANGE (61): NO CHANGE\n self.parent[x] = y\n else:\n self.parent[y] = x # (24): NO CHANGE (42): NO CHANGE (62): NO CHANGE\n \n if self.rank[x] == self.rank[y]: # (25): NO CHANGE (43): defaultdict=, UnionFind=, N=3, As=[0, -3, 2], Bs=[-1, 18, 8], As_ind=[(-3, 1), (0, 0), (2, 2)], Bs_ind=[(-1, 0), (8, 2), (18, 1)], uf=, d_list=defaultdict(, {1: [-3]}), A=(0, 0), B=(8, 2) (63): NO CHANGE\n self.rank[x] += 1 # (26): defaultdict=, UnionFind=, N=3, As=[0, -3, 2], Bs=[-1, 18, 8], As_ind=[(-3, 1), (0, 0), (2, 2)], Bs_ind=[(-1, 0), (8, 2), (18, 1)], uf=, d_list=defaultdict(, {}), A=(-3, 1), B=(-1, 0) (64): defaultdict=, UnionFind=, N=3, As=[0, -3, 2], Bs=[-1, 18, 8], As_ind=[(-3, 1), (0, 0), (2, 2)], Bs_ind=[(-1, 0), (8, 2), (18, 1)], uf=, d_list=defaultdict(, {1: [-3, 0]}), A=(2, 2), B=(18, 1)\n\n \n def weighted_union(self, x, y, w):\n \n px = self.find(x)\n py = self.find(y)\n \n \n if self.rank[px] < self.rank[py]:\n self.parent[px] = py\n self.weight[px] = - w - self.weight[x] + self.weight[y]\n else:\n self.parent[py] = px\n self.weight[py] = w + self.weight[x] - self.weight[y]\n if self.rank[px] == self.rank[py]:\n self.rank[px] += 1\n return 0\n\n \n def judge(self, x, y):\n return self.find(x) == self.find(y)\n\nN = int(input()) # (1): N=3\nAs = list(map(int, input().split())) # (2): As=[0, -3, 2]\nBs = list(map(int, input().split())) # (3): Bs=[-1, 18, 8]\nAs_ind = [(a,i) for i,a in enumerate(As)] # (4): As_ind=[(0, 0), (-3, 1), (2, 2)]\nBs_ind = [(b,i) for i,b in enumerate(Bs)] # (5): Bs_ind=[(-1, 0), (18, 1), (8, 2)]\nAs_ind.sort() # (6): As_ind=[(-3, 1), (0, 0), (2, 2)]\nBs_ind.sort() # (7): Bs_ind=[(-1, 0), (8, 2), (18, 1)]\n\n\nuf = UnionFind(N) # (8): self=, n=3\nd_list = defaultdict(list) # (13): d_list=defaultdict(, {})\nfor A,B in zip(As_ind,Bs_ind): # (14): A=(-3, 1), B=(-1, 0) (29): A=(0, 0), B=(8, 2) ... (71): NO CHANGE\n \n if A[0] > B[0]: # (15): NO CHANGE (30): NO CHANGE (51): NO CHANGE\n print(\"No\")\n exit()\n uf.union(A[1],B[1]) # (16): self=, x=1, y=0 (31): self=, x=0, y=2 (52): self=, x=2, y=1\n d_list[uf.find(A[1])].append(A[0]) # (27): self=, x=1 (44): self=, x=0 (65): self=, x=2\n\n\nd_ans = defaultdict(int) # (72): d_ans=defaultdict(, {})\nfor i in range(N): # (73): i=0 (81): i=1 ... (93): NO CHANGE\n root = uf.find(i) # (74): self=, x=0 (82): self=, x=1 (86): self=, x=2\n d_ans[root] += 1 # (80): d_ans=defaultdict(, {1: 1}) (84): d_ans=defaultdict(, {1: 2}) (92): d_ans=defaultdict(, {1: 3})\nif len(d_ans) >= 2: # (94): NO CHANGE\n print(\"Yes\")\nelse:\n \n for k in d_list.keys(): # (95): k=1 (97): NO CHANGE\n if len(d_list[k]) > len(set(d_list[k])): # (96): NO CHANGE\n print(\"Yes\")\n exit()\n print(\"No\")"], "anno_status": [false], "diff_content": " \n \n \n \n \n \n from collections import defaultdict\n class UnionFind:\n def __init__(self, n):\n class KeyDict(dict):\n \n def __missing__(self,key):\n self[key] = key\n return key\n self.parent = KeyDict()\n self.rank = defaultdict(int)\n self.weight = defaultdict(int)\n \n \n def find(self, x):\n if self.parent[x] == x:\n return x\n else:\n \n \n y = self.find(self.parent[x]) \n self.weight[x] += self.weight[self.parent[x]] \n self.parent[x] = y \n return self.parent[x]\n \n \n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n \n if self.rank[x] < self.rank[y]:\n self.parent[x] = y\n else:\n self.parent[y] = x\n \n if self.rank[x] == self.rank[y]:\n self.rank[x] += 1\n \n \n def weighted_union(self, x, y, w):\n \n px = self.find(x)\n py = self.find(y)\n \n \n if self.rank[px] < self.rank[py]:\n self.parent[px] = py\n self.weight[px] = - w - self.weight[x] + self.weight[y]\n else:\n self.parent[py] = px\n self.weight[py] = w + self.weight[x] - self.weight[y]\n if self.rank[px] == self.rank[py]:\n self.rank[px] += 1\n return 0\n \n \n def judge(self, x, y):\n return self.find(x) == self.find(y)\n \n N = int(input())\n As = list(map(int, input().split()))\n Bs = list(map(int, input().split()))\n As_ind = [(a,i) for i,a in enumerate(As)]\n Bs_ind = [(b,i) for i,b in enumerate(Bs)]\n As_ind.sort()\n Bs_ind.sort()\n \n \n+\n uf = UnionFind(N)\n-d_list = defaultdict(list)\n+cnt = 0\n for A,B in zip(As_ind,Bs_ind):\n \n if A[0] > B[0]:\n print(\"No\")\n exit()\n uf.union(A[1],B[1])\n- d_list[uf.find(A[1])].append(A[0])\n \n \n d_ans = defaultdict(int)\n+\n for i in range(N):\n root = uf.find(i)\n d_ans[root] += 1\n if len(d_ans) >= 2:\n print(\"Yes\")\n else:\n \n- for k in d_list.keys():\n- if len(d_list[k]) > len(set(d_list[k])):\n+ \n+ \n+ for i in range(1,N):\n+ if As_ind[i][0] <= Bs_ind[i-1][0]:\n print(\"Yes\")\n exit()\n print(\"No\")\n", "FL_content": " \n \n \n \n \n \n from collections import defaultdict\n class UnionFind:\n def __init__(self, n):\n class KeyDict(dict):\n \n def __missing__(self,key):\n self[key] = key\n return key\n self.parent = KeyDict()\n self.rank = defaultdict(int)\n self.weight = defaultdict(int)\n \n \n def find(self, x):\n if self.parent[x] == x:\n return x\n else:\n \n \n y = self.find(self.parent[x]) \n self.weight[x] += self.weight[self.parent[x]] \n self.parent[x] = y \n return self.parent[x]\n \n \n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n \n if self.rank[x] < self.rank[y]:\n self.parent[x] = y\n else:\n self.parent[y] = x\n \n if self.rank[x] == self.rank[y]:\n self.rank[x] += 1\n \n \n def weighted_union(self, x, y, w):\n \n px = self.find(x)\n py = self.find(y)\n \n \n if self.rank[px] < self.rank[py]:\n self.parent[px] = py\n self.weight[px] = - w - self.weight[x] + self.weight[y]\n else:\n self.parent[py] = px\n self.weight[py] = w + self.weight[x] - self.weight[y]\n if self.rank[px] == self.rank[py]:\n self.rank[px] += 1\n return 0\n \n \n def judge(self, x, y):\n return self.find(x) == self.find(y)\n \n N = int(input())\n As = list(map(int, input().split()))\n Bs = list(map(int, input().split()))\n As_ind = [(a,i) for i,a in enumerate(As)]\n Bs_ind = [(b,i) for i,b in enumerate(Bs)]\n As_ind.sort()\n Bs_ind.sort()\n \n \n uf = UnionFind(N)\n-d_list = defaultdict(list)\n for A,B in zip(As_ind,Bs_ind):\n \n if A[0] > B[0]:\n print(\"No\")\n exit()\n uf.union(A[1],B[1])\n- d_list[uf.find(A[1])].append(A[0])\n \n \n d_ans = defaultdict(int)\n for i in range(N):\n root = uf.find(i)\n d_ans[root] += 1\n if len(d_ans) >= 2:\n print(\"Yes\")\n else:\n \n- for k in d_list.keys():\n- if len(d_list[k]) > len(set(d_list[k])):\n print(\"Yes\")\n exit()\n print(\"No\")\n", "added_lines": 7, "removed_lines": 4, "code1_lines": 97 }, { "user_id": "u970449052", "problem_id": "p02867", "submission1_id": "s554535648", "submission2_id": "s121317134", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nal=list(map(int,input().split()))\nbl=list(map(int,input().split()))\nail=[(i,a) for i,a in enumerate(al)]\nbil=[(i,b) for i,b in enumerate(bl)]\nail=sorted(ail,key=lambda x:x[1])\nbil=sorted(bil,key=lambda x:x[1])\nif not all([ail[i][1]<=bil[i][1] for i in range(n)]):\n print('No')\n exit()\nif any([ail[i][0]==bil[i][0] for i in range(n)]):\n print('Yes')\n exit()\nc=[(ail[i][0],bil[i][0]) for i in range(n)]\nc=sorted(c)\nidx=0\nfor _ in range(n-2):\n idx=c[idx][1]\n if idx==0:\n print('Yes')\n break\nelse:\n print('No')", "code2": "n=int(input())\nal=list(map(int,input().split()))\nbl=list(map(int,input().split()))\nail=[(i,a) for i,a in enumerate(al)]\nbil=[(i,b) for i,b in enumerate(bl)]\nail=sorted(ail,key=lambda x:x[1])\nbil=sorted(bil,key=lambda x:x[1])\nif not all([ail[i][1]<=bil[i][1] for i in range(n)]):\n print('No')\n exit()\nif any([ail[i+1][1]<=bil[i][1] for i in range(n-1)]):\n print('Yes')\n exit()\nc=[(ail[i][0],bil[i][0]) for i in range(n)]\nc=sorted(c)\nidx=0\nfor _ in range(n-1):\n idx=c[idx][1]\n if idx==0:\n print('Yes')\n break\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573533023", "date2": "1573533371", "bleu_score": "0.9712792109815737", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 92, "total_score": 103, "input": "3\n1 3 1\n3 2 4\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["n=int(input()) # (0): n=3\nal=list(map(int,input().split())) # (1): al=[1, 3, 1]\nbl=list(map(int,input().split())) # (2): bl=[3, 2, 4]\nail=[(i,a) for i,a in enumerate(al)] # (3): ail=[(0, 1), (1, 3), (2, 1)]\nbil=[(i,b) for i,b in enumerate(bl)] # (4): bil=[(0, 3), (1, 2), (2, 4)]\nail=sorted(ail,key=lambda x:x[1]) # (5): ail=[(0, 1), (2, 1), (1, 3)]\nbil=sorted(bil,key=lambda x:x[1]) # (6): bil=[(1, 2), (0, 3), (2, 4)]\nif not all([ail[i][1]<=bil[i][1] for i in range(n)]): # (7): NO CHANGE\n print('No')\n exit()\nif any([ail[i][0]==bil[i][0] for i in range(n)]): # (8): NO CHANGE\n print('Yes')\n exit()\nc=[(ail[i][0],bil[i][0]) for i in range(n)] # (9): c=[(0, 1), (2, 0), (1, 2)]\nc=sorted(c) # (10): c=[(0, 1), (1, 2), (2, 0)]\nidx=0 # (11): idx=0\nfor _ in range(n-2): # (12): _=0 (15): NO CHANGE\n idx=c[idx][1] # (13): idx=1\n if idx==0: # (14): NO CHANGE\n print('Yes')\n break\nelse:\n print('No')"], "anno_status": [true], "diff_content": " n=int(input())\n al=list(map(int,input().split()))\n bl=list(map(int,input().split()))\n ail=[(i,a) for i,a in enumerate(al)]\n bil=[(i,b) for i,b in enumerate(bl)]\n ail=sorted(ail,key=lambda x:x[1])\n bil=sorted(bil,key=lambda x:x[1])\n if not all([ail[i][1]<=bil[i][1] for i in range(n)]):\n print('No')\n exit()\n-if any([ail[i][0]==bil[i][0] for i in range(n)]):\n+if any([ail[i+1][1]<=bil[i][1] for i in range(n-1)]):\n print('Yes')\n exit()\n c=[(ail[i][0],bil[i][0]) for i in range(n)]\n c=sorted(c)\n idx=0\n-for _ in range(n-2):\n+for _ in range(n-1):\n idx=c[idx][1]\n if idx==0:\n print('Yes')\n break\n else:\n print('No')\n", "FL_content": " n=int(input())\n al=list(map(int,input().split()))\n bl=list(map(int,input().split()))\n ail=[(i,a) for i,a in enumerate(al)]\n bil=[(i,b) for i,b in enumerate(bl)]\n ail=sorted(ail,key=lambda x:x[1])\n bil=sorted(bil,key=lambda x:x[1])\n if not all([ail[i][1]<=bil[i][1] for i in range(n)]):\n print('No')\n exit()\n-if any([ail[i][0]==bil[i][0] for i in range(n)]):\n print('Yes')\n exit()\n c=[(ail[i][0],bil[i][0]) for i in range(n)]\n c=sorted(c)\n idx=0\n-for _ in range(n-2):\n idx=c[idx][1]\n if idx==0:\n print('Yes')\n break\n else:\n print('No')\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 23 }, { "user_id": "u634461820", "problem_id": "p02867", "submission1_id": "s520227232", "submission2_id": "s331828794", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport math\nMAX_INT = int(10e12)\nMIN_INT = -MAX_INT\nmod = 998244353\nsys.setrecursionlimit(1000000)\ndef IL(): return list(map(int,input().split()))\ndef SL(): return input().split()\ndef I(): return int(sys.stdin.readline())\ndef S(): return input()\n\ndef init(n):\n for i in range(N+1):\n par[i] = i\n rnk[i] = 0\ndef find(x):\n if par[x] == x:\n return x\n else:\n par[x] = find(par[x])\n return par[x]\ndef unite(x, y):\n x = find(x)\n y = find(y)\n if x == y:\n return\n if (rnk[x] < rnk[y]):\n par[x] = y\n else:\n par[y] = x\n if(rnk[x] == rnk[y]):\n rnk[x] += 1\ndef same(x, y):\n return find(x) == find(y)\n\nN = I()\na = IL()\nb = IL()\n\npar = [0 for i in range(N+1)]\nrnk = [0 for i in range(N+1)]\ninit(N)\n\nadata = []\nbdata = []\nfor i in range(N):\n adata.append([a[i], i])\n bdata.append([b[i], i])\nadata.sort()\nbdata.sort()\nprint(adata)\nprint(bdata)\n\nfor i in range(N-1):\n atmp, aID = adata[i]\n btmp, bID = bdata[i]\n atmp2, aID2 = adata[i + 1]\n btmp2, bID2 = bdata[i + 1]\n if atmp > btmp or atmp2 > btmp2:\n print(\"No\")\n exit()\n if atmp2 <= btmp:\n print(\"Yes\")\n exit()\n\nfor i in range(N-1):\n atmp, aID = adata[i]\n btmp, bID = bdata[i]\n \n \n \n if aID == bID:\n break\n if same(aID, bID):\n break\n else:\n unite(aID, bID)\nelse:\n print(\"No\")\n exit()\nprint(\"Yes\")", "code2": "import sys\nimport math\nMAX_INT = int(10e12)\nMIN_INT = -MAX_INT\nmod = 998244353\nsys.setrecursionlimit(1000000)\ndef IL(): return list(map(int,input().split()))\ndef SL(): return input().split()\ndef I(): return int(sys.stdin.readline())\ndef S(): return input()\n\ndef init(n):\n for i in range(N+1):\n par[i] = i\n rnk[i] = 0\ndef find(x):\n if par[x] == x:\n return x\n else:\n par[x] = find(par[x])\n return par[x]\ndef unite(x, y):\n x = find(x)\n y = find(y)\n if x == y:\n return\n if (rnk[x] < rnk[y]):\n par[x] = y\n else:\n par[y] = x\n if(rnk[x] == rnk[y]):\n rnk[x] += 1\ndef same(x, y):\n return find(x) == find(y)\n\nN = I()\na = IL()\nb = IL()\n\npar = [0 for i in range(N+1)]\nrnk = [0 for i in range(N+1)]\ninit(N)\n\nadata = []\nbdata = []\nfor i in range(N):\n adata.append([a[i], i])\n bdata.append([b[i], i])\nadata.sort()\nbdata.sort()\n\n\n\na.sort()\nb.sort()\nf = 0\nfor i in range(N-1):\n atmp = a[i]\n btmp = b[i]\n atmp2 = a[i + 1]\n btmp2 = b[i + 1]\n if atmp > btmp:\n print(\"No\")\n exit()\n if atmp2 > btmp2:\n print(\"No\")\n exit()\n if atmp2 <= btmp:\n f = 1\nelse:\n if f == 1:\n print(\"Yes\")\n exit()\n\nfor i in range(N-1):\n atmp, aID = adata[i]\n btmp, bID = bdata[i]\n \n \n \n if aID == bID:\n break\n if same(aID, bID):\n break\n else:\n unite(aID, bID)\nelse:\n print(\"No\")\n exit()\nprint(\"Yes\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1573359267", "date2": "1573361274", "bleu_score": "0.9338766114479815", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "3\n1 -3 2\n-1 14 8\n", "actual_output": "[[-3, 1], [1, 0], [2, 2]]\n[[-1, 0], [8, 2], [14, 1]]\nYes\n", "expected_output": "Yes\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " import sys\n import math\n MAX_INT = int(10e12)\n MIN_INT = -MAX_INT\n mod = 998244353\n sys.setrecursionlimit(1000000)\n def IL(): return list(map(int,input().split()))\n def SL(): return input().split()\n def I(): return int(sys.stdin.readline())\n def S(): return input()\n \n def init(n):\n for i in range(N+1):\n par[i] = i\n rnk[i] = 0\n def find(x):\n if par[x] == x:\n return x\n else:\n par[x] = find(par[x])\n return par[x]\n def unite(x, y):\n x = find(x)\n y = find(y)\n if x == y:\n return\n if (rnk[x] < rnk[y]):\n par[x] = y\n else:\n par[y] = x\n if(rnk[x] == rnk[y]):\n rnk[x] += 1\n def same(x, y):\n return find(x) == find(y)\n \n N = I()\n a = IL()\n b = IL()\n \n par = [0 for i in range(N+1)]\n rnk = [0 for i in range(N+1)]\n init(N)\n \n adata = []\n bdata = []\n for i in range(N):\n adata.append([a[i], i])\n bdata.append([b[i], i])\n adata.sort()\n bdata.sort()\n-print(adata)\n-print(bdata)\n \n+\n+\n+a.sort()\n+b.sort()\n+f = 0\n for i in range(N-1):\n- atmp, aID = adata[i]\n- btmp, bID = bdata[i]\n- atmp2, aID2 = adata[i + 1]\n- btmp2, bID2 = bdata[i + 1]\n- if atmp > btmp or atmp2 > btmp2:\n+ atmp = a[i]\n+ btmp = b[i]\n+ atmp2 = a[i + 1]\n+ btmp2 = b[i + 1]\n+ if atmp > btmp:\n+ print(\"No\")\n+ exit()\n+ if atmp2 > btmp2:\n print(\"No\")\n exit()\n if atmp2 <= btmp:\n+ f = 1\n+else:\n+ if f == 1:\n print(\"Yes\")\n exit()\n \n for i in range(N-1):\n atmp, aID = adata[i]\n btmp, bID = bdata[i]\n \n \n \n if aID == bID:\n break\n if same(aID, bID):\n break\n else:\n unite(aID, bID)\n else:\n print(\"No\")\n exit()\n print(\"Yes\")\n", "FL_content": " import sys\n import math\n MAX_INT = int(10e12)\n MIN_INT = -MAX_INT\n mod = 998244353\n sys.setrecursionlimit(1000000)\n def IL(): return list(map(int,input().split()))\n def SL(): return input().split()\n def I(): return int(sys.stdin.readline())\n def S(): return input()\n \n def init(n):\n for i in range(N+1):\n par[i] = i\n rnk[i] = 0\n def find(x):\n if par[x] == x:\n return x\n else:\n par[x] = find(par[x])\n return par[x]\n def unite(x, y):\n x = find(x)\n y = find(y)\n if x == y:\n return\n if (rnk[x] < rnk[y]):\n par[x] = y\n else:\n par[y] = x\n if(rnk[x] == rnk[y]):\n rnk[x] += 1\n def same(x, y):\n return find(x) == find(y)\n \n N = I()\n a = IL()\n b = IL()\n \n par = [0 for i in range(N+1)]\n rnk = [0 for i in range(N+1)]\n init(N)\n \n adata = []\n bdata = []\n for i in range(N):\n adata.append([a[i], i])\n bdata.append([b[i], i])\n adata.sort()\n bdata.sort()\n-print(adata)\n-print(bdata)\n \n for i in range(N-1):\n- atmp, aID = adata[i]\n- btmp, bID = bdata[i]\n- atmp2, aID2 = adata[i + 1]\n- btmp2, bID2 = bdata[i + 1]\n- if atmp > btmp or atmp2 > btmp2:\n print(\"No\")\n exit()\n if atmp2 <= btmp:\n print(\"Yes\")\n exit()\n \n for i in range(N-1):\n atmp, aID = adata[i]\n btmp, bID = bdata[i]\n \n \n \n if aID == bID:\n break\n if same(aID, bID):\n break\n else:\n unite(aID, bID)\n else:\n print(\"No\")\n exit()\n print(\"Yes\")\n", "added_lines": 16, "removed_lines": 7, "code1_lines": 81 }, { "user_id": "u197300773", "problem_id": "p02867", "submission1_id": "s086304308", "submission2_id": "s487742399", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nN=int(input())\n\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\naa=[[a[i],i] for i in range(N)]\nbb=[[b[i],i] for i in range(N)]\naa.sort()\nbb.sort()\n\n\nfor i in range(N):\n if aa[i][0]>bb[i][0]: print(\"No\"),sys.exit()\n\n\nfor i in range(N-1):\n if aa[i][0]==aa[i+1][0] or bb[i][0]==bb[i+1][0]: print(\"Yes\"),sys.exit()\n if bb[i][0]>=aa[i+1][0]: print(\"Yes\"),sys.exit()\n\n\ndicb={}\nfor i in range(N):\n dicb[bb[i][0]]=i\n\n\ntmp=1\nj=0\nprint(dicb)\n\nwhile tmpbb[i][0]:\n print(\"No\")\n sys.exit()\n\nfor i in range(N-1):\n if aa[i][0]==aa[i+1][0] or bb[i][0]==bb[i+1][0]:\n print(\"Yes\")\n sys.exit()\n\nfor i in range(1,N):\n if aa[i][0]<=bb[i-1][0]:\n print(\"Yes\")\n sys.exit()\n\n\ndic={}\nfor i in range(N):\n dic[aa[i][0]]=i\n\ninij=1\ncycle=1\nj=inij\n\nwhile True:\n j=dic[a[j]]\n if j==inij:\n break\n cycle+=1\n\nprint(\"Yes\" if cyclebb[i][0]: print(\"No\"),sys.exit()\n-\n+ if aa[i][0]>bb[i][0]:\n+ print(\"No\")\n+ sys.exit()\n \n for i in range(N-1):\n- if aa[i][0]==aa[i+1][0] or bb[i][0]==bb[i+1][0]: print(\"Yes\"),sys.exit()\n- if bb[i][0]>=aa[i+1][0]: print(\"Yes\"),sys.exit()\n+ if aa[i][0]==aa[i+1][0] or bb[i][0]==bb[i+1][0]:\n+ print(\"Yes\")\n+ sys.exit()\n+\n+for i in range(1,N):\n+ if aa[i][0]<=bb[i-1][0]:\n+ print(\"Yes\")\n+ sys.exit()\n \n \n-dicb={}\n+dic={}\n for i in range(N):\n- dicb[bb[i][0]]=i\n+ dic[aa[i][0]]=i\n \n+inij=1\n+cycle=1\n+j=inij\n \n-tmp=1\n-j=0\n-print(dicb)\n+while True:\n+ j=dic[a[j]]\n+ if j==inij:\n+ break\n+ cycle+=1\n \n-while tmpbb[i][0]: print(\"No\"),sys.exit()\n-\n \n for i in range(N-1):\n- if aa[i][0]==aa[i+1][0] or bb[i][0]==bb[i+1][0]: print(\"Yes\"),sys.exit()\n- if bb[i][0]>=aa[i+1][0]: print(\"Yes\"),sys.exit()\n \n \n-dicb={}\n for i in range(N):\n- dicb[bb[i][0]]=i\n \n \n-tmp=1\n-j=0\n-print(dicb)\n \n-while tmpB2[i]:\n print('No')\n exit()\n\nfor i in range(N-1):\n if B2[i]>=A2[i+1]:\n print('Yes')\n exit()\n\nprint('No')", "code2": "import sys\nimport math\nfrom collections import defaultdict\n\nsys.setrecursionlimit(10**7)\ndef input():\n return sys.stdin.readline()[:-1]\n\nmod = 10**9 + 7\n\ndef I(): return int(input())\ndef II(): return map(int, input().split())\ndef III(): return list(map(int, input().split()))\ndef Line(N,num):\n if N<=0:\n return [[]]*num\n elif num==1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return map(list, zip(*read_all))\n\n\n\nN = I()\nA = III()\nB = III()\n\ndef index_sort(A):\n a = []\n for i,x in enumerate(A):\n a.append([i,x])\n asort = sorted(a,key=lambda x: x[1])\n return [asort[i][0] for i in range(len(a))]\n\nA2 = sorted(A)\nB2 = sorted(B)\n\nfor i in range(N):\n if A2[i]>B2[i]:\n print('No')\n exit()\n\nAindex = index_sort(A)\nBindex = index_sort(B)\nmove = [0]*N\nfor i in range(N):\n move[Aindex[i]] = Bindex[i]\n\nnow = 0\nfor i in range(N):\n if move[now]==0 and i!=N-1:\n print('Yes')\n exit()\n now = move[now]\n\nfor i in range(N-1):\n if B2[i]>=A2[i+1]:\n print('Yes')\n exit()\n\nprint('No')", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1573359249", "date2": "1573361733", "bleu_score": "0.7609496628018064", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 102, "total_score": 103, "input": "3\n1 3 2\n1 2 3\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["import sys\nimport math\nfrom collections import defaultdict\n\nsys.setrecursionlimit(10**7) # (0): NO CHANGE\ndef input(): # (1): input=\n return sys.stdin.readline()[:-1]\n\nmod = 10**9 + 7 # (2): mod=1000000007, I=, II=, III=\n\ndef I(): return int(input())\ndef II(): return map(int, input().split())\ndef III(): return list(map(int, input().split()))\ndef Line(N,num): # (3): Line=\n if N<=0:\n return [[]]*num\n elif num==1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return map(list, zip(*read_all))\n\n\n\nN = I() # (4): N=3\nA = III() # (5): A=[1, 3, 2]\nB = III() # (6): B=[1, 2, 3], bisect_left=\n\nfrom bisect import bisect_left\n\n\n\ndef index_sort(A): # (7): index_sort=\n a = []\n for i,x in enumerate(A):\n a.append([i,x])\n return sorted(a,key=lambda x: x[1])\n\nA2 = sorted(A) # (8): A2=[1, 2, 3]\nB2 = sorted(B) # (9): B2=[1, 2, 3]\n\nfor i in range(N): # (10): i=0 (12): i=1 ... (16): NO CHANGE\n if A2[i]>B2[i]: # (11): NO CHANGE (13): NO CHANGE (15): NO CHANGE\n print('No')\n exit()\n\nfor i in range(N-1): # (17): i=0 (19): i=1 (21): NO CHANGE\n if B2[i]>=A2[i+1]: # (18): NO CHANGE (20): NO CHANGE\n print('Yes')\n exit()\n\nprint('No')"], "anno_status": [true], "diff_content": " import sys\n import math\n from collections import defaultdict\n \n sys.setrecursionlimit(10**7)\n def input():\n return sys.stdin.readline()[:-1]\n \n mod = 10**9 + 7\n \n def I(): return int(input())\n def II(): return map(int, input().split())\n def III(): return list(map(int, input().split()))\n def Line(N,num):\n if N<=0:\n return [[]]*num\n elif num==1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return map(list, zip(*read_all))\n \n \n \n N = I()\n A = III()\n B = III()\n \n-from bisect import bisect_left\n-\n-\n-\n def index_sort(A):\n a = []\n for i,x in enumerate(A):\n a.append([i,x])\n- return sorted(a,key=lambda x: x[1])\n+ asort = sorted(a,key=lambda x: x[1])\n+ return [asort[i][0] for i in range(len(a))]\n \n A2 = sorted(A)\n B2 = sorted(B)\n \n for i in range(N):\n if A2[i]>B2[i]:\n print('No')\n exit()\n \n+Aindex = index_sort(A)\n+Bindex = index_sort(B)\n+move = [0]*N\n+for i in range(N):\n+ move[Aindex[i]] = Bindex[i]\n+\n+now = 0\n+for i in range(N):\n+ if move[now]==0 and i!=N-1:\n+ print('Yes')\n+ exit()\n+ now = move[now]\n+\n for i in range(N-1):\n if B2[i]>=A2[i+1]:\n print('Yes')\n exit()\n \n print('No')\n", "FL_content": " import sys\n import math\n from collections import defaultdict\n \n sys.setrecursionlimit(10**7)\n def input():\n return sys.stdin.readline()[:-1]\n \n mod = 10**9 + 7\n \n def I(): return int(input())\n def II(): return map(int, input().split())\n def III(): return list(map(int, input().split()))\n def Line(N,num):\n if N<=0:\n return [[]]*num\n elif num==1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return map(list, zip(*read_all))\n \n \n \n N = I()\n A = III()\n B = III()\n \n-from bisect import bisect_left\n-\n-\n-\n def index_sort(A):\n a = []\n for i,x in enumerate(A):\n a.append([i,x])\n- return sorted(a,key=lambda x: x[1])\n \n A2 = sorted(A)\n B2 = sorted(B)\n \n for i in range(N):\n if A2[i]>B2[i]:\n print('No')\n exit()\n \n for i in range(N-1):\n if B2[i]>=A2[i+1]:\n print('Yes')\n exit()\n \n print('No')\n", "added_lines": 15, "removed_lines": 5, "code1_lines": 52 }, { "user_id": "u695811449", "problem_id": "p02867", "submission1_id": "s893635684", "submission2_id": "s239741982", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nN=int(input())\nA=list(map(int,input().split()))\nB=list(map(int,input().split()))\n\ncompression_dict={a: ind+1 for ind, a in enumerate(sorted(set(A)|set(B)))}\n\nSA=sorted(A)\nSB=sorted(B)\n\nfor i in range(N):\n if SA[i]>SB[i]:\n print(\"No\")\n sys.exit()\n\nfor i in range(N-1):\n if SB[i]>SA[i+1]:\n print(\"Yes\")\n sys.exit()\n\nAB=[(B[i],A[i]) for i in range(N)]\nAB.sort()\n\nDICT={a:ind for ind,a in enumerate(A)}\n\nGroup=[i for i in range(N)]\n\ndef find(x):\n while Group[x] != x:\n x=Group[x]\n return x\n\ndef Union(x,y): \n if find(x) != find(y):\n Group[find(y)]=Group[find(x)]=min(find(y),find(x))\n\nfor i in range(N):\n _,a=AB[i]\n\n Union(DICT[a],i)\n\nif len(set([find(i) for i in range(N)]))==1:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "code2": "import sys\ninput = sys.stdin.readline\n\nN=int(input())\nA=list(map(int,input().split()))\nB=list(map(int,input().split()))\n\ncompression_dict={a: ind+1 for ind, a in enumerate(sorted(set(A)|set(B)))}\n\nSA=sorted(A)\nSB=sorted(B)\n\nfor i in range(N):\n if SA[i]>SB[i]:\n print(\"No\")\n sys.exit()\n\nfor i in range(N-1):\n if SB[i]>=SA[i+1]:\n print(\"Yes\")\n sys.exit()\n\nAB=[(B[i],A[i]) for i in range(N)]\nAB.sort()\n\nDICT={a:ind for ind,a in enumerate(SA)}\n\nGroup=[i for i in range(N)]\n\ndef find(x):\n while Group[x] != x:\n x=Group[x]\n return x\n\ndef Union(x,y): \n if find(x) != find(y):\n Group[find(y)]=Group[find(x)]=min(find(y),find(x))\n\nfor i in range(N):\n _,a=AB[i]\n\n Union(DICT[a],i)\n\nif len(set([find(i) for i in range(N)]))==1:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1573369953", "date2": "1573370675", "bleu_score": "0.9938912164221279", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 100, "total_score": 103, "input": "3\n2 3 2\n5 2 3\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\nN=int(input()) # (1): N=3\nA=list(map(int,input().split())) # (2): A=[2, 3, 2]\nB=list(map(int,input().split())) # (3): B=[5, 2, 3]\n\ncompression_dict={a: ind+1 for ind, a in enumerate(sorted(set(A)|set(B)))} # (4): compression_dict={2: 1, 3: 2, 5: 3}\n\nSA=sorted(A) # (5): SA=[2, 2, 3]\nSB=sorted(B) # (6): SB=[2, 3, 5]\n\nfor i in range(N): # (7): i=0 (9): i=1 ... (13): NO CHANGE\n if SA[i]>SB[i]: # (8): NO CHANGE (10): NO CHANGE (12): NO CHANGE\n print(\"No\")\n sys.exit()\n\nfor i in range(N-1): # (14): i=0 (16): i=1 (18): NO CHANGE\n if SB[i]>SA[i+1]: # (15): NO CHANGE (17): NO CHANGE\n print(\"Yes\")\n sys.exit()\n\nAB=[(B[i],A[i]) for i in range(N)] # (19): AB=[(5, 2), (2, 3), (3, 2)]\nAB.sort() # (20): AB=[(2, 3), (3, 2), (5, 2)]\n\nDICT={a:ind for ind,a in enumerate(A)} # (21): DICT={2: 2, 3: 1}\n\nGroup=[i for i in range(N)] # (22): Group=[0, 1, 2]\n\ndef find(x): # (23): find=\n while Group[x] != x: # (29): x=0 (30): x=1, y=0 ... (71): sys=, input=, N=3, A=[2, 3, 2], B=[5, 2, 3], compression_dict={2: 1, 3: 2, 5: 3}, SA=[2, 2, 3], SB=[2, 3, 5], i=2, AB=[(2, 3), (3, 2), (5, 2)], DICT={2: 2, 3: 1}, Group=[0, 0, 0], find=, Union=, _=5, a=2\n x=Group[x] # (42): x=0 (46): x=0 ... (70): x=0\n return x\n\ndef Union(x,y): # (24): Union=\n if find(x) != find(y): # (28): NO CHANGE (39): NO CHANGE (56): NO CHANGE\n Group[find(y)]=Group[find(x)]=min(find(y),find(x)) # (31): x=0 (44): x=1\n\nfor i in range(N): # (25): i=0 (36): i=1 ... (63): NO CHANGE\n _,a=AB[i] # (26): _=2, a=3 (37): _=3, a=2 (54): _=5\n\n Union(DICT[a],i) # (27): x=1, y=0 (38): x=2, y=1 (55): x=2, y=2\n\nif len(set([find(i) for i in range(N)]))==1: # (64): x=0\n print(\"No\")\nelse:\n print(\"Yes\")\n"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n \n N=int(input())\n A=list(map(int,input().split()))\n B=list(map(int,input().split()))\n \n compression_dict={a: ind+1 for ind, a in enumerate(sorted(set(A)|set(B)))}\n \n SA=sorted(A)\n SB=sorted(B)\n \n for i in range(N):\n if SA[i]>SB[i]:\n print(\"No\")\n sys.exit()\n \n for i in range(N-1):\n- if SB[i]>SA[i+1]:\n+ if SB[i]>=SA[i+1]:\n print(\"Yes\")\n sys.exit()\n \n AB=[(B[i],A[i]) for i in range(N)]\n AB.sort()\n \n-DICT={a:ind for ind,a in enumerate(A)}\n+DICT={a:ind for ind,a in enumerate(SA)}\n \n Group=[i for i in range(N)]\n \n def find(x):\n while Group[x] != x:\n x=Group[x]\n return x\n \n def Union(x,y): \n if find(x) != find(y):\n Group[find(y)]=Group[find(x)]=min(find(y),find(x))\n \n for i in range(N):\n _,a=AB[i]\n \n Union(DICT[a],i)\n \n if len(set([find(i) for i in range(N)]))==1:\n print(\"No\")\n else:\n print(\"Yes\")\n \n", "FL_content": " import sys\n input = sys.stdin.readline\n \n N=int(input())\n A=list(map(int,input().split()))\n B=list(map(int,input().split()))\n \n compression_dict={a: ind+1 for ind, a in enumerate(sorted(set(A)|set(B)))}\n \n SA=sorted(A)\n SB=sorted(B)\n \n for i in range(N):\n if SA[i]>SB[i]:\n print(\"No\")\n sys.exit()\n \n for i in range(N-1):\n- if SB[i]>SA[i+1]:\n print(\"Yes\")\n sys.exit()\n \n AB=[(B[i],A[i]) for i in range(N)]\n AB.sort()\n \n-DICT={a:ind for ind,a in enumerate(A)}\n \n Group=[i for i in range(N)]\n \n def find(x):\n while Group[x] != x:\n x=Group[x]\n return x\n \n def Union(x,y): \n if find(x) != find(y):\n Group[find(y)]=Group[find(x)]=min(find(y),find(x))\n \n for i in range(N):\n _,a=AB[i]\n \n Union(DICT[a],i)\n \n if len(set([find(i) for i in range(N)]))==1:\n print(\"No\")\n else:\n print(\"Yes\")\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 48 }, { "user_id": "u754022296", "problem_id": "p02867", "submission1_id": "s604282560", "submission2_id": "s806074670", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nn = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = sorted(zip(B, A))\nB, A = zip(*C)\nD = sorted((a, i) for i, a in enumerate(A))\nfor i, (d, idx) in enumerate(D):\n if idx <= i and d <= B[idx]:\n s, t = i, idx\n break\nelse:\n print(\"No\")\n exit()\nA, indices = zip(*D)\nA = list(A)\nA[s], A[t] = A[t], A[s]\nfor a, b in zip(A, B):\n if a > b:\n print(\"No\")\n exit()\nprint(\"Yes\")", "code2": "import sys\ninput = sys.stdin.readline\n\nn = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = sorted(zip(B, A))\nB, A = zip(*C)\nD = sorted((a, i) for i, a in enumerate(A))\nE, indices = zip(*D)\nfor e, b in zip(E, B):\n if e > b:\n print(\"No\")\n exit()\nS = {0}\nnow = 0\nfor _ in range(n-1):\n if indices[now] in S:\n print(\"Yes\")\n exit()\n now = indices[now]\n S.add(now)\nfor i in range(n-1):\n if E[i+1] <= B[i]:\n print(\"Yes\")\n exit()\nprint(\"No\")", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1594067635", "date2": "1594075496", "bleu_score": "0.7354264518494363", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "3\n1 3 2\n3 2 3\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n \n n = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n C = sorted(zip(B, A))\n B, A = zip(*C)\n D = sorted((a, i) for i, a in enumerate(A))\n-for i, (d, idx) in enumerate(D):\n- if idx <= i and d <= B[idx]:\n- s, t = i, idx\n- break\n-else:\n- print(\"No\")\n- exit()\n-A, indices = zip(*D)\n-A = list(A)\n-A[s], A[t] = A[t], A[s]\n-for a, b in zip(A, B):\n- if a > b:\n+E, indices = zip(*D)\n+for e, b in zip(E, B):\n+ if e > b:\n print(\"No\")\n exit()\n-print(\"Yes\")\n+S = {0}\n+now = 0\n+for _ in range(n-1):\n+ if indices[now] in S:\n+ print(\"Yes\")\n+ exit()\n+ now = indices[now]\n+ S.add(now)\n+for i in range(n-1):\n+ if E[i+1] <= B[i]:\n+ print(\"Yes\")\n+ exit()\n+print(\"No\")\n", "FL_content": " import sys\n input = sys.stdin.readline\n \n n = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n C = sorted(zip(B, A))\n B, A = zip(*C)\n D = sorted((a, i) for i, a in enumerate(A))\n-for i, (d, idx) in enumerate(D):\n- if idx <= i and d <= B[idx]:\n- s, t = i, idx\n- break\n-else:\n- print(\"No\")\n- exit()\n-A, indices = zip(*D)\n-A = list(A)\n-A[s], A[t] = A[t], A[s]\n-for a, b in zip(A, B):\n- if a > b:\n print(\"No\")\n exit()\n-print(\"Yes\")\n", "added_lines": 16, "removed_lines": 13, "code1_lines": 24 }, { "user_id": "u864197622", "problem_id": "p02867", "submission1_id": "s785509879", "submission2_id": "s248086512", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = [int(a) for a in input().split()]\nB = [int(a) for a in input().split()]\n\nAA = sorted(A)\nBB = sorted(B)\n\nIA = {}\nIB = {}\nfor i in range(N):\n IA[A[i]] = i\n IB[B[i]] = i\n\nfor i in range(N):\n if AA[i] > BB[i]:\n print(\"No\")\n break\nelse:\n i = 0\n j = 0\n k = 0\n X = [0] * N\n Y = [0] * N\n for j in range(N):\n while i < N - 1 and AA[i+1] <= BB[j]:\n i += 1\n X[j] = i\n Y[j] = k\n if i == j: k = i + 1\n \n for i in range(N):\n if IA[AA[Y[i]]] <= IB[BB[i]] <= IA[AA[X[i]]]:\n print(\"Yes\")\n break\n else:\n print(\"No\")\n\n", "code2": "N = int(input())\nA = [int(a) for a in input().split()]\nB = [int(a) for a in input().split()]\nA = [(A[i]<<18) + i for i in range(N)]\nB = [(B[i]<<18) + i + (1<<17) for i in range(N)]\nAA = sorted(A)\nBB = sorted(B)\n\nIA = {}\nIB = {}\nfor i in range(N):\n IA[AA[i]] = i\n IB[BB[i]] = i\n\nfor i in range(N):\n if AA[i] > BB[i]:\n print(\"No\")\n break\nelse:\n for i in range(1, N):\n if AA[i] <= BB[i-1]:\n print(\"Yes\")\n break\n else:\n for i in range(N):\n if IA[A[i]] == IB[B[i]]:\n print(\"Yes\")\n break\n else:\n c = 1\n i = 0\n P = [-1] * N\n for i in range(N):\n P[IA[A[i]]] = IB[B[i]]\n i = P[0]\n while i != 0:\n i = P[i]\n c += 1\n if c < N:\n print(\"Yes\")\n else:\n print(\"No\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1573355063", "date2": "1573363457", "bleu_score": "0.6144837374766059", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 78, "total_score": 103, "input": "3\n0 -3 -1\n-1 18 5\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = [int(a) for a in input().split()] # (1): A=[0, -3, -1]\nB = [int(a) for a in input().split()] # (2): B=[-1, 18, 5]\n\nAA = sorted(A) # (3): AA=[-3, -1, 0]\nBB = sorted(B) # (4): BB=[-1, 5, 18]\n\nIA = {} # (5): IA={}\nIB = {} # (6): IB={}\nfor i in range(N): # (7): i=0 (10): i=1 ... (16): NO CHANGE\n IA[A[i]] = i # (8): IA={0: 0} (11): IA={0: 0, -3: 1} (14): IA={0: 0, -3: 1, -1: 2}\n IB[B[i]] = i # (9): IB={-1: 0} (12): IB={-1: 0, 18: 1} (15): IB={-1: 0, 18: 1, 5: 2}\n\nfor i in range(N): # (17): i=0 (19): i=1 ... (23): NO CHANGE\n if AA[i] > BB[i]: # (18): NO CHANGE (20): NO CHANGE (22): NO CHANGE\n print(\"No\")\n break\nelse:\n i = 0 # (24): i=0\n j = 0 # (25): j=0\n k = 0 # (26): k=0\n X = [0] * N # (27): X=[0, 0, 0]\n Y = [0] * N # (28): Y=[0, 0, 0]\n for j in range(N): # (29): NO CHANGE (36): j=1 ... (48): NO CHANGE\n while i < N - 1 and AA[i+1] <= BB[j]: # (30): NO CHANGE (32): NO CHANGE ... (44): NO CHANGE\n i += 1 # (31): i=1 (38): i=2\n X[j] = i # (33): X=[1, 0, 0] (40): X=[1, 2, 0] (45): X=[1, 2, 2]\n Y[j] = k # (34): NO CHANGE (41): NO CHANGE (46): NO CHANGE\n if i == j: k = i + 1 # (35): NO CHANGE (42): NO CHANGE (47): k=3\n \n for i in range(N): # (49): i=0 (51): i=1 ... (55): NO CHANGE\n if IA[AA[Y[i]]] <= IB[BB[i]] <= IA[AA[X[i]]]: # (50): NO CHANGE (52): NO CHANGE (54): NO CHANGE\n print(\"Yes\")\n break\n else:\n print(\"No\")\n\n"], "anno_status": [true], "diff_content": " N = int(input())\n A = [int(a) for a in input().split()]\n B = [int(a) for a in input().split()]\n-\n+A = [(A[i]<<18) + i for i in range(N)]\n+B = [(B[i]<<18) + i + (1<<17) for i in range(N)]\n AA = sorted(A)\n BB = sorted(B)\n \n IA = {}\n IB = {}\n for i in range(N):\n- IA[A[i]] = i\n- IB[B[i]] = i\n+ IA[AA[i]] = i\n+ IB[BB[i]] = i\n \n for i in range(N):\n if AA[i] > BB[i]:\n print(\"No\")\n break\n else:\n- i = 0\n- j = 0\n- k = 0\n- X = [0] * N\n- Y = [0] * N\n- for j in range(N):\n- while i < N - 1 and AA[i+1] <= BB[j]:\n- i += 1\n- X[j] = i\n- Y[j] = k\n- if i == j: k = i + 1\n- \n- for i in range(N):\n- if IA[AA[Y[i]]] <= IB[BB[i]] <= IA[AA[X[i]]]:\n+ for i in range(1, N):\n+ if AA[i] <= BB[i-1]:\n print(\"Yes\")\n break\n else:\n- print(\"No\")\n-\n-\n+ for i in range(N):\n+ if IA[A[i]] == IB[B[i]]:\n+ print(\"Yes\")\n+ break\n+ else:\n+ c = 1\n+ i = 0\n+ P = [-1] * N\n+ for i in range(N):\n+ P[IA[A[i]]] = IB[B[i]]\n+ i = P[0]\n+ while i != 0:\n+ i = P[i]\n+ c += 1\n+ if c < N:\n+ print(\"Yes\")\n+ else:\n+ print(\"No\")\n", "FL_content": " N = int(input())\n A = [int(a) for a in input().split()]\n B = [int(a) for a in input().split()]\n-\n AA = sorted(A)\n BB = sorted(B)\n \n IA = {}\n IB = {}\n for i in range(N):\n- IA[A[i]] = i\n- IB[B[i]] = i\n \n for i in range(N):\n if AA[i] > BB[i]:\n print(\"No\")\n break\n else:\n- i = 0\n- j = 0\n- k = 0\n- X = [0] * N\n- Y = [0] * N\n- for j in range(N):\n- while i < N - 1 and AA[i+1] <= BB[j]:\n- i += 1\n- X[j] = i\n- Y[j] = k\n- if i == j: k = i + 1\n- \n- for i in range(N):\n- if IA[AA[Y[i]]] <= IB[BB[i]] <= IA[AA[X[i]]]:\n print(\"Yes\")\n break\n else:\n- print(\"No\")\n-\n-\n", "added_lines": 24, "removed_lines": 20, "code1_lines": 38 }, { "user_id": "u537905693", "problem_id": "p02867", "submission1_id": "s302886937", "submission2_id": "s723600503", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nfrom collections import Counter\ndef ri():\n return int(input())\n\ndef rl():\n return list(input().split())\n\ndef rli():\n return list(map(int, input().split()))\n\ndef main():\n n = ri()\n la = rli()\n lb = rli()\n ll = []\n pb = []\n for i in range(n):\n ll.append([la[i], lb[i]])\n ll.sort()\n for i in range(n):\n pb.append([ll[i][1], i])\n pb.sort()\n pc = [0 for _ in range(n)]\n for i in range(n):\n pc[pb[i][1]] = i\n \n \n\n la.sort()\n lb.sort()\n for i in range(n):\n if la[i] > lb[i]:\n print(\"No\")\n return\n\n cnt = 0\n \n for i in range(n):\n j = pc[i]\n if i == j:\n continue\n while i != j:\n if ll[i][0] != ll[j][0] and ll[i][1] != ll[j][1]:\n cnt += 1\n ll[i][1], ll[j][1] = ll[j][1], ll[i][1]\n pc[i], pc[j] = pc[j], pc[i]\n \n j = pc[i]\n \n if cnt <= n-2:\n print(\"Yes\")\n else:\n print(\"No\")\n \n\n \n\n\nif __name__ == '__main__':\n main()\n", "code2": "\n\n\nfrom collections import Counter\ndef ri():\n return int(input())\n\ndef rl():\n return list(input().split())\n\ndef rli():\n return list(map(int, input().split()))\n\ndef main():\n n = ri()\n la = rli()\n lb = rli()\n lab = []\n for i in range(n):\n lab.append([la[i], lb[i]])\n\n la.sort()\n lb.sort()\n for i in range(n):\n if la[i] > lb[i]:\n print(\"No\")\n return\n\n \n lab.sort()\n \n for i in range(n):\n lab[i].append(i)\n \n lab.sort(key=lambda x: x[1])\n \n length = 1\n fr = 0\n to = lab[0][2]\n while to != 0:\n fr = to\n to = lab[fr][2]\n length += 1\n \n if length < n:\n print(\"Yes\")\n return\n\n \n for i in range(n-1):\n if lb[i] >= la[i+1]:\n print(\"Yes\")\n return\n \n \n print(\"No\")\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573355526", "date2": "1573436465", "bleu_score": "0.69873512123484", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 98, "total_score": 103, "input": "3\n1 -3 2\n-1 18 8\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["\n\n\nfrom collections import Counter\ndef ri(): # (0): ri=\n return int(input())\n\ndef rl(): # (1): rl=\n return list(input().split())\n\ndef rli(): # (2): rli=\n return list(map(int, input().split()))\n\ndef main(): # (3): main=\n n = ri()\n la = rli()\n lb = rli()\n ll = []\n pb = []\n for i in range(n):\n ll.append([la[i], lb[i]])\n ll.sort()\n for i in range(n):\n pb.append([ll[i][1], i])\n pb.sort()\n pc = [0 for _ in range(n)]\n for i in range(n):\n pc[pb[i][1]] = i\n \n \n\n la.sort()\n lb.sort()\n for i in range(n):\n if la[i] > lb[i]:\n print(\"No\")\n return\n\n cnt = 0\n \n for i in range(n):\n j = pc[i]\n if i == j:\n continue\n while i != j:\n if ll[i][0] != ll[j][0] and ll[i][1] != ll[j][1]:\n cnt += 1\n ll[i][1], ll[j][1] = ll[j][1], ll[i][1]\n pc[i], pc[j] = pc[j], pc[i]\n \n j = pc[i]\n \n if cnt <= n-2:\n print(\"Yes\")\n else:\n print(\"No\")\n \n\n \n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " \n \n \n from collections import Counter\n def ri():\n return int(input())\n \n def rl():\n return list(input().split())\n \n def rli():\n return list(map(int, input().split()))\n \n def main():\n n = ri()\n la = rli()\n lb = rli()\n- ll = []\n- pb = []\n+ lab = []\n for i in range(n):\n- ll.append([la[i], lb[i]])\n- ll.sort()\n- for i in range(n):\n- pb.append([ll[i][1], i])\n- pb.sort()\n- pc = [0 for _ in range(n)]\n- for i in range(n):\n- pc[pb[i][1]] = i\n- \n- \n+ lab.append([la[i], lb[i]])\n \n la.sort()\n lb.sort()\n for i in range(n):\n if la[i] > lb[i]:\n print(\"No\")\n return\n \n- cnt = 0\n+ \n+ lab.sort()\n \n for i in range(n):\n- j = pc[i]\n- if i == j:\n- continue\n- while i != j:\n- if ll[i][0] != ll[j][0] and ll[i][1] != ll[j][1]:\n- cnt += 1\n- ll[i][1], ll[j][1] = ll[j][1], ll[i][1]\n- pc[i], pc[j] = pc[j], pc[i]\n- \n- j = pc[i]\n+ lab[i].append(i)\n \n- if cnt <= n-2:\n- print(\"Yes\")\n- else:\n- print(\"No\")\n+ lab.sort(key=lambda x: x[1])\n \n+ length = 1\n+ fr = 0\n+ to = lab[0][2]\n+ while to != 0:\n+ fr = to\n+ to = lab[fr][2]\n+ length += 1\n+ \n+ if length < n:\n+ print(\"Yes\")\n+ return\n \n \n+ for i in range(n-1):\n+ if lb[i] >= la[i+1]:\n+ print(\"Yes\")\n+ return\n+ \n+ \n+ print(\"No\")\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " \n \n \n from collections import Counter\n def ri():\n return int(input())\n \n def rl():\n return list(input().split())\n \n def rli():\n return list(map(int, input().split()))\n \n def main():\n n = ri()\n la = rli()\n lb = rli()\n- ll = []\n- pb = []\n for i in range(n):\n- ll.append([la[i], lb[i]])\n- ll.sort()\n- for i in range(n):\n- pb.append([ll[i][1], i])\n- pb.sort()\n- pc = [0 for _ in range(n)]\n- for i in range(n):\n- pc[pb[i][1]] = i\n- \n- \n \n la.sort()\n lb.sort()\n for i in range(n):\n if la[i] > lb[i]:\n print(\"No\")\n return\n \n- cnt = 0\n \n for i in range(n):\n- j = pc[i]\n- if i == j:\n- continue\n- while i != j:\n- if ll[i][0] != ll[j][0] and ll[i][1] != ll[j][1]:\n- cnt += 1\n- ll[i][1], ll[j][1] = ll[j][1], ll[i][1]\n- pc[i], pc[j] = pc[j], pc[i]\n- \n- j = pc[i]\n \n- if cnt <= n-2:\n- print(\"Yes\")\n- else:\n- print(\"No\")\n \n \n \n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 24, "removed_lines": 27, "code1_lines": 64 }, { "user_id": "u639135641", "problem_id": "p02401", "submission1_id": "s093881439", "submission2_id": "s709707125", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nwhile True:\n a,op,b=map(str,input().split())\n if op==\"?\":\n break\n \n if op==\"+\":\n print(int(a)+int(b))\n elif op==\"-\":\n print(int(a)-int(b))\n elif op==\"*\":\n print(int(a)*int(b))\n elif op==\"/\":\n print(\"%.0f\" %(int(a)/int(b)))\n", "code2": "\n\nwhile True:\n a,op,b=map(str,input().split())\n if op==\"?\":\n break\n \n if op==\"+\":\n print(int(a)+int(b))\n elif op==\"-\":\n print(int(a)-int(b))\n elif op==\"*\":\n print(int(a)*int(b))\n elif op==\"/\":\n print((int(a)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1517015665", "date2": "1517015812", "bleu_score": "0.9304503966272267", "code1_test_status": [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 21, "total_score": 101, "input": "1 , 2\n56 - 18\n2 * 2\n100 / 7\n2 , 81\n-1 ? 0\n", "actual_output": "38\n4\n14\n", "expected_output": "(1, 2)\n38\n4\n14\n(2, 81)\n\n", "anno_code": ["\n\nwhile True: # (0): NO CHANGE (7): NO CHANGE ... (35): NO CHANGE\n a,op,b=map(str,input().split()) # (1): a=1, op=,, b=2 (8): a=56, op=-, b=18 ... (36): a=-1, op=?, b=0\n if op==\"?\": # (2): NO CHANGE (9): NO CHANGE ... (37): NO CHANGE\n break\n \n if op==\"+\": # (3): NO CHANGE (10): NO CHANGE ... (31): NO CHANGE\n print(int(a)+int(b))\n elif op==\"-\": # (4): NO CHANGE (11): NO CHANGE ... (32): NO CHANGE\n print(int(a)-int(b)) # (12): NO CHANGE\n elif op==\"*\": # (5): NO CHANGE (18): NO CHANGE ... (33): NO CHANGE\n print(int(a)*int(b)) # (19): NO CHANGE\n elif op==\"/\": # (6): NO CHANGE (26): NO CHANGE (34): NO CHANGE\n print(\"%.0f\" %(int(a)/int(b))) # (27): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n \n while True:\n a,op,b=map(str,input().split())\n if op==\"?\":\n break\n \n if op==\"+\":\n print(int(a)+int(b))\n elif op==\"-\":\n print(int(a)-int(b))\n elif op==\"*\":\n print(int(a)*int(b))\n elif op==\"/\":\n- print(\"%.0f\" %(int(a)/int(b)))\n+ print((int(a)\n \n", "FL_content": " \n \n while True:\n a,op,b=map(str,input().split())\n if op==\"?\":\n break\n \n if op==\"+\":\n print(int(a)+int(b))\n elif op==\"-\":\n print(int(a)-int(b))\n elif op==\"*\":\n print(int(a)*int(b))\n elif op==\"/\":\n- print(\"%.0f\" %(int(a)/int(b)))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u566311709", "problem_id": "p02401", "submission1_id": "s245542691", "submission2_id": "s319812853", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n a, op, b = map(str, input().split())\n a = int(a)\n b = int(b)\n if op == \"+\":\n print(a + b)\n elif op == \"-\":\n print(a - b)\n elif op == \"*\":\n print(a * b)\n elif op == \"/\":\n print(a / b)\n elif op == \"?\":\n break\n else:\n break\n", "code2": "while True:\n a, op, b = map(str, input().split())\n a = int(a)\n b = int(b)\n if op == \"+\":\n print(a + b)\n elif op == \"-\":\n print(a - b)\n elif op == \"*\":\n print(a * b)\n elif op == \"/\":\n print(a \n elif op == \"?\":\n break\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1521459547", "date2": "1521460008", "bleu_score": "0.906268338934968", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "1 , 2\n56 - 18\n21 * 2\n100 / 7\n1 , 81\n-1 ? 0\n", "actual_output": "", "expected_output": "(1, 2)\n38\n42\n14\n(1, 81)\n\n", "anno_code": ["while True: # (0): NO CHANGE\n a, op, b = map(str, input().split()) # (1): a=1, op=,, b=2\n a = int(a) # (2): a=1\n b = int(b) # (3): b=2\n if op == \"+\": # (4): NO CHANGE\n print(a + b)\n elif op == \"-\": # (5): NO CHANGE\n print(a - b)\n elif op == \"*\": # (6): NO CHANGE\n print(a * b)\n elif op == \"/\": # (7): NO CHANGE\n print(a / b)\n elif op == \"?\": # (8): NO CHANGE\n break\n else:\n break\n"], "anno_status": [true], "diff_content": " while True:\n a, op, b = map(str, input().split())\n a = int(a)\n b = int(b)\n if op == \"+\":\n print(a + b)\n elif op == \"-\":\n print(a - b)\n elif op == \"*\":\n print(a * b)\n elif op == \"/\":\n- print(a / b)\n+ print(a \n elif op == \"?\":\n break\n- else:\n- break\n \n", "FL_content": " while True:\n a, op, b = map(str, input().split())\n a = int(a)\n b = int(b)\n if op == \"+\":\n print(a + b)\n elif op == \"-\":\n print(a - b)\n elif op == \"*\":\n print(a * b)\n elif op == \"/\":\n- print(a / b)\n elif op == \"?\":\n break\n- else:\n- break\n \n", "added_lines": 1, "removed_lines": 3, "code1_lines": 17 }, { "user_id": "u244493040", "problem_id": "p02401", "submission1_id": "s728019363", "submission2_id": "s340905709", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while 1:\n a,o,b = input().split()\n if o=='?': break\n a,b = map(int,(a,b))\n print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a/b)\n", "code2": "while 1:\n a,o,b = input().split()\n if o=='?': break\n a,b = map(int,(a,b))\n print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1523639534", "date2": "1523639695", "bleu_score": "0.9742046492478209", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "1 + 2\n56 - 18\n13 * 0\n100 / 10\n27 , 81\n-1 ? 0\n", "actual_output": "3\n38\n0\n10.0\n0.3333333333333333\n", "expected_output": "3\n38\n0\n10\n(27, 81)\n\n", "anno_code": ["while 1: # (0): NO CHANGE (5): NO CHANGE ... (25): NO CHANGE\n a,o,b = input().split() # (1): a=1, o=+, b=2 (6): a=56, o=-, b=18 ... (26): a=-1, o=?, b=0\n if o=='?': break # (2): NO CHANGE (7): NO CHANGE ... (22): NO CHANGE\n a,b = map(int,(a,b)) # (3): a=1, b=2 (8): a=56, b=18 ... (23): a=27, b=81\n print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a/b) # (4): NO CHANGE (9): NO CHANGE ... (24): NO CHANGE\n"], "anno_status": [true], "diff_content": " while 1:\n a,o,b = input().split()\n if o=='?': break\n a,b = map(int,(a,b))\n- print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a/b)\n+ print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a\n \n", "FL_content": " while 1:\n a,o,b = input().split()\n if o=='?': break\n a,b = map(int,(a,b))\n- print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a/b)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u369313788", "problem_id": "p02401", "submission1_id": "s637432820", "submission2_id": "s452831712", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n a, op, b = input().split()\n a = int(a)\n b = int(b)\n if op == '?':\n break\n if op == '+':\n print(a+b)\n if op == '-':\n print(a-b)\n if op == '*':\n print(a*b)\n if op == '/':\n print(a/b)", "code2": "while True:\n a, op, b = input().split()\n a = int(a)\n b = int(b)\n if op == '?':\n break\n if op == '+':\n print(a+b)\n if op == '-':\n print(a-b)\n if op == '*':\n print(a*b)\n if op == '/':\n print(a", "original_language1": "Python3", "original_language2": "Python3", "date1": "1469601093", "date2": "1469601152", "bleu_score": "0.9880240960954589", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "1 + 2\n56 - 18\n13 * 2\n100 / 10\n27 , 81\n-1 ? 0\n", "actual_output": "3\n38\n26\n10.0\n", "expected_output": "3\n38\n26\n10\n(27, 81)\n\n", "anno_code": ["while True: # (0): NO CHANGE (10): NO CHANGE ... (49): NO CHANGE\n a, op, b = input().split() # (1): a=1, op=+, b=2 (11): a=56, op=-, b=18 ... (50): a=-1, op=?, b=0\n a = int(a) # (2): a=1 (12): a=56 ... (51): a=-1\n b = int(b) # (3): b=2 (13): b=18 ... (52): b=0\n if op == '?': # (4): NO CHANGE (14): NO CHANGE ... (53): NO CHANGE\n break\n if op == '+': # (5): NO CHANGE (15): NO CHANGE ... (45): NO CHANGE\n print(a+b) # (6): NO CHANGE\n if op == '-': # (7): NO CHANGE (16): NO CHANGE ... (46): NO CHANGE\n print(a-b) # (17): NO CHANGE\n if op == '*': # (8): NO CHANGE (18): NO CHANGE ... (47): NO CHANGE\n print(a*b) # (28): NO CHANGE\n if op == '/': # (9): NO CHANGE (19): NO CHANGE ... (48): NO CHANGE\n print(a/b) # (39): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n a, op, b = input().split()\n a = int(a)\n b = int(b)\n if op == '?':\n break\n if op == '+':\n print(a+b)\n if op == '-':\n print(a-b)\n if op == '*':\n print(a*b)\n if op == '/':\n- print(a/b)\n+ print(a\n", "FL_content": " while True:\n a, op, b = input().split()\n a = int(a)\n b = int(b)\n if op == '?':\n break\n if op == '+':\n print(a+b)\n if op == '-':\n print(a-b)\n if op == '*':\n print(a*b)\n if op == '/':\n- print(a/b)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 14 }, { "user_id": "u244493040", "problem_id": "p02401", "submission1_id": "s816769603", "submission2_id": "s340905709", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,o,b = input().split()\na,b = map(int,(a,b))\nprint(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a/b)\n", "code2": "while 1:\n a,o,b = input().split()\n if o=='?': break\n a,b = map(int,(a,b))\n print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1523639419", "date2": "1523639695", "bleu_score": "0.7363173272308701", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "1 + 2\n56 - 18\n21 * 4\n100 / 10\n1 , 81\n-1 ? -1\n", "actual_output": "3\n", "expected_output": "3\n38\n84\n10\n(1, 81)\n\n", "anno_code": ["a,o,b = input().split() # (0): a=1, o=+, b=2\na,b = map(int,(a,b)) # (1): a=1, b=2\nprint(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a/b)\n"], "anno_status": [true], "diff_content": "-a,o,b = input().split()\n-a,b = map(int,(a,b))\n-print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a/b)\n+while 1:\n+ a,o,b = input().split()\n+ if o=='?': break\n+ a,b = map(int,(a,b))\n+ print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a\n \n", "FL_content": "-a,o,b = input().split()\n-a,b = map(int,(a,b))\n-print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a/b)\n \n", "added_lines": 5, "removed_lines": 3, "code1_lines": 4 }, { "user_id": "u344890307", "problem_id": "p02401", "submission1_id": "s441015998", "submission2_id": "s901705488", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n a,op,b=input().split()\n a=int(a)\n b=int(b)\n if op == \"+\":\n print(a+b)\n elif op ==\"-\":\n print(a-b)\n elif op ==\"*\":\n print(a*b)\n elif op ==\"/\":\n print(a/float(b))\n elif a==\"?\" or b==\"?\" or op==\"?\":\n break\n", "code2": "while True:\n a,op,b = input().split()\n a=int(a)\n op=str(op)\n b=int(b)\n \n if op=='?':\n break\n elif op=='+':\n print(\"{:d}\".format(a+b))\n elif op=='-':\n print(\"{:d}\".format(a-b))\n elif op=='/':\n print(\"{:d}\".format(a\n elif op==\"*\":\n print(\"{:d}\".format(a*b))\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556520050", "date2": "1556677828", "bleu_score": "0.6402887031953736", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "1 + 2\n56 - 18\n21 * 3\n100 / 10\n31 , 81\n-1 ? -1\n", "actual_output": "3\n38\n63\n10.0\n", "expected_output": "3\n38\n63\n10\n(31, 81)\n\n", "anno_code": ["while True: # (0): NO CHANGE (6): NO CHANGE ... (39): NO CHANGE\n a,op,b=input().split() # (1): a=1, op=+, b=2 (7): a=56, op=-, b=18 ... (40): a=-1, op=?, b=-1\n a=int(a) # (2): a=1 (8): a=56 ... (41): a=-1\n b=int(b) # (3): b=2 (9): b=18 ... (42): b=-1\n if op == \"+\": # (4): NO CHANGE (10): NO CHANGE ... (43): NO CHANGE\n print(a+b) # (5): NO CHANGE\n elif op ==\"-\": # (11): NO CHANGE (18): NO CHANGE ... (44): NO CHANGE\n print(a-b) # (12): NO CHANGE\n elif op ==\"*\": # (19): NO CHANGE (27): NO CHANGE ... (45): NO CHANGE\n print(a*b) # (20): NO CHANGE\n elif op ==\"/\": # (28): NO CHANGE (37): NO CHANGE (46): NO CHANGE\n print(a/float(b)) # (29): NO CHANGE\n elif a==\"?\" or b==\"?\" or op==\"?\": # (38): NO CHANGE (47): NO CHANGE\n break\n"], "anno_status": [true], "diff_content": " while True:\n- a,op,b=input().split()\n- a=int(a)\n- b=int(b)\n- if op == \"+\":\n- print(a+b)\n- elif op ==\"-\":\n- print(a-b)\n- elif op ==\"*\":\n- print(a*b)\n- elif op ==\"/\":\n- print(a/float(b))\n- elif a==\"?\" or b==\"?\" or op==\"?\":\n- break\n+ a,op,b = input().split()\n+ a=int(a)\n+ op=str(op)\n+ b=int(b)\n+ \n+ if op=='?':\n+ break\n+ elif op=='+':\n+ print(\"{:d}\".format(a+b))\n+ elif op=='-':\n+ print(\"{:d}\".format(a-b))\n+ elif op=='/':\n+ print(\"{:d}\".format(a\n+ elif op==\"*\":\n+ print(\"{:d}\".format(a*b))\n \n", "FL_content": " while True:\n- a,op,b=input().split()\n- a=int(a)\n- b=int(b)\n- if op == \"+\":\n- print(a+b)\n- elif op ==\"-\":\n- print(a-b)\n- elif op ==\"*\":\n- print(a*b)\n- elif op ==\"/\":\n- print(a/float(b))\n- elif a==\"?\" or b==\"?\" or op==\"?\":\n- break\n \n", "added_lines": 15, "removed_lines": 13, "code1_lines": 15 }, { "user_id": "u350064373", "problem_id": "p02401", "submission1_id": "s365115423", "submission2_id": "s646817287", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n a, op, b = map(str, input().split())\n if op == \"+\":\n print(int(a) + int(b))\n elif op == \"-\":\n print(int(a) - int(b))\n elif op == \"*\":\n print(int(a) * int(b))\n elif op == \"/\":\n print(int(a) / int(b))\n else:\n break", "code2": "while True:\n a, op, b = map(str, input(\"\").split())\n a = int(a)\n b = int(b)\n if op == \"+\":\n print(a + b)\n elif op == \"-\":\n print(a - b)\n elif op == \"*\":\n print(a * b)\n elif op == \"/\":\n print(a \n elif op == \"?\":\n break", "original_language1": "Python3", "original_language2": "Python3", "date1": "1500472379", "date2": "1500473114", "bleu_score": "0.8138148717498641", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "1 , 2\n56 - 18\n2 * 2\n100 / 7\n1 , 81\n-1 ? 0\n", "actual_output": "", "expected_output": "(1, 2)\n38\n4\n14\n(1, 81)\n\n", "anno_code": ["while True: # (0): NO CHANGE\n a, op, b = map(str, input().split()) # (1): a=1, op=,, b=2\n if op == \"+\": # (2): NO CHANGE\n print(int(a) + int(b))\n elif op == \"-\": # (3): NO CHANGE\n print(int(a) - int(b))\n elif op == \"*\": # (4): NO CHANGE\n print(int(a) * int(b))\n elif op == \"/\": # (5): NO CHANGE\n print(int(a) / int(b))\n else:\n break"], "anno_status": [true], "diff_content": " while True:\n- a, op, b = map(str, input().split())\n+ a, op, b = map(str, input(\"\").split())\n+ a = int(a)\n+ b = int(b)\n if op == \"+\":\n- print(int(a) + int(b))\n+ print(a + b)\n elif op == \"-\":\n- print(int(a) - int(b))\n+ print(a - b)\n elif op == \"*\":\n- print(int(a) * int(b))\n+ print(a * b)\n elif op == \"/\":\n- print(int(a) / int(b))\n- else:\n+ print(a \n+ elif op == \"?\":\n break\n", "FL_content": " while True:\n- a, op, b = map(str, input().split())\n if op == \"+\":\n- print(int(a) + int(b))\n elif op == \"-\":\n- print(int(a) - int(b))\n elif op == \"*\":\n- print(int(a) * int(b))\n elif op == \"/\":\n- print(int(a) / int(b))\n- else:\n break\n", "added_lines": 8, "removed_lines": 6, "code1_lines": 12 }, { "user_id": "u757827098", "problem_id": "p02401", "submission1_id": "s034053733", "submission2_id": "s016587724", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n a,op,b = input().split()\n a =int(a)\n b =int(b)\n \n if op == '?':\n break\n \n if op == '+':\n print(a+b)\n\n if op == '-':\n print(a-b)\n\n if op == '*':\n print(a*b)\n \n if op == '/':\n print(a/b)", "code2": "while True:\n a,op,b = input().split()\n a =int(a)\n b =int(b)\n \n if op == '?':\n break\n \n if op == '+':\n print(a+b)\n\n if op == '-':\n print(a-b)\n\n if op == '*':\n print(a*b)\n \n if op == '/':\n print(a", "original_language1": "Python3", "original_language2": "Python3", "date1": "1469601167", "date2": "1469601228", "bleu_score": "0.9885278512147743", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "2 + 2\n25 , 18\n10 * 1\n000 / 22\n28 - 6\n0 ? 0\n", "actual_output": "4\n10\n0.0\n22\n", "expected_output": "4\n(25, 18)\n10\n0\n22\n\n", "anno_code": ["while True: # (0): NO CHANGE (10): NO CHANGE ... (49): NO CHANGE\n a,op,b = input().split() # (1): a=2, op=+, b=2 (11): a=25, op=,, b=18 ... (50): a=0, op=?, b=0\n a =int(a) # (2): a=2 (12): a=25 ... (51): a=0\n b =int(b) # (3): b=2 (13): b=18 ... (52): b=0\n \n if op == '?': # (4): NO CHANGE (14): NO CHANGE ... (53): NO CHANGE\n break\n \n if op == '+': # (5): NO CHANGE (15): NO CHANGE ... (44): NO CHANGE\n print(a+b) # (6): NO CHANGE\n\n if op == '-': # (7): NO CHANGE (16): NO CHANGE ... (45): NO CHANGE\n print(a-b) # (46): NO CHANGE\n\n if op == '*': # (8): NO CHANGE (17): NO CHANGE ... (47): NO CHANGE\n print(a*b) # (27): NO CHANGE\n \n if op == '/': # (9): NO CHANGE (18): NO CHANGE ... (48): NO CHANGE\n print(a/b) # (38): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n a,op,b = input().split()\n a =int(a)\n b =int(b)\n \n if op == '?':\n break\n \n if op == '+':\n print(a+b)\n \n if op == '-':\n print(a-b)\n \n if op == '*':\n print(a*b)\n \n if op == '/':\n- print(a/b)\n+ print(a\n", "FL_content": " while True:\n a,op,b = input().split()\n a =int(a)\n b =int(b)\n \n if op == '?':\n break\n \n if op == '+':\n print(a+b)\n \n if op == '-':\n print(a-b)\n \n if op == '*':\n print(a*b)\n \n if op == '/':\n- print(a/b)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 19 }, { "user_id": "u092736322", "problem_id": "p02401", "submission1_id": "s711609258", "submission2_id": "s216401178", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while 1:\n k=input().split()\n k[0]=int(k[0])\n k[2]=int(k[2])\n \n if k[1]==\"?\":\n break\n elif k[1]==\"+\":\n print(k[0]+k[2])\n elif k[1]==\"-\":\n print(k[0]-k[2])\n elif k[1]==\"*\":\n print(k[0]*k[2])\n elif k[1]==\"/\":\n print(k[0]/k[2])\n\n", "code2": "while 1:\n k=input().split()\n k[0]=int(k[0])\n k[2]=int(k[2])\n \n if k[1]==\"?\":\n break\n elif k[1]==\"+\":\n print(k[0]+k[2])\n elif k[1]==\"-\":\n print(k[0]-k[2])\n elif k[1]==\"*\":\n print(k[0]*k[2])\n elif k[1]==\"/\":\n print(k[0]\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1528762582", "date2": "1528762648", "bleu_score": "0.974480861620321", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "4 , 4\n25 , 18\n10 * 2\n000 / 29\n28 , 81\n0 ? 0\n", "actual_output": "20\n0.0\n", "expected_output": "(4, 4)\n(25, 18)\n20\n0\n(28, 81)\n\n", "anno_code": ["while 1: # (0): NO CHANGE (9): NO CHANGE ... (46): NO CHANGE\n k=input().split() # (1): k=['4', ',', '4'] (10): k=['25', ',', '18'] ... (47): k=['0', '?', '0']\n k[0]=int(k[0]) # (2): NO CHANGE (11): NO CHANGE ... (48): NO CHANGE\n k[2]=int(k[2]) # (3): NO CHANGE (12): NO CHANGE ... (49): NO CHANGE\n \n if k[1]==\"?\": # (4): NO CHANGE (13): NO CHANGE ... (50): NO CHANGE\n break\n elif k[1]==\"+\": # (5): NO CHANGE (14): NO CHANGE ... (42): NO CHANGE\n print(k[0]+k[2])\n elif k[1]==\"-\": # (6): NO CHANGE (15): NO CHANGE ... (43): NO CHANGE\n print(k[0]-k[2])\n elif k[1]==\"*\": # (7): NO CHANGE (16): NO CHANGE ... (44): NO CHANGE\n print(k[0]*k[2]) # (26): NO CHANGE\n elif k[1]==\"/\": # (8): NO CHANGE (17): NO CHANGE ... (45): NO CHANGE\n print(k[0]/k[2]) # (36): NO CHANGE\n\n"], "anno_status": [true], "diff_content": " while 1:\n k=input().split()\n k[0]=int(k[0])\n k[2]=int(k[2])\n \n if k[1]==\"?\":\n break\n elif k[1]==\"+\":\n print(k[0]+k[2])\n elif k[1]==\"-\":\n print(k[0]-k[2])\n elif k[1]==\"*\":\n print(k[0]*k[2])\n elif k[1]==\"/\":\n- print(k[0]/k[2])\n+ print(k[0]\n \n \n", "FL_content": " while 1:\n k=input().split()\n k[0]=int(k[0])\n k[2]=int(k[2])\n \n if k[1]==\"?\":\n break\n elif k[1]==\"+\":\n print(k[0]+k[2])\n elif k[1]==\"-\":\n print(k[0]-k[2])\n elif k[1]==\"*\":\n print(k[0]*k[2])\n elif k[1]==\"/\":\n- print(k[0]/k[2])\n \n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 17 }, { "user_id": "u485986915", "problem_id": "p02401", "submission1_id": "s117622120", "submission2_id": "s375369262", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n a,op,b = input().split()\n A = int(a)\n B = int(b)\n\n if op == '?': break\n elif op == '+':\n print(A+B)\n elif op == '-':\n print(A-B)\n elif op == '*':\n print(A*B)\n elif op == '/':\n print(A/B)\n \n", "code2": "while True:\n a,op,b = input().split()\n\n A = int(a)\n B = int(b)\n\n if op == '?': break\n elif op == '+':\n print(A+B)\n elif op == '-':\n print(A-B)\n elif op == '*':\n print(A*B)\n elif op == '/':\n print(A\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1524475791", "date2": "1524475987", "bleu_score": "0.9482467771190035", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "1 , 4\n25 - 18\n10 * 2\n001 / 29\n28 , 81\n0 ? 0\n", "actual_output": "7\n20\n0.034482758620689655\n", "expected_output": "(1, 4)\n7\n20\n0\n(28, 81)\n\n", "anno_code": ["while True: # (0): NO CHANGE (9): NO CHANGE ... (45): NO CHANGE\n a,op,b = input().split() # (1): a=1, op=,, b=4 (10): a=25, op=-, b=18 ... (46): a=0, op=?, b=0\n A = int(a) # (2): A=1 (11): A=25 ... (47): A=0\n B = int(b) # (3): B=4 (12): B=18 ... (48): B=0\n\n if op == '?': break # (4): NO CHANGE (13): NO CHANGE ... (40): NO CHANGE\n elif op == '+': # (5): NO CHANGE (14): NO CHANGE ... (41): NO CHANGE\n print(A+B)\n elif op == '-': # (6): NO CHANGE (15): NO CHANGE ... (42): NO CHANGE\n print(A-B) # (16): NO CHANGE\n elif op == '*': # (7): NO CHANGE (24): NO CHANGE ... (43): NO CHANGE\n print(A*B) # (25): NO CHANGE\n elif op == '/': # (8): NO CHANGE (34): NO CHANGE (44): NO CHANGE\n print(A/B) # (35): NO CHANGE\n \n"], "anno_status": [true], "diff_content": " while True:\n a,op,b = input().split()\n+\n A = int(a)\n B = int(b)\n \n if op == '?': break\n elif op == '+':\n print(A+B)\n elif op == '-':\n print(A-B)\n elif op == '*':\n print(A*B)\n elif op == '/':\n- print(A/B)\n- \n+ print(A\n \n", "FL_content": " while True:\n a,op,b = input().split()\n A = int(a)\n B = int(b)\n \n if op == '?': break\n elif op == '+':\n print(A+B)\n elif op == '-':\n print(A-B)\n elif op == '*':\n print(A*B)\n elif op == '/':\n- print(A/B)\n- \n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 16 }, { "user_id": "u078042885", "problem_id": "p00602", "submission1_id": "s199270374", "submission2_id": "s566444461", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while 1:\n try:\n v,d=map(int,input().split())\n f=[0]*(v+1)\n f[0],f[1]=1,2\n for i in range(2,v+1):\n f[i]=f[i-1]+f[i-2]\n f.sort()\n c=1\n for i in range(2,v+1):\n if f[i]-f[i-1]>=d: c+=1\n print(c)\n except:break", "code2": "while 1:\n try:\n v,d=map(int,input().split())\n f=[0]*(v+1)\n f[0],f[1]=1,2\n for i in range(2,v+1):\n f[i]=(f[i-1]+f[i-2])%1001\n f.sort()\n c=1\n for i in range(2,v+1):\n if f[i]-f[i-1]>=d: c+=1\n print(c)\n except:break", "original_language1": "Python3", "original_language2": "Python3", "date1": "1483426603", "date2": "1483426738", "bleu_score": "0.9658678499227835", "code1_test_status": [0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1], "code1_test_score": 18, "total_score": 101, "input": "20 2\n30 2\n22 25\n", "actual_output": "19\n29\n15\n", "expected_output": "19\n29\n12\n\n", "anno_code": ["while 1: # (0): NO CHANGE (86): NO CHANGE ... (306): NO CHANGE\n try: # (1): NO CHANGE (87): NO CHANGE ... (307): NO CHANGE\n v,d=map(int,input().split()) # (2): v=20, d=2 (88): v=30 ... (308): NO CHANGE\n f=[0]*(v+1) # (3): f=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (89): f=[0, 0, ..., 0, 0] (215): f=[0, 0, ..., 0, 0]\n f[0],f[1]=1,2 # (4): f=[1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (90): f=[1, 2, ..., 0, 0] (216): f=[1, 2, ..., 0, 0]\n for i in range(2,v+1): # (5): i=2 (7): i=3 ... (259): NO CHANGE\n f[i]=f[i-1]+f[i-2] # (6): f=[1, 2, ..., 0, 0] (8): f=[1, 2, ..., 0, 0] ... (258): f=[1, 2, ..., 28657, 46368]\n f.sort() # (44): NO CHANGE (150): NO CHANGE (260): NO CHANGE\n c=1 # (45): c=1 (151): c=1 (261): c=1\n for i in range(2,v+1): # (46): i=2 (48): i=3 ... (304): NO CHANGE\n if f[i]-f[i-1]>=d: c+=1 # (47): NO CHANGE (49): c=2 ... (303): c=15\n print(c) # (85): NO CHANGE (211): NO CHANGE (305): NO CHANGE\n except:break"], "anno_status": [true], "diff_content": " while 1:\n try:\n v,d=map(int,input().split())\n f=[0]*(v+1)\n f[0],f[1]=1,2\n for i in range(2,v+1):\n- f[i]=f[i-1]+f[i-2]\n+ f[i]=(f[i-1]+f[i-2])%1001\n f.sort()\n c=1\n for i in range(2,v+1):\n if f[i]-f[i-1]>=d: c+=1\n print(c)\n except:break\n", "FL_content": " while 1:\n try:\n v,d=map(int,input().split())\n f=[0]*(v+1)\n f[0],f[1]=1,2\n for i in range(2,v+1):\n- f[i]=f[i-1]+f[i-2]\n f.sort()\n c=1\n for i in range(2,v+1):\n if f[i]-f[i-1]>=d: c+=1\n print(c)\n except:break\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u815878613", "problem_id": "p03838", "submission1_id": "s666302493", "submission2_id": "s679951252", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y = map(int, input().split())\n\nif x >= 0:\n sgnx = 1\nelse:\n sgnx = -1\n\nif y >= 0:\n sgny = 1\nelse:\n sgny = -1\n\nif abs(x) > abs(y):\n if sgnx == 1 and sgny == 1:\n ans = 1 + y + x\n if sgnx == -1 and sgny == -1:\n ans = abs(x) - abs(y)\n elif sgnx == -1 and sgny == 1:\n ans = 1 + abs(x) - abs(y)\n elif sgnx == 1 and sgny == -1:\n ans = 1 + abs(x) - abs(y)\n\nelif abs(x) < abs(y):\n if sgnx == 1 and sgny == 1:\n ans = y - x\n if sgnx == -1 and sgny == -1:\n ans = 2 + abs(y) - abs(x)\n elif sgnx == -1 and sgny == 1:\n ans = 1 + abs(y) - abs(x)\n elif sgnx == 1 and sgny == -1:\n ans = 1 + abs(y) - abs(x)\n\nelse:\n if sgnx == sgny:\n ans = 0\n if sgnx != sgny:\n ans = 1\n\nprint(ans)\n", "code2": "x, y = map(int, input().split())\n\nif x >= 0:\n sgnx = 1\nelse:\n sgnx = -1\n\nif y > 0:\n sgny = 1\nelse:\n sgny = -1\n\nif abs(x) > abs(y):\n if sgnx == 1 and sgny == 1:\n ans = 2 + abs(x) - abs(y)\n if sgnx == -1 and sgny == -1:\n ans = abs(x) - abs(y)\n elif sgnx == -1 and sgny == 1:\n ans = 1 + abs(x) - abs(y)\n elif sgnx == 1 and sgny == -1:\n ans = 1 + abs(x) - abs(y)\n\nelif abs(x) < abs(y):\n if sgnx == 1 and sgny == 1:\n ans = y - x\n if sgnx == -1 and sgny == -1:\n ans = 2 + abs(y) - abs(x)\n elif sgnx == -1 and sgny == 1:\n ans = 1 + abs(y) - abs(x)\n elif sgnx == 1 and sgny == -1:\n ans = 1 + abs(y) - abs(x)\n\nelse:\n if sgnx == sgny:\n ans = 0\n if sgnx != sgny:\n ans = 1\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571689732", "date2": "1571690220", "bleu_score": "0.9750835003770381", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 90, "input": "101 1\n", "actual_output": "103\n", "expected_output": "102\n\n", "anno_code": ["x, y = map(int, input().split()) # (0): x=101, y=1\n\nif x >= 0: # (1): NO CHANGE\n sgnx = 1 # (2): sgnx=1\nelse:\n sgnx = -1\n\nif y >= 0: # (3): NO CHANGE\n sgny = 1 # (4): sgny=1\nelse:\n sgny = -1\n\nif abs(x) > abs(y): # (5): NO CHANGE\n if sgnx == 1 and sgny == 1: # (6): NO CHANGE\n ans = 1 + y + x # (7): ans=103\n if sgnx == -1 and sgny == -1: # (8): NO CHANGE\n ans = abs(x) - abs(y)\n elif sgnx == -1 and sgny == 1: # (9): NO CHANGE\n ans = 1 + abs(x) - abs(y)\n elif sgnx == 1 and sgny == -1: # (10): NO CHANGE\n ans = 1 + abs(x) - abs(y)\n\nelif abs(x) < abs(y):\n if sgnx == 1 and sgny == 1:\n ans = y - x\n if sgnx == -1 and sgny == -1:\n ans = 2 + abs(y) - abs(x)\n elif sgnx == -1 and sgny == 1:\n ans = 1 + abs(y) - abs(x)\n elif sgnx == 1 and sgny == -1:\n ans = 1 + abs(y) - abs(x)\n\nelse:\n if sgnx == sgny:\n ans = 0\n if sgnx != sgny:\n ans = 1\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " x, y = map(int, input().split())\n \n if x >= 0:\n sgnx = 1\n else:\n sgnx = -1\n \n-if y >= 0:\n+if y > 0:\n sgny = 1\n else:\n sgny = -1\n \n if abs(x) > abs(y):\n if sgnx == 1 and sgny == 1:\n- ans = 1 + y + x\n+ ans = 2 + abs(x) - abs(y)\n if sgnx == -1 and sgny == -1:\n ans = abs(x) - abs(y)\n elif sgnx == -1 and sgny == 1:\n ans = 1 + abs(x) - abs(y)\n elif sgnx == 1 and sgny == -1:\n ans = 1 + abs(x) - abs(y)\n \n elif abs(x) < abs(y):\n if sgnx == 1 and sgny == 1:\n ans = y - x\n if sgnx == -1 and sgny == -1:\n ans = 2 + abs(y) - abs(x)\n elif sgnx == -1 and sgny == 1:\n ans = 1 + abs(y) - abs(x)\n elif sgnx == 1 and sgny == -1:\n ans = 1 + abs(y) - abs(x)\n \n else:\n if sgnx == sgny:\n ans = 0\n if sgnx != sgny:\n ans = 1\n \n print(ans)\n \n", "FL_content": " x, y = map(int, input().split())\n \n if x >= 0:\n sgnx = 1\n else:\n sgnx = -1\n \n-if y >= 0:\n sgny = 1\n else:\n sgny = -1\n \n if abs(x) > abs(y):\n if sgnx == 1 and sgny == 1:\n- ans = 1 + y + x\n if sgnx == -1 and sgny == -1:\n ans = abs(x) - abs(y)\n elif sgnx == -1 and sgny == 1:\n ans = 1 + abs(x) - abs(y)\n elif sgnx == 1 and sgny == -1:\n ans = 1 + abs(x) - abs(y)\n \n elif abs(x) < abs(y):\n if sgnx == 1 and sgny == 1:\n ans = y - x\n if sgnx == -1 and sgny == -1:\n ans = 2 + abs(y) - abs(x)\n elif sgnx == -1 and sgny == 1:\n ans = 1 + abs(y) - abs(x)\n elif sgnx == 1 and sgny == -1:\n ans = 1 + abs(y) - abs(x)\n \n else:\n if sgnx == sgny:\n ans = 0\n if sgnx != sgny:\n ans = 1\n \n print(ans)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 40 }, { "user_id": "u634046173", "problem_id": "p03838", "submission1_id": "s497931525", "submission2_id": "s147078650", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y = map(int, input().split())\nif x == y :\n print(0)\nelif (-x) == y:\n print(1)\nelif x >= 0 and x <= y:\n print(y-x)\nelif x >= 0 and x > y:\n if x <= (-y): \n print(abs(x-(-y))+1)\n else: \n print(abs(y-(-x))+1)\nelif x < 0 and x > y: \n print(min(abs(x-y)+2, -y -x+1))\nelif x < 0 and x < y: \n if (-x) < y: \n print(min(abs(y-x),abs(y-(-x))+1))\n else:\n print(abs(y - x))\n\n", "code2": "x,y = map(int, input().split())\nif x == y :\n print(0)\nelif (-x) == y:\n print(1)\nelif x >= 0 and x < y: \n print(y-x)\nelif x >= 0 and x > y: \n if x <= (-y): \n print(abs(x-(-y))+1)\n else: \n print(min(abs(y-(-x))+1,abs(x-y)+2))\nelif x < 0 and x > y: \n print(min(abs(x-y)+2, -y -x+1))\nelif x < 0 and x < y: \n if y > 0: \n print(min(abs(y-x),abs((-y)-x)+1))\n else:\n print(abs(y - x))\n\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600146477", "date2": "1600147153", "bleu_score": "0.9249062786876675", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 90, "input": "101 1\n", "actual_output": "103\n", "expected_output": "102\n\n", "anno_code": ["x,y = map(int, input().split()) # (0): x=101, y=1\nif x == y : # (1): NO CHANGE\n print(0)\nelif (-x) == y: # (2): NO CHANGE\n print(1)\nelif x >= 0 and x <= y: # (3): NO CHANGE\n print(y-x)\nelif x >= 0 and x > y: # (4): NO CHANGE\n if x <= (-y): # (5): NO CHANGE\n print(abs(x-(-y))+1)\n else: \n print(abs(y-(-x))+1)\nelif x < 0 and x > y: \n print(min(abs(x-y)+2, -y -x+1))\nelif x < 0 and x < y: \n if (-x) < y: \n print(min(abs(y-x),abs(y-(-x))+1))\n else:\n print(abs(y - x))\n\n"], "anno_status": [true], "diff_content": " x,y = map(int, input().split())\n if x == y :\n print(0)\n elif (-x) == y:\n print(1)\n-elif x >= 0 and x <= y:\n+elif x >= 0 and x < y: \n print(y-x)\n-elif x >= 0 and x > y:\n+elif x >= 0 and x > y: \n if x <= (-y): \n print(abs(x-(-y))+1)\n else: \n- print(abs(y-(-x))+1)\n+ print(min(abs(y-(-x))+1,abs(x-y)+2))\n elif x < 0 and x > y: \n print(min(abs(x-y)+2, -y -x+1))\n elif x < 0 and x < y: \n- if (-x) < y: \n- print(min(abs(y-x),abs(y-(-x))+1))\n+ if y > 0: \n+ print(min(abs(y-x),abs((-y)-x)+1))\n else:\n print(abs(y - x))\n \n \n", "FL_content": " x,y = map(int, input().split())\n if x == y :\n print(0)\n elif (-x) == y:\n print(1)\n-elif x >= 0 and x <= y:\n print(y-x)\n-elif x >= 0 and x > y:\n if x <= (-y): \n print(abs(x-(-y))+1)\n else: \n- print(abs(y-(-x))+1)\n elif x < 0 and x > y: \n print(min(abs(x-y)+2, -y -x+1))\n elif x < 0 and x < y: \n- if (-x) < y: \n- print(min(abs(y-x),abs(y-(-x))+1))\n else:\n print(abs(y - x))\n \n \n", "added_lines": 5, "removed_lines": 5, "code1_lines": 21 }, { "user_id": "u691018832", "problem_id": "p03838", "submission1_id": "s065902461", "submission2_id": "s575262987", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\nx, y = map(int, readline().split())\nif x <= y:\n if (x > 0 and y > 0) or (x <= 0 and y <= 0):\n ans = y - x\n else:\n ans = y + x + 1\nelse:\n if (x >= 0 and y >= 0) or (x < 0 and y < 0):\n ans = min(abs(x) + abs(y) + 1, abs(y) - abs(x) + 2)\n else:\n ans = - x - y + 1\nprint(ans)\n", "code2": "import sys\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\nx, y = map(int, readline().split())\nif x <= y:\n if (x >= 0 and y >= 0) or (x <= 0 and y <= 0):\n ans = y - x\n else:\n ans = abs(abs(x) - y) + 1\nelse:\n if (x > 0 and y > 0) or (x < 0 and y < 0):\n ans = min(abs(x) + abs(y) + 1, abs(abs(y) - abs(x)) + 2)\n elif y == 0:\n ans = abs(x) + 1\n elif x == 0:\n ans = abs(y) + 1\n else:\n ans = abs(x - abs(y)) + 1\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585939122", "date2": "1585939669", "bleu_score": "0.7870639086841366", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1], "code1_test_score": 29, "total_score": 90, "input": "370 -1\n", "actual_output": "-368\n", "expected_output": "370\n\n", "anno_code": ["import sys\nread = sys.stdin.buffer.read # (0): read=\nreadline = sys.stdin.buffer.readline # (1): readline=\nreadlines = sys.stdin.buffer.readlines # (2): readlines=\n\nx, y = map(int, readline().split()) # (3): x=370, y=-1\nif x <= y: # (4): NO CHANGE\n if (x > 0 and y > 0) or (x <= 0 and y <= 0):\n ans = y - x\n else:\n ans = y + x + 1\nelse:\n if (x >= 0 and y >= 0) or (x < 0 and y < 0): # (5): NO CHANGE\n ans = min(abs(x) + abs(y) + 1, abs(y) - abs(x) + 2)\n else:\n ans = - x - y + 1 # (6): ans=-368\nprint(ans)\n"], "anno_status": [true], "diff_content": " import sys\n read = sys.stdin.buffer.read\n readline = sys.stdin.buffer.readline\n readlines = sys.stdin.buffer.readlines\n \n x, y = map(int, readline().split())\n if x <= y:\n- if (x > 0 and y > 0) or (x <= 0 and y <= 0):\n+ if (x >= 0 and y >= 0) or (x <= 0 and y <= 0):\n ans = y - x\n else:\n- ans = y + x + 1\n+ ans = abs(abs(x) - y) + 1\n else:\n- if (x >= 0 and y >= 0) or (x < 0 and y < 0):\n- ans = min(abs(x) + abs(y) + 1, abs(y) - abs(x) + 2)\n+ if (x > 0 and y > 0) or (x < 0 and y < 0):\n+ ans = min(abs(x) + abs(y) + 1, abs(abs(y) - abs(x)) + 2)\n+ elif y == 0:\n+ ans = abs(x) + 1\n+ elif x == 0:\n+ ans = abs(y) + 1\n else:\n- ans = - x - y + 1\n+ ans = abs(x - abs(y)) + 1\n print(ans)\n \n", "FL_content": " import sys\n read = sys.stdin.buffer.read\n readline = sys.stdin.buffer.readline\n readlines = sys.stdin.buffer.readlines\n \n x, y = map(int, readline().split())\n if x <= y:\n- if (x > 0 and y > 0) or (x <= 0 and y <= 0):\n ans = y - x\n else:\n- ans = y + x + 1\n else:\n- if (x >= 0 and y >= 0) or (x < 0 and y < 0):\n- ans = min(abs(x) + abs(y) + 1, abs(y) - abs(x) + 2)\n else:\n- ans = - x - y + 1\n print(ans)\n \n", "added_lines": 9, "removed_lines": 5, "code1_lines": 18 }, { "user_id": "u691896522", "problem_id": "p03838", "submission1_id": "s648831731", "submission2_id": "s242155799", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y = map(int, input().split())\n\n\n\nabs_cost = 0\nif x == y:\n print(0)\n exit()\nif y >= 0 and x >= 0:\n if y > x:\n print(y - x)\n else:\n print(abs(x) - abs(y) + 2)\nelif y < 0 and x >= 0:\n if abs(y) > abs(x):\n print(abs(y) - x + 1)\n else:\n print(x - abs(y) + 1)\nelif y >= 0 and x < 0:\n print(y - abs(x) + 1)\nelse:\n if y > x:\n print(y - x)\n else:\n print(abs(y) - abs(x) + 2)\n\n\n", "code2": "\nx, y = map(int, input().split())\n\n\n\nif x == 0:\n if y >= 0:\n print(y)\n else:\n print(abs(y) + 1)\n exit()\nelif y == 0:\n if x >= 0:\n print(1 + abs(x))\n else:\n print(abs(x))\n exit()\nif y > 0 and x > 0:\n if y >= x:\n print(y - x)\n else:\n print(abs(x) - abs(y) + 2)\nelif y < 0 and x > 0:\n if abs(y) > abs(x):\n print(abs(y) - x + 1)\n else:\n print(x - abs(y) + 1)\nelif y > 0 and x < 0:\n if abs(x) < abs(y):\n print(y - abs(x) + 1)\n else:\n print(abs(x) - y + 1)\nelse:\n if y >= x:\n print(y - x)\n else:\n print(abs(y) - abs(x) + 2)\n\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1583979510", "date2": "1583980961", "bleu_score": "0.6541190582533486", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 68, "total_score": 90, "input": "370 0\n", "actual_output": "372\n", "expected_output": "371\n\n", "anno_code": ["x, y = map(int, input().split()) # (0): x=370, y=0\n\n\n\nabs_cost = 0 # (1): abs_cost=0\nif x == y: # (2): NO CHANGE\n print(0)\n exit()\nif y >= 0 and x >= 0: # (3): NO CHANGE\n if y > x: # (4): NO CHANGE\n print(y - x)\n else:\n print(abs(x) - abs(y) + 2)\nelif y < 0 and x >= 0:\n if abs(y) > abs(x):\n print(abs(y) - x + 1)\n else:\n print(x - abs(y) + 1)\nelif y >= 0 and x < 0:\n print(y - abs(x) + 1)\nelse:\n if y > x:\n print(y - x)\n else:\n print(abs(y) - abs(x) + 2)\n\n\n"], "anno_status": [true], "diff_content": "+\n x, y = map(int, input().split())\n \n \n \n-abs_cost = 0\n-if x == y:\n- print(0)\n+if x == 0:\n+ if y >= 0:\n+ print(y)\n+ else:\n+ print(abs(y) + 1)\n exit()\n-if y >= 0 and x >= 0:\n- if y > x:\n+elif y == 0:\n+ if x >= 0:\n+ print(1 + abs(x))\n+ else:\n+ print(abs(x))\n+ exit()\n+if y > 0 and x > 0:\n+ if y >= x:\n print(y - x)\n else:\n print(abs(x) - abs(y) + 2)\n-elif y < 0 and x >= 0:\n+elif y < 0 and x > 0:\n if abs(y) > abs(x):\n print(abs(y) - x + 1)\n else:\n print(x - abs(y) + 1)\n-elif y >= 0 and x < 0:\n- print(y - abs(x) + 1)\n+elif y > 0 and x < 0:\n+ if abs(x) < abs(y):\n+ print(y - abs(x) + 1)\n+ else:\n+ print(abs(x) - y + 1)\n else:\n- if y > x:\n+ if y >= x:\n print(y - x)\n else:\n print(abs(y) - abs(x) + 2)\n \n \n \n", "FL_content": " x, y = map(int, input().split())\n \n \n \n-abs_cost = 0\n-if x == y:\n- print(0)\n exit()\n-if y >= 0 and x >= 0:\n- if y > x:\n print(y - x)\n else:\n print(abs(x) - abs(y) + 2)\n-elif y < 0 and x >= 0:\n if abs(y) > abs(x):\n print(abs(y) - x + 1)\n else:\n print(x - abs(y) + 1)\n-elif y >= 0 and x < 0:\n- print(y - abs(x) + 1)\n else:\n- if y > x:\n print(y - x)\n else:\n print(abs(y) - abs(x) + 2)\n \n \n \n", "added_lines": 21, "removed_lines": 9, "code1_lines": 28 }, { "user_id": "u540761833", "problem_id": "p03838", "submission1_id": "s009951454", "submission2_id": "s676730689", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y = map(int,input().split())\nsuma = abs(abs(x)-abs(y))\nif abs(x) == abs(y):\n if x*y < 0:\n suma += 1\nelif abs(x) < abs(y):\n if x < 0:\n suma += 1\n if y < 0:\n suma += 1\n else:\n if y < 0:\n suma += 1\nelse:\n if x < 0:\n if y < 0:\n suma += 2\n else:\n suma += 1\n else:\n if y < 0:\n suma += 1\n else:\n suma += 2\nprint(suma)", "code2": "x,y = map(int,input().split())\nsuma = abs(abs(x)-abs(y))\nif x == 0:\n if y < 0:\n suma += 1\nelif y == 0:\n if x > 0:\n suma += 1\nelif abs(x) == abs(y):\n if x*y < 0:\n suma += 1\nelif abs(x) < abs(y):\n if x < 0:\n suma += 1\n if y < 0:\n suma += 1\n else:\n if y < 0:\n suma += 1\nelse:\n if x < 0:\n if y < 0:\n pass\n else:\n suma += 1\n else:\n if y < 0:\n suma += 1\n else:\n suma = min(x+y,(x-y)+2)\nprint(suma)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577124799", "date2": "1577125272", "bleu_score": "0.8101289716129928", "code1_test_status": [1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 65, "total_score": 90, "input": "40 0\n", "actual_output": "42\n", "expected_output": "41\n\n", "anno_code": ["x,y = map(int,input().split()) # (0): x=40, y=0\nsuma = abs(abs(x)-abs(y)) # (1): suma=40\nif abs(x) == abs(y): # (2): NO CHANGE\n if x*y < 0:\n suma += 1\nelif abs(x) < abs(y): # (3): NO CHANGE\n if x < 0:\n suma += 1\n if y < 0:\n suma += 1\n else:\n if y < 0:\n suma += 1\nelse:\n if x < 0: # (4): NO CHANGE\n if y < 0:\n suma += 2\n else:\n suma += 1\n else:\n if y < 0: # (5): NO CHANGE\n suma += 1\n else:\n suma += 2 # (6): suma=42\nprint(suma)"], "anno_status": [true], "diff_content": " x,y = map(int,input().split())\n suma = abs(abs(x)-abs(y))\n-if abs(x) == abs(y):\n+if x == 0:\n+ if y < 0:\n+ suma += 1\n+elif y == 0:\n+ if x > 0:\n+ suma += 1\n+elif abs(x) == abs(y):\n if x*y < 0:\n suma += 1\n elif abs(x) < abs(y):\n if x < 0:\n suma += 1\n if y < 0:\n suma += 1\n else:\n if y < 0:\n suma += 1\n else:\n if x < 0:\n if y < 0:\n- suma += 2\n+ pass\n else:\n suma += 1\n else:\n if y < 0:\n suma += 1\n else:\n- suma += 2\n+ suma = min(x+y,(x-y)+2)\n print(suma)\n", "FL_content": " x,y = map(int,input().split())\n suma = abs(abs(x)-abs(y))\n-if abs(x) == abs(y):\n if x*y < 0:\n suma += 1\n elif abs(x) < abs(y):\n if x < 0:\n suma += 1\n if y < 0:\n suma += 1\n else:\n if y < 0:\n suma += 1\n else:\n if x < 0:\n if y < 0:\n- suma += 2\n else:\n suma += 1\n else:\n if y < 0:\n suma += 1\n else:\n- suma += 2\n print(suma)\n", "added_lines": 9, "removed_lines": 3, "code1_lines": 25 }, { "user_id": "u802963389", "problem_id": "p03838", "submission1_id": "s438289152", "submission2_id": "s283997769", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y = map(int, input().split())\ndist = abs(abs(x) - abs(y))\nif x <= y:\n x, y = y, x\nif x + dist == y:\n ans = dist\nelif - x + dist == y:\n ans = dist + 1\nelif - x + dist == -y:\n ans = dist + 2\nelif x + dist == -y:\n ans = dist + 1\nprint(ans)", "code2": "x, y = map(int, input().split())\ndist = abs(abs(x) - abs(y))\n\nif x + dist == y:\n ans = dist\nelif - x + dist == y:\n ans = dist + 1\nelif x + dist == -y:\n ans = dist + 1\nelif - x + dist == -y:\n ans = dist + 2\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571420207", "date2": "1571420563", "bleu_score": "0.8856120148309723", "code1_test_status": [0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 76, "total_score": 90, "input": "0 -32\n", "actual_output": "34\n", "expected_output": "33\n\n", "anno_code": ["x, y = map(int, input().split()) # (0): x=0, y=-32\ndist = abs(abs(x) - abs(y)) # (1): dist=32\nif x <= y: # (2): NO CHANGE\n x, y = y, x\nif x + dist == y: # (3): NO CHANGE\n ans = dist\nelif - x + dist == y: # (4): NO CHANGE\n ans = dist + 1\nelif - x + dist == -y: # (5): NO CHANGE\n ans = dist + 2 # (6): ans=34\nelif x + dist == -y:\n ans = dist + 1\nprint(ans)"], "anno_status": [true], "diff_content": " x, y = map(int, input().split())\n dist = abs(abs(x) - abs(y))\n-if x <= y:\n- x, y = y, x\n+\n if x + dist == y:\n ans = dist\n elif - x + dist == y:\n ans = dist + 1\n-elif - x + dist == -y:\n- ans = dist + 2\n elif x + dist == -y:\n ans = dist + 1\n+elif - x + dist == -y:\n+ ans = dist + 2\n+\n print(ans)\n", "FL_content": " x, y = map(int, input().split())\n dist = abs(abs(x) - abs(y))\n-if x <= y:\n- x, y = y, x\n if x + dist == y:\n ans = dist\n elif - x + dist == y:\n ans = dist + 1\n-elif - x + dist == -y:\n- ans = dist + 2\n elif x + dist == -y:\n ans = dist + 1\n print(ans)\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 13 }, { "user_id": "u888092736", "problem_id": "p03838", "submission1_id": "s701499906", "submission2_id": "s016787760", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y = map(int, input().split())\na_cnt = abs(abs(x) - abs(y))\nif y >= x:\n print(a_cnt)\nelif abs(y) == abs(x):\n print(1)\nelse:\n print(a_cnt + 2)\n", "code2": "x, y = map(int, input().split())\na_cnt = abs(abs(x) - abs(y))\n\nif x + a_cnt == y:\n print(a_cnt)\nelif x + a_cnt == -y:\n print(a_cnt + 1)\nelif x - a_cnt == -y:\n print(a_cnt + 1)\nelse:\n print(a_cnt + 2)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591297412", "date2": "1591299044", "bleu_score": "0.6190868865507209", "code1_test_status": [1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 28, "total_score": 90, "input": "100 -1\n", "actual_output": "101\n", "expected_output": "100\n\n", "anno_code": ["x, y = map(int, input().split()) # (0): x=100, y=-1\na_cnt = abs(abs(x) - abs(y)) # (1): a_cnt=99\nif y >= x: # (2): NO CHANGE\n print(a_cnt)\nelif abs(y) == abs(x): # (3): NO CHANGE\n print(1)\nelse:\n print(a_cnt + 2)\n"], "anno_status": [true], "diff_content": " x, y = map(int, input().split())\n a_cnt = abs(abs(x) - abs(y))\n-if y >= x:\n+\n+if x + a_cnt == y:\n print(a_cnt)\n-elif abs(y) == abs(x):\n- print(1)\n+elif x + a_cnt == -y:\n+ print(a_cnt + 1)\n+elif x - a_cnt == -y:\n+ print(a_cnt + 1)\n else:\n print(a_cnt + 2)\n \n", "FL_content": " x, y = map(int, input().split())\n a_cnt = abs(abs(x) - abs(y))\n-if y >= x:\n print(a_cnt)\n-elif abs(y) == abs(x):\n- print(1)\n else:\n print(a_cnt + 2)\n \n", "added_lines": 6, "removed_lines": 3, "code1_lines": 9 }, { "user_id": "u370608397", "problem_id": "p03838", "submission1_id": "s188529096", "submission2_id": "s641932040", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y=map(int,input().split())\nans=abs(abs(x)-abs(y))\nif x>=0:\n if y<0:\n ans+=1\n elif x>y:\n ans+=2\nelse:\n if y>0:\n ans+=1\n elif x>y:\n ans+=2\n\nprint(ans)", "code2": "x,y=map(int,input().split())\nans=abs(abs(x)-abs(y))\nif y==0:\n if x>0:\n ans+=1\nelif x>=0:\n if y<0:\n ans+=1\n elif x>y:\n ans+=2\nelse:\n if y>0:\n ans+=1\n elif x>y:\n ans+=2\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568346729", "date2": "1568347790", "bleu_score": "0.832225080540225", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 68, "total_score": 90, "input": "664 0\n", "actual_output": "666\n", "expected_output": "665\n\n", "anno_code": ["x,y=map(int,input().split()) # (0): x=664, y=0\nans=abs(abs(x)-abs(y)) # (1): ans=664\nif x>=0: # (2): NO CHANGE\n if y<0: # (3): NO CHANGE\n ans+=1\n elif x>y: # (4): NO CHANGE\n ans+=2 # (5): ans=666\nelse:\n if y>0:\n ans+=1\n elif x>y:\n ans+=2\n\nprint(ans)"], "anno_status": [true], "diff_content": " x,y=map(int,input().split())\n ans=abs(abs(x)-abs(y))\n-if x>=0:\n+if y==0:\n+ if x>0:\n+ ans+=1\n+elif x>=0:\n if y<0:\n ans+=1\n elif x>y:\n ans+=2\n else:\n if y>0:\n ans+=1\n elif x>y:\n ans+=2\n \n print(ans)\n", "FL_content": " x,y=map(int,input().split())\n ans=abs(abs(x)-abs(y))\n-if x>=0:\n if y<0:\n ans+=1\n elif x>y:\n ans+=2\n else:\n if y>0:\n ans+=1\n elif x>y:\n ans+=2\n \n print(ans)\n", "added_lines": 4, "removed_lines": 1, "code1_lines": 14 }, { "user_id": "u386131832", "problem_id": "p03838", "submission1_id": "s272693399", "submission2_id": "s459163489", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y=[int(i) for i in input().split()]\nif 0<=x and 0<=y:\n if x>y:\n print(x-y+1)\n else:\n print(y-x)\n\nelif 0<=x and y<0:\n if y==0:\n print(abs(abs(x)-y)+1)\n elif abs(y)==abs(x):\n print(1)\n else:\n print(abs(abs(x)-y)+1)\n\nelif x<0 and 0<=y:\n if y==0:\n print(abs(abs(x)-y))\n elif abs(y)==abs(x):\n print(1)\n else:\n print(abs(abs(x)-y)+1)\n\nelif x<0 and y<0:\n if abs(x)y:\n print(x-y+2)\n sys.exit()\n else:\n print(y-x)\n sys.exit()\n\nelif 0<=x and y<0:\n print(abs(abs(y)-x)+1)\n sys.exit()\n\nelif x<0 and 0<=y:\n if y==0:\n print(abs(abs(x)-y))\n sys.exit()\n else:\n print(abs(abs(x)-y)+1)\n sys.exit()\n\nelif x<0 and y<0:\n if abs(x)y: # (2): NO CHANGE\n print(x-y+1)\n else:\n print(y-x)\n\nelif 0<=x and y<0:\n if y==0:\n print(abs(abs(x)-y)+1)\n elif abs(y)==abs(x):\n print(1)\n else:\n print(abs(abs(x)-y)+1)\n\nelif x<0 and 0<=y:\n if y==0:\n print(abs(abs(x)-y))\n elif abs(y)==abs(x):\n print(1)\n else:\n print(abs(abs(x)-y)+1)\n\nelif x<0 and y<0:\n if abs(x)y:\n- print(x-y+1)\n+ print(x-y+2)\n+ sys.exit()\n else:\n print(y-x)\n+ sys.exit()\n \n elif 0<=x and y<0:\n- if y==0:\n- print(abs(abs(x)-y)+1)\n- elif abs(y)==abs(x):\n- print(1)\n- else:\n- print(abs(abs(x)-y)+1)\n+ print(abs(abs(y)-x)+1)\n+ sys.exit()\n \n elif x<0 and 0<=y:\n if y==0:\n print(abs(abs(x)-y))\n- elif abs(y)==abs(x):\n- print(1)\n+ sys.exit()\n else:\n print(abs(abs(x)-y)+1)\n+ sys.exit()\n \n elif x<0 and y<0:\n if abs(x)y:\n- print(x-y+1)\n else:\n print(y-x)\n \n elif 0<=x and y<0:\n- if y==0:\n- print(abs(abs(x)-y)+1)\n- elif abs(y)==abs(x):\n- print(1)\n- else:\n- print(abs(abs(x)-y)+1)\n \n elif x<0 and 0<=y:\n if y==0:\n print(abs(abs(x)-y))\n- elif abs(y)==abs(x):\n- print(1)\n else:\n print(abs(abs(x)-y)+1)\n \n elif x<0 and y<0:\n if abs(x) x:\n\tif abs(x) > abs(y):\n\t\ta = y-x\n\telse:\n\t\ta = min(y-x, y-abs(x)+1)\nelse:\n\tif x < 0:\n\t\ta = abs(abs(x) - abs(y)) + 2\n\telse:\n\t\ta = abs(abs(x) - abs(y)) + 1\n\nprint (a)\n\n", "code2": "\nx, y = map(int, input() .split())\n\n\nif y > x:\n\tif x*y >= 0:\n\t\ta = y-x\n\telse:\n\t\ta = abs(abs(x) - abs(y)) + 1\nelse:\n\tif x*y > 0:\n\t\ta = abs(abs(x) - abs(y)) + 2\n\telse:\n\t\ta = abs(abs(x) - abs(y)) + 1\n\nprint (a)\n\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1487613694", "date2": "1487614115", "bleu_score": "0.8833277741560989", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 90, "input": "101 1\n", "actual_output": "101\n", "expected_output": "102\n\n", "anno_code": ["\nx, y = map(int, input() .split()) # (0): x=101, y=1\n\n\nif y > x: # (1): NO CHANGE\n\tif abs(x) > abs(y):\n\t\ta = y-x\n\telse:\n\t\ta = min(y-x, y-abs(x)+1)\nelse:\n\tif x < 0: # (2): NO CHANGE\n\t\ta = abs(abs(x) - abs(y)) + 2\n\telse:\n\t\ta = abs(abs(x) - abs(y)) + 1 # (3): a=101\n\nprint (a)\n\n"], "anno_status": [true], "diff_content": " \n x, y = map(int, input() .split())\n \n \n if y > x:\n-\tif abs(x) > abs(y):\n+\tif x*y >= 0:\n \t\ta = y-x\n \telse:\n-\t\ta = min(y-x, y-abs(x)+1)\n+\t\ta = abs(abs(x) - abs(y)) + 1\n else:\n-\tif x < 0:\n+\tif x*y > 0:\n \t\ta = abs(abs(x) - abs(y)) + 2\n \telse:\n \t\ta = abs(abs(x) - abs(y)) + 1\n \n print (a)\n \n \n+\n", "FL_content": " \n x, y = map(int, input() .split())\n \n \n if y > x:\n-\tif abs(x) > abs(y):\n \t\ta = y-x\n \telse:\n-\t\ta = min(y-x, y-abs(x)+1)\n else:\n-\tif x < 0:\n \t\ta = abs(abs(x) - abs(y)) + 2\n \telse:\n \t\ta = abs(abs(x) - abs(y)) + 1\n \n print (a)\n \n \n", "added_lines": 4, "removed_lines": 3, "code1_lines": 18 }, { "user_id": "u390618988", "problem_id": "p02929", "submission1_id": "s660103579", "submission2_id": "s044575451", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\n\nN = int(stdin.readline().rstrip())\nS = stdin.readline().rstrip()\n\nans = 1\ninf = 10 ** 9 + 7\nd = 'L'\nl_count = 1\nr_count = 0\nfor i in range(1, 2 * N):\n if S[i] != S[i - 1]:\n if d == 'R':\n ans *= l_count - r_count\n ans %= inf\n r_count += 1\n else:\n l_count += 1\n else:\n if d == 'R':\n d = 'L'\n l_count += 1\n else:\n ans *= l_count - r_count\n ans %= inf\n d = 'R'\n r_count += 1\n\nfor j in range(1, N + 1):\n ans *= j\n ans %= inf\n\nprint(ans % inf)", "code2": "from sys import stdin\n\nN = int(stdin.readline().rstrip())\nS = stdin.readline().rstrip()\n\nans = 1\ninf = 10 ** 9 + 7\nd = 'L'\nl_count = 1\nr_count = 0\n\nif S[0] == 'W' or S[2 * N - 1] == 'W':\n print(0)\n exit()\n\nfor i in range(1, 2 * N):\n if S[i] != S[i - 1]:\n if d == 'R':\n ans *= l_count - r_count\n ans %= inf\n r_count += 1\n else:\n l_count += 1\n else:\n if d == 'R':\n d = 'L'\n l_count += 1\n else:\n ans *= l_count - r_count\n ans %= inf\n d = 'R'\n r_count += 1\n\nif l_count != r_count:\n print(0)\n exit()\n\nfor j in range(1, N + 1):\n ans *= j\n ans %= inf\n\nprint(ans % inf)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1566766208", "date2": "1566766452", "bleu_score": "0.841990856452564", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 60, "total_score": 103, "input": "5\nWWWWWXWWWU\n", "actual_output": "360\n", "expected_output": "0\n\n", "anno_code": ["from sys import stdin\n\nN = int(stdin.readline().rstrip()) # (0): N=5\nS = stdin.readline().rstrip() # (1): S=WWWWWXWWWU\n\nans = 1 # (2): ans=1\ninf = 10 ** 9 + 7 # (3): inf=1000000007\nd = 'L' # (4): d=L\nl_count = 1 # (5): l_count=1\nr_count = 0 # (6): r_count=0\nfor i in range(1, 2 * N): # (7): i=1 (14): i=2 ... (55): NO CHANGE\n if S[i] != S[i - 1]: # (8): NO CHANGE (15): NO CHANGE ... (52): NO CHANGE\n if d == 'R': # (33): NO CHANGE (37): NO CHANGE (53): NO CHANGE\n ans *= l_count - r_count\n ans %= inf\n r_count += 1\n else:\n l_count += 1 # (34): l_count=4 (38): l_count=5 (54): l_count=7\n else:\n if d == 'R': # (9): NO CHANGE (16): NO CHANGE ... (48): NO CHANGE\n d = 'L' # (17): d=L (29): d=L (49): d=L\n l_count += 1 # (18): l_count=2 (30): l_count=3 (50): l_count=6\n else:\n ans *= l_count - r_count # (10): NO CHANGE (22): NO CHANGE (42): ans=3\n ans %= inf # (11): NO CHANGE (23): NO CHANGE (43): NO CHANGE\n d = 'R' # (12): d=R (24): d=R (44): d=R\n r_count += 1 # (13): r_count=1 (25): r_count=2 (45): r_count=3\n\nfor j in range(1, N + 1): # (56): j=1 (59): j=2 ... (71): NO CHANGE\n ans *= j # (57): NO CHANGE (60): ans=6 ... (69): ans=360\n ans %= inf # (58): NO CHANGE (61): NO CHANGE ... (70): NO CHANGE\n\nprint(ans % inf)"], "anno_status": [true], "diff_content": " from sys import stdin\n \n N = int(stdin.readline().rstrip())\n S = stdin.readline().rstrip()\n \n ans = 1\n inf = 10 ** 9 + 7\n d = 'L'\n l_count = 1\n r_count = 0\n+\n+if S[0] == 'W' or S[2 * N - 1] == 'W':\n+ print(0)\n+ exit()\n+\n for i in range(1, 2 * N):\n if S[i] != S[i - 1]:\n if d == 'R':\n ans *= l_count - r_count\n ans %= inf\n r_count += 1\n else:\n l_count += 1\n else:\n if d == 'R':\n d = 'L'\n l_count += 1\n else:\n ans *= l_count - r_count\n ans %= inf\n d = 'R'\n r_count += 1\n \n+if l_count != r_count:\n+ print(0)\n+ exit()\n+\n for j in range(1, N + 1):\n ans *= j\n ans %= inf\n \n print(ans % inf)\n", "FL_content": " from sys import stdin\n \n N = int(stdin.readline().rstrip())\n S = stdin.readline().rstrip()\n \n ans = 1\n inf = 10 ** 9 + 7\n d = 'L'\n l_count = 1\n r_count = 0\n for i in range(1, 2 * N):\n if S[i] != S[i - 1]:\n if d == 'R':\n ans *= l_count - r_count\n ans %= inf\n r_count += 1\n else:\n l_count += 1\n else:\n if d == 'R':\n d = 'L'\n l_count += 1\n else:\n ans *= l_count - r_count\n ans %= inf\n d = 'R'\n r_count += 1\n \n for j in range(1, N + 1):\n ans *= j\n ans %= inf\n \n print(ans % inf)\n", "added_lines": 9, "removed_lines": 0, "code1_lines": 33 }, { "user_id": "u016128476", "problem_id": "p02929", "submission1_id": "s613027010", "submission2_id": "s862526364", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import factorial\nN = int(input())\nS = input()\nMOD = 10 ** 9 + 7\n\nLR = [True] \nfor i in range(N*2-1):\n LR += [LR[-1]] if S[i+1] != S[i] else [not LR[-1]]\n\n\ncmb = 1\ncr = 0\nfor i in range(N*2-1, -1, -1):\n if not LR[i]:\n cr += 1\n else:\n cmb *= cr\n cmb %= MOD\n cr -= 1\n\nprint((factorial(N) * cmb) % MOD)\n", "code2": "from math import factorial\nN = int(input())\nS = input()\nMOD = 10 ** 9 + 7\n\nLR = [True] \nfor i in range(N*2-1):\n LR += [LR[-1]] if S[i+1] != S[i] else [not LR[-1]]\n\nvalid = S[0] == S[-1] == 'B' and not LR[-1] and LR.count(True) == N\n\nif valid:\n \n cmb = 1\n cr = 0\n for i in range(N*2-1, -1, -1):\n if not LR[i]:\n cr += 1\n else:\n cmb *= cr\n cmb %= MOD\n cr -= 1\n\n print((factorial(N) * cmb) % MOD)\nelse:\n print(0)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566763621", "date2": "1566763957", "bleu_score": "0.6952759947555577", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0], "code1_test_score": 74, "total_score": 103, "input": "5\nWXWWVWWWWW\n", "actual_output": "720\n", "expected_output": "0\n\n", "anno_code": ["from math import factorial\nN = int(input()) # (0): N=5\nS = input() # (1): S=WXWWVWWWWW\nMOD = 10 ** 9 + 7 # (2): MOD=1000000007\n\nLR = [True] # (3): LR=[True]\nfor i in range(N*2-1): # (4): i=0 (6): i=1 ... (22): NO CHANGE\n LR += [LR[-1]] if S[i+1] != S[i] else [not LR[-1]] # (5): LR=[True, True] (7): LR=[True, True, True] ... (21): LR=[True, True, True, False, False, False, True, False, True, False]\n\n\ncmb = 1 # (23): cmb=1\ncr = 0 # (24): cr=0\nfor i in range(N*2-1, -1, -1): # (25): i=9 (28): i=8 ... (65): NO CHANGE\n if not LR[i]: # (26): NO CHANGE (29): NO CHANGE ... (61): NO CHANGE\n cr += 1 # (27): cr=1 (35): cr=1 ... (49): cr=3\n else:\n cmb *= cr # (30): NO CHANGE (38): NO CHANGE ... (62): NO CHANGE\n cmb %= MOD # (31): NO CHANGE (39): NO CHANGE ... (63): NO CHANGE\n cr -= 1 # (32): cr=0 (40): cr=0 ... (64): cr=0\n\nprint((factorial(N) * cmb) % MOD)\n"], "anno_status": [true], "diff_content": " from math import factorial\n N = int(input())\n S = input()\n MOD = 10 ** 9 + 7\n \n LR = [True] \n for i in range(N*2-1):\n LR += [LR[-1]] if S[i+1] != S[i] else [not LR[-1]]\n \n+valid = S[0] == S[-1] == 'B' and not LR[-1] and LR.count(True) == N\n \n-cmb = 1\n-cr = 0\n-for i in range(N*2-1, -1, -1):\n- if not LR[i]:\n- cr += 1\n- else:\n- cmb *= cr\n- cmb %= MOD\n- cr -= 1\n+if valid:\n+ \n+ cmb = 1\n+ cr = 0\n+ for i in range(N*2-1, -1, -1):\n+ if not LR[i]:\n+ cr += 1\n+ else:\n+ cmb *= cr\n+ cmb %= MOD\n+ cr -= 1\n \n-print((factorial(N) * cmb) % MOD)\n+ print((factorial(N) * cmb) % MOD)\n+else:\n+ print(0)\n \n", "FL_content": " from math import factorial\n N = int(input())\n S = input()\n MOD = 10 ** 9 + 7\n \n LR = [True] \n for i in range(N*2-1):\n LR += [LR[-1]] if S[i+1] != S[i] else [not LR[-1]]\n \n \n-cmb = 1\n-cr = 0\n-for i in range(N*2-1, -1, -1):\n- if not LR[i]:\n- cr += 1\n- else:\n- cmb *= cr\n- cmb %= MOD\n- cr -= 1\n \n-print((factorial(N) * cmb) % MOD)\n \n", "added_lines": 15, "removed_lines": 10, "code1_lines": 22 }, { "user_id": "u858748695", "problem_id": "p02929", "submission1_id": "s052941027", "submission2_id": "s713250941", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nMOD = 10**9 + 7\nn = int(input())\ns = input()\nd = 1\nans = 1\nfor i in range(1, 2 * n):\n if (s[i] == 'B') ^ (d % 2 != 0):\n d += 1\n else:\n ans *= max(1, d)\n ans %= MOD\n d -= 1\nif d != 0 or s[0] == 'W' or s[-1] == 'W':\n print(0)\n exit()\nfor i in range(1, n + 1):\n ans *= i\n ans %= MOD\nprint(ans)\n", "code2": "\nMOD = 10**9 + 7\nn = int(input())\ns = input()\nd = 0\nans = 1\nfor i in range(2 * n):\n if (s[i] == 'B') ^ (d % 2 != 0):\n d += 1\n else:\n ans *= d\n ans %= MOD\n d -= 1\nif d != 0:\n print(0)\n exit()\nfor i in range(1, n + 1):\n ans *= i\n ans %= MOD\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566705415", "date2": "1566705689", "bleu_score": "0.8461513037514891", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "4\nBWBBWBWX\n", "actual_output": "144\n", "expected_output": "0\n\n", "anno_code": ["\nMOD = 10**9 + 7 # (0): MOD=1000000007\nn = int(input()) # (1): n=4\ns = input() # (2): s=BWBBWBWX\nd = 1 # (3): d=1\nans = 1 # (4): ans=1\nfor i in range(1, 2 * n): # (5): i=1 (8): i=2 ... (34): NO CHANGE\n if (s[i] == 'B') ^ (d % 2 != 0): # (6): NO CHANGE (9): NO CHANGE ... (32): NO CHANGE\n d += 1 # (7): d=2 (10): d=3 (33): d=0\n else:\n ans *= max(1, d) # (13): ans=3 (18): ans=6 ... (28): NO CHANGE\n ans %= MOD # (14): NO CHANGE (19): NO CHANGE ... (29): NO CHANGE\n d -= 1 # (15): d=2 (20): d=1 ... (30): d=-1\nif d != 0 or s[0] == 'W' or s[-1] == 'W': # (35): NO CHANGE\n print(0)\n exit()\nfor i in range(1, n + 1): # (36): i=1 (39): i=2 ... (48): NO CHANGE\n ans *= i # (37): NO CHANGE (40): ans=12 ... (46): ans=144\n ans %= MOD # (38): NO CHANGE (41): NO CHANGE ... (47): NO CHANGE\nprint(ans)\n"], "anno_status": [true], "diff_content": " \n MOD = 10**9 + 7\n n = int(input())\n s = input()\n-d = 1\n+d = 0\n ans = 1\n-for i in range(1, 2 * n):\n+for i in range(2 * n):\n if (s[i] == 'B') ^ (d % 2 != 0):\n d += 1\n else:\n- ans *= max(1, d)\n+ ans *= d\n ans %= MOD\n d -= 1\n-if d != 0 or s[0] == 'W' or s[-1] == 'W':\n+if d != 0:\n print(0)\n exit()\n for i in range(1, n + 1):\n ans *= i\n ans %= MOD\n print(ans)\n \n", "FL_content": " \n MOD = 10**9 + 7\n n = int(input())\n s = input()\n-d = 1\n ans = 1\n-for i in range(1, 2 * n):\n if (s[i] == 'B') ^ (d % 2 != 0):\n d += 1\n else:\n- ans *= max(1, d)\n ans %= MOD\n d -= 1\n-if d != 0 or s[0] == 'W' or s[-1] == 'W':\n print(0)\n exit()\n for i in range(1, n + 1):\n ans *= i\n ans %= MOD\n print(ans)\n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 21 }, { "user_id": "u508486691", "problem_id": "p02929", "submission1_id": "s174148823", "submission2_id": "s426173482", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nimport math\nfrom collections import defaultdict\n\n\nsys.setrecursionlimit(10**7)\ndef input():\n return sys.stdin.readline()[:-1]\n\n\nmod = 10**9 + 7\n\n\ndef I(): return int(input())\ndef II(): return map(int, input().split())\ndef III(): return list(map(int, input().split()))\ndef Line(N):\n read_all = [tuple(map(int, input().split())) for _ in range(N)]\n return map(list,zip(*read_all))\n\n\n\ndef fact(a,M=mod):\n ans = 1\n for i in range(2,a+1):\n ans = ans*i\n ans = ans%M\n return ans\n\nN = I()\nS = str(input())\n\nif S[0]=='W':\n print(0)\n exit()\n\nd = ['L']*(2*N)\nfor i in range(1,2*N):\n if S[i]!=S[i-1]:\n d[i]=d[i-1]\n else:\n if d[i-1]=='L':\n d[i] = 'R'\n else:\n d[i] = 'L'\n\ntemp = 0\nx = [0]*(2*N)\nfor i in range(2*N):\n if d[i]=='L':\n temp += 1\n else:\n x[i] = temp\n\nans = 1\nrnum = 0\nfor i in range(2*N):\n if d[i]=='R':\n ans *= x[i]-rnum\n ans %= mod\n rnum += 1\n\nans *= fact(N)\nans %= mod\n\nprint(ans)", "code2": "\nimport sys\nimport math\nfrom collections import defaultdict\n\n\nsys.setrecursionlimit(10**7)\ndef input():\n return sys.stdin.readline()[:-1]\n\n\nmod = 10**9 + 7\n\n\ndef I(): return int(input())\ndef II(): return map(int, input().split())\ndef III(): return list(map(int, input().split()))\ndef Line(N):\n read_all = [tuple(map(int, input().split())) for _ in range(N)]\n return map(list,zip(*read_all))\n\n\n\ndef fact(a,M=mod):\n ans = 1\n for i in range(2,a+1):\n ans = ans*i\n ans = ans%M\n return ans\n\nN = I()\nS = str(input())\n\nif S[0]=='W':\n print(0)\n exit()\n\nif S[2*N-1]=='W':\n print(0)\n exit()\n\nd = ['L']*(2*N)\n\nfor i in range(1,2*N):\n if S[i]!=S[i-1]:\n d[i]=d[i-1]\n else:\n if d[i-1]=='L':\n d[i] = 'R'\n else:\n d[i] = 'L'\n\nnr = 0\nnl = 0\nfor i in range(2*N):\n if d[i]=='L':\n nl += 1\n else:\n nr += 1\nif nl != nr:\n print(0)\n exit()\n\n\n\ntemp = 0\nx = [0]*(2*N)\nfor i in range(2*N):\n if d[i]=='L':\n temp += 1\n else:\n x[i] = temp\n\nans = 1\nrnum = 0\nfor i in range(2*N):\n if d[i]=='R':\n ans *= x[i]-rnum\n ans %= mod\n rnum += 1\n\nans *= fact(N)\nans %= mod\n\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1566701916", "date2": "1566702142", "bleu_score": "0.8501854936139095", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 101, "total_score": 103, "input": "4\nBWABWCWW\n", "actual_output": "168\n", "expected_output": "0\n\n", "anno_code": ["\nimport sys\nimport math\nfrom collections import defaultdict\n\n\nsys.setrecursionlimit(10**7) # (0): NO CHANGE\ndef input(): # (1): input=\n return sys.stdin.readline()[:-1]\n\n\nmod = 10**9 + 7 # (2): mod=1000000007, I=, II=, III=\n\n\ndef I(): return int(input())\ndef II(): return map(int, input().split())\ndef III(): return list(map(int, input().split()))\ndef Line(N): # (3): Line=\n read_all = [tuple(map(int, input().split())) for _ in range(N)]\n return map(list,zip(*read_all))\n\n\n\ndef fact(a,M=mod): # (4): fact=\n ans = 1 # (82): ans=1\n for i in range(2,a+1): # (83): i=2 (86): i=3 ... (92): sys=, math=, defaultdict=, input=, mod=1000000007, I=, II=, III=, Line=, fact=, N=4, S=BWABWCWW, d=['L', 'L', 'L', 'L', 'L', 'L', 'L', 'R'], i=7, temp=7, x=[0, 0, 0, 0, 0, 0, 0, 7], ans=168, rnum=1\n ans = ans*i # (84): ans=2 (87): ans=6 (90): ans=24\n ans = ans%M # (85): NO CHANGE (88): NO CHANGE (91): NO CHANGE\n return ans\n\nN = I() # (5): N=4\nS = str(input()) # (6): S=BWABWCWW\n\nif S[0]=='W': # (7): NO CHANGE\n print(0)\n exit()\n\nd = ['L']*(2*N) # (8): d=['L', 'L', 'L', 'L', 'L', 'L', 'L', 'L']\nfor i in range(1,2*N): # (9): i=1 (12): i=2 ... (31): NO CHANGE\n if S[i]!=S[i-1]: # (10): NO CHANGE (13): NO CHANGE ... (28): NO CHANGE\n d[i]=d[i-1] # (11): NO CHANGE (14): NO CHANGE ... (26): NO CHANGE\n else:\n if d[i-1]=='L': # (29): NO CHANGE\n d[i] = 'R' # (30): d=['L', 'L', 'L', 'L', 'L', 'L', 'L', 'R']\n else:\n d[i] = 'L'\n\ntemp = 0 # (32): temp=0\nx = [0]*(2*N) # (33): x=[0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(2*N): # (34): i=0 (37): i=1 ... (58): NO CHANGE\n if d[i]=='L': # (35): NO CHANGE (38): NO CHANGE ... (56): NO CHANGE\n temp += 1 # (36): temp=1 (39): temp=2 ... (54): temp=7\n else:\n x[i] = temp # (57): x=[0, 0, 0, 0, 0, 0, 0, 7]\n\nans = 1 # (59): ans=1\nrnum = 0 # (60): rnum=0\nfor i in range(2*N): # (61): i=0 (63): i=1 ... (80): NO CHANGE\n if d[i]=='R': # (62): NO CHANGE (64): NO CHANGE ... (76): NO CHANGE\n ans *= x[i]-rnum # (77): ans=7\n ans %= mod # (78): NO CHANGE\n rnum += 1 # (79): rnum=1\n\nans *= fact(N) # (81): a=4, M=1000000007\nans %= mod # (93): NO CHANGE\n\nprint(ans)"], "anno_status": [false], "diff_content": " \n import sys\n import math\n from collections import defaultdict\n \n \n sys.setrecursionlimit(10**7)\n def input():\n return sys.stdin.readline()[:-1]\n \n \n mod = 10**9 + 7\n \n \n def I(): return int(input())\n def II(): return map(int, input().split())\n def III(): return list(map(int, input().split()))\n def Line(N):\n read_all = [tuple(map(int, input().split())) for _ in range(N)]\n return map(list,zip(*read_all))\n \n \n \n def fact(a,M=mod):\n ans = 1\n for i in range(2,a+1):\n ans = ans*i\n ans = ans%M\n return ans\n \n N = I()\n S = str(input())\n \n if S[0]=='W':\n print(0)\n exit()\n \n+if S[2*N-1]=='W':\n+ print(0)\n+ exit()\n+\n d = ['L']*(2*N)\n+\n for i in range(1,2*N):\n if S[i]!=S[i-1]:\n d[i]=d[i-1]\n else:\n if d[i-1]=='L':\n d[i] = 'R'\n else:\n d[i] = 'L'\n \n+nr = 0\n+nl = 0\n+for i in range(2*N):\n+ if d[i]=='L':\n+ nl += 1\n+ else:\n+ nr += 1\n+if nl != nr:\n+ print(0)\n+ exit()\n+\n+\n+\n temp = 0\n x = [0]*(2*N)\n for i in range(2*N):\n if d[i]=='L':\n temp += 1\n else:\n x[i] = temp\n \n ans = 1\n rnum = 0\n for i in range(2*N):\n if d[i]=='R':\n ans *= x[i]-rnum\n ans %= mod\n rnum += 1\n \n ans *= fact(N)\n ans %= mod\n \n print(ans)\n", "FL_content": " \n import sys\n import math\n from collections import defaultdict\n \n \n sys.setrecursionlimit(10**7)\n def input():\n return sys.stdin.readline()[:-1]\n \n \n mod = 10**9 + 7\n \n \n def I(): return int(input())\n def II(): return map(int, input().split())\n def III(): return list(map(int, input().split()))\n def Line(N):\n read_all = [tuple(map(int, input().split())) for _ in range(N)]\n return map(list,zip(*read_all))\n \n \n \n def fact(a,M=mod):\n ans = 1\n for i in range(2,a+1):\n ans = ans*i\n ans = ans%M\n return ans\n \n N = I()\n S = str(input())\n \n if S[0]=='W':\n print(0)\n exit()\n \n d = ['L']*(2*N)\n for i in range(1,2*N):\n if S[i]!=S[i-1]:\n d[i]=d[i-1]\n else:\n if d[i-1]=='L':\n d[i] = 'R'\n else:\n d[i] = 'L'\n \n temp = 0\n x = [0]*(2*N)\n for i in range(2*N):\n if d[i]=='L':\n temp += 1\n else:\n x[i] = temp\n \n ans = 1\n rnum = 0\n for i in range(2*N):\n if d[i]=='R':\n ans *= x[i]-rnum\n ans %= mod\n rnum += 1\n \n ans *= fact(N)\n ans %= mod\n \n print(ans)\n", "added_lines": 18, "removed_lines": 0, "code1_lines": 67 }, { "user_id": "u970899068", "problem_id": "p02929", "submission1_id": "s635520159", "submission2_id": "s236697245", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nn=int(input())\ns=list(input())\n\nfor i in range(0,2*n,2):\n if s[i]=='W':\n s[i]='B'\n else:\n s[i]='W'\n\n\ncountL=0\nans=1\nfor i in range(2*n):\n if s[i]=='W':\n countL+=1\n else:\n ans*=countL\n if countL==0:\n print(0)\n exit()\n countL-=1\n\n\nx=math.factorial(n)\nx=x%(10**9+7)\nans=ans%(10**9+7)\nprint((ans*x)%(10**9+7))\n\n\n", "code2": "mod=10**9+7\nn=int(input())\ns=list(input())\n\nfor i in range(0,2*n,2):\n if s[i]=='W':\n s[i]='B'\n else:\n s[i]='W'\n\n\ncountL=0\nans=1\nfor i in range(2*n):\n if s[i]=='W':\n countL+=1\n else:\n ans*=countL\n if countL==0:\n print(0)\n exit()\n ans%=mod\n countL-=1\nif countL!=0:\n print(0)\n exit()\n\nfor i in range(1,n+1):\n ans*=i\n ans%=mod\nprint(ans)\n\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1566739252", "date2": "1566741655", "bleu_score": "0.7781721913992556", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 101, "total_score": 103, "input": "4\nBBAWVCWW\n", "actual_output": "144\n", "expected_output": "0\n\n", "anno_code": ["import math\n\nn=int(input()) # (0): n=4\ns=list(input()) # (1): s=['B', 'B', 'A', 'W', 'V', 'C', 'W', 'W']\n\nfor i in range(0,2*n,2): # (2): i=0 (5): i=2 ... (14): NO CHANGE\n if s[i]=='W': # (3): NO CHANGE (6): NO CHANGE ... (12): NO CHANGE\n s[i]='B' # (13): s=['W', 'B', 'W', 'W', 'W', 'C', 'B', 'W']\n else:\n s[i]='W' # (4): s=['W', 'B', 'A', 'W', 'V', 'C', 'W', 'W'] (7): s=['W', 'B', 'W', 'W', 'V', 'C', 'W', 'W'] (10): s=['W', 'B', 'W', 'W', 'W', 'C', 'W', 'W']\n\n\ncountL=0 # (15): countL=0\nans=1 # (16): ans=1\nfor i in range(2*n): # (17): i=0 (20): i=1 ... (47): NO CHANGE\n if s[i]=='W': # (18): NO CHANGE (21): NO CHANGE ... (45): NO CHANGE\n countL+=1 # (19): countL=1 (27): countL=1 ... (46): countL=2\n else:\n ans*=countL # (22): NO CHANGE (36): ans=3 (41): ans=6\n if countL==0: # (23): NO CHANGE (37): NO CHANGE (42): NO CHANGE\n print(0)\n exit()\n countL-=1 # (24): countL=0 (38): countL=2 (43): countL=1\n\n\nx=math.factorial(n) # (48): x=24\nx=x%(10**9+7) # (49): NO CHANGE\nans=ans%(10**9+7) # (50): NO CHANGE\nprint((ans*x)%(10**9+7))\n\n\n"], "anno_status": [true], "diff_content": "-import math\n-\n+mod=10**9+7\n n=int(input())\n s=list(input())\n \n for i in range(0,2*n,2):\n if s[i]=='W':\n s[i]='B'\n else:\n s[i]='W'\n \n \n countL=0\n ans=1\n for i in range(2*n):\n if s[i]=='W':\n countL+=1\n else:\n ans*=countL\n if countL==0:\n print(0)\n exit()\n+ ans%=mod\n countL-=1\n-\n-\n-x=math.factorial(n)\n-x=x%(10**9+7)\n-ans=ans%(10**9+7)\n-print((ans*x)%(10**9+7))\n+if countL!=0:\n+ print(0)\n+ exit()\n+\n+for i in range(1,n+1):\n+ ans*=i\n+ ans%=mod\n+print(ans)\n \n \n \n", "FL_content": "-import math\n-\n n=int(input())\n s=list(input())\n \n for i in range(0,2*n,2):\n if s[i]=='W':\n s[i]='B'\n else:\n s[i]='W'\n \n \n countL=0\n ans=1\n for i in range(2*n):\n if s[i]=='W':\n countL+=1\n else:\n ans*=countL\n if countL==0:\n print(0)\n exit()\n countL-=1\n-\n-\n-x=math.factorial(n)\n-x=x%(10**9+7)\n-ans=ans%(10**9+7)\n-print((ans*x)%(10**9+7))\n \n \n \n", "added_lines": 10, "removed_lines": 8, "code1_lines": 32 }, { "user_id": "u201234972", "problem_id": "p02929", "submission1_id": "s188524703", "submission2_id": "s579181870", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nQ = 10**9+7\ndef main():\n N = int( input())\n S = input()\n left = 0\n ans = 1\n for s in S:\n if s == \"B\":\n if left%2 == 0:\n left += 1\n else:\n if left == 0:\n print(0)\n return\n ans *= left\n left -= 1\n else:\n if left%2 == 1:\n left += 1\n else:\n if left == 0:\n print(0)\n return\n ans *= left\n left -= 1\n ans %= Q\n if left > 0:\n print(0)\n return\n for i in range(1,N+1):\n ans *= i\n ans %= Q\n print(ans)\nif __name__ == '__main__':\n main()\n", "code2": "import sys\ninput = sys.stdin.readline\nQ = 10**9+7\ndef main():\n N = int( input())\n S = input()\n left = 0\n ans = 1\n for i in range(N*2):\n s = S[i]\n if s == \"B\":\n if left%2 == 0:\n left += 1\n else:\n ans *= left\n left -= 1\n else:\n if left%2 == 1:\n left += 1\n else:\n ans *= left\n left -= 1\n ans %= Q\n if left > 0 or ans == 0:\n print(0)\n return\n for i in range(1,N+1):\n ans *= i\n ans %= Q\n print(ans)\nif __name__ == '__main__':\n main()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566778058", "date2": "1566779058", "bleu_score": "0.7782359413163759", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1], "code1_test_score": 100, "total_score": 103, "input": "2\nBWWB\n", "actual_output": "0\n", "expected_output": "4\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\nQ = 10**9+7 # (1): Q=1000000007\ndef main(): # (2): main=\n N = int( input())\n S = input()\n left = 0\n ans = 1\n for s in S:\n if s == \"B\":\n if left%2 == 0:\n left += 1\n else:\n if left == 0:\n print(0)\n return\n ans *= left\n left -= 1\n else:\n if left%2 == 1:\n left += 1\n else:\n if left == 0:\n print(0)\n return\n ans *= left\n left -= 1\n ans %= Q\n if left > 0:\n print(0)\n return\n for i in range(1,N+1):\n ans *= i\n ans %= Q\n print(ans)\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n Q = 10**9+7\n def main():\n N = int( input())\n S = input()\n left = 0\n ans = 1\n- for s in S:\n+ for i in range(N*2):\n+ s = S[i]\n if s == \"B\":\n if left%2 == 0:\n left += 1\n else:\n- if left == 0:\n- print(0)\n- return\n ans *= left\n left -= 1\n else:\n if left%2 == 1:\n left += 1\n else:\n- if left == 0:\n- print(0)\n- return\n ans *= left\n left -= 1\n ans %= Q\n- if left > 0:\n+ if left > 0 or ans == 0:\n print(0)\n return\n for i in range(1,N+1):\n ans *= i\n ans %= Q\n print(ans)\n if __name__ == '__main__':\n main()\n-\n", "FL_content": " import sys\n input = sys.stdin.readline\n Q = 10**9+7\n def main():\n N = int( input())\n S = input()\n left = 0\n ans = 1\n- for s in S:\n if s == \"B\":\n if left%2 == 0:\n left += 1\n else:\n- if left == 0:\n- print(0)\n- return\n ans *= left\n left -= 1\n else:\n if left%2 == 1:\n left += 1\n else:\n- if left == 0:\n- print(0)\n- return\n ans *= left\n left -= 1\n ans %= Q\n- if left > 0:\n print(0)\n return\n for i in range(1,N+1):\n ans *= i\n ans %= Q\n print(ans)\n if __name__ == '__main__':\n main()\n-\n", "added_lines": 3, "removed_lines": 9, "code1_lines": 38 }, { "user_id": "u476604182", "problem_id": "p02929", "submission1_id": "s773674056", "submission2_id": "s432086902", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,S = open(0).read().split()\nN = int(N)\nT = []\nMOD = 10**9+7\nfor i,c in enumerate(S):\n if i%2==0:\n if c=='B':\n T.append('W')\n else:\n T.append('B')\n else:\n T.append(c)\n\npre = 0\nans = 1\nfor c in T:\n if c=='B':\n ans *= pre\n ans %= MOD\n pre -= 1\n else:\n pre += 1\ncoef = 1\nfor i in range(1,N+1):\n coef *= i\n coef %= MOD\nprint(ans*coef%MOD)", "code2": "\n\nN,S = open(0).read().split()\nN = int(N)\nT = []\nMOD = 10**9+7\nfor i,c in enumerate(S):\n if i%2==0:\n if c=='B':\n T.append('W')\n else:\n T.append('B')\n else:\n T.append(c)\n\npre = 0\nans = 1\nfor c in T:\n if c=='B':\n ans *= pre\n ans %= MOD\n pre -= 1\n flag = False\n else:\n pre += 1\nif T.count('B')!=T.count('W'):\n ans = 0\ncoef = 1\nfor i in range(1,N+1):\n coef *= i\n coef %= MOD\nprint(ans*coef%MOD)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585344255", "date2": "1585345039", "bleu_score": "0.8585477169906904", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "4\nBWBBWCWW\n", "actual_output": "288\n", "expected_output": "0\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": "+\n+\n N,S = open(0).read().split()\n N = int(N)\n T = []\n MOD = 10**9+7\n for i,c in enumerate(S):\n if i%2==0:\n if c=='B':\n T.append('W')\n else:\n T.append('B')\n else:\n T.append(c)\n \n pre = 0\n ans = 1\n for c in T:\n if c=='B':\n ans *= pre\n ans %= MOD\n pre -= 1\n+ flag = False\n else:\n pre += 1\n+if T.count('B')!=T.count('W'):\n+ ans = 0\n coef = 1\n for i in range(1,N+1):\n coef *= i\n coef %= MOD\n print(ans*coef%MOD)\n", "FL_content": " N,S = open(0).read().split()\n N = int(N)\n T = []\n MOD = 10**9+7\n for i,c in enumerate(S):\n if i%2==0:\n if c=='B':\n T.append('W')\n else:\n T.append('B')\n else:\n T.append(c)\n \n pre = 0\n ans = 1\n for c in T:\n if c=='B':\n ans *= pre\n ans %= MOD\n pre -= 1\n else:\n pre += 1\n coef = 1\n for i in range(1,N+1):\n coef *= i\n coef %= MOD\n print(ans*coef%MOD)\n", "added_lines": 5, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u375616706", "problem_id": "p02929", "submission1_id": "s629094553", "submission2_id": "s612267302", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\n\nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\n\n\nclass FactMod():\n \n\n def __init__(self, n, mod):\n \n self.mod = mod\n self.f = [1]*(n+1)\n for i in range(1, n+1):\n self.f[i] = self.f[i-1]*i % mod\n\n self.inv = [pow(self.f[-1], mod-2, mod)]\n for i in range(1, n+1)[::-1]:\n self.inv.append(self.inv[-1]*i % mod)\n self.inv.reverse()\n\n def fact(self, n):\n \n return self.f[n]\n\n def comb(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]*self.inv[r]\n ret %= self.mod\n return ret\n\n def perm(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]\n ret %= self.mod\n return ret\n\n def fact(self, n):\n return self.f[n]\n\n\nMOD = 10**9+7\nN = int(input())\nS = input()[:-1]\nF = FactMod(N+1, MOD)\n\ncnt_W = 0\ncnt = 0\nans = 1\nfor i, c in enumerate(S):\n if c == \"B\":\n tmp = 1\n else:\n tmp = 0\n if i % 2 == 0:\n tmp ^= 1\n\n if tmp == 0:\n cnt += 1\n else:\n ans *= cnt\n ans %= MOD\n cnt -= 1\n cnt_W += 1\nif cnt != N:\n ans = 0\nelse:\n ans *= F.fact(N)\n ans %= MOD\nprint(ans)\n", "code2": "from collections import Counter\n\nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\n\n\nclass FactMod():\n \n\n def __init__(self, n, mod):\n \n self.mod = mod\n self.f = [1]*(n+1)\n for i in range(1, n+1):\n self.f[i] = self.f[i-1]*i % mod\n\n self.inv = [pow(self.f[-1], mod-2, mod)]\n for i in range(1, n+1)[::-1]:\n self.inv.append(self.inv[-1]*i % mod)\n self.inv.reverse()\n\n def fact(self, n):\n \n return self.f[n]\n\n def comb(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]*self.inv[r]\n ret %= self.mod\n return ret\n\n def perm(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]\n ret %= self.mod\n return ret\n\n def fact(self, n):\n return self.f[n]\n\n\nMOD = 10**9+7\nN = int(input())\nS = input()[:-1]\nF = FactMod(N+1, MOD)\n\ncnt_W = 0\ncnt = 0\nans = 1\nfor i, c in enumerate(S):\n if c == \"B\":\n tmp = 1\n else:\n tmp = 0\n if i % 2 == 0:\n tmp ^= 1\n\n if tmp == 0:\n cnt += 1\n else:\n ans *= cnt\n ans %= MOD\n cnt -= 1\n cnt_W += 1\nif cnt_W != N:\n ans = 0\nelse:\n ans *= F.fact(N)\n ans %= MOD\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1566759274", "date2": "1566759320", "bleu_score": "0.9971566952772454", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1], "code1_test_score": 100, "total_score": 103, "input": "4\nBWWWBBWB\n", "actual_output": "0\n", "expected_output": "288\n\n", "anno_code": ["from collections import Counter\n\nimport sys\nsys.setrecursionlimit(10**9) # (0): NO CHANGE\ninput = sys.stdin.readline # (1): input=\n\n\nclass FactMod(): # (2): FactMod=\n \n\n def __init__(self, n, mod):\n \n self.mod = mod # (7): NO CHANGE\n self.f = [1]*(n+1) # (8): NO CHANGE\n for i in range(1, n+1): # (9): i=1 (11): i=2 ... (19): NO CHANGE\n self.f[i] = self.f[i-1]*i % mod # (10): NO CHANGE (12): NO CHANGE ... (18): NO CHANGE\n\n self.inv = [pow(self.f[-1], mod-2, mod)] # (20): NO CHANGE\n for i in range(1, n+1)[::-1]: # (21): NO CHANGE (23): i=4 ... (31): NO CHANGE\n self.inv.append(self.inv[-1]*i % mod) # (22): NO CHANGE (24): NO CHANGE ... (30): NO CHANGE\n self.inv.reverse() # (32): Counter=, sys=, input=, FactMod=, MOD=1000000007, N=4, S=BWWWBBWB, F=\n\n def fact(self, n):\n \n return self.f[n]\n\n def comb(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]*self.inv[r]\n ret %= self.mod\n return ret\n\n def perm(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]\n ret %= self.mod\n return ret\n\n def fact(self, n):\n return self.f[n]\n\n\nMOD = 10**9+7 # (3): MOD=1000000007\nN = int(input()) # (4): N=4\nS = input()[:-1] # (5): S=BWWWBBWB\nF = FactMod(N+1, MOD) # (6): self=, n=5, mod=1000000007\n\ncnt_W = 0 # (33): cnt_W=0\ncnt = 0 # (34): cnt=0\nans = 1 # (35): ans=1\nfor i, c in enumerate(S): # (36): i=0, c=B (43): i=1, c=W ... (100): NO CHANGE\n if c == \"B\": # (37): NO CHANGE (44): NO CHANGE ... (92): NO CHANGE\n tmp = 1 # (38): tmp=1 (67): tmp=1 ... (93): NO CHANGE\n else:\n tmp = 0 # (45): NO CHANGE (51): NO CHANGE ... (83): tmp=0\n if i % 2 == 0: # (39): NO CHANGE (46): NO CHANGE ... (94): NO CHANGE\n tmp ^= 1 # (40): tmp=0 (53): tmp=1 ... (85): tmp=1\n\n if tmp == 0: # (41): NO CHANGE (47): NO CHANGE ... (95): NO CHANGE\n cnt += 1 # (42): cnt=1 (48): cnt=2 ... (71): cnt=3\n else:\n ans *= cnt # (55): ans=2 (77): ans=6 ... (96): NO CHANGE\n ans %= MOD # (56): NO CHANGE (78): NO CHANGE ... (97): NO CHANGE\n cnt -= 1 # (57): cnt=1 (79): cnt=2 ... (98): cnt=0\n cnt_W += 1 # (58): cnt_W=1 (80): cnt_W=2 ... (99): cnt_W=4\nif cnt != N: # (101): NO CHANGE\n ans = 0 # (102): ans=0\nelse:\n ans *= F.fact(N)\n ans %= MOD\nprint(ans)\n"], "anno_status": [false], "diff_content": " from collections import Counter\n \n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n \n \n class FactMod():\n \n \n def __init__(self, n, mod):\n \n self.mod = mod\n self.f = [1]*(n+1)\n for i in range(1, n+1):\n self.f[i] = self.f[i-1]*i % mod\n \n self.inv = [pow(self.f[-1], mod-2, mod)]\n for i in range(1, n+1)[::-1]:\n self.inv.append(self.inv[-1]*i % mod)\n self.inv.reverse()\n \n def fact(self, n):\n \n return self.f[n]\n \n def comb(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]*self.inv[r]\n ret %= self.mod\n return ret\n \n def perm(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]\n ret %= self.mod\n return ret\n \n def fact(self, n):\n return self.f[n]\n \n \n MOD = 10**9+7\n N = int(input())\n S = input()[:-1]\n F = FactMod(N+1, MOD)\n \n cnt_W = 0\n cnt = 0\n ans = 1\n for i, c in enumerate(S):\n if c == \"B\":\n tmp = 1\n else:\n tmp = 0\n if i % 2 == 0:\n tmp ^= 1\n \n if tmp == 0:\n cnt += 1\n else:\n ans *= cnt\n ans %= MOD\n cnt -= 1\n cnt_W += 1\n-if cnt != N:\n+if cnt_W != N:\n ans = 0\n else:\n ans *= F.fact(N)\n ans %= MOD\n print(ans)\n \n", "FL_content": " from collections import Counter\n \n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n \n \n class FactMod():\n \n \n def __init__(self, n, mod):\n \n self.mod = mod\n self.f = [1]*(n+1)\n for i in range(1, n+1):\n self.f[i] = self.f[i-1]*i % mod\n \n self.inv = [pow(self.f[-1], mod-2, mod)]\n for i in range(1, n+1)[::-1]:\n self.inv.append(self.inv[-1]*i % mod)\n self.inv.reverse()\n \n def fact(self, n):\n \n return self.f[n]\n \n def comb(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]*self.inv[r]\n ret %= self.mod\n return ret\n \n def perm(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]\n ret %= self.mod\n return ret\n \n def fact(self, n):\n return self.f[n]\n \n \n MOD = 10**9+7\n N = int(input())\n S = input()[:-1]\n F = FactMod(N+1, MOD)\n \n cnt_W = 0\n cnt = 0\n ans = 1\n for i, c in enumerate(S):\n if c == \"B\":\n tmp = 1\n else:\n tmp = 0\n if i % 2 == 0:\n tmp ^= 1\n \n if tmp == 0:\n cnt += 1\n else:\n ans *= cnt\n ans %= MOD\n cnt -= 1\n cnt_W += 1\n-if cnt != N:\n ans = 0\n else:\n ans *= F.fact(N)\n ans %= MOD\n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 72 }, { "user_id": "u790710233", "problem_id": "p02929", "submission1_id": "s283463193", "submission2_id": "s361945382", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import factorial\n\nn = int(input())\ns = input()\n\n\nMOD = 10**9+7\n\n\nlr = ''\nfor i, x in enumerate(s):\n if i % 2 == 0:\n if x == 'B':\n lr += 'L'\n else:\n lr += 'R'\n else:\n if x == 'B':\n lr += 'R'\n else:\n lr += 'L'\n\ncnt = 0\npoint = 1\nfor x in lr:\n if x == 'L':\n cnt += 1\n else:\n point *= cnt\n cnt -= 1\n\n\nprint(point*factorial(n) % MOD)", "code2": "import sys\ninput = sys.stdin.readline\nsys.setrecursionlimit(10**7)\n\n\nn = int(input())\ns = input().rstrip()\nMOD = 10**9+7\n\ncnt = 0\npoint = 1\nfor i, x in enumerate(s):\n if (x == 'B' and i % 2 == 0) or (x == 'W' and i % 2 != 0):\n cnt += 1\n else:\n point *= cnt\n cnt -= 1\n point %= MOD\n\n\nif cnt != 0:\n print(0)\nelse:\n \n for x in range(1, n+1):\n point *= x\n point %= MOD\n\n print(point)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566780085", "date2": "1566783534", "bleu_score": "0.6193220892540849", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "4\nBWBBWCWW\n", "actual_output": "288\n", "expected_output": "0\n\n", "anno_code": ["from math import factorial\n\nn = int(input()) # (0): n=4\ns = input() # (1): s=BWBBWCWW\n\n\nMOD = 10**9+7 # (2): MOD=1000000007\n\n\nlr = '' # (3): lr=\nfor i, x in enumerate(s): # (4): i=0, x=B (8): i=1, x=W ... (36): NO CHANGE\n if i % 2 == 0: # (5): NO CHANGE (9): NO CHANGE ... (33): NO CHANGE\n if x == 'B': # (6): NO CHANGE (14): NO CHANGE ... (30): NO CHANGE\n lr += 'L' # (7): lr=L (15): lr=LLL\n else:\n lr += 'R' # (23): lr=LLLRR (31): lr=LLLRRLR\n else:\n if x == 'B': # (10): NO CHANGE (18): NO CHANGE ... (34): NO CHANGE\n lr += 'R' # (19): lr=LLLR\n else:\n lr += 'L' # (11): lr=LL (27): lr=LLLRRL (35): lr=LLLRRLRL\n\ncnt = 0 # (37): cnt=0\npoint = 1 # (38): point=1\nfor x in lr: # (39): x=L (42): NO CHANGE ... (66): NO CHANGE\n if x == 'L': # (40): NO CHANGE (43): NO CHANGE ... (64): NO CHANGE\n cnt += 1 # (41): cnt=1 (44): cnt=2 ... (65): cnt=2\n else:\n point *= cnt # (50): point=3 (54): point=6 (61): point=12\n cnt -= 1 # (51): cnt=2 (55): cnt=1 (62): cnt=1\n\n\nprint(point*factorial(n) % MOD)"], "anno_status": [true], "diff_content": "-from math import factorial\n-\n-n = int(input())\n-s = input()\n+import sys\n+input = sys.stdin.readline\n+sys.setrecursionlimit(10**7)\n \n \n+n = int(input())\n+s = input().rstrip()\n MOD = 10**9+7\n \n-\n-lr = ''\n-for i, x in enumerate(s):\n- if i % 2 == 0:\n- if x == 'B':\n- lr += 'L'\n- else:\n- lr += 'R'\n- else:\n- if x == 'B':\n- lr += 'R'\n- else:\n- lr += 'L'\n-\n cnt = 0\n point = 1\n-for x in lr:\n- if x == 'L':\n+for i, x in enumerate(s):\n+ if (x == 'B' and i % 2 == 0) or (x == 'W' and i % 2 != 0):\n cnt += 1\n else:\n point *= cnt\n cnt -= 1\n+ point %= MOD\n+\n \n+if cnt != 0:\n+ print(0)\n+else:\n+ \n+ for x in range(1, n+1):\n+ point *= x\n+ point %= MOD\n \n-print(point*factorial(n) % MOD)\n+ print(point)\n", "FL_content": "-from math import factorial\n-\n-n = int(input())\n-s = input()\n \n \n MOD = 10**9+7\n \n-\n-lr = ''\n-for i, x in enumerate(s):\n- if i % 2 == 0:\n- if x == 'B':\n- lr += 'L'\n- else:\n- lr += 'R'\n- else:\n- if x == 'B':\n- lr += 'R'\n- else:\n- lr += 'L'\n-\n cnt = 0\n point = 1\n-for x in lr:\n- if x == 'L':\n cnt += 1\n else:\n point *= cnt\n cnt -= 1\n \n \n-print(point*factorial(n) % MOD)\n", "added_lines": 17, "removed_lines": 21, "code1_lines": 33 }, { "user_id": "u187516587", "problem_id": "p02929", "submission1_id": "s554722719", "submission2_id": "s975599160", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nS=input()\nl=0\na=1\nfor i in range(2*N):\n if S[i]==\"W\":\n if l%2==0:\n a=a*l%(10**9+7)\n l-=1\n else:\n l+=1\n else:\n if l%2==0:\n l+=1\n else:\n a=a*l%(10**9+7)\n l-=1\nif l!=1:\n a=0\nfor i in range(1,N+1):\n a=a*i%(10**9+7)\nprint(a)", "code2": "N=int(input())\nS=input()\nl=0\na=1\nfor i in range(2*N):\n if S[i]==\"W\":\n if l%2==0:\n a=a*l%(10**9+7)\n l-=1\n else:\n l+=1\n else:\n if l%2==0:\n l+=1\n else:\n a=a*l%(10**9+7)\n l-=1\nif l!=0:\n a=0\nfor i in range(1,N+1):\n a=a*i%(10**9+7)\nprint(a)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1566700375", "date2": "1566700443", "bleu_score": "0.9925979086008202", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1], "code1_test_score": 100, "total_score": 103, "input": "4\nBWWWBBWB\n", "actual_output": "0\n", "expected_output": "288\n\n", "anno_code": ["N=int(input()) # (0): N=4\nS=input() # (1): S=BWWWBBWB\nl=0 # (2): l=0\na=1 # (3): a=1\nfor i in range(2*N): # (4): i=0 (8): i=1 ... (40): NO CHANGE\n if S[i]==\"W\": # (5): NO CHANGE (9): NO CHANGE ... (36): NO CHANGE\n if l%2==0: # (10): NO CHANGE (14): NO CHANGE ... (32): NO CHANGE\n a=a*l%(10**9+7) # (15): a=2 (33): a=12\n l-=1 # (16): l=1 (34): l=1\n else:\n l+=1 # (11): l=2 (20): l=2\n else:\n if l%2==0: # (6): NO CHANGE (23): NO CHANGE ... (37): NO CHANGE\n l+=1 # (7): l=1 (24): l=3\n else:\n a=a*l%(10**9+7) # (28): a=6 (38): NO CHANGE\n l-=1 # (29): l=2 (39): l=0\nif l!=1: # (41): NO CHANGE\n a=0 # (42): a=0\nfor i in range(1,N+1): # (43): i=1 (45): i=2 ... (51): NO CHANGE\n a=a*i%(10**9+7) # (44): NO CHANGE (46): NO CHANGE ... (50): NO CHANGE\nprint(a)"], "anno_status": [true], "diff_content": " N=int(input())\n S=input()\n l=0\n a=1\n for i in range(2*N):\n if S[i]==\"W\":\n if l%2==0:\n a=a*l%(10**9+7)\n l-=1\n else:\n l+=1\n else:\n if l%2==0:\n l+=1\n else:\n a=a*l%(10**9+7)\n l-=1\n-if l!=1:\n+if l!=0:\n a=0\n for i in range(1,N+1):\n a=a*i%(10**9+7)\n print(a)\n", "FL_content": " N=int(input())\n S=input()\n l=0\n a=1\n for i in range(2*N):\n if S[i]==\"W\":\n if l%2==0:\n a=a*l%(10**9+7)\n l-=1\n else:\n l+=1\n else:\n if l%2==0:\n l+=1\n else:\n a=a*l%(10**9+7)\n l-=1\n-if l!=1:\n a=0\n for i in range(1,N+1):\n a=a*i%(10**9+7)\n print(a)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 22 }, { "user_id": "u761320129", "problem_id": "p03977", "submission1_id": "s606118522", "submission2_id": "s923840070", "status1": "Wrong Answer", "status2": "Accepted", "code1": "T = int(input())\nts = [tuple(map(int,input().split())) for i in range(T)]\n\ndef solve(n,d):\n if n%2:\n return d + 127*(n-1)\n else:\n return d^127 + 127*(n-1)\n\nfor n,d in ts:\n print(solve(n,d))", "code2": "T = int(input())\nts = [tuple(map(int,input().split())) for i in range(T)]\n\ndef solve(n,d):\n if n%2:\n return d + 127*(n-1)\n else:\n return 127*n - d\n\nfor n,d in ts:\n print(solve(n,d))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1542050710", "date2": "1542051165", "bleu_score": "0.9339702645326505", "code1_test_status": [1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 43, "total_score": 101, "input": "3\n1 3\n6 25\n1 9\n", "actual_output": "3\n739\n9\n", "expected_output": "3\n737\n9\n\n", "anno_code": ["T = int(input()) # (0): T=3\nts = [tuple(map(int,input().split())) for i in range(T)] # (1): ts=[(1, 3), (6, 25), (1, 9)]\n\ndef solve(n,d): # (2): solve=\n if n%2: # (5): T=3, ts=[(1, 3), (6, 25), (1, 9)], solve= (8): T=3, ts=[(1, 3), (6, 25), (1, 9)], solve= (11): T=3, ts=[(1, 3), (6, 25), (1, 9)], solve=\n return d + 127*(n-1)\n else:\n return d^127 + 127*(n-1)\n\nfor n,d in ts: # (3): n=1, d=3 (6): n=6, d=25 (9): n=1, d=9\n print(solve(n,d)) # (4): NO CHANGE (7): NO CHANGE (10): NO CHANGE\n"], "anno_status": [true], "diff_content": " T = int(input())\n ts = [tuple(map(int,input().split())) for i in range(T)]\n \n def solve(n,d):\n if n%2:\n return d + 127*(n-1)\n else:\n- return d^127 + 127*(n-1)\n+ return 127*n - d\n \n for n,d in ts:\n print(solve(n,d))\n", "FL_content": " T = int(input())\n ts = [tuple(map(int,input().split())) for i in range(T)]\n \n def solve(n,d):\n if n%2:\n return d + 127*(n-1)\n else:\n- return d^127 + 127*(n-1)\n \n for n,d in ts:\n print(solve(n,d))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u761320129", "problem_id": "p03977", "submission1_id": "s605085284", "submission2_id": "s923840070", "status1": "Wrong Answer", "status2": "Accepted", "code1": "T = int(input())\nts = [tuple(map(int,input().split())) for i in range(T)]\n\ndef solve(n,d):\n if n%2:\n return d + 127*(n-1)\n else:\n tmp = 0\n for a in range(128):\n tmp = max(tmp, a + a^d)\n return tmp - d + 127*(n-2)\n\nfor n,d in ts:\n print(solve(n,d))", "code2": "T = int(input())\nts = [tuple(map(int,input().split())) for i in range(T)]\n\ndef solve(n,d):\n if n%2:\n return d + 127*(n-1)\n else:\n return 127*n - d\n\nfor n,d in ts:\n print(solve(n,d))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1542050225", "date2": "1542051165", "bleu_score": "0.6265389456892313", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1], "code1_test_score": 64, "total_score": 101, "input": "3\n3 1\n4 37\n1 2\n", "actual_output": "255\n472\n2\n", "expected_output": "255\n471\n2\n\n", "anno_code": ["T = int(input()) # (0): T=3\nts = [tuple(map(int,input().split())) for i in range(T)] # (1): ts=[(3, 1), (4, 37), (1, 2)]\n\ndef solve(n,d): # (2): solve=\n if n%2: # (5): T=3, ts=[(3, 1), (4, 37), (1, 2)], solve= (8): NO CHANGE (269): T=3, ts=[(3, 1), (4, 37), (1, 2)], solve=\n return d + 127*(n-1)\n else:\n tmp = 0 # (9): tmp=0\n for a in range(128): # (10): a=0 (12): a=1 ... (266): T=3, ts=[(3, 1), (4, 37), (1, 2)], solve=\n tmp = max(tmp, a + a^d) # (11): tmp=37 (13): tmp=39 ... (265): NO CHANGE\n return tmp - d + 127*(n-2)\n\nfor n,d in ts: # (3): n=3, d=1 (6): n=4, d=37 (267): n=1, d=2\n print(solve(n,d)) # (4): NO CHANGE (7): NO CHANGE (268): NO CHANGE\n"], "anno_status": [true], "diff_content": " T = int(input())\n ts = [tuple(map(int,input().split())) for i in range(T)]\n \n def solve(n,d):\n if n%2:\n return d + 127*(n-1)\n else:\n- tmp = 0\n- for a in range(128):\n- tmp = max(tmp, a + a^d)\n- return tmp - d + 127*(n-2)\n+ return 127*n - d\n \n for n,d in ts:\n print(solve(n,d))\n", "FL_content": " T = int(input())\n ts = [tuple(map(int,input().split())) for i in range(T)]\n \n def solve(n,d):\n if n%2:\n return d + 127*(n-1)\n else:\n- tmp = 0\n- for a in range(128):\n- tmp = max(tmp, a + a^d)\n- return tmp - d + 127*(n-2)\n \n for n,d in ts:\n print(solve(n,d))\n", "added_lines": 1, "removed_lines": 4, "code1_lines": 14 }, { "user_id": "u873915460", "problem_id": "p03977", "submission1_id": "s779777420", "submission2_id": "s977051737", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,T=0,0\nfor i in range(int(input())):\n N,T=map(int,input().split())\n if N&1:\n T^=127\n print(T+(N-1)*127)", "code2": "N,T=0,0\nfor i in range(int(input())):\n N,T=map(int,input().split())\n if N&1==0:\n T^=127\n print(T+(N-1)*127)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1596121315", "date2": "1596121329", "bleu_score": "0.9594798946546479", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3\n1 2\n5 50\n1 11\n", "actual_output": "125\n585\n116\n", "expected_output": "2\n558\n11\n\n", "anno_code": ["N,T=0,0 # (0): N=0, T=0\nfor i in range(int(input())): # (1): i=0 (6): i=1 (11): i=2\n N,T=map(int,input().split()) # (2): N=1, T=2 (7): N=5, T=50 (12): N=1, T=11\n if N&1: # (3): NO CHANGE (8): NO CHANGE (13): NO CHANGE\n T^=127 # (4): T=125 (9): T=77 (14): T=116\n print(T+(N-1)*127) # (5): NO CHANGE (10): NO CHANGE (15): NO CHANGE\n"], "anno_status": [true], "diff_content": " N,T=0,0\n for i in range(int(input())):\n N,T=map(int,input().split())\n- if N&1:\n+ if N&1==0:\n T^=127\n print(T+(N-1)*127)\n", "FL_content": " N,T=0,0\n for i in range(int(input())):\n N,T=map(int,input().split())\n- if N&1:\n T^=127\n print(T+(N-1)*127)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 6 }, { "user_id": "u356832650", "problem_id": "p03977", "submission1_id": "s858391916", "submission2_id": "s144717245", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from heapq import heappush, heappop\nT = int(input())\n\nfor i in range(T):\n N, D = map(int, input().split())\n ans = D\n h = []\n heappush(h,D)\n for _ in range(N - 1):\n k = heappop(h)\n z = bin(k)[2:].zfill(7)\n t = int(z,2)\n heappush(h,t)\n ans += (127 + t - k)\n print(ans)\n\n", "code2": "from heapq import heappush, heappop\nT = int(input())\nA = []\nfor i in range(T):\n N, D = map(int, input().split())\n ans = D\n h = []\n heappush(h,D)\n for _ in range(N - 1):\n k = heappop(h)\n t = 127 ^ k\n heappush(h,t)\n ans += (127 + t - k)\n A.append(ans)\nfor i in range(len(A)):\n print(A[i])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1505343418", "date2": "1505357275", "bleu_score": "0.8574649645290368", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 6, "total_score": 101, "input": "3\n1 1\n6 25\n1 18\n", "actual_output": "1\n660\n18\n", "expected_output": "1\n737\n18\n\n", "anno_code": ["from heapq import heappush, heappop\nT = int(input()) # (0): T=3\n\nfor i in range(T): # (1): i=0 (8): i=1 (45): i=2\n N, D = map(int, input().split()) # (2): N=1, D=1 (9): N=6, D=25 (46): N=1, D=18\n ans = D # (3): ans=1 (10): ans=25 (47): ans=18\n h = [] # (4): h=[] (11): h=[] (48): h=[]\n heappush(h,D) # (5): h=[1] (12): h=[25] (49): h=[18]\n for _ in range(N - 1): # (6): NO CHANGE (13): _=0 ... (50): NO CHANGE\n k = heappop(h) # (14): h=[], k=25 (20): h=[] ... (38): h=[]\n z = bin(k)[2:].zfill(7) # (15): z=0011001 (21): NO CHANGE ... (39): NO CHANGE\n t = int(z,2) # (16): t=25 (22): NO CHANGE ... (40): NO CHANGE\n heappush(h,t) # (17): h=[25] (23): h=[25] ... (41): h=[25]\n ans += (127 + t - k) # (18): ans=152 (24): ans=279 ... (42): ans=660\n print(ans) # (7): NO CHANGE (44): NO CHANGE (51): NO CHANGE\n\n"], "anno_status": [true], "diff_content": " from heapq import heappush, heappop\n T = int(input())\n-\n+A = []\n for i in range(T):\n N, D = map(int, input().split())\n ans = D\n h = []\n heappush(h,D)\n for _ in range(N - 1):\n k = heappop(h)\n- z = bin(k)[2:].zfill(7)\n- t = int(z,2)\n+ t = 127 ^ k\n heappush(h,t)\n ans += (127 + t - k)\n- print(ans)\n-\n+ A.append(ans)\n+for i in range(len(A)):\n+ print(A[i])\n \n", "FL_content": " from heapq import heappush, heappop\n T = int(input())\n-\n for i in range(T):\n N, D = map(int, input().split())\n ans = D\n h = []\n heappush(h,D)\n for _ in range(N - 1):\n k = heappop(h)\n- z = bin(k)[2:].zfill(7)\n- t = int(z,2)\n heappush(h,t)\n ans += (127 + t - k)\n- print(ans)\n-\n \n", "added_lines": 5, "removed_lines": 5, "code1_lines": 17 }, { "user_id": "u471400255", "problem_id": "p00613", "submission1_id": "s164691992", "submission2_id": "s955218501", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n K = int(input())\n if K == 0:\n break\n else:\n po = [int(i) for i in input().split()]\n print(sum(po)/(K-1))", "code2": "while True:\n K = int(input())\n if K == 0:\n break\n elif K == 1:\n print(int(input()))\n else:\n po = [int(i) for i in input().split()]\n print(int(sum(po)/(K-1)))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1513676351", "date2": "1513677665", "bleu_score": "0.7442357219301391", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "2\n2\n2\n2 21 1\n0\n", "actual_output": "2.0\n24.0\n", "expected_output": "2\n24\n\n", "anno_code": ["while True: # (0): NO CHANGE (5): NO CHANGE (10): NO CHANGE\n K = int(input()) # (1): K=2 (6): NO CHANGE (11): K=0\n if K == 0: # (2): NO CHANGE (7): NO CHANGE (12): NO CHANGE\n break\n else:\n po = [int(i) for i in input().split()] # (3): po=[2] (8): po=[2, 21, 1]\n print(sum(po)/(K-1)) # (4): NO CHANGE (9): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n K = int(input())\n if K == 0:\n break\n+ elif K == 1:\n+ print(int(input()))\n else:\n po = [int(i) for i in input().split()]\n- print(sum(po)/(K-1))\n+ print(int(sum(po)/(K-1)))\n", "FL_content": " while True:\n K = int(input())\n if K == 0:\n break\n else:\n po = [int(i) for i in input().split()]\n- print(sum(po)/(K-1))\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 7 }, { "user_id": "u241923784", "problem_id": "p02345", "submission1_id": "s365723564", "submission2_id": "s414431023", "status1": "Wrong Answer", "status2": "Accepted", "code1": "M = 2147483647\na = [M for i in range(100000)]\n\ndef find(x,y,i,l,r):\n if r<=x or y<=l:return M\n if x<=l and r<=y: return a[i]\n return min(find(x,y,i*2,l,(l+r)/2),find(x,y,i*2+1,(l+r)/2,r))\n\nif __name__=='__main__':\n n, m = (int(x) for x in input().split())\n t=1\n while t= 2:\n a[int(x/2)]=j_min(a[int(x)],a[int(x)^1])\n x/=2\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556180270", "date2": "1556443722", "bleu_score": "0.8728051794823368", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 81, "total_score": 102, "input": "3 5\n0 0 1\n0 1 2\n1 0 3\n1 0 2\n1 1 4\n", "actual_output": "2147483647\n1\n2\n", "expected_output": "1\n1\n2\n\n", "anno_code": ["M = 2147483647 # (0): M=2147483647\na = [M for i in range(100000)] # (1): a=[2147483647, 2147483647, ..., 2147483647, 2147483647]\n\ndef find(x,y,i,l,r): # (2): find=\n if r<=x or y<=l:return M\n if x<=l and r<=y: return a[i]\n return min(find(x,y,i*2,l,(l+r)/2),find(x,y,i*2+1,(l+r)/2,r))\n\nif __name__=='__main__':\n n, m = (int(x) for x in input().split())\n t=1\n while t= 2:\n+ a[int(x/2)]=j_min(a[int(x)],a[int(x)^1])\n x/=2\n \n \n", "FL_content": " M = 2147483647\n-a = [M for i in range(100000)]\n \n def find(x,y,i,l,r):\n if r<=x or y<=l:return M\n if x<=l and r<=y: return a[i]\n- return min(find(x,y,i*2,l,(l+r)/2),find(x,y,i*2+1,(l+r)/2,r))\n \n if __name__=='__main__':\n n, m = (int(x) for x in input().split())\n t=1\n while t 0:\n k = int((k - 1) / 2)\n D[k] = min(D[k*2 + 1], D[k*2 + 2])\n\n\ndef findMin(a, b):\n return query(a, b + 1, 0, 0, n)\n\n\ndef query(a, b, k, l, r):\n \n if r <= a or b <= l:\n return 2147483647\n\n if a <= l and r <= b:\n return D[k]\n\n vl = query(a, b, k*2 + 1, l, int((l + r)/2))\n vr = query(a, b, k*2 + 2, int((l + r)/2), r)\n\n return min(vl, vr)\n\n\nif __name__ == '__main__':\n n, q = map(int, input().split())\n\n D = []\n n_ = initRMQ(n, D)\n\n for _ in range(q):\n \n c, x, y = map(int, input().split())\n\n if c == 0:\n update(x, y)\n\n else :\n print(findMin(x, y))\n\n", "code2": "import sys\nsys.setrecursionlimit(10000)\n\n\ndef initRMQ(n, D):\n n_ = 1\n\n while n_ < n:\n n_ *= 2\n\n for i in range(2*n_ - 1):\n D.append(2147483647)\n\n return n_\n\n\ndef update(k, a):\n k += n_ - 1\n D[k] = a\n while k > 0:\n k = int((k - 1) / 2)\n D[k] = min(D[k*2 + 1], D[k*2 + 2])\n\n\ndef findMin(a, b):\n return query(a, b + 1, 0, 0, n_)\n\n\ndef query(a, b, k, l, r):\n \n if r <= a or b <= l:\n return 2147483647\n\n if a <= l and r <= b:\n return D[k]\n\n vl = query(a, b, k*2 + 1, l, int((l + r)/2))\n vr = query(a, b, k*2 + 2, int((l + r)/2), r)\n\n return min(vl, vr)\n\n\nif __name__ == '__main__':\n n, q = map(int, input().split())\n\n D = []\n n_ = initRMQ(n, D)\n\n for _ in range(q):\n \n c, x, y = map(int, input().split())\n\n if c == 0:\n update(x, y)\n\n else :\n print(findMin(x, y))\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1524716266", "date2": "1524716533", "bleu_score": "0.997230675301244", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 76, "total_score": 102, "input": "5 5\n0 0 0\n1 2 2\n1 0 1\n0 1 9\n1 1 2\n", "actual_output": "2147483647\n0\n2147483647\n", "expected_output": "2147483647\n0\n9\n\n", "anno_code": ["import sys\nsys.setrecursionlimit(10000) # (0): NO CHANGE\n\n\ndef initRMQ(n, D): # (1): initRMQ=\n n_ = 1\n\n while n_ < n:\n n_ *= 2\n\n for i in range(2*n_ - 1):\n D.append(2147483647)\n\n return n_\n\n\ndef update(k, a): # (2): update=\n k += n_ - 1\n D[k] = a\n while k > 0:\n k = int((k - 1) / 2)\n D[k] = min(D[k*2 + 1], D[k*2 + 2])\n\n\ndef findMin(a, b): # (3): findMin=\n return query(a, b + 1, 0, 0, n)\n\n\ndef query(a, b, k, l, r): # (4): query=\n \n if r <= a or b <= l:\n return 2147483647\n\n if a <= l and r <= b:\n return D[k]\n\n vl = query(a, b, k*2 + 1, l, int((l + r)/2))\n vr = query(a, b, k*2 + 2, int((l + r)/2), r)\n\n return min(vl, vr)\n\n\nif __name__ == '__main__':\n n, q = map(int, input().split())\n\n D = []\n n_ = initRMQ(n, D)\n\n for _ in range(q):\n \n c, x, y = map(int, input().split())\n\n if c == 0:\n update(x, y)\n\n else :\n print(findMin(x, y))\n\n"], "anno_status": [true], "diff_content": " import sys\n sys.setrecursionlimit(10000)\n \n \n def initRMQ(n, D):\n n_ = 1\n \n while n_ < n:\n n_ *= 2\n \n for i in range(2*n_ - 1):\n D.append(2147483647)\n \n return n_\n \n \n def update(k, a):\n k += n_ - 1\n D[k] = a\n while k > 0:\n k = int((k - 1) / 2)\n D[k] = min(D[k*2 + 1], D[k*2 + 2])\n \n \n def findMin(a, b):\n- return query(a, b + 1, 0, 0, n)\n+ return query(a, b + 1, 0, 0, n_)\n \n \n def query(a, b, k, l, r):\n \n if r <= a or b <= l:\n return 2147483647\n \n if a <= l and r <= b:\n return D[k]\n \n vl = query(a, b, k*2 + 1, l, int((l + r)/2))\n vr = query(a, b, k*2 + 2, int((l + r)/2), r)\n \n return min(vl, vr)\n \n \n if __name__ == '__main__':\n n, q = map(int, input().split())\n \n D = []\n n_ = initRMQ(n, D)\n \n for _ in range(q):\n \n c, x, y = map(int, input().split())\n \n if c == 0:\n update(x, y)\n \n else :\n print(findMin(x, y))\n \n \n", "FL_content": " import sys\n sys.setrecursionlimit(10000)\n \n \n def initRMQ(n, D):\n n_ = 1\n \n while n_ < n:\n n_ *= 2\n \n for i in range(2*n_ - 1):\n D.append(2147483647)\n \n return n_\n \n \n def update(k, a):\n k += n_ - 1\n D[k] = a\n while k > 0:\n k = int((k - 1) / 2)\n D[k] = min(D[k*2 + 1], D[k*2 + 2])\n \n \n def findMin(a, b):\n- return query(a, b + 1, 0, 0, n)\n \n \n def query(a, b, k, l, r):\n \n if r <= a or b <= l:\n return 2147483647\n \n if a <= l and r <= b:\n return D[k]\n \n vl = query(a, b, k*2 + 1, l, int((l + r)/2))\n vr = query(a, b, k*2 + 2, int((l + r)/2), r)\n \n return min(vl, vr)\n \n \n if __name__ == '__main__':\n n, q = map(int, input().split())\n \n D = []\n n_ = initRMQ(n, D)\n \n for _ in range(q):\n \n c, x, y = map(int, input().split())\n \n if c == 0:\n update(x, y)\n \n else :\n print(findMin(x, y))\n \n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 59 }, { "user_id": "u241923784", "problem_id": "p02345", "submission1_id": "s794467276", "submission2_id": "s414431023", "status1": "Wrong Answer", "status2": "Accepted", "code1": "M = 2147483647\na = [M for i in range(100000)]\n\ndef j_min(x,y):\n if x < y:return x\n else: return y\n\ndef find(x,y,i,l,r):\n if r<=x or y<=l:return M\n if x<=l and r<=y: return a[i]\n return min(find(x,y,i*2,l,(l+r)/2),find(x,y,i*2+1,(l+r)/2,r))\n\nif __name__=='__main__':\n n, m = (int(x) for x in input().split())\n t=1\n while t= 2:\n a[int(x/2)]=j_min(a[int(x)],a[int(x)^1])\n x/=2\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556442947", "date2": "1556443722", "bleu_score": "0.9575600309135165", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 81, "total_score": 102, "input": "3 5\n1 0 1\n1 0 1\n0 2 3\n1 0 3\n1 1 4\n", "actual_output": "2147483647\n2147483647\n2147483647\n3\n", "expected_output": "2147483647\n2147483647\n3\n3\n\n", "anno_code": ["M = 2147483647 # (0): M=2147483647\na = [M for i in range(100000)] # (1): a=[2147483647, 2147483647, ..., 2147483647, 2147483647]\n\ndef j_min(x,y): # (2): j_min=\n if x < y:return x\n else: return y\n\ndef find(x,y,i,l,r): # (3): find=\n if r<=x or y<=l:return M\n if x<=l and r<=y: return a[i]\n return min(find(x,y,i*2,l,(l+r)/2),find(x,y,i*2+1,(l+r)/2,r))\n\nif __name__=='__main__':\n n, m = (int(x) for x in input().split())\n t=1\n while t= 2:\n a[int(x/2)]=j_min(a[int(x)],a[int(x)^1])\n x/=2\n \n \n", "FL_content": " M = 2147483647\n-a = [M for i in range(100000)]\n \n def j_min(x,y):\n if x < y:return x\n else: return y\n \n def find(x,y,i,l,r):\n if r<=x or y<=l:return M\n if x<=l and r<=y: return a[i]\n- return min(find(x,y,i*2,l,(l+r)/2),find(x,y,i*2+1,(l+r)/2,r))\n \n if __name__=='__main__':\n n, m = (int(x) for x in input().split())\n t=1\n while tmid:\n modify(i*2+1, mid+1, right, value, pos)\n \n SegTree[i] = min(SegTree[i*2], SegTree[i*2+1])\n\ndef query_min(i, L, R, left, right):\n if right < L or R < left:\n return 2147364748\n if left<=L and R<=right:\n return SegTree[i]\n mid = int((L+R)/2)\n return min(query_min(2*i, L, mid, left, right),\n query_min(2*i+1, mid+1, R, left, right))\n\nmodify(i=1, left=0, right=N-1, value=0, pos=-1) \n\nfor querys in range(Q):\n t, a, b = map(int, input().split())\n if t == 0:\n modify(i=1, left=0, right=N-1, pos=a, value=b)\n else:\n print( query_min(i=1, L=0, R=N-1, left=a, right=b) )", "code2": "import time\n\nN, Q = map(int, input().split())\nSegTree = [0 for i in range(4*N)]\n\ndef modify(i, left, right, value, pos=-1):\n global SegTree\n if left==right:\n if pos != -1:\n SegTree[i] = value\n else:\n SegTree[i] = 2147483647\n return\n\n mid = int((left+right)/2)\n if pos==-1 or pos<=mid:\n modify(i*2, left, mid, value, pos)\n if pos==-1 or pos>mid:\n modify(i*2+1, mid+1, right, value, pos)\n \n SegTree[i] = min(SegTree[i*2], SegTree[i*2+1])\n\ndef query_min(i, L, R, left, right):\n if right < L or R < left:\n return 2147483647\n if left<=L and R<=right:\n return SegTree[i]\n mid = int((L+R)/2)\n return min(query_min(2*i, L, mid, left, right),\n query_min(2*i+1, mid+1, R, left, right))\n\nmodify(i=1, left=0, right=N-1, value=0, pos=-1) \n\nfor querys in range(Q):\n t, a, b = map(int, input().split())\n if t == 0:\n modify(i=1, left=0, right=N-1, pos=a, value=b)\n else:\n print( query_min(i=1, L=0, R=N-1, left=a, right=b) )", "original_language1": "Python3", "original_language2": "Python3", "date1": "1437905785", "date2": "1437906172", "bleu_score": "0.9968916834369121", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 63, "total_score": 102, "input": "6 5\n0 0 0\n0 1 2\n1 2 3\n1 0 2\n1 2 2\n", "actual_output": "2147364748\n0\n2147364748\n", "expected_output": "2147483647\n0\n2147483647\n\n", "anno_code": ["import time\n\nN, Q = map(int, input().split()) # (0): N=6, Q=5\nSegTree = [0 for i in range(4*N)] # (1): SegTree=[0, 0, ..., 0, 0]\n\ndef modify(i, left, right, value, pos=-1): # (2): modify=\n global SegTree\n if left==right: # (5): NO CHANGE (9): NO CHANGE ... (107): NO CHANGE\n if pos != -1: # (18): NO CHANGE (24): NO CHANGE ... (108): NO CHANGE\n SegTree[i] = value # (82): NO CHANGE (109): NO CHANGE\n else:\n SegTree[i] = 2147483647 # (19): NO CHANGE (25): NO CHANGE ... (60): NO CHANGE\n return # (20): i=4, right=1, mid=0 (26): i=4, left=0, mid=0 ... (110): i=4, left=0, mid=0\n\n mid = int((left+right)/2) # (6): mid=2 (10): mid=1 ... (103): mid=0\n if pos==-1 or pos<=mid: # (7): NO CHANGE (11): NO CHANGE ... (104): NO CHANGE\n modify(i*2, left, mid, value, pos) # (8): i=2, right=2 (12): i=4, right=1 ... (101): i=4, right=1\n if pos==-1 or pos>mid: # (21): NO CHANGE (28): NO CHANGE ... (114): NO CHANGE\n modify(i*2+1, mid+1, right, value, pos) # (22): i=9, left=1 (29): i=5, left=2 ... (106): i=9, left=1\n \n SegTree[i] = min(SegTree[i*2], SegTree[i*2+1]) # (27): i=2, right=2, mid=1 (34): i=1, right=5, mid=2 ... (115): time=, N=6, Q=5, SegTree=[0, 0, ..., 0, 0], modify=, query_min=, querys=1, t=0, a=1, b=2\n\ndef query_min(i, L, R, left, right): # (3): query_min=\n if right < L or R < left: # (120): NO CHANGE (123): NO CHANGE ... (169): time=, N=6, Q=5, SegTree=[0, 0, ..., 0, 0], modify=, query_min=, querys=4, t=1, a=2, b=2\n return 2147364748\n if left<=L and R<=right: # (121): NO CHANGE (124): NO CHANGE ... (167): i=1, L=0, R=5, mid=2\n return SegTree[i]\n mid = int((L+R)/2) # (122): i=2, R=2 (125): i=4, R=1 ... (163): i=4, R=1\n return min(query_min(2*i, L, mid, left, right),\n query_min(2*i+1, mid+1, R, left, right)) # (127): i=5, L=2 (130): i=3, L=3 ... (168): i=3, L=3\n\nmodify(i=1, left=0, right=N-1, value=0, pos=-1) # (4): i=1, left=0, right=5, value=0, pos=-1\n\nfor querys in range(Q): # (64): querys=0 (90): querys=1 ... (154): querys=4\n t, a, b = map(int, input().split()) # (65): t=0, a=0, b=0 (91): a=1, b=2 ... (155): a=2\n if t == 0: # (66): NO CHANGE (92): NO CHANGE ... (156): NO CHANGE\n modify(i=1, left=0, right=N-1, pos=a, value=b) # (67): i=1, left=0, right=5, value=0, pos=0 (93): i=1, left=0, right=5, value=2, pos=1\n else:\n print( query_min(i=1, L=0, R=N-1, left=a, right=b) ) # (119): i=1, L=0, R=5, left=2, right=3 (146): i=1, L=0, R=5, left=0, right=2 (157): i=1, L=0, R=5, left=2, right=2\n"], "anno_status": [false], "diff_content": " import time\n \n N, Q = map(int, input().split())\n SegTree = [0 for i in range(4*N)]\n \n def modify(i, left, right, value, pos=-1):\n global SegTree\n if left==right:\n if pos != -1:\n SegTree[i] = value\n else:\n SegTree[i] = 2147483647\n return\n \n mid = int((left+right)/2)\n if pos==-1 or pos<=mid:\n modify(i*2, left, mid, value, pos)\n if pos==-1 or pos>mid:\n modify(i*2+1, mid+1, right, value, pos)\n \n SegTree[i] = min(SegTree[i*2], SegTree[i*2+1])\n \n def query_min(i, L, R, left, right):\n if right < L or R < left:\n- return 2147364748\n+ return 2147483647\n if left<=L and R<=right:\n return SegTree[i]\n mid = int((L+R)/2)\n return min(query_min(2*i, L, mid, left, right),\n query_min(2*i+1, mid+1, R, left, right))\n \n modify(i=1, left=0, right=N-1, value=0, pos=-1) \n \n for querys in range(Q):\n t, a, b = map(int, input().split())\n if t == 0:\n modify(i=1, left=0, right=N-1, pos=a, value=b)\n else:\n print( query_min(i=1, L=0, R=N-1, left=a, right=b) )\n", "FL_content": " import time\n \n N, Q = map(int, input().split())\n SegTree = [0 for i in range(4*N)]\n \n def modify(i, left, right, value, pos=-1):\n global SegTree\n if left==right:\n if pos != -1:\n SegTree[i] = value\n else:\n SegTree[i] = 2147483647\n return\n \n mid = int((left+right)/2)\n if pos==-1 or pos<=mid:\n modify(i*2, left, mid, value, pos)\n if pos==-1 or pos>mid:\n modify(i*2+1, mid+1, right, value, pos)\n \n SegTree[i] = min(SegTree[i*2], SegTree[i*2+1])\n \n def query_min(i, L, R, left, right):\n if right < L or R < left:\n- return 2147364748\n if left<=L and R<=right:\n return SegTree[i]\n mid = int((L+R)/2)\n return min(query_min(2*i, L, mid, left, right),\n query_min(2*i+1, mid+1, R, left, right))\n \n modify(i=1, left=0, right=N-1, value=0, pos=-1) \n \n for querys in range(Q):\n t, a, b = map(int, input().split())\n if t == 0:\n modify(i=1, left=0, right=N-1, pos=a, value=b)\n else:\n print( query_min(i=1, L=0, R=N-1, left=a, right=b) )\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 39 }, { "user_id": "u008079810", "problem_id": "p02722", "submission1_id": "s595278750", "submission2_id": "s152359831", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nN=int(input())\ncand=[]\n\ndef check(N0,K0):\n if N0%K0==0:\n return check(int(N0/K0),K0)\n elif N0%K0==1:\n return 1\n else:\n return 0\n\ndef check0(N0,K0):\n while N0%K0==0:\n N0=int(N0/K0)\n if N0%K0==1:\n return 1\n else:\n return 0\n\n\nfor i in range(2,int((N-1)**0.5)+1):\n if (N-1)%i==0:\n cand.append(i)\n if i!=int((N-1)/i):\n cand.append(int((N-1)/i))\nif N>2:\n cand.append(N-1)\n\n\nfor i in range(2,int(N**0.5)+1):\n if N%i==0:\n cand.append(i)\n if i!=int(N/i):\n cand.append(int(N/i))\ncand.append(N)\n\nprint(cand)\ncount=0\nfor i in range(len(cand)):\n if check(N,cand[i]):\n count+=1\n\nprint(count)", "code2": "\n\nN=int(input())\ncand=[]\n\ndef check(N0,K0):\n if N0%K0==0:\n return check(int(N0/K0),K0)\n elif N0%K0==1:\n return 1\n else:\n return 0\n\ndef check0(N0,K0):\n while N0%K0==0:\n N0=int(N0/K0)\n if N0%K0==1:\n return 1\n else:\n return 0\n\n\nfor i in range(2,int((N-1)**0.5)+1):\n if (N-1)%i==0:\n cand.append(i)\n if i!=int((N-1)/i):\n cand.append(int((N-1)/i))\nif N>2:\n cand.append(N-1)\n\n\nfor i in range(2,int(N**0.5)+1):\n if N%i==0:\n cand.append(i)\n if i!=int(N/i):\n cand.append(int(N/i))\ncand.append(N)\n\n\ncount=0\nfor i in range(len(cand)):\n if check(N,cand[i]):\n count+=1\n\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586399936", "date2": "1586399990", "bleu_score": "0.9822151784280698", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 81, "input": "6082577109\n", "actual_output": "[2, 3041288554, 4, 1520644277, 113, 53828116, 226, 26914058, 452, 13457029, 6082577108, 3, 2027525703, 7, 868939587, 9, 675841901, 21, 289646529, 63, 96548843, 6082577109]\n12\n", "expected_output": "12\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n \n N=int(input())\n cand=[]\n \n def check(N0,K0):\n if N0%K0==0:\n return check(int(N0/K0),K0)\n elif N0%K0==1:\n return 1\n else:\n return 0\n \n def check0(N0,K0):\n while N0%K0==0:\n N0=int(N0/K0)\n if N0%K0==1:\n return 1\n else:\n return 0\n \n \n for i in range(2,int((N-1)**0.5)+1):\n if (N-1)%i==0:\n cand.append(i)\n if i!=int((N-1)/i):\n cand.append(int((N-1)/i))\n if N>2:\n cand.append(N-1)\n \n \n for i in range(2,int(N**0.5)+1):\n if N%i==0:\n cand.append(i)\n if i!=int(N/i):\n cand.append(int(N/i))\n cand.append(N)\n \n-print(cand)\n+\n count=0\n for i in range(len(cand)):\n if check(N,cand[i]):\n count+=1\n \n print(count)\n", "FL_content": " \n \n N=int(input())\n cand=[]\n \n def check(N0,K0):\n if N0%K0==0:\n return check(int(N0/K0),K0)\n elif N0%K0==1:\n return 1\n else:\n return 0\n \n def check0(N0,K0):\n while N0%K0==0:\n N0=int(N0/K0)\n if N0%K0==1:\n return 1\n else:\n return 0\n \n \n for i in range(2,int((N-1)**0.5)+1):\n if (N-1)%i==0:\n cand.append(i)\n if i!=int((N-1)/i):\n cand.append(int((N-1)/i))\n if N>2:\n cand.append(N-1)\n \n \n for i in range(2,int(N**0.5)+1):\n if N%i==0:\n cand.append(i)\n if i!=int(N/i):\n cand.append(int(N/i))\n cand.append(N)\n \n-print(cand)\n count=0\n for i in range(len(cand)):\n if check(N,cand[i]):\n count+=1\n \n print(count)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 45 }, { "user_id": "u192042624", "problem_id": "p02722", "submission1_id": "s421111450", "submission2_id": "s516180711", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\n\nN = int(input())\n\nnn = int(math.sqrt(N))\n\nans = 0\nfor x in range(2,nn+1):\n\n if N % x > 1:\n continue\n\n if N % x == 1:\n ans += 1\n continue\n \n tmp = N\n while True:\n tmp = tmp / x\n if tmp % x == 1:\n ans += 1\n break\n elif tmp == x :\n ans += 1\n break\n elif tmp % x >= 1:\n break\n\nprint(ans+2)\n\n\n\n\n", "code2": "import math\n\n\nN = int(input())\n\nnn = int(math.sqrt(N))\n\n\nans = 1\nfor x in range(2,nn+1):\n\n if N % x == 1:\n ans += 1\n continue\n \n if N % x > 1:\n continue\n\n tmp = N\n while tmp > x:\n tmp = tmp / x\n if tmp % x == 1 :\n ans += 1\n break\n elif tmp % x > 1 :\n break\n elif tmp == x:\n ans += 1\n break\n\nx = 1\ntmp = N - 1\nwhile tmp / x > nn:\n if tmp % x == 0:\n ans += 1\n x += 1\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586054395", "date2": "1586111920", "bleu_score": "0.7936412039577081", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0], "code1_test_score": 2, "total_score": 81, "input": "237274827109\n", "actual_output": "13\n", "expected_output": "24\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import math\n \n \n N = int(input())\n \n nn = int(math.sqrt(N))\n \n-ans = 0\n-for x in range(2,nn+1):\n \n- if N % x > 1:\n- continue\n+ans = 1\n+for x in range(2,nn+1):\n \n if N % x == 1:\n ans += 1\n continue\n \n+ if N % x > 1:\n+ continue\n+\n tmp = N\n- while True:\n+ while tmp > x:\n tmp = tmp / x\n- if tmp % x == 1:\n+ if tmp % x == 1 :\n ans += 1\n break\n- elif tmp == x :\n- ans += 1\n+ elif tmp % x > 1 :\n break\n- elif tmp % x >= 1:\n+ elif tmp == x:\n+ ans += 1\n break\n \n-print(ans+2)\n-\n-\n-\n+x = 1\n+tmp = N - 1\n+while tmp / x > nn:\n+ if tmp % x == 0:\n+ ans += 1\n+ x += 1\n \n+print(ans)\n \n", "FL_content": " import math\n \n \n N = int(input())\n \n nn = int(math.sqrt(N))\n \n-ans = 0\n-for x in range(2,nn+1):\n \n- if N % x > 1:\n- continue\n \n if N % x == 1:\n ans += 1\n continue\n \n tmp = N\n- while True:\n tmp = tmp / x\n- if tmp % x == 1:\n ans += 1\n break\n- elif tmp == x :\n- ans += 1\n break\n- elif tmp % x >= 1:\n break\n \n-print(ans+2)\n-\n-\n-\n \n \n", "added_lines": 17, "removed_lines": 13, "code1_lines": 35 }, { "user_id": "u515647766", "problem_id": "p02722", "submission1_id": "s254348205", "submission2_id": "s546102049", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def divisor(n):\n list1 = []\n for i in range(1, int(n ** (0.5)) + 1):\n if n % i == 0:\n list1.append(i)\n list1.append(int(n / i))\n list1 = list(set(list1))\n return len(list1) - 1\n\ndef function(n):\n ans = 0\n if n >= 2:\n ans += 1\n for i in range(2, int(n ** (0.5)) + 1):\n m = n\n if m % i == 0:\n while m % i == 0:\n m = int(m / i)\n ans += divisor(m)\n ans += divisor(n - 1)\n return ans\nn = int(input())\nprint(function(n))", "code2": "def divisor(n):\n list1 = []\n for i in range(1, int(n ** (0.5)) + 1):\n if n % i == 0:\n list1.append(i)\n list1.append(int(n / i))\n list1 = list(set(list1))\n return len(list1) - 1\n\ndef function(n):\n ans = 0\n if n >= 2:\n ans += 1\n for i in range(2, int(n ** (0.5)) + 1):\n m = n\n if m % i == 0:\n while m % i == 0:\n m = int(m / i)\n if m % i == 1:\n ans += 1\n ans += divisor(n - 1)\n return ans\nn = int(input())\nprint(function(n))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589076703", "date2": "1589077368", "bleu_score": "0.9478163249273924", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0], "code1_test_score": 11, "total_score": 81, "input": "7705668993\n", "actual_output": "545\n", "expected_output": "64\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " def divisor(n):\n list1 = []\n for i in range(1, int(n ** (0.5)) + 1):\n if n % i == 0:\n list1.append(i)\n list1.append(int(n / i))\n list1 = list(set(list1))\n return len(list1) - 1\n \n def function(n):\n ans = 0\n if n >= 2:\n ans += 1\n for i in range(2, int(n ** (0.5)) + 1):\n m = n\n if m % i == 0:\n while m % i == 0:\n m = int(m / i)\n- ans += divisor(m)\n+ if m % i == 1:\n+ ans += 1\n ans += divisor(n - 1)\n return ans\n n = int(input())\n print(function(n))\n", "FL_content": " def divisor(n):\n list1 = []\n for i in range(1, int(n ** (0.5)) + 1):\n if n % i == 0:\n list1.append(i)\n list1.append(int(n / i))\n list1 = list(set(list1))\n return len(list1) - 1\n \n def function(n):\n ans = 0\n if n >= 2:\n ans += 1\n for i in range(2, int(n ** (0.5)) + 1):\n m = n\n if m % i == 0:\n while m % i == 0:\n m = int(m / i)\n- ans += divisor(m)\n ans += divisor(n - 1)\n return ans\n n = int(input())\n print(function(n))\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 23 }, { "user_id": "u192042624", "problem_id": "p02722", "submission1_id": "s086127594", "submission2_id": "s516180711", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\n\nN = int(input())\n\nnn = int(math.sqrt(N))\n\nans = 0\nfor x in range(2,nn+1):\n\n if N % x > 1:\n continue\n\n if N % x == 1:\n ans += 1\n continue\n \n tmp = N\n while True:\n tmp = tmp / x\n if tmp % x == 1:\n ans += 1\n break\n elif tmp == x :\n ans += 1\n break\n elif tmp % x >= 1:\n break\n\nprint(ans+3)\n\n\n\n\n", "code2": "import math\n\n\nN = int(input())\n\nnn = int(math.sqrt(N))\n\n\nans = 1\nfor x in range(2,nn+1):\n\n if N % x == 1:\n ans += 1\n continue\n \n if N % x > 1:\n continue\n\n tmp = N\n while tmp > x:\n tmp = tmp / x\n if tmp % x == 1 :\n ans += 1\n break\n elif tmp % x > 1 :\n break\n elif tmp == x:\n ans += 1\n break\n\nx = 1\ntmp = N - 1\nwhile tmp / x > nn:\n if tmp % x == 0:\n ans += 1\n x += 1\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586054367", "date2": "1586111920", "bleu_score": "0.7936412039577081", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 8, "total_score": 81, "input": "2777701\n", "actual_output": "38\n", "expected_output": "72\n\n", "anno_code": ["import math\n\n\nN = int(input()) # (0): N=2777701\n\nnn = int(math.sqrt(N)) # (1): nn=1666\n\nans = 0 # (2): ans=0\nfor x in range(2,nn+1): # (3): x=2 (8): x=3 ... (5087): NO CHANGE\n\n if N % x > 1: # (4): NO CHANGE (9): NO CHANGE ... (5085): NO CHANGE\n continue # (30): NO CHANGE (33): NO CHANGE ... (5086): NO CHANGE\n\n if N % x == 1: # (5): NO CHANGE (10): NO CHANGE ... (4316): NO CHANGE\n ans += 1 # (6): ans=1 (11): ans=2 ... (4317): ans=35\n continue # (7): NO CHANGE (12): NO CHANGE ... (4318): NO CHANGE\n \n tmp = N # (133): tmp=2777701 (4187): tmp=2777701\n while True: # (134): NO CHANGE (139): NO CHANGE (4188): NO CHANGE\n tmp = tmp / x # (135): tmp=75073.0 (140): tmp=2029.0 (4189): tmp=2029.0\n if tmp % x == 1: # (136): NO CHANGE (141): NO CHANGE (4190): NO CHANGE\n ans += 1\n break\n elif tmp == x : # (137): NO CHANGE (142): NO CHANGE (4191): NO CHANGE\n ans += 1\n break\n elif tmp % x >= 1: # (138): NO CHANGE (143): NO CHANGE (4192): NO CHANGE\n break # (144): NO CHANGE (4193): NO CHANGE\n\nprint(ans+3)\n\n\n\n\n"], "anno_status": [true], "diff_content": " import math\n \n \n N = int(input())\n \n nn = int(math.sqrt(N))\n \n-ans = 0\n-for x in range(2,nn+1):\n \n- if N % x > 1:\n- continue\n+ans = 1\n+for x in range(2,nn+1):\n \n if N % x == 1:\n ans += 1\n continue\n \n+ if N % x > 1:\n+ continue\n+\n tmp = N\n- while True:\n+ while tmp > x:\n tmp = tmp / x\n- if tmp % x == 1:\n+ if tmp % x == 1 :\n ans += 1\n break\n- elif tmp == x :\n- ans += 1\n+ elif tmp % x > 1 :\n break\n- elif tmp % x >= 1:\n+ elif tmp == x:\n+ ans += 1\n break\n \n-print(ans+3)\n-\n-\n-\n+x = 1\n+tmp = N - 1\n+while tmp / x > nn:\n+ if tmp % x == 0:\n+ ans += 1\n+ x += 1\n \n+print(ans)\n \n", "FL_content": " import math\n \n \n N = int(input())\n \n nn = int(math.sqrt(N))\n \n-ans = 0\n-for x in range(2,nn+1):\n \n- if N % x > 1:\n- continue\n \n if N % x == 1:\n ans += 1\n continue\n \n tmp = N\n- while True:\n tmp = tmp / x\n- if tmp % x == 1:\n ans += 1\n break\n- elif tmp == x :\n- ans += 1\n break\n- elif tmp % x >= 1:\n break\n \n-print(ans+3)\n-\n-\n-\n \n \n", "added_lines": 17, "removed_lines": 13, "code1_lines": 35 }, { "user_id": "u170201762", "problem_id": "p03297", "submission1_id": "s381736413", "submission2_id": "s547578596", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import floor\ndef gcd(a,b):\n if b == 0:\n return a\n else:\n return gcd(b,a%b)\nT = int(input())\nfor i in range(T):\n A,B,C,D = map(int,input().split())\n if B > D or B > A:\n print(\"No\")\n else:\n if A%B>C:\n print(\"No\")\n else:\n d = gcd(B,D%B)\n r = A%B\n if r%d == 0:\n if B-d > C:\n print(\"No\")\n else:\n print(\"Yes\")\n else:\n if r+floor((B-r)/d) > C:\n print(\"No\")\n else:\n print(\"Yes\")\n", "code2": "from math import floor\ndef gcd(a,b):\n if b == 0:\n return a\n else:\n return gcd(b,a%b)\nT = int(input())\nfor i in range(T):\n A,B,C,D = map(int,input().split())\n if B > D or B > A:\n print(\"No\")\n else:\n if A%B>C:\n print(\"No\")\n else:\n d = gcd(B,D%B)\n r = (A%B)%d\n if B - d + r > C:\n print(\"No\")\n else:\n print(\"Yes\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531625715", "date2": "1531625869", "bleu_score": "0.6502762745409922", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 92, "total_score": 102, "input": "14\n7 7 5 9\n8 7 1 9\n11 10 7 12\n14 10 1 12\n14 14 14 15\n14 11 5 11\n14 10 12 11\n14 10 11 11\n0 10 3 10\n0 13 9 6\n11 18 9 10\n16 22 5 10\n1000010000100000000 17 5 999999999999999985\n1000000000000000000 16 15 2424336645253281229\n", "actual_output": "No\nNo\nYes\nNo\nYes\nYes\nYes\nYes\nNo\nNo\nNo\nNo\nNo\nYes\n", "expected_output": "No\nNo\nNo\nNo\nYes\nYes\nYes\nYes\nNo\nNo\nNo\nNo\nNo\nYes\n\n", "anno_code": ["from math import floor\ndef gcd(a,b): # (0): gcd=\n if b == 0: # (7): a=2, b=1 (8): a=1, b=0 ... (114): floor=, gcd=, T=14, i=13, A=1000000000000000000, B=16, C=15, D=2424336645253281229, d=1, r=4\n return a\n else:\n return gcd(b,a%b)\nT = int(input()) # (1): T=14\nfor i in range(T): # (2): i=0 (14): i=1 ... (106): i=13\n A,B,C,D = map(int,input().split()) # (3): A=7, B=7, C=5, D=9 (15): A=8, C=1 ... (107): A=1000000000000000000, B=16, C=15, D=2424336645253281229\n if B > D or B > A: # (4): NO CHANGE (16): NO CHANGE ... (108): NO CHANGE\n print(\"No\") # (88): NO CHANGE (92): NO CHANGE ... (100): NO CHANGE\n else:\n if A%B>C: # (5): NO CHANGE (17): NO CHANGE ... (109): NO CHANGE\n print(\"No\") # (41): NO CHANGE (105): NO CHANGE\n else:\n d = gcd(B,D%B) # (6): a=7, b=2 (18): a=7, b=2 ... (110): a=16, b=13\n r = A%B # (10): r=0 (22): r=1 ... (115): r=0\n if r%d == 0: # (11): NO CHANGE (23): NO CHANGE ... (116): NO CHANGE\n if B-d > C: # (12): NO CHANGE (24): NO CHANGE ... (117): NO CHANGE\n print(\"No\") # (13): NO CHANGE (25): NO CHANGE\n else:\n print(\"Yes\") # (52): NO CHANGE (73): NO CHANGE ... (118): NO CHANGE\n else:\n if r+floor((B-r)/d) > C: # (35): NO CHANGE (61): NO CHANGE\n print(\"No\")\n else:\n print(\"Yes\") # (36): NO CHANGE (62): NO CHANGE\n"], "anno_status": [false], "diff_content": " from math import floor\n def gcd(a,b):\n if b == 0:\n return a\n else:\n return gcd(b,a%b)\n T = int(input())\n for i in range(T):\n A,B,C,D = map(int,input().split())\n if B > D or B > A:\n print(\"No\")\n else:\n if A%B>C:\n print(\"No\")\n else:\n d = gcd(B,D%B)\n- r = A%B\n- if r%d == 0:\n- if B-d > C:\n- print(\"No\")\n- else:\n- print(\"Yes\")\n+ r = (A%B)%d\n+ if B - d + r > C:\n+ print(\"No\")\n else:\n- if r+floor((B-r)/d) > C:\n- print(\"No\")\n- else:\n- print(\"Yes\")\n-\n+ print(\"Yes\")\n", "FL_content": " from math import floor\n def gcd(a,b):\n if b == 0:\n return a\n else:\n return gcd(b,a%b)\n T = int(input())\n for i in range(T):\n A,B,C,D = map(int,input().split())\n if B > D or B > A:\n print(\"No\")\n else:\n if A%B>C:\n print(\"No\")\n else:\n d = gcd(B,D%B)\n- r = A%B\n- if r%d == 0:\n- if B-d > C:\n- print(\"No\")\n- else:\n- print(\"Yes\")\n else:\n- if r+floor((B-r)/d) > C:\n- print(\"No\")\n- else:\n- print(\"Yes\")\n-\n", "added_lines": 4, "removed_lines": 11, "code1_lines": 28 }, { "user_id": "u695811449", "problem_id": "p03297", "submission1_id": "s836011374", "submission2_id": "s116989003", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def gcd(a, b):\n\twhile b:\n\t\ta, b = b, a % b\n\treturn a\n\nT=int(input())\nJuice=[None]*T\nfor i in range(T):\n Juice[i]=list(map(int,input().split()))\n\n\n\n\n\ndef juicecheck(i):\n A=Juice[i][0]\n B=Juice[i][1]\n C=Juice[i][2]\n D=Juice[i][3]\n\n if AD:\n print(\"No\")\n return\n elif BB%z and ((C+1)%z<=x%z or x%zD:\n print(\"No\")\n return\n elif B-1<=C:\n print(\"Yes\")\n return\n else:\n x=A%B\n y=D%B\n \n\n z=gcd(B,D)\n\n if z==1 or B-(C+1)>=z or (C+1)%z<=x%z<=(B-1)%z or ( (C+1)%z>B%z and ((C+1)%z<=x%z or x%z\n\twhile b: # (44): NO CHANGE (46): NO CHANGE ... (243): i=13, A=1000000000000000001, B=16, C=15, D=2424336645253281229, x=1, z=1\n\t\ta, b = b, a % b # (45): a=9, b=7 (47): a=7, b=2 ... (242): a=1, b=0\n\treturn a\n\nT=int(input()) # (1): T=14\nJuice=[None]*T # (2): Juice=[None, None, None, None, None, None, None, None, None, None, None, None, None, None]\nfor i in range(T): # (3): i=0 (5): Juice, i=1 ... (31): NO CHANGE\n Juice[i]=list(map(int,input().split())) # (4): Juice (6): Juice ... (30): Juice\n\n\n\n\n\ndef juicecheck(i): # (32): juicecheck=\n A=Juice[i][0] # (35): A=7 (58): A=8 ... (224): A=1000000000000000001\n B=Juice[i][1] # (36): B=7 (59): B=7 ... (225): B=16\n C=Juice[i][2] # (37): C=5 (60): C=1 ... (226): C=15\n D=Juice[i][3] # (38): D=9 (61): D=9 ... (227): D=2424336645253281229\n\n if A, T=14, Juice, juicecheck= (166): gcd=, T=14, Juice, juicecheck= ... (202): gcd=, T=14, Juice, juicecheck=\n elif B>D: # (40): NO CHANGE (63): NO CHANGE ... (229): NO CHANGE\n print(\"No\")\n return\n elif B, T=14, Juice, juicecheck=\n else:\n x=A%B # (42): x=0 (65): x=1 ... (231): x=1\n \n\n z=gcd(B,D) # (43): a=7, b=9 (66): a=7, b=9 ... (232): a=16, b=2424336645253281229\n\n if ((C+1)!=B) and (z==1 or (C+1)%z==B%z==x%z or (C+1)%z<=x%zB%z and ((C+1)%z<=x%z or x%z, T=14, Juice, juicecheck= (78): gcd=, T=14, Juice, juicecheck= ... (221): gcd=, T=14, Juice, juicecheck=\n\n print(\"Yes\") # (98): NO CHANGE (147): NO CHANGE (245): NO CHANGE\n return # (99): gcd=, T=14, Juice, juicecheck= (148): gcd=, T=14, Juice, juicecheck= (246): gcd=, T=14, Juice, juicecheck=\n \n \n\nfor i in range(T): # (33): i=0 (56): i=1 ... (222): i=13\n juicecheck(i) # (34): NO CHANGE (57): NO CHANGE ... (223): NO CHANGE\n"], "anno_status": [false], "diff_content": " def gcd(a, b):\n \twhile b:\n \t\ta, b = b, a % b\n \treturn a\n \n T=int(input())\n Juice=[None]*T\n for i in range(T):\n Juice[i]=list(map(int,input().split()))\n \n \n \n \n \n def juicecheck(i):\n A=Juice[i][0]\n B=Juice[i][1]\n C=Juice[i][2]\n D=Juice[i][3]\n \n if AD:\n print(\"No\")\n return\n- elif BB%z and ((C+1)%z<=x%z or x%z=z or (C+1)%z<=x%z<=(B-1)%z or ( (C+1)%z>B%z and ((C+1)%z<=x%z or x%zD:\n print(\"No\")\n return\n- elif BB%z and ((C+1)%z<=x%z or x%z self.c:\n return \"No\"\n if self.d < self.b:\n return \"No\"\n d = self.b - self.c\n if d <= 0:\n return \"Yes\"\n if self.b % d == 0 and self.d % d == 0:\n return \"Yes\"\n if self.a % self.b + self.d == self.a:\n return \"Yes\"\n return \"No\"\n\nif __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n", "code2": "def gcd(a, b):\n r = a % b\n while r != 0:\n a, b, r = b, r, b % r\n return b\n\nclass query:\n def __init__(self, a, b, c, d):\n self.a = a\n self.b = b\n self.c = c\n self.d = d\n def isEternal(self):\n if self.a < self.b:\n return \"No\"\n if self.d < self.b:\n return \"No\"\n if self.b <= self.c:\n return \"Yes\"\n g = gcd(self.d, self.b)\n if self.b - g + self.a % g > self.c:\n return \"No\"\n return \"Yes\"\n\nif __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531619243", "date2": "1531631102", "bleu_score": "0.8618353132956962", "code1_test_status": [1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 70, "total_score": 102, "input": "14\n7 7 5 9\n15 7 1 9\n14 5 7 14\n14 5 1 12\n14 8 14 11\n14 11 5 11\n14 9 12 11\n14 10 11 11\n0 10 3 11\n0 13 9 6\n11 4 9 4\n16 10 5 10\n1100010000100000000 17 5 999999999999999985\n1000000000000000000 16 15 2424336645253281229\n", "actual_output": "No\nNo\nYes\nNo\nYes\nYes\nYes\nYes\nNo\nNo\nYes\nNo\nNo\nYes\n", "expected_output": "No\nNo\nYes\nNo\nYes\nYes\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\n\n", "anno_code": ["class query: # (0): query=\n def __init__(self, a, b, c, d):\n self.a = a\n self.b = b\n self.c = c\n self.d = d\n def isEternal(self):\n if self.a < self.b:\n return \"No\"\n if self.a % self.b > self.c:\n return \"No\"\n if self.d < self.b:\n return \"No\"\n d = self.b - self.c\n if d <= 0:\n return \"Yes\"\n if self.b % d == 0 and self.d % d == 0:\n return \"Yes\"\n if self.a % self.b + self.d == self.a:\n return \"Yes\"\n return \"No\"\n\nif __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n"], "anno_status": [false], "diff_content": "+def gcd(a, b):\n+ r = a % b\n+ while r != 0:\n+ a, b, r = b, r, b % r\n+ return b\n+\n class query:\n def __init__(self, a, b, c, d):\n self.a = a\n self.b = b\n self.c = c\n self.d = d\n def isEternal(self):\n if self.a < self.b:\n return \"No\"\n- if self.a % self.b > self.c:\n- return \"No\"\n if self.d < self.b:\n return \"No\"\n- d = self.b - self.c\n- if d <= 0:\n- return \"Yes\"\n- if self.b % d == 0 and self.d % d == 0:\n+ if self.b <= self.c:\n return \"Yes\"\n- if self.a % self.b + self.d == self.a:\n- return \"Yes\"\n- return \"No\"\n+ g = gcd(self.d, self.b)\n+ if self.b - g + self.a % g > self.c:\n+ return \"No\"\n+ return \"Yes\"\n \n if __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n \n", "FL_content": " class query:\n def __init__(self, a, b, c, d):\n self.a = a\n self.b = b\n self.c = c\n self.d = d\n def isEternal(self):\n if self.a < self.b:\n return \"No\"\n- if self.a % self.b > self.c:\n- return \"No\"\n if self.d < self.b:\n return \"No\"\n- d = self.b - self.c\n- if d <= 0:\n- return \"Yes\"\n- if self.b % d == 0 and self.d % d == 0:\n return \"Yes\"\n- if self.a % self.b + self.d == self.a:\n- return \"Yes\"\n- return \"No\"\n \n if __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n \n", "added_lines": 11, "removed_lines": 9, "code1_lines": 28 }, { "user_id": "u029169777", "problem_id": "p03297", "submission1_id": "s362528833", "submission2_id": "s069315762", "status1": "Wrong Answer", "status2": "Accepted", "code1": "T=int(input())\n\nQuery=[]\nfor i in range(T):\n Query.append(list(map(int,input().split())))\n\nfor i in range(T):\n count=0\n while(True):\n if Query[i][0]%Query[i][1]>Query[i][2]:\n print('No')\n break;\n Query[i][0]=Query[i][0]%Query[i][1] \n if Query[i][0]<=Query[i][2]: \n Query[i][0]+=Query[i][3]\n count+=1\n if count==300:\n print('Yes')\n break;", "code2": "def gcd(a,b):\n while b:\n a,b=b,a%b\n return a\nT=int(input())\n \nQuery=[]\nfor i in range(T):\n Query.append(list(map(int,input().split())))\n \nfor i in range(T):\n while(True):\n if Query[i][0]%Query[i][1]>Query[i][2] or Query[i][0]Query[i][3]:\n print('No')\n break;\n G=gcd(Query[i][1],Query[i][3]) \n \n if Query[i][1]-G+Query[i][0]%G>Query[i][2]:\n print('No')\n break;\n else:\n print('Yes')\n break;", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531620993", "date2": "1531698281", "bleu_score": "0.7039144520752629", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1], "code1_test_score": 52, "total_score": 102, "input": "14\n7 7 5 9\n15 7 1 9\n14 5 7 12\n14 10 1 12\n14 14 14 11\n14 11 5 11\n14 9 12 11\n14 10 11 11\n0 10 3 11\n0 13 9 6\n11 18 9 10\n16 10 5 10\n1000010000100000000 17 5 999999999999999985\n1000000000000000000 16 15 2424336645253281229\n", "actual_output": "No\nNo\nYes\nNo\nYes\nYes\nYes\nYes\nNo\nNo\nNo\nNo\nNo\nYes\n", "expected_output": "No\nNo\nYes\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\nNo\nNo\nYes\n\n", "anno_code": ["T=int(input()) # (0): T=14\n\nQuery=[] # (1): Query=[]\nfor i in range(T): # (2): i=0 (4): i=1 ... (30): NO CHANGE\n Query.append(list(map(int,input().split()))) # (3): Query (5): Query ... (29): Query\n\nfor i in range(T): # (31): i=0 (58): i=1 ... (10669): i=13\n count=0 # (32): count=0 (59): count=0 ... (10670): NO CHANGE\n while(True): # (33): NO CHANGE (40): NO CHANGE ... (12764): NO CHANGE\n if Query[i][0]%Query[i][1]>Query[i][2]: # (34): NO CHANGE (41): NO CHANGE ... (12765): NO CHANGE\n print('No') # (56): NO CHANGE (69): NO CHANGE ... (10667): NO CHANGE\n break; # (57): NO CHANGE (70): NO CHANGE ... (10668): NO CHANGE\n Query[i][0]=Query[i][0]%Query[i][1] # (35): Query (42): Query ... (12766): Query\n if Query[i][0]<=Query[i][2]: # (36): NO CHANGE (43): NO CHANGE ... (12767): NO CHANGE\n Query[i][0]+=Query[i][3] # (37): Query (44): Query ... (12768): Query\n count+=1 # (38): count=1 (45): count=2 ... (12769): count=300\n if count==300: # (39): NO CHANGE (46): NO CHANGE ... (12770): NO CHANGE\n print('Yes') # (2173): NO CHANGE (4283): NO CHANGE ... (12771): NO CHANGE\n break; # (2174): NO CHANGE (4284): NO CHANGE ... (12772): NO CHANGE\n"], "anno_status": [false], "diff_content": "+def gcd(a,b):\n+ while b:\n+ a,b=b,a%b\n+ return a\n T=int(input())\n-\n+ \n Query=[]\n for i in range(T):\n Query.append(list(map(int,input().split())))\n-\n+ \n for i in range(T):\n- count=0\n while(True):\n- if Query[i][0]%Query[i][1]>Query[i][2]:\n+ if Query[i][0]%Query[i][1]>Query[i][2] or Query[i][0]Query[i][3]:\n print('No')\n break;\n- Query[i][0]=Query[i][0]%Query[i][1] \n- if Query[i][0]<=Query[i][2]: \n- Query[i][0]+=Query[i][3]\n- count+=1\n- if count==300:\n+ G=gcd(Query[i][1],Query[i][3]) \n+ \n+ if Query[i][1]-G+Query[i][0]%G>Query[i][2]:\n+ print('No')\n+ break;\n+ else:\n print('Yes')\n break;\n", "FL_content": " T=int(input())\n-\n Query=[]\n for i in range(T):\n Query.append(list(map(int,input().split())))\n-\n for i in range(T):\n- count=0\n while(True):\n- if Query[i][0]%Query[i][1]>Query[i][2]:\n print('No')\n break;\n- Query[i][0]=Query[i][0]%Query[i][1] \n- if Query[i][0]<=Query[i][2]: \n- Query[i][0]+=Query[i][3]\n- count+=1\n- if count==300:\n print('Yes')\n break;\n", "added_lines": 13, "removed_lines": 9, "code1_lines": 19 }, { "user_id": "u170201762", "problem_id": "p03297", "submission1_id": "s448710348", "submission2_id": "s547578596", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import floor\ndef gcd(a,b):\n if b == 0:\n return a\n else:\n return gcd(b,a%b)\nT = int(input())\nfor i in range(T):\n A,B,C,D = map(int,input().split())\n if B > D:\n print(\"No\")\n else:\n if A%B>C:\n print(\"No\")\n else:\n d = gcd(B,D%B)\n r = A%B\n if r%d == 0:\n if B-D > C:\n print(\"No\")\n else:\n print(\"Yes\")\n else:\n if r+floor((B-r)/d) > C:\n print(\"No\")\n else:\n print(\"Yes\")", "code2": "from math import floor\ndef gcd(a,b):\n if b == 0:\n return a\n else:\n return gcd(b,a%b)\nT = int(input())\nfor i in range(T):\n A,B,C,D = map(int,input().split())\n if B > D or B > A:\n print(\"No\")\n else:\n if A%B>C:\n print(\"No\")\n else:\n d = gcd(B,D%B)\n r = (A%B)%d\n if B - d + r > C:\n print(\"No\")\n else:\n print(\"Yes\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531625535", "date2": "1531625869", "bleu_score": "0.6540770737206815", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "14\n9 7 5 9\n9 7 9 9\n14 10 7 12\n14 10 15 12\n14 10 9 12\n14 11 7 11\n14 10 8 11\n14 10 9 11\n9 10 3 4\n10 11 5 10\n11 10 5 7\n16 10 5 10\n1000000000100000000 17 14 999999999999999985\n1000000000010000000 23 15 1358327919252224189\n", "actual_output": "Yes\nYes\nYes\nYes\nYes\nYes\nYes\nYes\nNo\nNo\nNo\nNo\nYes\nYes\n", "expected_output": "No\nYes\nNo\nYes\nYes\nYes\nNo\nYes\nNo\nNo\nNo\nNo\nYes\nNo\n\n", "anno_code": ["from math import floor\ndef gcd(a,b): # (0): gcd=\n if b == 0: # (7): a=2, b=1 (8): a=1, b=0 ... (126): floor=, gcd=, T=14, i=13, A=1000000000010000000, B=23, C=15, D=1358327919252224189, d=1, r=14\n return a\n else:\n return gcd(b,a%b)\nT = int(input()) # (1): T=14\nfor i in range(T): # (2): i=0 (14): i=1 ... (118): i=13\n A,B,C,D = map(int,input().split()) # (3): A=9, B=7, C=5, D=9 (15): C=9 ... (119): A=1000000000010000000, B=23, C=15, D=1358327919252224189\n if B > D: # (4): NO CHANGE (16): NO CHANGE ... (120): NO CHANGE\n print(\"No\") # (94): NO CHANGE (98): NO CHANGE (102): NO CHANGE\n else:\n if A%B>C: # (5): NO CHANGE (17): NO CHANGE ... (121): NO CHANGE\n print(\"No\") # (107): NO CHANGE\n else:\n d = gcd(B,D%B) # (6): a=7, b=2 (18): a=7, b=2 ... (122): a=23, b=6\n r = A%B # (10): r=2 (22): NO CHANGE ... (127): r=0\n if r%d == 0: # (11): NO CHANGE (23): NO CHANGE ... (128): NO CHANGE\n if B-D > C: # (12): NO CHANGE (24): NO CHANGE ... (129): NO CHANGE\n print(\"No\")\n else:\n print(\"Yes\") # (13): NO CHANGE (25): NO CHANGE ... (130): NO CHANGE\n else:\n if r+floor((B-r)/d) > C: # (67): NO CHANGE (116): NO CHANGE\n print(\"No\")\n else:\n print(\"Yes\") # (68): NO CHANGE (117): NO CHANGE\n"], "anno_status": [false], "diff_content": " from math import floor\n def gcd(a,b):\n if b == 0:\n return a\n else:\n return gcd(b,a%b)\n T = int(input())\n for i in range(T):\n A,B,C,D = map(int,input().split())\n- if B > D:\n+ if B > D or B > A:\n print(\"No\")\n else:\n if A%B>C:\n print(\"No\")\n else:\n d = gcd(B,D%B)\n- r = A%B\n- if r%d == 0:\n- if B-D > C:\n- print(\"No\")\n- else:\n- print(\"Yes\")\n+ r = (A%B)%d\n+ if B - d + r > C:\n+ print(\"No\")\n else:\n- if r+floor((B-r)/d) > C:\n- print(\"No\")\n- else:\n- print(\"Yes\")\n+ print(\"Yes\")\n", "FL_content": " from math import floor\n def gcd(a,b):\n if b == 0:\n return a\n else:\n return gcd(b,a%b)\n T = int(input())\n for i in range(T):\n A,B,C,D = map(int,input().split())\n- if B > D:\n print(\"No\")\n else:\n if A%B>C:\n print(\"No\")\n else:\n d = gcd(B,D%B)\n- r = A%B\n- if r%d == 0:\n- if B-D > C:\n- print(\"No\")\n- else:\n- print(\"Yes\")\n else:\n- if r+floor((B-r)/d) > C:\n- print(\"No\")\n- else:\n- print(\"Yes\")\n", "added_lines": 5, "removed_lines": 11, "code1_lines": 27 }, { "user_id": "u280512618", "problem_id": "p03297", "submission1_id": "s298673787", "submission2_id": "s802848106", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class query:\n def __init__(self, a, b, c, d):\n self.a = a\n self.b = b\n self.c = c\n self.d = d\n def isEternal(self):\n if self.a < self.b:\n return \"No\"\n ab = self.a % self.b\n if ab > self.c:\n return \"No\"\n if self.d < self.b:\n return \"No\"\n d = self.b - self.c\n if d <= 0:\n return \"Yes\"\n if self.b % d == 0 and self.d % d == 0:\n return \"Yes\"\n db = self.d % self.b\n if db == 0:\n return \"Yes\"\n q, r = divmod((self.c - ab), db)\n q += 1 if r != 0 else 0\n if q * db < self.b - ab:\n return \"No\"\n return \"Yes\"\n\nif __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n", "code2": "def gcd(a, b):\n r = a % b\n while r != 0:\n a, b, r = b, r, b % r\n return b\n\nclass query:\n def __init__(self, a, b, c, d):\n self.a = a\n self.b = b\n self.c = c\n self.d = d\n def isEternal(self):\n if self.a < self.b:\n return \"No\"\n if self.d < self.b:\n return \"No\"\n if self.b <= self.c:\n return \"Yes\"\n g = gcd(self.d, self.b)\n if self.b - g + self.a % g > self.c:\n return \"No\"\n return \"Yes\"\n\nif __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531624258", "date2": "1531631102", "bleu_score": "0.7101017761836365", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 102, "input": "14\n9 7 9 9\n9 7 6 9\n14 10 7 12\n14 10 8 12\n14 10 9 12\n14 10 7 11\n14 10 8 11\n14 10 9 11\n11 19 3 10\n10 11 5 10\n11 10 5 10\n16 10 5 10\n1000000000100000000 17 14 999999999999999985\n1000000000000000000 27 15 999999999999999985\n", "actual_output": "Yes\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nNo\nYes\nNo\nYes\nYes\n", "expected_output": "Yes\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nNo\nYes\nNo\nYes\nNo\n\n", "anno_code": ["class query: # (0): query=\n def __init__(self, a, b, c, d):\n self.a = a\n self.b = b\n self.c = c\n self.d = d\n def isEternal(self):\n if self.a < self.b:\n return \"No\"\n ab = self.a % self.b\n if ab > self.c:\n return \"No\"\n if self.d < self.b:\n return \"No\"\n d = self.b - self.c\n if d <= 0:\n return \"Yes\"\n if self.b % d == 0 and self.d % d == 0:\n return \"Yes\"\n db = self.d % self.b\n if db == 0:\n return \"Yes\"\n q, r = divmod((self.c - ab), db)\n q += 1 if r != 0 else 0\n if q * db < self.b - ab:\n return \"No\"\n return \"Yes\"\n\nif __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n"], "anno_status": [false], "diff_content": "+def gcd(a, b):\n+ r = a % b\n+ while r != 0:\n+ a, b, r = b, r, b % r\n+ return b\n+\n class query:\n def __init__(self, a, b, c, d):\n self.a = a\n self.b = b\n self.c = c\n self.d = d\n def isEternal(self):\n if self.a < self.b:\n return \"No\"\n- ab = self.a % self.b\n- if ab > self.c:\n- return \"No\"\n if self.d < self.b:\n return \"No\"\n- d = self.b - self.c\n- if d <= 0:\n- return \"Yes\"\n- if self.b % d == 0 and self.d % d == 0:\n- return \"Yes\"\n- db = self.d % self.b\n- if db == 0:\n+ if self.b <= self.c:\n return \"Yes\"\n- q, r = divmod((self.c - ab), db)\n- q += 1 if r != 0 else 0\n- if q * db < self.b - ab:\n+ g = gcd(self.d, self.b)\n+ if self.b - g + self.a % g > self.c:\n return \"No\"\n return \"Yes\"\n \n if __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n \n", "FL_content": " class query:\n def __init__(self, a, b, c, d):\n self.a = a\n self.b = b\n self.c = c\n self.d = d\n def isEternal(self):\n if self.a < self.b:\n return \"No\"\n- ab = self.a % self.b\n- if ab > self.c:\n- return \"No\"\n if self.d < self.b:\n return \"No\"\n- d = self.b - self.c\n- if d <= 0:\n- return \"Yes\"\n- if self.b % d == 0 and self.d % d == 0:\n- return \"Yes\"\n- db = self.d % self.b\n- if db == 0:\n return \"Yes\"\n- q, r = divmod((self.c - ab), db)\n- q += 1 if r != 0 else 0\n- if q * db < self.b - ab:\n return \"No\"\n return \"Yes\"\n \n if __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n \n", "added_lines": 9, "removed_lines": 13, "code1_lines": 34 }, { "user_id": "u961683878", "problem_id": "p03297", "submission1_id": "s681510378", "submission2_id": "s423997668", "status1": "Wrong Answer", "status2": "Accepted", "code1": "T = int(input())\na = []\nfor i in range(T):\n a.append(list(map(int, input().split())))\nfor r in a:\n s, b, c, d = r[0], r[1], r[2], r[3]\n s_list = []\n while True:\n if (s < b) or (b>d):\n print('No')\n break\n if (c>s):\n print('Yes')\n s = s%b\n s_list.append(s)\n if c < s < b:\n print('No')\n break\n\n s = s+d\n if s in s_list:\n print('Yes')\n break\n s_list.append(s)\n", "code2": "def gcd(a, b):\n\twhile b:\n\t\ta, b = b, a % b\n\treturn a\n\n\nT = int(input())\na = []\nfor i in range(T):\n a.append(list(map(int, input().split())))\nfor r in a:\n s, b, c, d = r[0], r[1], r[2], r[3]\n mod_list = []\n if (s < b) or (b>d):\n print('No')\n continue\n if (c>b):\n print('Yes')\n continue\n\n g = gcd(b,d)\n\n if b- g + s%g > c:\n print('No')\n else:\n print('Yes')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531625397", "date2": "1531627608", "bleu_score": "0.6478049716582922", "code1_test_status": [0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1], "code1_test_score": 37, "total_score": 102, "input": "14\n7 7 5 9\n9 7 4 9\n14 3 7 12\n14 10 15 12\n14 10 9 12\n3 11 7 9\n14 10 8 11\n14 10 9 11\n10 10 3 10\n10 13 6 10\n11 10 5 10\n16 10 5 10\n1000010000100000000 17 5 1378844900267354047\n1000000000000000000 16 15 1358327919252224189\n", "actual_output": "No\nNo\nYes\nYes\nYes\nYes\nYes\nYes\nNo\nNo\nYes\nYes\nNo\nYes\nNo\nNo\nYes\n", "expected_output": "No\nNo\nYes\nYes\nYes\nNo\nNo\nYes\nYes\nNo\nYes\nNo\nNo\nYes\n\n", "anno_code": ["T = int(input()) # (0): T=14\na = [] # (1): a=[]\nfor i in range(T): # (2): i=0 (4): i=1 ... (30): NO CHANGE\n a.append(list(map(int, input().split()))) # (3): a (5): a ... (29): a\nfor r in a: # (31): r=[7, 7, 5, 9] (69): r=[9, 7, 4, 9] ... (478): r=[1000000000000000000, 16, 15, 1358327919252224189]\n s, b, c, d = r[0], r[1], r[2], r[3] # (32): s=7, b=7, c=5, d=9 (70): s=9, c=4 ... (479): s=1000000000000000000, b=16, c=15, d=1358327919252224189\n s_list = [] # (33): s_list=[] (71): s_list=[] ... (480): s_list=[]\n while True: # (34): NO CHANGE (43): NO CHANGE ... (625): NO CHANGE\n if (s < b) or (b>d): # (35): NO CHANGE (44): NO CHANGE ... (626): NO CHANGE\n print('No') # (244): NO CHANGE (432): NO CHANGE\n break # (245): NO CHANGE (433): NO CHANGE\n if (c>s): # (36): NO CHANGE (45): NO CHANGE ... (627): NO CHANGE\n print('Yes') # (126): NO CHANGE (163): NO CHANGE (173): NO CHANGE\n s = s%b # (37): s=0 (46): s=2 ... (628): s=0\n s_list.append(s) # (38): s_list=[0] (47): s_list=[0, 9, 2] ... (629): s_list=[0, 1358327919252224189, ..., 1358327919252224192, 0]\n if c < s < b: # (39): NO CHANGE (48): NO CHANGE ... (630): NO CHANGE\n print('No') # (67): NO CHANGE (96): NO CHANGE ... (476): NO CHANGE\n break # (68): NO CHANGE (97): NO CHANGE ... (477): NO CHANGE\n\n s = s+d # (40): s=9 (49): s=11 ... (631): s=1358327919252224189\n if s in s_list: # (41): NO CHANGE (50): NO CHANGE ... (632): NO CHANGE\n print('Yes') # (118): NO CHANGE (179): NO CHANGE ... (633): NO CHANGE\n break # (119): NO CHANGE (180): NO CHANGE ... (634): NO CHANGE\n s_list.append(s) # (42): s_list=[0, 9] (51): s_list=[0, 9, 2, 11] ... (624): s_list=[0, 1358327919252224189, ..., 3, 1358327919252224192]\n"], "anno_status": [false], "diff_content": "+def gcd(a, b):\n+\twhile b:\n+\t\ta, b = b, a % b\n+\treturn a\n+\n+\n T = int(input())\n a = []\n for i in range(T):\n a.append(list(map(int, input().split())))\n for r in a:\n s, b, c, d = r[0], r[1], r[2], r[3]\n- s_list = []\n- while True:\n- if (s < b) or (b>d):\n- print('No')\n- break\n- if (c>s):\n- print('Yes')\n- s = s%b\n- s_list.append(s)\n- if c < s < b:\n- print('No')\n- break\n+ mod_list = []\n+ if (s < b) or (b>d):\n+ print('No')\n+ continue\n+ if (c>b):\n+ print('Yes')\n+ continue\n \n- s = s+d\n- if s in s_list:\n- print('Yes')\n- break\n- s_list.append(s)\n+ g = gcd(b,d)\n \n+ if b- g + s%g > c:\n+ print('No')\n+ else:\n+ print('Yes')\n", "FL_content": " T = int(input())\n a = []\n for i in range(T):\n a.append(list(map(int, input().split())))\n for r in a:\n s, b, c, d = r[0], r[1], r[2], r[3]\n- s_list = []\n- while True:\n- if (s < b) or (b>d):\n- print('No')\n- break\n- if (c>s):\n- print('Yes')\n- s = s%b\n- s_list.append(s)\n- if c < s < b:\n- print('No')\n- break\n \n- s = s+d\n- if s in s_list:\n- print('Yes')\n- break\n- s_list.append(s)\n \n", "added_lines": 18, "removed_lines": 17, "code1_lines": 25 }, { "user_id": "u695811449", "problem_id": "p03297", "submission1_id": "s761941121", "submission2_id": "s116989003", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def gcd(a, b):\n\twhile b:\n\t\ta, b = b, a % b\n\treturn a\n\nT=int(input())\nJuice=[None]*T\nfor i in range(T):\n Juice[i]=list(map(int,input().split()))\n\n\n\n\n\ndef juicecheck(i):\n A=Juice[i][0]\n B=Juice[i][1]\n C=Juice[i][2]\n D=Juice[i][3]\n\n if AD:\n print(\"No\")\n return\n elif B-1<=C:\n print(\"Yes\")\n return\n else:\n x=A%B\n y=D%B\n \n\n z=gcd(B,D)\n\n if z==1 or (C+1)%z<=x%zB%z and ((C+1)%z<=x%z or x%zD:\n print(\"No\")\n return\n elif B-1<=C:\n print(\"Yes\")\n return\n else:\n x=A%B\n y=D%B\n \n\n z=gcd(B,D)\n\n if z==1 or B-(C+1)>=z or (C+1)%z<=x%z<=(B-1)%z or ( (C+1)%z>B%z and ((C+1)%z<=x%z or x%z\n\twhile b: # (45): NO CHANGE (47): NO CHANGE ... (269): i=13, A=1000000000000000000, B=17, C=15, D=999999999999999985, x=15, y=0, z=17\n\t\ta, b = b, a % b # (46): a=11, b=7 (48): a=7, b=4 ... (268): a=17, b=0\n\treturn a\n\nT=int(input()) # (1): T=14\nJuice=[None]*T # (2): Juice=[None, None, None, None, None, None, None, None, None, None, None, None, None, None]\nfor i in range(T): # (3): i=0 (5): Juice, i=1 ... (31): NO CHANGE\n Juice[i]=list(map(int,input().split())) # (4): Juice (6): Juice ... (30): Juice\n\n\n\n\n\ndef juicecheck(i): # (32): juicecheck=\n A=Juice[i][0] # (35): A=9 (61): A=12 ... (255): A=1000000000000000000\n B=Juice[i][1] # (36): B=7 (62): B=7 ... (256): B=17\n C=Juice[i][2] # (37): C=5 (63): C=12 ... (257): C=15\n D=Juice[i][3] # (38): D=11 (64): D=9 ... (258): D=999999999999999985\n\n if A, T=14, Juice, juicecheck= (186): gcd=, T=14, Juice, juicecheck=\n elif B>D: # (40): NO CHANGE (66): NO CHANGE ... (260): NO CHANGE\n print(\"No\") # (213): NO CHANGE\n return # (214): gcd=, T=14, Juice, juicecheck=\n elif B-1<=C: # (41): NO CHANGE (67): NO CHANGE ... (261): NO CHANGE\n print(\"Yes\") # (68): NO CHANGE (176): NO CHANGE\n return # (69): gcd=, T=14, Juice, juicecheck= (177): gcd=, T=14, Juice, juicecheck=\n else:\n x=A%B # (42): x=2 (79): x=4 ... (262): x=15\n y=D%B # (43): y=4 (80): y=2 ... (263): y=0\n \n\n z=gcd(B,D) # (44): a=7, b=11 (81): a=10, b=12 ... (264): a=17, b=999999999999999985\n\n if z==1 or (C+1)%z<=x%zB%z and ((C+1)%z<=x%z or x%z, T=14, Juice, juicecheck= (144): gcd=, T=14, Juice, juicecheck= ... (232): gcd=, T=14, Juice, juicecheck=\n\n print(\"Yes\") # (90): NO CHANGE (112): NO CHANGE ... (271): NO CHANGE\n return # (91): gcd=, T=14, Juice, juicecheck= (113): gcd=, T=14, Juice, juicecheck= ... (272): gcd=, T=14, Juice, juicecheck=\n \n \n\nfor i in range(T): # (33): i=0 (59): i=1 ... (253): i=13\n juicecheck(i) # (34): NO CHANGE (60): NO CHANGE ... (254): NO CHANGE\n"], "anno_status": [false], "diff_content": " def gcd(a, b):\n \twhile b:\n \t\ta, b = b, a % b\n \treturn a\n \n T=int(input())\n Juice=[None]*T\n for i in range(T):\n Juice[i]=list(map(int,input().split()))\n \n \n \n \n \n def juicecheck(i):\n A=Juice[i][0]\n B=Juice[i][1]\n C=Juice[i][2]\n D=Juice[i][3]\n \n if AD:\n print(\"No\")\n return\n elif B-1<=C:\n print(\"Yes\")\n return\n else:\n x=A%B\n y=D%B\n \n \n z=gcd(B,D)\n \n- if z==1 or (C+1)%z<=x%zB%z and ((C+1)%z<=x%z or x%z=z or (C+1)%z<=x%z<=(B-1)%z or ( (C+1)%z>B%z and ((C+1)%z<=x%z or x%zD:\n print(\"No\")\n return\n elif B-1<=C:\n print(\"Yes\")\n return\n else:\n x=A%B\n y=D%B\n \n \n z=gcd(B,D)\n \n- if z==1 or (C+1)%z<=x%zB%z and ((C+1)%z<=x%z or x%z int:\n if a < b: a,b = b,a\n return a if b == 0 else gcd(b,a%b)\ndef lcm (a: int,b: int) -> int:\n return a \n\n\nfor i in range(T):\n A,B,C,D = map(int,input().split(\" \"))\n g = gcd(B,D)\n if C >= ((B - g) + (A % g)):\n print(\"Yes\")\n else:\n print(\"No\")\n\n\n", "code2": "T = int(input())\n\ndef gcd (a: int,b: int) -> int:\n if a < b: a,b = b,a\n return a if b == 0 else gcd(b,a%b)\ndef lcm (a: int,b: int) -> int:\n return a \n\n\nfor i in range(T):\n A,B,C,D = map(int,input().split(\" \"))\n g = gcd(B,D)\n if A < B or D < B:\n print(\"No\")\n continue\n if C >= ((B - g) + (A % g)):\n print(\"Yes\")\n else:\n print(\"No\")\n\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1552779546", "date2": "1552779725", "bleu_score": "0.8435448311520366", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1], "code1_test_score": 52, "total_score": 102, "input": "14\n9 7 5 9\n9 7 6 9\n14 10 7 12\n14 10 15 3\n14 10 9 12\n22 10 7 11\n14 10 8 11\n14 10 9 11\n9 17 3 10\n10 11 5 10\n11 10 5 10\n16 10 5 10\n1000000000100000000 17 14 999999999999999985\n1000001000000000000 16 15 999999999999999985\n", "actual_output": "No\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nNo\nYes\nNo\nYes\nYes\n", "expected_output": "No\nYes\nNo\nNo\nYes\nNo\nNo\nYes\nNo\nNo\nYes\nNo\nYes\nYes\n\n", "anno_code": ["T = int(input()) # (0): T=14\n\ndef gcd (a: int,b: int) -> int: # (1): gcd=\n if a < b: a,b = b,a # (6): b=2 (7): a=2, b=1 ... (113): T=14, gcd=, lcm=, i=13, A=1000001000000000000, B=16, C=15, D=999999999999999985, g=1\n return a if b == 0 else gcd(b,a%b)\ndef lcm (a: int,b: int) -> int: # (2): lcm=\n return a \n\n\nfor i in range(T): # (3): i=0 (12): i=1 ... (108): i=13\n A,B,C,D = map(int,input().split(\" \")) # (4): A=9, B=7, C=5, D=9 (13): C=6 ... (109): A=1000001000000000000, B=16, C=15\n g = gcd(B,D) # (5): a=7, b=9 (14): a=7, b=9 ... (110): a=16, b=999999999999999985\n if C >= ((B - g) + (A % g)): # (10): NO CHANGE (19): NO CHANGE ... (114): NO CHANGE\n print(\"Yes\") # (20): NO CHANGE (36): NO CHANGE ... (115): NO CHANGE\n else:\n print(\"No\") # (11): NO CHANGE (28): NO CHANGE ... (100): NO CHANGE\n\n\n"], "anno_status": [false], "diff_content": " T = int(input())\n \n def gcd (a: int,b: int) -> int:\n if a < b: a,b = b,a\n return a if b == 0 else gcd(b,a%b)\n def lcm (a: int,b: int) -> int:\n return a \n \n \n for i in range(T):\n A,B,C,D = map(int,input().split(\" \"))\n g = gcd(B,D)\n+ if A < B or D < B:\n+ print(\"No\")\n+ continue\n if C >= ((B - g) + (A % g)):\n print(\"Yes\")\n else:\n print(\"No\")\n \n \n \n", "FL_content": " T = int(input())\n \n def gcd (a: int,b: int) -> int:\n if a < b: a,b = b,a\n return a if b == 0 else gcd(b,a%b)\n def lcm (a: int,b: int) -> int:\n return a \n \n \n for i in range(T):\n A,B,C,D = map(int,input().split(\" \"))\n g = gcd(B,D)\n if C >= ((B - g) + (A % g)):\n print(\"Yes\")\n else:\n print(\"No\")\n \n \n \n", "added_lines": 3, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u515607273", "problem_id": "p03297", "submission1_id": "s737889091", "submission2_id": "s023195635", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nn=int(input())\nfor _ in range(n):\n a,b,c,d=map(int,input().split())\n if dc:\n print(\"No\")\n continue\n print(\"Yes\")\n", "code2": "import fractions \nn=int(input())\nfor _ in range(n):\n a,b,c,d=map(int,input().split())\n if d=b:\n print(\"Yes\")\n continue\n g=fractions.gcd(b,d)\n h=((b-1-a%b)\n if a%b+h>c:\n print(\"No\")\n continue\n print(\"Yes\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531619409", "date2": "1531619841", "bleu_score": "0.7202402254333741", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "14\n9 7 5 9\n9 7 2 9\n1 10 7 12\n14 10 5 12\n12 10 9 12\n11 11 7 11\n14 10 8 11\n14 10 9 11\n9 10 3 10\n10 11 5 10\n11 10 9 10\n16 7 5 10\n1000000000100000000 17 14 999999999999999985\n0000000000000000000 16 15 959335908062480470\n", "actual_output": "Yes\nYes\nNo\nYes\nYes\nYes\nYes\nYes\nNo\nNo\nYes\nYes\nYes\nNo\n", "expected_output": "No\nNo\nNo\nNo\nYes\nYes\nNo\nYes\nNo\nNo\nYes\nNo\nYes\nNo\n\n", "anno_code": ["import math\nn=int(input()) # (0): n=14\nfor _ in range(n): # (1): _=0 (9): _=1 ... (98): _=13\n a,b,c,d=map(int,input().split()) # (2): a=9, b=7, c=5, d=9 (10): c=2 ... (99): a=0, b=16, c=15, d=959335908062480470\n if dc: # (7): NO CHANGE (15): NO CHANGE ... (96): NO CHANGE\n print(\"No\")\n continue\n print(\"Yes\") # (8): NO CHANGE (16): NO CHANGE ... (97): NO CHANGE\n"], "anno_status": [false], "diff_content": "-import math\n+import fractions \n n=int(input())\n for _ in range(n):\n a,b,c,d=map(int,input().split())\n if dc:\n+ elif c>=b:\n+ print(\"Yes\")\n+ continue\n+ g=fractions.gcd(b,d)\n+ h=((b-1-a%b)\n+ if a%b+h>c:\n print(\"No\")\n continue\n print(\"Yes\")\n-\n", "FL_content": "-import math\n n=int(input())\n for _ in range(n):\n a,b,c,d=map(int,input().split())\n if dc:\n print(\"No\")\n continue\n print(\"Yes\")\n-\n", "added_lines": 7, "removed_lines": 5, "code1_lines": 17 }, { "user_id": "u847467233", "problem_id": "p02458", "submission1_id": "s303395059", "submission2_id": "s119665155", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nfrom bisect import bisect_left, bisect_right, insort_left\ndict = {}\nkeytbl = []\ncnt = 0\nq = int(input())\nfor i in range(q):\n\ta = list(input().split())\n\tki = int(a[1])\n\tif a[0] == '0':\n\t\tif ki not in dict:\n\t\t\tdict[ki] = 1\n\t\t\tinsort_left(keytbl, ki)\n\t\telse: dict[ki] += 1\n\t\tcnt += 1\n\t\tprint(cnt)\n\telif a[0] == '1': print(dict[ki] if ki in dict else 0)\n\telif a[0] == '2':\n\t\tif ki in dict:\n\t\t\tcnt -= dict[ki]\n\t\t\tdict[ki] = 0\n\telse:\n\t\tL = bisect_left (keytbl, int(a[1]))\n\t\tR = bisect_right(keytbl, int(a[2]), L)\n\t\tfor j in range(L, R):\n\t\t\tif dict[keytbl[j]] > 0: print(keytbl[j])\n", "code2": "\n\n\nfrom bisect import bisect_left, bisect_right, insort_left\ndict = {}\nkeytbl = []\ncnt = 0\nq = int(input())\nfor i in range(q):\n\ta = list(input().split())\n\tki = int(a[1])\n\tif a[0] == '0':\n\t\tif ki not in dict:\n\t\t\tdict[ki] = 1\n\t\t\tinsort_left(keytbl, ki)\n\t\telse: dict[ki] += 1\n\t\tcnt += 1\n\t\tprint(cnt)\n\telif a[0] == '1': print(dict[ki] if ki in dict else 0)\n\telif a[0] == '2':\n\t\tif ki in dict:\n\t\t\tcnt -= dict[ki]\n\t\t\tdict[ki] = 0\n\telse:\n\t\tL = bisect_left (keytbl, int(a[1]))\n\t\tR = bisect_right(keytbl, int(a[2]), L)\n\t\tfor j in range(L, R):\n\t\t\tfor k in range(dict[keytbl[j]]): print(keytbl[j])\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1529833747", "date2": "1529834240", "bleu_score": "0.969645057306938", "code1_test_status": [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 85, "total_score": 101, "input": "10\n1 1\n0 1\n0 2\n1 3\n2 2\n1 1\n0 1\n1 6\n1 4\n3 1 4\n", "actual_output": "0\n1\n2\n0\n1\n2\n0\n0\n1\n", "expected_output": "0\n1\n2\n0\n1\n2\n0\n0\n1\n1\n\n", "anno_code": ["\n\n\nfrom bisect import bisect_left, bisect_right, insort_left\ndict = {} # (0): dict={}\nkeytbl = [] # (1): keytbl=[]\ncnt = 0 # (2): cnt=0\nq = int(input()) # (3): q=10\nfor i in range(q): # (4): i=0 (9): i=1 ... (64): i=9\n\ta = list(input().split()) # (5): a=['1', '1'] (10): a=['0', '1'] ... (65): a=['3', '1', '4']\n\tki = int(a[1]) # (6): ki=1 (11): NO CHANGE ... (66): ki=1\n\tif a[0] == '0': # (7): NO CHANGE (12): NO CHANGE ... (67): NO CHANGE\n\t\tif ki not in dict: # (13): NO CHANGE (22): NO CHANGE (50): NO CHANGE\n\t\t\tdict[ki] = 1 # (14): dict={1: 1} (23): dict={1: 1, 2: 1}\n\t\t\tinsort_left(keytbl, ki) # (15): keytbl=[1] (24): keytbl=[1, 2]\n\t\telse: dict[ki] += 1 # (51): dict={1: 2, 2: 0}\n\t\tcnt += 1 # (16): cnt=1 (25): cnt=2 (52): cnt=2\n\t\tprint(cnt) # (17): NO CHANGE (26): NO CHANGE (53): NO CHANGE\n\telif a[0] == '1': print(dict[ki] if ki in dict else 0) # (8): NO CHANGE (31): NO CHANGE ... (68): NO CHANGE\n\telif a[0] == '2': # (37): NO CHANGE (69): NO CHANGE\n\t\tif ki in dict: # (38): NO CHANGE\n\t\t\tcnt -= dict[ki] # (39): cnt=1\n\t\t\tdict[ki] = 0 # (40): dict={1: 1, 2: 0}\n\telse:\n\t\tL = bisect_left (keytbl, int(a[1])) # (70): L=0\n\t\tR = bisect_right(keytbl, int(a[2]), L) # (71): R=2\n\t\tfor j in range(L, R): # (72): j=0 (74): j=1 (76): NO CHANGE\n\t\t\tif dict[keytbl[j]] > 0: print(keytbl[j]) # (73): NO CHANGE (75): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n \n \n from bisect import bisect_left, bisect_right, insort_left\n dict = {}\n keytbl = []\n cnt = 0\n q = int(input())\n for i in range(q):\n \ta = list(input().split())\n \tki = int(a[1])\n \tif a[0] == '0':\n \t\tif ki not in dict:\n \t\t\tdict[ki] = 1\n \t\t\tinsort_left(keytbl, ki)\n \t\telse: dict[ki] += 1\n \t\tcnt += 1\n \t\tprint(cnt)\n \telif a[0] == '1': print(dict[ki] if ki in dict else 0)\n \telif a[0] == '2':\n \t\tif ki in dict:\n \t\t\tcnt -= dict[ki]\n \t\t\tdict[ki] = 0\n \telse:\n \t\tL = bisect_left (keytbl, int(a[1]))\n \t\tR = bisect_right(keytbl, int(a[2]), L)\n \t\tfor j in range(L, R):\n-\t\t\tif dict[keytbl[j]] > 0: print(keytbl[j])\n+\t\t\tfor k in range(dict[keytbl[j]]): print(keytbl[j])\n \n", "FL_content": " \n \n \n from bisect import bisect_left, bisect_right, insort_left\n dict = {}\n keytbl = []\n cnt = 0\n q = int(input())\n for i in range(q):\n \ta = list(input().split())\n \tki = int(a[1])\n \tif a[0] == '0':\n \t\tif ki not in dict:\n \t\t\tdict[ki] = 1\n \t\t\tinsort_left(keytbl, ki)\n \t\telse: dict[ki] += 1\n \t\tcnt += 1\n \t\tprint(cnt)\n \telif a[0] == '1': print(dict[ki] if ki in dict else 0)\n \telif a[0] == '2':\n \t\tif ki in dict:\n \t\t\tcnt -= dict[ki]\n \t\t\tdict[ki] = 0\n \telse:\n \t\tL = bisect_left (keytbl, int(a[1]))\n \t\tR = bisect_right(keytbl, int(a[2]), L)\n \t\tfor j in range(L, R):\n-\t\t\tif dict[keytbl[j]] > 0: print(keytbl[j])\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 29 }, { "user_id": "u905582793", "problem_id": "p03183", "submission1_id": "s056367462", "submission2_id": "s385367911", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nwsv = [list(map(int,input().split())) for i in range(n)]\nwsv.sort(key = lambda x:x[0]+x[1],reverse=True)\nsmx = max(list(zip(*wsv))[1])\ndp = [[0 for i in range(smx+1)] for j in range(n+1)]\nfor i in range(1,n+1):\n dp[i] = dp[i-1][:]\n w,s,v = wsv[i-1]\n dp[i][s] = max(dp[i-1][s],v)\n for ss in range(smx+1)[::-1]:\n sn = min(ss-w,s)\n if sn >= 0:\n dp[i][sn] = max(dp[i-1][sn],dp[i-1][ss]+v)\nprint(max(dp[-1]))", "code2": "n = int(input())\nwsv = [list(map(int,input().split())) for i in range(n)]\nwsv.sort(key = lambda x:x[0]+x[1],reverse=True)\nsmx = max(list(zip(*wsv))[1])\ndp = [[0 for i in range(smx+1)] for j in range(n+1)]\nfor i in range(1,n+1):\n dp[i] = dp[i-1][:]\n w,s,v = wsv[i-1]\n dp[i][s] = max(dp[i-1][s],v)\n for ss in range(smx+1)[::-1]:\n sn = min(ss-w,s)\n if sn >= 0 and dp[i-1][ss]:\n dp[i][sn] = max(dp[i][sn],dp[i-1][sn],dp[i-1][ss]+v)\nprint(max(dp[-1]))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1591215247", "date2": "1591216050", "bleu_score": "0.9401425280444373", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 104, "input": "3\n3 5 20\n1 1 7\n3 1 40\n", "actual_output": "47\n", "expected_output": "67\n\n", "anno_code": ["n = int(input()) # (0): n=3\nwsv = [list(map(int,input().split())) for i in range(n)] # (1): wsv\nwsv.sort(key = lambda x:x[0]+x[1],reverse=True) # (2): wsv\nsmx = max(list(zip(*wsv))[1]) # (3): smx=5\ndp = [[0 for i in range(smx+1)] for j in range(n+1)] # (4): dp\nfor i in range(1,n+1): # (5): i=1 (31): i=2 ... (85): NO CHANGE\n dp[i] = dp[i-1][:] # (6): NO CHANGE (32): dp (58): dp\n w,s,v = wsv[i-1] # (7): w=3, s=5, v=20 (33): s=1, v=40 (59): w=1, v=7\n dp[i][s] = max(dp[i-1][s],v) # (8): dp=[[0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 20], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0]] (34): dp (60): NO CHANGE\n for ss in range(smx+1)[::-1]: # (9): ss=5 (13): ss=4 ... (84): NO CHANGE\n sn = min(ss-w,s) # (10): sn=2 (14): sn=1 ... (82): sn=-1\n if sn >= 0: # (11): NO CHANGE (15): NO CHANGE ... (83): NO CHANGE\n dp[i][sn] = max(dp[i-1][sn],dp[i-1][ss]+v) # (12): dp (16): dp ... (80): dp\nprint(max(dp[-1]))"], "anno_status": [true], "diff_content": " n = int(input())\n wsv = [list(map(int,input().split())) for i in range(n)]\n wsv.sort(key = lambda x:x[0]+x[1],reverse=True)\n smx = max(list(zip(*wsv))[1])\n dp = [[0 for i in range(smx+1)] for j in range(n+1)]\n for i in range(1,n+1):\n dp[i] = dp[i-1][:]\n w,s,v = wsv[i-1]\n dp[i][s] = max(dp[i-1][s],v)\n for ss in range(smx+1)[::-1]:\n sn = min(ss-w,s)\n- if sn >= 0:\n- dp[i][sn] = max(dp[i-1][sn],dp[i-1][ss]+v)\n+ if sn >= 0 and dp[i-1][ss]:\n+ dp[i][sn] = max(dp[i][sn],dp[i-1][sn],dp[i-1][ss]+v)\n print(max(dp[-1]))\n", "FL_content": " n = int(input())\n wsv = [list(map(int,input().split())) for i in range(n)]\n wsv.sort(key = lambda x:x[0]+x[1],reverse=True)\n smx = max(list(zip(*wsv))[1])\n dp = [[0 for i in range(smx+1)] for j in range(n+1)]\n for i in range(1,n+1):\n dp[i] = dp[i-1][:]\n w,s,v = wsv[i-1]\n dp[i][s] = max(dp[i-1][s],v)\n for ss in range(smx+1)[::-1]:\n sn = min(ss-w,s)\n- if sn >= 0:\n- dp[i][sn] = max(dp[i-1][sn],dp[i-1][ss]+v)\n print(max(dp[-1]))\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 14 }, { "user_id": "u498487134", "problem_id": "p03183", "submission1_id": "s100207052", "submission2_id": "s109651631", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\ndef I(): return int(input())\ndef MI(): return map(int, input().split())\ndef LI(): return list(map(int, input().split()))\n\ndef main():\n mod=10**9+7\n \n \n N=I()\n wsv=[]\n for i in range(N):\n w,s,v=MI()\n wsv.append([w,s,v])\n \n wsv.sort(key=lambda x:(x[0]+x[1]))\n \n N2=2*(10**4) +1\n dp=[[-1]*N2 for _ in range(N+1)]\n \n for i in range(N):\n w,s,v=wsv[i]\n for j in range(N2):\n dp[i+1][j]=max(dp[i][j],dp[i+1][j])\n if s>=j and j+w<=(N2-1):\n dp[i+1][j+w]=max(dp[i+1][j+w],dp[i][j]+v)\n \n print(max(dp[-1]))\n \n \n\nmain()\n", "code2": "\ndef I(): return int(input())\ndef MI(): return map(int, input().split())\ndef LI(): return list(map(int, input().split()))\n\ndef main():\n mod=10**9+7\n \n \n N=I()\n wsv=[]\n for i in range(N):\n w,s,v=MI()\n wsv.append([w,s,v])\n \n wsv.sort(key=lambda x:(x[0]+x[1]))\n \n N2=2*(10**4) +1\n dp=[[0]*N2 for _ in range(N+1)]\n \n for i in range(N):\n w,s,v=wsv[i]\n for j in range(N2):\n dp[i+1][j]=max(dp[i][j],dp[i+1][j])\n if s>=j and j+w<=(N2-1):\n dp[i+1][j+w]=max(dp[i+1][j+w],dp[i][j]+v)\n \n print(max(dp[-1]))\n \n \n\nmain()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589510594", "date2": "1589510692", "bleu_score": "0.9915664365281138", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 104, "input": "5\n1 10001 1000000001\n1 10101 1000001000\n1 10000 1000000000\n2 11001 1000001000\n1 00010 1000010010\n", "actual_output": "5000012010\n", "expected_output": "5000012011\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n-\n-\n def I(): return int(input())\n def MI(): return map(int, input().split())\n def LI(): return list(map(int, input().split()))\n \n def main():\n mod=10**9+7\n \n \n N=I()\n wsv=[]\n for i in range(N):\n w,s,v=MI()\n wsv.append([w,s,v])\n \n wsv.sort(key=lambda x:(x[0]+x[1]))\n \n N2=2*(10**4) +1\n- dp=[[-1]*N2 for _ in range(N+1)]\n+ dp=[[0]*N2 for _ in range(N+1)]\n \n for i in range(N):\n w,s,v=wsv[i]\n for j in range(N2):\n dp[i+1][j]=max(dp[i][j],dp[i+1][j])\n if s>=j and j+w<=(N2-1):\n dp[i+1][j+w]=max(dp[i+1][j+w],dp[i][j]+v)\n \n print(max(dp[-1]))\n \n \n \n main()\n \n", "FL_content": " \n-\n-\n def I(): return int(input())\n def MI(): return map(int, input().split())\n def LI(): return list(map(int, input().split()))\n \n def main():\n mod=10**9+7\n \n \n N=I()\n wsv=[]\n for i in range(N):\n w,s,v=MI()\n wsv.append([w,s,v])\n \n wsv.sort(key=lambda x:(x[0]+x[1]))\n \n N2=2*(10**4) +1\n- dp=[[-1]*N2 for _ in range(N+1)]\n \n for i in range(N):\n w,s,v=wsv[i]\n for j in range(N2):\n dp[i+1][j]=max(dp[i][j],dp[i+1][j])\n if s>=j and j+w<=(N2-1):\n dp[i+1][j+w]=max(dp[i+1][j+w],dp[i][j]+v)\n \n print(max(dp[-1]))\n \n \n \n main()\n \n", "added_lines": 1, "removed_lines": 3, "code1_lines": 35 }, { "user_id": "u297574184", "problem_id": "p03183", "submission1_id": "s118517210", "submission2_id": "s818390121", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\ndef solve():\n N = int(input())\n items = [tuple(map(int, input().split())) for _ in range(N)]\n\n capW = max([w+s for w, s, v in items])\n items.sort(key=lambda x: x[0]+x[1])\n\n def knapsack01(items, capW):\n dp = [0] * (capW+1)\n for wi, si, vi in items:\n for w in reversed(range(wi, si+wi+1)):\n v0 = dp[w-wi] + vi\n if v0 > dp[w]:\n dp[w] = v0\n return dp[-1]\n\n ans = knapsack01(items, capW)\n print(ans)\n\n\nsolve()\n", "code2": "import sys\ninput = sys.stdin.readline\n\ndef solve():\n N = int(input())\n items = [tuple(map(int, input().split())) for _ in range(N)]\n\n capW = max([w+s for w, s, v in items])\n items.sort(key=lambda x: x[0]+x[1])\n\n def knapsack01(items, capW):\n dp = [0] * (capW+1)\n for wi, si, vi in items:\n for w in reversed(range(wi, si+wi+1)):\n v0 = dp[w-wi] + vi\n if v0 > dp[w]:\n dp[w] = v0\n return max(dp)\n\n ans = knapsack01(items, capW)\n print(ans)\n\n\nsolve()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1592089925", "date2": "1592090531", "bleu_score": "0.9858053183960847", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1], "code1_test_score": 33, "total_score": 104, "input": "3\n3 5 20\n1 1 7\n3 1 40\n", "actual_output": "20\n", "expected_output": "67\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\ndef solve(): # (1): solve=\n N = int(input()) # (3): N=3\n items = [tuple(map(int, input().split())) for _ in range(N)] # (4): items=[(3, 5, 20), (1, 1, 7), (3, 1, 40)]\n\n capW = max([w+s for w, s, v in items]) # (5): capW=8\n items.sort(key=lambda x: x[0]+x[1]) # (6): items=[(1, 1, 7), (3, 1, 40), (3, 5, 20)]\n\n def knapsack01(items, capW): # (7): knapsack01=.knapsack01 at 0x0000029C23EE9B40>\n dp = [0] * (capW+1) # (9): dp=[0, 0, 0, 0, 0, 0, 0, 0, 0]\n for wi, si, vi in items: # (10): wi=1, si=1, vi=7 (20): wi=3, vi=40 ... (54): N=3, knapsack01=.knapsack01 at 0x0000029C23EE9B40>, ans=20\n for w in reversed(range(wi, si+wi+1)): # (11): w=2 (15): w=1 ... (53): NO CHANGE\n v0 = dp[w-wi] + vi # (12): v0=7 (16): NO CHANGE ... (51): v0=20\n if v0 > dp[w]: # (13): NO CHANGE (17): NO CHANGE ... (52): NO CHANGE\n dp[w] = v0 # (14): dp=[0, 0, 7, 0, 0, 0, 0, 0, 0] (18): dp=[0, 7, 7, 0, 0, 0, 0, 0, 0] ... (46): dp=[0, 7, 7, 40, 47, 27, 60, 67, 20]\n return dp[-1]\n\n ans = knapsack01(items, capW) # (8): NO CHANGE\n print(ans)\n\n\nsolve() # (2): NO CHANGE\n"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n \n def solve():\n N = int(input())\n items = [tuple(map(int, input().split())) for _ in range(N)]\n \n capW = max([w+s for w, s, v in items])\n items.sort(key=lambda x: x[0]+x[1])\n \n def knapsack01(items, capW):\n dp = [0] * (capW+1)\n for wi, si, vi in items:\n for w in reversed(range(wi, si+wi+1)):\n v0 = dp[w-wi] + vi\n if v0 > dp[w]:\n dp[w] = v0\n- return dp[-1]\n+ return max(dp)\n \n ans = knapsack01(items, capW)\n print(ans)\n \n \n solve()\n \n", "FL_content": " import sys\n input = sys.stdin.readline\n \n def solve():\n N = int(input())\n items = [tuple(map(int, input().split())) for _ in range(N)]\n \n capW = max([w+s for w, s, v in items])\n items.sort(key=lambda x: x[0]+x[1])\n \n def knapsack01(items, capW):\n dp = [0] * (capW+1)\n for wi, si, vi in items:\n for w in reversed(range(wi, si+wi+1)):\n v0 = dp[w-wi] + vi\n if v0 > dp[w]:\n dp[w] = v0\n- return dp[-1]\n \n ans = knapsack01(items, capW)\n print(ans)\n \n \n solve()\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 25 }, { "user_id": "u498487134", "problem_id": "p03183", "submission1_id": "s481726690", "submission2_id": "s109651631", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef I(): return int(input())\ndef MI(): return map(int, input().split())\ndef LI(): return list(map(int, input().split()))\n\ndef main():\n mod=10**9+7\n \n \n N=I()\n wsv=[]\n for i in range(N):\n w,s,v=MI()\n wsv.append([w,s,v])\n \n wsv.sort(key=lambda x:(x[0]+x[1]))\n \n N2=2*(10**4) +1\n dp=[[-1]*N2 for _ in range(N+1)]\n \n for i in range(N):\n w,s,v=wsv[i]\n for j in range(N2):\n dp[i+1][j]=max(dp[i][j],dp[i+1][j])\n if s>=j and j+w<=(10**4):\n dp[i+1][j+w]=max(dp[i+1][j+w],dp[i][j]+v)\n \n print(max(dp[-1]))\n \n \n\nmain()\n", "code2": "\ndef I(): return int(input())\ndef MI(): return map(int, input().split())\ndef LI(): return list(map(int, input().split()))\n\ndef main():\n mod=10**9+7\n \n \n N=I()\n wsv=[]\n for i in range(N):\n w,s,v=MI()\n wsv.append([w,s,v])\n \n wsv.sort(key=lambda x:(x[0]+x[1]))\n \n N2=2*(10**4) +1\n dp=[[0]*N2 for _ in range(N+1)]\n \n for i in range(N):\n w,s,v=wsv[i]\n for j in range(N2):\n dp[i+1][j]=max(dp[i][j],dp[i+1][j])\n if s>=j and j+w<=(N2-1):\n dp[i+1][j+w]=max(dp[i+1][j+w],dp[i][j]+v)\n \n print(max(dp[-1]))\n \n \n\nmain()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589510549", "date2": "1589510692", "bleu_score": "0.9861653580814093", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 104, "input": "4\n1 2 5\n3 3 7\n2 4 3\n2 8 2\n", "actual_output": "16\n", "expected_output": "17\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n def I(): return int(input())\n def MI(): return map(int, input().split())\n def LI(): return list(map(int, input().split()))\n \n def main():\n mod=10**9+7\n \n \n N=I()\n wsv=[]\n for i in range(N):\n w,s,v=MI()\n wsv.append([w,s,v])\n \n wsv.sort(key=lambda x:(x[0]+x[1]))\n \n N2=2*(10**4) +1\n- dp=[[-1]*N2 for _ in range(N+1)]\n+ dp=[[0]*N2 for _ in range(N+1)]\n \n for i in range(N):\n w,s,v=wsv[i]\n for j in range(N2):\n dp[i+1][j]=max(dp[i][j],dp[i+1][j])\n- if s>=j and j+w<=(10**4):\n+ if s>=j and j+w<=(N2-1):\n dp[i+1][j+w]=max(dp[i+1][j+w],dp[i][j]+v)\n \n print(max(dp[-1]))\n \n \n \n main()\n \n", "FL_content": " \n def I(): return int(input())\n def MI(): return map(int, input().split())\n def LI(): return list(map(int, input().split()))\n \n def main():\n mod=10**9+7\n \n \n N=I()\n wsv=[]\n for i in range(N):\n w,s,v=MI()\n wsv.append([w,s,v])\n \n wsv.sort(key=lambda x:(x[0]+x[1]))\n \n N2=2*(10**4) +1\n- dp=[[-1]*N2 for _ in range(N+1)]\n \n for i in range(N):\n w,s,v=wsv[i]\n for j in range(N2):\n dp[i+1][j]=max(dp[i][j],dp[i+1][j])\n- if s>=j and j+w<=(10**4):\n dp[i+1][j+w]=max(dp[i+1][j+w],dp[i][j]+v)\n \n print(max(dp[-1]))\n \n \n \n main()\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 33 }, { "user_id": "u677523557", "problem_id": "p04008", "submission1_id": "s268594505", "submission2_id": "s829073815", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\n\nN, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nans = 0\ngraph = [[] for _ in range(N)]\nPar = [-1]*N\nfor i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n Par[i] = a-1\n graph[a-1].append(i)\n\nqs = []\n\nstack = [0]\nDepth = [-1]*N\nDepth[0] = 0\nwhile stack:\n p = stack.pop()\n for np in graph[p]:\n Depth[np] = Depth[p] + 1\n stack.append(np)\n qs.append((Depth[p], p))\n\nqs.sort(reverse=True)\nchecked = [False]*N\n\nfor d, s in qs:\n if d <= K: break\n if checked[s]: continue\n\n for _ in range(K-1):\n s = Par[s]\n \n que = [s]\n while que:\n qq = []\n for p in que:\n for np in graph[p]:\n if not checked[np]:\n checked[np] = True\n qq.append(np)\n que = qq\n \n ans += 1\n\nprint(ans)", "code2": "import sys\ninput = sys.stdin.readline\n\n\nN, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nans = 0\ngraph = [[] for _ in range(N)]\nPar = [-1]*N\nfor i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n Par[i] = a-1\n graph[a-1].append(i)\n\nqs = []\n\nstack = [0]\nDepth = [-1]*N\nDepth[0] = 0\nwhile stack:\n p = stack.pop()\n for np in graph[p]:\n Depth[np] = Depth[p] + 1\n stack.append(np)\n qs.append((Depth[p], p))\n\nqs.sort(reverse=True)\nchecked = [False]*N\n\nfor d, s in qs:\n if d <= K: break\n if checked[s]: continue\n\n for _ in range(K-1):\n s = Par[s]\n \n que = [s]\n checked[s] = True\n while que:\n qq = []\n for p in que:\n for np in graph[p]:\n if not checked[np]:\n checked[np] = True\n qq.append(np)\n que = qq\n \n ans += 1\n\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1591570852", "date2": "1591571270", "bleu_score": "0.9763313262875812", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 90, "total_score": 97, "input": "8 2\n4 1 2 3 1 2 4 7\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\n\nN, K = map(int, input().split()) # (1): N=8, K=2\nA = list(map(int, input().split())) # (2): A=[4, 1, 2, 3, 1, 2, 4, 7]\n\nans = 0 # (3): ans=0\ngraph = [[] for _ in range(N)] # (4): graph\nPar = [-1]*N # (5): Par=[-1, -1, -1, -1, -1, -1, -1, -1]\nfor i, a in enumerate(A): # (6): i=0, a=4 (11): i=1, a=1 ... (39): graph\n if i == 0: # (7): NO CHANGE (12): NO CHANGE ... (36): graph\n if a != 1: # (8): NO CHANGE\n ans += 1 # (9): ans=1\n continue # (10): NO CHANGE\n Par[i] = a-1 # (13): Par=[-1, 0, -1, -1, -1, -1, -1, -1] (17): graph=[[1], [], [], [], [], [], [], []], Par=[-1, 0, 1, -1, -1, -1, -1, -1] ... (37): graph, Par=[-1, 0, 1, 2, 0, 1, 3, 6]\n graph[a-1].append(i) # (14): graph (18): graph ... (38): graph\n\nqs = [] # (40): graph, qs=[]\n\nstack = [0] # (41): graph, stack=[0]\nDepth = [-1]*N # (42): graph, Depth=[-1, -1, -1, -1, -1, -1, -1, -1]\nDepth[0] = 0 # (43): graph, Depth=[0, -1, -1, -1, -1, -1, -1, -1]\nwhile stack: # (44): graph (54): graph ... (97): graph\n p = stack.pop() # (45): graph=[[1, 4], [2, 5], [3], [6], [], [], [7], []], stack=[], p=0 (55): graph=[[1, 4], [2, 5], [3], [6], [], [], [7], []], stack=[1], p=4 ... (94): graph=[[1, 4], [2, 5], [3], [6], [], [], [7], []], stack=[], p=7\n for np in graph[p]: # (46): graph, np=1 (49): graph, np=4 ... (95): graph\n Depth[np] = Depth[p] + 1 # (47): graph, Depth=[0, 1, -1, -1, -1, -1, -1, -1] (50): graph, Depth=[0, 1, -1, -1, 1, -1, -1, -1] ... (89): graph, Depth=[0, 1, 2, 3, 1, 2, 4, 5]\n stack.append(np) # (48): graph, stack=[1] (51): graph, stack=[1, 4] ... (90): graph, stack=[7]\n qs.append((Depth[p], p)) # (53): graph, qs=[(0, 0)] (57): graph, qs=[(0, 0), (1, 4)] ... (96): graph, qs=[(0, 0), (1, 4), (1, 1), (2, 5), (2, 2), (3, 3), (4, 6), (5, 7)]\n\nqs.sort(reverse=True) # (98): graph, qs=[(5, 7), (4, 6), (3, 3), (2, 5), (2, 2), (1, 4), (1, 1), (0, 0)]\nchecked = [False]*N # (99): graph, checked=[False, False, False, False, False, False, False, False]\n\nfor d, s in qs: # (100): graph, d=5, s=7 (125): graph, d=4 ... (179): graph, d=2, s=5\n if d <= K: break # (101): graph (126): graph ... (180): graph\n if checked[s]: continue # (102): graph (127): graph (154): graph\n\n for _ in range(K-1): # (103): graph, _=0 (105): graph ... (157): graph\n s = Par[s] # (104): graph, s=6 (129): graph, s=3 (156): graph, s=2\n \n que = [s] # (106): graph, que=[6] (131): graph, que=[3] (158): graph, que=[2]\n while que: # (107): graph (117): graph ... (177): graph\n qq = [] # (108): graph, qq=[] (118): graph, qq=[] ... (170): graph, qq=[]\n for p in que: # (109): graph, p=6 (115): graph ... (175): graph\n for np in graph[p]: # (110): graph (114): graph ... (174): graph\n if not checked[np]: # (111): graph (136): graph ... (173): graph\n checked[np] = True # (112): graph, checked=[False, False, False, False, False, False, False, True] (137): graph, checked=[False, False, False, False, False, False, True, True] (164): graph, checked=[False, False, False, True, False, False, True, True]\n qq.append(np) # (113): graph, qq=[7] (138): graph, qq=[6] (165): graph, qq=[3]\n que = qq # (116): graph, que=[7] (122): graph, que=[] ... (176): graph, que=[]\n \n ans += 1 # (124): ans=2, graph (151): ans=3, graph (178): ans=4, graph\n\nprint(ans)"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n \n \n N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n ans = 0\n graph = [[] for _ in range(N)]\n Par = [-1]*N\n for i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n Par[i] = a-1\n graph[a-1].append(i)\n \n qs = []\n \n stack = [0]\n Depth = [-1]*N\n Depth[0] = 0\n while stack:\n p = stack.pop()\n for np in graph[p]:\n Depth[np] = Depth[p] + 1\n stack.append(np)\n qs.append((Depth[p], p))\n \n qs.sort(reverse=True)\n checked = [False]*N\n \n for d, s in qs:\n if d <= K: break\n if checked[s]: continue\n \n for _ in range(K-1):\n s = Par[s]\n \n que = [s]\n+ checked[s] = True\n while que:\n qq = []\n for p in que:\n for np in graph[p]:\n if not checked[np]:\n checked[np] = True\n qq.append(np)\n que = qq\n \n ans += 1\n \n print(ans)\n", "FL_content": " import sys\n input = sys.stdin.readline\n \n \n N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n ans = 0\n graph = [[] for _ in range(N)]\n Par = [-1]*N\n for i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n Par[i] = a-1\n graph[a-1].append(i)\n \n qs = []\n \n stack = [0]\n Depth = [-1]*N\n Depth[0] = 0\n while stack:\n p = stack.pop()\n for np in graph[p]:\n Depth[np] = Depth[p] + 1\n stack.append(np)\n qs.append((Depth[p], p))\n \n qs.sort(reverse=True)\n checked = [False]*N\n \n for d, s in qs:\n if d <= K: break\n if checked[s]: continue\n \n for _ in range(K-1):\n s = Par[s]\n \n que = [s]\n while que:\n qq = []\n for p in que:\n for np in graph[p]:\n if not checked[np]:\n checked[np] = True\n qq.append(np)\n que = qq\n \n ans += 1\n \n print(ans)\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 53 }, { "user_id": "u693716675", "problem_id": "p04008", "submission1_id": "s379043547", "submission2_id": "s728107826", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nsys.setrecursionlimit(2 * 10 ** 5 + 10)\n\nn,k = [int(i) for i in input().split()]\na = [int(i)-1 for i in input().split()]\n\n\ndef dfs(u, d):\n change = 0\n if d>k:\n d = 0\n change += 1\n for v in edges[u]:\n change += dfs(v, d+1)\n return change\n\n\ncnt = 0\nif a[0]!=0:\n cnt += 1\n\nedges = [[] for _ in range(n)]\nfor i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n\ncnt += dfs(0,0) \nprint(cnt)", "code2": "\n\n\n\nimport sys\nsys.setrecursionlimit(2 * 10 ** 5 + 10)\n\nn,k = [int(i) for i in input().split()]\na = [int(i)-1 for i in input().split()]\n\n\n\ndef dfs(u):\n global cnt\n depth = 0 \n \n for v in edges[u]:\n depth = max(depth, (dfs(v)+1)%k) \n \n \n if depth==k-1 and u!=0 and a[u] != 0:\n cnt += 1\n \n return depth\n\n\ncnt = 0\nif a[0]!=0:\n cnt += 1\n\nedges = [[] for _ in range(n)]\nfor i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n\ndfs(0) \nprint(cnt)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583625138", "date2": "1583629077", "bleu_score": "0.78113689876801", "code1_test_status": [1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 82, "total_score": 97, "input": "8 2\n-1 1 4 5 1 1 5 4\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["\nimport sys\nsys.setrecursionlimit(2 * 10 ** 5 + 10) # (0): NO CHANGE\n\nn,k = [int(i) for i in input().split()] # (1): n=8, k=2\na = [int(i)-1 for i in input().split()] # (2): a=[-2, 0, 3, 4, 0, 0, 4, 3]\n\n\ndef dfs(u, d): # (3): dfs=\n change = 0 # (31): change=0 (35): change=0 ... (69): change=0\n if d>k: # (32): NO CHANGE (36): NO CHANGE ... (70): NO CHANGE\n d = 0 # (50): d=0 (57): d=0\n change += 1 # (51): change=1 (58): change=1\n for v in edges[u]: # (33): v=1 (37): u=0, d=0, v=1 ... (72): sys=, n=8, k=2, a=[-2, 0, 3, 4, 0, 0, 4, 3], dfs=, cnt=3, edges, i=7, pa=3\n change += dfs(v, d+1) # (34): u=1, d=1 (39): u=4, d=1 ... (68): u=5, d=1\n return change\n\n\ncnt = 0 # (4): cnt=0\nif a[0]!=0: # (5): NO CHANGE\n cnt += 1 # (6): cnt=1\n\nedges = [[] for _ in range(n)] # (7): edges\nfor i in range(1,n): # (8): i=1 (11): edges, i=2 ... (29): edges\n pa = a[i] # (9): pa=0 (12): edges=[[1], [], [], [], [], [], [], []], pa=3 ... (27): edges, pa=3\n edges[a[i]].append(i) # (10): edges (13): edges ... (28): edges\n\ncnt += dfs(0,0) # (30): u=0, d=0\nprint(cnt)"], "anno_status": [true], "diff_content": " \n+\n+\n+\n import sys\n sys.setrecursionlimit(2 * 10 ** 5 + 10)\n \n n,k = [int(i) for i in input().split()]\n a = [int(i)-1 for i in input().split()]\n \n \n-def dfs(u, d):\n- change = 0\n- if d>k:\n- d = 0\n- change += 1\n+\n+def dfs(u):\n+ global cnt\n+ depth = 0 \n+ \n for v in edges[u]:\n- change += dfs(v, d+1)\n- return change\n+ depth = max(depth, (dfs(v)+1)%k) \n+ \n+ \n+ if depth==k-1 and u!=0 and a[u] != 0:\n+ cnt += 1\n+ \n+ return depth\n \n \n cnt = 0\n if a[0]!=0:\n cnt += 1\n \n edges = [[] for _ in range(n)]\n for i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n \n-cnt += dfs(0,0) \n+dfs(0) \n print(cnt)\n", "FL_content": " \n import sys\n sys.setrecursionlimit(2 * 10 ** 5 + 10)\n \n n,k = [int(i) for i in input().split()]\n a = [int(i)-1 for i in input().split()]\n \n \n-def dfs(u, d):\n- change = 0\n- if d>k:\n- d = 0\n- change += 1\n for v in edges[u]:\n- change += dfs(v, d+1)\n- return change\n \n \n cnt = 0\n if a[0]!=0:\n cnt += 1\n \n edges = [[] for _ in range(n)]\n for i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n \n-cnt += dfs(0,0) \n print(cnt)\n", "added_lines": 16, "removed_lines": 8, "code1_lines": 29 }, { "user_id": "u423585790", "problem_id": "p04008", "submission1_id": "s749965836", "submission2_id": "s321934376", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(10**6)\nn,k = map(int,input().split())\na = [int(i)-1 for i in input().split()]\nedg = [[] for i in range(n)]\nfor i in range(1,n):\n edg[a[i]].append(i)\nans = [0] * n\nans[0] = a[0] != 0\ndef dfs(now):\n res = 0\n for e in edg[now]:\n res = max(res, dfs(e)+1)\n if res == k - 1 and a[now] != 0:\n ans[now] = 1\n res = 0\n return res\n \ndfs(0)\nprint(sum(ans))\n", "code2": "import sys\nsys.setrecursionlimit(10**6)\nn,k = map(int,input().split())\na = [int(i)-1 for i in input().split()]\nedg = [[] for i in range(n)]\nfor i in range(1,n):\n edg[a[i]].append(i)\nans = [0] * n\nans[0] = a[0] != 0\ndef dfs(now):\n res = 0\n for e in edg[now]:\n res = max(res, dfs(e)+1)\n if res == k - 1 and a[now] != 0:\n ans[now] = 1\n res = -1\n return res\n \ndfs(0)\nprint(sum(ans))\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1590166000", "date2": "1590166300", "bleu_score": "0.991160658072406", "code1_test_status": [1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 85, "total_score": 97, "input": "8 2\n4 1 4 5 1 1 1 3\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["import sys\nsys.setrecursionlimit(10**6) # (0): NO CHANGE\nn,k = map(int,input().split()) # (1): n=8, k=2\na = [int(i)-1 for i in input().split()] # (2): a=[3, 0, 3, 4, 0, 0, 0, 2]\nedg = [[] for i in range(n)] # (3): edg\nfor i in range(1,n): # (4): i=1 (6): edg, i=2 ... (18): edg\n edg[a[i]].append(i) # (5): edg (7): edg ... (17): edg\nans = [0] * n # (19): edg, ans=[0, 0, 0, 0, 0, 0, 0, 0]\nans[0] = a[0] != 0 # (20): edg, ans=[True, 0, 0, 0, 0, 0, 0, 0]\ndef dfs(now): # (21): edg, dfs=\n res = 0 # (23): res=0 (26): res=0 ... (60): res=0\n for e in edg[now]: # (24): e=1 (27): NO CHANGE ... (63): NO CHANGE\n res = max(res, dfs(e)+1) # (25): now=1 (30): now=4 ... (59): now=6\n if res == k - 1 and a[now] != 0: # (28): now=0, res=1, e=1 (42): now=2, res=1, e=7 ... (64): sys=, n=8, k=2, a=[3, 0, 3, 4, 0, 0, 0, 2], edg=[[1, 4, 5, 6], [], [7], [2], [3], [], [], []], i=7, ans=[True, 0, 1, 1, 0, 0, 0, 0], dfs=\n ans[now] = 1 # (45): NO CHANGE (49): NO CHANGE\n res = 0 # (46): now=3, e=2 (50): now=4, e=3\n return res\n \ndfs(0) # (22): now=0\nprint(sum(ans))\n"], "anno_status": [true], "diff_content": " import sys\n sys.setrecursionlimit(10**6)\n n,k = map(int,input().split())\n a = [int(i)-1 for i in input().split()]\n edg = [[] for i in range(n)]\n for i in range(1,n):\n edg[a[i]].append(i)\n ans = [0] * n\n ans[0] = a[0] != 0\n def dfs(now):\n res = 0\n for e in edg[now]:\n res = max(res, dfs(e)+1)\n if res == k - 1 and a[now] != 0:\n ans[now] = 1\n- res = 0\n+ res = -1\n return res\n \n dfs(0)\n print(sum(ans))\n \n", "FL_content": " import sys\n sys.setrecursionlimit(10**6)\n n,k = map(int,input().split())\n a = [int(i)-1 for i in input().split()]\n edg = [[] for i in range(n)]\n for i in range(1,n):\n edg[a[i]].append(i)\n ans = [0] * n\n ans[0] = a[0] != 0\n def dfs(now):\n res = 0\n for e in edg[now]:\n res = max(res, dfs(e)+1)\n if res == k - 1 and a[now] != 0:\n ans[now] = 1\n- res = 0\n return res\n \n dfs(0)\n print(sum(ans))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 21 }, { "user_id": "u693716675", "problem_id": "p04008", "submission1_id": "s241468999", "submission2_id": "s728107826", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nsys.setrecursionlimit(2 * 10 ** 5 + 10)\n\nn,k = [int(i) for i in input().split()]\na = [int(i)-1 for i in input().split()]\n\n\ndef dfs(u, d):\n change = 0\n if d>k:\n d = 1\n change += 1\n for v in edges[u]:\n change += dfs(v, d+1)\n return change\n\n\ncnt = 0\nif a[0]!=0:\n cnt += 1\n\nedges = [[] for _ in range(n)]\nfor i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n\ncnt += dfs(0,0) \nprint(cnt)", "code2": "\n\n\n\nimport sys\nsys.setrecursionlimit(2 * 10 ** 5 + 10)\n\nn,k = [int(i) for i in input().split()]\na = [int(i)-1 for i in input().split()]\n\n\n\ndef dfs(u):\n global cnt\n depth = 0 \n \n for v in edges[u]:\n depth = max(depth, (dfs(v)+1)%k) \n \n \n if depth==k-1 and u!=0 and a[u] != 0:\n cnt += 1\n \n return depth\n\n\ncnt = 0\nif a[0]!=0:\n cnt += 1\n\nedges = [[] for _ in range(n)]\nfor i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n\ndfs(0) \nprint(cnt)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583624721", "date2": "1583629077", "bleu_score": "0.7801365697309435", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 88, "total_score": 97, "input": "8 2\n-1 1 4 5 1 4 5 4\n", "actual_output": "4\n", "expected_output": "2\n\n", "anno_code": ["\nimport sys\nsys.setrecursionlimit(2 * 10 ** 5 + 10) # (0): NO CHANGE\n\nn,k = [int(i) for i in input().split()] # (1): n=8, k=2\na = [int(i)-1 for i in input().split()] # (2): a=[-2, 0, 3, 4, 0, 3, 4, 3]\n\n\ndef dfs(u, d): # (3): dfs=\n change = 0 # (31): change=0 (35): change=0 ... (70): change=0\n if d>k: # (32): NO CHANGE (36): NO CHANGE ... (71): NO CHANGE\n d = 1 # (50): d=1 (57): d=1 (64): d=1\n change += 1 # (51): change=1 (58): change=1 (65): change=1\n for v in edges[u]: # (33): v=1 (37): u=0, d=0, v=1 ... (74): sys=, n=8, k=2, a=[-2, 0, 3, 4, 0, 3, 4, 3], dfs=, cnt=4, edges, i=7, pa=3\n change += dfs(v, d+1) # (34): u=1, d=1 (39): u=4, d=1 ... (69): u=6, d=2\n return change\n\n\ncnt = 0 # (4): cnt=0\nif a[0]!=0: # (5): NO CHANGE\n cnt += 1 # (6): cnt=1\n\nedges = [[] for _ in range(n)] # (7): edges\nfor i in range(1,n): # (8): i=1 (11): edges, i=2 ... (29): edges\n pa = a[i] # (9): pa=0 (12): edges=[[1], [], [], [], [], [], [], []], pa=3 ... (27): edges, pa=3\n edges[a[i]].append(i) # (10): edges (13): edges ... (28): edges\n\ncnt += dfs(0,0) # (30): u=0, d=0\nprint(cnt)"], "anno_status": [true], "diff_content": " \n+\n+\n+\n import sys\n sys.setrecursionlimit(2 * 10 ** 5 + 10)\n \n n,k = [int(i) for i in input().split()]\n a = [int(i)-1 for i in input().split()]\n \n \n-def dfs(u, d):\n- change = 0\n- if d>k:\n- d = 1\n- change += 1\n+\n+def dfs(u):\n+ global cnt\n+ depth = 0 \n+ \n for v in edges[u]:\n- change += dfs(v, d+1)\n- return change\n+ depth = max(depth, (dfs(v)+1)%k) \n+ \n+ \n+ if depth==k-1 and u!=0 and a[u] != 0:\n+ cnt += 1\n+ \n+ return depth\n \n \n cnt = 0\n if a[0]!=0:\n cnt += 1\n \n edges = [[] for _ in range(n)]\n for i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n \n-cnt += dfs(0,0) \n+dfs(0) \n print(cnt)\n", "FL_content": " \n import sys\n sys.setrecursionlimit(2 * 10 ** 5 + 10)\n \n n,k = [int(i) for i in input().split()]\n a = [int(i)-1 for i in input().split()]\n \n \n-def dfs(u, d):\n- change = 0\n- if d>k:\n- d = 1\n- change += 1\n for v in edges[u]:\n- change += dfs(v, d+1)\n- return change\n \n \n cnt = 0\n if a[0]!=0:\n cnt += 1\n \n edges = [[] for _ in range(n)]\n for i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n \n-cnt += dfs(0,0) \n print(cnt)\n", "added_lines": 16, "removed_lines": 8, "code1_lines": 29 }, { "user_id": "u754022296", "problem_id": "p04008", "submission1_id": "s947234594", "submission2_id": "s783745218", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nsys.setrecursionlimit(10**7)\nn, k = map(int, input().split())\nA = list(map(int, input().split()))\nans = 0\nif A[0] != 1:\n ans += 1\nC = [[] for _ in range(n+1)]\nP = [-1 for _ in range(n+1)]\nfor i, a in enumerate(A[1:], 2):\n C[a].append(i)\n P[i] = a\ndef dfs(v):\n global ans\n temp = 0\n for nv in C[v]:\n temp = max(temp, dfs(nv)+1)\n if v == 1:\n return\n if P[v] != 1 and temp == k-1:\n temp = 0\n ans += 1\n return temp\ndfs(1)\nprint(ans)", "code2": "import sys\ninput = sys.stdin.readline\nsys.setrecursionlimit(10**7)\n\nn, k = map(int, input().split())\nA = list(map(int, input().split()))\nans = 0\nif A[0] != 1:\n ans += 1\nC = [[] for _ in range(n+1)]\nP = [-1]*(n+1)\nfor i, a in enumerate(A[1:], 2):\n C[a].append(i)\n P[i] = a\ndef dfs(v):\n global ans\n temp = 0\n for nv in C[v]:\n temp = max(temp, dfs(nv)+1)\n if v == 1:\n return\n if P[v] != 1 and temp == k-1:\n temp = -1\n ans += 1\n return temp\ndfs(1)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1592374499", "date2": "1592374597", "bleu_score": "0.9543940545981936", "code1_test_status": [1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 85, "total_score": 97, "input": "8 2\n4 1 4 5 1 2 1 3\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\nsys.setrecursionlimit(10**7) # (1): NO CHANGE\nn, k = map(int, input().split()) # (2): n=8, k=2\nA = list(map(int, input().split())) # (3): A=[4, 1, 4, 5, 1, 2, 1, 3]\nans = 0 # (4): ans=0\nif A[0] != 1: # (5): NO CHANGE\n ans += 1 # (6): ans=1\nC = [[] for _ in range(n+1)] # (7): C\nP = [-1 for _ in range(n+1)] # (8): P=[-1, -1, -1, -1, -1, -1, -1, -1, -1]\nfor i, a in enumerate(A[1:], 2): # (9): i=2, a=1 (12): C, i=3, a=4 ... (30): C\n C[a].append(i) # (10): C (13): C ... (28): C\n P[i] = a # (11): C=[[], [2], [], [], [], [], [], [], []], P=[-1, -1, 1, -1, -1, -1, -1, -1, -1] (14): C=[[], [2], [], [], [3], [], [], [], []], P=[-1, -1, 1, 4, -1, -1, -1, -1, -1] ... (29): C, P=[-1, -1, 1, 4, 5, 1, 2, 1, 3]\ndef dfs(v): # (31): C, dfs=\n global ans\n temp = 0 # (33): temp=0 (36): temp=0 ... (76): temp=0\n for nv in C[v]: # (34): nv=2 (37): nv=6 ... (80): NO CHANGE\n temp = max(temp, dfs(nv)+1) # (35): v=2 (38): v=6 ... (75): v=7\n if v == 1: # (41): NO CHANGE (44): NO CHANGE ... (81): NO CHANGE\n return # (82): sys=, input=, n=8, k=2, A=[4, 1, 4, 5, 1, 2, 1, 3], ans=3, C=[[], [2, 5, 7], [6], [8], [3], [4], [], [], []], P=[-1, -1, 1, 4, 5, 1, 2, 1, 3], i=8, a=3, dfs=\n if P[v] != 1 and temp == k-1: # (42): v=2, temp=1, nv=6 (45): v=1, temp=2, nv=2 ... (79): v=1, temp=2, nv=7\n temp = 0 # (64): temp=0 (69): temp=0\n ans += 1 # (65): v=4, temp=1, nv=3 (70): v=5, temp=1, nv=4\n return temp\ndfs(1) # (32): v=1\nprint(ans)"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n sys.setrecursionlimit(10**7)\n+\n n, k = map(int, input().split())\n A = list(map(int, input().split()))\n ans = 0\n if A[0] != 1:\n ans += 1\n C = [[] for _ in range(n+1)]\n-P = [-1 for _ in range(n+1)]\n+P = [-1]*(n+1)\n for i, a in enumerate(A[1:], 2):\n C[a].append(i)\n P[i] = a\n def dfs(v):\n global ans\n temp = 0\n for nv in C[v]:\n temp = max(temp, dfs(nv)+1)\n if v == 1:\n return\n if P[v] != 1 and temp == k-1:\n- temp = 0\n+ temp = -1\n ans += 1\n return temp\n dfs(1)\n print(ans)\n", "FL_content": " import sys\n input = sys.stdin.readline\n sys.setrecursionlimit(10**7)\n n, k = map(int, input().split())\n A = list(map(int, input().split()))\n ans = 0\n if A[0] != 1:\n ans += 1\n C = [[] for _ in range(n+1)]\n-P = [-1 for _ in range(n+1)]\n for i, a in enumerate(A[1:], 2):\n C[a].append(i)\n P[i] = a\n def dfs(v):\n global ans\n temp = 0\n for nv in C[v]:\n temp = max(temp, dfs(nv)+1)\n if v == 1:\n return\n if P[v] != 1 and temp == k-1:\n- temp = 0\n ans += 1\n return temp\n dfs(1)\n print(ans)\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 26 }, { "user_id": "u423585790", "problem_id": "p04008", "submission1_id": "s365945895", "submission2_id": "s321934376", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(10**6)\nn,k = map(int,input().split())\na = [int(i)-1 for i in input().split()]\nedg = [[] for i in range(n)]\nfor i in range(1,n):\n edg[a[i]].append(i)\nans = [0] * n\nans[0] = a[0] != 0\ndef dfs(now):\n res = 0\n for e in edg[now]:\n res = max(res, dfs(e))\n if res == k - 1 and a[now] != 0:\n ans[now] = 1\n res = 0\n return res + 1\n \ndfs(0)\nprint(sum(ans))\n", "code2": "import sys\nsys.setrecursionlimit(10**6)\nn,k = map(int,input().split())\na = [int(i)-1 for i in input().split()]\nedg = [[] for i in range(n)]\nfor i in range(1,n):\n edg[a[i]].append(i)\nans = [0] * n\nans[0] = a[0] != 0\ndef dfs(now):\n res = 0\n for e in edg[now]:\n res = max(res, dfs(e)+1)\n if res == k - 1 and a[now] != 0:\n ans[now] = 1\n res = -1\n return res\n \ndfs(0)\nprint(sum(ans))\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1590165956", "date2": "1590166300", "bleu_score": "0.9791805163079995", "code1_test_status": [1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 85, "total_score": 97, "input": "8 2\n4 1 2 3 1 2 4 6\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["import sys\nsys.setrecursionlimit(10**6) # (0): NO CHANGE\nn,k = map(int,input().split()) # (1): n=8, k=2\na = [int(i)-1 for i in input().split()] # (2): a=[3, 0, 1, 2, 0, 1, 3, 5]\nedg = [[] for i in range(n)] # (3): edg\nfor i in range(1,n): # (4): i=1 (6): edg, i=2 ... (18): edg\n edg[a[i]].append(i) # (5): edg (7): edg ... (17): edg\nans = [0] * n # (19): edg, ans=[0, 0, 0, 0, 0, 0, 0, 0]\nans[0] = a[0] != 0 # (20): edg, ans=[True, 0, 0, 0, 0, 0, 0, 0]\ndef dfs(now): # (21): edg, dfs=\n res = 0 # (23): res=0 (26): res=0 ... (62): res=0\n for e in edg[now]: # (24): e=1 (27): e=2 ... (65): NO CHANGE\n res = max(res, dfs(e)) # (25): now=1 (28): now=2 ... (61): now=4\n if res == k - 1 and a[now] != 0: # (37): now=3, res=1, e=6 (39): NO CHANGE ... (66): sys=, n=8, k=2, a=[3, 0, 1, 2, 0, 1, 3, 5], edg=[[1, 4], [2, 5], [3], [6], [], [7], [], []], i=7, ans=[True, 0, 1, 1, 0, 1, 0, 0], dfs=\n ans[now] = 1 # (40): NO CHANGE (44): NO CHANGE (56): NO CHANGE\n res = 0 # (41): now=2, e=3 (45): now=1, e=2 (57): now=1, e=5\n return res + 1\n \ndfs(0) # (22): now=0\nprint(sum(ans))\n"], "anno_status": [true], "diff_content": " import sys\n sys.setrecursionlimit(10**6)\n n,k = map(int,input().split())\n a = [int(i)-1 for i in input().split()]\n edg = [[] for i in range(n)]\n for i in range(1,n):\n edg[a[i]].append(i)\n ans = [0] * n\n ans[0] = a[0] != 0\n def dfs(now):\n res = 0\n for e in edg[now]:\n- res = max(res, dfs(e))\n+ res = max(res, dfs(e)+1)\n if res == k - 1 and a[now] != 0:\n ans[now] = 1\n- res = 0\n- return res + 1\n+ res = -1\n+ return res\n \n dfs(0)\n print(sum(ans))\n \n", "FL_content": " import sys\n sys.setrecursionlimit(10**6)\n n,k = map(int,input().split())\n a = [int(i)-1 for i in input().split()]\n edg = [[] for i in range(n)]\n for i in range(1,n):\n edg[a[i]].append(i)\n ans = [0] * n\n ans[0] = a[0] != 0\n def dfs(now):\n res = 0\n for e in edg[now]:\n- res = max(res, dfs(e))\n if res == k - 1 and a[now] != 0:\n ans[now] = 1\n- res = 0\n- return res + 1\n \n dfs(0)\n print(sum(ans))\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 21 }, { "user_id": "u677523557", "problem_id": "p04008", "submission1_id": "s645427762", "submission2_id": "s829073815", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nimport heapq as hp\n\nN, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nans = 0\ngraph = [[] for _ in range(N)]\nfor i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n graph[a-1].append(i)\n\nstack = [0]\nchildren = [1]*N\nwhile stack:\n p = stack.pop()\n if p >= 0:\n stack.append(~p)\n for np in graph[p]:\n stack.append(np)\n else:\n p = ~p\n for ch in graph[p]:\n children[p] += children[ch]\n\nq = [(-children[0], 0)]\nDepth = [-1]*N\nwhile q:\n _, s = hp.heappop(q)\n if s != 0: ans += 1\n Depth[s] = 0\n que = [s]\n for _ in range(K):\n qq = []\n for p in que:\n for np in graph[p]:\n if Depth[np] == -1:\n Depth[np] = Depth[p] + 1\n qq.append(np)\n if not qq:\n break\n que = qq\n if que:\n for p in que:\n for np in graph[p]:\n hp.heappush(q, (-children[np], np))\n\nprint(ans)", "code2": "import sys\ninput = sys.stdin.readline\n\n\nN, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nans = 0\ngraph = [[] for _ in range(N)]\nPar = [-1]*N\nfor i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n Par[i] = a-1\n graph[a-1].append(i)\n\nqs = []\n\nstack = [0]\nDepth = [-1]*N\nDepth[0] = 0\nwhile stack:\n p = stack.pop()\n for np in graph[p]:\n Depth[np] = Depth[p] + 1\n stack.append(np)\n qs.append((Depth[p], p))\n\nqs.sort(reverse=True)\nchecked = [False]*N\n\nfor d, s in qs:\n if d <= K: break\n if checked[s]: continue\n\n for _ in range(K-1):\n s = Par[s]\n \n que = [s]\n checked[s] = True\n while que:\n qq = []\n for p in que:\n for np in graph[p]:\n if not checked[np]:\n checked[np] = True\n qq.append(np)\n que = qq\n \n ans += 1\n\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1591556804", "date2": "1591571270", "bleu_score": "0.7318512519990166", "code1_test_status": [1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 82, "total_score": 97, "input": "8 1\n3 1 2 2 2 1 2 4\n", "actual_output": "5\n", "expected_output": "6\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=, hp=\nimport heapq as hp\n\nN, K = map(int, input().split()) # (1): N=8, K=1\nA = list(map(int, input().split())) # (2): A=[3, 1, 2, 2, 2, 1, 2, 4]\n\nans = 0 # (3): ans=0\ngraph = [[] for _ in range(N)] # (4): graph\nfor i, a in enumerate(A): # (5): i=0, a=3 (10): i=1, a=1 ... (31): graph\n if i == 0: # (6): NO CHANGE (11): NO CHANGE ... (29): graph\n if a != 1: # (7): NO CHANGE\n ans += 1 # (8): ans=1\n continue # (9): NO CHANGE\n graph[a-1].append(i) # (12): graph (15): graph ... (30): graph\n\nstack = [0] # (32): graph, stack=[0]\nchildren = [1]*N # (33): graph, children=[1, 1, 1, 1, 1, 1, 1, 1]\nwhile stack: # (34): graph (43): graph ... (142): graph\n p = stack.pop() # (35): graph=[[1, 5], [2, 3, 4, 6], [], [7], [], [], [], []], stack=[], p=0 (44): graph=[[1, 5], [2, 3, 4, 6], [], [7], [], [], [], []], stack=[-1, 1], p=5 ... (134): graph=[[1, 5], [2, 3, 4, 6], [], [7], [], [], [], []], stack=[], p=-1\n if p >= 0: # (36): graph (45): graph ... (135): graph\n stack.append(~p) # (37): graph, stack=[-1] (46): graph, stack=[-1, 1, -6] ... (113): graph, stack=[-1, -2, -3]\n for np in graph[p]: # (38): graph, np=1 (40): graph, np=5 ... (114): graph\n stack.append(np) # (39): graph, stack=[-1, 1] (41): graph, stack=[-1, 1, 5] ... (91): graph, stack=[-1, -2, 2, -4, 7]\n else:\n p = ~p # (51): graph, p=5 (74): graph, p=6 ... (136): graph, p=0\n for ch in graph[p]: # (52): graph (75): graph ... (141): graph\n children[p] += children[ch] # (108): graph, children=[1, 1, 1, 2, 1, 1, 1, 1] (125): graph, children=[1, 2, 1, 2, 1, 1, 1, 1] ... (140): graph, children=[8, 6, 1, 2, 1, 1, 1, 1]\n\nq = [(-children[0], 0)] # (143): graph, q=[(-8, 0)]\nDepth = [-1]*N # (144): graph, Depth=[-1, -1, -1, -1, -1, -1, -1, -1]\nwhile q: # (145): graph (180): graph ... (249): graph\n _, s = hp.heappop(q) # (146): graph=[[1, 5], [2, 3, 4, 6], [], [7], [], [], [], []], q=[], _=-8, s=0 (181): graph=[[1, 5], [2, 3, 4, 6], [], [7], [], [], [], []], q=[(-1, 2), (-1, 6), (-1, 4)], _=-2, s=3 ... (234): graph=[[1, 5], [2, 3, 4, 6], [], [7], [], [], [], []], q=[], _=-1, s=6\n if s != 0: ans += 1 # (147): graph (182): ans=2, graph ... (235): ans=5, graph\n Depth[s] = 0 # (148): graph, Depth=[0, -1, -1, -1, -1, -1, -1, -1] (183): graph, Depth=[0, 1, -1, 0, -1, 1, -1, -1] ... (236): graph, Depth=[0, 1, 0, 0, 0, 1, 0, 1]\n que = [s] # (149): graph, que=[0] (184): graph, que=[3] ... (237): graph, que=[6]\n for _ in range(K): # (150): graph, _=0 (165): graph ... (238): graph, _=0\n qq = [] # (151): graph, qq=[] (186): graph, qq=[] ... (239): graph\n for p in que: # (152): graph (162): graph ... (242): graph\n for np in graph[p]: # (153): graph, np=1 (157): graph, np=5 ... (241): graph\n if Depth[np] == -1: # (154): graph (158): graph (189): graph\n Depth[np] = Depth[p] + 1 # (155): graph, Depth=[0, 1, -1, -1, -1, -1, -1, -1] (159): graph, Depth=[0, 1, -1, -1, -1, 1, -1, -1] (190): graph, Depth=[0, 1, -1, 0, -1, 1, -1, 1]\n qq.append(np) # (156): graph, qq=[1] (160): graph, qq=[1, 5] (191): graph, qq=[7]\n if not qq: # (163): graph (194): graph ... (243): graph\n break # (212): graph (228): graph (244): graph\n que = qq # (164): graph, que=[1, 5] (195): graph, que=[7]\n if que: # (166): graph (197): graph ... (245): graph\n for p in que: # (167): graph, p=1 (177): graph, p=5 ... (248): graph\n for np in graph[p]: # (168): graph, np=2 (170): graph, np=3 ... (247): graph\n hp.heappush(q, (-children[np], np)) # (169): graph, q=[(-1, 2)] (171): graph, q=[(-2, 3), (-1, 2)] ... (175): graph, q=[(-2, 3), (-1, 2), (-1, 4), (-1, 6)]\n\nprint(ans)"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n-import heapq as hp\n+\n \n N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n ans = 0\n graph = [[] for _ in range(N)]\n+Par = [-1]*N\n for i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n+ Par[i] = a-1\n graph[a-1].append(i)\n \n+qs = []\n+\n stack = [0]\n-children = [1]*N\n+Depth = [-1]*N\n+Depth[0] = 0\n while stack:\n p = stack.pop()\n- if p >= 0:\n- stack.append(~p)\n- for np in graph[p]:\n- stack.append(np)\n- else:\n- p = ~p\n- for ch in graph[p]:\n- children[p] += children[ch]\n-\n-q = [(-children[0], 0)]\n-Depth = [-1]*N\n-while q:\n- _, s = hp.heappop(q)\n- if s != 0: ans += 1\n- Depth[s] = 0\n+ for np in graph[p]:\n+ Depth[np] = Depth[p] + 1\n+ stack.append(np)\n+ qs.append((Depth[p], p))\n+\n+qs.sort(reverse=True)\n+checked = [False]*N\n+\n+for d, s in qs:\n+ if d <= K: break\n+ if checked[s]: continue\n+\n+ for _ in range(K-1):\n+ s = Par[s]\n+ \n que = [s]\n- for _ in range(K):\n+ checked[s] = True\n+ while que:\n qq = []\n for p in que:\n for np in graph[p]:\n- if Depth[np] == -1:\n- Depth[np] = Depth[p] + 1\n+ if not checked[np]:\n+ checked[np] = True\n qq.append(np)\n- if not qq:\n- break\n que = qq\n- if que:\n- for p in que:\n- for np in graph[p]:\n- hp.heappush(q, (-children[np], np))\n+ \n+ ans += 1\n \n print(ans)\n", "FL_content": " import sys\n input = sys.stdin.readline\n-import heapq as hp\n \n N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n ans = 0\n graph = [[] for _ in range(N)]\n for i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n graph[a-1].append(i)\n \n stack = [0]\n-children = [1]*N\n while stack:\n p = stack.pop()\n- if p >= 0:\n- stack.append(~p)\n- for np in graph[p]:\n- stack.append(np)\n- else:\n- p = ~p\n- for ch in graph[p]:\n- children[p] += children[ch]\n-\n-q = [(-children[0], 0)]\n-Depth = [-1]*N\n-while q:\n- _, s = hp.heappop(q)\n- if s != 0: ans += 1\n- Depth[s] = 0\n que = [s]\n- for _ in range(K):\n qq = []\n for p in que:\n for np in graph[p]:\n- if Depth[np] == -1:\n- Depth[np] = Depth[p] + 1\n qq.append(np)\n- if not qq:\n- break\n que = qq\n- if que:\n- for p in que:\n- for np in graph[p]:\n- hp.heappush(q, (-children[np], np))\n \n print(ans)\n", "added_lines": 28, "removed_lines": 26, "code1_lines": 52 }, { "user_id": "u677523557", "problem_id": "p04008", "submission1_id": "s895824683", "submission2_id": "s829073815", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nimport heapq as hp\n\nN, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nans = 0\ngraph = [[] for _ in range(N)]\nPar = [-1]*N\nfor i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n Par[i] = a-1\n graph[a-1].append(i)\n\nq = []\n\nstack = [0]\nDepth = [-1]*N\nDepth[0] = 0\nwhile stack:\n p = stack.pop()\n for np in graph[p]:\n Depth[np] = Depth[p] + 1\n stack.append(np)\n if len(graph[p]) == 0:\n hp.heappush(q, (-Depth[p], p))\n\nchecked = [False]*N\n\nwhile q:\n d, s = hp.heappop(q)\n d = -d\n if d <= K: break\n if checked[s]: continue\n \n \n for _ in range(K-1):\n s = Par[s]\n \n que = [s]\n while que:\n qq = []\n for p in que:\n for np in graph[p]:\n if not checked[np]:\n checked[np] = True\n qq.append(np)\n que = qq\n \n hp.heappush(q, (-Depth[Par[s]], Par[s]))\n ans += 1\n\nprint(ans)", "code2": "import sys\ninput = sys.stdin.readline\n\n\nN, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nans = 0\ngraph = [[] for _ in range(N)]\nPar = [-1]*N\nfor i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n Par[i] = a-1\n graph[a-1].append(i)\n\nqs = []\n\nstack = [0]\nDepth = [-1]*N\nDepth[0] = 0\nwhile stack:\n p = stack.pop()\n for np in graph[p]:\n Depth[np] = Depth[p] + 1\n stack.append(np)\n qs.append((Depth[p], p))\n\nqs.sort(reverse=True)\nchecked = [False]*N\n\nfor d, s in qs:\n if d <= K: break\n if checked[s]: continue\n\n for _ in range(K-1):\n s = Par[s]\n \n que = [s]\n checked[s] = True\n while que:\n qq = []\n for p in que:\n for np in graph[p]:\n if not checked[np]:\n checked[np] = True\n qq.append(np)\n que = qq\n \n ans += 1\n\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1591570505", "date2": "1591571270", "bleu_score": "0.8531950699660531", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 95, "total_score": 97, "input": "8 1\n-1 1 4 5 1 1 5 4\n", "actual_output": "6\n", "expected_output": "5\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=, hp=\nimport heapq as hp\n\nN, K = map(int, input().split()) # (1): N=8, K=1\nA = list(map(int, input().split())) # (2): A=[-1, 1, 4, 5, 1, 1, 5, 4]\n\nans = 0 # (3): ans=0\ngraph = [[] for _ in range(N)] # (4): graph\nPar = [-1]*N # (5): Par=[-1, -1, -1, -1, -1, -1, -1, -1]\nfor i, a in enumerate(A): # (6): i=0, a=-1 (11): i=1, a=1 ... (39): graph\n if i == 0: # (7): NO CHANGE (12): NO CHANGE ... (36): graph\n if a != 1: # (8): NO CHANGE\n ans += 1 # (9): ans=1\n continue # (10): NO CHANGE\n Par[i] = a-1 # (13): Par=[-1, 0, -1, -1, -1, -1, -1, -1] (17): graph=[[1], [], [], [], [], [], [], []], Par=[-1, 0, 3, -1, -1, -1, -1, -1] ... (37): graph, Par=[-1, 0, 3, 4, 0, 0, 4, 3]\n graph[a-1].append(i) # (14): graph (18): graph ... (38): graph\n\nq = [] # (40): graph, q=[]\n\nstack = [0] # (41): graph, stack=[0]\nDepth = [-1]*N # (42): graph, Depth=[-1, -1, -1, -1, -1, -1, -1, -1]\nDepth[0] = 0 # (43): graph, Depth=[0, -1, -1, -1, -1, -1, -1, -1]\nwhile stack: # (44): graph (57): graph ... (102): graph\n p = stack.pop() # (45): graph=[[1, 4, 5], [], [], [2, 7], [3, 6], [], [], []], stack=[], p=0 (58): graph=[[1, 4, 5], [], [], [2, 7], [3, 6], [], [], []], stack=[1, 4], p=5 ... (98): graph=[[1, 4, 5], [], [], [2, 7], [3, 6], [], [], []], stack=[], p=1\n for np in graph[p]: # (46): graph, np=1 (49): graph, np=4 ... (99): graph\n Depth[np] = Depth[p] + 1 # (47): graph, Depth=[0, 1, -1, -1, -1, -1, -1, -1] (50): graph, Depth=[0, 1, -1, -1, 1, -1, -1, -1] ... (83): graph, Depth=[0, 1, 3, 2, 1, 1, 2, 3]\n stack.append(np) # (48): graph, stack=[1] (51): graph, stack=[1, 4] ... (84): graph, stack=[1, 2, 7]\n if len(graph[p]) == 0: # (56): graph (60): graph ... (100): graph\n hp.heappush(q, (-Depth[p], p)) # (61): graph, q=[(-1, 5)] (76): graph, q=[(-2, 6), (-1, 5)] ... (101): graph, q=[(-3, 2), (-3, 7), (-2, 6), (-1, 5), (-1, 1)]\n\nchecked = [False]*N # (103): graph, checked=[False, False, False, False, False, False, False, False]\n\nwhile q: # (104): graph (120): graph ... (204): graph\n d, s = hp.heappop(q) # (105): graph=[[1, 4, 5], [], [], [2, 7], [3, 6], [], [], []], q=[(-3, 7), (-1, 1), (-2, 6), (-1, 5)], d=-3, s=2 (121): graph=[[1, 4, 5], [], [], [2, 7], [3, 6], [], [], []], q=[(-2, 3), (-1, 1), (-2, 6), (-1, 5)], d=-3, s=7 ... (205): graph=[[1, 4, 5], [], [], [2, 7], [3, 6], [], [], []], q=[(-1, 4), (-1, 4), (-1, 4), (-1, 5)], d=-1, s=1\n d = -d # (106): graph, d=3 (122): graph, d=3 ... (206): graph, d=1\n if d <= K: break # (107): graph (123): graph ... (207): graph\n if checked[s]: continue # (108): graph (124): graph ... (192): graph\n \n \n for _ in range(K-1): # (109): graph (125): graph ... (193): graph\n s = Par[s]\n \n que = [s] # (110): graph, que=[2] (126): graph, que=[7] ... (194): graph, que=[6]\n while que: # (111): graph (117): graph ... (201): graph\n qq = [] # (112): graph, qq=[] (128): graph ... (196): graph\n for p in que: # (113): graph, p=2 (115): graph ... (199): graph\n for np in graph[p]: # (114): graph (130): graph ... (198): graph\n if not checked[np]: # (147): graph (151): graph ... (181): graph\n checked[np] = True # (148): graph, checked=[False, False, True, False, False, False, False, False] (152): graph, checked=[False, False, True, False, False, False, False, True]\n qq.append(np) # (149): graph, qq=[2] (153): graph, qq=[2, 7]\n que = qq # (116): graph, que=[] (132): graph, que=[] ... (200): graph, que=[]\n \n hp.heappush(q, (-Depth[Par[s]], Par[s])) # (118): graph, q=[(-3, 7), (-2, 3), (-2, 6), (-1, 5), (-1, 1)] (134): graph, q=[(-2, 3), (-2, 3), (-2, 6), (-1, 5), (-1, 1)] ... (202): graph, q=[(-1, 1), (-1, 4), (-1, 4), (-1, 5), (-1, 4)]\n ans += 1 # (119): ans=2, graph (135): ans=3, graph ... (203): ans=6, graph\n\nprint(ans)"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n-import heapq as hp\n+\n \n N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n ans = 0\n graph = [[] for _ in range(N)]\n Par = [-1]*N\n for i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n Par[i] = a-1\n graph[a-1].append(i)\n \n-q = []\n+qs = []\n \n stack = [0]\n Depth = [-1]*N\n Depth[0] = 0\n while stack:\n p = stack.pop()\n for np in graph[p]:\n Depth[np] = Depth[p] + 1\n stack.append(np)\n- if len(graph[p]) == 0:\n- hp.heappush(q, (-Depth[p], p))\n+ qs.append((Depth[p], p))\n \n+qs.sort(reverse=True)\n checked = [False]*N\n \n-while q:\n- d, s = hp.heappop(q)\n- d = -d\n+for d, s in qs:\n if d <= K: break\n if checked[s]: continue\n- \n- \n+\n for _ in range(K-1):\n s = Par[s]\n \n que = [s]\n+ checked[s] = True\n while que:\n qq = []\n for p in que:\n for np in graph[p]:\n if not checked[np]:\n checked[np] = True\n qq.append(np)\n que = qq\n \n- hp.heappush(q, (-Depth[Par[s]], Par[s]))\n ans += 1\n \n print(ans)\n", "FL_content": " import sys\n input = sys.stdin.readline\n-import heapq as hp\n \n N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n ans = 0\n graph = [[] for _ in range(N)]\n Par = [-1]*N\n for i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n Par[i] = a-1\n graph[a-1].append(i)\n \n-q = []\n \n stack = [0]\n Depth = [-1]*N\n Depth[0] = 0\n while stack:\n p = stack.pop()\n for np in graph[p]:\n Depth[np] = Depth[p] + 1\n stack.append(np)\n- if len(graph[p]) == 0:\n- hp.heappush(q, (-Depth[p], p))\n \n checked = [False]*N\n \n-while q:\n- d, s = hp.heappop(q)\n- d = -d\n if d <= K: break\n if checked[s]: continue\n- \n- \n for _ in range(K-1):\n s = Par[s]\n \n que = [s]\n while que:\n qq = []\n for p in que:\n for np in graph[p]:\n if not checked[np]:\n checked[np] = True\n qq.append(np)\n que = qq\n \n- hp.heappush(q, (-Depth[Par[s]], Par[s]))\n ans += 1\n \n print(ans)\n", "added_lines": 7, "removed_lines": 10, "code1_lines": 57 }, { "user_id": "u693716675", "problem_id": "p04008", "submission1_id": "s519353299", "submission2_id": "s728107826", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\nimport sys\nsys.setrecursionlimit(2 * 10 ** 5 + 10)\n\nn,k = [int(i) for i in input().split()]\na = [int(i)-1 for i in input().split()]\n\n\n\ndef dfs(u):\n global cnt\n depth = 0 \n \n for v in edges[u]:\n depth = max(depth, dfs(v)+1) \n \n if depth>=k and u!=0:\n cnt += 1\n depth = 0\n \n return depth\n\n\ncnt = 0\nif a[0]!=0:\n cnt += 1\n\nedges = [[] for _ in range(n)]\nfor i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n\ndfs(0) \nprint(cnt)", "code2": "\n\n\n\nimport sys\nsys.setrecursionlimit(2 * 10 ** 5 + 10)\n\nn,k = [int(i) for i in input().split()]\na = [int(i)-1 for i in input().split()]\n\n\n\ndef dfs(u):\n global cnt\n depth = 0 \n \n for v in edges[u]:\n depth = max(depth, (dfs(v)+1)%k) \n \n \n if depth==k-1 and u!=0 and a[u] != 0:\n cnt += 1\n \n return depth\n\n\ncnt = 0\nif a[0]!=0:\n cnt += 1\n\nedges = [[] for _ in range(n)]\nfor i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n\ndfs(0) \nprint(cnt)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583628540", "date2": "1583629077", "bleu_score": "0.9400062536958428", "code1_test_status": [1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 84, "total_score": 97, "input": "8 2\n4 1 4 5 2 2 5 4\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["\n\n\n\nimport sys\nsys.setrecursionlimit(2 * 10 ** 5 + 10) # (0): NO CHANGE\n\nn,k = [int(i) for i in input().split()] # (1): n=8, k=2\na = [int(i)-1 for i in input().split()] # (2): a=[3, 0, 3, 4, 1, 1, 4, 3]\n\n\n\ndef dfs(u): # (3): dfs=\n global cnt\n depth = 0 # (31): depth=0 (34): depth=0 ... (64): depth=0\n \n for v in edges[u]: # (32): v=1 (35): v=4 ... (69): NO CHANGE\n depth = max(depth, dfs(v)+1) # (33): u=1 (36): u=4 ... (63): u=5\n \n if depth>=k and u!=0: # (45): u=3, depth=1, v=2 (50): u=3, depth=1, v=7 ... (70): sys=, n=8, k=2, a=[3, 0, 3, 4, 1, 1, 4, 3], dfs=, cnt=2, edges, i=7, pa=3\n cnt += 1 # (60): NO CHANGE\n depth = 0 # (61): u=1, depth=1, v=4\n \n return depth\n\n\ncnt = 0 # (4): cnt=0\nif a[0]!=0: # (5): NO CHANGE\n cnt += 1 # (6): cnt=1\n\nedges = [[] for _ in range(n)] # (7): edges\nfor i in range(1,n): # (8): i=1 (11): edges, i=2 ... (29): edges\n pa = a[i] # (9): pa=0 (12): edges=[[1], [], [], [], [], [], [], []], pa=3 ... (27): edges, pa=3\n edges[a[i]].append(i) # (10): edges (13): edges ... (28): edges\n\ndfs(0) # (30): u=0\nprint(cnt)"], "anno_status": [true], "diff_content": " \n \n \n \n import sys\n sys.setrecursionlimit(2 * 10 ** 5 + 10)\n \n n,k = [int(i) for i in input().split()]\n a = [int(i)-1 for i in input().split()]\n \n \n \n def dfs(u):\n global cnt\n depth = 0 \n \n for v in edges[u]:\n- depth = max(depth, dfs(v)+1) \n+ depth = max(depth, (dfs(v)+1)%k) \n+ \n \n- if depth>=k and u!=0:\n+ if depth==k-1 and u!=0 and a[u] != 0:\n cnt += 1\n- depth = 0\n- \n+ \n return depth\n \n \n cnt = 0\n if a[0]!=0:\n cnt += 1\n \n edges = [[] for _ in range(n)]\n for i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n \n dfs(0) \n print(cnt)\n", "FL_content": " \n \n \n \n import sys\n sys.setrecursionlimit(2 * 10 ** 5 + 10)\n \n n,k = [int(i) for i in input().split()]\n a = [int(i)-1 for i in input().split()]\n \n \n \n def dfs(u):\n global cnt\n depth = 0 \n \n for v in edges[u]:\n- depth = max(depth, dfs(v)+1) \n \n- if depth>=k and u!=0:\n cnt += 1\n- depth = 0\n- \n return depth\n \n \n cnt = 0\n if a[0]!=0:\n cnt += 1\n \n edges = [[] for _ in range(n)]\n for i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n \n dfs(0) \n print(cnt)\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 37 }, { "user_id": "u423585790", "problem_id": "p04008", "submission1_id": "s320622554", "submission2_id": "s321934376", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(10**6)\nn,k = map(int,input().split())\na = [int(i)-1 for i in input().split()]\nedg = [[] for i in range(n)]\nfor i in range(1,n):\n edg[a[i]].append(i)\nans = [0] * n\nans[0] = a[0] != 0\ndef dfs(now):\n res = 0\n for e in edg[now]:\n res = max(res, dfs(e))\n if res == k - 1 and a[now] != 0 and now != 0:\n ans[now] = 1\n res = 0\n return res + 1\n \ndfs(0)\nprint(sum(ans))\n", "code2": "import sys\nsys.setrecursionlimit(10**6)\nn,k = map(int,input().split())\na = [int(i)-1 for i in input().split()]\nedg = [[] for i in range(n)]\nfor i in range(1,n):\n edg[a[i]].append(i)\nans = [0] * n\nans[0] = a[0] != 0\ndef dfs(now):\n res = 0\n for e in edg[now]:\n res = max(res, dfs(e)+1)\n if res == k - 1 and a[now] != 0:\n ans[now] = 1\n res = -1\n return res\n \ndfs(0)\nprint(sum(ans))\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1590165459", "date2": "1590166300", "bleu_score": "0.9477139321830219", "code1_test_status": [1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 85, "total_score": 97, "input": "8 1\n-1 1 4 5 1 1 5 4\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["import sys\nsys.setrecursionlimit(10**6) # (0): NO CHANGE\nn,k = map(int,input().split()) # (1): n=8, k=1\na = [int(i)-1 for i in input().split()] # (2): a=[-2, 0, 3, 4, 0, 0, 4, 3]\nedg = [[] for i in range(n)] # (3): edg\nfor i in range(1,n): # (4): i=1 (6): edg, i=2 ... (18): edg\n edg[a[i]].append(i) # (5): edg (7): edg ... (17): edg\nans = [0] * n # (19): edg, ans=[0, 0, 0, 0, 0, 0, 0, 0]\nans[0] = a[0] != 0 # (20): edg, ans=[True, 0, 0, 0, 0, 0, 0, 0]\ndef dfs(now): # (21): edg, dfs=\n res = 0 # (23): res=0 (26): res=0 ... (62): res=0\n for e in edg[now]: # (24): e=1 (27): NO CHANGE ... (65): NO CHANGE\n res = max(res, dfs(e)) # (25): now=1 (30): now=4 ... (61): now=5\n if res == k - 1 and a[now] != 0 and now != 0: # (28): now=0, res=1, e=1 (39): NO CHANGE ... (66): sys=, n=8, k=1, a=[-2, 0, 3, 4, 0, 0, 4, 3], edg=[[1, 4, 5], [], [], [2, 7], [3, 6], [], [], []], i=7, ans=[True, 0, 1, 0, 0, 0, 1, 1], dfs=\n ans[now] = 1 # (40): NO CHANGE (47): NO CHANGE (56): NO CHANGE\n res = 0 # (41): now=3, res=1, e=2 (48): now=3, res=1, e=7 (57): now=4, res=2, e=6\n return res + 1\n \ndfs(0) # (22): now=0\nprint(sum(ans))\n"], "anno_status": [true], "diff_content": " import sys\n sys.setrecursionlimit(10**6)\n n,k = map(int,input().split())\n a = [int(i)-1 for i in input().split()]\n edg = [[] for i in range(n)]\n for i in range(1,n):\n edg[a[i]].append(i)\n ans = [0] * n\n ans[0] = a[0] != 0\n def dfs(now):\n res = 0\n for e in edg[now]:\n- res = max(res, dfs(e))\n- if res == k - 1 and a[now] != 0 and now != 0:\n+ res = max(res, dfs(e)+1)\n+ if res == k - 1 and a[now] != 0:\n ans[now] = 1\n- res = 0\n- return res + 1\n+ res = -1\n+ return res\n \n dfs(0)\n print(sum(ans))\n \n", "FL_content": " import sys\n sys.setrecursionlimit(10**6)\n n,k = map(int,input().split())\n a = [int(i)-1 for i in input().split()]\n edg = [[] for i in range(n)]\n for i in range(1,n):\n edg[a[i]].append(i)\n ans = [0] * n\n ans[0] = a[0] != 0\n def dfs(now):\n res = 0\n for e in edg[now]:\n- res = max(res, dfs(e))\n- if res == k - 1 and a[now] != 0 and now != 0:\n ans[now] = 1\n- res = 0\n- return res + 1\n \n dfs(0)\n print(sum(ans))\n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 21 }, { "user_id": "u081847415", "problem_id": "p01968", "submission1_id": "s231581831", "submission2_id": "s513497936", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nfrom collections import Counter\ndef inpl(): return tuple(map(int, input().split()))\n\nN = int(input())\nA = list(map(int, input().split()))\n\nC = Counter(A)\nif C[-2] % 2 == 0:\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2]\n print(len(ans))\n if len(ans):\n print(*ans, sep=\"\\n\")\nelif C[-1] > 0:\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2] + [A.index(-1) + 1]\n print(len(ans))\n if len(ans):\n print(*sorted(ans), sep=\"\\n\")\nelse:\n del A[-A[::-1].index(-2) - 1]\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2]\n print(len(ans))\n if len(ans):\n print(*ans, sep=\"\\n\")\n", "code2": "\nfrom collections import Counter\ndef inpl(): return tuple(map(int, input().split()))\n\nN = int(input())\nA = list(map(int, input().split()))\n\nC = Counter(A)\nif C[-2] % 2 == 0:\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2]\n print(len(ans))\n if len(ans):\n print(*ans, sep=\"\\n\")\nelif C[-1] > 0:\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2] + [A.index(-1) + 1]\n print(len(ans))\n if len(ans):\n print(*sorted(ans), sep=\"\\n\")\nelse:\n d = N -A[::-1].index(-2)\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2]\n del ans[ans.index(d)]\n print(len(ans))\n if len(ans):\n print(*ans, sep=\"\\n\")\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1522200494", "date2": "1522201360", "bleu_score": "0.9551191756652561", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 95, "total_score": 97, "input": "4\n0 -2 0 2\n", "actual_output": "1\n3\n", "expected_output": "1\n4\n\n", "anno_code": ["\nfrom collections import Counter\ndef inpl(): return tuple(map(int, input().split()))\n\nN = int(input()) # (0): N=4\nA = list(map(int, input().split())) # (1): A=[0, -2, 0, 2]\n\nC = Counter(A) # (2): C=Counter({0: 2, -2: 1, 2: 1})\nif C[-2] % 2 == 0: # (3): NO CHANGE\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2]\n print(len(ans))\n if len(ans):\n print(*ans, sep=\"\\n\")\nelif C[-1] > 0: # (4): NO CHANGE\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2] + [A.index(-1) + 1]\n print(len(ans))\n if len(ans):\n print(*sorted(ans), sep=\"\\n\")\nelse:\n del A[-A[::-1].index(-2) - 1] # (5): A=[0, 0, 2]\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2] # (6): ans=[3]\n print(len(ans)) # (7): NO CHANGE\n if len(ans): # (8): NO CHANGE\n print(*ans, sep=\"\\n\")\n"], "anno_status": [true], "diff_content": " \n from collections import Counter\n def inpl(): return tuple(map(int, input().split()))\n \n N = int(input())\n A = list(map(int, input().split()))\n \n C = Counter(A)\n if C[-2] % 2 == 0:\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2]\n print(len(ans))\n if len(ans):\n print(*ans, sep=\"\\n\")\n elif C[-1] > 0:\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2] + [A.index(-1) + 1]\n print(len(ans))\n if len(ans):\n print(*sorted(ans), sep=\"\\n\")\n else:\n- del A[-A[::-1].index(-2) - 1]\n+ d = N -A[::-1].index(-2)\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2]\n+ del ans[ans.index(d)]\n print(len(ans))\n if len(ans):\n print(*ans, sep=\"\\n\")\n \n", "FL_content": " \n from collections import Counter\n def inpl(): return tuple(map(int, input().split()))\n \n N = int(input())\n A = list(map(int, input().split()))\n \n C = Counter(A)\n if C[-2] % 2 == 0:\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2]\n print(len(ans))\n if len(ans):\n print(*ans, sep=\"\\n\")\n elif C[-1] > 0:\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2] + [A.index(-1) + 1]\n print(len(ans))\n if len(ans):\n print(*sorted(ans), sep=\"\\n\")\n else:\n- del A[-A[::-1].index(-2) - 1]\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2]\n print(len(ans))\n if len(ans):\n print(*ans, sep=\"\\n\")\n \n", "added_lines": 2, "removed_lines": 1, "code1_lines": 25 }, { "user_id": "u207056619", "problem_id": "p03769", "submission1_id": "s722743929", "submission2_id": "s978255874", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nn = int(input())\nx = []\ny = []\nk = 1\nfor c in bin(n)[2 :][1 :]:\n x += [ k ]\n y += [ k ]\n k += 1\n if int(c):\n x = [ k ] + x\n y += [ k ]\n k += 1\nif not (x + y):\n x = [ 100 ]\nprint(len(x + y))\nprint(*(x + y))\n", "code2": "\nn = int(input())\nx = []\ny = []\nk = 1\nfor c in bin(n + 1)[2 :][1 :]:\n x += [ k ]\n y += [ k ]\n k += 1\n if int(c):\n x = [ k ] + x\n y += [ k ]\n k += 1\nprint(len(x + y))\nprint(*(x + y))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1501697741", "date2": "1501697820", "bleu_score": "0.8602188802096368", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 18, "input": "462\n", "actual_output": "26\n12 10 8 4 2 1 3 5 6 7 9 11 13 1 2 3 4 5 6 7 8 9 10 11 12 13\n", "expected_output": "28\n14 12 10 8 4 2 1 3 5 6 7 9 11 13 1 2 3 4 5 6 7 8 9 10 11 12 13 14\n\n", "anno_code": ["\nn = int(input()) # (0): n=462\nx = [] # (1): x=[]\ny = [] # (2): y=[]\nk = 1 # (3): k=1\nfor c in bin(n)[2 :][1 :]: # (4): c=1 (12): NO CHANGE ... (59): NO CHANGE\n x += [ k ] # (5): x=[1] (13): x=[2, 1, 3] ... (55): x=[12, 10, 8, 4, 2, 1, 3, 5, 6, 7, 9, 11, 13]\n y += [ k ] # (6): y=[1] (14): y=[1, 2, 3] ... (56): y=[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]\n k += 1 # (7): k=2 (15): k=4 ... (57): k=14\n if int(c): # (8): NO CHANGE (16): NO CHANGE ... (58): NO CHANGE\n x = [ k ] + x # (9): x=[2, 1] (17): x=[4, 2, 1, 3] ... (51): x=[12, 10, 8, 4, 2, 1, 3, 5, 6, 7, 9, 11]\n y += [ k ] # (10): y=[1, 2] (18): y=[1, 2, 3, 4] ... (52): y=[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]\n k += 1 # (11): k=3 (19): k=5 ... (53): k=13\nif not (x + y): # (60): NO CHANGE\n x = [ 100 ]\nprint(len(x + y)) # (61): NO CHANGE\nprint(*(x + y))\n"], "anno_status": [true], "diff_content": " \n n = int(input())\n x = []\n y = []\n k = 1\n-for c in bin(n)[2 :][1 :]:\n+for c in bin(n + 1)[2 :][1 :]:\n x += [ k ]\n y += [ k ]\n k += 1\n if int(c):\n x = [ k ] + x\n y += [ k ]\n k += 1\n-if not (x + y):\n- x = [ 100 ]\n print(len(x + y))\n print(*(x + y))\n \n", "FL_content": " \n n = int(input())\n x = []\n y = []\n k = 1\n-for c in bin(n)[2 :][1 :]:\n x += [ k ]\n y += [ k ]\n k += 1\n if int(c):\n x = [ k ] + x\n y += [ k ]\n k += 1\n-if not (x + y):\n- x = [ 100 ]\n print(len(x + y))\n print(*(x + y))\n \n", "added_lines": 1, "removed_lines": 3, "code1_lines": 18 }, { "user_id": "u684325232", "problem_id": "p01102", "submission1_id": "s337113095", "submission2_id": "s884705708", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=[]\n\nwhile 1:\n l1=input()\n if l1==\".\":\n break\n l2=input()\n\n sp1=l1.split('\"')\n sp2=l2.split('\"')\n \n t=0\n if len(sp1)==len(sp2):\n for i in range(len(sp1)):\n if i%2==1 and sp1[i]!=sp2[i]:\n t+=1\n elif i%2!=1 and sp1[i]!=sp2[i]:\n t+=2\n\n\n if sp1==sp2:\n s+=[\"INDENTCAL\"]\n elif t==1:\n s+=[\"CLODSE\"]\n else:\n s+=[\"DIFFERENT\"]\n\nfor x in s:\n print(x)\n\n", "code2": "s=[]\n\nwhile 1:\n l1=input()\n if l1==\".\":\n break\n l2=input()\n\n sp1=l1.split('\"')\n sp2=l2.split('\"')\n \n t=0\n if len(sp1)==len(sp2):\n for i in range(len(sp1)):\n if i%2==1 and sp1[i]!=sp2[i]:\n t+=1\n elif i%2!=1 and sp1[i]!=sp2[i]:\n t+=2\n\n\n if sp1==sp2:\n s+=[\"IDENTICAL\"]\n elif t==1:\n s+=[\"CLOSE\"]\n else:\n s+=[\"DIFFERENT\"]\n\nfor x in s:\n print(x)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526720204", "date2": "1526720614", "bleu_score": "0.9837789417716355", "code1_test_status": [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 63, "total_score": 101, "input": "print\"hello\";print123\nprint\"hello\";print123\nread\"B1input\";solve;output;\nread\"B2\";stlve;ovtpuo;\nread\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"\"\"\"\"\"\"\"\n\"\"\"42\"\"\"\"\"\nslwo\"program\"\nfast\"code\"\n\"super\"fast\"program\"\n\"super\"faster\"program\"\n\"\"X\nX\nI\"S\"\"CREAM\"\nI\"CE\"\"CREAM\"\n11\"22\"11\n1\"33\"111\n.\n", "actual_output": "INDENTCAL\nDIFFERENT\nDIFFERENT\nCLODSE\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLODSE\nDIFFERENT\n", "expected_output": "IDENTICAL\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\n\n", "anno_code": ["s=[] # (0): s=[]\n\nwhile 1: # (1): NO CHANGE (21): NO CHANGE ... (220): NO CHANGE\n l1=input() # (2): l1=print\"hello\";print123 (22): l1=read\"B1input\";solve;output; ... (221): l1=.\n if l1==\".\": # (3): NO CHANGE (23): NO CHANGE ... (222): NO CHANGE\n break # (223): NO CHANGE\n l2=input() # (4): l2=print\"hello\";print123 (24): l2=read\"B2\";stlve;ovtpuo; ... (200): l2=1\"33\"111\n\n sp1=l1.split('\"') # (5): sp1=['print', 'hello', ';print123'] (25): sp1=['read', 'B1input', ';solve;output;'] ... (201): sp1=['11', '22', '11']\n sp2=l2.split('\"') # (6): sp2=['print', 'hello', ';print123'] (26): sp2=['read', 'B2', ';stlve;ovtpuo;'] ... (202): sp2=['1', '33', '111']\n \n t=0 # (7): t=0 (27): NO CHANGE ... (203): t=0\n if len(sp1)==len(sp2): # (8): NO CHANGE (28): NO CHANGE ... (204): NO CHANGE\n for i in range(len(sp1)): # (9): i=0 (12): i=1 ... (216): NO CHANGE\n if i%2==1 and sp1[i]!=sp2[i]: # (10): NO CHANGE (13): NO CHANGE ... (213): NO CHANGE\n t+=1 # (34): t=1 (56): t=1 ... (211): t=3\n elif i%2!=1 and sp1[i]!=sp2[i]: # (11): NO CHANGE (14): NO CHANGE ... (214): NO CHANGE\n t+=2 # (38): t=3 (120): t=2 ... (215): t=5\n\n\n if sp1==sp2: # (19): NO CHANGE (40): NO CHANGE ... (217): NO CHANGE\n s+=[\"INDENTCAL\"] # (20): s=['INDENTCAL']\n elif t==1: # (41): NO CHANGE (68): NO CHANGE ... (218): NO CHANGE\n s+=[\"CLODSE\"] # (108): s=['INDENTCAL', 'DIFFERENT', 'DIFFERENT', 'CLODSE'] (196): s=['INDENTCAL', 'DIFFERENT', 'DIFFERENT', 'CLODSE', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'CLODSE']\n else:\n s+=[\"DIFFERENT\"] # (42): s=['INDENTCAL', 'DIFFERENT'] (69): s=['INDENTCAL', 'DIFFERENT', 'DIFFERENT'] ... (219): s=['INDENTCAL', 'DIFFERENT', 'DIFFERENT', 'CLODSE', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'CLODSE', 'DIFFERENT']\n\nfor x in s: # (224): x=INDENTCAL (226): x=DIFFERENT ... (240): x=DIFFERENT\n print(x) # (225): NO CHANGE (227): NO CHANGE ... (241): NO CHANGE\n\n"], "anno_status": [false], "diff_content": " s=[]\n \n while 1:\n l1=input()\n if l1==\".\":\n break\n l2=input()\n \n sp1=l1.split('\"')\n sp2=l2.split('\"')\n \n t=0\n if len(sp1)==len(sp2):\n for i in range(len(sp1)):\n if i%2==1 and sp1[i]!=sp2[i]:\n t+=1\n elif i%2!=1 and sp1[i]!=sp2[i]:\n t+=2\n \n \n if sp1==sp2:\n- s+=[\"INDENTCAL\"]\n+ s+=[\"IDENTICAL\"]\n elif t==1:\n- s+=[\"CLODSE\"]\n+ s+=[\"CLOSE\"]\n else:\n s+=[\"DIFFERENT\"]\n \n for x in s:\n print(x)\n \n-\n", "FL_content": " s=[]\n \n while 1:\n l1=input()\n if l1==\".\":\n break\n l2=input()\n \n sp1=l1.split('\"')\n sp2=l2.split('\"')\n \n t=0\n if len(sp1)==len(sp2):\n for i in range(len(sp1)):\n if i%2==1 and sp1[i]!=sp2[i]:\n t+=1\n elif i%2!=1 and sp1[i]!=sp2[i]:\n t+=2\n \n \n if sp1==sp2:\n- s+=[\"INDENTCAL\"]\n elif t==1:\n- s+=[\"CLODSE\"]\n else:\n s+=[\"DIFFERENT\"]\n \n for x in s:\n print(x)\n \n-\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 31 }, { "user_id": "u826549974", "problem_id": "p01102", "submission1_id": "s117918888", "submission2_id": "s036920305", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while(1):\n a = input()\n if(a == '.'):\n break\n b = input()\n n = len(a)\n m = len(b)\n l = 0;\n flag = 0\n idx_dif = 0\n error_cou = 0\n\n while(1):\n if(l >= n-1 or l+idx_dif >= m-1):\n flag = 2\n\n if(flag == 0):\n for i in range(l,n):\n if(a[i] == '\\\"'):\n if(i+idx_dif < m and a[l:i] == b[l+idx_dif:i+idx_dif]):\n l = i+1\n flag = 1\n else:\n flag = 2\n break\n\n elif(i == n-1):\n if(a[l:i] != b[l+idx_dif:m-1]):\n flag = 2\n else:\n l = n-1\n break\n if(flag != 0):\n break\n\n elif(flag == 1):\n for i in range(l,n):\n if(a[i] == '\\\"'):\n for j in range(l+idx_dif,m):\n if(b[j] == '\\\"'):\n if(a[l:i] != b[l+idx_dif:j]):\n error_cou += 1\n idx_dif = j-i\n l = i+1\n flag = 0\n break\n if(j == m-1):\n flag = 2\n break\n\n if(flag != 1):\n break\n\n if(flag == 2 or l >= n-1 or l+idx_dif >= m-1):\n break\n\n if(error_cou >= 2 or flag == 2):\n print(\"DIFFERENT\")\n elif(error_cou == 1):\n print(\"CLOSE\")\n elif(error_cou == 0):\n print(\"IDENTICAL\")\n", "code2": "while(1):\n a = input()\n if(a == '.'):\n break\n b = input()\n n = len(a)\n m = len(b)\n l = 0;\n flag = 0\n idx_dif = 0\n error_cou = 0\n\n while(1):\n if(l >= n-1 or l+idx_dif >= m-1):\n flag = 2\n\n if(flag == 0):\n for i in range(l,n):\n if(a[i] == '\\\"'):\n if(i+idx_dif < m and a[l:i+1] == b[l+idx_dif:i+idx_dif+1]):\n l = i+1\n flag = 1\n else:\n flag = 2\n break\n\n elif(i == n-1):\n if(a[l:i] != b[l+idx_dif:m-1]):\n flag = 2\n else:\n l = n-1\n break\n if(flag != 0):\n break\n\n elif(flag == 1):\n for i in range(l,n):\n if(a[i] == '\\\"'):\n for j in range(l+idx_dif,m):\n if(b[j] == '\\\"'):\n if(a[l:i+1] != b[l+idx_dif:j+1]):\n error_cou += 1\n idx_dif = j-i\n l = i+1\n flag = 0\n break\n if(j == m-1):\n flag = 2\n break\n\n if(flag != 1):\n break\n\n if(flag == 2 or l >= n-1 or l+idx_dif >= m-1):\n break\n\n if(error_cou >= 2 or flag == 2):\n print(\"DIFFERENT\")\n elif(error_cou == 1):\n print(\"CLOSE\")\n elif(error_cou == 0):\n print(\"IDENTICAL\")\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526995771", "date2": "1526998609", "bleu_score": "0.9916037922929029", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 20, "total_score": 101, "input": "print\"hello\";print133\nprint\"hello\";qrint123\nread\"B1input\";somve;output;\n;tuptuo;evlos;\"2B\"daer\nread\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"\"\"\"\"\"\"\"\n\"\"\"52\"\"#\"\"\nslow\"progr\"ma\nfast\"code\"\n\"super\"fast\"program\"\n\"super\"faster\"prohram\"\nX\"\"\nY\nI\"S\"\"CREAM\"\nI\"CE\"\"BREAM\"\n11\"12\"11\n13\"3\"111\n.\n", "actual_output": "DIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\nDIFFERENT\nDIFFERENT\n", "expected_output": "DIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\n\n", "anno_code": ["while(1): # (0): NO CHANGE (131): NO CHANGE ... (782): NO CHANGE\n a = input() # (1): a=print\"hello\";print133 (132): a=read\"B1input\";somve;output; ... (783): a=.\n if(a == '.'): # (2): NO CHANGE (133): NO CHANGE ... (784): NO CHANGE\n break\n b = input() # (3): b=print\"hello\";qrint123 (134): b=;tuptuo;evlos;\"2B\"daer ... (755): b=13\"3\"111\n n = len(a) # (4): n=21 (135): n=27 ... (756): n=8\n m = len(b) # (5): m=21 (136): m=22 ... (757): m=8\n l = 0; # (6): l=0 (137): l=0 ... (758): l=0\n flag = 0 # (7): flag=0 (138): flag=0 ... (759): NO CHANGE\n idx_dif = 0 # (8): idx_dif=0 (139): NO CHANGE ... (760): idx_dif=0\n error_cou = 0 # (9): error_cou=0 (140): NO CHANGE ... (761): error_cou=0\n\n while(1): # (10): NO CHANGE (40): NO CHANGE ... (762): NO CHANGE\n if(l >= n-1 or l+idx_dif >= m-1): # (11): NO CHANGE (41): NO CHANGE ... (763): NO CHANGE\n flag = 2 # (635): flag=2\n\n if(flag == 0): # (12): NO CHANGE (42): NO CHANGE ... (764): NO CHANGE\n for i in range(l,n): # (13): i=0 (17): i=1 ... (773): i=2\n if(a[i] == '\\\"'): # (14): NO CHANGE (18): NO CHANGE ... (774): NO CHANGE\n if(i+idx_dif < m and a[l:i] == b[l+idx_dif:i+idx_dif]): # (35): NO CHANGE (162): NO CHANGE ... (775): NO CHANGE\n l = i+1 # (36): l=6 (201): l=5 ... (698): l=5\n flag = 1 # (37): flag=1 (202): flag=1 ... (699): flag=1\n else:\n flag = 2 # (163): flag=2 (480): flag=2 (776): flag=2\n break # (38): NO CHANGE (164): NO CHANGE ... (777): NO CHANGE\n\n elif(i == n-1): # (15): NO CHANGE (19): NO CHANGE ... (771): NO CHANGE\n if(a[l:i] != b[l+idx_dif:m-1]): # (124): NO CHANGE\n flag = 2 # (125): flag=2\n else:\n l = n-1\n break # (126): NO CHANGE\n if(flag != 0): # (16): NO CHANGE (20): NO CHANGE ... (772): NO CHANGE\n break\n\n elif(flag == 1): # (43): NO CHANGE (208): NO CHANGE ... (705): NO CHANGE\n for i in range(l,n): # (44): i=6 (47): i=7 ... (721): i=10\n if(a[i] == '\\\"'): # (45): NO CHANGE (48): NO CHANGE ... (722): NO CHANGE\n for j in range(l+idx_dif,m): # (61): j=6 (64): j=7 ... (738): j=11\n if(b[j] == '\\\"'): # (62): NO CHANGE (65): NO CHANGE ... (739): NO CHANGE\n if(a[l:i] != b[l+idx_dif:j]): # (78): NO CHANGE (225): NO CHANGE ... (740): NO CHANGE\n error_cou += 1 # (226): error_cou=1 (335): error_cou=2 ... (741): error_cou=2\n idx_dif = j-i # (79): NO CHANGE (227): NO CHANGE ... (742): NO CHANGE\n l = i+1 # (80): l=12 (228): l=8 ... (743): l=11\n flag = 0 # (81): flag=0 (229): flag=0 ... (744): flag=0\n break # (82): NO CHANGE (230): NO CHANGE ... (745): NO CHANGE\n if(j == m-1): # (63): NO CHANGE (66): NO CHANGE ... (737): NO CHANGE\n flag = 2\n break\n\n if(flag != 1): # (46): NO CHANGE (49): NO CHANGE ... (746): NO CHANGE\n break # (84): NO CHANGE (232): NO CHANGE ... (747): NO CHANGE\n\n if(flag == 2 or l >= n-1 or l+idx_dif >= m-1): # (39): NO CHANGE (85): NO CHANGE ... (778): NO CHANGE\n break # (128): NO CHANGE (166): NO CHANGE ... (779): NO CHANGE\n\n if(error_cou >= 2 or flag == 2): # (129): NO CHANGE (167): NO CHANGE ... (780): NO CHANGE\n print(\"DIFFERENT\") # (130): NO CHANGE (168): NO CHANGE ... (781): NO CHANGE\n elif(error_cou == 1): # (621): NO CHANGE\n print(\"CLOSE\") # (622): NO CHANGE\n elif(error_cou == 0):\n print(\"IDENTICAL\")\n"], "anno_status": [false], "diff_content": " while(1):\n a = input()\n if(a == '.'):\n break\n b = input()\n n = len(a)\n m = len(b)\n l = 0;\n flag = 0\n idx_dif = 0\n error_cou = 0\n \n while(1):\n if(l >= n-1 or l+idx_dif >= m-1):\n flag = 2\n \n if(flag == 0):\n for i in range(l,n):\n if(a[i] == '\\\"'):\n- if(i+idx_dif < m and a[l:i] == b[l+idx_dif:i+idx_dif]):\n+ if(i+idx_dif < m and a[l:i+1] == b[l+idx_dif:i+idx_dif+1]):\n l = i+1\n flag = 1\n else:\n flag = 2\n break\n \n elif(i == n-1):\n if(a[l:i] != b[l+idx_dif:m-1]):\n flag = 2\n else:\n l = n-1\n break\n if(flag != 0):\n break\n \n elif(flag == 1):\n for i in range(l,n):\n if(a[i] == '\\\"'):\n for j in range(l+idx_dif,m):\n if(b[j] == '\\\"'):\n- if(a[l:i] != b[l+idx_dif:j]):\n+ if(a[l:i+1] != b[l+idx_dif:j+1]):\n error_cou += 1\n idx_dif = j-i\n l = i+1\n flag = 0\n break\n if(j == m-1):\n flag = 2\n break\n \n if(flag != 1):\n break\n \n if(flag == 2 or l >= n-1 or l+idx_dif >= m-1):\n break\n \n if(error_cou >= 2 or flag == 2):\n print(\"DIFFERENT\")\n elif(error_cou == 1):\n print(\"CLOSE\")\n elif(error_cou == 0):\n print(\"IDENTICAL\")\n \n", "FL_content": " while(1):\n a = input()\n if(a == '.'):\n break\n b = input()\n n = len(a)\n m = len(b)\n l = 0;\n flag = 0\n idx_dif = 0\n error_cou = 0\n \n while(1):\n if(l >= n-1 or l+idx_dif >= m-1):\n flag = 2\n \n if(flag == 0):\n for i in range(l,n):\n if(a[i] == '\\\"'):\n- if(i+idx_dif < m and a[l:i] == b[l+idx_dif:i+idx_dif]):\n l = i+1\n flag = 1\n else:\n flag = 2\n break\n \n elif(i == n-1):\n if(a[l:i] != b[l+idx_dif:m-1]):\n flag = 2\n else:\n l = n-1\n break\n if(flag != 0):\n break\n \n elif(flag == 1):\n for i in range(l,n):\n if(a[i] == '\\\"'):\n for j in range(l+idx_dif,m):\n if(b[j] == '\\\"'):\n- if(a[l:i] != b[l+idx_dif:j]):\n error_cou += 1\n idx_dif = j-i\n l = i+1\n flag = 0\n break\n if(j == m-1):\n flag = 2\n break\n \n if(flag != 1):\n break\n \n if(flag == 2 or l >= n-1 or l+idx_dif >= m-1):\n break\n \n if(error_cou >= 2 or flag == 2):\n print(\"DIFFERENT\")\n elif(error_cou == 1):\n print(\"CLOSE\")\n elif(error_cou == 0):\n print(\"IDENTICAL\")\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 63 }, { "user_id": "u196653484", "problem_id": "p01102", "submission1_id": "s744231992", "submission2_id": "s622750504", "status1": "Wrong Answer", "status2": "Accepted", "code1": "results=[]\nwhile True:\n a=input().split(\"\\\"\")\n if a[0]==\".\":\n break\n b=input().split(\"\\\"\")\n count1=0\n count2=0\n if len(a) != len(b):\n results.append(2)\n else:\n for i in range(len(a)):\n if(i%2==1):\n if len(a[i]) == 0 and len(b[i]) != 0:\n count1+=1\n elif len(a[i]) != 0 and len(b[i]) == 0:\n count1+=1 \n else:\n for k,l in zip(a[i],b[i]):\n if(k!=l):\n count1+=1\n else:\n if len(a[i]) == 0 and len(b[i]) != 0:\n count2+=1\n elif len(a[i]) != 0 and len(b[i]) == 0:\n count2+=1 \n else:\n for k,l in zip(a[i],b[i]):\n if(k!=l):\n count2+=1 \n if count1==0 and count2==0:\n results.append(0)\n elif count1==1 and count2==0:\n results.append(1)\n else:\n results.append(2)\nfor i in results:\n if i==0:\n print(\"IDENTICAL\")\n if i==1:\n print(\"CLOSE\")\n if i==2:\n print(\"DIFFERENT\")\n", "code2": "results=[]\nwhile True:\n a=input().split(\"\\\"\")\n if a[0]==\".\":\n break\n b=input().split(\"\\\"\")\n count1=0\n count2=0\n if len(a) != len(b):\n results.append(2)\n else:\n for i in range(len(a)):\n if(i%2==1):\n if len(a[i]) != len(b[i]):\n count1+=1\n else:\n for k,l in zip(a[i],b[i]):\n if(k!=l):\n count1+=1\n else:\n if len(a[i]) != len(b[i]):\n count2+=1\n else:\n for k,l in zip(a[i],b[i]):\n if(k!=l):\n count2+=1 \n if count1==0 and count2==0:\n results.append(0)\n elif count1==1 and count2==0:\n results.append(1)\n else:\n results.append(2)\nfor i in results:\n if i==0:\n print(\"IDENTICAL\")\n if i==1:\n print(\"CLOSE\")\n if i==2:\n print(\"DIFFERENT\")\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526536537", "date2": "1526536882", "bleu_score": "0.8213637646457067", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 28, "total_score": 101, "input": "print\"hello\";print133\nprint\"hello\";qrinu123\nread\"B1input\";somve;output;\n;tuptuo;evlos;\"2B\"daer\nread\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"\"\"\"\"\"\"\"\n\"\"\"52\"!#\"\"\nslow\"program\"\nfast\"code\"\n\"super\"fast\"program\"\n\"super\"faster\"prohram\"\nX\"\"\nY\nI\"S\"\"CREAM\"\nI\"CE\"\"BREAM\"\n11\"12\"11\n13\"3\"111\n.\n", "actual_output": "DIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\nDIFFERENT\nDIFFERENT\n", "expected_output": "DIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\n\n", "anno_code": ["results=[] # (0): results=[]\nwhile True: # (1): NO CHANGE (68): NO CHANGE ... (437): NO CHANGE\n a=input().split(\"\\\"\") # (2): a=['print', 'hello', ';print133'] (69): a=['read', 'B1input', ';somve;output;'] ... (438): a=['.']\n if a[0]==\".\": # (3): NO CHANGE (70): NO CHANGE ... (439): NO CHANGE\n break # (440): NO CHANGE\n b=input().split(\"\\\"\") # (4): b=['print', 'hello', ';qrinu123'] (71): b=[';tuptuo;evlos;', '2B', 'daer'] ... (402): b=['13', '3', '111']\n count1=0 # (5): count1=0 (72): NO CHANGE ... (403): count1=0\n count2=0 # (6): count2=0 (73): count2=0 ... (404): NO CHANGE\n if len(a) != len(b): # (7): NO CHANGE (74): NO CHANGE ... (405): NO CHANGE\n results.append(2) # (219): results=[2, 2, 2, 2] (346): results=[2, 2, 2, 2, 2, 1, 2]\n else:\n for i in range(len(a)): # (8): i=0 (23): i=1 ... (433): NO CHANGE\n if(i%2==1): # (9): NO CHANGE (24): NO CHANGE ... (425): NO CHANGE\n if len(a[i]) == 0 and len(b[i]) != 0: # (25): NO CHANGE (94): NO CHANGE ... (418): NO CHANGE\n count1+=1\n elif len(a[i]) != 0 and len(b[i]) == 0: # (26): NO CHANGE (95): NO CHANGE ... (419): NO CHANGE\n count1+=1 \n else:\n for k,l in zip(a[i],b[i]): # (27): k=h, l=h (29): k=e, l=e ... (423): NO CHANGE\n if(k!=l): # (28): NO CHANGE (30): NO CHANGE ... (421): NO CHANGE\n count1+=1 # (98): count1=1 (101): count1=2 ... (422): count1=1\n else:\n if len(a[i]) == 0 and len(b[i]) != 0: # (10): NO CHANGE (40): NO CHANGE ... (426): NO CHANGE\n count2+=1\n elif len(a[i]) != 0 and len(b[i]) == 0: # (11): NO CHANGE (41): NO CHANGE ... (427): NO CHANGE\n count2+=1 \n else:\n for k,l in zip(a[i],b[i]): # (12): k=p, l=p (14): k=r, l=r ... (432): NO CHANGE\n if(k!=l): # (13): NO CHANGE (15): NO CHANGE ... (431): NO CHANGE\n count2+=1 # (46): count2=1 (55): count2=2 ... (414): count2=1\n if count1==0 and count2==0: # (65): NO CHANGE (121): NO CHANGE ... (434): NO CHANGE\n results.append(0)\n elif count1==1 and count2==0: # (66): NO CHANGE (122): NO CHANGE ... (435): NO CHANGE\n results.append(1) # (338): results=[2, 2, 2, 2, 2, 1]\n else:\n results.append(2) # (67): results=[2] (123): results=[2, 2] ... (436): results=[2, 2, 2, 2, 2, 1, 2, 2, 2]\nfor i in results: # (441): NO CHANGE (446): NO CHANGE ... (481): NO CHANGE\n if i==0: # (442): NO CHANGE (447): NO CHANGE ... (482): NO CHANGE\n print(\"IDENTICAL\")\n if i==1: # (443): NO CHANGE (448): NO CHANGE ... (483): NO CHANGE\n print(\"CLOSE\") # (469): NO CHANGE\n if i==2: # (444): NO CHANGE (449): NO CHANGE ... (484): NO CHANGE\n print(\"DIFFERENT\") # (445): NO CHANGE (450): NO CHANGE ... (485): NO CHANGE\n"], "anno_status": [false], "diff_content": " results=[]\n while True:\n a=input().split(\"\\\"\")\n if a[0]==\".\":\n break\n b=input().split(\"\\\"\")\n count1=0\n count2=0\n if len(a) != len(b):\n results.append(2)\n else:\n for i in range(len(a)):\n if(i%2==1):\n- if len(a[i]) == 0 and len(b[i]) != 0:\n+ if len(a[i]) != len(b[i]):\n count1+=1\n- elif len(a[i]) != 0 and len(b[i]) == 0:\n- count1+=1 \n else:\n for k,l in zip(a[i],b[i]):\n if(k!=l):\n count1+=1\n else:\n- if len(a[i]) == 0 and len(b[i]) != 0:\n+ if len(a[i]) != len(b[i]):\n count2+=1\n- elif len(a[i]) != 0 and len(b[i]) == 0:\n- count2+=1 \n else:\n for k,l in zip(a[i],b[i]):\n if(k!=l):\n count2+=1 \n if count1==0 and count2==0:\n results.append(0)\n elif count1==1 and count2==0:\n results.append(1)\n else:\n results.append(2)\n for i in results:\n if i==0:\n print(\"IDENTICAL\")\n if i==1:\n print(\"CLOSE\")\n if i==2:\n print(\"DIFFERENT\")\n \n", "FL_content": " results=[]\n while True:\n a=input().split(\"\\\"\")\n if a[0]==\".\":\n break\n b=input().split(\"\\\"\")\n count1=0\n count2=0\n if len(a) != len(b):\n results.append(2)\n else:\n for i in range(len(a)):\n if(i%2==1):\n- if len(a[i]) == 0 and len(b[i]) != 0:\n count1+=1\n- elif len(a[i]) != 0 and len(b[i]) == 0:\n- count1+=1 \n else:\n for k,l in zip(a[i],b[i]):\n if(k!=l):\n count1+=1\n else:\n- if len(a[i]) == 0 and len(b[i]) != 0:\n count2+=1\n- elif len(a[i]) != 0 and len(b[i]) == 0:\n- count2+=1 \n else:\n for k,l in zip(a[i],b[i]):\n if(k!=l):\n count2+=1 \n if count1==0 and count2==0:\n results.append(0)\n elif count1==1 and count2==0:\n results.append(1)\n else:\n results.append(2)\n for i in results:\n if i==0:\n print(\"IDENTICAL\")\n if i==1:\n print(\"CLOSE\")\n if i==2:\n print(\"DIFFERENT\")\n \n", "added_lines": 2, "removed_lines": 6, "code1_lines": 44 }, { "user_id": "u564464686", "problem_id": "p01102", "submission1_id": "s627257406", "submission2_id": "s840149698", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def p(A,s):\n i=0\n j=0\n s=[]\n while(len(A)>i):\n if A[i]=='\"':\n list1=A.partition('\"')\n s.append(list1[0])\n A=list1[2]\n i=0\n j+=1\n else:\n i+=1\n if len(A)==i:\n s.append(A)\n return s\nA=input()\ns1=[]\ns2=[]\nO=[]\nwhile 1:\n i=0\n cnt=0\n B=input()\n s1=p(A,s1)\n s2=p(B,s2)\n l1=len(s1)\n l2=len(s2) \n while i\n i=0 # (10): i=0 (106): i=0 ... (1531): i=0\n j=0 # (11): j=0 (107): j=0 ... (1532): j=0\n s=[] # (12): NO CHANGE (108): NO CHANGE ... (1533): s=[]\n while(len(A)>i): # (13): NO CHANGE (17): NO CHANGE ... (1573): p=, A=11\"12\"11, s1=['11', '12', '11'], s2=['13', '3', '111'], O=['CLOSE', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'CLOSE', 'DIFFERENT'], i=0, cnt=0, B=13\"3\"111, l1=4, l2=4\n if A[i]=='\"': # (14): NO CHANGE (18): NO CHANGE ... (1569): NO CHANGE\n list1=A.partition('\"') # (35): list1=('print', '\"', 'hello\";print133') (62): list1=('hello', '\"', ';print133') ... (1555): list1=('3', '\"', '111')\n s.append(list1[0]) # (36): s=['print'] (63): s=['print', 'hello'] ... (1556): s=['13', '3']\n A=list1[2] # (37): A=hello\";print133 (64): A=;print133 ... (1557): A=111\n i=0 # (38): i=0 (65): i=0 ... (1558): i=0\n j+=1 # (39): j=1 (66): j=2 ... (1559): j=2\n else:\n i+=1 # (15): i=1 (19): i=2 ... (1570): i=3\n if len(A)==i: # (16): NO CHANGE (20): NO CHANGE ... (1571): NO CHANGE\n s.append(A) # (103): s=['print', 'hello', ';print133'] (199): s=['print', 'hello', ';qrinu123'] ... (1572): s=['13', '3', '111']\n return s\nA=input() # (1): A=print\"hello\";print133\ns1=[] # (2): s1=[]\ns2=[] # (3): s2=[]\nO=[] # (4): O=[]\nwhile 1: # (5): NO CHANGE (219): NO CHANGE ... (1482): NO CHANGE\n i=0 # (6): i=0 (220): i=0 ... (1483): i=0\n cnt=0 # (7): cnt=0 (221): cnt=0 ... (1484): cnt=0\n B=input() # (8): B=print\"hello\";qrinu123 (222): B=;tuptuo;evlos;\"2B\"daer ... (1485): B=13\"3\"111\n s1=p(A,s1) # (9): s=[] (223): s=['print', 'hello', ';print133'] ... (1486): s=['I', 'S', '', 'CREAM']\n s2=p(B,s2) # (105): A=print\"hello\";qrinu123, s=[] (343): A=;tuptuo;evlos;\"2B\"daer, s=['print', 'hello', ';qrinu123'] ... (1530): A=13\"3\"111, s=['I', 'CE', '', 'BREAM']\n l1=len(s1) # (201): l1=3 (443): NO CHANGE ... (1574): l1=3\n l2=len(s2) # (202): l2=3 (444): NO CHANGE ... (1575): l2=3\n while ii):\n- if A[i]=='\"':\n- list1=A.partition('\"')\n- s.append(list1[0])\n- A=list1[2]\n- i=0\n- j+=1\n- else:\n- i+=1\n- if len(A)==i:\n- s.append(A)\n- return s\n-A=input()\n s1=[]\n s2=[]\n O=[]\n while 1:\n+ A=input().split('\"')\n+ if A==[\".\"]:\n+ break\n i=0\n cnt=0\n- B=input()\n- s1=p(A,s1)\n- s2=p(B,s2)\n- l1=len(s1)\n- l2=len(s2) \n- while ii):\n- if A[i]=='\"':\n- list1=A.partition('\"')\n- s.append(list1[0])\n- A=list1[2]\n- i=0\n- j+=1\n- else:\n- i+=1\n- if len(A)==i:\n- s.append(A)\n- return s\n-A=input()\n s1=[]\n s2=[]\n O=[]\n while 1:\n i=0\n cnt=0\n- B=input()\n- s1=p(A,s1)\n- s2=p(B,s2)\n- l1=len(s1)\n- l2=len(s2) \n- while i l1-2:\n if cnt == 1:\n print(\"CLOSE\")\n break\n else:\n print(\"IDENTICAL\")\n break\n if s1[i] != s2[i]:\n print(\"DIFFERENT\")\n break\n if s1[i+1] != s2[i+1]:\n if cnt == 1:\n print(\"DIFFERENT\")\n break\n else: cnt = 1\n i += 2\n\n", "code2": "while 1:\n s1 = input().split('\"')\n l1 = len(s1)\n if s1[0] == \".\": break\n s2 = input().split('\"')\n l2 = len(s2)\n if l1 != l2:\n print(\"DIFFERENT\")\n continue\n i = 0\n cnt = 0\n\n while 1:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\")\n break\n if i > l1-2:\n if cnt == 1:\n print(\"CLOSE\")\n break\n else:\n print(\"IDENTICAL\")\n break\n if s1[i+1] != s2[i+1]:\n if cnt == 1:\n print(\"DIFFERENT\")\n break\n else: cnt = 1\n i += 2\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526464940", "date2": "1526465981", "bleu_score": "0.9900167540144057", "code1_test_status": [1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1], "code1_test_score": 39, "total_score": 101, "input": "print\"hello\";print133\nprint\"hello\";print123\nread\"B1input\";somve;output;\n;tuptuo;evlos;\"2B\"daer\nread\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"!\"\"\"\"\"\"\n\"\"\"52\"\"#\"\"\nslow\"program\"\nfast\"code\"\n\"super\"fast\"program\"\n\"super\"faster\"prohram\"\nX\"\"\nY\nI\"S\"\"CREAM\"\nI\"CE\"\"BREAM\"\n11\"22\"11\n13\"3\"111\n.\n", "actual_output": "IDENTICAL\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\n", "expected_output": "DIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\n\n", "anno_code": ["while 1: # (0): NO CHANGE (19): NO CHANGE ... (158): NO CHANGE\n s1 = input().split('\\\"') # (1): s1=['print', 'hello', ';print133'] (20): s1=['read', 'B1input', ';somve;output;'] ... (159): s1=['.']\n l1 = len(s1) # (2): l1=3 (21): NO CHANGE ... (160): l1=1\n if s1[0] == \".\": break # (3): NO CHANGE (22): NO CHANGE ... (147): NO CHANGE\n s2 = input().split('\\\"') # (4): s2=['print', 'hello', ';print123'] (23): s2=[';tuptuo;evlos;', '2B', 'daer'] ... (148): s2=['13', '3', '111']\n l2 = len(s2) # (5): l2=3 (24): NO CHANGE ... (149): l2=3\n if l1 != l2: # (6): NO CHANGE (25): NO CHANGE ... (150): NO CHANGE\n print(\"DIFFERENT\") # (119): NO CHANGE\n continue # (120): NO CHANGE\n i = 0 # (7): i=0 (26): i=0 ... (151): i=0\n cnt = 0 # (8): cnt=0 (27): NO CHANGE ... (152): cnt=0\n while 1: # (9): NO CHANGE (14): NO CHANGE ... (153): NO CHANGE\n if i > l1-2: # (10): NO CHANGE (15): NO CHANGE ... (154): NO CHANGE\n if cnt == 1: # (16): NO CHANGE\n print(\"CLOSE\")\n break\n else:\n print(\"IDENTICAL\") # (17): NO CHANGE\n break # (18): NO CHANGE\n if s1[i] != s2[i]: # (11): NO CHANGE (30): NO CHANGE ... (155): NO CHANGE\n print(\"DIFFERENT\") # (31): NO CHANGE (91): NO CHANGE ... (156): NO CHANGE\n break # (32): NO CHANGE (92): NO CHANGE ... (157): NO CHANGE\n if s1[i+1] != s2[i+1]: # (12): NO CHANGE (45): NO CHANGE ... (140): NO CHANGE\n if cnt == 1: # (46): NO CHANGE (53): NO CHANGE ... (141): NO CHANGE\n print(\"DIFFERENT\") # (54): NO CHANGE (77): NO CHANGE (142): NO CHANGE\n break # (55): NO CHANGE (78): NO CHANGE (143): NO CHANGE\n else: cnt = 1 # (47): cnt=1 (70): cnt=1 (135): cnt=1\n i += 2 # (13): i=2 (48): i=2 ... (136): i=2\n\n"], "anno_status": [false], "diff_content": " while 1:\n- s1 = input().split('\\\"')\n+ s1 = input().split('\"')\n l1 = len(s1)\n if s1[0] == \".\": break\n- s2 = input().split('\\\"')\n+ s2 = input().split('\"')\n l2 = len(s2)\n if l1 != l2:\n print(\"DIFFERENT\")\n continue\n i = 0\n cnt = 0\n+\n while 1:\n+ if s1[i] != s2[i]:\n+ print(\"DIFFERENT\")\n+ break\n if i > l1-2:\n if cnt == 1:\n print(\"CLOSE\")\n break\n else:\n print(\"IDENTICAL\")\n break\n- if s1[i] != s2[i]:\n- print(\"DIFFERENT\")\n- break\n if s1[i+1] != s2[i+1]:\n if cnt == 1:\n print(\"DIFFERENT\")\n break\n else: cnt = 1\n i += 2\n \n-\n", "FL_content": " while 1:\n- s1 = input().split('\\\"')\n l1 = len(s1)\n if s1[0] == \".\": break\n- s2 = input().split('\\\"')\n l2 = len(s2)\n if l1 != l2:\n print(\"DIFFERENT\")\n continue\n i = 0\n cnt = 0\n while 1:\n if i > l1-2:\n if cnt == 1:\n print(\"CLOSE\")\n break\n else:\n print(\"IDENTICAL\")\n break\n- if s1[i] != s2[i]:\n- print(\"DIFFERENT\")\n- break\n if s1[i+1] != s2[i+1]:\n if cnt == 1:\n print(\"DIFFERENT\")\n break\n else: cnt = 1\n i += 2\n \n-\n", "added_lines": 6, "removed_lines": 6, "code1_lines": 30 }, { "user_id": "u396086105", "problem_id": "p01102", "submission1_id": "s469808693", "submission2_id": "s645351303", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n s1 = input()\n if s1 == '.':\n break\n s2 = input()\n\n if s1 == s2:\n print(\"IDENTICAL\")\n continue\n\n s2 = s2.split('\"')\n s1 = s1.split('\"')\n \n \n count = 0\n isTmp = False\n if s1[0] == '\"' and s2[0] == '\"':\n isTmp = True\n\n for i in range(len(s1)):\n if len(s1) != len(s2):\n print(\"DIFFERENT\")\n break\n if count > 1:\n print(\"DIFFERENT\")\n break\n\n if not isTmp:\n if i % 2 == 0:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\");\n break\n if i % 2 == 1:\n if s1[i] != s2[i]:\n count += 1\n else:\n if i+1 % 2 == 0:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\");\n break\n if i+1 % 2 == 1:\n if s1[i] != s2[i]:\n count += 1\n\n if count == 1:\n print(\"CLOSE\")\n\n", "code2": "while True:\n s1 = input()\n if s1 == '.':\n break\n s2 = input()\n\n if s1 == s2:\n print(\"IDENTICAL\")\n continue\n\n s2 = s2.split('\"')\n s1 = s1.split('\"')\n \n \n count = 0\n isTmp = False\n if s1[0] == '\"' and s2[0] == '\"':\n isTmp = True\n\n hoge = True\n for i in range(len(s1)):\n if len(s1) != len(s2):\n print(\"DIFFERENT\")\n hoge = False\n break\n if count > 1:\n print(\"DIFFERENT\")\n hoge = False\n break\n\n if not isTmp:\n if i % 2 == 0:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\");\n hoge = False\n break\n if i % 2 == 1:\n if s1[i] != s2[i]:\n count += 1\n else:\n if i+1 % 2 == 0:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\");\n hoge = False\n break\n if i+1 % 2 == 1:\n if s1[i] != s2[i]:\n count += 1\n\n if count == 1 and hoge:\n print(\"CLOSE\")\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1527521338", "date2": "1527521993", "bleu_score": "0.8745028302175275", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1], "code1_test_score": 56, "total_score": 101, "input": "print\"hello\";print133\nprint\"helln\";print123\nread\"B1input\";solve;output;\n;tuptuo;evmos;\"2B\"daer\nread\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"\"\"\"\"\"\"\"\n\"\"\"42\"\"#\"\"\nslow\"program\"\nfast\"code\"\n\"super\"fast\"program\"\n\"super\"faster\"program\"\nX#\"\nY\nI\"S\"\"CREAM\"\nI\"CE\"\"CREAM\"\n11\"22\"11\n1\"33\"111\n.\n", "actual_output": "DIFFERENT\nCLOSE\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\n", "expected_output": "DIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\n\n", "anno_code": ["while True: # (0): NO CHANGE (35): NO CHANGE ... (250): NO CHANGE\n s1 = input() # (1): s1=print\"hello\";print133 (36): s1=read\"B1input\";solve;output; ... (251): s1=.\n if s1 == '.': # (2): NO CHANGE (37): NO CHANGE ... (252): NO CHANGE\n break\n s2 = input() # (3): s2=print\"helln\";print123 (38): s2=;tuptuo;evmos;\"2B\"daer ... (234): s2=1\"33\"111\n\n if s1 == s2: # (4): NO CHANGE (39): NO CHANGE ... (235): NO CHANGE\n print(\"IDENTICAL\")\n continue\n\n s2 = s2.split('\"') # (5): s2=['print', 'helln', ';print123'] (40): s2=[';tuptuo;evmos;', '2B', 'daer'] ... (236): s2=['1', '33', '111']\n s1 = s1.split('\"') # (6): s1=['print', 'hello', ';print133'] (41): s1=['read', 'B1input', ';solve;output;'] ... (237): s1=['11', '22', '11']\n \n \n count = 0 # (7): count=0 (42): count=0 ... (238): count=0\n isTmp = False # (8): isTmp=False (43): NO CHANGE ... (239): NO CHANGE\n if s1[0] == '\"' and s2[0] == '\"': # (9): NO CHANGE (44): NO CHANGE ... (240): NO CHANGE\n isTmp = True\n\n for i in range(len(s1)): # (10): i=0 (17): i=1 ... (241): i=0\n if len(s1) != len(s2): # (11): NO CHANGE (18): NO CHANGE ... (242): NO CHANGE\n print(\"DIFFERENT\") # (112): NO CHANGE (179): NO CHANGE\n break # (113): NO CHANGE (180): NO CHANGE\n if count > 1: # (12): NO CHANGE (19): NO CHANGE ... (243): NO CHANGE\n print(\"DIFFERENT\") # (97): NO CHANGE\n break # (98): NO CHANGE\n\n if not isTmp: # (13): NO CHANGE (20): NO CHANGE ... (244): NO CHANGE\n if i % 2 == 0: # (14): NO CHANGE (21): NO CHANGE ... (245): NO CHANGE\n if s1[i] != s2[i]: # (15): NO CHANGE (30): NO CHANGE ... (246): NO CHANGE\n print(\"DIFFERENT\"); # (31): NO CHANGE (51): NO CHANGE ... (247): NO CHANGE\n break # (32): NO CHANGE (52): NO CHANGE ... (248): NO CHANGE\n if i % 2 == 1: # (16): NO CHANGE (22): NO CHANGE ... (227): NO CHANGE\n if s1[i] != s2[i]: # (23): NO CHANGE (77): NO CHANGE ... (220): NO CHANGE\n count += 1 # (24): count=1 (78): count=1 ... (206): count=1\n else:\n if i+1 % 2 == 0:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\");\n break\n if i+1 % 2 == 1:\n if s1[i] != s2[i]:\n count += 1\n\n if count == 1: # (33): NO CHANGE (53): NO CHANGE ... (249): NO CHANGE\n print(\"CLOSE\") # (34): NO CHANGE (230): NO CHANGE\n\n"], "anno_status": [false], "diff_content": " while True:\n s1 = input()\n if s1 == '.':\n break\n s2 = input()\n \n if s1 == s2:\n print(\"IDENTICAL\")\n continue\n \n s2 = s2.split('\"')\n s1 = s1.split('\"')\n \n \n count = 0\n isTmp = False\n if s1[0] == '\"' and s2[0] == '\"':\n isTmp = True\n \n+ hoge = True\n for i in range(len(s1)):\n if len(s1) != len(s2):\n print(\"DIFFERENT\")\n+ hoge = False\n break\n if count > 1:\n print(\"DIFFERENT\")\n+ hoge = False\n break\n \n if not isTmp:\n if i % 2 == 0:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\");\n+ hoge = False\n break\n if i % 2 == 1:\n if s1[i] != s2[i]:\n count += 1\n else:\n if i+1 % 2 == 0:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\");\n+ hoge = False\n break\n if i+1 % 2 == 1:\n if s1[i] != s2[i]:\n count += 1\n \n- if count == 1:\n+ if count == 1 and hoge:\n print(\"CLOSE\")\n \n \n", "FL_content": " while True:\n s1 = input()\n if s1 == '.':\n break\n s2 = input()\n \n if s1 == s2:\n print(\"IDENTICAL\")\n continue\n \n s2 = s2.split('\"')\n s1 = s1.split('\"')\n \n \n count = 0\n isTmp = False\n if s1[0] == '\"' and s2[0] == '\"':\n isTmp = True\n \n for i in range(len(s1)):\n if len(s1) != len(s2):\n print(\"DIFFERENT\")\n break\n if count > 1:\n print(\"DIFFERENT\")\n break\n \n if not isTmp:\n if i % 2 == 0:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\");\n break\n if i % 2 == 1:\n if s1[i] != s2[i]:\n count += 1\n else:\n if i+1 % 2 == 0:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\");\n break\n if i+1 % 2 == 1:\n if s1[i] != s2[i]:\n count += 1\n \n- if count == 1:\n print(\"CLOSE\")\n \n \n", "added_lines": 6, "removed_lines": 1, "code1_lines": 48 }, { "user_id": "u481571686", "problem_id": "p01102", "submission1_id": "s565601640", "submission2_id": "s510258139", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A=[]\nwhile True:\t\n\ta=input().split('\"')\n\tif a[0]==\".\":\n\t\tbreak\n\tb=input().split('\"')\n\t\n\tcnt=0\n\n\tif len(a)!=len(b):\n\t\tA.append(-1)\n\telse:\n\t\tfor i in range(len(a)):\n\t\t\tif(a[i]==b[i]):\n\t\t\t\tpass\n\t\t\telse:\n\t\t\t\tcnt+=1\n\t\tprint(cnt)\n\t\tif cnt>=2:\n\t\t\tA.append(-1)\n\t\tif cnt==1:\n\t\t\tA.append(0)\n\t\tif cnt==0:\n\t\t\tA.append(1)\n\nA.reverse()\n\nfor i in range(len(A)):\n\ttmp=A.pop()\n\tif tmp==-1:\n\t\tprint(\"DIFFERENT\")\n\telif tmp==0:\n\t\tprint(\"CLOSE\")\n\telse:\n\t\tprint(\"IDENTICAL\")\n", "code2": "A=[]\nwhile True:\t\n\ta=input().split('\"')\n\tif a[0]==\".\":\n\t\tbreak\n\tb=input().split('\"')\n\t\n\tcnt=0\n\n\tif len(a)!=len(b):\n\t\tA.append(-1)\n\telse:\n\t\tfor i in range(len(a)):\n\t\t\tif(a[i]==b[i]):\n\t\t\t\tpass\n\t\t\telse:\n\t\t\t\tif i%2==1:\n\t\t\t\t\tcnt+=1\n\t\t\t\telse:\n\t\t\t\t\tcnt+=2\n\t\tif cnt>=2:\n\t\t\tA.append(-1)\n\t\tif cnt==1:\n\t\t\tA.append(0)\n\t\tif cnt==0:\n\t\t\tA.append(1)\n\nA.reverse()\n\nfor i in range(len(A)):\n\ttmp=A.pop()\n\tif tmp==-1:\n\t\tprint(\"DIFFERENT\")\n\telif tmp==0:\n\t\tprint(\"CLOSE\")\n\telse:\n\t\tprint(\"IDENTICAL\")\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526956172", "date2": "1527006706", "bleu_score": "0.9270424711733446", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "print\"hello\";print133\n321tnirp;\"olleh\"tnirp\nread\"e1input\";solvB;output;\n;tuptuo;evlos;\"2B\"daer\nreae\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"\"\"\"\"\"\"\"\n\"\"\"52\"\"#\"\"\nslow\"program\"\nfast\"code\"\n\"super\"fast\"program\"\n\"super\"faster\"qrogram\"\nX\"\"\nY\nI\"S\"\"CREAM\"\nI\"CE\"\"BREAM\"\n11\"22\"11\n1\"33\"112\n.\n", "actual_output": "3\n3\n3\n2\n2\n2\n3\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\n", "expected_output": "DIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\n\n", "anno_code": ["A=[] # (0): A=[]\nwhile True:\t # (1): NO CHANGE (22): NO CHANGE ... (180): NO CHANGE\n\ta=input().split('\"') # (2): a=['print', 'hello', ';print133'] (23): a=['read', 'e1input', ';solvB;output;'] ... (181): a=['.']\n\tif a[0]==\".\": # (3): NO CHANGE (24): NO CHANGE ... (182): NO CHANGE\n\t\tbreak # (183): NO CHANGE\n\tb=input().split('\"') # (4): b=['321tnirp;', 'olleh', 'tnirp'] (25): b=[';tuptuo;evlos;', '2B', 'daer'] ... (162): b=['1', '33', '112']\n\t\n\tcnt=0 # (5): cnt=0 (26): cnt=0 ... (163): cnt=0\n\n\tif len(a)!=len(b): # (6): NO CHANGE (27): NO CHANGE ... (164): NO CHANGE\n\t\tA.append(-1) # (76): A=[-1, -1, -1, -1] (131): A=[-1, -1, -1, -1, -1, -1, -1]\n\telse:\n\t\tfor i in range(len(a)): # (7): i=0 (10): i=1 ... (174): NO CHANGE\n\t\t\tif(a[i]==b[i]): # (8): NO CHANGE (11): NO CHANGE ... (172): NO CHANGE\n\t\t\t\tpass # (57): NO CHANGE (63): NO CHANGE ... (152): NO CHANGE\n\t\t\telse:\n\t\t\t\tcnt+=1 # (9): cnt=1 (12): cnt=2 ... (173): cnt=3\n\t\tprint(cnt) # (17): NO CHANGE (38): NO CHANGE ... (175): NO CHANGE\n\t\tif cnt>=2: # (18): NO CHANGE (39): NO CHANGE ... (176): NO CHANGE\n\t\t\tA.append(-1) # (19): A=[-1] (40): A=[-1, -1] ... (177): A=[-1, -1, -1, -1, -1, -1, -1, -1, -1]\n\t\tif cnt==1: # (20): NO CHANGE (41): NO CHANGE ... (178): NO CHANGE\n\t\t\tA.append(0)\n\t\tif cnt==0: # (21): NO CHANGE (42): NO CHANGE ... (179): NO CHANGE\n\t\t\tA.append(1)\n\nA.reverse() # (184): NO CHANGE\n\nfor i in range(len(A)): # (185): i=0 (189): i=1 ... (217): i=8\n\ttmp=A.pop() # (186): A=[-1, -1, -1, -1, -1, -1, -1, -1], tmp=-1 (190): A=[-1, -1, -1, -1, -1, -1, -1] ... (218): A=[]\n\tif tmp==-1: # (187): NO CHANGE (191): NO CHANGE ... (219): NO CHANGE\n\t\tprint(\"DIFFERENT\") # (188): NO CHANGE (192): NO CHANGE ... (220): NO CHANGE\n\telif tmp==0:\n\t\tprint(\"CLOSE\")\n\telse:\n\t\tprint(\"IDENTICAL\")\n"], "anno_status": [false], "diff_content": " A=[]\n while True:\t\n \ta=input().split('\"')\n \tif a[0]==\".\":\n \t\tbreak\n \tb=input().split('\"')\n \t\n \tcnt=0\n \n \tif len(a)!=len(b):\n \t\tA.append(-1)\n \telse:\n \t\tfor i in range(len(a)):\n \t\t\tif(a[i]==b[i]):\n \t\t\t\tpass\n \t\t\telse:\n-\t\t\t\tcnt+=1\n-\t\tprint(cnt)\n+\t\t\t\tif i%2==1:\n+\t\t\t\t\tcnt+=1\n+\t\t\t\telse:\n+\t\t\t\t\tcnt+=2\n \t\tif cnt>=2:\n \t\t\tA.append(-1)\n \t\tif cnt==1:\n \t\t\tA.append(0)\n \t\tif cnt==0:\n \t\t\tA.append(1)\n \n A.reverse()\n \n for i in range(len(A)):\n \ttmp=A.pop()\n \tif tmp==-1:\n \t\tprint(\"DIFFERENT\")\n \telif tmp==0:\n \t\tprint(\"CLOSE\")\n \telse:\n \t\tprint(\"IDENTICAL\")\n \n", "FL_content": " A=[]\n while True:\t\n \ta=input().split('\"')\n \tif a[0]==\".\":\n \t\tbreak\n \tb=input().split('\"')\n \t\n \tcnt=0\n \n \tif len(a)!=len(b):\n \t\tA.append(-1)\n \telse:\n \t\tfor i in range(len(a)):\n \t\t\tif(a[i]==b[i]):\n \t\t\t\tpass\n \t\t\telse:\n-\t\t\t\tcnt+=1\n-\t\tprint(cnt)\n \t\tif cnt>=2:\n \t\t\tA.append(-1)\n \t\tif cnt==1:\n \t\t\tA.append(0)\n \t\tif cnt==0:\n \t\t\tA.append(1)\n \n A.reverse()\n \n for i in range(len(A)):\n \ttmp=A.pop()\n \tif tmp==-1:\n \t\tprint(\"DIFFERENT\")\n \telif tmp==0:\n \t\tprint(\"CLOSE\")\n \telse:\n \t\tprint(\"IDENTICAL\")\n \n", "added_lines": 4, "removed_lines": 2, "code1_lines": 36 }, { "user_id": "u408444038", "problem_id": "p01102", "submission1_id": "s089191014", "submission2_id": "s618343622", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a1 = input()\na2 = input()\nb1 = a1.split('\"')\nb2 = a2.split('\"')\ncnt = 0\nif len(b1)==len(b2):\n for i in range(0,len(b1)):\n if i%2==0:\n if b1[i]!=b2[i]:\n cnt+=10000\n break\n if i%2!=0:\n if b1[i]!=b2[i]:\n cnt+=1\nelse:\n cnt+=10000\n\nif cnt>1:\n print(\"DIFFERENT\")\nif cnt==1:\n print(\"CLOSE\")\nif cnt==0:\n print(\"IDENTICAL\")\n", "code2": "st = []\nwhile(1):\n a1 = input()\n if a1 =='.':\n break\n a2 = input()\n b1 = a1.split('\"')\n b2 = a2.split('\"')\n cnt = 0\n if len(b1)==len(b2):\n for i in range(0,len(b1)):\n if i%2==0:\n if b1[i]!=b2[i]:\n cnt+=10000\n break\n if i%2!=0:\n if b1[i]!=b2[i]:\n cnt+=1\n else:\n cnt+=10000\n \n if cnt>1:\n st.append(\"DIFFERENT\")\n if cnt==1:\n st.append(\"CLOSE\")\n if cnt==0:\n st.append(\"IDENTICAL\")\n\nfor i in range(len(st)):\n print(st[i])\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526969705", "date2": "1526970149", "bleu_score": "0.6343050363129596", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "print\"hello\";irpnt123\nprint\"hello\";print123\nread\"B1input\";solve;output;\nread\"B2\";stlve;ovtpuo;\nread\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"\"\"\"\"\"\"\"\n\"\"\"\"\"24\"\"\"\nslwo\"program\"\n\"edoc\"tsaf\n\"super\"fast\"program\"\n\"super\"faster\"program\"\n\"\"X\nX\nI\"S\"\"CREAM\"\nI\"CE\"\"CREAM\"\n11\"22\"11\n1\"33\"111\n.\n", "actual_output": "DIFFERENT\n", "expected_output": "DIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\n\n", "anno_code": ["a1 = input() # (0): a1=print\"hello\";irpnt123\na2 = input() # (1): a2=print\"hello\";print123\nb1 = a1.split('\"') # (2): b1=['print', 'hello', ';irpnt123']\nb2 = a2.split('\"') # (3): b2=['print', 'hello', ';print123']\ncnt = 0 # (4): cnt=0\nif len(b1)==len(b2): # (5): NO CHANGE\n for i in range(0,len(b1)): # (6): i=0 (10): i=1 (14): i=2\n if i%2==0: # (7): NO CHANGE (11): NO CHANGE (15): NO CHANGE\n if b1[i]!=b2[i]: # (8): NO CHANGE (16): NO CHANGE\n cnt+=10000 # (17): cnt=10000\n break # (18): NO CHANGE\n if i%2!=0: # (9): NO CHANGE (12): NO CHANGE\n if b1[i]!=b2[i]: # (13): NO CHANGE\n cnt+=1\nelse:\n cnt+=10000\n\nif cnt>1: # (19): NO CHANGE\n print(\"DIFFERENT\") # (20): NO CHANGE\nif cnt==1: # (21): NO CHANGE\n print(\"CLOSE\")\nif cnt==0:\n print(\"IDENTICAL\")\n"], "anno_status": [true], "diff_content": "-a1 = input()\n-a2 = input()\n-b1 = a1.split('\"')\n-b2 = a2.split('\"')\n-cnt = 0\n-if len(b1)==len(b2):\n- for i in range(0,len(b1)):\n- if i%2==0:\n- if b1[i]!=b2[i]:\n- cnt+=10000\n- break\n- if i%2!=0:\n- if b1[i]!=b2[i]:\n- cnt+=1\n-else:\n- cnt+=10000\n+st = []\n+while(1):\n+ a1 = input()\n+ if a1 =='.':\n+ break\n+ a2 = input()\n+ b1 = a1.split('\"')\n+ b2 = a2.split('\"')\n+ cnt = 0\n+ if len(b1)==len(b2):\n+ for i in range(0,len(b1)):\n+ if i%2==0:\n+ if b1[i]!=b2[i]:\n+ cnt+=10000\n+ break\n+ if i%2!=0:\n+ if b1[i]!=b2[i]:\n+ cnt+=1\n+ else:\n+ cnt+=10000\n+ \n+ if cnt>1:\n+ st.append(\"DIFFERENT\")\n+ if cnt==1:\n+ st.append(\"CLOSE\")\n+ if cnt==0:\n+ st.append(\"IDENTICAL\")\n \n-if cnt>1:\n- print(\"DIFFERENT\")\n-if cnt==1:\n- print(\"CLOSE\")\n-if cnt==0:\n- print(\"IDENTICAL\")\n+for i in range(len(st)):\n+ print(st[i])\n \n", "FL_content": "-a1 = input()\n-a2 = input()\n-b1 = a1.split('\"')\n-b2 = a2.split('\"')\n-cnt = 0\n-if len(b1)==len(b2):\n- for i in range(0,len(b1)):\n- if i%2==0:\n- if b1[i]!=b2[i]:\n- cnt+=10000\n- break\n- if i%2!=0:\n- if b1[i]!=b2[i]:\n- cnt+=1\n-else:\n- cnt+=10000\n \n-if cnt>1:\n- print(\"DIFFERENT\")\n-if cnt==1:\n- print(\"CLOSE\")\n-if cnt==0:\n- print(\"IDENTICAL\")\n \n", "added_lines": 29, "removed_lines": 22, "code1_lines": 24 }, { "user_id": "u063056051", "problem_id": "p01102", "submission1_id": "s727619822", "submission2_id": "s127406693", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while 1:\n s1=input().split('\"')\n if s1[0]==\".\":\n break\n s2=input().split('\"')\n \n flag2=0\n cnt2=0\n flag=0\n \n if len(s1)!=len(s2):\n print(\"DIFFERENT\")\n else:\n i=0\n while i1:\n print(\"DIFFERENT\")\n break\n i+=1\n \n if flag==0 and cnt2==1:\n print(\"CLOSE\")\n if flag2==1:\n print(\"IDENTICAL\")\n", "code2": "while 1:\n s1=input().split('\"')\n if s1[0]==\".\":\n break\n s2=input().split('\"')\n \n cnt1=0\n cnt2=0\n flag=0\n \n if len(s1)!=len(s2):\n print(\"DIFFERENT\")\n else:\n i=0\n while i1:\n print(\"DIFFERENT\")\n break\n i+=1\n \n if flag==0 and cnt2==1:\n print(\"CLOSE\")\n if cnt1==len(s1):\n print(\"IDENTICAL\")\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526985377", "date2": "1526985390", "bleu_score": "0.9628015617383371", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "print\"hello\";print123\nprint\"hello\";print123\nread\"B1input\";solve;output;\nread\"B2\";stlve;ovtpuo;\nread\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"\"\"\"\"\"\"\"\n\"\"\"\"\"24\"\"\"\nslwo\"program\"\nfast\"code\"\n\"super\"fast\"program\"\n\"super\"faster\"program\"\n\"\"X\nX\nI\"S\"\"CREAM\"\nI\"CE\"\"CREAM\"\n11\"22\"11\n1\"33\"111\n.\n", "actual_output": "IDENTICAL\nDIFFERENT\nIDENTICAL\nDIFFERENT\nIDENTICAL\nCLOSE\nIDENTICAL\nDIFFERENT\nDIFFERENT\nIDENTICAL\nDIFFERENT\nCLOSE\nIDENTICAL\nDIFFERENT\n", "expected_output": "IDENTICAL\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\n\n", "anno_code": ["while 1: # (0): NO CHANGE (25): NO CHANGE ... (243): NO CHANGE\n s1=input().split('\"') # (1): s1=['print', 'hello', ';print123'] (26): s1=['read', 'B1input', ';solve;output;'] ... (244): s1=['.']\n if s1[0]==\".\": # (2): NO CHANGE (27): NO CHANGE ... (245): NO CHANGE\n break\n s2=input().split('\"') # (3): s2=['print', 'hello', ';print123'] (28): s2=['read', 'B2', ';stlve;ovtpuo;'] ... (229): s2=['1', '33', '111']\n \n flag2=0 # (4): flag2=0 (29): flag2=0 ... (230): flag2=0\n cnt2=0 # (5): cnt2=0 (30): NO CHANGE ... (231): cnt2=0\n flag=0 # (6): flag=0 (31): NO CHANGE ... (232): NO CHANGE\n \n if len(s1)!=len(s2): # (7): NO CHANGE (32): NO CHANGE ... (233): NO CHANGE\n print(\"DIFFERENT\") # (189): NO CHANGE\n else:\n i=0 # (8): i=0 (33): i=0 ... (234): i=0\n while i1: # (42): NO CHANGE (70): NO CHANGE ... (207): NO CHANGE\n print(\"DIFFERENT\") # (81): NO CHANGE\n break # (82): NO CHANGE\n i+=1 # (12): i=1 (16): i=2 ... (220): i=5\n \n if flag==0 and cnt2==1: # (22): NO CHANGE (50): NO CHANGE ... (241): NO CHANGE\n print(\"CLOSE\") # (135): NO CHANGE (223): NO CHANGE\n if flag2==1: # (23): NO CHANGE (51): NO CHANGE ... (242): NO CHANGE\n print(\"IDENTICAL\") # (24): NO CHANGE (52): NO CHANGE ... (225): NO CHANGE\n"], "anno_status": [false], "diff_content": " while 1:\n s1=input().split('\"')\n if s1[0]==\".\":\n break\n s2=input().split('\"')\n \n- flag2=0\n+ cnt1=0\n cnt2=0\n flag=0\n \n if len(s1)!=len(s2):\n print(\"DIFFERENT\")\n else:\n i=0\n while i1:\n print(\"DIFFERENT\")\n break\n i+=1\n \n if flag==0 and cnt2==1:\n print(\"CLOSE\")\n- if flag2==1:\n+ if cnt1==len(s1):\n print(\"IDENTICAL\")\n \n", "FL_content": " while 1:\n s1=input().split('\"')\n if s1[0]==\".\":\n break\n s2=input().split('\"')\n \n- flag2=0\n cnt2=0\n flag=0\n \n if len(s1)!=len(s2):\n print(\"DIFFERENT\")\n else:\n i=0\n while i1:\n print(\"DIFFERENT\")\n break\n i+=1\n \n if flag==0 and cnt2==1:\n print(\"CLOSE\")\n- if flag2==1:\n print(\"IDENTICAL\")\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 33 }, { "user_id": "u217703215", "problem_id": "p01102", "submission1_id": "s641451662", "submission2_id": "s029593510", "status1": "Wrong Answer", "status2": "Accepted", "code1": "ans=[]\nwhile 1:\n s1=input().split('\"')\n if s1==[\".\"]: break\n s2=input().split('\"')\n if len(s1)!=len(s2):\n ans.append(\"DIFFERENT\")\n continue\n else:\n cnt=0\n for i in range(len(s1)):\n if s1[i]!=s2[i]:\n cnt+=1\n else: pass\n if cnt==0:\n ans.append(\"IDENTICAL\")\n elif cnt==1:\n ans.append(\"CLOSE\")\n else: \n ans.append(\"DIFFERENT\")\nfor i in range(len(ans)):\n print(ans[i])\n\n", "code2": "ans=[]\nwhile 1:\n s1=input().split('\"')\n if s1==[\".\"]: break\n s2=input().split('\"')\n if len(s1)!=len(s2):\n ans.append(\"DIFFERENT\")\n continue\n else:\n cnt=0\n flag=0\n for i in range(len(s1)):\n if s1[i]!=s2[i]:\n if i%2==0:\n ans.append(\"DIFFERENT\")\n flag=1\n break\n else:\n cnt+=1\n else: pass\n if flag==1:\n continue\n else: pass\n if cnt==0:\n ans.append(\"IDENTICAL\")\n elif cnt==1:\n ans.append(\"CLOSE\")\n else: \n ans.append(\"DIFFERENT\")\n\nfor i in range(len(ans)):\n print(ans[i])\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526614502", "date2": "1526889066", "bleu_score": "0.6884842588164952", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0], "code1_test_score": 26, "total_score": 101, "input": "print\"hello\";print133\nprint\"hello\";qrint123\nread\"B1input\";somve;output;\n;tuptuo;evlos;\"2B\"daer\nread\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"\"\"\"\"\"\"\"\n\"\"#\"\"25\"!\"\nslow\"progr\"ma\nfast\"cod\"e\n\"surer\"fast\"progpam\"\n\"super\"faster\"prohram\"\nX\"\"\nY\nI\"S\"\"CREAM\"\nI\"CE\"\"BREAM\"\n11\"12\"11\n13\"3\"111\n.\n", "actual_output": "CLOSE\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\n", "expected_output": "DIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\n\n", "anno_code": ["ans=[] # (0): ans=[]\nwhile 1: # (1): NO CHANGE (20): NO CHANGE ... (166): NO CHANGE\n s1=input().split('\"') # (2): s1=['print', 'hello', ';print133'] (21): s1=['read', 'B1input', ';somve;output;'] ... (167): s1=['.']\n if s1==[\".\"]: break # (3): NO CHANGE (22): NO CHANGE ... (168): NO CHANGE\n s2=input().split('\"') # (4): s2=['print', 'hello', ';qrint123'] (23): s2=[';tuptuo;evlos;', '2B', 'daer'] ... (150): s2=['13', '3', '111']\n if len(s1)!=len(s2): # (5): NO CHANGE (24): NO CHANGE ... (151): NO CHANGE\n ans.append(\"DIFFERENT\") # (69): ans=['CLOSE', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT'] (120): ans=['CLOSE', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT']\n continue # (70): NO CHANGE (121): NO CHANGE\n else:\n cnt=0 # (6): cnt=0 (25): cnt=0 ... (152): cnt=0\n for i in range(len(s1)): # (7): i=0 (10): i=1 ... (162): NO CHANGE\n if s1[i]!=s2[i]: # (8): NO CHANGE (11): NO CHANGE ... (160): NO CHANGE\n cnt+=1 # (15): cnt=1 (28): cnt=1 ... (161): cnt=3\n else: pass # (9): NO CHANGE (12): NO CHANGE ... (142): NO CHANGE\n if cnt==0: # (17): NO CHANGE (36): NO CHANGE ... (163): NO CHANGE\n ans.append(\"IDENTICAL\")\n elif cnt==1: # (18): NO CHANGE (37): NO CHANGE ... (164): NO CHANGE\n ans.append(\"CLOSE\") # (19): ans=['CLOSE']\n else: \n ans.append(\"DIFFERENT\") # (38): ans=['CLOSE', 'DIFFERENT'] (63): ans=['CLOSE', 'DIFFERENT', 'DIFFERENT'] ... (165): ans=['CLOSE', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT']\nfor i in range(len(ans)): # (169): i=0 (171): i=1 ... (185): i=8\n print(ans[i]) # (170): NO CHANGE (172): NO CHANGE ... (186): NO CHANGE\n\n"], "anno_status": [false], "diff_content": " ans=[]\n while 1:\n s1=input().split('\"')\n if s1==[\".\"]: break\n s2=input().split('\"')\n if len(s1)!=len(s2):\n ans.append(\"DIFFERENT\")\n continue\n else:\n cnt=0\n+ flag=0\n for i in range(len(s1)):\n if s1[i]!=s2[i]:\n- cnt+=1\n+ if i%2==0:\n+ ans.append(\"DIFFERENT\")\n+ flag=1\n+ break\n+ else:\n+ cnt+=1\n else: pass\n+ if flag==1:\n+ continue\n+ else: pass\n if cnt==0:\n ans.append(\"IDENTICAL\")\n elif cnt==1:\n ans.append(\"CLOSE\")\n else: \n ans.append(\"DIFFERENT\")\n+\n for i in range(len(ans)):\n print(ans[i])\n \n-\n", "FL_content": " ans=[]\n while 1:\n s1=input().split('\"')\n if s1==[\".\"]: break\n s2=input().split('\"')\n if len(s1)!=len(s2):\n ans.append(\"DIFFERENT\")\n continue\n else:\n cnt=0\n for i in range(len(s1)):\n if s1[i]!=s2[i]:\n- cnt+=1\n else: pass\n if cnt==0:\n ans.append(\"IDENTICAL\")\n elif cnt==1:\n ans.append(\"CLOSE\")\n else: \n ans.append(\"DIFFERENT\")\n for i in range(len(ans)):\n print(ans[i])\n \n-\n", "added_lines": 11, "removed_lines": 2, "code1_lines": 24 }, { "user_id": "u619819312", "problem_id": "p03558", "submission1_id": "s474748392", "submission2_id": "s096592750", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\nk=int(input())\nt=[0]*k\nt[1]=1\nq=deque()\nq.append(1)\nwhile q:\n p=q.popleft()\n if p==0:\n print(t[0])\n break\n if not t[(p*10)%k]:\n t[(p*10)%k]=t[p]\n q.appendleft((p*10)%k)\n if not t[(p+1)%k]:\n t[(p+1)%k]=t[p]+1\n q.append((p+1)%k)", "code2": "from collections import deque\nk=int(input())\nt=[1]*k\nq=deque()\nq.append((1,1))\nwhile q:\n p,r=q.popleft()\n if p==0:\n print(r)\n break\n if t[p]:\n t[p]=0\n q.appendleft(((p*10)%k,r))\n q.append(((p+1)%k,r+1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577909776", "date2": "1577909906", "bleu_score": "0.6790013495944845", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 18, "total_score": 22, "input": "3197\n", "actual_output": "4\n", "expected_output": "2\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " from collections import deque\n k=int(input())\n-t=[0]*k\n-t[1]=1\n+t=[1]*k\n q=deque()\n-q.append(1)\n+q.append((1,1))\n while q:\n- p=q.popleft()\n+ p,r=q.popleft()\n if p==0:\n- print(t[0])\n+ print(r)\n break\n- if not t[(p*10)%k]:\n- t[(p*10)%k]=t[p]\n- q.appendleft((p*10)%k)\n- if not t[(p+1)%k]:\n- t[(p+1)%k]=t[p]+1\n- q.append((p+1)%k)\n+ if t[p]:\n+ t[p]=0\n+ q.appendleft(((p*10)%k,r))\n+ q.append(((p+1)%k,r+1))\n", "FL_content": " from collections import deque\n k=int(input())\n-t=[0]*k\n-t[1]=1\n q=deque()\n-q.append(1)\n while q:\n- p=q.popleft()\n if p==0:\n- print(t[0])\n break\n- if not t[(p*10)%k]:\n- t[(p*10)%k]=t[p]\n- q.appendleft((p*10)%k)\n- if not t[(p+1)%k]:\n- t[(p+1)%k]=t[p]+1\n- q.append((p+1)%k)\n", "added_lines": 8, "removed_lines": 11, "code1_lines": 17 }, { "user_id": "u690700473", "problem_id": "p03558", "submission1_id": "s620547233", "submission2_id": "s021949960", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\n\n\ndef solve(K):\n s = 1\n q = deque()\n q.append(s)\n dists = {}\n dists[s] = 1\n while len(q) > 0:\n n = q.pop()\n if n == 0:\n break\n m = (n*10)%K\n if m not in dists:\n dists[m] = dists[n]\n q.append(m)\n if dists[m] > dists[n]:\n dists[m] = dists[n]\n if n % 10 != 9:\n m = (n+1)%K\n if m not in dists:\n dists[m] = dists[n] + 1\n q.appendleft(m)\n if dists[m] > dists[n] + 1:\n dists[m] = dists[n] + 1\n return dists[0]\n\n\ndef main():\n K = int(input())\n print(solve(K))\n\n\nif __name__ == '__main__':\n main()\n", "code2": "from collections import deque\n\n\ndef solve(K):\n s = 1\n q = deque()\n q.append(s)\n dists = {}\n dists[s] = 1\n while len(q) > 0:\n n = q.pop()\n if n == 0:\n break\n m = (n*10)%K\n if m not in dists:\n dists[m] = dists[n]\n q.append(m)\n elif dists[m] > dists[n]:\n dists[m] = dists[n]\n q.append(m)\n if n % 10 != 9:\n m = (n+1)%K\n if m not in dists:\n dists[m] = dists[n] + 1\n q.appendleft(m)\n elif dists[m] > dists[n] + 1:\n dists[m] = dists[n] + 1\n q.appendleft(m)\n return dists[0]\n\n\ndef main():\n K = int(input())\n print(solve(K))\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553946437", "date2": "1553946737", "bleu_score": "0.9183315677781149", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 18, "total_score": 22, "input": "1246\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["from collections import deque\n\n\ndef solve(K): # (0): solve=\n s = 1\n q = deque()\n q.append(s)\n dists = {}\n dists[s] = 1\n while len(q) > 0:\n n = q.pop()\n if n == 0:\n break\n m = (n*10)%K\n if m not in dists:\n dists[m] = dists[n]\n q.append(m)\n if dists[m] > dists[n]:\n dists[m] = dists[n]\n if n % 10 != 9:\n m = (n+1)%K\n if m not in dists:\n dists[m] = dists[n] + 1\n q.appendleft(m)\n if dists[m] > dists[n] + 1:\n dists[m] = dists[n] + 1\n return dists[0]\n\n\ndef main(): # (1): main=\n K = int(input())\n print(solve(K))\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " from collections import deque\n \n \n def solve(K):\n s = 1\n q = deque()\n q.append(s)\n dists = {}\n dists[s] = 1\n while len(q) > 0:\n n = q.pop()\n if n == 0:\n break\n m = (n*10)%K\n if m not in dists:\n dists[m] = dists[n]\n q.append(m)\n- if dists[m] > dists[n]:\n+ elif dists[m] > dists[n]:\n dists[m] = dists[n]\n+ q.append(m)\n if n % 10 != 9:\n m = (n+1)%K\n if m not in dists:\n dists[m] = dists[n] + 1\n q.appendleft(m)\n- if dists[m] > dists[n] + 1:\n+ elif dists[m] > dists[n] + 1:\n dists[m] = dists[n] + 1\n+ q.appendleft(m)\n return dists[0]\n \n \n def main():\n K = int(input())\n print(solve(K))\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " from collections import deque\n \n \n def solve(K):\n s = 1\n q = deque()\n q.append(s)\n dists = {}\n dists[s] = 1\n while len(q) > 0:\n n = q.pop()\n if n == 0:\n break\n m = (n*10)%K\n if m not in dists:\n dists[m] = dists[n]\n q.append(m)\n- if dists[m] > dists[n]:\n dists[m] = dists[n]\n if n % 10 != 9:\n m = (n+1)%K\n if m not in dists:\n dists[m] = dists[n] + 1\n q.appendleft(m)\n- if dists[m] > dists[n] + 1:\n dists[m] = dists[n] + 1\n return dists[0]\n \n \n def main():\n K = int(input())\n print(solve(K))\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 4, "removed_lines": 2, "code1_lines": 37 }, { "user_id": "u788137651", "problem_id": "p03558", "submission1_id": "s549678201", "submission2_id": "s810790393", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\n\n\n\n\n\n\nimport sys\ninput=sys.stdin.readline\ninf=float('inf')\nmod = 10**9+7\ndef INT_(n): return int(n)-1\ndef MI(): return map(int,input().split())\ndef MF(): return map(float, input().split())\ndef MI_(): return map(INT_,input().split())\ndef LI(): return list(MI())\ndef LI_(): return [int(x) - 1 for x in input().split()]\ndef LF(): return list(MF())\ndef LIN(n:int): return [input() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\ndef LLIN_(n: int): return [LI_() for _ in range(n)]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef I(): return int(input())\ndef F(): return float(input())\ndef ST(): return input().replace('\\n', '')\ndef main():\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n zero_one_deque = deque([1])\n node = [inf] * K\n node[1]=1\n for i in range(K+1):\n tmp = deque()\n while zero_one_deque:\n from_ = zero_one_deque.popleft()\n for i, to in enumerate(edge[from_]):\n if node[to] != inf:\n continue\n node[to] = node[from_]\n if i == 0:\n tmp.appendleft(to)\n else: \n node[to] += 1\n tmp.append(to)\n zero_one_deque = tmp\n print(node[0])\n \n\n \n \nif __name__ == '__main__':\n main()", "code2": "\n\n\n\n\n\n\n\n\n\n\nimport sys\ninput=sys.stdin.readline\ninf=float('inf')\nmod = 10**9+7\ndef INT_(n): return int(n)-1\ndef MI(): return map(int,input().split())\ndef MF(): return map(float, input().split())\ndef MI_(): return map(INT_,input().split())\ndef LI(): return list(MI())\ndef LI_(): return [int(x) - 1 for x in input().split()]\ndef LF(): return list(MF())\ndef LIN(n:int): return [input() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\ndef LLIN_(n: int): return [LI_() for _ in range(n)]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef I(): return int(input())\ndef F(): return float(input())\ndef ST(): return input().replace('\\n', '')\ndef main():\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n zero_one_deque = deque([(1, 1)])\n node = [inf] * K\n \n node[1] = 1\n searched = set()\n while zero_one_deque:\n from_ , digit_sum = zero_one_deque.popleft()\n if from_ in searched:\n continue\n else:\n searched.add(from_)\n node[from_] = digit_sum\n \n for i, to in enumerate(edge[from_]):\n if i == 0:\n zero_one_deque.appendleft((to,node[from_]))\n else: \n zero_one_deque.append((to, node[from_] + 1))\n print(node[0])\n \n\nif __name__ == '__main__':\n main()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1559592470", "date2": "1559594990", "bleu_score": "0.9081561411408977", "code1_test_status": [0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 8, "total_score": 22, "input": "1246\n", "actual_output": "6\n", "expected_output": "3\n\n", "anno_code": ["\n\n\n\n\n\n\n\n\n\n\nimport sys\ninput=sys.stdin.readline # (0): input=\ninf=float('inf') # (1): inf=inf\nmod = 10**9+7 # (2): mod=1000000007, INT_=, MI=, MF=, MI_=, LI=, LI_=, LF=, LIN=, LLIN=, LLIN_=, LLI=, I=, F=, ST=\ndef INT_(n): return int(n)-1\ndef MI(): return map(int,input().split())\ndef MF(): return map(float, input().split())\ndef MI_(): return map(INT_,input().split())\ndef LI(): return list(MI())\ndef LI_(): return [int(x) - 1 for x in input().split()]\ndef LF(): return list(MF())\ndef LIN(n:int): return [input() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\ndef LLIN_(n: int): return [LI_() for _ in range(n)]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef I(): return int(input())\ndef F(): return float(input())\ndef ST(): return input().replace('\\n', '')\ndef main(): # (3): main=\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n zero_one_deque = deque([1])\n node = [inf] * K\n node[1]=1\n for i in range(K+1):\n tmp = deque()\n while zero_one_deque:\n from_ = zero_one_deque.popleft()\n for i, to in enumerate(edge[from_]):\n if node[to] != inf:\n continue\n node[to] = node[from_]\n if i == 0:\n tmp.appendleft(to)\n else: \n node[to] += 1\n tmp.append(to)\n zero_one_deque = tmp\n print(node[0])\n \n\n \n \nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " \n \n \n \n \n \n \n \n \n \n \n import sys\n input=sys.stdin.readline\n inf=float('inf')\n mod = 10**9+7\n def INT_(n): return int(n)-1\n def MI(): return map(int,input().split())\n def MF(): return map(float, input().split())\n def MI_(): return map(INT_,input().split())\n def LI(): return list(MI())\n def LI_(): return [int(x) - 1 for x in input().split()]\n def LF(): return list(MF())\n def LIN(n:int): return [input() for _ in range(n)]\n def LLIN(n: int): return [LI() for _ in range(n)]\n def LLIN_(n: int): return [LI_() for _ in range(n)]\n def LLI(): return [list(map(int, l.split() )) for l in input()]\n def I(): return int(input())\n def F(): return float(input())\n def ST(): return input().replace('\\n', '')\n def main():\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n- zero_one_deque = deque([1])\n+ zero_one_deque = deque([(1, 1)])\n node = [inf] * K\n- node[1]=1\n- for i in range(K+1):\n- tmp = deque()\n- while zero_one_deque:\n- from_ = zero_one_deque.popleft()\n- for i, to in enumerate(edge[from_]):\n- if node[to] != inf:\n- continue\n- node[to] = node[from_]\n- if i == 0:\n- tmp.appendleft(to)\n- else: \n- node[to] += 1\n- tmp.append(to)\n- zero_one_deque = tmp\n+ \n+ node[1] = 1\n+ searched = set()\n+ while zero_one_deque:\n+ from_ , digit_sum = zero_one_deque.popleft()\n+ if from_ in searched:\n+ continue\n+ else:\n+ searched.add(from_)\n+ node[from_] = digit_sum\n+ \n+ for i, to in enumerate(edge[from_]):\n+ if i == 0:\n+ zero_one_deque.appendleft((to,node[from_]))\n+ else: \n+ zero_one_deque.append((to, node[from_] + 1))\n print(node[0])\n \n \n- \n- \n if __name__ == '__main__':\n main()\n", "FL_content": " \n \n \n \n \n \n \n \n \n \n \n import sys\n input=sys.stdin.readline\n inf=float('inf')\n mod = 10**9+7\n def INT_(n): return int(n)-1\n def MI(): return map(int,input().split())\n def MF(): return map(float, input().split())\n def MI_(): return map(INT_,input().split())\n def LI(): return list(MI())\n def LI_(): return [int(x) - 1 for x in input().split()]\n def LF(): return list(MF())\n def LIN(n:int): return [input() for _ in range(n)]\n def LLIN(n: int): return [LI() for _ in range(n)]\n def LLIN_(n: int): return [LI_() for _ in range(n)]\n def LLI(): return [list(map(int, l.split() )) for l in input()]\n def I(): return int(input())\n def F(): return float(input())\n def ST(): return input().replace('\\n', '')\n def main():\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n- zero_one_deque = deque([1])\n node = [inf] * K\n- node[1]=1\n- for i in range(K+1):\n- tmp = deque()\n- while zero_one_deque:\n- from_ = zero_one_deque.popleft()\n- for i, to in enumerate(edge[from_]):\n- if node[to] != inf:\n- continue\n- node[to] = node[from_]\n- if i == 0:\n- tmp.appendleft(to)\n- else: \n- node[to] += 1\n- tmp.append(to)\n- zero_one_deque = tmp\n print(node[0])\n \n \n- \n- \n if __name__ == '__main__':\n main()\n", "added_lines": 17, "removed_lines": 18, "code1_lines": 61 }, { "user_id": "u707500405", "problem_id": "p03558", "submission1_id": "s940392819", "submission2_id": "s226148919", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\nK = int(input())\nE = [[((i + 1) % K, 1)] for i in range(K)]\nfor i in range(1, K):\n\tE[i].append((i * 10 % K, 0))\nQ = deque([(1, 1)])\nreached = set([1])\nwhile 1:\n\ttmp_node, tmp_cost = Q.popleft()\n\tif tmp_node == 0:\n\t\tans = tmp_cost\n\t\tbreak\n\tfor nxt, dist in E[tmp_node]:\n\t\tif nxt in reached:\n\t\t\tcontinue\n\t\treached.add(nxt)\n\t\tif dist == 0:\n\t\t\tQ.appendleft((nxt, tmp_cost))\n\t\telse:\n\t\t\tQ.append((nxt, tmp_cost + 1))\nprint(ans)\n", "code2": "from collections import deque\nK = int(input())\nE = [[((i + 1) % K, 1)] for i in range(K)]\nfor i in range(1, K):\n\tE[i].append((i * 10 % K, 0))\nQ = deque([(1, 1)])\nreached = set()\nwhile 1:\n\ttmp_node, tmp_cost = Q.popleft()\n\tif tmp_node == 0:\n\t\tans = tmp_cost\n\t\tbreak\n\tif tmp_node in reached:\n\t\tcontinue\n\treached.add(tmp_node)\n\tfor nxt, dist in E[tmp_node]:\n\t\tif dist == 0:\n\t\t\tQ.appendleft((nxt, tmp_cost))\n\t\telse:\n\t\t\tQ.append((nxt, tmp_cost + 1))\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1513040611", "date2": "1513041252", "bleu_score": "0.9525329724155279", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 18, "total_score": 22, "input": "3197\n", "actual_output": "4\n", "expected_output": "2\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " from collections import deque\n K = int(input())\n E = [[((i + 1) % K, 1)] for i in range(K)]\n for i in range(1, K):\n \tE[i].append((i * 10 % K, 0))\n Q = deque([(1, 1)])\n-reached = set([1])\n+reached = set()\n while 1:\n \ttmp_node, tmp_cost = Q.popleft()\n \tif tmp_node == 0:\n \t\tans = tmp_cost\n \t\tbreak\n+\tif tmp_node in reached:\n+\t\tcontinue\n+\treached.add(tmp_node)\n \tfor nxt, dist in E[tmp_node]:\n-\t\tif nxt in reached:\n-\t\t\tcontinue\n-\t\treached.add(nxt)\n \t\tif dist == 0:\n \t\t\tQ.appendleft((nxt, tmp_cost))\n \t\telse:\n \t\t\tQ.append((nxt, tmp_cost + 1))\n print(ans)\n \n", "FL_content": " from collections import deque\n K = int(input())\n E = [[((i + 1) % K, 1)] for i in range(K)]\n for i in range(1, K):\n \tE[i].append((i * 10 % K, 0))\n Q = deque([(1, 1)])\n-reached = set([1])\n while 1:\n \ttmp_node, tmp_cost = Q.popleft()\n \tif tmp_node == 0:\n \t\tans = tmp_cost\n \t\tbreak\n \tfor nxt, dist in E[tmp_node]:\n-\t\tif nxt in reached:\n-\t\t\tcontinue\n-\t\treached.add(nxt)\n \t\tif dist == 0:\n \t\t\tQ.appendleft((nxt, tmp_cost))\n \t\telse:\n \t\t\tQ.append((nxt, tmp_cost + 1))\n print(ans)\n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 22 }, { "user_id": "u391731808", "problem_id": "p03558", "submission1_id": "s297066833", "submission2_id": "s370694384", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\nK = int(input())\nV = list(range(K))\nE = [[(i*10)%K,(i+1)%K] for i in range(K)] \ndata = [-1] * (K)\ndata[1] = 1\nq = deque([1])\ni = 1\nwhile i != 0:\n i = q.popleft()\n if data[E[i][0]] == -1:\n q.appendleft(E[i][0])\n data[E[i][0]] = data[i]\n if data[E[i][1]] == -1:\n q.append(E[i][1])\n data[E[i][1]] = data[i]+1\nprint(data[i])", "code2": "from collections import deque\nK = int(input())\nE = [[(i*10)%K,(i+1)%K] for i in range(K)] \nINF = K*10\nV = [INF] * (K)\nV[1] = 1\nq = deque([1])\ni = 1\nwhile q:\n i = q.popleft()\n if V[E[i][0]] > V[i]:\n q.appendleft(E[i][0])\n V[E[i][0]] = V[i]\n if V[E[i][1]] > V[i]+1:\n q.append(E[i][1])\n V[E[i][1]] = V[i]+1\nprint(V[0])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1556847546", "date2": "1556849435", "bleu_score": "0.770101549560838", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 18, "total_score": 22, "input": "551\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["from collections import deque\nK = int(input()) # (0): K=551\nV = list(range(K)) # (1): V=[0, 1, ..., 549, 550]\nE = [[(i*10)%K,(i+1)%K] for i in range(K)] # (2): E\ndata = [-1] * (K) # (3): data=[-1, -1, ..., -1, -1]\ndata[1] = 1 # (4): data=[-1, 1, ..., -1, -1]\nq = deque([1]) # (5): q=deque([215, 206, 103, 470, 66, 193, 290, 281, 272, 498, 489, 223, 314, 305, 277, 503, 53, 512, 455, 133, 124, 89, 380, 545, 536, 383, 446, 43, 344, 437, 524, 408, 60, 366, 336, 342, 15, 333, 402, 330, 527, 256, 171, 441, 476, 254, 245, 228, 219, 519, 173, 298, 491, 482, 77, 268, 178, 26, 412, 138, 161])\ni = 1 # (6): i=1\nwhile i != 0: # (7): NO CHANGE (15): NO CHANGE ... (3025): NO CHANGE\n i = q.popleft() # (8): NO CHANGE (16): i=10 ... (3022): i=0\n if data[E[i][0]] == -1: # (9): NO CHANGE (17): NO CHANGE ... (3023): NO CHANGE\n q.appendleft(E[i][0]) # (10): NO CHANGE (18): NO CHANGE ... (3014): NO CHANGE\n data[E[i][0]] = data[i] # (11): data=[-1, 1, ..., -1, -1] (19): data=[-1, 1, ..., -1, -1] ... (3015): data=[4, 1, ..., 2, 3]\n if data[E[i][1]] == -1: # (12): NO CHANGE (20): NO CHANGE ... (3024): NO CHANGE\n q.append(E[i][1]) # (13): NO CHANGE (21): NO CHANGE ... (2937): NO CHANGE\n data[E[i][1]] = data[i]+1 # (14): data=[-1, 1, ..., -1, -1] (22): data=[-1, 1, ..., -1, -1] ... (2938): data=[4, 1, ..., 2, 3]\nprint(data[i])"], "anno_status": [true], "diff_content": " from collections import deque\n K = int(input())\n-V = list(range(K))\n E = [[(i*10)%K,(i+1)%K] for i in range(K)] \n-data = [-1] * (K)\n-data[1] = 1\n+INF = K*10\n+V = [INF] * (K)\n+V[1] = 1\n q = deque([1])\n i = 1\n-while i != 0:\n+while q:\n i = q.popleft()\n- if data[E[i][0]] == -1:\n+ if V[E[i][0]] > V[i]:\n q.appendleft(E[i][0])\n- data[E[i][0]] = data[i]\n- if data[E[i][1]] == -1:\n+ V[E[i][0]] = V[i]\n+ if V[E[i][1]] > V[i]+1:\n q.append(E[i][1])\n- data[E[i][1]] = data[i]+1\n-print(data[i])\n+ V[E[i][1]] = V[i]+1\n+print(V[0])\n", "FL_content": " from collections import deque\n K = int(input())\n-V = list(range(K))\n E = [[(i*10)%K,(i+1)%K] for i in range(K)] \n-data = [-1] * (K)\n-data[1] = 1\n q = deque([1])\n i = 1\n-while i != 0:\n i = q.popleft()\n- if data[E[i][0]] == -1:\n q.appendleft(E[i][0])\n- data[E[i][0]] = data[i]\n- if data[E[i][1]] == -1:\n q.append(E[i][1])\n- data[E[i][1]] = data[i]+1\n-print(data[i])\n", "added_lines": 9, "removed_lines": 9, "code1_lines": 17 }, { "user_id": "u226155577", "problem_id": "p03558", "submission1_id": "s068607107", "submission2_id": "s100959080", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\nK = int(input())\ndist = {1: 1}\n\ndeq = deque([1])\nwhile deq:\n v = deq.popleft()\n \n w = (10 * v) % K\n if w not in dist:\n dist[w] = dist[v]\n deq.appendleft(w)\n \n w = (v + 1) % K\n if w not in dist:\n dist[w] = dist[v] + 1\n deq.append(w)\nprint(dist[0])\n", "code2": "from collections import deque\nK = int(input())\ndist = {1: 1}\n\ndeq = deque([1])\nwhile deq:\n v = deq.popleft()\n \n w = (10 * v) % K\n if dist[v] < dist.get(w, 10**9):\n dist[w] = dist[v]\n deq.appendleft(w)\n \n w = (v + 1) % K\n if dist[v] + 1 < dist.get(w, 10**9):\n dist[w] = dist[v] + 1\n deq.append(w)\nprint(dist[0])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1517620817", "date2": "1517620985", "bleu_score": "0.8499566458762361", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 18, "total_score": 22, "input": "551\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["from collections import deque\nK = int(input()) # (0): K=551\ndist = {1: 1} # (1): dist={1: 1}\n\ndeq = deque([1]) # (2): deq=deque([])\nwhile deq: # (3): NO CHANGE (13): NO CHANGE ... (4409): NO CHANGE\n v = deq.popleft() # (4): v=1 (14): v=10 ... (4404): v=537\n \n w = (10 * v) % K # (5): w=10 (15): w=100 ... (4405): w=411\n if w not in dist: # (6): NO CHANGE (16): NO CHANGE ... (4406): NO CHANGE\n dist[w] = dist[v] # (7): dist={1: 1, 10: 1} (17): dist={1: 1, 10: 1, 2: 2, 100: 1} ... (4285): dist={1: 1, 10: 1, 2: 2, 100: 1, 11: 2, 449: 1, 101: 2, 82: 1, 450: 2, 269: 1, 83: 2, 486: 1, 270: 2, 452: 1, 487: 2, 112: 1, 453: 2, 18: 1, 113: 2, 180: 1, 19: 2, 147: 1, 181: 2, 368: 1, 148: 2, 374: 1, 369: 2, 434: 1, 375: 2, 483: 1, 435: 2, 422: 1, 484: 2, 363: 1, 423: 2, 324: 1, 364: 2, 485: 1, 325: 2, 442: 1, 12: 1, 443: 2, 120: 1, 13: 2, 98: 1, 121: 2, 429: 1, 99: 2, 433: 1, 430: 2, 473: 1, 322: 1, 474: 2, 465: 1, 323: 2, 242: 1, 466: 2, 216: 1, 243: 2, 507: 1, 217: 2, 111: 1, 508: 2, 8: 1, 80: 1, 9: 2, 249: 1, 81: 2, 286: 1, 250: 2, 105: 1, 287: 2, 499: 1, 106: 2, 31: 1, 500: 2, 310: 1, 32: 2, 345: 1, 311: 2, 144: 1, 346: 2, 338: 1, 145: 2, 74: 1, 339: 2, 189: 1, 75: 2, 237: 1, 190: 2, 166: 1, 238: 2, 7: 1, 167: 2, 70: 1, 149: 1, 71: 2, 388: 1, 150: 2, 23: 1, 389: 2, 230: 1, 24: 2, 96: 1, 231: 2, 409: 1, 97: 2, 233: 1, 410: 2, 126: 1, 234: 2, 158: 1, 127: 2, 478: 1, 159: 2, 372: 1, 479: 2, 414: 1, 373: 2, 283: 1, 415: 2, 284: 2, 20: 2, 3: 3, 200: 2, 21: 3, 347: 2, 201: 3, 164: 2, 348: 3, 538: 2, 165: 3, 421: 2, 539: 3, 353: 2, 224: 2, 354: 3, 36: 2, 225: 3, 360: 2, 37: 3, 294: 2, 361: 3, 185: 2, 295: 3, 197: 2, 186: 3, 317: 2, 198: 3, 318: 3, 110: 2, 549: 2, 531: 2, 550: 3, 351: 2, 532: 3, 204: 2, 352: 3, 387: 2, 205: 3, 459: 2, 102: 3, 182: 2, 460: 3, 183: 3, 92: 2, 451: 3, 93: 3, 279: 2, 84: 3, 35: 2, 280: 3, 350: 2, 194: 2, 195: 3, 496: 2, 271: 3, 497: 3, 462: 2, 488: 3, 212: 2, 463: 3, 467: 2, 213: 3, 262: 2, 468: 3, 416: 2, 263: 3, 303: 2, 417: 3, 275: 2, 304: 3, 546: 2, 276: 3, 501: 2, 547: 3, 51: 2, 502: 3, 510: 2, 52: 3, 141: 2, 511: 3, 308: 2, 142: 3, 309: 3, 122: 2, 454: 3, 118: 2, 123: 3, 78: 2, 119: 3, 229: 2, 79: 3, 86: 2, 87: 3, 28: 2, 114: 3, 29: 3, 157: 2, 378: 2, 379: 3, 384: 2, 370: 3, 534: 2, 385: 3, 381: 2, 535: 3, 504: 2, 382: 3, 505: 3, 444: 2, 376: 3, 445: 3, 493: 2, 436: 3, 522: 2, 494: 3, 261: 2, 523: 3, 406: 2, 203: 2, 407: 3, 377: 2, 464: 2, 232: 2, 116: 2, 58: 2, 117: 3, 59: 3, 432: 2, 424: 3, 334: 2, 365: 3, 34: 2, 335: 3, 340: 2, 94: 2, 341: 3, 95: 3, 495: 2, 326: 3, 542: 2, 461: 2, 543: 3, 202: 2, 367: 2, 22: 2, 220: 2, 221: 3, 130: 2, 14: 3, 131: 3, 108: 2, 529: 2, 109: 3, 331: 2, 530: 3, 4: 2, 332: 3, 40: 2, 5: 3, 400: 2, 41: 3, 143: 2, 401: 3, 328: 2, 525: 2, 329: 3, 291: 2, 526: 3, 155: 2, 292: 3, 448: 2, 156: 3, 72: 2, 169: 2, 73: 3, 170: 3, 439: 2, 533: 2, 440: 3, 371: 2, 404: 2, 405: 3, 431: 3, 475: 3, 252: 2, 316: 2, 253: 3, 226: 2, 244: 3, 56: 2, 227: 3, 57: 3, 517: 2, 218: 3, 211: 2, 518: 3, 457: 2, 162: 2, 458: 3, 163: 3, 509: 3, 90: 2, 349: 2, 91: 3, 184: 2, 187: 2, 188: 3, 259: 2, 386: 2, 260: 3, 296: 2, 251: 3, 297: 3, 115: 2, 288: 3, 48: 2, 480: 2, 49: 3, 392: 2, 481: 3, 63: 2, 393: 3, 64: 3, 107: 3, 320: 2, 33: 3, 321: 3, 355: 2, 312: 3, 356: 3, 154: 2, 438: 2, 146: 3, 199: 2, 76: 3, 337: 2, 247: 2, 191: 3, 266: 2, 248: 3, 456: 2, 267: 3, 152: 2, 418: 2, 153: 3, 419: 3, 176: 2, 239: 3, 177: 3, 17: 2, 168: 3, 398: 2, 151: 3, 399: 3, 390: 3, 240: 2, 25: 3, 196: 2, 241: 3, 307: 2, 315: 2, 395: 2, 396: 3, 411: 3, 136: 2, 235: 3, 258: 2, 137: 3, 128: 3, 160: 3, 293: 2, 175: 2, 85: 2, 285: 3, 299: 2, 300: 3, 30: 3, 210: 3, 447: 3, 62: 3, 69: 3, 139: 3, 140: 4, 357: 3, 264: 3, 358: 4, 265: 4, 174: 3, 548: 3, 521: 3, 540: 4, 46: 3, 47: 4, 38: 4, 362: 4, 207: 3, 208: 4, 327: 3, 515: 3, 516: 4, 425: 3, 319: 4, 426: 4, 541: 3, 0: 4, 214: 3, 215: 4, 397: 3, 206: 4, 469: 3, 103: 4, 282: 3, 470: 4, 65: 3, 66: 4, 192: 3, 193: 4, 289: 3, 135: 3, 290: 4, 45: 3, 281: 4, 506: 3, 272: 4, 498: 4, 472: 3, 489: 4, 222: 3, 16: 3, 223: 4, 477: 3, 313: 3, 314: 4, 305: 4, 277: 4, 61: 3, 503: 4, 520: 3, 53: 4, 512: 4, 132: 3, 455: 4, 133: 4, 124: 4, 88: 3, 89: 4, 380: 4, 394: 3, 544: 3, 545: 4, 391: 3, 536: 4, 514: 3, 383: 4, 42: 3, 446: 4, 420: 3, 43: 4, 343: 3, 344: 4, 437: 4, 524: 4, 408: 4, 68: 3, 129: 3, 39: 3, 60: 4, 366: 4, 44: 3, 336: 4, 104: 3, 342: 4, 471: 3, 302: 3, 6: 3, 15: 4, 333: 4, 50: 3, 402: 4, 330: 4, 301: 3, 527: 4, 255: 3, 256: 4, 179: 3, 171: 4, 441: 4, 476: 4, 254: 4, 236: 3, 245: 4, 228: 4, 219: 4, 519: 4, 172: 3, 67: 3, 173: 4, 528: 3, 359: 3, 306: 3, 298: 4, 125: 3, 490: 3, 492: 3, 491: 4, 482: 4, 209: 3, 77: 4, 257: 3, 268: 4, 428: 3, 178: 4, 27: 3, 26: 4, 412: 4, 138: 4, 161: 4, 274: 4, 427: 4, 413: 4, 273: 4, 403: 4, 55: 4, 278: 5, 54: 5, 513: 5, 134: 5, 537: 5, 246: 4}\n deq.appendleft(w) # (8): NO CHANGE (18): NO CHANGE ... (4286): NO CHANGE\n \n w = (v + 1) % K # (9): w=2 (19): w=11 ... (4407): w=538\n if w not in dist: # (10): NO CHANGE (20): NO CHANGE ... (4408): NO CHANGE\n dist[w] = dist[v] + 1 # (11): dist={1: 1, 10: 1, 2: 2} (21): dist={1: 1, 10: 1, 2: 2, 100: 1, 11: 2} ... (4153): dist={1: 1, 10: 1, 2: 2, 100: 1, 11: 2, 449: 1, 101: 2, 82: 1, 450: 2, 269: 1, 83: 2, 486: 1, 270: 2, 452: 1, 487: 2, 112: 1, 453: 2, 18: 1, 113: 2, 180: 1, 19: 2, 147: 1, 181: 2, 368: 1, 148: 2, 374: 1, 369: 2, 434: 1, 375: 2, 483: 1, 435: 2, 422: 1, 484: 2, 363: 1, 423: 2, 324: 1, 364: 2, 485: 1, 325: 2, 442: 1, 12: 1, 443: 2, 120: 1, 13: 2, 98: 1, 121: 2, 429: 1, 99: 2, 433: 1, 430: 2, 473: 1, 322: 1, 474: 2, 465: 1, 323: 2, 242: 1, 466: 2, 216: 1, 243: 2, 507: 1, 217: 2, 111: 1, 508: 2, 8: 1, 80: 1, 9: 2, 249: 1, 81: 2, 286: 1, 250: 2, 105: 1, 287: 2, 499: 1, 106: 2, 31: 1, 500: 2, 310: 1, 32: 2, 345: 1, 311: 2, 144: 1, 346: 2, 338: 1, 145: 2, 74: 1, 339: 2, 189: 1, 75: 2, 237: 1, 190: 2, 166: 1, 238: 2, 7: 1, 167: 2, 70: 1, 149: 1, 71: 2, 388: 1, 150: 2, 23: 1, 389: 2, 230: 1, 24: 2, 96: 1, 231: 2, 409: 1, 97: 2, 233: 1, 410: 2, 126: 1, 234: 2, 158: 1, 127: 2, 478: 1, 159: 2, 372: 1, 479: 2, 414: 1, 373: 2, 283: 1, 415: 2, 284: 2, 20: 2, 3: 3, 200: 2, 21: 3, 347: 2, 201: 3, 164: 2, 348: 3, 538: 2, 165: 3, 421: 2, 539: 3, 353: 2, 224: 2, 354: 3, 36: 2, 225: 3, 360: 2, 37: 3, 294: 2, 361: 3, 185: 2, 295: 3, 197: 2, 186: 3, 317: 2, 198: 3, 318: 3, 110: 2, 549: 2, 531: 2, 550: 3, 351: 2, 532: 3, 204: 2, 352: 3, 387: 2, 205: 3, 459: 2, 102: 3, 182: 2, 460: 3, 183: 3, 92: 2, 451: 3, 93: 3, 279: 2, 84: 3, 35: 2, 280: 3, 350: 2, 194: 2, 195: 3, 496: 2, 271: 3, 497: 3, 462: 2, 488: 3, 212: 2, 463: 3, 467: 2, 213: 3, 262: 2, 468: 3, 416: 2, 263: 3, 303: 2, 417: 3, 275: 2, 304: 3, 546: 2, 276: 3, 501: 2, 547: 3, 51: 2, 502: 3, 510: 2, 52: 3, 141: 2, 511: 3, 308: 2, 142: 3, 309: 3, 122: 2, 454: 3, 118: 2, 123: 3, 78: 2, 119: 3, 229: 2, 79: 3, 86: 2, 87: 3, 28: 2, 114: 3, 29: 3, 157: 2, 378: 2, 379: 3, 384: 2, 370: 3, 534: 2, 385: 3, 381: 2, 535: 3, 504: 2, 382: 3, 505: 3, 444: 2, 376: 3, 445: 3, 493: 2, 436: 3, 522: 2, 494: 3, 261: 2, 523: 3, 406: 2, 203: 2, 407: 3, 377: 2, 464: 2, 232: 2, 116: 2, 58: 2, 117: 3, 59: 3, 432: 2, 424: 3, 334: 2, 365: 3, 34: 2, 335: 3, 340: 2, 94: 2, 341: 3, 95: 3, 495: 2, 326: 3, 542: 2, 461: 2, 543: 3, 202: 2, 367: 2, 22: 2, 220: 2, 221: 3, 130: 2, 14: 3, 131: 3, 108: 2, 529: 2, 109: 3, 331: 2, 530: 3, 4: 2, 332: 3, 40: 2, 5: 3, 400: 2, 41: 3, 143: 2, 401: 3, 328: 2, 525: 2, 329: 3, 291: 2, 526: 3, 155: 2, 292: 3, 448: 2, 156: 3, 72: 2, 169: 2, 73: 3, 170: 3, 439: 2, 533: 2, 440: 3, 371: 2, 404: 2, 405: 3, 431: 3, 475: 3, 252: 2, 316: 2, 253: 3, 226: 2, 244: 3, 56: 2, 227: 3, 57: 3, 517: 2, 218: 3, 211: 2, 518: 3, 457: 2, 162: 2, 458: 3, 163: 3, 509: 3, 90: 2, 349: 2, 91: 3, 184: 2, 187: 2, 188: 3, 259: 2, 386: 2, 260: 3, 296: 2, 251: 3, 297: 3, 115: 2, 288: 3, 48: 2, 480: 2, 49: 3, 392: 2, 481: 3, 63: 2, 393: 3, 64: 3, 107: 3, 320: 2, 33: 3, 321: 3, 355: 2, 312: 3, 356: 3, 154: 2, 438: 2, 146: 3, 199: 2, 76: 3, 337: 2, 247: 2, 191: 3, 266: 2, 248: 3, 456: 2, 267: 3, 152: 2, 418: 2, 153: 3, 419: 3, 176: 2, 239: 3, 177: 3, 17: 2, 168: 3, 398: 2, 151: 3, 399: 3, 390: 3, 240: 2, 25: 3, 196: 2, 241: 3, 307: 2, 315: 2, 395: 2, 396: 3, 411: 3, 136: 2, 235: 3, 258: 2, 137: 3, 128: 3, 160: 3, 293: 2, 175: 2, 85: 2, 285: 3, 299: 2, 300: 3, 30: 3, 210: 3, 447: 3, 62: 3, 69: 3, 139: 3, 140: 4, 357: 3, 264: 3, 358: 4, 265: 4, 174: 3, 548: 3, 521: 3, 540: 4, 46: 3, 47: 4, 38: 4, 362: 4, 207: 3, 208: 4, 327: 3, 515: 3, 516: 4, 425: 3, 319: 4, 426: 4, 541: 3, 0: 4, 214: 3, 215: 4, 397: 3, 206: 4, 469: 3, 103: 4, 282: 3, 470: 4, 65: 3, 66: 4, 192: 3, 193: 4, 289: 3, 135: 3, 290: 4, 45: 3, 281: 4, 506: 3, 272: 4, 498: 4, 472: 3, 489: 4, 222: 3, 16: 3, 223: 4, 477: 3, 313: 3, 314: 4, 305: 4, 277: 4, 61: 3, 503: 4, 520: 3, 53: 4, 512: 4, 132: 3, 455: 4, 133: 4, 124: 4, 88: 3, 89: 4, 380: 4, 394: 3, 544: 3, 545: 4, 391: 3, 536: 4, 514: 3, 383: 4, 42: 3, 446: 4, 420: 3, 43: 4, 343: 3, 344: 4, 437: 4, 524: 4, 408: 4, 68: 3, 129: 3, 39: 3, 60: 4, 366: 4, 44: 3, 336: 4, 104: 3, 342: 4, 471: 3, 302: 3, 6: 3, 15: 4, 333: 4, 50: 3, 402: 4, 330: 4, 301: 3, 527: 4, 255: 3, 256: 4, 179: 3, 171: 4, 441: 4, 476: 4, 254: 4, 236: 3, 245: 4, 228: 4, 219: 4, 519: 4, 172: 3, 67: 3, 173: 4, 528: 3, 359: 3, 306: 3, 298: 4, 125: 3, 490: 3, 492: 3, 491: 4, 482: 4, 209: 3, 77: 4, 257: 3, 268: 4, 428: 3, 178: 4, 27: 3, 26: 4, 412: 4, 138: 4, 161: 4, 274: 4, 427: 4, 413: 4, 273: 4, 403: 4, 55: 4, 278: 5, 54: 5, 513: 5, 134: 5, 537: 5}\n deq.append(w) # (12): NO CHANGE (22): NO CHANGE ... (4154): NO CHANGE\nprint(dist[0])\n"], "anno_status": [false], "diff_content": " from collections import deque\n K = int(input())\n dist = {1: 1}\n \n deq = deque([1])\n while deq:\n v = deq.popleft()\n \n w = (10 * v) % K\n- if w not in dist:\n+ if dist[v] < dist.get(w, 10**9):\n dist[w] = dist[v]\n deq.appendleft(w)\n \n w = (v + 1) % K\n- if w not in dist:\n+ if dist[v] + 1 < dist.get(w, 10**9):\n dist[w] = dist[v] + 1\n deq.append(w)\n print(dist[0])\n-\n", "FL_content": " from collections import deque\n K = int(input())\n dist = {1: 1}\n \n deq = deque([1])\n while deq:\n v = deq.popleft()\n \n w = (10 * v) % K\n- if w not in dist:\n dist[w] = dist[v]\n deq.appendleft(w)\n \n w = (v + 1) % K\n- if w not in dist:\n dist[w] = dist[v] + 1\n deq.append(w)\n print(dist[0])\n-\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 19 }, { "user_id": "u788137651", "problem_id": "p03558", "submission1_id": "s264637381", "submission2_id": "s810790393", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\n\n\n\n\n\n\nimport sys\ninput=sys.stdin.readline\ninf=float('inf')\nmod = 10**9+7\ndef INT_(n): return int(n)-1\ndef MI(): return map(int,input().split())\ndef MF(): return map(float, input().split())\ndef MI_(): return map(INT_,input().split())\ndef LI(): return list(MI())\ndef LI_(): return [int(x) - 1 for x in input().split()]\ndef LF(): return list(MF())\ndef LIN(n:int): return [input() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\ndef LLIN_(n: int): return [LI_() for _ in range(n)]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef I(): return int(input())\ndef F(): return float(input())\ndef ST(): return input().replace('\\n', '')\ndef main():\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n zero_one_deque = deque([1])\n node = [inf] * K\n \n node[1] = 1\n while zero_one_deque:\n from_ = zero_one_deque.popleft()\n for i, to in enumerate(edge[from_]):\n if node[to] != inf:\n continue\n node[to] = node[from_]\n if i == 0:\n zero_one_deque.appendleft(to)\n else: \n node[to] += 1\n zero_one_deque.append(to)\n print(node[0])\n \n\nif __name__ == '__main__':\n main()", "code2": "\n\n\n\n\n\n\n\n\n\n\nimport sys\ninput=sys.stdin.readline\ninf=float('inf')\nmod = 10**9+7\ndef INT_(n): return int(n)-1\ndef MI(): return map(int,input().split())\ndef MF(): return map(float, input().split())\ndef MI_(): return map(INT_,input().split())\ndef LI(): return list(MI())\ndef LI_(): return [int(x) - 1 for x in input().split()]\ndef LF(): return list(MF())\ndef LIN(n:int): return [input() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\ndef LLIN_(n: int): return [LI_() for _ in range(n)]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef I(): return int(input())\ndef F(): return float(input())\ndef ST(): return input().replace('\\n', '')\ndef main():\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n zero_one_deque = deque([(1, 1)])\n node = [inf] * K\n \n node[1] = 1\n searched = set()\n while zero_one_deque:\n from_ , digit_sum = zero_one_deque.popleft()\n if from_ in searched:\n continue\n else:\n searched.add(from_)\n node[from_] = digit_sum\n \n for i, to in enumerate(edge[from_]):\n if i == 0:\n zero_one_deque.appendleft((to,node[from_]))\n else: \n zero_one_deque.append((to, node[from_] + 1))\n print(node[0])\n \n\nif __name__ == '__main__':\n main()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1559593577", "date2": "1559594990", "bleu_score": "0.9126329906890182", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 18, "total_score": 22, "input": "1246\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["\n\n\n\n\n\n\n\n\n\n\nimport sys\ninput=sys.stdin.readline # (0): input=\ninf=float('inf') # (1): inf=inf\nmod = 10**9+7 # (2): mod=1000000007, INT_=, MI=, MF=, MI_=, LI=, LI_=, LF=, LIN=, LLIN=, LLIN_=, LLI=, I=, F=, ST=\ndef INT_(n): return int(n)-1\ndef MI(): return map(int,input().split())\ndef MF(): return map(float, input().split())\ndef MI_(): return map(INT_,input().split())\ndef LI(): return list(MI())\ndef LI_(): return [int(x) - 1 for x in input().split()]\ndef LF(): return list(MF())\ndef LIN(n:int): return [input() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\ndef LLIN_(n: int): return [LI_() for _ in range(n)]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef I(): return int(input())\ndef F(): return float(input())\ndef ST(): return input().replace('\\n', '')\ndef main(): # (3): main=\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n zero_one_deque = deque([1])\n node = [inf] * K\n \n node[1] = 1\n while zero_one_deque:\n from_ = zero_one_deque.popleft()\n for i, to in enumerate(edge[from_]):\n if node[to] != inf:\n continue\n node[to] = node[from_]\n if i == 0:\n zero_one_deque.appendleft(to)\n else: \n node[to] += 1\n zero_one_deque.append(to)\n print(node[0])\n \n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " \n \n \n \n \n \n \n \n \n \n \n import sys\n input=sys.stdin.readline\n inf=float('inf')\n mod = 10**9+7\n def INT_(n): return int(n)-1\n def MI(): return map(int,input().split())\n def MF(): return map(float, input().split())\n def MI_(): return map(INT_,input().split())\n def LI(): return list(MI())\n def LI_(): return [int(x) - 1 for x in input().split()]\n def LF(): return list(MF())\n def LIN(n:int): return [input() for _ in range(n)]\n def LLIN(n: int): return [LI() for _ in range(n)]\n def LLIN_(n: int): return [LI_() for _ in range(n)]\n def LLI(): return [list(map(int, l.split() )) for l in input()]\n def I(): return int(input())\n def F(): return float(input())\n def ST(): return input().replace('\\n', '')\n def main():\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n- zero_one_deque = deque([1])\n+ zero_one_deque = deque([(1, 1)])\n node = [inf] * K\n \n node[1] = 1\n+ searched = set()\n while zero_one_deque:\n- from_ = zero_one_deque.popleft()\n+ from_ , digit_sum = zero_one_deque.popleft()\n+ if from_ in searched:\n+ continue\n+ else:\n+ searched.add(from_)\n+ node[from_] = digit_sum\n+ \n for i, to in enumerate(edge[from_]):\n- if node[to] != inf:\n- continue\n- node[to] = node[from_]\n if i == 0:\n- zero_one_deque.appendleft(to)\n+ zero_one_deque.appendleft((to,node[from_]))\n else: \n- node[to] += 1\n- zero_one_deque.append(to)\n+ zero_one_deque.append((to, node[from_] + 1))\n print(node[0])\n \n \n if __name__ == '__main__':\n main()\n", "FL_content": " \n \n \n \n \n \n \n \n \n \n \n import sys\n input=sys.stdin.readline\n inf=float('inf')\n mod = 10**9+7\n def INT_(n): return int(n)-1\n def MI(): return map(int,input().split())\n def MF(): return map(float, input().split())\n def MI_(): return map(INT_,input().split())\n def LI(): return list(MI())\n def LI_(): return [int(x) - 1 for x in input().split()]\n def LF(): return list(MF())\n def LIN(n:int): return [input() for _ in range(n)]\n def LLIN(n: int): return [LI() for _ in range(n)]\n def LLIN_(n: int): return [LI_() for _ in range(n)]\n def LLI(): return [list(map(int, l.split() )) for l in input()]\n def I(): return int(input())\n def F(): return float(input())\n def ST(): return input().replace('\\n', '')\n def main():\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n- zero_one_deque = deque([1])\n node = [inf] * K\n \n node[1] = 1\n while zero_one_deque:\n- from_ = zero_one_deque.popleft()\n for i, to in enumerate(edge[from_]):\n- if node[to] != inf:\n- continue\n- node[to] = node[from_]\n if i == 0:\n- zero_one_deque.appendleft(to)\n else: \n- node[to] += 1\n- zero_one_deque.append(to)\n print(node[0])\n \n \n if __name__ == '__main__':\n main()\n", "added_lines": 11, "removed_lines": 8, "code1_lines": 57 }, { "user_id": "u905582793", "problem_id": "p03558", "submission1_id": "s270959957", "submission2_id": "s602673233", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\nn = int(input())\nmins = [100 for i in range(n+1)]\nused = [0 for i in range(n+1)]\ndeq = deque()\ndeq.append((1,1))\nwhile deq:\n x,cnt = deq.popleft()\n mins[x] = cnt\n used[x] = 1\n if used[10*x%n] == 0:\n deq.appendleft((10*x%n,cnt))\n if used[(x+1)%n] == 0:\n deq.append(((x+1)%n,cnt+1))\nprint(mins[0])", "code2": "from collections import deque\nn = int(input())\nmins = [1000 for i in range(n+1)]\nused = [0 for i in range(n+1)]\ndeq = deque()\ndeq.append((1,1))\nwhile deq:\n x,cnt = deq.popleft()\n mins[x] = min(mins[x],cnt)\n used[x] = 1\n if used[10*x%n] == 0:\n deq.appendleft((10*x%n,cnt))\n if used[(x+1)%n] == 0:\n deq.append(((x+1)%n,cnt+1))\nprint(mins[0])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580071481", "date2": "1580071704", "bleu_score": "0.9504476805920274", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 21, "total_score": 22, "input": "551\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["from collections import deque\nn = int(input()) # (0): n=551\nmins = [100 for i in range(n+1)] # (1): mins=[100, 100, ..., 100, 100]\nused = [0 for i in range(n+1)] # (2): used=[0, 0, ..., 0, 0]\ndeq = deque() # (3): deq=deque([])\ndeq.append((1,1)) # (4): NO CHANGE\nwhile deq: # (5): NO CHANGE (13): NO CHANGE ... (5779): NO CHANGE\n x,cnt = deq.popleft() # (6): x=1, cnt=1 (14): x=10 ... (5774): x=0, cnt=4\n mins[x] = cnt # (7): mins=[100, 1, ..., 100, 100] (15): mins=[100, 1, ..., 100, 100] ... (5775): mins=[4, 1, ..., 3, 100]\n used[x] = 1 # (8): used=[0, 1, ..., 0, 0] (16): used=[0, 1, ..., 0, 0] ... (5776): NO CHANGE\n if used[10*x%n] == 0: # (9): NO CHANGE (17): NO CHANGE ... (5777): NO CHANGE\n deq.appendleft((10*x%n,cnt)) # (10): NO CHANGE (18): NO CHANGE ... (4192): NO CHANGE\n if used[(x+1)%n] == 0: # (11): NO CHANGE (19): NO CHANGE ... (5778): NO CHANGE\n deq.append(((x+1)%n,cnt+1)) # (12): NO CHANGE (20): NO CHANGE ... (5286): NO CHANGE\nprint(mins[0])"], "anno_status": [true], "diff_content": " from collections import deque\n n = int(input())\n-mins = [100 for i in range(n+1)]\n+mins = [1000 for i in range(n+1)]\n used = [0 for i in range(n+1)]\n deq = deque()\n deq.append((1,1))\n while deq:\n x,cnt = deq.popleft()\n- mins[x] = cnt\n+ mins[x] = min(mins[x],cnt)\n used[x] = 1\n if used[10*x%n] == 0:\n deq.appendleft((10*x%n,cnt))\n if used[(x+1)%n] == 0:\n deq.append(((x+1)%n,cnt+1))\n print(mins[0])\n", "FL_content": " from collections import deque\n n = int(input())\n-mins = [100 for i in range(n+1)]\n used = [0 for i in range(n+1)]\n deq = deque()\n deq.append((1,1))\n while deq:\n x,cnt = deq.popleft()\n- mins[x] = cnt\n used[x] = 1\n if used[10*x%n] == 0:\n deq.appendleft((10*x%n,cnt))\n if used[(x+1)%n] == 0:\n deq.append(((x+1)%n,cnt+1))\n print(mins[0])\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 15 }, { "user_id": "u744021017", "problem_id": "p03558", "submission1_id": "s648988676", "submission2_id": "s853431842", "status1": "Wrong Answer", "status2": "Accepted", "code1": "K = int(input())\n\nL = {i: -1 for i in range(K)}\nL[1] = 1\nbiq = [1]\n\nwhile len(biq) > 0:\n i = biq.pop(0)\n j = (i * 10) % K\n if L[j] < 0:\n L[j] = L[i]\n biq.insert(0, j)\n k = 0 if i == K - 1 else i + 1\n if L[k] < 0:\n L[k] = L[i] + 1\n biq.insert(-1, k)\n\nprint(L[0])\n", "code2": "from collections import deque\nK = int(input())\n\nL = {i: 10**6 for i in range(K)}\nL[1] = 1\nbiq = deque()\nbiq.append(1)\n\nwhile len(biq) > 0:\n i = biq.popleft()\n if i == 0:\n break\n j = (i * 10) % K\n if L[j] > L[i]:\n L[j] = L[i]\n biq.appendleft(j)\n k = 0 if i == K - 1 else i + 1\n if L[k] > L[i]:\n L[k] = L[i] + 1\n biq.append(k)\n\nprint(L[0])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1513745469", "date2": "1513746020", "bleu_score": "0.6853635742056177", "code1_test_status": [1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 10, "total_score": 22, "input": "9736\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": "+from collections import deque\n K = int(input())\n \n-L = {i: -1 for i in range(K)}\n+L = {i: 10**6 for i in range(K)}\n L[1] = 1\n-biq = [1]\n+biq = deque()\n+biq.append(1)\n \n while len(biq) > 0:\n- i = biq.pop(0)\n+ i = biq.popleft()\n+ if i == 0:\n+ break\n j = (i * 10) % K\n- if L[j] < 0:\n+ if L[j] > L[i]:\n L[j] = L[i]\n- biq.insert(0, j)\n+ biq.appendleft(j)\n k = 0 if i == K - 1 else i + 1\n- if L[k] < 0:\n+ if L[k] > L[i]:\n L[k] = L[i] + 1\n- biq.insert(-1, k)\n+ biq.append(k)\n \n print(L[0])\n \n", "FL_content": " K = int(input())\n \n-L = {i: -1 for i in range(K)}\n L[1] = 1\n-biq = [1]\n \n while len(biq) > 0:\n- i = biq.pop(0)\n j = (i * 10) % K\n- if L[j] < 0:\n L[j] = L[i]\n- biq.insert(0, j)\n k = 0 if i == K - 1 else i + 1\n- if L[k] < 0:\n L[k] = L[i] + 1\n- biq.insert(-1, k)\n \n print(L[0])\n \n", "added_lines": 11, "removed_lines": 7, "code1_lines": 19 }, { "user_id": "u451017206", "problem_id": "p03558", "submission1_id": "s435962410", "submission2_id": "s840033726", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict, deque\n\nINF = float('inf')\nK = int(input())\nG = defaultdict(list)\n\nfor v in range(K):\n G[v].append((0, (v * 10) % K))\n G[v].append((1, (v + 1) % K))\n\ndef zero_one_bfs_shortest_path(s):\n d = [INF] * K\n d[s] = 0\n dq = deque()\n dq.appendleft(s)\n while len(dq) != 0:\n u = dq.popleft()\n for w, v in G[u]:\n if d[v] != INF:continue\n d[v] = d[u] + w\n if w == 0: dq.appendleft(v)\n else: dq.append(v)\n return d\n\nprint(zero_one_bfs_shortest_path(1)[0] + 1)", "code2": "from collections import defaultdict, deque\n\nINF = float('inf')\nK = int(input())\n\ndef zero_one_bfs_shortest_path(s, K):\n G = defaultdict(list)\n for v in range(K):\n G[v].append((0, (v * 10) % K))\n G[v].append((1, (v + 1) % K))\n d = [INF] * K\n d[s] = 0\n dq = deque()\n dq.appendleft(s)\n while len(dq) != 0:\n u = dq.popleft()\n for w, v in G[u]:\n if d[v] > d[u] + w:\n d[v] = d[u] + w\n if w == 0: dq.appendleft(v)\n else: dq.append(v)\n return d\n\nprint(zero_one_bfs_shortest_path(1, K)[0] + 1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1510111529", "date2": "1510114602", "bleu_score": "0.9122696541016028", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 18, "total_score": 22, "input": "379\n", "actual_output": "5\n", "expected_output": "2\n\n", "anno_code": ["from collections import defaultdict, deque\n\nINF = float('inf') # (0): INF=inf\nK = int(input()) # (1): K=379\nG = defaultdict(list) # (2): G=defaultdict(, {})\n\nfor v in range(K): # (3): v=0 (6): v=1 ... (1140): NO CHANGE\n G[v].append((0, (v * 10) % K)) # (4): G=defaultdict(, {0: [(0, 0)]}) (7): G=defaultdict(, {0: [(0, 0), (1, 1)], 1: [(0, 10)]}) ... (1138): G=defaultdict(, {0: [(0, 0), (1, 1)], 1: [(0, 10), (1, 2)], 2: [(0, 20), (1, 3)], 3: [(0, 30), (1, 4)], 4: [(0, 40), (1, 5)], 5: [(0, 50), (1, 6)], 6: [(0, 60), (1, 7)], 7: [(0, 70), (1, 8)], 8: [(0, 80), (1, 9)], 9: [(0, 90), (1, 10)], 10: [(0, 100), (1, 11)], 11: [(0, 110), (1, 12)], 12: [(0, 120), (1, 13)], 13: [(0, 130), (1, 14)], 14: [(0, 140), (1, 15)], 15: [(0, 150), (1, 16)], 16: [(0, 160), (1, 17)], 17: [(0, 170), (1, 18)], 18: [(0, 180), (1, 19)], 19: [(0, 190), (1, 20)], 20: [(0, 200), (1, 21)], 21: [(0, 210), (1, 22)], 22: [(0, 220), (1, 23)], 23: [(0, 230), (1, 24)], 24: [(0, 240), (1, 25)], 25: [(0, 250), (1, 26)], 26: [(0, 260), (1, 27)], 27: [(0, 270), (1, 28)], 28: [(0, 280), (1, 29)], 29: [(0, 290), (1, 30)], 30: [(0, 300), (1, 31)], 31: [(0, 310), (1, 32)], 32: [(0, 320), (1, 33)], 33: [(0, 330), (1, 34)], 34: [(0, 340), (1, 35)], 35: [(0, 350), (1, 36)], 36: [(0, 360), (1, 37)], 37: [(0, 370), (1, 38)], 38: [(0, 1), (1, 39)], 39: [(0, 11), (1, 40)], 40: [(0, 21), (1, 41)], 41: [(0, 31), (1, 42)], 42: [(0, 41), (1, 43)], 43: [(0, 51), (1, 44)], 44: [(0, 61), (1, 45)], 45: [(0, 71), (1, 46)], 46: [(0, 81), (1, 47)], 47: [(0, 91), (1, 48)], 48: [(0, 101), (1, 49)], 49: [(0, 111), (1, 50)], 50: [(0, 121), (1, 51)], 51: [(0, 131), (1, 52)], 52: [(0, 141), (1, 53)], 53: [(0, 151), (1, 54)], 54: [(0, 161), (1, 55)], 55: [(0, 171), (1, 56)], 56: [(0, 181), (1, 57)], 57: [(0, 191), (1, 58)], 58: [(0, 201), (1, 59)], 59: [(0, 211), (1, 60)], 60: [(0, 221), (1, 61)], 61: [(0, 231), (1, 62)], 62: [(0, 241), (1, 63)], 63: [(0, 251), (1, 64)], 64: [(0, 261), (1, 65)], 65: [(0, 271), (1, 66)], 66: [(0, 281), (1, 67)], 67: [(0, 291), (1, 68)], 68: [(0, 301), (1, 69)], 69: [(0, 311), (1, 70)], 70: [(0, 321), (1, 71)], 71: [(0, 331), (1, 72)], 72: [(0, 341), (1, 73)], 73: [(0, 351), (1, 74)], 74: [(0, 361), (1, 75)], 75: [(0, 371), (1, 76)], 76: [(0, 2), (1, 77)], 77: [(0, 12), (1, 78)], 78: [(0, 22), (1, 79)], 79: [(0, 32), (1, 80)], 80: [(0, 42), (1, 81)], 81: [(0, 52), (1, 82)], 82: [(0, 62), (1, 83)], 83: [(0, 72), (1, 84)], 84: [(0, 82), (1, 85)], 85: [(0, 92), (1, 86)], 86: [(0, 102), (1, 87)], 87: [(0, 112), (1, 88)], 88: [(0, 122), (1, 89)], 89: [(0, 132), (1, 90)], 90: [(0, 142), (1, 91)], 91: [(0, 152), (1, 92)], 92: [(0, 162), (1, 93)], 93: [(0, 172), (1, 94)], 94: [(0, 182), (1, 95)], 95: [(0, 192), (1, 96)], 96: [(0, 202), (1, 97)], 97: [(0, 212), (1, 98)], 98: [(0, 222), (1, 99)], 99: [(0, 232), (1, 100)], 100: [(0, 242), (1, 101)], 101: [(0, 252), (1, 102)], 102: [(0, 262), (1, 103)], 103: [(0, 272), (1, 104)], 104: [(0, 282), (1, 105)], 105: [(0, 292), (1, 106)], 106: [(0, 302), (1, 107)], 107: [(0, 312), (1, 108)], 108: [(0, 322), (1, 109)], 109: [(0, 332), (1, 110)], 110: [(0, 342), (1, 111)], 111: [(0, 352), (1, 112)], 112: [(0, 362), (1, 113)], 113: [(0, 372), (1, 114)], 114: [(0, 3), (1, 115)], 115: [(0, 13), (1, 116)], 116: [(0, 23), (1, 117)], 117: [(0, 33), (1, 118)], 118: [(0, 43), (1, 119)], 119: [(0, 53), (1, 120)], 120: [(0, 63), (1, 121)], 121: [(0, 73), (1, 122)], 122: [(0, 83), (1, 123)], 123: [(0, 93), (1, 124)], 124: [(0, 103), (1, 125)], 125: [(0, 113), (1, 126)], 126: [(0, 123), (1, 127)], 127: [(0, 133), (1, 128)], 128: [(0, 143), (1, 129)], 129: [(0, 153), (1, 130)], 130: [(0, 163), (1, 131)], 131: [(0, 173), (1, 132)], 132: [(0, 183), (1, 133)], 133: [(0, 193), (1, 134)], 134: [(0, 203), (1, 135)], 135: [(0, 213), (1, 136)], 136: [(0, 223), (1, 137)], 137: [(0, 233), (1, 138)], 138: [(0, 243), (1, 139)], 139: [(0, 253), (1, 140)], 140: [(0, 263), (1, 141)], 141: [(0, 273), (1, 142)], 142: [(0, 283), (1, 143)], 143: [(0, 293), (1, 144)], 144: [(0, 303), (1, 145)], 145: [(0, 313), (1, 146)], 146: [(0, 323), (1, 147)], 147: [(0, 333), (1, 148)], 148: [(0, 343), (1, 149)], 149: [(0, 353), (1, 150)], 150: [(0, 363), (1, 151)], 151: [(0, 373), (1, 152)], 152: [(0, 4), (1, 153)], 153: [(0, 14), (1, 154)], 154: [(0, 24), (1, 155)], 155: [(0, 34), (1, 156)], 156: [(0, 44), (1, 157)], 157: [(0, 54), (1, 158)], 158: [(0, 64), (1, 159)], 159: [(0, 74), (1, 160)], 160: [(0, 84), (1, 161)], 161: [(0, 94), (1, 162)], 162: [(0, 104), (1, 163)], 163: [(0, 114), (1, 164)], 164: [(0, 124), (1, 165)], 165: [(0, 134), (1, 166)], 166: [(0, 144), (1, 167)], 167: [(0, 154), (1, 168)], 168: [(0, 164), (1, 169)], 169: [(0, 174), (1, 170)], 170: [(0, 184), (1, 171)], 171: [(0, 194), (1, 172)], 172: [(0, 204), (1, 173)], 173: [(0, 214), (1, 174)], 174: [(0, 224), (1, 175)], 175: [(0, 234), (1, 176)], 176: [(0, 244), (1, 177)], 177: [(0, 254), (1, 178)], 178: [(0, 264), (1, 179)], 179: [(0, 274), (1, 180)], 180: [(0, 284), (1, 181)], 181: [(0, 294), (1, 182)], 182: [(0, 304), (1, 183)], 183: [(0, 314), (1, 184)], 184: [(0, 324), (1, 185)], 185: [(0, 334), (1, 186)], 186: [(0, 344), (1, 187)], 187: [(0, 354), (1, 188)], 188: [(0, 364), (1, 189)], 189: [(0, 374), (1, 190)], 190: [(0, 5), (1, 191)], 191: [(0, 15), (1, 192)], 192: [(0, 25), (1, 193)], 193: [(0, 35), (1, 194)], 194: [(0, 45), (1, 195)], 195: [(0, 55), (1, 196)], 196: [(0, 65), (1, 197)], 197: [(0, 75), (1, 198)], 198: [(0, 85), (1, 199)], 199: [(0, 95), (1, 200)], 200: [(0, 105), (1, 201)], 201: [(0, 115), (1, 202)], 202: [(0, 125), (1, 203)], 203: [(0, 135), (1, 204)], 204: [(0, 145), (1, 205)], 205: [(0, 155), (1, 206)], 206: [(0, 165), (1, 207)], 207: [(0, 175), (1, 208)], 208: [(0, 185), (1, 209)], 209: [(0, 195), (1, 210)], 210: [(0, 205), (1, 211)], 211: [(0, 215), (1, 212)], 212: [(0, 225), (1, 213)], 213: [(0, 235), (1, 214)], 214: [(0, 245), (1, 215)], 215: [(0, 255), (1, 216)], 216: [(0, 265), (1, 217)], 217: [(0, 275), (1, 218)], 218: [(0, 285), (1, 219)], 219: [(0, 295), (1, 220)], 220: [(0, 305), (1, 221)], 221: [(0, 315), (1, 222)], 222: [(0, 325), (1, 223)], 223: [(0, 335), (1, 224)], 224: [(0, 345), (1, 225)], 225: [(0, 355), (1, 226)], 226: [(0, 365), (1, 227)], 227: [(0, 375), (1, 228)], 228: [(0, 6), (1, 229)], 229: [(0, 16), (1, 230)], 230: [(0, 26), (1, 231)], 231: [(0, 36), (1, 232)], 232: [(0, 46), (1, 233)], 233: [(0, 56), (1, 234)], 234: [(0, 66), (1, 235)], 235: [(0, 76), (1, 236)], 236: [(0, 86), (1, 237)], 237: [(0, 96), (1, 238)], 238: [(0, 106), (1, 239)], 239: [(0, 116), (1, 240)], 240: [(0, 126), (1, 241)], 241: [(0, 136), (1, 242)], 242: [(0, 146), (1, 243)], 243: [(0, 156), (1, 244)], 244: [(0, 166), (1, 245)], 245: [(0, 176), (1, 246)], 246: [(0, 186), (1, 247)], 247: [(0, 196), (1, 248)], 248: [(0, 206), (1, 249)], 249: [(0, 216), (1, 250)], 250: [(0, 226), (1, 251)], 251: [(0, 236), (1, 252)], 252: [(0, 246), (1, 253)], 253: [(0, 256), (1, 254)], 254: [(0, 266), (1, 255)], 255: [(0, 276), (1, 256)], 256: [(0, 286), (1, 257)], 257: [(0, 296), (1, 258)], 258: [(0, 306), (1, 259)], 259: [(0, 316), (1, 260)], 260: [(0, 326), (1, 261)], 261: [(0, 336), (1, 262)], 262: [(0, 346), (1, 263)], 263: [(0, 356), (1, 264)], 264: [(0, 366), (1, 265)], 265: [(0, 376), (1, 266)], 266: [(0, 7), (1, 267)], 267: [(0, 17), (1, 268)], 268: [(0, 27), (1, 269)], 269: [(0, 37), (1, 270)], 270: [(0, 47), (1, 271)], 271: [(0, 57), (1, 272)], 272: [(0, 67), (1, 273)], 273: [(0, 77), (1, 274)], 274: [(0, 87), (1, 275)], 275: [(0, 97), (1, 276)], 276: [(0, 107), (1, 277)], 277: [(0, 117), (1, 278)], 278: [(0, 127), (1, 279)], 279: [(0, 137), (1, 280)], 280: [(0, 147), (1, 281)], 281: [(0, 157), (1, 282)], 282: [(0, 167), (1, 283)], 283: [(0, 177), (1, 284)], 284: [(0, 187), (1, 285)], 285: [(0, 197), (1, 286)], 286: [(0, 207), (1, 287)], 287: [(0, 217), (1, 288)], 288: [(0, 227), (1, 289)], 289: [(0, 237), (1, 290)], 290: [(0, 247), (1, 291)], 291: [(0, 257), (1, 292)], 292: [(0, 267), (1, 293)], 293: [(0, 277), (1, 294)], 294: [(0, 287), (1, 295)], 295: [(0, 297), (1, 296)], 296: [(0, 307), (1, 297)], 297: [(0, 317), (1, 298)], 298: [(0, 327), (1, 299)], 299: [(0, 337), (1, 300)], 300: [(0, 347), (1, 301)], 301: [(0, 357), (1, 302)], 302: [(0, 367), (1, 303)], 303: [(0, 377), (1, 304)], 304: [(0, 8), (1, 305)], 305: [(0, 18), (1, 306)], 306: [(0, 28), (1, 307)], 307: [(0, 38), (1, 308)], 308: [(0, 48), (1, 309)], 309: [(0, 58), (1, 310)], 310: [(0, 68), (1, 311)], 311: [(0, 78), (1, 312)], 312: [(0, 88), (1, 313)], 313: [(0, 98), (1, 314)], 314: [(0, 108), (1, 315)], 315: [(0, 118), (1, 316)], 316: [(0, 128), (1, 317)], 317: [(0, 138), (1, 318)], 318: [(0, 148), (1, 319)], 319: [(0, 158), (1, 320)], 320: [(0, 168), (1, 321)], 321: [(0, 178), (1, 322)], 322: [(0, 188), (1, 323)], 323: [(0, 198), (1, 324)], 324: [(0, 208), (1, 325)], 325: [(0, 218), (1, 326)], 326: [(0, 228), (1, 327)], 327: [(0, 238), (1, 328)], 328: [(0, 248), (1, 329)], 329: [(0, 258), (1, 330)], 330: [(0, 268), (1, 331)], 331: [(0, 278), (1, 332)], 332: [(0, 288), (1, 333)], 333: [(0, 298), (1, 334)], 334: [(0, 308), (1, 335)], 335: [(0, 318), (1, 336)], 336: [(0, 328), (1, 337)], 337: [(0, 338), (1, 338)], 338: [(0, 348), (1, 339)], 339: [(0, 358), (1, 340)], 340: [(0, 368), (1, 341)], 341: [(0, 378), (1, 342)], 342: [(0, 9), (1, 343)], 343: [(0, 19), (1, 344)], 344: [(0, 29), (1, 345)], 345: [(0, 39), (1, 346)], 346: [(0, 49), (1, 347)], 347: [(0, 59), (1, 348)], 348: [(0, 69), (1, 349)], 349: [(0, 79), (1, 350)], 350: [(0, 89), (1, 351)], 351: [(0, 99), (1, 352)], 352: [(0, 109), (1, 353)], 353: [(0, 119), (1, 354)], 354: [(0, 129), (1, 355)], 355: [(0, 139), (1, 356)], 356: [(0, 149), (1, 357)], 357: [(0, 159), (1, 358)], 358: [(0, 169), (1, 359)], 359: [(0, 179), (1, 360)], 360: [(0, 189), (1, 361)], 361: [(0, 199), (1, 362)], 362: [(0, 209), (1, 363)], 363: [(0, 219), (1, 364)], 364: [(0, 229), (1, 365)], 365: [(0, 239), (1, 366)], 366: [(0, 249), (1, 367)], 367: [(0, 259), (1, 368)], 368: [(0, 269), (1, 369)], 369: [(0, 279), (1, 370)], 370: [(0, 289), (1, 371)], 371: [(0, 299), (1, 372)], 372: [(0, 309), (1, 373)], 373: [(0, 319), (1, 374)], 374: [(0, 329), (1, 375)], 375: [(0, 339), (1, 376)], 376: [(0, 349), (1, 377)], 377: [(0, 359), (1, 378)], 378: [(0, 369)]})\n G[v].append((1, (v + 1) % K)) # (5): G=defaultdict(, {0: [(0, 0), (1, 1)]}) (8): G=defaultdict(, {0: [(0, 0), (1, 1)], 1: [(0, 10), (1, 2)]}) ... (1139): G=defaultdict(, {0: [(0, 0), (1, 1)], 1: [(0, 10), (1, 2)], 2: [(0, 20), (1, 3)], 3: [(0, 30), (1, 4)], 4: [(0, 40), (1, 5)], 5: [(0, 50), (1, 6)], 6: [(0, 60), (1, 7)], 7: [(0, 70), (1, 8)], 8: [(0, 80), (1, 9)], 9: [(0, 90), (1, 10)], 10: [(0, 100), (1, 11)], 11: [(0, 110), (1, 12)], 12: [(0, 120), (1, 13)], 13: [(0, 130), (1, 14)], 14: [(0, 140), (1, 15)], 15: [(0, 150), (1, 16)], 16: [(0, 160), (1, 17)], 17: [(0, 170), (1, 18)], 18: [(0, 180), (1, 19)], 19: [(0, 190), (1, 20)], 20: [(0, 200), (1, 21)], 21: [(0, 210), (1, 22)], 22: [(0, 220), (1, 23)], 23: [(0, 230), (1, 24)], 24: [(0, 240), (1, 25)], 25: [(0, 250), (1, 26)], 26: [(0, 260), (1, 27)], 27: [(0, 270), (1, 28)], 28: [(0, 280), (1, 29)], 29: [(0, 290), (1, 30)], 30: [(0, 300), (1, 31)], 31: [(0, 310), (1, 32)], 32: [(0, 320), (1, 33)], 33: [(0, 330), (1, 34)], 34: [(0, 340), (1, 35)], 35: [(0, 350), (1, 36)], 36: [(0, 360), (1, 37)], 37: [(0, 370), (1, 38)], 38: [(0, 1), (1, 39)], 39: [(0, 11), (1, 40)], 40: [(0, 21), (1, 41)], 41: [(0, 31), (1, 42)], 42: [(0, 41), (1, 43)], 43: [(0, 51), (1, 44)], 44: [(0, 61), (1, 45)], 45: [(0, 71), (1, 46)], 46: [(0, 81), (1, 47)], 47: [(0, 91), (1, 48)], 48: [(0, 101), (1, 49)], 49: [(0, 111), (1, 50)], 50: [(0, 121), (1, 51)], 51: [(0, 131), (1, 52)], 52: [(0, 141), (1, 53)], 53: [(0, 151), (1, 54)], 54: [(0, 161), (1, 55)], 55: [(0, 171), (1, 56)], 56: [(0, 181), (1, 57)], 57: [(0, 191), (1, 58)], 58: [(0, 201), (1, 59)], 59: [(0, 211), (1, 60)], 60: [(0, 221), (1, 61)], 61: [(0, 231), (1, 62)], 62: [(0, 241), (1, 63)], 63: [(0, 251), (1, 64)], 64: [(0, 261), (1, 65)], 65: [(0, 271), (1, 66)], 66: [(0, 281), (1, 67)], 67: [(0, 291), (1, 68)], 68: [(0, 301), (1, 69)], 69: [(0, 311), (1, 70)], 70: [(0, 321), (1, 71)], 71: [(0, 331), (1, 72)], 72: [(0, 341), (1, 73)], 73: [(0, 351), (1, 74)], 74: [(0, 361), (1, 75)], 75: [(0, 371), (1, 76)], 76: [(0, 2), (1, 77)], 77: [(0, 12), (1, 78)], 78: [(0, 22), (1, 79)], 79: [(0, 32), (1, 80)], 80: [(0, 42), (1, 81)], 81: [(0, 52), (1, 82)], 82: [(0, 62), (1, 83)], 83: [(0, 72), (1, 84)], 84: [(0, 82), (1, 85)], 85: [(0, 92), (1, 86)], 86: [(0, 102), (1, 87)], 87: [(0, 112), (1, 88)], 88: [(0, 122), (1, 89)], 89: [(0, 132), (1, 90)], 90: [(0, 142), (1, 91)], 91: [(0, 152), (1, 92)], 92: [(0, 162), (1, 93)], 93: [(0, 172), (1, 94)], 94: [(0, 182), (1, 95)], 95: [(0, 192), (1, 96)], 96: [(0, 202), (1, 97)], 97: [(0, 212), (1, 98)], 98: [(0, 222), (1, 99)], 99: [(0, 232), (1, 100)], 100: [(0, 242), (1, 101)], 101: [(0, 252), (1, 102)], 102: [(0, 262), (1, 103)], 103: [(0, 272), (1, 104)], 104: [(0, 282), (1, 105)], 105: [(0, 292), (1, 106)], 106: [(0, 302), (1, 107)], 107: [(0, 312), (1, 108)], 108: [(0, 322), (1, 109)], 109: [(0, 332), (1, 110)], 110: [(0, 342), (1, 111)], 111: [(0, 352), (1, 112)], 112: [(0, 362), (1, 113)], 113: [(0, 372), (1, 114)], 114: [(0, 3), (1, 115)], 115: [(0, 13), (1, 116)], 116: [(0, 23), (1, 117)], 117: [(0, 33), (1, 118)], 118: [(0, 43), (1, 119)], 119: [(0, 53), (1, 120)], 120: [(0, 63), (1, 121)], 121: [(0, 73), (1, 122)], 122: [(0, 83), (1, 123)], 123: [(0, 93), (1, 124)], 124: [(0, 103), (1, 125)], 125: [(0, 113), (1, 126)], 126: [(0, 123), (1, 127)], 127: [(0, 133), (1, 128)], 128: [(0, 143), (1, 129)], 129: [(0, 153), (1, 130)], 130: [(0, 163), (1, 131)], 131: [(0, 173), (1, 132)], 132: [(0, 183), (1, 133)], 133: [(0, 193), (1, 134)], 134: [(0, 203), (1, 135)], 135: [(0, 213), (1, 136)], 136: [(0, 223), (1, 137)], 137: [(0, 233), (1, 138)], 138: [(0, 243), (1, 139)], 139: [(0, 253), (1, 140)], 140: [(0, 263), (1, 141)], 141: [(0, 273), (1, 142)], 142: [(0, 283), (1, 143)], 143: [(0, 293), (1, 144)], 144: [(0, 303), (1, 145)], 145: [(0, 313), (1, 146)], 146: [(0, 323), (1, 147)], 147: [(0, 333), (1, 148)], 148: [(0, 343), (1, 149)], 149: [(0, 353), (1, 150)], 150: [(0, 363), (1, 151)], 151: [(0, 373), (1, 152)], 152: [(0, 4), (1, 153)], 153: [(0, 14), (1, 154)], 154: [(0, 24), (1, 155)], 155: [(0, 34), (1, 156)], 156: [(0, 44), (1, 157)], 157: [(0, 54), (1, 158)], 158: [(0, 64), (1, 159)], 159: [(0, 74), (1, 160)], 160: [(0, 84), (1, 161)], 161: [(0, 94), (1, 162)], 162: [(0, 104), (1, 163)], 163: [(0, 114), (1, 164)], 164: [(0, 124), (1, 165)], 165: [(0, 134), (1, 166)], 166: [(0, 144), (1, 167)], 167: [(0, 154), (1, 168)], 168: [(0, 164), (1, 169)], 169: [(0, 174), (1, 170)], 170: [(0, 184), (1, 171)], 171: [(0, 194), (1, 172)], 172: [(0, 204), (1, 173)], 173: [(0, 214), (1, 174)], 174: [(0, 224), (1, 175)], 175: [(0, 234), (1, 176)], 176: [(0, 244), (1, 177)], 177: [(0, 254), (1, 178)], 178: [(0, 264), (1, 179)], 179: [(0, 274), (1, 180)], 180: [(0, 284), (1, 181)], 181: [(0, 294), (1, 182)], 182: [(0, 304), (1, 183)], 183: [(0, 314), (1, 184)], 184: [(0, 324), (1, 185)], 185: [(0, 334), (1, 186)], 186: [(0, 344), (1, 187)], 187: [(0, 354), (1, 188)], 188: [(0, 364), (1, 189)], 189: [(0, 374), (1, 190)], 190: [(0, 5), (1, 191)], 191: [(0, 15), (1, 192)], 192: [(0, 25), (1, 193)], 193: [(0, 35), (1, 194)], 194: [(0, 45), (1, 195)], 195: [(0, 55), (1, 196)], 196: [(0, 65), (1, 197)], 197: [(0, 75), (1, 198)], 198: [(0, 85), (1, 199)], 199: [(0, 95), (1, 200)], 200: [(0, 105), (1, 201)], 201: [(0, 115), (1, 202)], 202: [(0, 125), (1, 203)], 203: [(0, 135), (1, 204)], 204: [(0, 145), (1, 205)], 205: [(0, 155), (1, 206)], 206: [(0, 165), (1, 207)], 207: [(0, 175), (1, 208)], 208: [(0, 185), (1, 209)], 209: [(0, 195), (1, 210)], 210: [(0, 205), (1, 211)], 211: [(0, 215), (1, 212)], 212: [(0, 225), (1, 213)], 213: [(0, 235), (1, 214)], 214: [(0, 245), (1, 215)], 215: [(0, 255), (1, 216)], 216: [(0, 265), (1, 217)], 217: [(0, 275), (1, 218)], 218: [(0, 285), (1, 219)], 219: [(0, 295), (1, 220)], 220: [(0, 305), (1, 221)], 221: [(0, 315), (1, 222)], 222: [(0, 325), (1, 223)], 223: [(0, 335), (1, 224)], 224: [(0, 345), (1, 225)], 225: [(0, 355), (1, 226)], 226: [(0, 365), (1, 227)], 227: [(0, 375), (1, 228)], 228: [(0, 6), (1, 229)], 229: [(0, 16), (1, 230)], 230: [(0, 26), (1, 231)], 231: [(0, 36), (1, 232)], 232: [(0, 46), (1, 233)], 233: [(0, 56), (1, 234)], 234: [(0, 66), (1, 235)], 235: [(0, 76), (1, 236)], 236: [(0, 86), (1, 237)], 237: [(0, 96), (1, 238)], 238: [(0, 106), (1, 239)], 239: [(0, 116), (1, 240)], 240: [(0, 126), (1, 241)], 241: [(0, 136), (1, 242)], 242: [(0, 146), (1, 243)], 243: [(0, 156), (1, 244)], 244: [(0, 166), (1, 245)], 245: [(0, 176), (1, 246)], 246: [(0, 186), (1, 247)], 247: [(0, 196), (1, 248)], 248: [(0, 206), (1, 249)], 249: [(0, 216), (1, 250)], 250: [(0, 226), (1, 251)], 251: [(0, 236), (1, 252)], 252: [(0, 246), (1, 253)], 253: [(0, 256), (1, 254)], 254: [(0, 266), (1, 255)], 255: [(0, 276), (1, 256)], 256: [(0, 286), (1, 257)], 257: [(0, 296), (1, 258)], 258: [(0, 306), (1, 259)], 259: [(0, 316), (1, 260)], 260: [(0, 326), (1, 261)], 261: [(0, 336), (1, 262)], 262: [(0, 346), (1, 263)], 263: [(0, 356), (1, 264)], 264: [(0, 366), (1, 265)], 265: [(0, 376), (1, 266)], 266: [(0, 7), (1, 267)], 267: [(0, 17), (1, 268)], 268: [(0, 27), (1, 269)], 269: [(0, 37), (1, 270)], 270: [(0, 47), (1, 271)], 271: [(0, 57), (1, 272)], 272: [(0, 67), (1, 273)], 273: [(0, 77), (1, 274)], 274: [(0, 87), (1, 275)], 275: [(0, 97), (1, 276)], 276: [(0, 107), (1, 277)], 277: [(0, 117), (1, 278)], 278: [(0, 127), (1, 279)], 279: [(0, 137), (1, 280)], 280: [(0, 147), (1, 281)], 281: [(0, 157), (1, 282)], 282: [(0, 167), (1, 283)], 283: [(0, 177), (1, 284)], 284: [(0, 187), (1, 285)], 285: [(0, 197), (1, 286)], 286: [(0, 207), (1, 287)], 287: [(0, 217), (1, 288)], 288: [(0, 227), (1, 289)], 289: [(0, 237), (1, 290)], 290: [(0, 247), (1, 291)], 291: [(0, 257), (1, 292)], 292: [(0, 267), (1, 293)], 293: [(0, 277), (1, 294)], 294: [(0, 287), (1, 295)], 295: [(0, 297), (1, 296)], 296: [(0, 307), (1, 297)], 297: [(0, 317), (1, 298)], 298: [(0, 327), (1, 299)], 299: [(0, 337), (1, 300)], 300: [(0, 347), (1, 301)], 301: [(0, 357), (1, 302)], 302: [(0, 367), (1, 303)], 303: [(0, 377), (1, 304)], 304: [(0, 8), (1, 305)], 305: [(0, 18), (1, 306)], 306: [(0, 28), (1, 307)], 307: [(0, 38), (1, 308)], 308: [(0, 48), (1, 309)], 309: [(0, 58), (1, 310)], 310: [(0, 68), (1, 311)], 311: [(0, 78), (1, 312)], 312: [(0, 88), (1, 313)], 313: [(0, 98), (1, 314)], 314: [(0, 108), (1, 315)], 315: [(0, 118), (1, 316)], 316: [(0, 128), (1, 317)], 317: [(0, 138), (1, 318)], 318: [(0, 148), (1, 319)], 319: [(0, 158), (1, 320)], 320: [(0, 168), (1, 321)], 321: [(0, 178), (1, 322)], 322: [(0, 188), (1, 323)], 323: [(0, 198), (1, 324)], 324: [(0, 208), (1, 325)], 325: [(0, 218), (1, 326)], 326: [(0, 228), (1, 327)], 327: [(0, 238), (1, 328)], 328: [(0, 248), (1, 329)], 329: [(0, 258), (1, 330)], 330: [(0, 268), (1, 331)], 331: [(0, 278), (1, 332)], 332: [(0, 288), (1, 333)], 333: [(0, 298), (1, 334)], 334: [(0, 308), (1, 335)], 335: [(0, 318), (1, 336)], 336: [(0, 328), (1, 337)], 337: [(0, 338), (1, 338)], 338: [(0, 348), (1, 339)], 339: [(0, 358), (1, 340)], 340: [(0, 368), (1, 341)], 341: [(0, 378), (1, 342)], 342: [(0, 9), (1, 343)], 343: [(0, 19), (1, 344)], 344: [(0, 29), (1, 345)], 345: [(0, 39), (1, 346)], 346: [(0, 49), (1, 347)], 347: [(0, 59), (1, 348)], 348: [(0, 69), (1, 349)], 349: [(0, 79), (1, 350)], 350: [(0, 89), (1, 351)], 351: [(0, 99), (1, 352)], 352: [(0, 109), (1, 353)], 353: [(0, 119), (1, 354)], 354: [(0, 129), (1, 355)], 355: [(0, 139), (1, 356)], 356: [(0, 149), (1, 357)], 357: [(0, 159), (1, 358)], 358: [(0, 169), (1, 359)], 359: [(0, 179), (1, 360)], 360: [(0, 189), (1, 361)], 361: [(0, 199), (1, 362)], 362: [(0, 209), (1, 363)], 363: [(0, 219), (1, 364)], 364: [(0, 229), (1, 365)], 365: [(0, 239), (1, 366)], 366: [(0, 249), (1, 367)], 367: [(0, 259), (1, 368)], 368: [(0, 269), (1, 369)], 369: [(0, 279), (1, 370)], 370: [(0, 289), (1, 371)], 371: [(0, 299), (1, 372)], 372: [(0, 309), (1, 373)], 373: [(0, 319), (1, 374)], 374: [(0, 329), (1, 375)], 375: [(0, 339), (1, 376)], 376: [(0, 349), (1, 377)], 377: [(0, 359), (1, 378)], 378: [(0, 369), (1, 0)]})\n\ndef zero_one_bfs_shortest_path(s): # (1141): zero_one_bfs_shortest_path=\n d = [INF] * K # (1143): d=[inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf]\n d[s] = 0 # (1144): d=[inf, 0, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf]\n dq = deque() # (1145): dq=deque([])\n dq.appendleft(s) # (1146): NO CHANGE\n while len(dq) != 0: # (1147): NO CHANGE (1159): NO CHANGE ... (4746): NO CHANGE\n u = dq.popleft() # (1148): u=1 (1160): u=10 ... (4747): u=320\n for w, v in G[u]: # (1149): w=0, v=10 (1153): w=1, v=2 ... (4752): NO CHANGE\n if d[v] != INF:continue # (1150): NO CHANGE (1154): NO CHANGE ... (4751): NO CHANGE\n d[v] = d[u] + w # (1151): d=[inf, 0, inf, inf, inf, inf, inf, inf, inf, inf, 0, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf] (1155): d=[inf, 0, 1, inf, inf, inf, inf, inf, inf, inf, 0, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf] ... (4679): d=[4, 0, ..., 2, 3]\n if w == 0: dq.appendleft(v) # (1152): NO CHANGE (1156): NO CHANGE ... (4680): NO CHANGE\n else: dq.append(v) # (1157): NO CHANGE (1169): NO CHANGE ... (4681): NO CHANGE\n return d\n\nprint(zero_one_bfs_shortest_path(1)[0] + 1) # (1142): s=1\n"], "anno_status": [false], "diff_content": " from collections import defaultdict, deque\n \n INF = float('inf')\n K = int(input())\n-G = defaultdict(list)\n \n-for v in range(K):\n- G[v].append((0, (v * 10) % K))\n- G[v].append((1, (v + 1) % K))\n-\n-def zero_one_bfs_shortest_path(s):\n+def zero_one_bfs_shortest_path(s, K):\n+ G = defaultdict(list)\n+ for v in range(K):\n+ G[v].append((0, (v * 10) % K))\n+ G[v].append((1, (v + 1) % K))\n d = [INF] * K\n d[s] = 0\n dq = deque()\n dq.appendleft(s)\n while len(dq) != 0:\n u = dq.popleft()\n for w, v in G[u]:\n- if d[v] != INF:continue\n- d[v] = d[u] + w\n- if w == 0: dq.appendleft(v)\n- else: dq.append(v)\n+ if d[v] > d[u] + w:\n+ d[v] = d[u] + w\n+ if w == 0: dq.appendleft(v)\n+ else: dq.append(v)\n return d\n \n-print(zero_one_bfs_shortest_path(1)[0] + 1)\n+print(zero_one_bfs_shortest_path(1, K)[0] + 1)\n", "FL_content": " from collections import defaultdict, deque\n \n INF = float('inf')\n K = int(input())\n-G = defaultdict(list)\n \n-for v in range(K):\n- G[v].append((0, (v * 10) % K))\n- G[v].append((1, (v + 1) % K))\n-\n-def zero_one_bfs_shortest_path(s):\n d = [INF] * K\n d[s] = 0\n dq = deque()\n dq.appendleft(s)\n while len(dq) != 0:\n u = dq.popleft()\n for w, v in G[u]:\n- if d[v] != INF:continue\n- d[v] = d[u] + w\n- if w == 0: dq.appendleft(v)\n- else: dq.append(v)\n return d\n \n-print(zero_one_bfs_shortest_path(1)[0] + 1)\n", "added_lines": 10, "removed_lines": 11, "code1_lines": 25 }, { "user_id": "u052499405", "problem_id": "p02589", "submission1_id": "s515862916", "submission2_id": "s381614935", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\ninput = sys.stdin.readline\n\nclass RollingHash():\n def __init__(self, s):\n length = len(s)\n base = 1009\n self.mod = (1 << 61) - 1\n self.hash = [0] * (length + 2)\n self.pow = [1] * (length + 2)\n\n for i in range(length):\n self.hash[i+1] = (self.hash[i] + s[i]) * base % self.mod\n self.pow[i+1] = self.pow[i] * base % self.mod\n self.pow[length+1] = self.pow[length] * base % self.mod \n\n def get(self, l, r):\n t = self.hash[r] - self.hash[l] * self.pow[r-l] % self.mod\n return t % self.mod\n\nss = []\norda = ord(\"a\")\nn = int(input())\nfor _ in range(n):\n ss.append([ord(item) - orda for item in input().rstrip()])\nss.sort(key=lambda x: len(x), reverse=True)\n\nwords = dict()\nans = 0\nfor s in ss:\n word_len = len(s)\n s_rev = s[::-1]\n RH = RollingHash(s_rev)\n rh = RH.get(0, word_len-1)\n if rh in words:\n ans += words[rh][s_rev[-1]]\n initial = set()\n for i, ch in enumerate(s):\n initial.add(ch)\n for key in initial:\n rh = RH.get(0, word_len-i-1)\n if rh in words:\n words[rh][key] += 1\n else:\n words[rh] = [0] * 26\n words[rh][key] += 1\nprint(ans)", "code2": "\nimport sys\ninput = sys.stdin.readline\nfrom collections import defaultdict\n\ndef empty_list():\n return [0] * 26\n\nclass RollingHash():\n def __init__(self, s):\n length = len(s)\n base = 1009\n \n self.mod = 67280421310721\n self.hash = [0] * (length + 2)\n self.pow = [1] * (length + 2)\n\n for i in range(length):\n self.hash[i+1] = (self.hash[i] + s[i]) * base % self.mod\n self.pow[i+1] = self.pow[i] * base % self.mod\n self.pow[length+1] = self.pow[length] * base % self.mod \n\n def get(self, l, r):\n t = self.hash[r] - self.hash[l] * self.pow[r-l] % self.mod\n return t % self.mod\n\nss = []\nn = int(input())\nfor _ in range(n):\n ss.append([ord(item) for item in input().rstrip()])\nss.sort(key=lambda x: len(x), reverse=True)\n\norda = ord(\"a\")\nwords = defaultdict(empty_list)\nans = 0\nfor s in ss:\n word_len = len(s)\n s_rev = s[::-1]\n RH = RollingHash(s_rev)\n rh = RH.get(0, word_len-1)\n ans += words[rh][s_rev[-1] - orda]\n initial = [0] * 26 \n for i, ch in enumerate(s):\n initial[ch - orda] = 1\n for j, is_initial in enumerate(initial):\n if is_initial:\n rh = RH.get(0, word_len-i-1)\n words[rh][j] += 1\nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597050790", "date2": "1597051675", "bleu_score": "0.8856665624999156", "code1_test_status": [1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 72, "total_score": 102, "input": "3\nayxyad\nbyw\nbaa\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["\nimport sys\ninput = sys.stdin.readline # (0): input=\n\nclass RollingHash(): # (1): RollingHash=\n def __init__(self, s):\n length = len(s) # (19): length=6 (157): length=3 (223): length=3\n base = 1009 # (20): base=1009 (158): base=1009 (224): base=1009\n self.mod = (1 << 61) - 1 # (21): NO CHANGE (159): NO CHANGE (225): NO CHANGE\n self.hash = [0] * (length + 2) # (22): NO CHANGE (160): NO CHANGE (226): NO CHANGE\n self.pow = [1] * (length + 2) # (23): NO CHANGE (161): NO CHANGE (227): NO CHANGE\n\n for i in range(length): # (24): i=0 (27): i=1 ... (237): NO CHANGE\n self.hash[i+1] = (self.hash[i] + s[i]) * base % self.mod # (25): NO CHANGE (28): NO CHANGE ... (235): NO CHANGE\n self.pow[i+1] = self.pow[i] * base % self.mod # (26): NO CHANGE (29): NO CHANGE ... (236): NO CHANGE\n self.pow[length+1] = self.pow[length] * base % self.mod # (43): sys=, input=, RollingHash=, ss=[[0, 24, 23, 24, 0, 3], [1, 24, 22], [1, 0, 0]], orda=97, n=3, _=2, words={}, ans=0, s=[0, 24, 23, 24, 0, 3], word_len=6, s_rev=[3, 0, 24, 23, 24, 0], RH= (172): sys=, input=, RollingHash=, ss=[[0, 24, 23, 24, 0, 3], [1, 24, 22], [1, 0, 0]], orda=97, n=3, _=2, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 3081755403: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3054243: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3027: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 0: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0]}, ans=0, s=[1, 24, 22], word_len=3, s_rev=[22, 24, 1], RH=, rh=0, initial={0, 24, 3, 23}, i=5, ch=3, key=23 (238): sys=, input=, RollingHash=, ss=[[0, 24, 23, 24, 0, 3], [1, 24, 22], [1, 0, 0]], orda=97, n=3, _=2, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 3081755403: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3054243: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3027: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 0: [1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 0], 22421998: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 22198: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]}, ans=0, s=[1, 0, 0], word_len=3, s_rev=[0, 0, 1], RH=, rh=0, initial={24, 1, 22}, ch=22, key=22\n\n def get(self, l, r):\n t = self.hash[r] - self.hash[l] * self.pow[r-l] % self.mod # (45): sys=, input=, RollingHash=, ss=[[0, 24, 23, 24, 0, 3], [1, 24, 22], [1, 0, 0]], orda=97, n=3, _=2, words={}, ans=0, s=[0, 24, 23, 24, 0, 3], word_len=6, s_rev=[3, 0, 24, 23, 24, 0], RH=, rh=3137476645881722 (52): sys=, input=, RollingHash=, ss=[[0, 24, 23, 24, 0, 3], [1, 24, 22], [1, 0, 0]], orda=97, n=3, _=2, words={}, ans=0, s=[0, 24, 23, 24, 0, 3], word_len=6, s_rev=[3, 0, 24, 23, 24, 0], RH=, rh=3137476645881722, initial={0}, i=0, ch=0, key=0 ... (274): sys=, input=, RollingHash=, ss=[[0, 24, 23, 24, 0, 3], [1, 24, 22], [1, 0, 0]], orda=97, n=3, _=2, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 3081755403: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3054243: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3027: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 0: [3, 3, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 0], 22421998: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 22198: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]}, ans=1, s=[1, 0, 0], word_len=3, s_rev=[0, 0, 1], RH=, rh=0, initial={0, 1}, i=2, ch=0, key=1\n return t % self.mod\n\nss = [] # (2): ss=[]\norda = ord(\"a\") # (3): orda=97\nn = int(input()) # (4): n=3\nfor _ in range(n): # (5): _=0 (7): _=1 ... (11): ss\n ss.append([ord(item) - orda for item in input().rstrip()]) # (6): ss=[[0, 24, 23, 24, 0, 3]] (8): ss (10): ss\nss.sort(key=lambda x: len(x), reverse=True) # (12): ss\n\nwords = dict() # (13): ss, words={}\nans = 0 # (14): ss, ans=0\nfor s in ss: # (15): ss, s=[0, 24, 23, 24, 0, 3] (153): ss, s=[1, 24, 22] ... (279): ss\n word_len = len(s) # (16): ss, word_len=6 (154): ss, word_len=3 (220): ss\n s_rev = s[::-1] # (17): ss, s_rev=[3, 0, 24, 23, 24, 0] (155): ss, s_rev=[22, 24, 1] (221): ss, s_rev=[0, 0, 1]\n RH = RollingHash(s_rev) # (18): self=, s=[3, 0, 24, 23, 24, 0] (156): self=, s=[22, 24, 1] (222): self=, s=[0, 0, 1]\n rh = RH.get(0, word_len-1) # (44): self=, l=0, r=5 (173): self=, l=0, r=2 (239): self=, l=0, r=2\n if rh in words: # (46): ss (175): ss (241): ss\n ans += words[rh][s_rev[-1]] # (242): ss, ans=1\n initial = set() # (47): ss, initial=set() (176): ss, initial=set() (243): ss, initial=set()\n for i, ch in enumerate(s): # (48): ss, i=0, ch=0 (57): ss, i=1, ch=24 ... (278): ss\n initial.add(ch) # (49): ss, initial={0} (58): ss, initial={0, 24} ... (266): ss\n for key in initial: # (50): ss, key=0 (56): ss ... (277): ss\n rh = RH.get(0, word_len-i-1) # (51): self=, l=0, r=5 (60): self=, l=0, r=4 ... (273): self=, l=0, r=0\n if rh in words: # (53): ss (62): ss ... (275): ss\n words[rh][key] += 1 # (69): ss, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]} (83): ss, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 3081755403: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]} ... (276): ss, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 3081755403: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3054243: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3027: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 0: [3, 4, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 0], 22421998: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 22198: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]}\n else:\n words[rh] = [0] * 26 # (54): ss, words={3137476645881722: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (63): ss, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} ... (192): ss, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 3081755403: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3054243: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3027: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 0: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 22421998: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 22198: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\n words[rh][key] += 1 # (55): ss, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (64): ss, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} ... (193): ss, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 3081755403: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3054243: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3027: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 0: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 22421998: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 22198: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]}\nprint(ans)"], "anno_status": [false], "diff_content": " \n import sys\n input = sys.stdin.readline\n+from collections import defaultdict\n+\n+def empty_list():\n+ return [0] * 26\n \n class RollingHash():\n def __init__(self, s):\n length = len(s)\n base = 1009\n- self.mod = (1 << 61) - 1\n+ \n+ self.mod = 67280421310721\n self.hash = [0] * (length + 2)\n self.pow = [1] * (length + 2)\n \n for i in range(length):\n self.hash[i+1] = (self.hash[i] + s[i]) * base % self.mod\n self.pow[i+1] = self.pow[i] * base % self.mod\n self.pow[length+1] = self.pow[length] * base % self.mod \n \n def get(self, l, r):\n t = self.hash[r] - self.hash[l] * self.pow[r-l] % self.mod\n return t % self.mod\n \n ss = []\n-orda = ord(\"a\")\n n = int(input())\n for _ in range(n):\n- ss.append([ord(item) - orda for item in input().rstrip()])\n+ ss.append([ord(item) for item in input().rstrip()])\n ss.sort(key=lambda x: len(x), reverse=True)\n \n-words = dict()\n+orda = ord(\"a\")\n+words = defaultdict(empty_list)\n ans = 0\n for s in ss:\n word_len = len(s)\n s_rev = s[::-1]\n RH = RollingHash(s_rev)\n rh = RH.get(0, word_len-1)\n- if rh in words:\n- ans += words[rh][s_rev[-1]]\n- initial = set()\n+ ans += words[rh][s_rev[-1] - orda]\n+ initial = [0] * 26 \n for i, ch in enumerate(s):\n- initial.add(ch)\n- for key in initial:\n- rh = RH.get(0, word_len-i-1)\n- if rh in words:\n- words[rh][key] += 1\n- else:\n- words[rh] = [0] * 26\n- words[rh][key] += 1\n+ initial[ch - orda] = 1\n+ for j, is_initial in enumerate(initial):\n+ if is_initial:\n+ rh = RH.get(0, word_len-i-1)\n+ words[rh][j] += 1\n print(ans)\n", "FL_content": " \n import sys\n input = sys.stdin.readline\n \n class RollingHash():\n def __init__(self, s):\n length = len(s)\n base = 1009\n- self.mod = (1 << 61) - 1\n self.hash = [0] * (length + 2)\n self.pow = [1] * (length + 2)\n \n for i in range(length):\n self.hash[i+1] = (self.hash[i] + s[i]) * base % self.mod\n self.pow[i+1] = self.pow[i] * base % self.mod\n self.pow[length+1] = self.pow[length] * base % self.mod \n \n def get(self, l, r):\n t = self.hash[r] - self.hash[l] * self.pow[r-l] % self.mod\n return t % self.mod\n \n ss = []\n-orda = ord(\"a\")\n n = int(input())\n for _ in range(n):\n- ss.append([ord(item) - orda for item in input().rstrip()])\n ss.sort(key=lambda x: len(x), reverse=True)\n \n-words = dict()\n ans = 0\n for s in ss:\n word_len = len(s)\n s_rev = s[::-1]\n RH = RollingHash(s_rev)\n rh = RH.get(0, word_len-1)\n- if rh in words:\n- ans += words[rh][s_rev[-1]]\n- initial = set()\n for i, ch in enumerate(s):\n- initial.add(ch)\n- for key in initial:\n- rh = RH.get(0, word_len-i-1)\n- if rh in words:\n- words[rh][key] += 1\n- else:\n- words[rh] = [0] * 26\n- words[rh][key] += 1\n print(ans)\n", "added_lines": 16, "removed_lines": 15, "code1_lines": 48 }, { "user_id": "u227082700", "problem_id": "p02589", "submission1_id": "s377929248", "submission2_id": "s145661197", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom random import randint\nmod=1370757747362922367\nrr=randint(2,mod-2)\nn=int(input())\nss=[input()[::-1]for _ in range(n)]\nss.sort(key=len)\nd={}\nans=0\nfor s in ss:\n a=ord(s[-1])-97\n r=1\n h=0\n y=[0]*26\n for t in s[:-1]:\n b=ord(t)-97\n if h in d:\n for i in range(26):y[i]+=d[h][i]\n ans+=y[b]\n y[b]=0\n h=(h+b*r)%mod\n r=r*rr%mod\n ans+=y[a]\n if h not in d:d[h]=[0]*26\n d[h][a]+=1\nprint(ans)", "code2": "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nm=2**150-1\nn=int(input())\nss=[input()[::-1]for _ in range(n)]\nss.sort(key=len)\nd={}\nans=0\nfor s in ss:\n a=ord(s[-1])-97\n r=1\n h=0\n y=[0]*26\n for t in s[:-1]:\n b=ord(t)-97\n if h in d:\n for i in range(26):y[i]+=d[h][i]\n ans+=y[b]\n y[b]=0\n h=(h*71+b+135)&m\n ans+=y[a]\n if h not in d:d[h]=[0]*26\n d[h][a]+=1\nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597156089", "date2": "1597156725", "bleu_score": "0.7916039310232413", "code1_test_status": [1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 73, "total_score": 102, "input": "3\ndabxxy\nczw\nbaa\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["import sys\ninput = lambda: sys.stdin.readline().rstrip() # (0): input= at 0x0000021BE6D69BD0>, randint=>\nfrom random import randint\nmod=1370757747362922367 # (1): mod=1370757747362922367\nrr=randint(2,mod-2) # (2): rr=19366531371356330\nn=int(input()) # (3): n=3\nss=[input()[::-1]for _ in range(n)] # (4): ss=['yxxbad', 'wzc', 'aab']\nss.sort(key=len) # (5): ss=['wzc', 'aab', 'yxxbad']\nd={} # (6): d={}\nans=0 # (7): ans=0\nfor s in ss: # (8): s=wzc (31): s=aab ... (125): NO CHANGE\n a=ord(s[-1])-97 # (9): a=2 (32): a=1 (55): a=3\n r=1 # (10): r=1 (33): r=1 (56): r=1\n h=0 # (11): h=0 (34): h=0 (57): NO CHANGE\n y=[0]*26 # (12): y=[0, 0, ..., 0, 0] (35): NO CHANGE (58): NO CHANGE\n for t in s[:-1]: # (13): t=w (20): t=z ... (121): NO CHANGE\n b=ord(t)-97 # (14): b=22 (21): b=25 ... (115): b=0\n if h in d: # (15): NO CHANGE (22): NO CHANGE ... (116): NO CHANGE\n for i in range(26):y[i]+=d[h][i] # (62): i=0 (63): y=[0, 1, ..., 0, 0], i=1 ... (88): NO CHANGE\n ans+=y[b] # (16): NO CHANGE (23): NO CHANGE ... (117): NO CHANGE\n y[b]=0 # (17): NO CHANGE (24): NO CHANGE ... (118): NO CHANGE\n h=(h+b*r)%mod # (18): h=22 (25): h=484163284283908272 ... (119): NO CHANGE\n r=r*rr%mod # (19): r=19366531371356330 (26): r=1212287414521617869 ... (120): r=362541714568733079\n ans+=y[a] # (28): NO CHANGE (51): NO CHANGE (122): NO CHANGE\n if h not in d:d[h]=[0]*26 # (29): d={484163284283908272: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (52): d={484163284283908272: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 0: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (123): d={484163284283908272: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 0: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 214369505576812810: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\n d[h][a]+=1 # (30): d={484163284283908272: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (53): d={484163284283908272: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 0: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (124): d={484163284283908272: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 0: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 214369505576812810: [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\nprint(ans)"], "anno_status": [false], "diff_content": " import sys\n input = lambda: sys.stdin.readline().rstrip()\n-from random import randint\n-mod=1370757747362922367\n-rr=randint(2,mod-2)\n+m=2**150-1\n n=int(input())\n ss=[input()[::-1]for _ in range(n)]\n ss.sort(key=len)\n d={}\n ans=0\n for s in ss:\n a=ord(s[-1])-97\n r=1\n h=0\n y=[0]*26\n for t in s[:-1]:\n b=ord(t)-97\n if h in d:\n for i in range(26):y[i]+=d[h][i]\n ans+=y[b]\n y[b]=0\n- h=(h+b*r)%mod\n- r=r*rr%mod\n+ h=(h*71+b+135)&m\n ans+=y[a]\n if h not in d:d[h]=[0]*26\n d[h][a]+=1\n print(ans)\n", "FL_content": " import sys\n input = lambda: sys.stdin.readline().rstrip()\n-from random import randint\n-mod=1370757747362922367\n-rr=randint(2,mod-2)\n n=int(input())\n ss=[input()[::-1]for _ in range(n)]\n ss.sort(key=len)\n d={}\n ans=0\n for s in ss:\n a=ord(s[-1])-97\n r=1\n h=0\n y=[0]*26\n for t in s[:-1]:\n b=ord(t)-97\n if h in d:\n for i in range(26):y[i]+=d[h][i]\n ans+=y[b]\n y[b]=0\n- h=(h+b*r)%mod\n- r=r*rr%mod\n ans+=y[a]\n if h not in d:d[h]=[0]*26\n d[h][a]+=1\n print(ans)\n", "added_lines": 2, "removed_lines": 5, "code1_lines": 27 }, { "user_id": "u144913062", "problem_id": "p02589", "submission1_id": "s190924986", "submission2_id": "s639607482", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nbase = 1999849216943526259\nmod = (1 << 61) - 1\n\nN = int(input())\nS = [input().rstrip()[::-1] for _ in range(N)]\nS.sort(key=lambda s: -len(s))\ncnt = {}\nans = 0\none = [0] * 26\nfor s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n hashes[0] = ord(s[0]) - ord('a')\n for i in range(1, n - 1):\n hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\nprint(ans)\n", "code2": "import sys\ninput = sys.stdin.readline\n\nbase = 1999849216943526259\nmod = (1 << 61) - 1\n\nN = int(input())\nS = [input().rstrip()[::-1] for _ in range(N)]\nS.sort(key=lambda s: -len(s))\ncnt = {}\nans = 0\none = [0] * 26\nfor s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n hashes[0] = ord(s[0])\n for i in range(1, n - 1):\n hashes[i] = (hashes[i-1] * base + ord(s[i])) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597042459", "date2": "1597042563", "bleu_score": "0.9745539499791754", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 102, "input": "3\ndxyayb\nycw\naba\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\nbase = 1999849216943526259 # (1): base=1999849216943526259\nmod = (1 << 61) - 1 # (2): mod=2305843009213693951\n\nN = int(input()) # (3): N=3\nS = [input().rstrip()[::-1] for _ in range(N)] # (4): S=['byayxd', 'wcy', 'aba']\nS.sort(key=lambda s: -len(s)) # (5): NO CHANGE\ncnt = {} # (6): cnt={}\nans = 0 # (7): ans=0\none = [0] * 26 # (8): one=[0, 0, ..., 0, 0]\nfor s in S: # (9): s=byayxd (309): s=wcy ... (556): NO CHANGE\n n = len(s) # (10): n=6 (310): n=3 (433): NO CHANGE\n if n == 1: # (11): NO CHANGE (311): NO CHANGE (434): NO CHANGE\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1) # (12): hashes=[0, 0, 0, 0, 0] (312): hashes=[0, 0] (435): hashes=[0, 0]\n hashes[0] = ord(s[0]) - ord('a') # (13): hashes=[1, 0, 0, 0, 0] (313): hashes=[22, 0] (436): NO CHANGE\n for i in range(1, n - 1): # (14): i=1 (16): i=2 ... (439): NO CHANGE\n hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod # (15): hashes=[1, 1999849216943526283, 0, 0, 0] (17): hashes=[1, 1999849216943526283, 189721428698830257, 0, 0] ... (438): hashes=[0, 1]\n if hashes[-1] in cnt: # (23): NO CHANGE (317): NO CHANGE (440): NO CHANGE\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')] # (441): ans=1\n found = [0] * 26 # (24): found=[0, 0, ..., 0, 0] (318): found=[0, 0, ..., 0, 0] (442): found=[0, 0, ..., 0, 0]\n found[ord(s[-1]) - ord('a')] = 1 # (25): found=[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (319): found=[0, 0, ..., 1, 0] (443): found=[1, 0, ..., 0, 0]\n for i in range(n - 2, 0, -1): # (26): NO CHANGE (83): i=3 ... (501): NO CHANGE\n found[ord(s[i]) - ord('a')] = 1 # (27): found=[0, 0, ..., 0, 0] (84): found=[0, 0, ..., 1, 0] ... (445): found=[1, 1, ..., 0, 0]\n if hashes[i-1] not in cnt: # (28): NO CHANGE (85): NO CHANGE ... (446): NO CHANGE\n cnt[hashes[i-1]] = [0] * 26 # (29): cnt={1466238970679698543: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (86): cnt={1466238970679698543: [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], 189721428698830257: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} ... (447): cnt={1466238970679698543: [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], 189721428698830257: [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 1999849216943526283: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 1: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 22: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 0: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\n for c in range(26): # (30): c=0 (32): c=1 ... (500): NO CHANGE\n cnt[hashes[i-1]][c] += found[c] # (31): NO CHANGE (33): NO CHANGE ... (499): NO CHANGE\n found[ord(s[0]) - ord('a')] = 1 # (255): found=[1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0] (378): found=[0, 0, ..., 1, 0] (502): NO CHANGE\n for c in range(26): # (256): c=0 (258): c=1 ... (555): NO CHANGE\n one[c] += found[c] # (257): one=[1, 0, ..., 0, 0] (259): one=[1, 1, ..., 0, 0] ... (554): NO CHANGE\nprint(ans)\n"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n \n base = 1999849216943526259\n mod = (1 << 61) - 1\n \n N = int(input())\n S = [input().rstrip()[::-1] for _ in range(N)]\n S.sort(key=lambda s: -len(s))\n cnt = {}\n ans = 0\n one = [0] * 26\n for s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n- hashes[0] = ord(s[0]) - ord('a')\n+ hashes[0] = ord(s[0])\n for i in range(1, n - 1):\n- hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod\n+ hashes[i] = (hashes[i-1] * base + ord(s[i])) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\n print(ans)\n \n", "FL_content": " import sys\n input = sys.stdin.readline\n \n base = 1999849216943526259\n mod = (1 << 61) - 1\n \n N = int(input())\n S = [input().rstrip()[::-1] for _ in range(N)]\n S.sort(key=lambda s: -len(s))\n cnt = {}\n ans = 0\n one = [0] * 26\n for s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n- hashes[0] = ord(s[0]) - ord('a')\n for i in range(1, n - 1):\n- hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\n print(ans)\n \n", "added_lines": 2, "removed_lines": 2, "code1_lines": 36 }, { "user_id": "u144913062", "problem_id": "p02589", "submission1_id": "s759764213", "submission2_id": "s639607482", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nbase = 100\nmod = (1 << 61) - 1\n\nN = int(input())\nS = [input().rstrip()[::-1] for _ in range(N)]\nS.sort(key=lambda s: -len(s))\ncnt = {}\nans = 0\none = [0] * 26\nfor s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n hashes[0] = ord(s[0]) - ord('a')\n for i in range(1, n - 1):\n hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\nprint(ans)\n", "code2": "import sys\ninput = sys.stdin.readline\n\nbase = 1999849216943526259\nmod = (1 << 61) - 1\n\nN = int(input())\nS = [input().rstrip()[::-1] for _ in range(N)]\nS.sort(key=lambda s: -len(s))\ncnt = {}\nans = 0\none = [0] * 26\nfor s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n hashes[0] = ord(s[0])\n for i in range(1, n - 1):\n hashes[i] = (hashes[i-1] * base + ord(s[i])) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597042383", "date2": "1597042563", "bleu_score": "0.9705213144470762", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 102, "input": "3\ndayxyb\nycw\naba\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\nbase = 100 # (1): base=100\nmod = (1 << 61) - 1 # (2): mod=2305843009213693951\n\nN = int(input()) # (3): N=3\nS = [input().rstrip()[::-1] for _ in range(N)] # (4): S=['byxyad', 'wcy', 'aba']\nS.sort(key=lambda s: -len(s)) # (5): NO CHANGE\ncnt = {} # (6): cnt={}\nans = 0 # (7): ans=0\none = [0] * 26 # (8): one=[0, 0, ..., 0, 0]\nfor s in S: # (9): s=byxyad (309): s=wcy ... (556): NO CHANGE\n n = len(s) # (10): n=6 (310): n=3 (433): NO CHANGE\n if n == 1: # (11): NO CHANGE (311): NO CHANGE (434): NO CHANGE\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1) # (12): hashes=[0, 0, 0, 0, 0] (312): hashes=[0, 0] (435): hashes=[0, 0]\n hashes[0] = ord(s[0]) - ord('a') # (13): hashes=[1, 0, 0, 0, 0] (313): hashes=[22, 0] (436): NO CHANGE\n for i in range(1, n - 1): # (14): i=1 (16): i=2 ... (439): NO CHANGE\n hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod # (15): hashes=[1, 124, 0, 0, 0] (17): hashes=[1, 124, 12423, 0, 0] ... (438): hashes=[0, 1]\n if hashes[-1] in cnt: # (23): NO CHANGE (317): NO CHANGE (440): NO CHANGE\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')] # (441): ans=1\n found = [0] * 26 # (24): found=[0, 0, ..., 0, 0] (318): found=[0, 0, ..., 0, 0] (442): found=[0, 0, ..., 0, 0]\n found[ord(s[-1]) - ord('a')] = 1 # (25): found=[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (319): found=[0, 0, ..., 1, 0] (443): found=[1, 0, ..., 0, 0]\n for i in range(n - 2, 0, -1): # (26): NO CHANGE (83): i=3 ... (501): NO CHANGE\n found[ord(s[i]) - ord('a')] = 1 # (27): found=[1, 0, ..., 0, 0] (84): found=[1, 0, ..., 1, 0] ... (445): found=[1, 1, ..., 0, 0]\n if hashes[i-1] not in cnt: # (28): NO CHANGE (85): NO CHANGE ... (446): NO CHANGE\n cnt[hashes[i-1]] = [0] * 26 # (29): cnt={1242324: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (86): cnt={1242324: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 12423: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} ... (447): cnt={1242324: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 12423: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 124: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 1: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 22: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 0: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\n for c in range(26): # (30): c=0 (32): c=1 ... (500): NO CHANGE\n cnt[hashes[i-1]][c] += found[c] # (31): cnt={1242324: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (33): NO CHANGE ... (499): NO CHANGE\n found[ord(s[0]) - ord('a')] = 1 # (255): found=[1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0] (378): found=[0, 0, ..., 1, 0] (502): NO CHANGE\n for c in range(26): # (256): c=0 (258): c=1 ... (555): NO CHANGE\n one[c] += found[c] # (257): one=[1, 0, ..., 0, 0] (259): one=[1, 1, ..., 0, 0] ... (554): NO CHANGE\nprint(ans)\n"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n \n-base = 100\n+base = 1999849216943526259\n mod = (1 << 61) - 1\n \n N = int(input())\n S = [input().rstrip()[::-1] for _ in range(N)]\n S.sort(key=lambda s: -len(s))\n cnt = {}\n ans = 0\n one = [0] * 26\n for s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n- hashes[0] = ord(s[0]) - ord('a')\n+ hashes[0] = ord(s[0])\n for i in range(1, n - 1):\n- hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod\n+ hashes[i] = (hashes[i-1] * base + ord(s[i])) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\n print(ans)\n \n", "FL_content": " import sys\n input = sys.stdin.readline\n \n-base = 100\n mod = (1 << 61) - 1\n \n N = int(input())\n S = [input().rstrip()[::-1] for _ in range(N)]\n S.sort(key=lambda s: -len(s))\n cnt = {}\n ans = 0\n one = [0] * 26\n for s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n- hashes[0] = ord(s[0]) - ord('a')\n for i in range(1, n - 1):\n- hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\n print(ans)\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 36 }, { "user_id": "u176645218", "problem_id": "p02589", "submission1_id": "s455974919", "submission2_id": "s173253632", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nfrom collections import defaultdict\nN = int(input())\nT = [input()[::-1].strip() for i in range(N)]\n\n\n\n\n\n\nclass TrieTree:\n class Node:\n def __init__(self):\n self.ch = defaultdict(TrieTree.Node)\n self.cnt = 0\n self.end = False\n\n def __init__(self):\n self.root = self.Node()\n\n def register(self,word):\n node = self.root\n for w in word:\n node.cnt += 1\n node = node.ch[w]\n node.cnt += 1\n node.end = True\n \n def prefix(self, word):\n node = self.root\n for w in word:\n if w not in node.ch:\n return False\n else:\n node = node.ch[w]\n return node\n\ntt = TrieTree()\nT = sorted(T,reverse=True)\nans = 0\nfor word in T:\n tt.register(word)\n pre = word[:-1]\n last = word[-1]\n node = tt.prefix(pre)\n if not node:\n continue\n df = [node]\n while df:\n node = df.pop()\n for c, nnode in node.ch.items():\n if c == last:\n ans += node.ch[last].cnt\n else:\n df.append(nnode)\n ans -= 1\n \nprint(ans)\n", "code2": "import sys\nimport string\ninput = sys.stdin.readline\nfrom collections import defaultdict\nN = int(input())\nT = [input()[::-1].strip() for i in range(N)]\n\n\n\n\n\n\n\nclass TrieTree:\n class Node:\n def __init__(self):\n \n self.clue = [0]*26\n self.ch = defaultdict(TrieTree.Node)\n self.cnt = 0\n self.end = False\n\n def __init__(self):\n self.root = self.Node()\n\n def register(self,word):\n node = self.root\n for w in word:\n node.cnt += 1\n node = node.ch[w]\n node.cnt += 1\n node.end = True\n \n def prefix(self, word):\n node = self.root\n for w in word:\n if w not in node.ch:\n return False\n else:\n node = node.ch[w]\n return node\n\ntt = TrieTree()\nfor word in T:\n tt.register(word)\n\nroute = []\n\nst = [tt.root]\nwhile st:\n node = st.pop()\n route.append(node)\n st.extend(node.ch.values())\n\nf = lambda c : ord(c)-97\nfor node in route[::-1]:\n for c,nnode in node.ch.items():\n for i,v in enumerate(nnode.clue):\n node.clue[i] += v\n node.clue[f(c)] += nnode.cnt - nnode.clue[f(c)]\n\nans = 0\nfor word in T:\n pre = word[:-1]\n last = word[-1]\n node = tt.prefix(pre)\n if not node:\n continue\n ans += node.clue[f(last)] - 1\n \nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1598671859", "date2": "1598736573", "bleu_score": "0.8157940190615003", "code1_test_status": [1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 100, "total_score": 102, "input": "3\nxbcayx\ncyx\nbba\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=, defaultdict=\nfrom collections import defaultdict\nN = int(input()) # (1): N=3\nT = [input()[::-1].strip() for i in range(N)] # (2): T=['xyacbx', 'xyc', 'abb']\n\n\n\n\n\n\nclass TrieTree: # (3): TrieTree=\n class Node:\n def __init__(self):\n self.ch = defaultdict(TrieTree.Node) # (6): NO CHANGE (17): NO CHANGE ... (140): NO CHANGE\n self.cnt = 0 # (7): NO CHANGE (18): NO CHANGE ... (141): NO CHANGE\n self.end = False # (8): sys=, input=, defaultdict=, N=3, T=['xyacbx', 'xyc', 'abb'], TrieTree=, tt= (19): self=, word=xyc, node=, w=x ... (142): self=, word=abb, node=, w=b\n\n def __init__(self):\n self.root = self.Node() # (5): self=\n\n def register(self,word):\n node = self.root # (13): node= (58): node= (124): node=\n for w in word: # (14): w=x (20): w=y ... (143): NO CHANGE\n node.cnt += 1 # (15): NO CHANGE (21): NO CHANGE ... (138): NO CHANGE\n node = node.ch[w] # (16): self= (22): self= ... (139): self=\n node.cnt += 1 # (33): NO CHANGE (90): NO CHANGE (144): NO CHANGE\n node.end = True # (34): sys=, input=, defaultdict=, N=3, T=['xyc', 'xyacbx', 'abb'], TrieTree=, tt=, ans=0 (91): sys=, input=, defaultdict=, N=3, T=['xyc', 'xyacbx', 'abb'], TrieTree=, tt=, ans=0, pre=xy, last=c, node=, df=[], c=c, nnode= (145): sys=, input=, defaultdict=, N=3, T=['xyc', 'xyacbx', 'abb'], TrieTree=, tt=, ans=0, pre=xyacb, last=x, node=, df=[], c=x, nnode=\n \n def prefix(self, word):\n node = self.root # (38): node= (95): node= (149): node=\n for w in word: # (39): w=x (42): w=y ... (156): sys=, input=, defaultdict=, N=3, T=['xyc', 'xyacbx', 'abb'], TrieTree=, tt=, ans=0, word=abb, pre=ab, last=b, df=[], c=x, nnode=\n if w not in node.ch: # (40): NO CHANGE (43): NO CHANGE ... (154): NO CHANGE\n return False\n else:\n node = node.ch[w] # (41): node= (44): node= ... (155): node=\n return node\n\ntt = TrieTree() # (4): self=\nT = sorted(T,reverse=True) # (9): T=['xyc', 'xyacbx', 'abb']\nans = 0 # (10): ans=0\nfor word in T: # (11): word=xyc (56): word=xyacbx ... (167): NO CHANGE\n tt.register(word) # (12): self= (57): self= (123): self=\n pre = word[:-1] # (35): pre=xy (92): pre=xyacb (146): pre=ab\n last = word[-1] # (36): last=c (93): last=x (147): last=b\n node = tt.prefix(pre) # (37): self=, word=xy (94): self=, word=xyacb (148): self=, word=ab\n if not node: # (46): NO CHANGE (112): NO CHANGE (157): NO CHANGE\n continue\n df = [node] # (47): df=[] (113): df (158): df\n while df: # (48): df (54): NO CHANGE ... (165): NO CHANGE\n node = df.pop() # (49): df=[] (115): df=[] (160): df=[]\n for c, nnode in node.ch.items(): # (50): c=c, nnode= (53): NO CHANGE ... (164): NO CHANGE\n if c == last: # (51): NO CHANGE (117): NO CHANGE (162): NO CHANGE\n ans += node.ch[last].cnt # (52): ans=1 (118): ans=1 (163): ans=1\n else:\n df.append(nnode)\n ans -= 1 # (55): ans=0 (121): ans=0 (166): ans=0\n \nprint(ans)\n"], "anno_status": [false], "diff_content": " import sys\n+import string\n input = sys.stdin.readline\n from collections import defaultdict\n N = int(input())\n T = [input()[::-1].strip() for i in range(N)]\n \n \n \n \n \n \n+\n class TrieTree:\n class Node:\n def __init__(self):\n+ \n+ self.clue = [0]*26\n self.ch = defaultdict(TrieTree.Node)\n self.cnt = 0\n self.end = False\n \n def __init__(self):\n self.root = self.Node()\n \n def register(self,word):\n node = self.root\n for w in word:\n node.cnt += 1\n node = node.ch[w]\n node.cnt += 1\n node.end = True\n \n def prefix(self, word):\n node = self.root\n for w in word:\n if w not in node.ch:\n return False\n else:\n node = node.ch[w]\n return node\n \n tt = TrieTree()\n-T = sorted(T,reverse=True)\n-ans = 0\n for word in T:\n tt.register(word)\n+\n+route = []\n+\n+st = [tt.root]\n+while st:\n+ node = st.pop()\n+ route.append(node)\n+ st.extend(node.ch.values())\n+\n+f = lambda c : ord(c)-97\n+for node in route[::-1]:\n+ for c,nnode in node.ch.items():\n+ for i,v in enumerate(nnode.clue):\n+ node.clue[i] += v\n+ node.clue[f(c)] += nnode.cnt - nnode.clue[f(c)]\n+\n+ans = 0\n+for word in T:\n pre = word[:-1]\n last = word[-1]\n node = tt.prefix(pre)\n if not node:\n continue\n- df = [node]\n- while df:\n- node = df.pop()\n- for c, nnode in node.ch.items():\n- if c == last:\n- ans += node.ch[last].cnt\n- else:\n- df.append(nnode)\n- ans -= 1\n+ ans += node.clue[f(last)] - 1\n \n print(ans)\n \n", "FL_content": " import sys\n input = sys.stdin.readline\n from collections import defaultdict\n N = int(input())\n T = [input()[::-1].strip() for i in range(N)]\n \n \n \n \n \n \n class TrieTree:\n class Node:\n def __init__(self):\n self.ch = defaultdict(TrieTree.Node)\n self.cnt = 0\n self.end = False\n \n def __init__(self):\n self.root = self.Node()\n \n def register(self,word):\n node = self.root\n for w in word:\n node.cnt += 1\n node = node.ch[w]\n node.cnt += 1\n node.end = True\n \n def prefix(self, word):\n node = self.root\n for w in word:\n if w not in node.ch:\n return False\n else:\n node = node.ch[w]\n return node\n \n tt = TrieTree()\n-T = sorted(T,reverse=True)\n-ans = 0\n for word in T:\n tt.register(word)\n pre = word[:-1]\n last = word[-1]\n node = tt.prefix(pre)\n if not node:\n continue\n- df = [node]\n- while df:\n- node = df.pop()\n- for c, nnode in node.ch.items():\n- if c == last:\n- ans += node.ch[last].cnt\n- else:\n- df.append(nnode)\n- ans -= 1\n \n print(ans)\n \n", "added_lines": 23, "removed_lines": 11, "code1_lines": 60 }, { "user_id": "u864197622", "problem_id": "p02589", "submission1_id": "s080931170", "submission2_id": "s598476480", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nP = 10 ** 30 + 57\nN = int(input())\nX = sorted([input()[::-1] for _ in range(N)], key = len)\n\nD = {}\nans = 0\nfor x in X:\n L = [0] * 26\n T, a = x[:-1], ord(x[-1]) - 97\n h = 0\n for t in T:\n if h in D:\n for i in range(26):\n L[i] += D[h][i]\n b = ord(t) - 97\n ans += L[b]\n L[b] = 0\n \n h = (h + b) * 7 % P\n ans += L[a]\n if h in D:\n D[h][a] += 1\n else:\n D[h] = [0] * 26\n D[h][a] = 1\n \nprint(ans)", "code2": "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nP = 10 ** 40 + 121\nN = int(input())\nX = sorted([input()[::-1] for _ in range(N)], key = len)\n\nD = {}\nans = 0\nfor x in X:\n L = [0] * 26\n T, a = x[:-1], ord(x[-1]) - 97\n h = 0\n for t in T:\n if h in D:\n for i in range(26):\n L[i] += D[h][i]\n b = ord(t) - 97\n ans += L[b]\n L[b] = 0\n \n h = (h + b + 135) * 71 % P\n ans += L[a]\n if h in D:\n D[h][a] += 1\n else:\n D[h] = [0] * 26\n D[h][a] = 1\n \nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597127897", "date2": "1597129549", "bleu_score": "0.9706566509384696", "code1_test_status": [1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 74, "total_score": 102, "input": "3\ndayxyb\nycw\nbaa\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["import sys\ninput = lambda: sys.stdin.readline().rstrip() # (0): input= at 0x000001C917DE9BD0>\nP = 10 ** 30 + 57 # (1): P=1000000000000000000000000000057\nN = int(input()) # (2): N=3\nX = sorted([input()[::-1] for _ in range(N)], key = len) # (3): X=['wcy', 'aab', 'byxyad']\n\nD = {} # (4): D={}\nans = 0 # (5): ans=0\nfor x in X: # (6): x=wcy (27): x=aab ... (140): NO CHANGE\n L = [0] * 26 # (7): L=[0, 0, ..., 0, 0] (28): NO CHANGE (49): NO CHANGE\n T, a = x[:-1], ord(x[-1]) - 97 # (8): T=wc, a=24 (29): T=aa, a=1 (50): T=byxya, a=3\n h = 0 # (9): h=0 (30): h=0 (51): NO CHANGE\n for t in T: # (10): t=w (16): t=c ... (135): NO CHANGE\n if h in D: # (11): NO CHANGE (17): NO CHANGE ... (130): NO CHANGE\n for i in range(26): # (54): i=0 (56): i=1 ... (106): NO CHANGE\n L[i] += D[h][i] # (55): NO CHANGE (57): L=[0, 1, ..., 0, 0] ... (105): NO CHANGE\n b = ord(t) - 97 # (12): b=22 (18): b=2 ... (131): b=0\n ans += L[b] # (13): NO CHANGE (19): NO CHANGE ... (132): NO CHANGE\n L[b] = 0 # (14): NO CHANGE (20): NO CHANGE ... (133): NO CHANGE\n \n h = (h + b) * 7 % P # (15): h=154 (21): h=1092 ... (134): h=83496\n ans += L[a] # (23): NO CHANGE (44): NO CHANGE (136): NO CHANGE\n if h in D: # (24): NO CHANGE (45): NO CHANGE (137): NO CHANGE\n D[h][a] += 1\n else:\n D[h] = [0] * 26 # (25): D={1092: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (46): D={1092: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 0: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (138): D={1092: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 0: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 83496: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\n D[h][a] = 1 # (26): D={1092: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]} (47): D={1092: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 0: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (139): D={1092: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 0: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 83496: [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\n \nprint(ans)"], "anno_status": [false], "diff_content": " import sys\n input = lambda: sys.stdin.readline().rstrip()\n-P = 10 ** 30 + 57\n+P = 10 ** 40 + 121\n N = int(input())\n X = sorted([input()[::-1] for _ in range(N)], key = len)\n \n D = {}\n ans = 0\n for x in X:\n L = [0] * 26\n T, a = x[:-1], ord(x[-1]) - 97\n h = 0\n for t in T:\n if h in D:\n for i in range(26):\n L[i] += D[h][i]\n b = ord(t) - 97\n ans += L[b]\n L[b] = 0\n \n- h = (h + b) * 7 % P\n+ h = (h + b + 135) * 71 % P\n ans += L[a]\n if h in D:\n D[h][a] += 1\n else:\n D[h] = [0] * 26\n D[h][a] = 1\n \n print(ans)\n", "FL_content": " import sys\n input = lambda: sys.stdin.readline().rstrip()\n-P = 10 ** 30 + 57\n N = int(input())\n X = sorted([input()[::-1] for _ in range(N)], key = len)\n \n D = {}\n ans = 0\n for x in X:\n L = [0] * 26\n T, a = x[:-1], ord(x[-1]) - 97\n h = 0\n for t in T:\n if h in D:\n for i in range(26):\n L[i] += D[h][i]\n b = ord(t) - 97\n ans += L[b]\n L[b] = 0\n \n- h = (h + b) * 7 % P\n ans += L[a]\n if h in D:\n D[h][a] += 1\n else:\n D[h] = [0] * 26\n D[h][a] = 1\n \n print(ans)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 29 }, { "user_id": "u144913062", "problem_id": "p02589", "submission1_id": "s833281854", "submission2_id": "s639607482", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nbase = 26\nmod = (1 << 61) - 1\n\nN = int(input())\nS = [input().rstrip()[::-1] for _ in range(N)]\nS.sort(key=lambda s: -len(s))\ncnt = {}\nans = 0\none = [0] * 26\nfor s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n hashes[0] = ord(s[0]) - ord('a')\n for i in range(1, n - 1):\n hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\nprint(ans)\n", "code2": "import sys\ninput = sys.stdin.readline\n\nbase = 1999849216943526259\nmod = (1 << 61) - 1\n\nN = int(input())\nS = [input().rstrip()[::-1] for _ in range(N)]\nS.sort(key=lambda s: -len(s))\ncnt = {}\nans = 0\none = [0] * 26\nfor s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n hashes[0] = ord(s[0])\n for i in range(1, n - 1):\n hashes[i] = (hashes[i-1] * base + ord(s[i])) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597042305", "date2": "1597042563", "bleu_score": "0.9713090385906991", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 102, "input": "3\ncybxxa\ncyw\nbaa\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\nbase = 26 # (1): base=26\nmod = (1 << 61) - 1 # (2): mod=2305843009213693951\n\nN = int(input()) # (3): N=3\nS = [input().rstrip()[::-1] for _ in range(N)] # (4): S=['axxbyc', 'wyc', 'aab']\nS.sort(key=lambda s: -len(s)) # (5): NO CHANGE\ncnt = {} # (6): cnt={}\nans = 0 # (7): ans=0\none = [0] * 26 # (8): one=[0, 0, ..., 0, 0]\nfor s in S: # (9): s=axxbyc (309): s=wyc ... (555): NO CHANGE\n n = len(s) # (10): n=6 (310): n=3 (433): NO CHANGE\n if n == 1: # (11): NO CHANGE (311): NO CHANGE (434): NO CHANGE\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1) # (12): hashes=[0, 0, 0, 0, 0] (312): hashes=[0, 0] (435): hashes=[0, 0]\n hashes[0] = ord(s[0]) - ord('a') # (13): NO CHANGE (313): hashes=[22, 0] (436): NO CHANGE\n for i in range(1, n - 1): # (14): i=1 (16): i=2 ... (439): NO CHANGE\n hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod # (15): hashes=[0, 23, 0, 0, 0] (17): hashes=[0, 23, 621, 0, 0] ... (438): NO CHANGE\n if hashes[-1] in cnt: # (23): NO CHANGE (317): NO CHANGE (440): NO CHANGE\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')] # (441): ans=1\n found = [0] * 26 # (24): found=[0, 0, ..., 0, 0] (318): found=[0, 0, ..., 0, 0] (442): found=[0, 0, ..., 0, 0]\n found[ord(s[-1]) - ord('a')] = 1 # (25): found=[0, 0, ..., 0, 0] (319): found=[0, 0, ..., 0, 0] (443): found=[0, 1, ..., 0, 0]\n for i in range(n - 2, 0, -1): # (26): NO CHANGE (83): i=3 ... (500): NO CHANGE\n found[ord(s[i]) - ord('a')] = 1 # (27): found=[0, 0, ..., 1, 0] (84): found=[0, 1, ..., 1, 0] ... (445): found=[1, 1, ..., 0, 0]\n if hashes[i-1] not in cnt: # (28): NO CHANGE (85): NO CHANGE ... (446): NO CHANGE\n cnt[hashes[i-1]] = [0] * 26 # (29): cnt={16147: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (86): cnt={16147: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 621: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} ... (323): cnt={16147: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 621: [0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 23: [0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 0: [0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 22: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\n for c in range(26): # (30): c=0 (32): c=1 ... (499): NO CHANGE\n cnt[hashes[i-1]][c] += found[c] # (31): NO CHANGE (33): NO CHANGE ... (498): NO CHANGE\n found[ord(s[0]) - ord('a')] = 1 # (255): found=[1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0] (378): found=[0, 0, ..., 1, 0] (501): NO CHANGE\n for c in range(26): # (256): c=0 (258): c=1 ... (554): NO CHANGE\n one[c] += found[c] # (257): one=[1, 0, ..., 0, 0] (259): one=[1, 1, ..., 0, 0] ... (553): NO CHANGE\nprint(ans)\n"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n \n-base = 26\n+base = 1999849216943526259\n mod = (1 << 61) - 1\n \n N = int(input())\n S = [input().rstrip()[::-1] for _ in range(N)]\n S.sort(key=lambda s: -len(s))\n cnt = {}\n ans = 0\n one = [0] * 26\n for s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n- hashes[0] = ord(s[0]) - ord('a')\n+ hashes[0] = ord(s[0])\n for i in range(1, n - 1):\n- hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod\n+ hashes[i] = (hashes[i-1] * base + ord(s[i])) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\n print(ans)\n \n", "FL_content": " import sys\n input = sys.stdin.readline\n \n-base = 26\n mod = (1 << 61) - 1\n \n N = int(input())\n S = [input().rstrip()[::-1] for _ in range(N)]\n S.sort(key=lambda s: -len(s))\n cnt = {}\n ans = 0\n one = [0] * 26\n for s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n- hashes[0] = ord(s[0]) - ord('a')\n for i in range(1, n - 1):\n- hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\n print(ans)\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 36 }, { "user_id": "u941407962", "problem_id": "p02589", "submission1_id": "s732337450", "submission2_id": "s703959964", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys;input=sys.stdin.readline\nN, = map(int, input().split())\nMOD=998244353\nS = []\nfor _ in range(N):\n s = input().strip()\n S.append(s)\nS.sort(key=lambda x:len(x))\nD = dict()\ndd = set()\nR = 0\nfor s in S:\n l = len(s)\n d = [0]*26\n for c in dd:\n d[c] += 1\n tmp=0\n for i in range(l-1, -1, -1):\n cc = ord(s[i]) - 97\n tmp=(100*tmp+cc)%MOD\n R += d[cc]\n d[cc] = 0\n if tmp in D:\n for c in D[tmp]:\n d[c] += 1\n if i == 1:\n nn = tmp\n if l != 1:\n if nn not in D:\n D[nn] = set()\n D[nn].add(cc)\n else:\n dd.add(cc)\nprint(R)\n", "code2": "import sys;input=sys.stdin.readline\nN, = map(int, input().split())\nMOD=67280421310721\nS = []\nfor _ in range(N):\n s = input().strip()\n S.append(s)\nS.sort(key=lambda x:len(x))\nD = dict()\ndd = set()\nR = 0\nfor s in S:\n l = len(s)\n d = [0]*26\n for c in dd:\n d[c] += 1\n tmp=0\n for i in range(l-1, -1, -1):\n ee = ord(s[i]) - 97\n tmp = 100*tmp+(ee+1)\n tmp %= MOD\n R += d[ee]\n d[ee] = 0\n if tmp in D:\n for c in D[tmp]:\n d[c] += 1\n if i == 1:\n nn = tmp\n if l != 1:\n if nn not in D:\n D[nn] = set()\n D[nn].add(ee)\n else:\n dd.add(ee)\nprint(R)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597028337", "date2": "1597029944", "bleu_score": "0.9131035818434512", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 102, "input": "3\ndayxyb\nycw\naba\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["import sys;input=sys.stdin.readline\nN, = map(int, input().split()) # (0): N=3\nMOD=998244353 # (1): MOD=998244353\nS = [] # (2): S=[]\nfor _ in range(N): # (3): _=0 (6): _=1 ... (12): NO CHANGE\n s = input().strip() # (4): s=dayxyb (7): s=ycw (10): s=aba\n S.append(s) # (5): S=['dayxyb'] (8): S=['dayxyb', 'ycw'] (11): S=['dayxyb', 'ycw', 'aba']\nS.sort(key=lambda x:len(x)) # (13): S=['ycw', 'aba', 'dayxyb']\nD = dict() # (14): D={}\ndd = set() # (15): dd=set()\nR = 0 # (16): R=0\nfor s in S: # (17): s=ycw (49): s=aba ... (137): NO CHANGE\n l = len(s) # (18): l=3 (50): NO CHANGE (82): l=6\n d = [0]*26 # (19): d=[0, 0, ..., 0, 0] (51): NO CHANGE (83): NO CHANGE\n for c in dd: # (20): NO CHANGE (52): NO CHANGE (84): NO CHANGE\n d[c] += 1\n tmp=0 # (21): tmp=0 (53): tmp=0 (85): tmp=0\n for i in range(l-1, -1, -1): # (22): i=2 (29): i=1 ... (132): NO CHANGE\n cc = ord(s[i]) - 97 # (23): cc=22 (30): cc=2 ... (126): cc=3\n tmp=(100*tmp+cc)%MOD # (24): tmp=22 (31): tmp=2202 ... (127): tmp=444307767\n R += d[cc] # (25): NO CHANGE (32): NO CHANGE ... (128): NO CHANGE\n d[cc] = 0 # (26): NO CHANGE (33): NO CHANGE ... (129): NO CHANGE\n if tmp in D: # (27): NO CHANGE (34): NO CHANGE ... (130): NO CHANGE\n for c in D[tmp]: # (92): c=0 (94): NO CHANGE\n d[c] += 1 # (93): d=[1, 0, ..., 0, 0]\n if i == 1: # (28): NO CHANGE (35): NO CHANGE ... (131): NO CHANGE\n nn = tmp # (36): nn=2202 (68): nn=1 (124): nn=124232400\n if l != 1: # (45): NO CHANGE (77): NO CHANGE (133): NO CHANGE\n if nn not in D: # (46): NO CHANGE (78): NO CHANGE (134): NO CHANGE\n D[nn] = set() # (47): D={2202: set()} (79): D={2202: {24}, 1: set()} (135): D={2202: {24}, 1: {0}, 124232400: set()}\n D[nn].add(cc) # (48): D={2202: {24}} (80): D={2202: {24}, 1: {0}} (136): D={2202: {24}, 1: {0}, 124232400: {3}}\n else:\n dd.add(cc)\nprint(R)\n"], "anno_status": [false], "diff_content": " import sys;input=sys.stdin.readline\n N, = map(int, input().split())\n-MOD=998244353\n+MOD=67280421310721\n S = []\n for _ in range(N):\n s = input().strip()\n S.append(s)\n S.sort(key=lambda x:len(x))\n D = dict()\n dd = set()\n R = 0\n for s in S:\n l = len(s)\n d = [0]*26\n for c in dd:\n d[c] += 1\n tmp=0\n for i in range(l-1, -1, -1):\n- cc = ord(s[i]) - 97\n- tmp=(100*tmp+cc)%MOD\n- R += d[cc]\n- d[cc] = 0\n+ ee = ord(s[i]) - 97\n+ tmp = 100*tmp+(ee+1)\n+ tmp %= MOD\n+ R += d[ee]\n+ d[ee] = 0\n if tmp in D:\n for c in D[tmp]:\n d[c] += 1\n if i == 1:\n nn = tmp\n if l != 1:\n if nn not in D:\n D[nn] = set()\n- D[nn].add(cc)\n+ D[nn].add(ee)\n else:\n- dd.add(cc)\n+ dd.add(ee)\n print(R)\n \n", "FL_content": " import sys;input=sys.stdin.readline\n N, = map(int, input().split())\n-MOD=998244353\n S = []\n for _ in range(N):\n s = input().strip()\n S.append(s)\n S.sort(key=lambda x:len(x))\n D = dict()\n dd = set()\n R = 0\n for s in S:\n l = len(s)\n d = [0]*26\n for c in dd:\n d[c] += 1\n tmp=0\n for i in range(l-1, -1, -1):\n- cc = ord(s[i]) - 97\n- tmp=(100*tmp+cc)%MOD\n- R += d[cc]\n- d[cc] = 0\n if tmp in D:\n for c in D[tmp]:\n d[c] += 1\n if i == 1:\n nn = tmp\n if l != 1:\n if nn not in D:\n D[nn] = set()\n- D[nn].add(cc)\n else:\n- dd.add(cc)\n print(R)\n \n", "added_lines": 8, "removed_lines": 7, "code1_lines": 35 }, { "user_id": "u864197622", "problem_id": "p02589", "submission1_id": "s622554698", "submission2_id": "s598476480", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nP = 10 ** 9 + 7\nN = int(input())\nX = sorted([input()[::-1] for _ in range(N)], key = len)\n\nD = {}\nans = 0\nfor x in X:\n L = [0] * 26\n T, a = x[:-1], ord(x[-1]) - 97\n h = 0\n for t in T:\n if h in D:\n for i in range(26):\n L[i] += D[h][i]\n b = ord(t) - 97\n ans += L[b]\n L[b] = 0\n \n h = (h + b) * 7 % P\n ans += L[a]\n if h in D:\n D[h][a] += 1\n else:\n D[h] = [0] * 26\n D[h][a] = 1\n \nprint(ans)", "code2": "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nP = 10 ** 40 + 121\nN = int(input())\nX = sorted([input()[::-1] for _ in range(N)], key = len)\n\nD = {}\nans = 0\nfor x in X:\n L = [0] * 26\n T, a = x[:-1], ord(x[-1]) - 97\n h = 0\n for t in T:\n if h in D:\n for i in range(26):\n L[i] += D[h][i]\n b = ord(t) - 97\n ans += L[b]\n L[b] = 0\n \n h = (h + b + 135) * 71 % P\n ans += L[a]\n if h in D:\n D[h][a] += 1\n else:\n D[h] = [0] * 26\n D[h][a] = 1\n \nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597127750", "date2": "1597129549", "bleu_score": "0.9680078589118257", "code1_test_status": [1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 74, "total_score": 102, "input": "3\ndabxxy\nczw\nbaa\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["import sys\ninput = lambda: sys.stdin.readline().rstrip() # (0): input= at 0x0000016CE2279BD0>\nP = 10 ** 9 + 7 # (1): P=1000000007\nN = int(input()) # (2): N=3\nX = sorted([input()[::-1] for _ in range(N)], key = len) # (3): X=['wzc', 'aab', 'yxxbad']\n\nD = {} # (4): D={}\nans = 0 # (5): ans=0\nfor x in X: # (6): x=wzc (27): x=aab ... (140): NO CHANGE\n L = [0] * 26 # (7): L=[0, 0, ..., 0, 0] (28): NO CHANGE (49): NO CHANGE\n T, a = x[:-1], ord(x[-1]) - 97 # (8): T=wz, a=2 (29): T=aa, a=1 (50): T=yxxba, a=3\n h = 0 # (9): h=0 (30): h=0 (51): NO CHANGE\n for t in T: # (10): t=w (16): t=z ... (135): NO CHANGE\n if h in D: # (11): NO CHANGE (17): NO CHANGE ... (130): NO CHANGE\n for i in range(26): # (54): i=0 (56): i=1 ... (106): NO CHANGE\n L[i] += D[h][i] # (55): NO CHANGE (57): L=[0, 1, ..., 0, 0] ... (105): NO CHANGE\n b = ord(t) - 97 # (12): b=22 (18): b=25 ... (131): b=0\n ans += L[b] # (13): NO CHANGE (19): NO CHANGE ... (132): NO CHANGE\n L[b] = 0 # (14): NO CHANGE (20): NO CHANGE ... (133): NO CHANGE\n \n h = (h + b) * 7 % P # (15): h=154 (21): h=1253 ... (134): h=466529\n ans += L[a] # (23): NO CHANGE (44): NO CHANGE (136): NO CHANGE\n if h in D: # (24): NO CHANGE (45): NO CHANGE (137): NO CHANGE\n D[h][a] += 1\n else:\n D[h] = [0] * 26 # (25): D={1253: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (46): D={1253: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 0: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (138): D={1253: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 0: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 466529: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\n D[h][a] = 1 # (26): D={1253: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (47): D={1253: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 0: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (139): D={1253: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 0: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 466529: [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\n \nprint(ans)"], "anno_status": [false], "diff_content": " import sys\n input = lambda: sys.stdin.readline().rstrip()\n-P = 10 ** 9 + 7\n+P = 10 ** 40 + 121\n N = int(input())\n X = sorted([input()[::-1] for _ in range(N)], key = len)\n \n D = {}\n ans = 0\n for x in X:\n L = [0] * 26\n T, a = x[:-1], ord(x[-1]) - 97\n h = 0\n for t in T:\n if h in D:\n for i in range(26):\n L[i] += D[h][i]\n b = ord(t) - 97\n ans += L[b]\n L[b] = 0\n \n- h = (h + b) * 7 % P\n+ h = (h + b + 135) * 71 % P\n ans += L[a]\n if h in D:\n D[h][a] += 1\n else:\n D[h] = [0] * 26\n D[h][a] = 1\n \n print(ans)\n", "FL_content": " import sys\n input = lambda: sys.stdin.readline().rstrip()\n-P = 10 ** 9 + 7\n N = int(input())\n X = sorted([input()[::-1] for _ in range(N)], key = len)\n \n D = {}\n ans = 0\n for x in X:\n L = [0] * 26\n T, a = x[:-1], ord(x[-1]) - 97\n h = 0\n for t in T:\n if h in D:\n for i in range(26):\n L[i] += D[h][i]\n b = ord(t) - 97\n ans += L[b]\n L[b] = 0\n \n- h = (h + b) * 7 % P\n ans += L[a]\n if h in D:\n D[h][a] += 1\n else:\n D[h] = [0] * 26\n D[h][a] = 1\n \n print(ans)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 29 }, { "user_id": "u941407962", "problem_id": "p02589", "submission1_id": "s105102881", "submission2_id": "s703959964", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys;input=sys.stdin.readline\nN, = map(int, input().split())\nMOD=998244353\nS = []\nfor _ in range(N):\n s = input().strip()\n S.append(s)\nS.sort(key=lambda x:len(x))\nD = dict()\ndd = set()\nR = 0\nfor s in S:\n l = len(s)\n d = [0]*26\n for c in dd:\n d[c] += 1\n tmp=0\n for i in range(l-1, -1, -1):\n ee = ord(s[i]) - 97\n tmp = 100*tmp+ee\n R += d[ee]\n d[ee] = 0\n if tmp in D:\n for c in D[tmp]:\n d[c] += 1\n if i == 1:\n nn = tmp\n if l != 1:\n if nn not in D:\n D[nn] = set()\n D[nn].add(ee)\n else:\n dd.add(ee)\nprint(R)\n", "code2": "import sys;input=sys.stdin.readline\nN, = map(int, input().split())\nMOD=67280421310721\nS = []\nfor _ in range(N):\n s = input().strip()\n S.append(s)\nS.sort(key=lambda x:len(x))\nD = dict()\ndd = set()\nR = 0\nfor s in S:\n l = len(s)\n d = [0]*26\n for c in dd:\n d[c] += 1\n tmp=0\n for i in range(l-1, -1, -1):\n ee = ord(s[i]) - 97\n tmp = 100*tmp+(ee+1)\n tmp %= MOD\n R += d[ee]\n d[ee] = 0\n if tmp in D:\n for c in D[tmp]:\n d[c] += 1\n if i == 1:\n nn = tmp\n if l != 1:\n if nn not in D:\n D[nn] = set()\n D[nn].add(ee)\n else:\n dd.add(ee)\nprint(R)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597029341", "date2": "1597029944", "bleu_score": "0.9408173346968556", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 102, "input": "3\ncybxxa\ncyw\nbaa\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["import sys;input=sys.stdin.readline\nN, = map(int, input().split()) # (0): N=3\nMOD=998244353 # (1): MOD=998244353\nS = [] # (2): S=[]\nfor _ in range(N): # (3): _=0 (6): _=1 ... (12): NO CHANGE\n s = input().strip() # (4): s=cybxxa (7): s=cyw (10): s=baa\n S.append(s) # (5): S=['cybxxa'] (8): S=['cybxxa', 'cyw'] (11): S=['cybxxa', 'cyw', 'baa']\nS.sort(key=lambda x:len(x)) # (13): S=['cyw', 'baa', 'cybxxa']\nD = dict() # (14): D={}\ndd = set() # (15): dd=set()\nR = 0 # (16): R=0\nfor s in S: # (17): s=cyw (49): s=baa ... (137): NO CHANGE\n l = len(s) # (18): l=3 (50): NO CHANGE (82): l=6\n d = [0]*26 # (19): d=[0, 0, ..., 0, 0] (51): NO CHANGE (83): NO CHANGE\n for c in dd: # (20): NO CHANGE (52): NO CHANGE (84): NO CHANGE\n d[c] += 1\n tmp=0 # (21): tmp=0 (53): tmp=0 (85): tmp=0\n for i in range(l-1, -1, -1): # (22): i=2 (29): i=1 ... (132): NO CHANGE\n ee = ord(s[i]) - 97 # (23): ee=22 (30): ee=24 ... (126): ee=2\n tmp = 100*tmp+ee # (24): tmp=22 (31): tmp=2224 ... (127): tmp=2323012402\n R += d[ee] # (25): NO CHANGE (32): NO CHANGE ... (128): NO CHANGE\n d[ee] = 0 # (26): NO CHANGE (33): NO CHANGE ... (129): NO CHANGE\n if tmp in D: # (27): NO CHANGE (34): NO CHANGE ... (130): NO CHANGE\n for c in D[tmp]: # (92): c=1 (94): NO CHANGE\n d[c] += 1 # (93): d=[0, 1, ..., 0, 0]\n if i == 1: # (28): NO CHANGE (35): NO CHANGE ... (131): NO CHANGE\n nn = tmp # (36): nn=2224 (68): nn=0 (124): nn=23230124\n if l != 1: # (45): NO CHANGE (77): NO CHANGE (133): NO CHANGE\n if nn not in D: # (46): NO CHANGE (78): NO CHANGE (134): NO CHANGE\n D[nn] = set() # (47): D={2224: set()} (79): D={2224: {2}, 0: set()} (135): D={2224: {2}, 0: {1}, 23230124: set()}\n D[nn].add(ee) # (48): D={2224: {2}} (80): D={2224: {2}, 0: {1}} (136): D={2224: {2}, 0: {1}, 23230124: {2}}\n else:\n dd.add(ee)\nprint(R)\n"], "anno_status": [false], "diff_content": " import sys;input=sys.stdin.readline\n N, = map(int, input().split())\n-MOD=998244353\n+MOD=67280421310721\n S = []\n for _ in range(N):\n s = input().strip()\n S.append(s)\n S.sort(key=lambda x:len(x))\n D = dict()\n dd = set()\n R = 0\n for s in S:\n l = len(s)\n d = [0]*26\n for c in dd:\n d[c] += 1\n tmp=0\n for i in range(l-1, -1, -1):\n ee = ord(s[i]) - 97\n- tmp = 100*tmp+ee\n+ tmp = 100*tmp+(ee+1)\n+ tmp %= MOD\n R += d[ee]\n d[ee] = 0\n if tmp in D:\n for c in D[tmp]:\n d[c] += 1\n if i == 1:\n nn = tmp\n if l != 1:\n if nn not in D:\n D[nn] = set()\n D[nn].add(ee)\n else:\n dd.add(ee)\n print(R)\n \n", "FL_content": " import sys;input=sys.stdin.readline\n N, = map(int, input().split())\n-MOD=998244353\n S = []\n for _ in range(N):\n s = input().strip()\n S.append(s)\n S.sort(key=lambda x:len(x))\n D = dict()\n dd = set()\n R = 0\n for s in S:\n l = len(s)\n d = [0]*26\n for c in dd:\n d[c] += 1\n tmp=0\n for i in range(l-1, -1, -1):\n ee = ord(s[i]) - 97\n- tmp = 100*tmp+ee\n R += d[ee]\n d[ee] = 0\n if tmp in D:\n for c in D[tmp]:\n d[c] += 1\n if i == 1:\n nn = tmp\n if l != 1:\n if nn not in D:\n D[nn] = set()\n D[nn].add(ee)\n else:\n dd.add(ee)\n print(R)\n \n", "added_lines": 3, "removed_lines": 2, "code1_lines": 35 }, { "user_id": "u986478725", "problem_id": "p02404", "submission1_id": "s264826080", "submission2_id": "s587641435", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def numinput():\n a = input().split()\n for i in range(len(a)):\n a[i] = int(a[i])\n return a\n \ndef main():\n while True:\n a = numinput()\n if a[0] == 0 and a[1] == 0: break\n H = a[0]; W = a[1]\n for i in range(H):\n bar = \"\"\n for j in range(W):\n if i > 0 and i < H - 1 and j > 0 and j < W - 1: bar += \".\"\n else: bar += \"*\"\n if i < H - 1: print(bar)\n else: print(bar + '\\n')\n \nif __name__ == \"__main__\":\n main()\n", "code2": "def numinput():\n a = input().split()\n for i in range(len(a)):\n a[i] = int(a[i])\n return a\n \ndef main():\n while True:\n a = numinput()\n if a[0] == 0 and a[1] == 0: break\n H = a[0]; W = a[1]\n for i in range(H):\n bar = \"\"\n for j in range(W):\n if i > 0 and i < H - 1 and j > 0 and j < W - 1: bar += \".\"\n else: bar += \"\n if i < H - 1: print(bar)\n else: print(bar + '\\n')\n \nif __name__ == \"__main__\":\n main()\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1525936529", "date2": "1525936618", "bleu_score": "0.9919223297797368", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 8\n4 10\n4 4\n0 0\n", "actual_output": "********\n*......*\n********\n\n**********\n*........*\n*........*\n**********\n\n****\n*..*\n*..*\n****\n\n", "expected_output": "########\n#......#\n########\n\n##########\n#........#\n#........#\n##########\n\n####\n#..#\n#..#\n####\n\n\n", "anno_code": ["def numinput(): # (0): numinput=\n a = input().split()\n for i in range(len(a)):\n a[i] = int(a[i])\n return a\n \ndef main(): # (1): main=\n while True:\n a = numinput()\n if a[0] == 0 and a[1] == 0: break\n H = a[0]; W = a[1]\n for i in range(H):\n bar = \"\"\n for j in range(W):\n if i > 0 and i < H - 1 and j > 0 and j < W - 1: bar += \".\"\n else: bar += \"*\"\n if i < H - 1: print(bar)\n else: print(bar + '\\n')\n \nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " def numinput():\n a = input().split()\n for i in range(len(a)):\n a[i] = int(a[i])\n return a\n- \n+ \n def main():\n while True:\n a = numinput()\n if a[0] == 0 and a[1] == 0: break\n H = a[0]; W = a[1]\n for i in range(H):\n bar = \"\"\n for j in range(W):\n if i > 0 and i < H - 1 and j > 0 and j < W - 1: bar += \".\"\n- else: bar += \"*\"\n+ else: bar += \"\n if i < H - 1: print(bar)\n else: print(bar + '\\n')\n- \n+ \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": " def numinput():\n a = input().split()\n for i in range(len(a)):\n a[i] = int(a[i])\n return a\n- \n def main():\n while True:\n a = numinput()\n if a[0] == 0 and a[1] == 0: break\n H = a[0]; W = a[1]\n for i in range(H):\n bar = \"\"\n for j in range(W):\n if i > 0 and i < H - 1 and j > 0 and j < W - 1: bar += \".\"\n- else: bar += \"*\"\n if i < H - 1: print(bar)\n else: print(bar + '\\n')\n- \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 3, "removed_lines": 3, "code1_lines": 22 }, { "user_id": "u740284863", "problem_id": "p03254", "submission1_id": "s203161711", "submission2_id": "s667213072", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,x = map(int,input().split())\na = list(map(int,input().split()))\na.sort()\nans = 0\nfor i in a:\n if x - i >= 0:\n x -= i\n ans += 1\n else:\n break\nprint(ans)", "code2": "n,x = map(int,input().split())\na = list(map(int,input().split()))\na.sort()\nans = 0\nif sum(a) == x:\n ans = n\nelif sum(a) < x:\n ans = n - 1\nelse:\n for i in range(n):\n if a[i] <= x:\n ans += 1\n x -= a[i]\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1551156223", "date2": "1551157118", "bleu_score": "0.6332989452981678", "code1_test_status": [0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0], "code1_test_score": 70, "total_score": 104, "input": "3 66\n20 30 9\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["n,x = map(int,input().split()) # (0): n=3, x=66\na = list(map(int,input().split())) # (1): a=[20, 30, 9]\na.sort() # (2): a=[9, 20, 30]\nans = 0 # (3): ans=0\nfor i in a: # (4): i=9 (8): i=20 ... (16): NO CHANGE\n if x - i >= 0: # (5): NO CHANGE (9): NO CHANGE (13): NO CHANGE\n x -= i # (6): x=57 (10): x=37 (14): x=7\n ans += 1 # (7): ans=1 (11): ans=2 (15): ans=3\n else:\n break\nprint(ans)"], "anno_status": [true], "diff_content": " n,x = map(int,input().split())\n a = list(map(int,input().split()))\n a.sort()\n ans = 0\n-for i in a:\n- if x - i >= 0:\n- x -= i\n- ans += 1\n- else:\n- break\n+if sum(a) == x:\n+ ans = n\n+elif sum(a) < x:\n+ ans = n - 1\n+else:\n+ for i in range(n):\n+ if a[i] <= x:\n+ ans += 1\n+ x -= a[i]\n print(ans)\n+\n", "FL_content": " n,x = map(int,input().split())\n a = list(map(int,input().split()))\n a.sort()\n ans = 0\n-for i in a:\n- if x - i >= 0:\n- x -= i\n- ans += 1\n- else:\n- break\n print(ans)\n", "added_lines": 10, "removed_lines": 6, "code1_lines": 11 }, { "user_id": "u642012866", "problem_id": "p03254", "submission1_id": "s617050880", "submission2_id": "s147502989", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, X = map(int, input().split())\nA = list(map(int, input().split()))\nA.sort()\nres = 0\nfor a in A:\n if a > X:\n break\n res += 1\n X -= a\nif X > 0:\n res -= 1\nprint(max(res, 0))", "code2": "N, X = map(int, input().split())\nA = list(map(int, input().split()))\nA.sort()\nres = 0\nfor a in A:\n if a > X:\n break\n res += 1\n X -= a\nelse:\n if X > 0:\n res -= 1\nprint(max(res, 0))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591755947", "date2": "1591756199", "bleu_score": "0.9237815148444258", "code1_test_status": [1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 60, "total_score": 104, "input": "2 9\n20 1 10\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["N, X = map(int, input().split()) # (0): N=2, X=9\nA = list(map(int, input().split())) # (1): A=[20, 1, 10]\nA.sort() # (2): A=[1, 10, 20]\nres = 0 # (3): res=0\nfor a in A: # (4): a=1 (8): a=10\n if a > X: # (5): NO CHANGE (9): NO CHANGE\n break # (10): NO CHANGE\n res += 1 # (6): res=1\n X -= a # (7): X=8\nif X > 0: # (11): NO CHANGE\n res -= 1 # (12): res=0\nprint(max(res, 0))"], "anno_status": [true], "diff_content": " N, X = map(int, input().split())\n A = list(map(int, input().split()))\n A.sort()\n res = 0\n for a in A:\n if a > X:\n break\n res += 1\n X -= a\n-if X > 0:\n- res -= 1\n+else:\n+ if X > 0:\n+ res -= 1\n print(max(res, 0))\n", "FL_content": " N, X = map(int, input().split())\n A = list(map(int, input().split()))\n A.sort()\n res = 0\n for a in A:\n if a > X:\n break\n res += 1\n X -= a\n-if X > 0:\n- res -= 1\n print(max(res, 0))\n", "added_lines": 3, "removed_lines": 2, "code1_lines": 12 }, { "user_id": "u948524308", "problem_id": "p03254", "submission1_id": "s043979948", "submission2_id": "s744805793", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,x = map(int,input().split())\na = list(map(int,input().split()))\n\na.sort()\n\nif x=0:\n count+=1\n \nprint(count)", "code2": "n,x=[int(i) for i in input().split()]\na=[int(i) for i in input().split()]\na.sort()\ncount=0\nfor i in range(n):\n x-=a[i]\n if x>=0 and i=0: # (6): NO CHANGE (10): NO CHANGE (14): NO CHANGE\n count+=1 # (7): count=1 (11): count=2 (15): count=3\n \nprint(count)"], "anno_status": [true], "diff_content": " n,x=[int(i) for i in input().split()]\n a=[int(i) for i in input().split()]\n a.sort()\n count=0\n for i in range(n):\n x-=a[i]\n- if x>=0:\n+ if x>=0 and i=0:\n count+=1\n- \n print(count)\n", "added_lines": 4, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u117193815", "problem_id": "p03254", "submission1_id": "s174929946", "submission2_id": "s448897511", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,x=map(int, input().split())\nl=sorted(list(map(int, input().split())))\nans=0\nif x==sum(l):\n print(n)\nelif x>sum(l):\n print(n-1)\nelse:\n for i in range(n):\n if x-l[i]>=0:\n ans+=1\n else:\n print(ans)\n exit()\n print(ans-1) \n ", "code2": "n,x=map(int, input().split())\nl=sorted(list(map(int, input().split())))\nans=0\nif x==sum(l):\n print(n)\nelif x>sum(l):\n print(n-1)\nelse:\n for i in range(n):\n if x>=l[i]:\n ans+=1\n x=x-l[i]\n else:\n print(ans)\n exit()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577551137", "date2": "1577552786", "bleu_score": "0.9134798573599737", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 104, "input": "3 10\n20 4 10\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " n,x=map(int, input().split())\n l=sorted(list(map(int, input().split())))\n ans=0\n if x==sum(l):\n print(n)\n elif x>sum(l):\n print(n-1)\n else:\n for i in range(n):\n- if x-l[i]>=0:\n+ if x>=l[i]:\n ans+=1\n+ x=x-l[i]\n else:\n print(ans)\n exit()\n- print(ans-1) \n- \n", "FL_content": " n,x=map(int, input().split())\n l=sorted(list(map(int, input().split())))\n ans=0\n if x==sum(l):\n print(n)\n elif x>sum(l):\n print(n-1)\n else:\n for i in range(n):\n- if x-l[i]>=0:\n ans+=1\n else:\n print(ans)\n exit()\n- print(ans-1) \n- \n", "added_lines": 2, "removed_lines": 3, "code1_lines": 16 }, { "user_id": "u733738237", "problem_id": "p03254", "submission1_id": "s755385357", "submission2_id": "s785652437", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,x=[int(i) for i in input().split()]\na = [int(x) for x in input().split()]\na.sort()\ncnt=0\nfor k in range(N):\n\tif x-a[k] >= 0:\n\t\tx -= a[k]\n\t\tcnt += 1\t\t\n\telse:\n\t\tbreak\nif x>0:\n\tcnt -= 1\nprint(cnt)", "code2": "N,x=[int(i) for i in input().split()]\na = [int(x) for x in input().split()]\na.sort()\ncnt=0\nfor k in a:\n\tx -= k\n\tif x < 0:\n\t\tbreak\n\tcnt +=1\nif x >0:\n\tcnt -=1\nprint(cnt)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567545225", "date2": "1567546446", "bleu_score": "0.7653821113663238", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1], "code1_test_score": 50, "total_score": 104, "input": "3 70\n29 39 3\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["N,x=[int(i) for i in input().split()] # (0): N=3, x=70\na = [int(x) for x in input().split()] # (1): a=[29, 39, 3]\na.sort() # (2): a=[3, 29, 39]\ncnt=0 # (3): cnt=0\nfor k in range(N): # (4): k=0 (8): k=1 (12): k=2\n\tif x-a[k] >= 0: # (5): NO CHANGE (9): NO CHANGE (13): NO CHANGE\n\t\tx -= a[k] # (6): x=67 (10): x=38\n\t\tcnt += 1\t\t # (7): cnt=1 (11): cnt=2\n\telse:\n\t\tbreak # (14): NO CHANGE\nif x>0: # (15): NO CHANGE\n\tcnt -= 1 # (16): cnt=1\nprint(cnt)"], "anno_status": [true], "diff_content": " N,x=[int(i) for i in input().split()]\n a = [int(x) for x in input().split()]\n a.sort()\n cnt=0\n-for k in range(N):\n-\tif x-a[k] >= 0:\n-\t\tx -= a[k]\n-\t\tcnt += 1\t\t\n-\telse:\n+for k in a:\n+\tx -= k\n+\tif x < 0:\n \t\tbreak\n-if x>0:\n-\tcnt -= 1\n+\tcnt +=1\n+if x >0:\n+\tcnt -=1\n print(cnt)\n", "FL_content": " N,x=[int(i) for i in input().split()]\n a = [int(x) for x in input().split()]\n a.sort()\n cnt=0\n-for k in range(N):\n-\tif x-a[k] >= 0:\n-\t\tx -= a[k]\n-\t\tcnt += 1\t\t\n-\telse:\n \t\tbreak\n-if x>0:\n-\tcnt -= 1\n print(cnt)\n", "added_lines": 6, "removed_lines": 7, "code1_lines": 13 }, { "user_id": "u394721319", "problem_id": "p03254", "submission1_id": "s020695961", "submission2_id": "s138030969", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, x = map(int,input().split())\nli = list(map(int,input().split()))\n\nli.sort()\nans = 0\n\nfor i in range(n):\n x = x-li[i]\n if x < 0:\n ans = i\n break\n ans = i+1\nprint(ans)\n", "code2": "n, x = map(int,input().split())\nli = list(map(int,input().split()))\n\nli.sort()\nans = 0\n\nfor i in range(n):\n x = x-li[i]\n if x < 0:\n ans = i\n break\n ans = i+1\n\nif x > 0:\n ans -=1\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1544819665", "date2": "1544820748", "bleu_score": "0.8833353930433216", "code1_test_status": [0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0], "code1_test_score": 70, "total_score": 104, "input": "3 70\n4 24 5\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["n, x = map(int,input().split()) # (0): n=3, x=70\nli = list(map(int,input().split())) # (1): li=[4, 24, 5]\n\nli.sort() # (2): li=[4, 5, 24]\nans = 0 # (3): ans=0\n\nfor i in range(n): # (4): i=0 (8): i=1 ... (16): NO CHANGE\n x = x-li[i] # (5): x=66 (9): x=61 (13): x=37\n if x < 0: # (6): NO CHANGE (10): NO CHANGE (14): NO CHANGE\n ans = i\n break\n ans = i+1 # (7): ans=1 (11): ans=2 (15): ans=3\nprint(ans)\n"], "anno_status": [true], "diff_content": " n, x = map(int,input().split())\n li = list(map(int,input().split()))\n \n li.sort()\n ans = 0\n \n for i in range(n):\n- x = x-li[i]\n+ x = x-li[i]\n if x < 0:\n ans = i\n break\n ans = i+1\n+\n+if x > 0:\n+ ans -=1\n+\n print(ans)\n \n", "FL_content": " n, x = map(int,input().split())\n li = list(map(int,input().split()))\n \n li.sort()\n ans = 0\n \n for i in range(n):\n- x = x-li[i]\n if x < 0:\n ans = i\n break\n ans = i+1\n print(ans)\n \n", "added_lines": 5, "removed_lines": 1, "code1_lines": 14 }, { "user_id": "u733738237", "problem_id": "p03254", "submission1_id": "s526637426", "submission2_id": "s785652437", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,x=[int(i) for i in input().split()]\na = [int(x) for x in input().split()]\na.sort()\ncnt=0\nfor k in range(N):\n\tif x-a[k] >= 0:\n\t\tx -= a[k]\n\t\tcnt += 1\n\telse:\n\t\tbreak\nprint(cnt)", "code2": "N,x=[int(i) for i in input().split()]\na = [int(x) for x in input().split()]\na.sort()\ncnt=0\nfor k in a:\n\tx -= k\n\tif x < 0:\n\t\tbreak\n\tcnt +=1\nif x >0:\n\tcnt -=1\nprint(cnt)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567544723", "date2": "1567546446", "bleu_score": "0.7975869927235959", "code1_test_status": [0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0], "code1_test_score": 70, "total_score": 104, "input": "3 70\n4 17 5\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["N,x=[int(i) for i in input().split()] # (0): N=3, x=70\na = [int(x) for x in input().split()] # (1): a=[4, 17, 5]\na.sort() # (2): a=[4, 5, 17]\ncnt=0 # (3): cnt=0\nfor k in range(N): # (4): k=0 (8): k=1 ... (16): NO CHANGE\n\tif x-a[k] >= 0: # (5): NO CHANGE (9): NO CHANGE (13): NO CHANGE\n\t\tx -= a[k] # (6): x=66 (10): x=61 (14): x=44\n\t\tcnt += 1 # (7): cnt=1 (11): cnt=2 (15): cnt=3\n\telse:\n\t\tbreak\nprint(cnt)"], "anno_status": [true], "diff_content": " N,x=[int(i) for i in input().split()]\n a = [int(x) for x in input().split()]\n a.sort()\n cnt=0\n-for k in range(N):\n-\tif x-a[k] >= 0:\n-\t\tx -= a[k]\n-\t\tcnt += 1\n-\telse:\n+for k in a:\n+\tx -= k\n+\tif x < 0:\n \t\tbreak\n+\tcnt +=1\n+if x >0:\n+\tcnt -=1\n print(cnt)\n", "FL_content": " N,x=[int(i) for i in input().split()]\n a = [int(x) for x in input().split()]\n a.sort()\n cnt=0\n-for k in range(N):\n-\tif x-a[k] >= 0:\n-\t\tx -= a[k]\n-\t\tcnt += 1\n-\telse:\n \t\tbreak\n print(cnt)\n", "added_lines": 6, "removed_lines": 5, "code1_lines": 11 }, { "user_id": "u584529823", "problem_id": "p03254", "submission1_id": "s503282936", "submission2_id": "s248277399", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, x = map(int, input().split())\nalist = list(map(int, input().split()))\n\nmax = 0\nfor i in range(1, N + 1):\n if sum(sorted(alist)[:i]) <= x:\n max = i\nprint(max)", "code2": "N, x = map(int, input().split())\na = list(map(int, input().split()))\n\na.sort()\nmax = 0\nfor i in range(1, N + 1):\n if sum(a[:i]) <= x:\n max = i\nif sum(a[:N + 1]) < x:\n print(N - 1)\nelse:\n print(max)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560105155", "date2": "1560107604", "bleu_score": "0.7204032212748392", "code1_test_status": [0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0], "code1_test_score": 70, "total_score": 104, "input": "3 24\n0 2 5\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["N, x = map(int, input().split()) # (0): N=3, x=24\nalist = list(map(int, input().split())) # (1): alist=[0, 2, 5]\n\nmax = 0 # (2): max=0\nfor i in range(1, N + 1): # (3): i=1 (6): i=2 ... (12): NO CHANGE\n if sum(sorted(alist)[:i]) <= x: # (4): NO CHANGE (7): NO CHANGE (10): NO CHANGE\n max = i # (5): max=1 (8): max=2 (11): max=3\nprint(max)"], "anno_status": [true], "diff_content": " N, x = map(int, input().split())\n-alist = list(map(int, input().split()))\n+a = list(map(int, input().split()))\n \n+a.sort()\n max = 0\n for i in range(1, N + 1):\n- if sum(sorted(alist)[:i]) <= x:\n+ if sum(a[:i]) <= x:\n max = i\n-print(max)\n+if sum(a[:N + 1]) < x:\n+ print(N - 1)\n+else:\n+ print(max)\n", "FL_content": " N, x = map(int, input().split())\n-alist = list(map(int, input().split()))\n \n max = 0\n for i in range(1, N + 1):\n- if sum(sorted(alist)[:i]) <= x:\n max = i\n-print(max)\n", "added_lines": 7, "removed_lines": 3, "code1_lines": 8 }, { "user_id": "u426649993", "problem_id": "p03254", "submission1_id": "s125114477", "submission2_id": "s483350380", "status1": "Wrong Answer", "status2": "Accepted", "code1": "if __name__ == \"__main__\":\n n, x = map(int, input().split())\n a = list(map(int, input().split()))\n\n if sum(a) == x:\n print(n)\n exit()\n\n a.sort()\n\n ans = 0\n tmp = 0\n for aa in a:\n if tmp < x and aa <= x-tmp:\n tmp += aa\n ans += 1\n if tmp == x:\n print(ans)\n exit()\n if x-tmp > 0:\n ans -= 1\n\n print(ans)\n", "code2": "if __name__ == \"__main__\":\n n, x = map(int, input().split())\n a = list(map(int, input().split()))\n\n if sum(a) == x:\n print(n)\n exit()\n\n a.sort()\n\n ans = 0\n for i in range(n):\n if sum(a[:i+1]) <= x:\n ans = i+1\n else:\n print(i)\n exit()\n\n if sum(a[:ans]) == x:\n print(ans)\n else:\n print(ans-1)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587341726", "date2": "1587341982", "bleu_score": "0.7991020448854764", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1], "code1_test_score": 50, "total_score": 104, "input": "2 10\n29 20\n", "actual_output": "-1\n", "expected_output": "0\n\n", "anno_code": ["if __name__ == \"__main__\":\n n, x = map(int, input().split())\n a = list(map(int, input().split()))\n\n if sum(a) == x:\n print(n)\n exit()\n\n a.sort()\n\n ans = 0\n tmp = 0\n for aa in a:\n if tmp < x and aa <= x-tmp:\n tmp += aa\n ans += 1\n if tmp == x:\n print(ans)\n exit()\n if x-tmp > 0:\n ans -= 1\n\n print(ans)\n"], "anno_status": [true], "diff_content": " if __name__ == \"__main__\":\n n, x = map(int, input().split())\n a = list(map(int, input().split()))\n \n if sum(a) == x:\n print(n)\n exit()\n \n a.sort()\n \n ans = 0\n- tmp = 0\n- for aa in a:\n- if tmp < x and aa <= x-tmp:\n- tmp += aa\n- ans += 1\n- if tmp == x:\n- print(ans)\n+ for i in range(n):\n+ if sum(a[:i+1]) <= x:\n+ ans = i+1\n+ else:\n+ print(i)\n exit()\n- if x-tmp > 0:\n- ans -= 1\n \n- print(ans)\n+ if sum(a[:ans]) == x:\n+ print(ans)\n+ else:\n+ print(ans-1)\n \n", "FL_content": " if __name__ == \"__main__\":\n n, x = map(int, input().split())\n a = list(map(int, input().split()))\n \n if sum(a) == x:\n print(n)\n exit()\n \n a.sort()\n \n ans = 0\n- tmp = 0\n- for aa in a:\n- if tmp < x and aa <= x-tmp:\n- tmp += aa\n- ans += 1\n- if tmp == x:\n- print(ans)\n exit()\n- if x-tmp > 0:\n- ans -= 1\n \n- print(ans)\n \n", "added_lines": 9, "removed_lines": 10, "code1_lines": 24 }, { "user_id": "u318430977", "problem_id": "p02276", "submission1_id": "s664651014", "submission2_id": "s719249076", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def partition(a, p, r):\n x = a[r]\n i = p - 1\n for j in range(p, r):\n if a[j] <= x:\n i += 1\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n tmp = a[i+1]\n a[i+1] = a[r]\n a[r] = tmp\n return i + 1, x\n\n\ndef print_list_split_whitespace(a, x):\n flag = False\n for y in a[:-1]:\n if x != y:\n print(y, end=\" \")\n else:\n print(\"[\" + str(y) + \"]\", end=\" \")\n flag = True\n if flag:\n print(a[-1])\n else:\n print(\"[\" + str(a[-1]) + \"]\", end=\" \")\n\n\nn = int(input())\na = [int(x) for x in input().split()]\n\nq, x = partition(a, 0, n - 1)\n\nprint_list_split_whitespace(a, x)\n", "code2": "def partition(a, p, r):\n x = a[r]\n i = p - 1\n for j in range(p, r):\n if a[j] <= x:\n i += 1\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n tmp = a[i+1]\n a[i+1] = a[r]\n a[r] = tmp\n return i + 1, x\n\n\ndef print_list_split_whitespace(a, x):\n ind = 0\n for i, y in enumerate(a):\n if x == y:\n ind = i\n for i in range(len(a) - 1):\n if i == ind:\n print(\"[\" + str(a[i]) + \"]\", end=\" \")\n else:\n print(a[i], end=\" \")\n if ind == len(a) - 1:\n print(\"[\" + str(a[-1]) + \"]\")\n else:\n print(a[-1])\n\n\nn = int(input())\na = [int(x) for x in input().split()]\n\nq, x = partition(a, 0, n - 1)\n\nprint_list_split_whitespace(a, x)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1528728308", "date2": "1528728798", "bleu_score": "0.8537891592479787", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 100, "total_score": 101, "input": "12\n40 19 9 1 12 8 8 6 21 0 10 1\n", "actual_output": "[1] 0 [1] 40 12 8 8 6 21 19 10 9\n", "expected_output": "1 0 [1] 40 12 8 8 6 21 19 10 9\n\n", "anno_code": ["def partition(a, p, r): # (0): partition=\n x = a[r] # (5): x=1\n i = p - 1 # (6): i=-1\n for j in range(p, r): # (7): j=0 (9): j=1 ... (37): NO CHANGE\n if a[j] <= x: # (8): NO CHANGE (10): NO CHANGE ... (36): NO CHANGE\n i += 1 # (15): i=0 (31): i=1\n tmp = a[i] # (16): tmp=40 (32): tmp=19\n a[i] = a[j] # (17): a=[1, 19, 9, 1, 12, 8, 8, 6, 21, 0, 10, 1] (33): a=[1, 0, 9, 40, 12, 8, 8, 6, 21, 0, 10, 1]\n a[j] = tmp # (18): a=[1, 19, 9, 40, 12, 8, 8, 6, 21, 0, 10, 1] (34): a=[1, 0, 9, 40, 12, 8, 8, 6, 21, 19, 10, 1]\n tmp = a[i+1] # (38): tmp=9\n a[i+1] = a[r] # (39): a=[1, 0, 1, 40, 12, 8, 8, 6, 21, 19, 10, 1]\n a[r] = tmp # (40): partition=, print_list_split_whitespace=, n=12, a=[1, 0, 1, 40, 12, 8, 8, 6, 21, 19, 10, 9], q=2\n return i + 1, x\n\n\ndef print_list_split_whitespace(a, x): # (1): print_list_split_whitespace=\n flag = False # (42): flag=False\n for y in a[:-1]: # (43): y=1 (47): y=0 ... (78): NO CHANGE\n if x != y: # (44): NO CHANGE (48): NO CHANGE ... (76): NO CHANGE\n print(y, end=\" \") # (49): NO CHANGE (56): NO CHANGE ... (77): NO CHANGE\n else:\n print(\"[\" + str(y) + \"]\", end=\" \") # (45): NO CHANGE (52): NO CHANGE\n flag = True # (46): flag=True (53): NO CHANGE\n if flag: # (79): NO CHANGE\n print(a[-1])\n else:\n print(\"[\" + str(a[-1]) + \"]\", end=\" \")\n\n\nn = int(input()) # (2): n=12\na = [int(x) for x in input().split()] # (3): a=[40, 19, 9, 1, 12, 8, 8, 6, 21, 0, 10, 1]\n\nq, x = partition(a, 0, n - 1) # (4): p=0, r=11\n\nprint_list_split_whitespace(a, x) # (41): NO CHANGE\n"], "anno_status": [false], "diff_content": " def partition(a, p, r):\n x = a[r]\n i = p - 1\n for j in range(p, r):\n if a[j] <= x:\n i += 1\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n tmp = a[i+1]\n a[i+1] = a[r]\n a[r] = tmp\n return i + 1, x\n \n \n def print_list_split_whitespace(a, x):\n- flag = False\n- for y in a[:-1]:\n- if x != y:\n- print(y, end=\" \")\n+ ind = 0\n+ for i, y in enumerate(a):\n+ if x == y:\n+ ind = i\n+ for i in range(len(a) - 1):\n+ if i == ind:\n+ print(\"[\" + str(a[i]) + \"]\", end=\" \")\n else:\n- print(\"[\" + str(y) + \"]\", end=\" \")\n- flag = True\n- if flag:\n- print(a[-1])\n+ print(a[i], end=\" \")\n+ if ind == len(a) - 1:\n+ print(\"[\" + str(a[-1]) + \"]\")\n else:\n- print(\"[\" + str(a[-1]) + \"]\", end=\" \")\n+ print(a[-1])\n \n \n n = int(input())\n a = [int(x) for x in input().split()]\n \n q, x = partition(a, 0, n - 1)\n \n print_list_split_whitespace(a, x)\n \n", "FL_content": " def partition(a, p, r):\n x = a[r]\n i = p - 1\n for j in range(p, r):\n if a[j] <= x:\n i += 1\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n tmp = a[i+1]\n a[i+1] = a[r]\n a[r] = tmp\n return i + 1, x\n \n \n def print_list_split_whitespace(a, x):\n- flag = False\n- for y in a[:-1]:\n- if x != y:\n- print(y, end=\" \")\n else:\n- print(\"[\" + str(y) + \"]\", end=\" \")\n- flag = True\n- if flag:\n- print(a[-1])\n else:\n- print(\"[\" + str(a[-1]) + \"]\", end=\" \")\n \n \n n = int(input())\n a = [int(x) for x in input().split()]\n \n q, x = partition(a, 0, n - 1)\n \n print_list_split_whitespace(a, x)\n \n", "added_lines": 11, "removed_lines": 9, "code1_lines": 36 }, { "user_id": "u742013327", "problem_id": "p02276", "submission1_id": "s652250665", "submission2_id": "s732194928", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\ndef partition(target_list):\n x = target_list[-1]\n i = -1\n\n for j in range(len(target_list))[:-1]:\n if target_list[j] <= x:\n i = i+1\n tmp = target_list[i]\n target_list[i] = target_list[j]\n target_list[j] = tmp\n tmp = target_list[-1]\n target_list[-1] = target_list[i + 1]\n target_list[i + 1] = tmp\n \n return i + 1\n\ndef convert(l):\n return \" \".join([str(n) for n in l])\n\nif __name__ == \"__main__\":\n n_list = int(input())\n target_list = [int(n) for n in input().split()]\n\n center_index = partition(target_list)\n print(convert(target_list[:center_index]) + \" [\"+ str(target_list[center_index]) + \"] \" + convert(target_list[center_index:]))", "code2": "\n\n\ndef partition(target_list):\n x = target_list[-1]\n i = -1\n\n for j in range(len(target_list))[:-1]:\n if target_list[j] <= x:\n i = i+1\n tmp = target_list[i]\n target_list[i] = target_list[j]\n target_list[j] = tmp\n tmp = target_list[-1]\n target_list[-1] = target_list[i + 1]\n target_list[i + 1] = tmp\n \n return i + 1\n\ndef convert(l):\n return \" \".join([str(n) for n in l])\n\nif __name__ == \"__main__\":\n n_list = int(input())\n target_list = [int(n) for n in input().split()]\n\n center_index = partition(target_list)\n print(convert(target_list[:center_index]) + \" [\"+ str(target_list[center_index]) + \"] \" + convert(target_list[center_index + 1:]))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1478601274", "date2": "1478601341", "bleu_score": "0.9924673522795004", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "12\n23 19 9 9 23 8 10 4 13 -1 10 22\n", "actual_output": "19 9 9 8 10 4 13 -1 10 [22] 22 23 23\n", "expected_output": "19 9 9 8 10 4 13 -1 10 [22] 23 23\n\n", "anno_code": ["\n\n\ndef partition(target_list): # (0): partition=\n x = target_list[-1]\n i = -1\n\n for j in range(len(target_list))[:-1]:\n if target_list[j] <= x:\n i = i+1\n tmp = target_list[i]\n target_list[i] = target_list[j]\n target_list[j] = tmp\n tmp = target_list[-1]\n target_list[-1] = target_list[i + 1]\n target_list[i + 1] = tmp\n \n return i + 1\n\ndef convert(l): # (1): convert=\n return \" \".join([str(n) for n in l])\n\nif __name__ == \"__main__\":\n n_list = int(input())\n target_list = [int(n) for n in input().split()]\n\n center_index = partition(target_list)\n print(convert(target_list[:center_index]) + \" [\"+ str(target_list[center_index]) + \"] \" + convert(target_list[center_index:]))"], "anno_status": [true], "diff_content": " \n \n \n def partition(target_list):\n x = target_list[-1]\n i = -1\n \n for j in range(len(target_list))[:-1]:\n if target_list[j] <= x:\n i = i+1\n tmp = target_list[i]\n target_list[i] = target_list[j]\n target_list[j] = tmp\n tmp = target_list[-1]\n target_list[-1] = target_list[i + 1]\n target_list[i + 1] = tmp\n \n return i + 1\n \n def convert(l):\n return \" \".join([str(n) for n in l])\n \n if __name__ == \"__main__\":\n n_list = int(input())\n target_list = [int(n) for n in input().split()]\n \n center_index = partition(target_list)\n- print(convert(target_list[:center_index]) + \" [\"+ str(target_list[center_index]) + \"] \" + convert(target_list[center_index:]))\n+ print(convert(target_list[:center_index]) + \" [\"+ str(target_list[center_index]) + \"] \" + convert(target_list[center_index + 1:]))\n", "FL_content": " \n \n \n def partition(target_list):\n x = target_list[-1]\n i = -1\n \n for j in range(len(target_list))[:-1]:\n if target_list[j] <= x:\n i = i+1\n tmp = target_list[i]\n target_list[i] = target_list[j]\n target_list[j] = tmp\n tmp = target_list[-1]\n target_list[-1] = target_list[i + 1]\n target_list[i + 1] = tmp\n \n return i + 1\n \n def convert(l):\n return \" \".join([str(n) for n in l])\n \n if __name__ == \"__main__\":\n n_list = int(input())\n target_list = [int(n) for n in input().split()]\n \n center_index = partition(target_list)\n- print(convert(target_list[:center_index]) + \" [\"+ str(target_list[center_index]) + \"] \" + convert(target_list[center_index:]))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 28 }, { "user_id": "u300095814", "problem_id": "p02276", "submission1_id": "s531089197", "submission2_id": "s160994108", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nA = list(map(int, input().split()))\n\ndef partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x :\n i += 1\n A[i], A[j] = A[j], A[i]\n\n A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n\nb = partition(A, 0, n-1)\nA[b] = '[{0}]'.format(b)\nprint(' '.join(map(str, A)))\n", "code2": "n = int(input())\nA = list(map(int, input().split()))\n\ndef partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x :\n i += 1\n A[i], A[j] = A[j], A[i]\n\n A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n\nb = partition(A, 0, n-1)\nA[b] = '[{0}]'.format(A[b])\nprint(' '.join(map(str, A)))\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1530596872", "date2": "1530596935", "bleu_score": "0.9847371323849777", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 101, "input": "12\n40 19 9 1 12 8 8 6 21 0 10 22\n", "actual_output": "19 9 1 12 8 8 6 21 0 10 [10] 40\n", "expected_output": "19 9 1 12 8 8 6 21 0 10 [22] 40\n\n", "anno_code": ["n = int(input()) # (0): n=12\nA = list(map(int, input().split())) # (1): A=[40, 19, 9, 1, 12, 8, 8, 6, 21, 0, 10, 22]\n\ndef partition(A, p, r): # (2): partition=\n x = A[r] # (4): x=22\n i = p - 1 # (5): i=-1\n for j in range(p, r): # (6): j=0 (8): j=1 ... (48): NO CHANGE\n if A[j] <= x : # (7): NO CHANGE (9): NO CHANGE ... (45): NO CHANGE\n i += 1 # (10): i=0 (14): i=1 ... (46): i=9\n A[i], A[j] = A[j], A[i] # (11): A=[19, 40, 9, 1, 12, 8, 8, 6, 21, 0, 10, 22] (15): A=[19, 9, 40, 1, 12, 8, 8, 6, 21, 0, 10, 22] ... (47): A=[19, 9, 1, 12, 8, 8, 6, 21, 0, 10, 40, 22]\n\n A[i + 1], A[r] = A[r], A[i + 1] # (49): n=12, A=[19, 9, 1, 12, 8, 8, 6, 21, 0, 10, 22, 40], partition=, b=10\n return i + 1\n\nb = partition(A, 0, n-1) # (3): p=0, r=11\nA[b] = '[{0}]'.format(b) # (50): A=[19, 9, 1, 12, 8, 8, 6, 21, 0, 10, '[10]', 40]\nprint(' '.join(map(str, A)))\n"], "anno_status": [true], "diff_content": " n = int(input())\n A = list(map(int, input().split()))\n \n def partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x :\n i += 1\n A[i], A[j] = A[j], A[i]\n \n A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n \n b = partition(A, 0, n-1)\n-A[b] = '[{0}]'.format(b)\n+A[b] = '[{0}]'.format(A[b])\n print(' '.join(map(str, A)))\n \n", "FL_content": " n = int(input())\n A = list(map(int, input().split()))\n \n def partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x :\n i += 1\n A[i], A[j] = A[j], A[i]\n \n A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n \n b = partition(A, 0, n-1)\n-A[b] = '[{0}]'.format(b)\n print(' '.join(map(str, A)))\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 18 }, { "user_id": "u554503378", "problem_id": "p02276", "submission1_id": "s829896433", "submission2_id": "s860096142", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nlst_n = list(map(int,input().split()))\nx = lst_n[n-1]\nleft = []\nright = []\ni = -1\nfor j in range(0,n-1):\n if lst_n[j] <= x:\n i += 1\n lst_n[i],lst_n[j] = lst_n[j],lst_n[i]\ni += 1\nlst_n[i],lst_n[n-1] = lst_n[n-1],lst_n[i]\n\nans = ['['+str(k)+']' if k == x else str(k) for k in lst_n]\nprint(' '.join(ans))\n", "code2": "n = int(input())\nlst_n = list(map(int,input().split()))\nx = lst_n[n-1]\nleft = []\nright = []\ni = -1\nfor j in range(0,n-1):\n if lst_n[j] <= x:\n i += 1\n lst_n[i],lst_n[j] = lst_n[j],lst_n[i]\ni += 1\nlst_n[i],lst_n[n-1] = lst_n[n-1],lst_n[i]\n\nans = ['['+str(lst_n[k])+']' if k == i else str(lst_n[k])\n for k in range(len(lst_n))]\nprint(' '.join(ans))\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1546085334", "date2": "1546085463", "bleu_score": "0.878644509273134", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 100, "total_score": 101, "input": "12\n40 19 9 1 12 8 8 6 21 0 10 1\n", "actual_output": "[1] 0 [1] 40 12 8 8 6 21 19 10 9\n", "expected_output": "1 0 [1] 40 12 8 8 6 21 19 10 9\n\n", "anno_code": ["n = int(input()) # (0): n=12\nlst_n = list(map(int,input().split())) # (1): lst_n=[40, 19, 9, 1, 12, 8, 8, 6, 21, 0, 10, 1]\nx = lst_n[n-1] # (2): x=1\nleft = [] # (3): left=[]\nright = [] # (4): right=[]\ni = -1 # (5): i=-1\nfor j in range(0,n-1): # (6): j=0 (8): j=1 ... (32): NO CHANGE\n if lst_n[j] <= x: # (7): NO CHANGE (9): NO CHANGE ... (31): NO CHANGE\n i += 1 # (14): i=0 (28): i=1\n lst_n[i],lst_n[j] = lst_n[j],lst_n[i] # (15): lst_n=[1, 19, 9, 40, 12, 8, 8, 6, 21, 0, 10, 1] (29): lst_n=[1, 0, 9, 40, 12, 8, 8, 6, 21, 19, 10, 1]\ni += 1 # (33): i=2\nlst_n[i],lst_n[n-1] = lst_n[n-1],lst_n[i] # (34): lst_n=[1, 0, 1, 40, 12, 8, 8, 6, 21, 19, 10, 9]\n\nans = ['['+str(k)+']' if k == x else str(k) for k in lst_n] # (35): ans=['[1]', '0', '[1]', '40', '12', '8', '8', '6', '21', '19', '10', '9']\nprint(' '.join(ans))\n"], "anno_status": [true], "diff_content": " n = int(input())\n lst_n = list(map(int,input().split()))\n x = lst_n[n-1]\n left = []\n right = []\n i = -1\n for j in range(0,n-1):\n if lst_n[j] <= x:\n i += 1\n lst_n[i],lst_n[j] = lst_n[j],lst_n[i]\n i += 1\n lst_n[i],lst_n[n-1] = lst_n[n-1],lst_n[i]\n \n-ans = ['['+str(k)+']' if k == x else str(k) for k in lst_n]\n+ans = ['['+str(lst_n[k])+']' if k == i else str(lst_n[k])\n+ for k in range(len(lst_n))]\n print(' '.join(ans))\n \n", "FL_content": " n = int(input())\n lst_n = list(map(int,input().split()))\n x = lst_n[n-1]\n left = []\n right = []\n i = -1\n for j in range(0,n-1):\n if lst_n[j] <= x:\n i += 1\n lst_n[i],lst_n[j] = lst_n[j],lst_n[i]\n i += 1\n lst_n[i],lst_n[n-1] = lst_n[n-1],lst_n[i]\n \n-ans = ['['+str(k)+']' if k == x else str(k) for k in lst_n]\n print(' '.join(ans))\n \n", "added_lines": 2, "removed_lines": 1, "code1_lines": 16 }, { "user_id": "u519227872", "problem_id": "p02276", "submission1_id": "s911280967", "submission2_id": "s531932459", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nA = list(map(int, input().split()))\n\ndef partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n\ni = partition(A, 0, n-1)\nprint(' '.join(map(str, A[:i])) + ' [' + str(A[i]) + '] ' + ' '.join(map(str, A[i:])))", "code2": "n = int(input())\nA = list(map(int, input().split()))\n\ndef partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n\ni = partition(A, 0, n-1)\nprint(' '.join(map(str, A[:i])) + ' [' + str(A[i]) + '] ' + ' '.join(map(str, A[i+1:])))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1502019536", "date2": "1502019578", "bleu_score": "0.9906155308368195", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "12\n74 19 6 2 12 7 0 5 21 -1 10 22\n", "actual_output": "19 6 2 12 7 0 5 21 -1 10 [22] 22 74\n", "expected_output": "19 6 2 12 7 0 5 21 -1 10 [22] 74\n\n", "anno_code": ["n = int(input()) # (0): n=12\nA = list(map(int, input().split())) # (1): A=[74, 19, 6, 2, 12, 7, 0, 5, 21, -1, 10, 22]\n\ndef partition(A, p, r): # (2): partition=\n x = A[r] # (4): x=22\n i = p - 1 # (5): i=-1\n for j in range(p, r): # (6): j=0 (8): j=1 ... (48): NO CHANGE\n if A[j] <= x: # (7): NO CHANGE (9): NO CHANGE ... (45): NO CHANGE\n i += 1 # (10): i=0 (14): i=1 ... (46): i=9\n A[i], A[j] = A[j], A[i] # (11): A=[19, 74, 6, 2, 12, 7, 0, 5, 21, -1, 10, 22] (15): A=[19, 6, 74, 2, 12, 7, 0, 5, 21, -1, 10, 22] ... (47): A=[19, 6, 2, 12, 7, 0, 5, 21, -1, 10, 74, 22]\n A[i + 1], A[r] = A[r], A[i + 1] # (49): n=12, A=[19, 6, 2, 12, 7, 0, 5, 21, -1, 10, 22, 74], partition=, i=10\n return i + 1\n\ni = partition(A, 0, n-1) # (3): p=0, r=11\nprint(' '.join(map(str, A[:i])) + ' [' + str(A[i]) + '] ' + ' '.join(map(str, A[i:])))"], "anno_status": [true], "diff_content": " n = int(input())\n A = list(map(int, input().split()))\n \n def partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n \n i = partition(A, 0, n-1)\n-print(' '.join(map(str, A[:i])) + ' [' + str(A[i]) + '] ' + ' '.join(map(str, A[i:])))\n+print(' '.join(map(str, A[:i])) + ' [' + str(A[i]) + '] ' + ' '.join(map(str, A[i+1:])))\n", "FL_content": " n = int(input())\n A = list(map(int, input().split()))\n \n def partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n \n i = partition(A, 0, n-1)\n-print(' '.join(map(str, A[:i])) + ' [' + str(A[i]) + '] ' + ' '.join(map(str, A[i:])))\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u300946041", "problem_id": "p02276", "submission1_id": "s095230858", "submission2_id": "s667747960", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\ndef partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n A[i + 1], A[r] = A[r], A[i]\n return i + 1\n\n\ndef main():\n n = int(input())\n A = [int(e) for e in input().split()]\n p = 0\n r = len(A) - 1\n idx = partition(A, p, r)\n A = [str(e) for e in A]\n A[idx] = \"[{}]\".format(A[idx])\n return \" \".join(A)\n\n\nmain()", "code2": "\n\n\ndef partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n\n\ndef main():\n n = int(input())\n A = [int(e) for e in input().split()]\n p = 0\n idx = partition(A, p, n - 1)\n A = [str(e) for e in A]\n A[idx] = \"[{}]\".format(A[idx])\n return \" \".join(A)\n\n\nprint(main())", "original_language1": "Python3", "original_language2": "Python3", "date1": "1490582429", "date2": "1490582742", "bleu_score": "0.9525355959568377", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "12\n13 19 9 5 12 8 7 4 21 2 10 11\n", "actual_output": "", "expected_output": "9 5 8 7 4 2 10 [11] 21 13 19 12\n\n", "anno_code": ["\n\n\ndef partition(A, p, r): # (0): partition=\n x = A[r] # (8): x=11\n i = p - 1 # (9): i=-1\n for j in range(p, r): # (10): j=0 (12): j=1 ... (46): NO CHANGE\n if A[j] <= x: # (11): NO CHANGE (13): NO CHANGE ... (43): NO CHANGE\n i += 1 # (16): i=0 (20): i=1 ... (44): i=6\n A[i], A[j] = A[j], A[i] # (17): A=[9, 19, 13, 5, 12, 8, 7, 4, 21, 2, 10, 11] (21): A=[9, 5, 13, 19, 12, 8, 7, 4, 21, 2, 10, 11] ... (45): A=[9, 5, 8, 7, 4, 2, 10, 12, 21, 13, 19, 11]\n A[i + 1], A[r] = A[r], A[i] # (47): n=12, A=[9, 5, 8, 7, 4, 2, 10, 11, 21, 13, 19, 10], idx=7\n return i + 1\n\n\ndef main(): # (1): main=\n n = int(input()) # (3): n=12\n A = [int(e) for e in input().split()] # (4): A=[13, 19, 9, 5, 12, 8, 7, 4, 21, 2, 10, 11]\n p = 0 # (5): p=0\n r = len(A) - 1 # (6): r=11\n idx = partition(A, p, r) # (7): NO CHANGE\n A = [str(e) for e in A] # (48): A=['9', '5', '8', '7', '4', '2', '10', '11', '21', '13', '19', '10']\n A[idx] = \"[{}]\".format(A[idx])\n return \" \".join(A)\n\n\nmain() # (2): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n \n \n def partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n- A[i + 1], A[r] = A[r], A[i]\n+ A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n \n \n def main():\n n = int(input())\n A = [int(e) for e in input().split()]\n p = 0\n- r = len(A) - 1\n- idx = partition(A, p, r)\n+ idx = partition(A, p, n - 1)\n A = [str(e) for e in A]\n A[idx] = \"[{}]\".format(A[idx])\n return \" \".join(A)\n \n \n-main()\n+print(main())\n", "FL_content": " \n \n \n def partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n- A[i + 1], A[r] = A[r], A[i]\n return i + 1\n \n \n def main():\n n = int(input())\n A = [int(e) for e in input().split()]\n p = 0\n- r = len(A) - 1\n- idx = partition(A, p, r)\n A = [str(e) for e in A]\n A[idx] = \"[{}]\".format(A[idx])\n return \" \".join(A)\n \n \n-main()\n", "added_lines": 3, "removed_lines": 4, "code1_lines": 26 }, { "user_id": "u605879293", "problem_id": "p02276", "submission1_id": "s774966951", "submission2_id": "s453131144", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def partition(array, p, r):\n x = array[r]\n i = p-1\n for j in range(p, r):\n if array[j] <= x:\n i += 1\n array[i], array[j] = array[j], array[i]\n array[i+1], array[r] = array[r], array[i+1]\n a1 = array[:i+1]\n a2 = \"[\" + str(array[i+1]) + \"]\"\n a3 = array[i+1:]\n array = a1[:]\n array.append(a2)\n array += a3\n print(*array)\n return i+1\n\nn = int(input())\narray = [int(a) for a in input().split()]\np = partition(array, 0, n-1)\n", "code2": "def partition(array, p, r):\n x = array[r]\n i = p-1\n for j in range(p, r):\n if array[j] <= x:\n i += 1\n array[i], array[j] = array[j], array[i]\n array[i+1], array[r] = array[r], array[i+1]\n a1 = array[:i+1]\n a2 = \"[\" + str(array[i+1]) + \"]\"\n a3 = array[i+2:]\n array = a1[:]\n array.append(a2)\n array += a3\n print(*array)\n return i+1\n\nn = int(input())\narray = [int(a) for a in input().split()]\np = partition(array, 0, n-1)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1529725973", "date2": "1529726083", "bleu_score": "0.9948212790032804", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "12\n63 19 22 2 12 11 0 5 21 -1 0 37\n", "actual_output": "19 22 2 12 11 0 5 21 -1 0 [37] 37 63\n", "expected_output": "19 22 2 12 11 0 5 21 -1 0 [37] 63\n\n", "anno_code": ["def partition(array, p, r): # (0): partition=\n x = array[r] # (4): x=37\n i = p-1 # (5): i=-1\n for j in range(p, r): # (6): j=0 (8): j=1 ... (48): NO CHANGE\n if array[j] <= x: # (7): NO CHANGE (9): NO CHANGE ... (45): NO CHANGE\n i += 1 # (10): i=0 (14): i=1 ... (46): i=9\n array[i], array[j] = array[j], array[i] # (11): array=[19, 63, 22, 2, 12, 11, 0, 5, 21, -1, 0, 37] (15): array=[19, 22, 63, 2, 12, 11, 0, 5, 21, -1, 0, 37] ... (47): array=[19, 22, 2, 12, 11, 0, 5, 21, -1, 0, 63, 37]\n array[i+1], array[r] = array[r], array[i+1] # (49): array=[19, 22, 2, 12, 11, 0, 5, 21, -1, 0, 37, 63]\n a1 = array[:i+1] # (50): a1=[19, 22, 2, 12, 11, 0, 5, 21, -1, 0]\n a2 = \"[\" + str(array[i+1]) + \"]\" # (51): a2=[37]\n a3 = array[i+1:] # (52): a3=[37, 63]\n array = a1[:] # (53): array=[19, 22, 2, 12, 11, 0, 5, 21, -1, 0]\n array.append(a2) # (54): array=[19, 22, 2, 12, 11, 0, 5, 21, -1, 0, '[37]']\n array += a3 # (55): array=[19, 22, 2, 12, 11, 0, 5, 21, -1, 0, '[37]', 37, 63]\n print(*array)\n return i+1\n\nn = int(input()) # (1): n=12\narray = [int(a) for a in input().split()] # (2): array=[63, 19, 22, 2, 12, 11, 0, 5, 21, -1, 0, 37]\np = partition(array, 0, n-1) # (3): p=0, r=11\n"], "anno_status": [true], "diff_content": " def partition(array, p, r):\n x = array[r]\n i = p-1\n for j in range(p, r):\n if array[j] <= x:\n i += 1\n array[i], array[j] = array[j], array[i]\n array[i+1], array[r] = array[r], array[i+1]\n a1 = array[:i+1]\n a2 = \"[\" + str(array[i+1]) + \"]\"\n- a3 = array[i+1:]\n+ a3 = array[i+2:]\n array = a1[:]\n array.append(a2)\n array += a3\n print(*array)\n return i+1\n \n n = int(input())\n array = [int(a) for a in input().split()]\n p = partition(array, 0, n-1)\n \n", "FL_content": " def partition(array, p, r):\n x = array[r]\n i = p-1\n for j in range(p, r):\n if array[j] <= x:\n i += 1\n array[i], array[j] = array[j], array[i]\n array[i+1], array[r] = array[r], array[i+1]\n a1 = array[:i+1]\n a2 = \"[\" + str(array[i+1]) + \"]\"\n- a3 = array[i+1:]\n array = a1[:]\n array.append(a2)\n array += a3\n print(*array)\n return i+1\n \n n = int(input())\n array = [int(a) for a in input().split()]\n p = partition(array, 0, n-1)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 21 }, { "user_id": "u300946041", "problem_id": "p02276", "submission1_id": "s013477116", "submission2_id": "s667747960", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\ndef partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n A[i + 1], A[r] = A[r], A[i]\n return i + 1\n\n\ndef main():\n n = int(input())\n A = [int(e) for e in input().split()]\n p = 0\n idx = partition(A, p, n - 1)\n A = [str(e) for e in A]\n A[idx] = \"[{}]\".format(A[idx])\n return \" \".join(A)\n\n\nprint(main())", "code2": "\n\n\ndef partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n\n\ndef main():\n n = int(input())\n A = [int(e) for e in input().split()]\n p = 0\n idx = partition(A, p, n - 1)\n A = [str(e) for e in A]\n A[idx] = \"[{}]\".format(A[idx])\n return \" \".join(A)\n\n\nprint(main())", "original_language1": "Python3", "original_language2": "Python3", "date1": "1490582621", "date2": "1490582742", "bleu_score": "0.9871840284436523", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "12\n40 19 6 1 12 8 0 2 21 2 4 22\n", "actual_output": "19 6 1 12 8 0 2 21 2 4 [22] 4\n", "expected_output": "19 6 1 12 8 0 2 21 2 4 [22] 40\n\n", "anno_code": ["\n\n\ndef partition(A, p, r): # (0): partition=\n x = A[r] # (7): x=22\n i = p - 1 # (8): i=-1\n for j in range(p, r): # (9): j=0 (11): j=1 ... (51): NO CHANGE\n if A[j] <= x: # (10): NO CHANGE (12): NO CHANGE ... (48): NO CHANGE\n i += 1 # (13): i=0 (17): i=1 ... (49): i=9\n A[i], A[j] = A[j], A[i] # (14): A=[19, 40, 6, 1, 12, 8, 0, 2, 21, 2, 4, 22] (18): A=[19, 6, 40, 1, 12, 8, 0, 2, 21, 2, 4, 22] ... (50): A=[19, 6, 1, 12, 8, 0, 2, 21, 2, 4, 40, 22]\n A[i + 1], A[r] = A[r], A[i] # (52): n=12, A=[19, 6, 1, 12, 8, 0, 2, 21, 2, 4, 22, 4], idx=10\n return i + 1\n\n\ndef main(): # (1): main=\n n = int(input()) # (3): n=12\n A = [int(e) for e in input().split()] # (4): A=[40, 19, 6, 1, 12, 8, 0, 2, 21, 2, 4, 22]\n p = 0 # (5): p=0\n idx = partition(A, p, n - 1) # (6): r=11\n A = [str(e) for e in A] # (53): A=['19', '6', '1', '12', '8', '0', '2', '21', '2', '4', '22', '4']\n A[idx] = \"[{}]\".format(A[idx])\n return \" \".join(A)\n\n\nprint(main()) # (2): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n \n \n def partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n- A[i + 1], A[r] = A[r], A[i]\n+ A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n \n \n def main():\n n = int(input())\n A = [int(e) for e in input().split()]\n p = 0\n idx = partition(A, p, n - 1)\n A = [str(e) for e in A]\n A[idx] = \"[{}]\".format(A[idx])\n return \" \".join(A)\n \n \n print(main())\n", "FL_content": " \n \n \n def partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n- A[i + 1], A[r] = A[r], A[i]\n return i + 1\n \n \n def main():\n n = int(input())\n A = [int(e) for e in input().split()]\n p = 0\n idx = partition(A, p, n - 1)\n A = [str(e) for e in A]\n A[idx] = \"[{}]\".format(A[idx])\n return \" \".join(A)\n \n \n print(main())\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 25 }, { "user_id": "u672443148", "problem_id": "p02276", "submission1_id": "s376176297", "submission2_id": "s663366769", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def partition(A,p,r):\n x=A[r]\n i=p-1\n for j in range(p,r):\n if A[j]\n x=A[r] # (4): x=1\n i=p-1 # (5): i=-1\n for j in range(p,r): # (6): j=0 (8): j=1 ... (30): NO CHANGE\n if A[j], n=12, A=[0, 1, 9, 1, 12, 8, 8, 6, 21, 40, 10, 19], k=1\n return i+1\n\nn=int(input()) # (1): n=12\nA=list(map(int,input().split())) # (2): A=[40, 19, 9, 1, 12, 8, 8, 6, 21, 0, 10, 1]\nk=partition(A,0,len(A)-1) # (3): p=0, r=11\nfront=\" \".join(map(str,A[:k])) # (32): front=0\nback=\" \".join(map(str,A[k+1:])) # (33): back=9 1 12 8 8 6 21 40 10 19\nans=front+\" [\"+str(A[k])+\"] \"+back # (34): ans=0 [1] 9 1 12 8 8 6 21 40 10 19\nprint(ans)\n"], "anno_status": [true], "diff_content": " def partition(A,p,r):\n x=A[r]\n i=p-1\n for j in range(p,r):\n- if A[j]\n x = array[r] # (5): x=22\n i = p-1 # (6): i=-1\n for j in range(p, r): # (7): j=0 (9): j=1 ... (47): NO CHANGE\n if array[j] <= x: # (8): NO CHANGE (10): NO CHANGE ... (44): NO CHANGE\n i += 1 # (11): i=0 (15): i=1 ... (45): i=8\n array[i], array[j] = array[j], array[i] # (12): array=[19, 23, 9, 9, 23, 8, 7, 4, 13, -1, 10, 22] (16): array=[19, 9, 23, 9, 23, 8, 7, 4, 13, -1, 10, 22] ... (46): array=[19, 9, 9, 8, 7, 4, 13, -1, 10, 23, 23, 22]\n array[i+1], array[r] = array[r], array[i+1] # (48): partition=, n=12, array=[19, 9, 9, 8, 7, 4, 13, -1, 10, 22, 23, 23], buff=[23, 19, 9, 9, 23, 8, 7, 4, 13, -1, 10, 22], p=9\n return i+1\n\nn = int(input()) # (1): n=12\narray = [int(a) for a in input().split()] # (2): array=[23, 19, 9, 9, 23, 8, 7, 4, 13, -1, 10, 22]\nbuff = array[:] # (3): buff=[23, 19, 9, 9, 23, 8, 7, 4, 13, -1, 10, 22]\np = partition(array, 0, n-1) # (4): p=0, r=11\n\nfor a in array: # (49): a=19 (53): a=9 ... (92): NO CHANGE\n if a == buff[-1]: # (50): NO CHANGE (54): NO CHANGE ... (93): NO CHANGE\n print(\"[{0}]\".format(a), end=\" \") # (87): NO CHANGE\n elif a == array[-1]: # (51): NO CHANGE (55): NO CHANGE ... (94): NO CHANGE\n print(a) # (91): NO CHANGE (95): NO CHANGE\n else:\n print(a, end=\" \") # (52): NO CHANGE (56): NO CHANGE ... (84): NO CHANGE\n"], "anno_status": [true], "diff_content": " def partition(array, p, r):\n x = array[r]\n i = p-1\n for j in range(p, r):\n if array[j] <= x:\n i += 1\n array[i], array[j] = array[j], array[i]\n array[i+1], array[r] = array[r], array[i+1]\n+ a1 = array[:i+1]\n+ a2 = \"[\" + str(array[i+1]) + \"]\"\n+ a3 = array[i+2:]\n+ array = a1[:]\n+ array.append(a2)\n+ array += a3\n+ print(*array)\n return i+1\n \n n = int(input())\n array = [int(a) for a in input().split()]\n-buff = array[:]\n p = partition(array, 0, n-1)\n \n-for a in array:\n- if a == buff[-1]:\n- print(\"[{0}]\".format(a), end=\" \")\n- elif a == array[-1]:\n- print(a)\n- else:\n- print(a, end=\" \")\n-\n", "FL_content": " def partition(array, p, r):\n x = array[r]\n i = p-1\n for j in range(p, r):\n if array[j] <= x:\n i += 1\n array[i], array[j] = array[j], array[i]\n array[i+1], array[r] = array[r], array[i+1]\n return i+1\n \n n = int(input())\n array = [int(a) for a in input().split()]\n-buff = array[:]\n p = partition(array, 0, n-1)\n \n-for a in array:\n- if a == buff[-1]:\n- print(\"[{0}]\".format(a), end=\" \")\n- elif a == array[-1]:\n- print(a)\n- else:\n- print(a, end=\" \")\n-\n", "added_lines": 7, "removed_lines": 9, "code1_lines": 23 }, { "user_id": "u022407960", "problem_id": "p02300", "submission1_id": "s832682983", "submission2_id": "s230011031", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) != -1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) != -1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.sort(key=attrgetter('imag', 'real'))\n \n\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "code2": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.reverse()\n \n lower_min = min(lower, key=attrgetter('imag', 'real'))\n \n min_index = lower.index(lower_min)\n lower_right = lower[min_index:]\n lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n lower_right.append(upper[k])\n return lower_right + lower_left\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1480727340", "date2": "1480734264", "bleu_score": "0.8965942243483909", "code1_test_status": [0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0], "code1_test_score": 32, "total_score": 102, "input": "7\n2 1\n0 0\n1 2\n2 2\n4 2\n1 3\n3 3\n", "actual_output": "4\n0 0\n4 2\n3 3\n1 3\n", "expected_output": "5\n0 0\n2 1\n4 2\n3 3\n1 3\n", "anno_code": ["\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9 # (0): EPS=1e-09\n\n\ndef cross(a, b): # (1): cross=\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b): # (2): dot=\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2): # (3): check_ccw=\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon): # (4): convex_check_Andrew=\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) != -1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) != -1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.sort(key=attrgetter('imag', 'real'))\n \n\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))"], "anno_status": [false], "diff_content": " \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n- while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) != -1:\n+ while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n- while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) != -1:\n+ while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n \n- lower.sort(key=attrgetter('imag', 'real'))\n+ lower.reverse()\n \n-\n+ lower_min = min(lower, key=attrgetter('imag', 'real'))\n+ \n+ min_index = lower.index(lower_min)\n+ lower_right = lower[min_index:]\n+ lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n- lower.append(upper[k])\n-\n- return lower\n+ lower_right.append(upper[k])\n+ return lower_right + lower_left\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "FL_content": " \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n- while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) != -1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n- while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) != -1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n \n- lower.sort(key=attrgetter('imag', 'real'))\n \n-\n for k in range(len(upper) - 2, 0, -1):\n- lower.append(upper[k])\n-\n- return lower\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "added_lines": 10, "removed_lines": 7, "code1_lines": 80 }, { "user_id": "u336892997", "problem_id": "p02300", "submission1_id": "s507367998", "submission2_id": "s819572230", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef clockwise(v0, v1, v2):\n a1 = v1[0] - v0[0]\n a2 = v1[1] - v0[1]\n b1 = v2[0] - v0[0]\n b2 = v2[1] - v0[1]\n return (a1*b2 - b1*a2) < 0\n\n\nn = int(input())\nvors = [[int(a) for a in input().split() ] for _ in range(n)]\nvors.sort(key=lambda v: (v[1], v[0]))\n\nover = [vors[0], vors[1]]\n\nfor v in vors[2:]:\n while len(over) > 1 and not clockwise(over[-2], over[-1], v):\n over.pop()\n over.append(v)\n \nunder = [vors[0], vors[1]]\n\nfor v in vors[2:]:\n while len(under) > 1 and clockwise(under[-2], under[-1], v):\n under.pop()\n under.append(v)\n\nprint(len(over) + len(under) - 2)\nfor v in under[:-1]:\n print(v[0], v[1])\n\nfor v in reversed(over[1:]):\n print(v[0], v[1])\n ", "code2": "\ndef sgined_area(v0, v1, v2):\n a1 = v1[0] - v0[0]\n a2 = v1[1] - v0[1]\n b1 = v2[0] - v0[0]\n b2 = v2[1] - v0[1]\n return a1*b2 - b1*a2\n\n\nn = int(input())\nvors = [[int(a) for a in input().split() ] for _ in range(n)]\nvors.sort(key=lambda v: (v[1], v[0]))\n\nover = [vors[0], vors[1]]\n\nfor v in vors[2:]:\n while len(over) > 1 and sgined_area(over[-2], over[-1], v) > 0:\n over.pop()\n over.append(v)\n \nunder = [vors[0], vors[1]]\n\nfor v in vors[2:]:\n while len(under) > 1 and sgined_area(under[-2], under[-1], v) < 0:\n under.pop()\n under.append(v)\n\nprint(len(over) + len(under) - 2)\nfor v in under[:-1]:\n print(v[0], v[1])\n\nfor v in reversed(over[1:]):\n print(v[0], v[1])\n ", "original_language1": "Python3", "original_language2": "Python3", "date1": "1465805849", "date2": "1465806139", "bleu_score": "0.9370097623382821", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 95, "total_score": 102, "input": "4\n0 0\n2 3\n1 2\n0 1\n", "actual_output": "3\n0 0\n2 3\n0 1\n", "expected_output": "4\n0 0\n2 3\n1 2\n0 1\n\n", "anno_code": ["\ndef clockwise(v0, v1, v2): # (0): clockwise=\n a1 = v1[0] - v0[0] # (7): a1=0 (14): a1=1 ... (38): a1=1\n a2 = v1[1] - v0[1] # (8): a2=1 (15): a2=1 ... (39): a2=2\n b1 = v2[0] - v0[0] # (9): b1=1 (16): b1=2 ... (40): b1=2\n b2 = v2[1] - v0[1] # (10): clockwise=, n=4, vors=[[0, 0], [0, 1], [1, 2], [2, 3]], over=[[0, 0], [0, 1]], v=[1, 2] (17): clockwise=, n=4, vors=[[0, 0], [0, 1], [1, 2], [2, 3]], over=[[0, 0], [0, 1], [1, 2]], v=[2, 3] ... (41): clockwise=, n=4, vors=[[0, 0], [0, 1], [1, 2], [2, 3]], over, v=[2, 3], under\n return (a1*b2 - b1*a2) < 0\n\n\nn = int(input()) # (1): n=4\nvors = [[int(a) for a in input().split() ] for _ in range(n)] # (2): vors\nvors.sort(key=lambda v: (v[1], v[0])) # (3): vors\n\nover = [vors[0], vors[1]] # (4): over\n\nfor v in vors[2:]: # (5): v=[1, 2] (12): v=[2, 3] (25): NO CHANGE\n while len(over) > 1 and not clockwise(over[-2], over[-1], v): # (6): v0=[0, 0], v1=[0, 1], v2=[1, 2] (13): v0=[0, 1], v1=[1, 2], v2=[2, 3] (19): v0=[0, 0], v1=[0, 1], v2=[2, 3]\n over.pop() # (18): over\n over.append(v) # (11): over (24): over\n \nunder = [vors[0], vors[1]] # (26): under\n\nfor v in vors[2:]: # (27): v=[1, 2] (36): v=[2, 3] (45): NO CHANGE\n while len(under) > 1 and clockwise(under[-2], under[-1], v): # (28): v0=[0, 0], v1=[0, 1], v2=[1, 2] (34): NO CHANGE ... (43): NO CHANGE\n under.pop() # (33): under (42): under\n under.append(v) # (35): under (44): under\n\nprint(len(over) + len(under) - 2) # (46): NO CHANGE\nfor v in under[:-1]: # (47): v=[0, 0] (49): NO CHANGE\n print(v[0], v[1]) # (48): NO CHANGE\n\nfor v in reversed(over[1:]): # (50): v=[2, 3] (52): v=[0, 1]\n print(v[0], v[1]) # (51): NO CHANGE (53): NO CHANGE\n "], "anno_status": [false], "diff_content": " \n-def clockwise(v0, v1, v2):\n+def sgined_area(v0, v1, v2):\n a1 = v1[0] - v0[0]\n a2 = v1[1] - v0[1]\n b1 = v2[0] - v0[0]\n b2 = v2[1] - v0[1]\n- return (a1*b2 - b1*a2) < 0\n+ return a1*b2 - b1*a2\n \n \n n = int(input())\n vors = [[int(a) for a in input().split() ] for _ in range(n)]\n vors.sort(key=lambda v: (v[1], v[0]))\n \n over = [vors[0], vors[1]]\n \n for v in vors[2:]:\n- while len(over) > 1 and not clockwise(over[-2], over[-1], v):\n+ while len(over) > 1 and sgined_area(over[-2], over[-1], v) > 0:\n over.pop()\n over.append(v)\n \n under = [vors[0], vors[1]]\n \n for v in vors[2:]:\n- while len(under) > 1 and clockwise(under[-2], under[-1], v):\n+ while len(under) > 1 and sgined_area(under[-2], under[-1], v) < 0:\n under.pop()\n under.append(v)\n \n print(len(over) + len(under) - 2)\n for v in under[:-1]:\n print(v[0], v[1])\n \n for v in reversed(over[1:]):\n print(v[0], v[1])\n \n", "FL_content": " \n-def clockwise(v0, v1, v2):\n a1 = v1[0] - v0[0]\n a2 = v1[1] - v0[1]\n b1 = v2[0] - v0[0]\n b2 = v2[1] - v0[1]\n- return (a1*b2 - b1*a2) < 0\n \n \n n = int(input())\n vors = [[int(a) for a in input().split() ] for _ in range(n)]\n vors.sort(key=lambda v: (v[1], v[0]))\n \n over = [vors[0], vors[1]]\n \n for v in vors[2:]:\n- while len(over) > 1 and not clockwise(over[-2], over[-1], v):\n over.pop()\n over.append(v)\n \n under = [vors[0], vors[1]]\n \n for v in vors[2:]:\n- while len(under) > 1 and clockwise(under[-2], under[-1], v):\n under.pop()\n under.append(v)\n \n print(len(over) + len(under) - 2)\n for v in under[:-1]:\n print(v[0], v[1])\n \n for v in reversed(over[1:]):\n print(v[0], v[1])\n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 34 }, { "user_id": "u022407960", "problem_id": "p02300", "submission1_id": "s651634080", "submission2_id": "s230011031", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.reverse()\n lower.sort(key=attrgetter('imag', 'real'))\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "code2": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.reverse()\n \n lower_min = min(lower, key=attrgetter('imag', 'real'))\n \n min_index = lower.index(lower_min)\n lower_right = lower[min_index:]\n lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n lower_right.append(upper[k])\n return lower_right + lower_left\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1480733027", "date2": "1480734264", "bleu_score": "0.9089852826425715", "code1_test_status": [0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1], "code1_test_score": 56, "total_score": 102, "input": "7\n4 1\n0 -1\n1 2\n2 -2\n4 2\n0 3\n2 3\n", "actual_output": "6\n2 -2\n0 -1\n4 1\n4 2\n2 3\n0 3\n", "expected_output": "6\n2 -2\n4 1\n4 2\n2 3\n0 3\n0 -1\n\n", "anno_code": ["\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9 # (0): EPS=1e-09\n\n\ndef cross(a, b): # (1): cross=\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b): # (2): dot=\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2): # (3): check_ccw=\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon): # (4): convex_check_Andrew=\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.reverse()\n lower.sort(key=attrgetter('imag', 'real'))\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))"], "anno_status": [false], "diff_content": " \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n \n lower.reverse()\n- lower.sort(key=attrgetter('imag', 'real'))\n+ \n+ lower_min = min(lower, key=attrgetter('imag', 'real'))\n+ \n+ min_index = lower.index(lower_min)\n+ lower_right = lower[min_index:]\n+ lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n- lower.append(upper[k])\n- return lower\n+ lower_right.append(upper[k])\n+ return lower_right + lower_left\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "FL_content": " \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n \n lower.reverse()\n- lower.sort(key=attrgetter('imag', 'real'))\n for k in range(len(upper) - 2, 0, -1):\n- lower.append(upper[k])\n- return lower\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "added_lines": 8, "removed_lines": 3, "code1_lines": 78 }, { "user_id": "u022407960", "problem_id": "p02300", "submission1_id": "s961803202", "submission2_id": "s230011031", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n lower.reverse()\n lower.sort(key=attrgetter('imag'))\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "code2": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.reverse()\n \n lower_min = min(lower, key=attrgetter('imag', 'real'))\n \n min_index = lower.index(lower_min)\n lower_right = lower[min_index:]\n lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n lower_right.append(upper[k])\n return lower_right + lower_left\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1480729208", "date2": "1480734264", "bleu_score": "0.9011448775104812", "code1_test_status": [0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1], "code1_test_score": 56, "total_score": 102, "input": "4\n1 -2\n4 2\n0 2\n0 1\n", "actual_output": "4\n1 -2\n0 1\n4 2\n0 2\n", "expected_output": "4\n1 -2\n4 2\n0 2\n0 1\n\n", "anno_code": ["\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9 # (0): EPS=1e-09\n\n\ndef cross(a, b): # (1): cross=\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b): # (2): dot=\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2): # (3): check_ccw=\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon): # (4): convex_check_Andrew=\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n lower.reverse()\n lower.sort(key=attrgetter('imag'))\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))"], "anno_status": [false], "diff_content": " \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n+ \n lower.reverse()\n- lower.sort(key=attrgetter('imag'))\n+ \n+ lower_min = min(lower, key=attrgetter('imag', 'real'))\n+ \n+ min_index = lower.index(lower_min)\n+ lower_right = lower[min_index:]\n+ lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n- lower.append(upper[k])\n-\n- return lower\n+ lower_right.append(upper[k])\n+ return lower_right + lower_left\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "FL_content": " \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n lower.reverse()\n- lower.sort(key=attrgetter('imag'))\n for k in range(len(upper) - 2, 0, -1):\n- lower.append(upper[k])\n-\n- return lower\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "added_lines": 9, "removed_lines": 4, "code1_lines": 78 }, { "user_id": "u022407960", "problem_id": "p02300", "submission1_id": "s518188540", "submission2_id": "s230011031", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n lower.reverse()\n lower.sort(key=attrgetter('imag', 'real'))\n\n for m in range(len(lower) - 1):\n if lower[m].imag == lower[m + 1].imag and lower[m].real < lower[m + 1].real:\n lower[m], lower[m + 1] = lower[m + 1], lower[m]\n\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "code2": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.reverse()\n \n lower_min = min(lower, key=attrgetter('imag', 'real'))\n \n min_index = lower.index(lower_min)\n lower_right = lower[min_index:]\n lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n lower_right.append(upper[k])\n return lower_right + lower_left\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1480730925", "date2": "1480734264", "bleu_score": "0.9347884087679083", "code1_test_status": [0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1], "code1_test_score": 21, "total_score": 102, "input": "7\n4 1\n0 0\n1 2\n2 0\n4 2\n1 3\n3 4\n", "actual_output": "6\n2 0\n0 0\n4 1\n4 2\n3 4\n1 3\n", "expected_output": "6\n0 0\n2 0\n4 1\n4 2\n3 4\n1 3\n\n", "anno_code": ["\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9 # (0): EPS=1e-09\n\n\ndef cross(a, b): # (1): cross=\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b): # (2): dot=\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2): # (3): check_ccw=\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon): # (4): convex_check_Andrew=\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n lower.reverse()\n lower.sort(key=attrgetter('imag', 'real'))\n\n for m in range(len(lower) - 1):\n if lower[m].imag == lower[m + 1].imag and lower[m].real < lower[m + 1].real:\n lower[m], lower[m + 1] = lower[m + 1], lower[m]\n\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))"], "anno_status": [false], "diff_content": " \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n+ \n lower.reverse()\n- lower.sort(key=attrgetter('imag', 'real'))\n-\n- for m in range(len(lower) - 1):\n- if lower[m].imag == lower[m + 1].imag and lower[m].real < lower[m + 1].real:\n- lower[m], lower[m + 1] = lower[m + 1], lower[m]\n-\n+ \n+ lower_min = min(lower, key=attrgetter('imag', 'real'))\n+ \n+ min_index = lower.index(lower_min)\n+ lower_right = lower[min_index:]\n+ lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n- lower.append(upper[k])\n-\n- return lower\n+ lower_right.append(upper[k])\n+ return lower_right + lower_left\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "FL_content": " \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n lower.reverse()\n- lower.sort(key=attrgetter('imag', 'real'))\n-\n- for m in range(len(lower) - 1):\n- if lower[m].imag == lower[m + 1].imag and lower[m].real < lower[m + 1].real:\n- lower[m], lower[m + 1] = lower[m + 1], lower[m]\n-\n for k in range(len(upper) - 2, 0, -1):\n- lower.append(upper[k])\n-\n- return lower\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "added_lines": 9, "removed_lines": 9, "code1_lines": 83 }, { "user_id": "u279605379", "problem_id": "p02300", "submission1_id": "s157520417", "submission2_id": "s688186911", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\n\ndef isCLKWISE(ph):\n a = [ph[-1][0]-ph[-3][0],ph[-1][1]-ph[-3][1]]\n b = [ph[-2][0]-ph[-3][0],ph[-2][1]-ph[-3][1]]\n crs = a[0]*b[1] - a[1]*b[0]\n if crs < 0 :\n return False\n else :\n return True\n \ndef ConvexHullScan(P):\n phU = [P[0],P[1]]\n for p in P[2:]:\n phU.append(p)\n while(True):\n if isCLKWISE(phU) :\n break\n else :\n del phU[-2]\n if len(phU) == 2 :\n break\n phL = [P[-1],P[-2]]\n for p in P[-3::-1]:\n phL.append(p)\n while(True):\n if isCLKWISE(phL) :\n break\n else :\n del phL[-2]\n if len(phL) == 2 :\n break\n ph = phU + phL[1:-1]\n return ph\n\nn = int(input())\nP = []\nfor i in range(n):\n heapq.heappush(P,[int(x) for x in input().split()])\n \nQ = ConvexHullScan(P)\nQ.reverse()\nprint(len(Q))\nfor q in Q:\n idx = min([[x[1][1],x[1][0],x[0]] for x in enumerate(Q)])[2]\n R = Q[idx:] + Q[:idx]\nfor r in R:\n print(r[0],r[1])", "code2": "def isCLKWISE(ph):\n a = [ph[-1][0]-ph[-3][0],ph[-1][1]-ph[-3][1]]\n b = [ph[-2][0]-ph[-3][0],ph[-2][1]-ph[-3][1]]\n crs = a[0]*b[1] - a[1]*b[0]\n if crs < 0 :\n return False\n else :\n return True\n \ndef ConvexHullScan(P):\n P = sorted(P)\n phU = [P[0],P[1]]\n for p in P[2:]:\n phU.append(p)\n while(True):\n if isCLKWISE(phU) :\n break\n else :\n del phU[-2]\n if len(phU) == 2 :\n break\n phL = [P[-1],P[-2]]\n for p in P[-3::-1]:\n phL.append(p)\n while(True):\n if isCLKWISE(phL) :\n break\n else :\n del phL[-2]\n if len(phL) == 2 :\n break\n ph = phU + phL[1:-1]\n return ph\n \nn = int(input())\nP = []\nfor i in range(n):\n P += [[int(x) for x in input().split()]]\n \nQ = ConvexHullScan(P)\nQ.reverse()\nprint(len(Q))\nidx = min([[x[1][1],x[1][0],x[0]] for x in enumerate(Q)])[2]\nR = Q[idx:] + Q[:idx]\nfor r in R:\n print(r[0],r[1])", "original_language1": "Python3", "original_language2": "Python3", "date1": "1504490731", "date2": "1504492209", "bleu_score": "0.9551279937725842", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1], "code1_test_score": 66, "total_score": 102, "input": "7\n2 1\n0 0\n1 0\n2 0\n4 2\n1 3\n3 3\n", "actual_output": "7\n0 0\n2 0\n4 2\n3 3\n1 3\n1 0\n2 0\n", "expected_output": "6\n0 0\n1 0\n2 0\n4 2\n3 3\n1 3\n\n", "anno_code": ["import heapq\n\ndef isCLKWISE(ph): # (0): isCLKWISE=\n a = [ph[-1][0]-ph[-3][0],ph[-1][1]-ph[-3][1]] # (25): a=[1, 0] (34): a=[0, 1] ... (142): a=[-4, -2]\n b = [ph[-2][0]-ph[-3][0],ph[-2][1]-ph[-3][1]] # (26): b=[2, 0] (35): b=[-1, 0] ... (143): b=[-2, -2]\n crs = a[0]*b[1] - a[1]*b[0] # (27): crs=0 (36): crs=1 ... (144): crs=4\n if crs < 0 : # (28): P=[[0, 0], [2, 0], [1, 0], [2, 1], [4, 2], [1, 3], [3, 3]], phU=[[0, 0], [2, 0], [1, 0]], p=[1, 0] (37): P=[[0, 0], [2, 0], [1, 0], [2, 1], [4, 2], [1, 3], [3, 3]], phU=[[0, 0], [2, 0], [1, 0], [2, 1]], p=[2, 1] ... (145): P=[[0, 0], [2, 0], [1, 0], [2, 1], [4, 2], [1, 3], [3, 3]], phU, p=[0, 0], phL\n return False\n else :\n return True\n \ndef ConvexHullScan(P): # (1): ConvexHullScan=\n phU = [P[0],P[1]] # (20): phU\n for p in P[2:]: # (21): p=[1, 0] (30): p=[2, 1] ... (82): NO CHANGE\n phU.append(p) # (22): phU (31): phU ... (74): phU\n while(True): # (23): NO CHANGE (32): NO CHANGE ... (75): NO CHANGE\n if isCLKWISE(phU) : # (24): ph (33): ph ... (76): ph\n break # (29): NO CHANGE (38): NO CHANGE ... (81): NO CHANGE\n else :\n del phU[-2] # (56): phU (64): phU\n if len(phU) == 2 : # (57): NO CHANGE (65): NO CHANGE\n break\n phL = [P[-1],P[-2]] # (83): phL\n for p in P[-3::-1]: # (84): p=[4, 2] (95): p=[2, 1] ... (147): NO CHANGE\n phL.append(p) # (85): phL (96): phL ... (139): phL\n while(True): # (86): NO CHANGE (97): NO CHANGE ... (140): NO CHANGE\n if isCLKWISE(phL) : # (87): ph (98): ph ... (141): ph\n break # (103): NO CHANGE (120): NO CHANGE ... (146): NO CHANGE\n else :\n del phL[-2] # (92): phL=[[3, 3], [4, 2]] (112): phL (129): phL\n if len(phL) == 2 : # (93): NO CHANGE (113): NO CHANGE (130): NO CHANGE\n break # (94): NO CHANGE\n ph = phU + phL[1:-1] # (148): heapq=, isCLKWISE=, ConvexHullScan=, n=7, i=6, Q\n return ph\n\nn = int(input()) # (2): n=7\nP = [] # (3): P=[]\nfor i in range(n): # (4): i=0 (6): i=1 ... (18): NO CHANGE\n heapq.heappush(P,[int(x) for x in input().split()]) # (5): P (7): P ... (17): P\n \nQ = ConvexHullScan(P) # (19): NO CHANGE\nQ.reverse() # (149): Q\nprint(len(Q)) # (150): NO CHANGE\nfor q in Q: # (151): q=[2, 0] (154): q=[4, 2] ... (172): NO CHANGE\n idx = min([[x[1][1],x[1][0],x[0]] for x in enumerate(Q)])[2] # (152): idx=6 (155): NO CHANGE ... (170): NO CHANGE\n R = Q[idx:] + Q[:idx] # (153): R (156): NO CHANGE ... (171): NO CHANGE\nfor r in R: # (173): r=[0, 0] (175): r=[2, 0] ... (185): r=[2, 0]\n print(r[0],r[1]) # (174): NO CHANGE (176): NO CHANGE ... (186): NO CHANGE\n"], "anno_status": [false], "diff_content": "-import heapq\n-\n def isCLKWISE(ph):\n a = [ph[-1][0]-ph[-3][0],ph[-1][1]-ph[-3][1]]\n b = [ph[-2][0]-ph[-3][0],ph[-2][1]-ph[-3][1]]\n crs = a[0]*b[1] - a[1]*b[0]\n if crs < 0 :\n return False\n else :\n return True\n- \n+ \n def ConvexHullScan(P):\n+ P = sorted(P)\n phU = [P[0],P[1]]\n for p in P[2:]:\n phU.append(p)\n while(True):\n if isCLKWISE(phU) :\n break\n else :\n del phU[-2]\n if len(phU) == 2 :\n break\n phL = [P[-1],P[-2]]\n for p in P[-3::-1]:\n phL.append(p)\n while(True):\n if isCLKWISE(phL) :\n break\n else :\n del phL[-2]\n if len(phL) == 2 :\n break\n ph = phU + phL[1:-1]\n return ph\n-\n+ \n n = int(input())\n P = []\n for i in range(n):\n- heapq.heappush(P,[int(x) for x in input().split()])\n- \n+ P += [[int(x) for x in input().split()]]\n+ \n Q = ConvexHullScan(P)\n Q.reverse()\n print(len(Q))\n-for q in Q:\n- idx = min([[x[1][1],x[1][0],x[0]] for x in enumerate(Q)])[2]\n- R = Q[idx:] + Q[:idx]\n+idx = min([[x[1][1],x[1][0],x[0]] for x in enumerate(Q)])[2]\n+R = Q[idx:] + Q[:idx]\n for r in R:\n print(r[0],r[1])\n", "FL_content": "-import heapq\n-\n def isCLKWISE(ph):\n a = [ph[-1][0]-ph[-3][0],ph[-1][1]-ph[-3][1]]\n b = [ph[-2][0]-ph[-3][0],ph[-2][1]-ph[-3][1]]\n crs = a[0]*b[1] - a[1]*b[0]\n if crs < 0 :\n return False\n else :\n return True\n- \n def ConvexHullScan(P):\n phU = [P[0],P[1]]\n for p in P[2:]:\n phU.append(p)\n while(True):\n if isCLKWISE(phU) :\n break\n else :\n del phU[-2]\n if len(phU) == 2 :\n break\n phL = [P[-1],P[-2]]\n for p in P[-3::-1]:\n phL.append(p)\n while(True):\n if isCLKWISE(phL) :\n break\n else :\n del phL[-2]\n if len(phL) == 2 :\n break\n ph = phU + phL[1:-1]\n return ph\n-\n n = int(input())\n P = []\n for i in range(n):\n- heapq.heappush(P,[int(x) for x in input().split()])\n- \n Q = ConvexHullScan(P)\n Q.reverse()\n print(len(Q))\n-for q in Q:\n- idx = min([[x[1][1],x[1][0],x[0]] for x in enumerate(Q)])[2]\n- R = Q[idx:] + Q[:idx]\n for r in R:\n print(r[0],r[1])\n", "added_lines": 7, "removed_lines": 9, "code1_lines": 48 }, { "user_id": "u519227872", "problem_id": "p02300", "submission1_id": "s764615546", "submission2_id": "s319037633", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import sqrt\nfrom collections import deque\n\ndef sub(a, b):\n return [a[0] - b[0],a[1] - b[1]]\n\ndef cross(a, b):\n return a[0] * b[1] - a[1] * b[0]\n\ndef ccw(a, b, c):\n x = sub(b, a)\n y = sub(c, a)\n return cross(x, y) > 0\n\nn = int(input())\nc = [list(map(int, input().split())) for i in range(n)]\nc.sort(key=lambda x: (x[0], x[1]))\nU = deque(c[:2])\n\nfor i in range(2, n):\n j = len(U)\n while j >= 2 and ccw(U[-1],U[-2],c[i]):\n U.pop()\n j -= 1\n U.append(c[i])\n\nc = c[::-1]\nL = deque(c[:2])\n\nfor i in range(2, n):\n j = len(L)\n while j >= 2 and ccw(L[-1], L[-2], c[i]):\n L.pop()\n j -= 1\n L.append(c[i])\n\nans = U\nfor i in range(1,len(L)-1):\n x, y = L[i]\n ans.append([x,y])\n\ni = ans.index(sorted(ans, key=lambda x: (x[1],x[0]))[0])\nans = list(ans)\nfor x,y in ans[:i] + ans[i:]:\n print(x, y)\n", "code2": "from math import sqrt\nfrom collections import deque\n\ndef sub(a, b):\n return [a[0] - b[0],a[1] - b[1]]\n\ndef cross(a, b):\n return a[0] * b[1] - a[1] * b[0]\n\ndef ccw(a, b, c):\n x = sub(b, a)\n y = sub(c, a)\n return cross(x, y) > 0\n\nn = int(input())\nc = [list(map(int, input().split())) for i in range(n)]\nc.sort(key=lambda x: (x[0], x[1]))\nU = deque(c[:2])\n\nfor i in range(2, n):\n j = len(U)\n while j >= 2 and ccw(U[-1],U[-2],c[i]):\n U.pop()\n j -= 1\n U.append(c[i])\n\nc = c[::-1]\nL = deque(c[:2])\n\nfor i in range(2, n):\n j = len(L)\n while j >= 2 and ccw(L[-1], L[-2], c[i]):\n L.pop()\n j -= 1\n L.append(c[i])\n\nans = U\nfor i in range(1,len(L)-1):\n x, y = L[i]\n ans.append([x,y])\n\nprint(len(ans))\ni = ans.index(sorted(ans, key=lambda x: (x[1],x[0]))[0])\nans = list(ans)\nfor x,y in ans[i:] + ans[:i]:\n print(x, y)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1524410313", "date2": "1524410465", "bleu_score": "0.9791232505822159", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "7\n4 1\n0 1\n1 4\n3 0\n4 2\n1 3\n3 3\n", "actual_output": "0 1\n3 0\n4 1\n4 2\n3 3\n1 4\n", "expected_output": "6\n3 0\n4 1\n4 2\n3 3\n1 4\n0 1\n\n", "anno_code": ["from math import sqrt\nfrom collections import deque\n\ndef sub(a, b): # (0): sub=\n return [a[0] - b[0],a[1] - b[1]]\n\ndef cross(a, b): # (1): cross=\n return a[0] * b[1] - a[1] * b[0]\n\ndef ccw(a, b, c): # (2): ccw=\n x = sub(b, a) # (10): x=[-1, -2] (16): x=[0, -1] ... (93): x=[2, -1]\n y = sub(c, a) # (11): sqrt=, deque=, sub=, cross=, ccw=, n=7, c=[[0, 1], [1, 3], [1, 4], [3, 0], [3, 3], [4, 1], [4, 2]], U=deque([[0, 1], [3, 0], [4, 1], [4, 2], [3, 3], [1, 4]]), i=2, j=2 (17): sqrt=, deque=, sub=, cross=, ccw=, n=7, c=[[0, 1], [1, 3], [1, 4], [3, 0], [3, 3], [4, 1], [4, 2]], U=deque([[0, 1], [3, 0], [4, 1], [4, 2], [3, 3], [1, 4]]), i=3, j=3 ... (94): sqrt=, deque=, sub=, cross=, ccw=, n=7, c, U=deque([[0, 1], [3, 0], [4, 1], [4, 2], [3, 3], [1, 4]]), i=6, j=3, L=deque([[4, 2], [3, 3], [1, 4], [0, 1]])\n return cross(x, y) > 0\n\nn = int(input()) # (3): n=7\nc = [list(map(int, input().split())) for i in range(n)] # (4): c\nc.sort(key=lambda x: (x[0], x[1])) # (5): c\nU = deque(c[:2]) # (6): U=deque([[0, 1], [3, 0], [4, 1], [4, 2], [3, 3], [1, 4]])\n\nfor i in range(2, n): # (7): i=2 (13): i=3 ... (50): NO CHANGE\n j = len(U) # (8): j=2 (14): j=3 ... (45): j=3\n while j >= 2 and ccw(U[-1],U[-2],c[i]): # (9): a=[1, 3], b=[0, 1], c=[1, 4] (15): a=[1, 4], b=[1, 3], c=[3, 0] ... (46): a=[4, 1], b=[3, 0], c=[4, 2]\n U.pop() # (18): NO CHANGE (23): NO CHANGE (38): NO CHANGE\n j -= 1 # (19): j=2 (24): j=1 (39): j=2\n U.append(c[i]) # (12): NO CHANGE (26): NO CHANGE ... (49): NO CHANGE\n\nc = c[::-1] # (51): c\nL = deque(c[:2]) # (52): L=deque([[4, 2], [3, 3], [1, 4], [0, 1]])\n\nfor i in range(2, n): # (53): i=2 (62): i=3 ... (96): NO CHANGE\n j = len(L) # (54): j=2 (63): j=2 ... (86): j=4\n while j >= 2 and ccw(L[-1], L[-2], c[i]): # (55): a=[4, 1], b=[4, 2], c=[3, 3] (60): NO CHANGE ... (92): a=[1, 4], b=[3, 3], c=[0, 1]\n L.pop() # (58): NO CHANGE (73): NO CHANGE (90): NO CHANGE\n j -= 1 # (59): j=1 (74): j=2 (91): j=3\n L.append(c[i]) # (61): NO CHANGE (67): NO CHANGE ... (95): NO CHANGE\n\nans = U # (97): ans=deque([[0, 1], [3, 0], [4, 1], [4, 2], [3, 3], [1, 4]])\nfor i in range(1,len(L)-1): # (98): i=1 (101): i=2 (104): NO CHANGE\n x, y = L[i] # (99): x=3, y=3 (102): x=1, y=4\n ans.append([x,y]) # (100): NO CHANGE (103): NO CHANGE\n\ni = ans.index(sorted(ans, key=lambda x: (x[1],x[0]))[0]) # (105): i=1\nans = list(ans) # (106): NO CHANGE\nfor x,y in ans[:i] + ans[i:]: # (107): x=0, y=1 (109): x=3, y=0 ... (117): x=1, y=4\n print(x, y) # (108): NO CHANGE (110): NO CHANGE ... (118): NO CHANGE\n"], "anno_status": [false], "diff_content": " from math import sqrt\n from collections import deque\n \n def sub(a, b):\n return [a[0] - b[0],a[1] - b[1]]\n \n def cross(a, b):\n return a[0] * b[1] - a[1] * b[0]\n \n def ccw(a, b, c):\n x = sub(b, a)\n y = sub(c, a)\n return cross(x, y) > 0\n \n n = int(input())\n c = [list(map(int, input().split())) for i in range(n)]\n c.sort(key=lambda x: (x[0], x[1]))\n U = deque(c[:2])\n \n for i in range(2, n):\n j = len(U)\n while j >= 2 and ccw(U[-1],U[-2],c[i]):\n U.pop()\n j -= 1\n U.append(c[i])\n \n c = c[::-1]\n L = deque(c[:2])\n \n for i in range(2, n):\n j = len(L)\n while j >= 2 and ccw(L[-1], L[-2], c[i]):\n L.pop()\n j -= 1\n L.append(c[i])\n \n ans = U\n for i in range(1,len(L)-1):\n x, y = L[i]\n ans.append([x,y])\n \n+print(len(ans))\n i = ans.index(sorted(ans, key=lambda x: (x[1],x[0]))[0])\n ans = list(ans)\n-for x,y in ans[:i] + ans[i:]:\n+for x,y in ans[i:] + ans[:i]:\n print(x, y)\n \n", "FL_content": " from math import sqrt\n from collections import deque\n \n def sub(a, b):\n return [a[0] - b[0],a[1] - b[1]]\n \n def cross(a, b):\n return a[0] * b[1] - a[1] * b[0]\n \n def ccw(a, b, c):\n x = sub(b, a)\n y = sub(c, a)\n return cross(x, y) > 0\n \n n = int(input())\n c = [list(map(int, input().split())) for i in range(n)]\n c.sort(key=lambda x: (x[0], x[1]))\n U = deque(c[:2])\n \n for i in range(2, n):\n j = len(U)\n while j >= 2 and ccw(U[-1],U[-2],c[i]):\n U.pop()\n j -= 1\n U.append(c[i])\n \n c = c[::-1]\n L = deque(c[:2])\n \n for i in range(2, n):\n j = len(L)\n while j >= 2 and ccw(L[-1], L[-2], c[i]):\n L.pop()\n j -= 1\n L.append(c[i])\n \n ans = U\n for i in range(1,len(L)-1):\n x, y = L[i]\n ans.append([x,y])\n \n i = ans.index(sorted(ans, key=lambda x: (x[1],x[0]))[0])\n ans = list(ans)\n-for x,y in ans[:i] + ans[i:]:\n print(x, y)\n \n", "added_lines": 2, "removed_lines": 1, "code1_lines": 46 }, { "user_id": "u022407960", "problem_id": "p02300", "submission1_id": "s096994043", "submission2_id": "s230011031", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) != -1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) != -1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n lower.reverse()\n lower.sort(key=attrgetter('imag', 'real'))\n \n\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "code2": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.reverse()\n \n lower_min = min(lower, key=attrgetter('imag', 'real'))\n \n min_index = lower.index(lower_min)\n lower_right = lower[min_index:]\n lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n lower_right.append(upper[k])\n return lower_right + lower_left\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1480727401", "date2": "1480734264", "bleu_score": "0.9042930828817721", "code1_test_status": [0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0], "code1_test_score": 32, "total_score": 102, "input": "4\n0 0\n2 3\n1 2\n0 1\n", "actual_output": "3\n0 0\n2 3\n0 1\n", "expected_output": "4\n0 0\n2 3\n1 2\n0 1\n\n", "anno_code": ["\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9 # (0): EPS=1e-09\n\n\ndef cross(a, b): # (1): cross=\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b): # (2): dot=\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2): # (3): check_ccw=\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon): # (4): convex_check_Andrew=\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) != -1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) != -1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n lower.reverse()\n lower.sort(key=attrgetter('imag', 'real'))\n \n\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))"], "anno_status": [false], "diff_content": " \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n- while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) != -1:\n+ while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n- while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) != -1:\n+ while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n+ \n lower.reverse()\n- lower.sort(key=attrgetter('imag', 'real'))\n \n-\n+ lower_min = min(lower, key=attrgetter('imag', 'real'))\n+ \n+ min_index = lower.index(lower_min)\n+ lower_right = lower[min_index:]\n+ lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n- lower.append(upper[k])\n-\n- return lower\n+ lower_right.append(upper[k])\n+ return lower_right + lower_left\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "FL_content": " \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n- while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) != -1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n- while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) != -1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n lower.reverse()\n- lower.sort(key=attrgetter('imag', 'real'))\n \n-\n for k in range(len(upper) - 2, 0, -1):\n- lower.append(upper[k])\n-\n- return lower\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "added_lines": 10, "removed_lines": 7, "code1_lines": 80 }, { "user_id": "u022407960", "problem_id": "p02300", "submission1_id": "s768462614", "submission2_id": "s230011031", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n lower.reverse()\n\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n ans.sort(key=attrgetter('imag', 'real'))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "code2": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.reverse()\n \n lower_min = min(lower, key=attrgetter('imag', 'real'))\n \n min_index = lower.index(lower_min)\n lower_right = lower[min_index:]\n lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n lower_right.append(upper[k])\n return lower_right + lower_left\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1480731369", "date2": "1480734264", "bleu_score": "0.8928917419292481", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "4\n1 1\n3 0\n0 2\n0 1\n", "actual_output": "3 0\n0 1\n0 2\n", "expected_output": "3\n3 0\n0 2\n0 1\n\n", "anno_code": ["\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9 # (0): EPS=1e-09\n\n\ndef cross(a, b): # (1): cross=\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b): # (2): dot=\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2): # (3): check_ccw=\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon): # (4): convex_check_Andrew=\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n lower.reverse()\n\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n ans.sort(key=attrgetter('imag', 'real'))\n for ele in ans:\n print(int(ele.real), int(ele.imag))"], "anno_status": [false], "diff_content": " \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n+ \n lower.reverse()\n-\n+ \n+ lower_min = min(lower, key=attrgetter('imag', 'real'))\n+ \n+ min_index = lower.index(lower_min)\n+ lower_right = lower[min_index:]\n+ lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n- lower.append(upper[k])\n-\n- return lower\n+ lower_right.append(upper[k])\n+ return lower_right + lower_left\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n- ans.sort(key=attrgetter('imag', 'real'))\n+ print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "FL_content": " \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n lower.reverse()\n-\n for k in range(len(upper) - 2, 0, -1):\n- lower.append(upper[k])\n-\n- return lower\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n- ans.sort(key=attrgetter('imag', 'real'))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "added_lines": 10, "removed_lines": 5, "code1_lines": 78 }, { "user_id": "u858748695", "problem_id": "p03187", "submission1_id": "s354571369", "submission2_id": "s094567222", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nfrom itertools import accumulate\nL, N = map(int, input().split())\nX = [int(input()) for _ in range(N)]\nY = [L - x for x in X][::-1]\n\nsx = [0] + list(accumulate(X))\nsy = [0] + list(accumulate(Y))\n\nans = 0\nfor i in range(N):\n j = N - i - 1\n mn = min(i, j)\n\n now = X[i]\n now += 2 * (sx[i] - sx[i - mn]) + 2 * (sy[j] - sy[j - mn - (i < j)])\n print(i - mn)\n ans = max(ans, now)\n\n now = Y[j]\n now += 2 * (sx[i] - sx[i - mn - (i > j)]) + 2 * (sy[j] - sy[j - mn])\n ans = max(ans, now)\n\nprint(ans)\n", "code2": "\nfrom itertools import accumulate\nL, N = map(int, input().split())\nX = [int(input()) for _ in range(N)]\nY = [L - x for x in X][::-1]\n\nsx = [0] + list(accumulate(X))\nsy = [0] + list(accumulate(Y))\n\nans = 0\nfor i in range(N):\n j = N - i - 1\n mn = min(i, j)\n\n now = X[i]\n now += 2 * (sx[i] - sx[i - mn]) + 2 * (sy[j] - sy[j - mn - (i < j)])\n ans = max(ans, now)\n\n now = Y[j]\n now += 2 * (sx[i] - sx[i - mn - (i > j)]) + 2 * (sy[j] - sy[j - mn])\n ans = max(ans, now)\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1546298640", "date2": "1546298684", "bleu_score": "0.9645707027057355", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "67 3\n0\n22\n29\n", "actual_output": "0\n0\n2\n121\n", "expected_output": "121\n\n", "anno_code": ["\nfrom itertools import accumulate\nL, N = map(int, input().split()) # (0): L=67, N=3\nX = [int(input()) for _ in range(N)] # (1): X=[0, 22, 29]\nY = [L - x for x in X][::-1] # (2): Y=[38, 45, 67]\n\nsx = [0] + list(accumulate(X)) # (3): sx=[0, 0, 22, 51]\nsy = [0] + list(accumulate(Y)) # (4): sy=[0, 38, 83, 150]\n\nans = 0 # (5): ans=0\nfor i in range(N): # (6): i=0 (16): i=1 ... (36): NO CHANGE\n j = N - i - 1 # (7): j=2 (17): j=1 (27): j=0\n mn = min(i, j) # (8): mn=0 (18): mn=1 (28): mn=0\n\n now = X[i] # (9): now=0 (19): now=22 (29): now=29\n now += 2 * (sx[i] - sx[i - mn]) + 2 * (sy[j] - sy[j - mn - (i < j)]) # (10): now=90 (20): now=98 (30): NO CHANGE\n print(i - mn) # (11): NO CHANGE (21): NO CHANGE (31): NO CHANGE\n ans = max(ans, now) # (12): ans=90 (22): ans=98 (32): NO CHANGE\n\n now = Y[j] # (13): now=67 (23): now=45 (33): now=38\n now += 2 * (sx[i] - sx[i - mn - (i > j)]) + 2 * (sy[j] - sy[j - mn]) # (14): NO CHANGE (24): now=121 (34): now=82\n ans = max(ans, now) # (15): NO CHANGE (25): ans=121 (35): NO CHANGE\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " \n from itertools import accumulate\n L, N = map(int, input().split())\n X = [int(input()) for _ in range(N)]\n Y = [L - x for x in X][::-1]\n \n sx = [0] + list(accumulate(X))\n sy = [0] + list(accumulate(Y))\n \n ans = 0\n for i in range(N):\n j = N - i - 1\n mn = min(i, j)\n \n now = X[i]\n now += 2 * (sx[i] - sx[i - mn]) + 2 * (sy[j] - sy[j - mn - (i < j)])\n- print(i - mn)\n ans = max(ans, now)\n \n now = Y[j]\n now += 2 * (sx[i] - sx[i - mn - (i > j)]) + 2 * (sy[j] - sy[j - mn])\n ans = max(ans, now)\n \n print(ans)\n \n", "FL_content": " \n from itertools import accumulate\n L, N = map(int, input().split())\n X = [int(input()) for _ in range(N)]\n Y = [L - x for x in X][::-1]\n \n sx = [0] + list(accumulate(X))\n sy = [0] + list(accumulate(Y))\n \n ans = 0\n for i in range(N):\n j = N - i - 1\n mn = min(i, j)\n \n now = X[i]\n now += 2 * (sx[i] - sx[i - mn]) + 2 * (sy[j] - sy[j - mn - (i < j)])\n- print(i - mn)\n ans = max(ans, now)\n \n now = Y[j]\n now += 2 * (sx[i] - sx[i - mn - (i > j)]) + 2 * (sy[j] - sy[j - mn])\n ans = max(ans, now)\n \n print(ans)\n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 25 }, { "user_id": "u785989355", "problem_id": "p03187", "submission1_id": "s414659188", "submission2_id": "s466229163", "status1": "Wrong Answer", "status2": "Accepted", "code1": "L,N = list(map(int,input().split()))\nX=[]\nY=[]\nSX=[0]\nSY=[0]\nsx=0\nsy=0\nfor i in range(N):\n x=int(input())\n X.append(x)\n sx+=x\n SX.append(sx)\n Y.append(L-x)\n sy+=L-x\n SY.append(sy) \n\nmax_score=0 \nfor i in range(N):\n if i>N-i-1:\n max_score=max(2*(SX[i]-SX[2*i-N])+2*(SY[N]-SY[i+1])+Y[i],max_score)\n elif iN-i-1:\n max_score=max(2*(SX[i]-SX[2*i-N])+2*(SY[N]-SY[i+1])+Y[i],max_score)\n elif iN-i-1: # (34): NO CHANGE (41): NO CHANGE (47): NO CHANGE\n max_score=max(2*(SX[i]-SX[2*i-N])+2*(SY[N]-SY[i+1])+Y[i],max_score) # (48): NO CHANGE\n elif iN-i-1:\n max_score=max(2*(SX[i]-SX[2*i-N])+2*(SY[N]-SY[i+1])+Y[i],max_score)\n elif iN-i-1:\n max_score=max(2*(SX[i]-SX[2*i-N])+2*(SY[N]-SY[i+1])+Y[i],max_score)\n elif i 0:\n while left < N and (A[left] & -A[left]).bit_length() > digit:\n left += 1\n\n if left >= N or (A[left] & -A[left]).bit_length() != digit:\n print(-1)\n exit()\n\n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n\nif xor:\n for a in A:\n if a % 2 == 1:\n ans += 1\n break\n else:\n print(-1)\n exit()\n\nprint(ans)", "code2": "N = int(input())\nA = [int(input()) for _ in range(N)]\n\nA.sort(reverse=True, key=lambda a: (a & -a))\n\nxor = 0\nfor a in A:\n xor ^= a\n\nleft = 0\nans = 0\n\nfor digit in range(xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n while left < N and ((A[left] & -A[left]).bit_length() - 1) > digit:\n left += 1\n\n if left >= N or ((A[left] & -A[left]).bit_length() - 1) != digit:\n print(-1)\n exit()\n\n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1570894790", "date2": "1570896477", "bleu_score": "0.7731831643381074", "code1_test_status": [1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 72, "total_score": 89, "input": "3\n001\n110\n100\n", "actual_output": "3\n", "expected_output": "-1\n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = [int(input()) for _ in range(N)] # (1): A=[1, 110, 100]\n\nA.sort(reverse=True, key=lambda a: (a & -a)) # (2): A=[100, 110, 1]\n\nxor = 0 # (3): xor=0\nfor a in A: # (4): a=100 (6): a=110 ... (10): NO CHANGE\n xor ^= a # (5): xor=100 (7): xor=10 (9): xor=11\n\nleft = 0 # (11): left=0\nans = 0 # (12): ans=0\n\nfor digit in range(1, xor.bit_length() + 1)[:: -1]: # (13): digit=4 (15): digit=3 ... (37): NO CHANGE\n if (xor & (1 << digit)) > 0: # (14): NO CHANGE (16): NO CHANGE ... (30): NO CHANGE\n while left < N and (A[left] & -A[left]).bit_length() > digit: # (17): NO CHANGE (23): NO CHANGE ... (33): NO CHANGE\n left += 1 # (24): left=1 (32): left=2\n\n if left >= N or (A[left] & -A[left]).bit_length() != digit: # (18): NO CHANGE (26): NO CHANGE (34): NO CHANGE\n print(-1)\n exit()\n\n ans += 1 # (19): ans=1 (27): ans=2 (35): ans=3\n xor ^= ((1 << (digit + 1)) - 1) # (20): xor=4 (28): xor=3 (36): xor=0\n\nif xor: # (38): NO CHANGE\n for a in A:\n if a % 2 == 1:\n ans += 1\n break\n else:\n print(-1)\n exit()\n\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n A = [int(input()) for _ in range(N)]\n \n A.sort(reverse=True, key=lambda a: (a & -a))\n \n xor = 0\n for a in A:\n xor ^= a\n \n left = 0\n ans = 0\n \n-for digit in range(1, xor.bit_length() + 1)[:: -1]:\n+for digit in range(xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n- while left < N and (A[left] & -A[left]).bit_length() > digit:\n+ while left < N and ((A[left] & -A[left]).bit_length() - 1) > digit:\n left += 1\n \n- if left >= N or (A[left] & -A[left]).bit_length() != digit:\n+ if left >= N or ((A[left] & -A[left]).bit_length() - 1) != digit:\n print(-1)\n exit()\n \n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n \n-if xor:\n- for a in A:\n- if a % 2 == 1:\n- ans += 1\n- break\n- else:\n- print(-1)\n- exit()\n-\n print(ans)\n", "FL_content": " N = int(input())\n A = [int(input()) for _ in range(N)]\n \n A.sort(reverse=True, key=lambda a: (a & -a))\n \n xor = 0\n for a in A:\n xor ^= a\n \n left = 0\n ans = 0\n \n-for digit in range(1, xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n- while left < N and (A[left] & -A[left]).bit_length() > digit:\n left += 1\n \n- if left >= N or (A[left] & -A[left]).bit_length() != digit:\n print(-1)\n exit()\n \n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n \n-if xor:\n- for a in A:\n- if a % 2 == 1:\n- ans += 1\n- break\n- else:\n- print(-1)\n- exit()\n-\n print(ans)\n", "added_lines": 3, "removed_lines": 12, "code1_lines": 34 }, { "user_id": "u754022296", "problem_id": "p03880", "submission1_id": "s022571856", "submission2_id": "s230585668", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nA = [int(input()) for _ in range(n)]\nm = 30\nC = [False]*m\nx = 0\nfor a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\ntotal = 0\nans = 0\nfor i in range(m):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\nelse:\n print(ans)", "code2": "n = int(input())\nA = [int(input()) for _ in range(n)]\nm = 30\nC = [False]*m\nx = 0\nfor a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\n break\ntotal = 0\nans = 0\nfor i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\nelse:\n print(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1583188218", "date2": "1583188454", "bleu_score": "0.9289522765432772", "code1_test_status": [1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 70, "total_score": 89, "input": "3\n2\n5\n6\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["n = int(input()) # (0): n=3\nA = [int(input()) for _ in range(n)] # (1): A=[2, 5, 6]\nm = 30 # (2): m=30\nC = [False]*m # (3): C=[False, False, ..., False, False]\nx = 0 # (4): x=0\nfor a in A: # (5): a=2 (69): a=5 ... (199): NO CHANGE\n x ^= a # (6): x=2 (70): x=7 (135): x=1\n for i in range(m): # (7): i=0 (9): i=1 ... (198): NO CHANGE\n if a>>i & 1: # (8): NO CHANGE (10): NO CHANGE ... (197): NO CHANGE\n C[i] = True # (11): C=[False, True, ..., False, False] (73): C=[True, True, ..., False, False] ... (143): NO CHANGE\ntotal = 0 # (200): total=0\nans = 0 # (201): ans=0\nfor i in range(m): # (202): i=0 (207): i=1 ... (268): NO CHANGE\n if (x>>i & 1) ^ total: # (203): NO CHANGE (208): NO CHANGE ... (267): NO CHANGE\n if C[i]: # (204): NO CHANGE (209): NO CHANGE\n ans += 1 # (205): ans=1 (210): ans=2\n total ^= 1 # (206): total=1 (211): total=0\n else:\n print(-1)\n break\nelse:\n print(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n A = [int(input()) for _ in range(n)]\n m = 30\n C = [False]*m\n x = 0\n for a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\n+ break\n total = 0\n ans = 0\n-for i in range(m):\n+for i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\n else:\n print(ans)\n", "FL_content": " n = int(input())\n A = [int(input()) for _ in range(n)]\n m = 30\n C = [False]*m\n x = 0\n for a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\n total = 0\n ans = 0\n-for i in range(m):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\n else:\n print(ans)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 22 }, { "user_id": "u392319141", "problem_id": "p03880", "submission1_id": "s179613245", "submission2_id": "s714782629", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = [int(input()) for _ in range(N)]\n\nA.sort(reverse=True, key=lambda a: (a & -a))\n\nxor = 0\nfor a in A:\n xor ^= a\n\nleft = 0\nans = 0\n\nfor digit in range(1, xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n while left < N and (A[left] & -A[left]).bit_length() > digit:\n left += 1\n\n if left >= N:\n print(-1)\n exit()\n\n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n\nif xor:\n for a in A:\n if a % 2 == 1:\n ans += 1\n break\n else:\n print(-1)\n exit()\n\nprint(ans)", "code2": "N = int(input())\nA = [int(input()) for _ in range(N)]\n\nA.sort(reverse=True, key=lambda a: (a & -a))\n\nxor = 0\nfor a in A:\n xor ^= a\n\nleft = 0\nans = 0\n\nfor digit in range(xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n while left < N and ((A[left] & -A[left]).bit_length() - 1) > digit:\n left += 1\n\n if left >= N or ((A[left] & -A[left]).bit_length() - 1) != digit:\n print(-1)\n exit()\n\n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1570894733", "date2": "1570896477", "bleu_score": "0.7788048700666129", "code1_test_status": [0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1], "code1_test_score": 39, "total_score": 89, "input": "3\n111\n100\n111\n", "actual_output": "4\n", "expected_output": "-1\n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = [int(input()) for _ in range(N)] # (1): A=[111, 100, 111]\n\nA.sort(reverse=True, key=lambda a: (a & -a)) # (2): A=[100, 111, 111]\n\nxor = 0 # (3): xor=0\nfor a in A: # (4): a=100 (6): a=111 ... (10): NO CHANGE\n xor ^= a # (5): xor=100 (7): xor=11 (9): xor=100\n\nleft = 0 # (11): left=0\nans = 0 # (12): ans=0\n\nfor digit in range(1, xor.bit_length() + 1)[:: -1]: # (13): digit=7 (15): digit=6 ... (45): NO CHANGE\n if (xor & (1 << digit)) > 0: # (14): NO CHANGE (16): NO CHANGE ... (40): NO CHANGE\n while left < N and (A[left] & -A[left]).bit_length() > digit: # (17): NO CHANGE (25): NO CHANGE ... (41): NO CHANGE\n left += 1 # (34): left=1\n\n if left >= N: # (18): NO CHANGE (26): NO CHANGE ... (42): NO CHANGE\n print(-1)\n exit()\n\n ans += 1 # (19): ans=1 (27): ans=2 ... (43): ans=4\n xor ^= ((1 << (digit + 1)) - 1) # (20): xor=27 (28): xor=4 ... (44): xor=0\n\nif xor: # (46): NO CHANGE\n for a in A:\n if a % 2 == 1:\n ans += 1\n break\n else:\n print(-1)\n exit()\n\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n A = [int(input()) for _ in range(N)]\n \n A.sort(reverse=True, key=lambda a: (a & -a))\n \n xor = 0\n for a in A:\n xor ^= a\n \n left = 0\n ans = 0\n \n-for digit in range(1, xor.bit_length() + 1)[:: -1]:\n+for digit in range(xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n- while left < N and (A[left] & -A[left]).bit_length() > digit:\n+ while left < N and ((A[left] & -A[left]).bit_length() - 1) > digit:\n left += 1\n \n- if left >= N:\n+ if left >= N or ((A[left] & -A[left]).bit_length() - 1) != digit:\n print(-1)\n exit()\n \n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n \n-if xor:\n- for a in A:\n- if a % 2 == 1:\n- ans += 1\n- break\n- else:\n- print(-1)\n- exit()\n-\n print(ans)\n", "FL_content": " N = int(input())\n A = [int(input()) for _ in range(N)]\n \n A.sort(reverse=True, key=lambda a: (a & -a))\n \n xor = 0\n for a in A:\n xor ^= a\n \n left = 0\n ans = 0\n \n-for digit in range(1, xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n- while left < N and (A[left] & -A[left]).bit_length() > digit:\n left += 1\n \n- if left >= N:\n print(-1)\n exit()\n \n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n \n-if xor:\n- for a in A:\n- if a % 2 == 1:\n- ans += 1\n- break\n- else:\n- print(-1)\n- exit()\n-\n print(ans)\n", "added_lines": 3, "removed_lines": 12, "code1_lines": 34 }, { "user_id": "u392319141", "problem_id": "p03880", "submission1_id": "s029173787", "submission2_id": "s714782629", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = [int(input()) for _ in range(N)]\n\nA.sort(reverse=True, key=lambda a: (a & -a))\nD = A[0].bit_length()\n\nxor = 0\nfor a in A:\n xor ^= a\n\nleft = 0\nans = 0\n\nfor digit in range(1, xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n mask = ((1 << (D + 1)) - 1) ^ ((1 << digit) - 1)\n while left < N and (A[left] & mask) != A[left]:\n left += 1\n\n if left >= N:\n print(-1)\n exit()\n\n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n\nif xor:\n for a in A:\n if a % 2 == 1:\n ans += 1\n break\n else:\n print(-1)\n exit()\n\nprint(ans)", "code2": "N = int(input())\nA = [int(input()) for _ in range(N)]\n\nA.sort(reverse=True, key=lambda a: (a & -a))\n\nxor = 0\nfor a in A:\n xor ^= a\n\nleft = 0\nans = 0\n\nfor digit in range(xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n while left < N and ((A[left] & -A[left]).bit_length() - 1) > digit:\n left += 1\n\n if left >= N or ((A[left] & -A[left]).bit_length() - 1) != digit:\n print(-1)\n exit()\n\n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1570894362", "date2": "1570896477", "bleu_score": "0.6903448535849083", "code1_test_status": [0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 81, "total_score": 89, "input": "3\n8\n1\n2\n", "actual_output": "3\n", "expected_output": "-1\n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = [int(input()) for _ in range(N)] # (1): A=[8, 1, 2]\n\nA.sort(reverse=True, key=lambda a: (a & -a)) # (2): A=[8, 2, 1]\nD = A[0].bit_length() # (3): D=4\n\nxor = 0 # (4): xor=0\nfor a in A: # (5): a=8 (7): a=2 ... (11): NO CHANGE\n xor ^= a # (6): xor=8 (8): xor=10 (10): xor=11\n\nleft = 0 # (12): left=0\nans = 0 # (13): ans=0\n\nfor digit in range(1, xor.bit_length() + 1)[:: -1]: # (14): digit=4 (16): digit=3 ... (37): NO CHANGE\n if (xor & (1 << digit)) > 0: # (15): NO CHANGE (17): NO CHANGE ... (31): NO CHANGE\n mask = ((1 << (D + 1)) - 1) ^ ((1 << digit) - 1) # (18): mask=24 (25): mask=28 (32): mask=30\n while left < N and (A[left] & mask) != A[left]: # (19): NO CHANGE (26): NO CHANGE (33): NO CHANGE\n left += 1\n\n if left >= N: # (20): NO CHANGE (27): NO CHANGE (34): NO CHANGE\n print(-1)\n exit()\n\n ans += 1 # (21): ans=1 (28): ans=2 (35): ans=3\n xor ^= ((1 << (digit + 1)) - 1) # (22): xor=4 (29): xor=3 (36): xor=0\n\nif xor: # (38): NO CHANGE\n for a in A:\n if a % 2 == 1:\n ans += 1\n break\n else:\n print(-1)\n exit()\n\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n A = [int(input()) for _ in range(N)]\n \n A.sort(reverse=True, key=lambda a: (a & -a))\n-D = A[0].bit_length()\n \n xor = 0\n for a in A:\n xor ^= a\n \n left = 0\n ans = 0\n \n-for digit in range(1, xor.bit_length() + 1)[:: -1]:\n+for digit in range(xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n- mask = ((1 << (D + 1)) - 1) ^ ((1 << digit) - 1)\n- while left < N and (A[left] & mask) != A[left]:\n+ while left < N and ((A[left] & -A[left]).bit_length() - 1) > digit:\n left += 1\n \n- if left >= N:\n+ if left >= N or ((A[left] & -A[left]).bit_length() - 1) != digit:\n print(-1)\n exit()\n \n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n \n-if xor:\n- for a in A:\n- if a % 2 == 1:\n- ans += 1\n- break\n- else:\n- print(-1)\n- exit()\n-\n print(ans)\n", "FL_content": " N = int(input())\n A = [int(input()) for _ in range(N)]\n \n A.sort(reverse=True, key=lambda a: (a & -a))\n-D = A[0].bit_length()\n \n xor = 0\n for a in A:\n xor ^= a\n \n left = 0\n ans = 0\n \n-for digit in range(1, xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n- mask = ((1 << (D + 1)) - 1) ^ ((1 << digit) - 1)\n- while left < N and (A[left] & mask) != A[left]:\n left += 1\n \n- if left >= N:\n print(-1)\n exit()\n \n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n \n-if xor:\n- for a in A:\n- if a % 2 == 1:\n- ans += 1\n- break\n- else:\n- print(-1)\n- exit()\n-\n print(ans)\n", "added_lines": 3, "removed_lines": 14, "code1_lines": 36 }, { "user_id": "u754022296", "problem_id": "p03880", "submission1_id": "s619249835", "submission2_id": "s230585668", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nA = [int(input()) for _ in range(n)]\nm = 32\nC = [False]*m\nx = 0\nfor a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\ntotal = 0\nans = 0\nfor i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\nelse:\n print(ans)", "code2": "n = int(input())\nA = [int(input()) for _ in range(n)]\nm = 30\nC = [False]*m\nx = 0\nfor a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\n break\ntotal = 0\nans = 0\nfor i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\nelse:\n print(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1583188360", "date2": "1583188454", "bleu_score": "0.9553079095396975", "code1_test_status": [0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1], "code1_test_score": 60, "total_score": 89, "input": "3\n2\n5\n1\n", "actual_output": "2\n", "expected_output": "-1\n\n", "anno_code": ["n = int(input()) # (0): n=3\nA = [int(input()) for _ in range(n)] # (1): A=[2, 5, 1]\nm = 32 # (2): m=32\nC = [False]*m # (3): C=[False, False, ..., False, False]\nx = 0 # (4): x=0\nfor a in A: # (5): a=2 (73): a=5 ... (210): NO CHANGE\n x ^= a # (6): x=2 (74): x=7 (143): x=6\n for i in range(m): # (7): i=0 (9): i=1 ... (209): NO CHANGE\n if a>>i & 1: # (8): NO CHANGE (10): NO CHANGE ... (208): NO CHANGE\n C[i] = True # (11): C=[False, True, ..., False, False] (77): C=[True, True, ..., False, False] ... (146): NO CHANGE\ntotal = 0 # (211): total=0\nans = 0 # (212): ans=0\nfor i in range(m-1, -1, -1): # (213): NO CHANGE (215): i=30 ... (283): NO CHANGE\n if (x>>i & 1) ^ total: # (214): NO CHANGE (216): NO CHANGE ... (279): NO CHANGE\n if C[i]: # (273): NO CHANGE (280): NO CHANGE\n ans += 1 # (274): ans=1 (281): ans=2\n total ^= 1 # (275): total=1 (282): total=0\n else:\n print(-1)\n break\nelse:\n print(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n A = [int(input()) for _ in range(n)]\n-m = 32\n+m = 30\n C = [False]*m\n x = 0\n for a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\n+ break\n total = 0\n ans = 0\n for i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\n else:\n print(ans)\n", "FL_content": " n = int(input())\n A = [int(input()) for _ in range(n)]\n-m = 32\n C = [False]*m\n x = 0\n for a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\n total = 0\n ans = 0\n for i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\n else:\n print(ans)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 22 }, { "user_id": "u754022296", "problem_id": "p03880", "submission1_id": "s307942724", "submission2_id": "s230585668", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nA = [int(input()) for _ in range(n)]\nm = 30\nC = [False]*m\nx = 0\nfor a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\ntotal = 0\nans = 0\nfor i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\nelse:\n print(ans)", "code2": "n = int(input())\nA = [int(input()) for _ in range(n)]\nm = 30\nC = [False]*m\nx = 0\nfor a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\n break\ntotal = 0\nans = 0\nfor i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\nelse:\n print(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1583188133", "date2": "1583188454", "bleu_score": "0.9626534327422193", "code1_test_status": [0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1], "code1_test_score": 60, "total_score": 89, "input": "3\n3\n3\n4\n", "actual_output": "2\n", "expected_output": "-1\n\n", "anno_code": ["n = int(input()) # (0): n=3\nA = [int(input()) for _ in range(n)] # (1): A=[3, 3, 4]\nm = 30 # (2): m=30\nC = [False]*m # (3): C=[False, False, ..., False, False]\nx = 0 # (4): x=0\nfor a in A: # (5): a=3 (70): NO CHANGE ... (199): NO CHANGE\n x ^= a # (6): x=3 (71): x=0 (136): x=4\n for i in range(m): # (7): i=0 (10): i=1 ... (198): NO CHANGE\n if a>>i & 1: # (8): NO CHANGE (11): NO CHANGE ... (197): NO CHANGE\n C[i] = True # (9): C=[True, False, ..., False, False] (12): C=[True, True, ..., False, False] ... (143): C=[True, True, ..., False, False]\ntotal = 0 # (200): total=0\nans = 0 # (201): ans=0\nfor i in range(m-1, -1, -1): # (202): NO CHANGE (204): i=28 ... (268): NO CHANGE\n if (x>>i & 1) ^ total: # (203): NO CHANGE (205): NO CHANGE ... (267): NO CHANGE\n if C[i]: # (258): NO CHANGE (263): NO CHANGE\n ans += 1 # (259): ans=1 (264): ans=2\n total ^= 1 # (260): total=1 (265): total=0\n else:\n print(-1)\n break\nelse:\n print(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n A = [int(input()) for _ in range(n)]\n m = 30\n C = [False]*m\n x = 0\n for a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\n+ break\n total = 0\n ans = 0\n for i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\n else:\n print(ans)\n", "FL_content": " n = int(input())\n A = [int(input()) for _ in range(n)]\n m = 30\n C = [False]*m\n x = 0\n for a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\n total = 0\n ans = 0\n for i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\n else:\n print(ans)\n", "added_lines": 1, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u052499405", "problem_id": "p03880", "submission1_id": "s494428707", "submission2_id": "s199578019", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nxor = 0\nrank = [0] * 35 \nfor i in range(n):\n a = int(input())\n LSB = (a & -a).bit_length()\n rank[LSB] += 1\n xor ^= a \n\nprev = False \nans = 0\nfor i in range(33, -1, -1):\n bit = xor & (1 << i)\n if bit ^ prev:\n if rank[i+1] == 0:\n print(-1)\n exit()\n else:\n ans += 1\n prev = bit\nprint(ans)", "code2": "n = int(input())\nxor = 0\nrank = [0] * 35 \nfor i in range(n):\n a = int(input())\n LSB = (a & -a).bit_length()\n rank[LSB] += 1\n xor ^= a \n\nprev = False \nans = 0\nfor i in range(33, -1, -1):\n bit = xor & (1 << i)\n if (bit > 0 and prev == 0) or (bit == 0 and prev > 0):\n if rank[i+1] == 0:\n print(-1)\n exit()\n else:\n ans += 1\n prev = bit\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566944422", "date2": "1566945050", "bleu_score": "0.8885527757346167", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 83, "total_score": 89, "input": "3\n3\n5\n8\n", "actual_output": "-1\n", "expected_output": "2\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " n = int(input())\n xor = 0\n rank = [0] * 35 \n for i in range(n):\n a = int(input())\n LSB = (a & -a).bit_length()\n rank[LSB] += 1\n xor ^= a \n \n prev = False \n ans = 0\n for i in range(33, -1, -1):\n bit = xor & (1 << i)\n- if bit ^ prev:\n+ if (bit > 0 and prev == 0) or (bit == 0 and prev > 0):\n if rank[i+1] == 0:\n print(-1)\n exit()\n else:\n ans += 1\n prev = bit\n print(ans)\n", "FL_content": " n = int(input())\n xor = 0\n rank = [0] * 35 \n for i in range(n):\n a = int(input())\n LSB = (a & -a).bit_length()\n rank[LSB] += 1\n xor ^= a \n \n prev = False \n ans = 0\n for i in range(33, -1, -1):\n bit = xor & (1 << i)\n- if bit ^ prev:\n if rank[i+1] == 0:\n print(-1)\n exit()\n else:\n ans += 1\n prev = bit\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 21 }, { "user_id": "u218843509", "problem_id": "p03880", "submission1_id": "s195349635", "submission2_id": "s308005181", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = [int(input()) for _ in range(n)]\ngr = 0\nfor x in a:\n\tgr ^= x\nexist = set()\nfor i in range(n):\n\tcnt = 0\n\twhile (a[i]>>cnt)&1 == 0:\n\t\tcnt += 1\n\texist.add(cnt)\nok = True\nans = 0\nfor i in range(35, -1, -1):\n\tif (gr>>i)&1:\n\t\tif i not in exist:\n\t\t\tok = False\n\t\telse:\n\t\t\tgr %= (1<<(i+1))\n\t\t\tgr = (1<<(i+1)) - gr\n\t\t\tans += 1\n\telse:\n\t\tgr %= (1<<(i+1))\nif ok:\n\tprint(ans)\nelse:\n\tprint(-1)", "code2": "n = int(input())\na = [int(input()) for _ in range(n)]\ngr = 0\nfor x in a:\n\tgr ^= x\nexist = set()\nfor i in range(n):\n\tcnt = 0\n\twhile (a[i]>>cnt)&1 == 0:\n\t\tcnt += 1\n\texist.add(cnt)\nok = True\nans = 0\nfor i in range(35, -1, -1):\n\tif (gr>>i)&1:\n\t\tif i not in exist:\n\t\t\tok = False\n\t\telse:\n\t\t\tgr %= (1<<(i+1))\n\t\t\tgr = (1<<(i+1)) - gr - 1\n\t\t\tans += 1\n\telse:\n\t\tgr %= (1<<(i+1))\nif ok:\n\tprint(ans)\nelse:\n\tprint(-1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563858600", "date2": "1563858706", "bleu_score": "0.9862894696901123", "code1_test_status": [0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 77, "total_score": 89, "input": "3\n2\n3\n3\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["n = int(input()) # (0): n=3\na = [int(input()) for _ in range(n)] # (1): a=[2, 3, 3]\ngr = 0 # (2): gr=0\nfor x in a: # (3): x=2 (5): x=3 ... (9): NO CHANGE\n\tgr ^= x # (4): gr=2 (6): gr=1 (8): gr=2\nexist = set() # (10): exist=set()\nfor i in range(n): # (11): i=0 (17): i=1 ... (25): NO CHANGE\n\tcnt = 0 # (12): cnt=0 (18): cnt=0 (22): NO CHANGE\n\twhile (a[i]>>cnt)&1 == 0: # (13): NO CHANGE (15): NO CHANGE ... (23): NO CHANGE\n\t\tcnt += 1 # (14): cnt=1\n\texist.add(cnt) # (16): exist={1} (20): exist={0, 1} (24): NO CHANGE\nok = True # (26): ok=True\nans = 0 # (27): ans=0\nfor i in range(35, -1, -1): # (28): i=35 (31): i=34 ... (139): NO CHANGE\n\tif (gr>>i)&1: # (29): NO CHANGE (32): NO CHANGE ... (137): NO CHANGE\n\t\tif i not in exist: # (132): NO CHANGE\n\t\t\tok = False\n\t\telse:\n\t\t\tgr %= (1<<(i+1)) # (133): NO CHANGE\n\t\t\tgr = (1<<(i+1)) - gr # (134): NO CHANGE\n\t\t\tans += 1 # (135): ans=1\n\telse:\n\t\tgr %= (1<<(i+1)) # (30): NO CHANGE (33): NO CHANGE ... (138): gr=0\nif ok: # (140): NO CHANGE\n\tprint(ans)\nelse:\n\tprint(-1)"], "anno_status": [true], "diff_content": " n = int(input())\n a = [int(input()) for _ in range(n)]\n gr = 0\n for x in a:\n \tgr ^= x\n exist = set()\n for i in range(n):\n \tcnt = 0\n \twhile (a[i]>>cnt)&1 == 0:\n \t\tcnt += 1\n \texist.add(cnt)\n ok = True\n ans = 0\n for i in range(35, -1, -1):\n \tif (gr>>i)&1:\n \t\tif i not in exist:\n \t\t\tok = False\n \t\telse:\n \t\t\tgr %= (1<<(i+1))\n-\t\t\tgr = (1<<(i+1)) - gr\n+\t\t\tgr = (1<<(i+1)) - gr - 1\n \t\t\tans += 1\n \telse:\n \t\tgr %= (1<<(i+1))\n if ok:\n \tprint(ans)\n else:\n \tprint(-1)\n", "FL_content": " n = int(input())\n a = [int(input()) for _ in range(n)]\n gr = 0\n for x in a:\n \tgr ^= x\n exist = set()\n for i in range(n):\n \tcnt = 0\n \twhile (a[i]>>cnt)&1 == 0:\n \t\tcnt += 1\n \texist.add(cnt)\n ok = True\n ans = 0\n for i in range(35, -1, -1):\n \tif (gr>>i)&1:\n \t\tif i not in exist:\n \t\t\tok = False\n \t\telse:\n \t\t\tgr %= (1<<(i+1))\n-\t\t\tgr = (1<<(i+1)) - gr\n \t\t\tans += 1\n \telse:\n \t\tgr %= (1<<(i+1))\n if ok:\n \tprint(ans)\n else:\n \tprint(-1)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 27 }, { "user_id": "u532966492", "problem_id": "p03880", "submission1_id": "s701456298", "submission2_id": "s441252003", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n n = int(input())\n a = [int(input()) for _ in [0]*n]\n m = max(a)\n xor = 0\n for i in a:\n xor ^= i\n i = 1\n cnt = 0\n while True:\n if xor >= i:\n i *= 2\n cnt += 1\n else:\n break\n ans = 0\n for i in range(cnt-1, -1, -1):\n j = (xor & 2**i) \n if j == 1:\n for k in a:\n if k % (2**i) == 0:\n xor ^= k\n xor ^= k-1\n ans += 1\n a.remove(k)\n break\n else:\n print(-1)\n return 0\n print(ans)\n\n\nmain()", "code2": "def main():\n n = int(input())\n a = [int(input()) for _ in [0]*n]\n xor = 0\n for i in a:\n xor ^= i\n i = 1\n cnt = 0\n while True:\n if xor >= i:\n i *= 2\n cnt += 1\n else:\n break\n ans = 0\n for i in range(cnt-1, -1, -1):\n j = (xor & 2**i) \n if j == 1:\n for k in a:\n if (k & 2**i) \n xor ^= k\n xor ^= k-1\n ans += 1\n a.remove(k)\n break\n else:\n print(-1)\n return 0\n print(ans)\n\n\nmain()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576893133", "date2": "1576896212", "bleu_score": "0.9588969878118355", "code1_test_status": [0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0], "code1_test_score": 21, "total_score": 89, "input": "3\n3\n3\n3\n", "actual_output": "1\n", "expected_output": "-1\n\n", "anno_code": ["def main(): # (0): main=\n n = int(input()) # (2): n=3\n a = [int(input()) for _ in [0]*n] # (3): a=[3, 3, 3]\n m = max(a) # (4): m=3\n xor = 0 # (5): xor=0\n for i in a: # (6): i=3 (8): NO CHANGE ... (12): NO CHANGE\n xor ^= i # (7): xor=3 (9): xor=0 (11): xor=3\n i = 1 # (13): i=1\n cnt = 0 # (14): cnt=0\n while True: # (15): NO CHANGE (19): NO CHANGE (23): NO CHANGE\n if xor >= i: # (16): NO CHANGE (20): NO CHANGE (24): NO CHANGE\n i *= 2 # (17): i=2 (21): i=4\n cnt += 1 # (18): cnt=1 (22): cnt=2\n else:\n break # (25): NO CHANGE\n ans = 0 # (26): ans=0\n for i in range(cnt-1, -1, -1): # (27): i=1 (30): i=0 (40): NO CHANGE\n j = (xor & 2**i) # (28): j=2 (31): j=1\n if j == 1: # (29): NO CHANGE (32): NO CHANGE\n for k in a: # (33): k=3\n if k % (2**i) == 0: # (34): NO CHANGE\n xor ^= k # (35): xor=0\n xor ^= k-1 # (36): xor=2\n ans += 1 # (37): ans=1\n a.remove(k) # (38): a=[3, 3]\n break # (39): NO CHANGE\n else:\n print(-1)\n return 0\n print(ans)\n\n\nmain() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " def main():\n n = int(input())\n a = [int(input()) for _ in [0]*n]\n- m = max(a)\n xor = 0\n for i in a:\n xor ^= i\n i = 1\n cnt = 0\n while True:\n if xor >= i:\n i *= 2\n cnt += 1\n else:\n break\n ans = 0\n for i in range(cnt-1, -1, -1):\n j = (xor & 2**i) \n if j == 1:\n for k in a:\n- if k % (2**i) == 0:\n+ if (k & 2**i) \n xor ^= k\n xor ^= k-1\n ans += 1\n a.remove(k)\n break\n else:\n print(-1)\n return 0\n print(ans)\n \n \n main()\n", "FL_content": " def main():\n n = int(input())\n a = [int(input()) for _ in [0]*n]\n- m = max(a)\n xor = 0\n for i in a:\n xor ^= i\n i = 1\n cnt = 0\n while True:\n if xor >= i:\n i *= 2\n cnt += 1\n else:\n break\n ans = 0\n for i in range(cnt-1, -1, -1):\n j = (xor & 2**i) \n if j == 1:\n for k in a:\n- if k % (2**i) == 0:\n xor ^= k\n xor ^= k-1\n ans += 1\n a.remove(k)\n break\n else:\n print(-1)\n return 0\n print(ans)\n \n \n main()\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 33 }, { "user_id": "u729133443", "problem_id": "p03880", "submission1_id": "s242460944", "submission2_id": "s004252308", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,*a=map(int,open(0))\nx=0\nc=[0]*30\nfor i in a:\n x^=i\n c[bin(i^i-1)[::-1].rfind('1')]=1\na=0\nfor i in range(29,-1,-1):\n if x&2**i:\n if c[i]:\n a+=1\n x^=2**i-1\n else:\n print(-1)\n break\nelse:\n print(a)", "code2": "n,*a=map(int,open(0))\nx=0\nc=[0]*30\nfor i in a:\n x^=i\n c[bin(i^i-1)[::-1].rfind('1')]=1\na=0\nfor i in range(29,-1,-1):\n if x&2**i:\n if c[i]:\n a+=1\n x^=2**i-1\n else:\n print(-1)\n break\nelse:\n print(a)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565928417", "date2": "1565928495", "bleu_score": "0.9721500446244715", "code1_test_status": [1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 63, "total_score": 89, "input": "3\n3\n8\n4\n", "actual_output": "-1\n", "expected_output": "1\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n,*a=map(int,open(0))\n x=0\n c=[0]*30\n for i in a:\n x^=i\n c[bin(i^i-1)[::-1].rfind('1')]=1\n a=0\n for i in range(29,-1,-1):\n if x&2**i:\n if c[i]:\n a+=1\n x^=2**i-1\n- else:\n- print(-1)\n- break\n+ else:\n+ print(-1)\n+ break\n else:\n print(a)\n", "FL_content": " n,*a=map(int,open(0))\n x=0\n c=[0]*30\n for i in a:\n x^=i\n c[bin(i^i-1)[::-1].rfind('1')]=1\n a=0\n for i in range(29,-1,-1):\n if x&2**i:\n if c[i]:\n a+=1\n x^=2**i-1\n- else:\n- print(-1)\n- break\n else:\n print(a)\n", "added_lines": 3, "removed_lines": 3, "code1_lines": 17 }, { "user_id": "u767664985", "problem_id": "p03164", "submission1_id": "s155169478", "submission2_id": "s398793481", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, W = map(int, input().split())\nw, v = [0] * N, [0] * N\nfor i in range(N):\n\tw[i], v[i] = map(int, input().split())\n\nV = sum(v)\ndp = [[float(\"inf\")] * (V + 1) for _ in range(N + 1)]\n\ndp[0][0] = 0\n\nfor i in range(N):\n\tfor j in range(V + 1):\n\t\t\n\t\tif j - v[i] >= 0:\n\t\t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j - v[i]] + w[i])\n\t\t\n\t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j])\n\n\n\n\nans = 0\nfor j in range(V):\n\tif dp[N][j] <= W:\n\t\tans = j\n\nprint(ans)\n", "code2": "N, W = map(int, input().split())\nw, v = [0] * N, [0] * N\nfor i in range(N):\n\tw[i], v[i] = map(int, input().split())\n\nV = sum(v)\ndp = [[float(\"inf\")] * (V + 1) for _ in range(N + 1)]\n\ndp[0][0] = 0\n\nfor i in range(N):\n\tfor j in range(V + 1):\n\t\t\n\t\tif j - v[i] >= 0:\n\t\t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j - v[i]] + w[i])\n\t\t\n\t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j])\n\n\n\n\nans = 0\nfor j in range(V + 1):\n\tif dp[N][j] <= W:\n\t\tans = j\n\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1560385271", "date2": "1560385367", "bleu_score": "0.9876446771890272", "code1_test_status": [0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1], "code1_test_score": 57, "total_score": 103, "input": "5 31\n4 0\n0 11\n9 6\n16 20\n4 9\n0 4\n", "actual_output": "40\n", "expected_output": "46\n\n", "anno_code": ["N, W = map(int, input().split()) # (0): N=5, W=31\nw, v = [0] * N, [0] * N # (1): w=[0, 0, 0, 0, 0], v=[0, 0, 0, 0, 0]\nfor i in range(N): # (2): i=0 (4): i=1 ... (12): NO CHANGE\n\tw[i], v[i] = map(int, input().split()) # (3): w=[4, 0, 0, 0, 0] (5): v=[0, 11, 0, 0, 0] ... (11): w=[4, 0, 9, 16, 4], v=[0, 11, 6, 20, 9]\n\nV = sum(v) # (13): V=46\ndp = [[float(\"inf\")] * (V + 1) for _ in range(N + 1)] # (14): dp\n\ndp[0][0] = 0 # (15): dp\n\nfor i in range(N): # (16): i=0 (206): i=1 ... (920): NO CHANGE\n\tfor j in range(V + 1): # (17): j=0 (21): j=1 ... (919): NO CHANGE\n\t\t\n\t\tif j - v[i] >= 0: # (18): NO CHANGE (22): NO CHANGE ... (916): NO CHANGE\n\t\t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j - v[i]] + w[i]) # (19): dp (23): NO CHANGE ... (917): dp\n\t\t\n\t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j]) # (20): dp (24): NO CHANGE ... (918): NO CHANGE\n\n\n\n\nans = 0 # (921): ans=0\nfor j in range(V): # (922): j=0 (925): j=1 ... (1027): NO CHANGE\n\tif dp[N][j] <= W: # (923): NO CHANGE (926): NO CHANGE ... (1026): NO CHANGE\n\t\tans = j # (924): NO CHANGE (937): ans=6 ... (1016): ans=40\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " N, W = map(int, input().split())\n w, v = [0] * N, [0] * N\n for i in range(N):\n \tw[i], v[i] = map(int, input().split())\n \n V = sum(v)\n dp = [[float(\"inf\")] * (V + 1) for _ in range(N + 1)]\n \n dp[0][0] = 0\n \n for i in range(N):\n \tfor j in range(V + 1):\n \t\t\n \t\tif j - v[i] >= 0:\n \t\t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j - v[i]] + w[i])\n \t\t\n \t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j])\n \n \n \n \n ans = 0\n-for j in range(V):\n+for j in range(V + 1):\n \tif dp[N][j] <= W:\n \t\tans = j\n \n print(ans)\n \n", "FL_content": " N, W = map(int, input().split())\n w, v = [0] * N, [0] * N\n for i in range(N):\n \tw[i], v[i] = map(int, input().split())\n \n V = sum(v)\n dp = [[float(\"inf\")] * (V + 1) for _ in range(N + 1)]\n \n dp[0][0] = 0\n \n for i in range(N):\n \tfor j in range(V + 1):\n \t\t\n \t\tif j - v[i] >= 0:\n \t\t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j - v[i]] + w[i])\n \t\t\n \t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j])\n \n \n \n \n ans = 0\n-for j in range(V):\n \tif dp[N][j] <= W:\n \t\tans = j\n \n print(ans)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 28 }, { "user_id": "u612223903", "problem_id": "p03164", "submission1_id": "s954761711", "submission2_id": "s737219767", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,W = map(int,input().split())\nw = []\nv = []\nfor _ in range(n):\n weight,value = map(int,input().split())\n w.append(weight)\n v.append(value)\nINF =float(\"inf\")\norder = 150\ndp = [[INF] * order for _ in range(n+1)] \ndp[0] =[-INF] * order\ndp[0][0]=0\nfor i in range(n):\n for value in range(order):\n if value - v[i] >= 0:\n dp[i+1][value] = min(dp[i+1][value], dp[i][value-v[i]] + w[i])\n if dp[i][value] != -INF:\n dp[i+1][value] = min(dp[i+1][value],dp[i][value])\nans = 0\nfor value in range(order):\n if 0<=dp[n][value]<= W:\n ans = max(ans,value)\n\nprint(ans)\n", "code2": "n,W = map(int,input().split())\nw = []\nv = []\nfor _ in range(n):\n weight,value = map(int,input().split())\n w.append(weight)\n v.append(value)\n\nINF = float(\"inf\")\norder = 10**5 + 1 \ndp = [[INF] * order for _ in range(n+1)] \ndp[0][0] = 0\n\nfor i in range(n):\n for value in range(order):\n if value-v[i]>= 0:\n dp[i+1][value] = min(dp[i+1][value],dp[i][value-v[i]] + w[i])\n dp[i+1][value] = min(dp[i+1][value],dp[i][value])\n\nans = 0\nfor value in range(order):\n if dp[n][value] <= W:\n ans = max(ans,value)\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589627163", "date2": "1589628450", "bleu_score": "0.8679569246042043", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 90, "total_score": 103, "input": "3 1\n0 0\n-1 42\n1 180\n", "actual_output": "0\n", "expected_output": "222\n\n", "anno_code": ["n,W = map(int,input().split()) # (0): n=3, W=1\nw = [] # (1): w=[]\nv = [] # (2): v=[]\nfor _ in range(n): # (3): _=0 (7): _=1 ... (15): NO CHANGE\n weight,value = map(int,input().split()) # (4): weight=0, value=0 (8): weight=-1, value=42 (12): weight=1, value=180\n w.append(weight) # (5): w=[0] (9): w=[0, -1] (13): w=[0, -1, 1]\n v.append(value) # (6): v=[0] (10): v=[0, 42] (14): v=[0, 42, 180]\nINF =float(\"inf\") # (16): INF=inf\norder = 150 # (17): order=150\ndp = [[INF] * order for _ in range(n+1)] # (18): dp\ndp[0] =[-INF] * order # (19): dp\ndp[0][0]=0 # (20): dp\nfor i in range(n): # (21): i=0 (624): i=1 ... (1680): NO CHANGE\n for value in range(order): # (22): value=0 (27): value=1 ... (1679): NO CHANGE\n if value - v[i] >= 0: # (23): NO CHANGE (28): NO CHANGE ... (1677): NO CHANGE\n dp[i+1][value] = min(dp[i+1][value], dp[i][value-v[i]] + w[i]) # (24): dp (29): dp ... (1182): dp\n if dp[i][value] != -INF: # (25): NO CHANGE (30): NO CHANGE ... (1678): NO CHANGE\n dp[i+1][value] = min(dp[i+1][value],dp[i][value]) # (26): NO CHANGE (628): dp ... (1357): dp\nans = 0 # (1681): ans=0\nfor value in range(order): # (1682): value=0 (1685): value=1 ... (1983): NO CHANGE\n if 0<=dp[n][value]<= W: # (1683): NO CHANGE (1686): NO CHANGE ... (1982): NO CHANGE\n ans = max(ans,value) # (1684): NO CHANGE\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " n,W = map(int,input().split())\n w = []\n v = []\n for _ in range(n):\n weight,value = map(int,input().split())\n w.append(weight)\n v.append(value)\n-INF =float(\"inf\")\n-order = 150\n+\n+INF = float(\"inf\")\n+order = 10**5 + 1 \n dp = [[INF] * order for _ in range(n+1)] \n-dp[0] =[-INF] * order\n-dp[0][0]=0\n-for i in range(n):\n+dp[0][0] = 0\n+\n+for i in range(n):\n for value in range(order):\n- if value - v[i] >= 0:\n- dp[i+1][value] = min(dp[i+1][value], dp[i][value-v[i]] + w[i])\n- if dp[i][value] != -INF:\n- dp[i+1][value] = min(dp[i+1][value],dp[i][value])\n+ if value-v[i]>= 0:\n+ dp[i+1][value] = min(dp[i+1][value],dp[i][value-v[i]] + w[i])\n+ dp[i+1][value] = min(dp[i+1][value],dp[i][value])\n+\n ans = 0\n for value in range(order):\n- if 0<=dp[n][value]<= W:\n+ if dp[n][value] <= W:\n ans = max(ans,value)\n-\n print(ans)\n-\n", "FL_content": " n,W = map(int,input().split())\n w = []\n v = []\n for _ in range(n):\n weight,value = map(int,input().split())\n w.append(weight)\n v.append(value)\n-INF =float(\"inf\")\n-order = 150\n dp = [[INF] * order for _ in range(n+1)] \n-dp[0] =[-INF] * order\n-dp[0][0]=0\n-for i in range(n):\n for value in range(order):\n- if value - v[i] >= 0:\n- dp[i+1][value] = min(dp[i+1][value], dp[i][value-v[i]] + w[i])\n- if dp[i][value] != -INF:\n- dp[i+1][value] = min(dp[i+1][value],dp[i][value])\n ans = 0\n for value in range(order):\n- if 0<=dp[n][value]<= W:\n ans = max(ans,value)\n-\n print(ans)\n-\n", "added_lines": 11, "removed_lines": 12, "code1_lines": 25 }, { "user_id": "u743391186", "problem_id": "p03164", "submission1_id": "s904827753", "submission2_id": "s718043377", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,W = map(int,input().split())\nweight = []\nvalue = []\nfor i in range(N):\n w,v = map(int,input().split())\n weight.append(w)\n value.append(v)\nmaxValue = N*1000\ndp = [[0 for i in range(maxValue+1)] for j in range(N+1)]\nfor i in range(maxValue+1):\n dp[0][i] = float(\"inf\")\ndp[0][0] = 0\ndp[0][value[0]] = weight[0]\nfor i in range(1,N+1):\n op2 = float(\"inf\")\n for v in range(maxValue+1):\n dp[i][v] = dp[i-1][v]\n if value[i-1] > v: continue;\n dp[i][v] = min(dp[i][v],weight[i-1] + dp[i-1][v-value[i-1]])\nans = 0\nfor x in range(maxValue+1):\n if dp[N][x] <= W:\n ans = x\nprint(ans)", "code2": "N,W = map(int,input().split())\nweight = [0]\nvalue = [0]\nfor i in range(N):\n w,v = map(int,input().split())\n weight.append(w)\n value.append(v)\n \nmaxValue = sum(value)\nINF = 10**10\ndp = [[INF for i in range(maxValue+1)] for j in range(N+1)]\nfor i in range(N+1):\n dp[i][0] = 0\nfor i in range(1,N+1):\n for v in range(1,maxValue+1):\n if value[i] <= v:\n dp[i][v] = min(dp[i-1][v],weight[i] + dp[i-1][v-value[i]])\n else:\n dp[i][v] = dp[i-1][v]\nans = 0\nfor x in range(maxValue+1):\n if dp[N][x] <= W:\n ans = x\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1588722987", "date2": "1588728257", "bleu_score": "0.825531349372796", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1], "code1_test_score": 63, "total_score": 103, "input": "3 23\n2 9\n1 46\n1 145\n", "actual_output": "209\n", "expected_output": "200\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N,W = map(int,input().split())\n-weight = []\n-value = []\n+weight = [0]\n+value = [0]\n for i in range(N):\n w,v = map(int,input().split())\n weight.append(w)\n value.append(v)\n-maxValue = N*1000\n-dp = [[0 for i in range(maxValue+1)] for j in range(N+1)]\n-for i in range(maxValue+1):\n- dp[0][i] = float(\"inf\")\n-dp[0][0] = 0\n-dp[0][value[0]] = weight[0]\n+ \n+maxValue = sum(value)\n+INF = 10**10\n+dp = [[INF for i in range(maxValue+1)] for j in range(N+1)]\n+for i in range(N+1):\n+ dp[i][0] = 0\n for i in range(1,N+1):\n- op2 = float(\"inf\")\n- for v in range(maxValue+1):\n- dp[i][v] = dp[i-1][v]\n- if value[i-1] > v: continue;\n- dp[i][v] = min(dp[i][v],weight[i-1] + dp[i-1][v-value[i-1]])\n+ for v in range(1,maxValue+1):\n+ if value[i] <= v:\n+ dp[i][v] = min(dp[i-1][v],weight[i] + dp[i-1][v-value[i]])\n+ else:\n+ dp[i][v] = dp[i-1][v]\n ans = 0\n for x in range(maxValue+1):\n if dp[N][x] <= W:\n ans = x\n print(ans)\n", "FL_content": " N,W = map(int,input().split())\n-weight = []\n-value = []\n for i in range(N):\n w,v = map(int,input().split())\n weight.append(w)\n value.append(v)\n-maxValue = N*1000\n-dp = [[0 for i in range(maxValue+1)] for j in range(N+1)]\n-for i in range(maxValue+1):\n- dp[0][i] = float(\"inf\")\n-dp[0][0] = 0\n-dp[0][value[0]] = weight[0]\n for i in range(1,N+1):\n- op2 = float(\"inf\")\n- for v in range(maxValue+1):\n- dp[i][v] = dp[i-1][v]\n- if value[i-1] > v: continue;\n- dp[i][v] = min(dp[i][v],weight[i-1] + dp[i-1][v-value[i-1]])\n ans = 0\n for x in range(maxValue+1):\n if dp[N][x] <= W:\n ans = x\n print(ans)\n", "added_lines": 13, "removed_lines": 13, "code1_lines": 24 }, { "user_id": "u871201743", "problem_id": "p03164", "submission1_id": "s504213395", "submission2_id": "s083495067", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\n\nMAX_VAL = 100000\nN, W = map(int, input().split())\n\ndp = defaultdict(lambda: 1e9)\ndp[0] = 1\nans = 0\nfor _ in range(N):\n w, v = map(int, input().split())\n for k in range(MAX_VAL, -1, -1):\n dp[k + v] = min(dp[k+v], dp[k] + w)\n if dp[k + v] <= W:\n ans = max(ans, k + v)\n\n\nprint(ans)\n", "code2": "from collections import defaultdict\n\nN, W = map(int, input().split())\n\ndp = defaultdict(lambda: 1e9)\ndp[0] = 0\nans = 0\nfor _ in range(N):\n w, v = map(int, input().split())\n keys = sorted(dp.keys(), reverse=True)\n for k in keys:\n dp[k + v] = min(dp[k + v], dp[k] + w)\n if dp[k + v] <= W:\n ans = max(ans, k + v)\n\n\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575428122", "date2": "1575428647", "bleu_score": "0.8546623767515183", "code1_test_status": [0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1], "code1_test_score": 79, "total_score": 103, "input": "2 0\n5 6\n0 29\n8 191\n", "actual_output": "0\n", "expected_output": "29\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " from collections import defaultdict\n \n-MAX_VAL = 100000\n N, W = map(int, input().split())\n \n dp = defaultdict(lambda: 1e9)\n-dp[0] = 1\n+dp[0] = 0\n ans = 0\n for _ in range(N):\n w, v = map(int, input().split())\n- for k in range(MAX_VAL, -1, -1):\n- dp[k + v] = min(dp[k+v], dp[k] + w)\n+ keys = sorted(dp.keys(), reverse=True)\n+ for k in keys:\n+ dp[k + v] = min(dp[k + v], dp[k] + w)\n if dp[k + v] <= W:\n ans = max(ans, k + v)\n \n \n print(ans)\n \n", "FL_content": " from collections import defaultdict\n \n-MAX_VAL = 100000\n N, W = map(int, input().split())\n \n dp = defaultdict(lambda: 1e9)\n-dp[0] = 1\n ans = 0\n for _ in range(N):\n w, v = map(int, input().split())\n- for k in range(MAX_VAL, -1, -1):\n- dp[k + v] = min(dp[k+v], dp[k] + w)\n if dp[k + v] <= W:\n ans = max(ans, k + v)\n \n \n print(ans)\n \n", "added_lines": 4, "removed_lines": 4, "code1_lines": 18 }, { "user_id": "u309141201", "problem_id": "p03164", "submission1_id": "s912453719", "submission2_id": "s622208833", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, W = map(int, input().split())\nw = [0]\nv = [0]\nfor _ in range(N):\n x, y = map(int, input().split())\n w.append(x)\n v.append(y)\ndp = [[0 for _ in range(10**5 + 1)] for _ in range(N+1)]\nfor i in range(1, 10**5 + 1):\n dp[0][i] = float('inf')\n\nfor i in range(1, N+1):\n for j in range(10**5 + 1):\n dp[i][j] = dp[i-1][j]\n if j - v[i-1] >= 0:\n dp[i][j] = min(dp[i][j], dp[i-1][j-v[i]] + w[i])\n\nans = 0\nfor k in range(10**5 + 1):\n if dp[N][k] <= W:\n ans = max(ans, k)\n\n\nprint(ans)", "code2": "N, W = map(int, input().split())\nw = [0]\nv = [0]\nfor _ in range(N):\n x, y = map(int, input().split())\n w.append(x)\n v.append(y)\n\ndp = [[0 for _ in range(10**5 + 1)] for _ in range(N+1)]\nfor i in range(1, 10**5 + 1):\n dp[0][i] = float('inf')\n\nfor i in range(1, N+1):\n for j in range(10**5 + 1):\n dp[i][j] = dp[i-1][j]\n if j - v[i] >= 0:\n dp[i][j] = min(dp[i][j], dp[i-1][j-v[i]] + w[i])\n\nans = 0\nfor k in range(10**5 + 1):\n if dp[N][k] <= W:\n ans = max(ans, k)\n\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587657179", "date2": "1587657453", "bleu_score": "0.9903908038982491", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 103, "input": "6 7\n6 5\n5 6\n3 3\n6 6\n3 5\n7 2\n", "actual_output": "6\n", "expected_output": "8\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N, W = map(int, input().split())\n w = [0]\n v = [0]\n for _ in range(N):\n x, y = map(int, input().split())\n w.append(x)\n v.append(y)\n+\n dp = [[0 for _ in range(10**5 + 1)] for _ in range(N+1)]\n for i in range(1, 10**5 + 1):\n dp[0][i] = float('inf')\n \n for i in range(1, N+1):\n for j in range(10**5 + 1):\n dp[i][j] = dp[i-1][j]\n- if j - v[i-1] >= 0:\n+ if j - v[i] >= 0:\n dp[i][j] = min(dp[i][j], dp[i-1][j-v[i]] + w[i])\n \n ans = 0\n for k in range(10**5 + 1):\n if dp[N][k] <= W:\n ans = max(ans, k)\n \n-\n print(ans)\n", "FL_content": " N, W = map(int, input().split())\n w = [0]\n v = [0]\n for _ in range(N):\n x, y = map(int, input().split())\n w.append(x)\n v.append(y)\n dp = [[0 for _ in range(10**5 + 1)] for _ in range(N+1)]\n for i in range(1, 10**5 + 1):\n dp[0][i] = float('inf')\n \n for i in range(1, N+1):\n for j in range(10**5 + 1):\n dp[i][j] = dp[i-1][j]\n- if j - v[i-1] >= 0:\n dp[i][j] = min(dp[i][j], dp[i-1][j-v[i]] + w[i])\n \n ans = 0\n for k in range(10**5 + 1):\n if dp[N][k] <= W:\n ans = max(ans, k)\n \n-\n print(ans)\n", "added_lines": 2, "removed_lines": 2, "code1_lines": 24 }, { "user_id": "u514401521", "problem_id": "p03164", "submission1_id": "s063832887", "submission2_id": "s071782030", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, W = map(int, input().split())\nwv = []\n\nfor i in range(N):\n w, v = map(int, input().split())\n wv.append([w, v])\nMAX_V = 10**5+100\nINF = 10**9\ndp = [[INF]*MAX_V for _ in range(N+1)]\ndp[0][0] = 0\nfor i in range(N):\n for j in range(MAX_V):\n if j - wv[i][1] >= 0:\n dp[i+1][j] = min(dp[i][j], dp[i][j-wv[i][1]]+wv[i][0])\n else:\n dp[i+1][j] = min(dp[i+1][j], dp[i][j])\nans = 0\nfor i in range(MAX_V):\n if dp[N][i] <= W:\n ans = i\nprint(ans)", "code2": "N, W = map(int, input().split())\nwv = []\n\nfor i in range(N):\n w, v = map(int, input().split())\n wv.append([w, v])\nMAX_V = 10**5+100\nINF = 10**10\ndp = [[INF]*MAX_V for _ in range(N+1)]\ndp[0][0] = 0\nfor i in range(N):\n for j in range(MAX_V):\n if j - wv[i][1] >= 0:\n dp[i+1][j] = min(dp[i][j], dp[i][j-wv[i][1]]+wv[i][0])\n else:\n dp[i+1][j] = min(dp[i+1][j], dp[i][j])\nans = 0\nfor i in range(MAX_V):\n if dp[N][i] <= W:\n ans = i\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1590442704", "date2": "1590443288", "bleu_score": "0.9928272580388546", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 100, "total_score": 103, "input": "1 1000000000\n0000000000 10\n", "actual_output": "100099\n", "expected_output": "10\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N, W = map(int, input().split())\n wv = []\n \n for i in range(N):\n w, v = map(int, input().split())\n wv.append([w, v])\n MAX_V = 10**5+100\n-INF = 10**9\n+INF = 10**10\n dp = [[INF]*MAX_V for _ in range(N+1)]\n dp[0][0] = 0\n for i in range(N):\n for j in range(MAX_V):\n if j - wv[i][1] >= 0:\n dp[i+1][j] = min(dp[i][j], dp[i][j-wv[i][1]]+wv[i][0])\n else:\n dp[i+1][j] = min(dp[i+1][j], dp[i][j])\n ans = 0\n for i in range(MAX_V):\n if dp[N][i] <= W:\n ans = i\n print(ans)\n", "FL_content": " N, W = map(int, input().split())\n wv = []\n \n for i in range(N):\n w, v = map(int, input().split())\n wv.append([w, v])\n MAX_V = 10**5+100\n-INF = 10**9\n dp = [[INF]*MAX_V for _ in range(N+1)]\n dp[0][0] = 0\n for i in range(N):\n for j in range(MAX_V):\n if j - wv[i][1] >= 0:\n dp[i+1][j] = min(dp[i][j], dp[i][j-wv[i][1]]+wv[i][0])\n else:\n dp[i+1][j] = min(dp[i+1][j], dp[i][j])\n ans = 0\n for i in range(MAX_V):\n if dp[N][i] <= W:\n ans = i\n print(ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 21 }, { "user_id": "u883048396", "problem_id": "p03164", "submission1_id": "s605144360", "submission2_id": "s255412338", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ndef 解():\n input = sys.stdin.readline\n\n N,W=[int(_) for _ in input().split()]\n dp={0:0}\n for i in range(N):\n w,v=[int(_) for _ in input().split()]\n for j in dp.copy():\n if dp[j]+w <= W:\n if j+v in dp:\n dp[j+v] = min(dp[j+v],dp[j]+w)\n else:\n dp[j+v] = dp[j]+w\n\n print(max(dp.keys()))\n解()\n", "code2": "import sys\ndef 解():\n input = sys.stdin.readline\n\n N,W=[int(_) for _ in input().split()]\n dp={0:0}\n for _ in range(N):\n w,v=[int(_) for _ in input().split()]\n \n for j in sorted(dp.keys(),reverse=True):\n nw = dp[j]+w\n nv = j+v\n if nw <= W :\n if nv in dp:\n if nw < dp[nv]:\n dp[nv] = nw\n else:\n dp[nv] = nw\n\n print(max(dp.keys()))\n解()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1546814278", "date2": "1546834497", "bleu_score": "0.7351273822323413", "code1_test_status": [1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 95, "total_score": 103, "input": "6 15\n6 3\n9 6\n0 4\n4 20\n3 10\n1 4\n", "actual_output": "44\n", "expected_output": "41\n\n", "anno_code": ["import sys\ndef 解(): # (0): 解=\n input = sys.stdin.readline # (2): input=\n\n N,W=[int(_) for _ in input().split()] # (3): N=6, W=15\n dp={0:0} # (4): dp={0: 0}\n for i in range(N): # (5): i=0 (12): i=1 ... (213): NO CHANGE\n w,v=[int(_) for _ in input().split()] # (6): w=6, v=3 (13): w=9, v=6 ... (129): w=1, v=4\n for j in dp.copy(): # (7): j=0 (11): NO CHANGE ... (212): NO CHANGE\n if dp[j]+w <= W: # (8): NO CHANGE (15): NO CHANGE ... (209): NO CHANGE\n if j+v in dp: # (9): NO CHANGE (16): NO CHANGE ... (210): NO CHANGE\n dp[j+v] = min(dp[j+v],dp[j]+w) # (78): dp={0: 0, 3: 6, 6: 9, 9: 15, 4: 0, 7: 6, 10: 3, 13: 15, 20: 4, 23: 10, 26: 13, 24: 4, 27: 10, 30: 13} (82): dp={0: 0, 3: 6, 6: 9, 9: 15, 4: 0, 7: 6, 10: 3, 13: 9, 20: 4, 23: 10, 26: 13, 24: 4, 27: 10, 30: 13} ... (199): NO CHANGE\n else:\n dp[j+v] = dp[j]+w # (10): dp={0: 0, 3: 6} (17): dp={0: 0, 3: 6, 6: 9} ... (211): dp={0: 0, 3: 6, 6: 9, 9: 15, 4: 0, 7: 6, 10: 3, 13: 9, 20: 4, 23: 10, 26: 13, 24: 4, 27: 10, 30: 7, 16: 12, 14: 3, 17: 9, 33: 13, 34: 7, 37: 13, 40: 10, 8: 1, 11: 7, 28: 5, 31: 11, 18: 4, 21: 10, 38: 8, 41: 14, 44: 11}\n\n print(max(dp.keys()))\n解() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " import sys\n def 解():\n input = sys.stdin.readline\n \n N,W=[int(_) for _ in input().split()]\n dp={0:0}\n- for i in range(N):\n+ for _ in range(N):\n w,v=[int(_) for _ in input().split()]\n- for j in dp.copy():\n- if dp[j]+w <= W:\n- if j+v in dp:\n- dp[j+v] = min(dp[j+v],dp[j]+w)\n+ \n+ for j in sorted(dp.keys(),reverse=True):\n+ nw = dp[j]+w\n+ nv = j+v\n+ if nw <= W :\n+ if nv in dp:\n+ if nw < dp[nv]:\n+ dp[nv] = nw\n else:\n- dp[j+v] = dp[j]+w\n+ dp[nv] = nw\n \n print(max(dp.keys()))\n 解()\n \n", "FL_content": " import sys\n def 解():\n input = sys.stdin.readline\n \n N,W=[int(_) for _ in input().split()]\n dp={0:0}\n- for i in range(N):\n w,v=[int(_) for _ in input().split()]\n- for j in dp.copy():\n- if dp[j]+w <= W:\n- if j+v in dp:\n- dp[j+v] = min(dp[j+v],dp[j]+w)\n else:\n- dp[j+v] = dp[j]+w\n \n print(max(dp.keys()))\n 解()\n \n", "added_lines": 10, "removed_lines": 6, "code1_lines": 18 }, { "user_id": "u842964692", "problem_id": "p03164", "submission1_id": "s106776575", "submission2_id": "s065866127", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nN,W=map(int,input().split())\n\nw,v=[0],[0]\n\nfor _ in range(N):\n wi,vi=map(int,input().split())\n w.append(wi)\n v.append(vi)\n\ndp=[[10**12 for _ in range(N*max(v)+1)] for _ in range(N+1)]\ndp[0][0]=0\n\nfor i in range(N):\n for sum_v in range(N*max(v)+1):\n if sum_v-v[i]>=0:\n dp[i+1][sum_v]=min(dp[i][sum_v-v[i]]+w[i],dp[i][sum_v])\n else:\n dp[i+1][sum_v]=dp[i][sum_v]\n\n\nans=0\n\nfor sum_v in range(N*max(v)+1):\n if dp[N][sum_v]<=W:\n ans=max(ans,sum_v)\nprint(ans) \n", "code2": "\n\nN,W=map(int,input().split())\n\nw,v=[0],[0]\n\nfor _ in range(N):\n wi,vi=map(int,input().split())\n w.append(wi)\n v.append(vi)\n\ndp=[[10**12 for _ in range(N*max(v)+1)] for _ in range(N+1)]\ndp[0][0]=0\n\nfor i in range(N):\n for sum_v in range(N*max(v)+1):\n if sum_v-v[i+1]>=0:\n dp[i+1][sum_v]=min(dp[i][sum_v-v[i+1]]+w[i+1],dp[i][sum_v])\n else:\n dp[i+1][sum_v]=dp[i][sum_v]\n\nans=0\n\nfor sum_v in range(N*max(v)+1):\n if dp[N][sum_v]<=W:\n ans=max(ans,sum_v)\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1585778269", "date2": "1585778717", "bleu_score": "0.9776862415905002", "code1_test_status": [0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 24, "total_score": 103, "input": "3 3\n6 9\n5 5\n0 4\n6 5\n3 5\n0 3\n", "actual_output": "0\n", "expected_output": "4\n\n", "anno_code": ["\n\nN,W=map(int,input().split()) # (0): N=3, W=3\n\nw,v=[0],[0] # (1): w=[0], v=[0]\n\nfor _ in range(N): # (2): _=0 (6): _=1 ... (14): NO CHANGE\n wi,vi=map(int,input().split()) # (3): wi=6, vi=9 (7): wi=5, vi=5 (11): wi=0, vi=4\n w.append(wi) # (4): w=[0, 6] (8): w=[0, 6, 5] (12): w=[0, 6, 5, 0]\n v.append(vi) # (5): v=[0, 9] (9): v=[0, 9, 5] (13): v=[0, 9, 5, 4]\n\ndp=[[10**12 for _ in range(N*max(v)+1)] for _ in range(N+1)] # (15): dp\ndp[0][0]=0 # (16): dp\n\nfor i in range(N): # (17): i=0 (103): i=1 ... (275): NO CHANGE\n for sum_v in range(N*max(v)+1): # (18): sum_v=0 (21): sum_v=1 ... (274): NO CHANGE\n if sum_v-v[i]>=0: # (19): NO CHANGE (22): NO CHANGE ... (272): NO CHANGE\n dp[i+1][sum_v]=min(dp[i][sum_v-v[i]]+w[i],dp[i][sum_v]) # (20): dp (23): NO CHANGE ... (273): NO CHANGE\n else:\n dp[i+1][sum_v]=dp[i][sum_v] # (106): dp (109): NO CHANGE ... (204): NO CHANGE\n\n\nans=0 # (276): ans=0\n\nfor sum_v in range(N*max(v)+1): # (277): sum_v=0 (280): sum_v=1 ... (334): NO CHANGE\n if dp[N][sum_v]<=W: # (278): NO CHANGE (281): NO CHANGE ... (333): NO CHANGE\n ans=max(ans,sum_v) # (279): NO CHANGE\nprint(ans) \n"], "anno_status": [true], "diff_content": " \n \n N,W=map(int,input().split())\n \n w,v=[0],[0]\n \n for _ in range(N):\n wi,vi=map(int,input().split())\n w.append(wi)\n v.append(vi)\n \n dp=[[10**12 for _ in range(N*max(v)+1)] for _ in range(N+1)]\n dp[0][0]=0\n \n for i in range(N):\n for sum_v in range(N*max(v)+1):\n- if sum_v-v[i]>=0:\n- dp[i+1][sum_v]=min(dp[i][sum_v-v[i]]+w[i],dp[i][sum_v])\n+ if sum_v-v[i+1]>=0:\n+ dp[i+1][sum_v]=min(dp[i][sum_v-v[i+1]]+w[i+1],dp[i][sum_v])\n else:\n dp[i+1][sum_v]=dp[i][sum_v]\n \n-\n ans=0\n \n for sum_v in range(N*max(v)+1):\n if dp[N][sum_v]<=W:\n ans=max(ans,sum_v)\n-print(ans) \n+print(ans)\n \n", "FL_content": " \n \n N,W=map(int,input().split())\n \n w,v=[0],[0]\n \n for _ in range(N):\n wi,vi=map(int,input().split())\n w.append(wi)\n v.append(vi)\n \n dp=[[10**12 for _ in range(N*max(v)+1)] for _ in range(N+1)]\n dp[0][0]=0\n \n for i in range(N):\n for sum_v in range(N*max(v)+1):\n- if sum_v-v[i]>=0:\n- dp[i+1][sum_v]=min(dp[i][sum_v-v[i]]+w[i],dp[i][sum_v])\n else:\n dp[i+1][sum_v]=dp[i][sum_v]\n \n-\n ans=0\n \n for sum_v in range(N*max(v)+1):\n if dp[N][sum_v]<=W:\n ans=max(ans,sum_v)\n-print(ans) \n \n", "added_lines": 3, "removed_lines": 4, "code1_lines": 29 }, { "user_id": "u410118019", "problem_id": "p03164", "submission1_id": "s390773354", "submission2_id": "s578271857", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,W = map(int,input().split())\ndp = [[10**12] * (10**5+1) for i in range(n+1)]\ndp[0][0] = 0\nma = 0\nfor i in range(1,n+1):\n w,v = map(int,input().split())\n ma += v\n for j in range(v,ma+1):\n dp[i][j] = min(dp[i-1][j-v]+w,dp[i-1][j])\nm = 0\nfor i in range(ma+1):\n if dp[-1][i] <= W:\n m = i\nprint(m)", "code2": "n,W = map(int,input().split())\ndp = [[10**12] * (10**5+1) for i in range(n+1)]\ndp[0][0] = 0\nma = 0\nfor i in range(1,n+1):\n w,v = map(int,input().split())\n ma += v\n for j in range(v):\n dp[i][j] = dp[i-1][j]\n for j in range(v,ma+1):\n dp[i][j] = min(dp[i-1][j-v]+w,dp[i-1][j])\nm = 0\nfor i in range(ma+1):\n if dp[-1][i] <= W:\n m = i\nprint(m)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1572036890", "date2": "1572037220", "bleu_score": "0.8655206914478428", "code1_test_status": [1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0], "code1_test_score": 59, "total_score": 103, "input": "3 8\n3 30\n4 35\n5 60\n", "actual_output": "65\n", "expected_output": "90\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n,W = map(int,input().split())\n dp = [[10**12] * (10**5+1) for i in range(n+1)]\n dp[0][0] = 0\n ma = 0\n for i in range(1,n+1):\n w,v = map(int,input().split())\n ma += v\n+ for j in range(v):\n+ dp[i][j] = dp[i-1][j]\n for j in range(v,ma+1):\n dp[i][j] = min(dp[i-1][j-v]+w,dp[i-1][j])\n m = 0\n for i in range(ma+1):\n if dp[-1][i] <= W:\n m = i\n print(m)\n", "FL_content": " n,W = map(int,input().split())\n dp = [[10**12] * (10**5+1) for i in range(n+1)]\n dp[0][0] = 0\n ma = 0\n for i in range(1,n+1):\n w,v = map(int,input().split())\n ma += v\n for j in range(v,ma+1):\n dp[i][j] = min(dp[i-1][j-v]+w,dp[i-1][j])\n m = 0\n for i in range(ma+1):\n if dp[-1][i] <= W:\n m = i\n print(m)\n", "added_lines": 2, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u941407962", "problem_id": "p03164", "submission1_id": "s625869936", "submission2_id": "s380482191", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, W = map(int, input().split())\nMV = (10**3)*N+1\nMV = 100\ndp = [[0] + [10**18]*(MV-1) for _ in range(N+1)]\ndp[0][0] = 0\nfor i in range(1, N+1):\n w, v = map(int, input().split())\n for j in range(1, MV):\n dp[i][j] = min(dp[i-1][j], dp[i-1][max(0, j-v)]+w)\nfor i in range(MV):\n if dp[N][MV-i-1] <= W:\n print(MV-i-1)\n break\n\n", "code2": "N, W = map(int, input().split())\nMV = (10**3)*N+1\ndp = [[0] + [10**18]*(MV-1) for _ in range(N+1)]\ndp[0][0] = 0\nfor i in range(1, N+1):\n w, v = map(int, input().split())\n for j in range(1, MV):\n dp[i][j] = min(dp[i-1][j], dp[i-1][max(0, j-v)]+w)\nfor i in range(MV):\n if dp[N][MV-i-1] <= W:\n print(MV-i-1)\n break\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1578145606", "date2": "1578145654", "bleu_score": "0.9719526278341482", "code1_test_status": [1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 73, "total_score": 103, "input": "3 10\n3 35\n1 14\n5 78\n", "actual_output": "99\n", "expected_output": "127\n\n", "anno_code": ["N, W = map(int, input().split()) # (0): N=3, W=10\nMV = (10**3)*N+1 # (1): MV=3001\nMV = 100 # (2): MV=100\ndp = [[0] + [10**18]*(MV-1) for _ in range(N+1)] # (3): dp\ndp[0][0] = 0 # (4): NO CHANGE\nfor i in range(1, N+1): # (5): i=1 (206): i=2 ... (608): NO CHANGE\n w, v = map(int, input().split()) # (6): w=3, v=35 (207): w=1, v=14 (408): w=5, v=78\n for j in range(1, MV): # (7): j=1 (9): j=2 ... (607): NO CHANGE\n dp[i][j] = min(dp[i-1][j], dp[i-1][max(0, j-v)]+w) # (8): dp (10): dp ... (606): dp\nfor i in range(MV): # (609): i=0\n if dp[N][MV-i-1] <= W: # (610): NO CHANGE\n print(MV-i-1) # (611): NO CHANGE\n break\n\n"], "anno_status": [true], "diff_content": " N, W = map(int, input().split())\n MV = (10**3)*N+1\n-MV = 100\n dp = [[0] + [10**18]*(MV-1) for _ in range(N+1)]\n dp[0][0] = 0\n for i in range(1, N+1):\n w, v = map(int, input().split())\n for j in range(1, MV):\n dp[i][j] = min(dp[i-1][j], dp[i-1][max(0, j-v)]+w)\n for i in range(MV):\n if dp[N][MV-i-1] <= W:\n print(MV-i-1)\n break\n \n \n", "FL_content": " N, W = map(int, input().split())\n MV = (10**3)*N+1\n-MV = 100\n dp = [[0] + [10**18]*(MV-1) for _ in range(N+1)]\n dp[0][0] = 0\n for i in range(1, N+1):\n w, v = map(int, input().split())\n for j in range(1, MV):\n dp[i][j] = min(dp[i-1][j], dp[i-1][max(0, j-v)]+w)\n for i in range(MV):\n if dp[N][MV-i-1] <= W:\n print(MV-i-1)\n break\n \n \n", "added_lines": 0, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u488401358", "problem_id": "p03689", "submission1_id": "s777459173", "submission2_id": "s136151189", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H,W,h,w=map(int,input().split())\nif H%h==0 and W%w==0:\n print(\"No\")\nelse:\n ans=[[1 for i in range(W)] for j in range(H)]\n for i in range(H):\n for j in range(W):\n if (i+1)%h==0 and (j+1)%w==0:\n ans[i][j]=-h*w\n if sum(ans[i][j] for i in range(H) for j in range(W))>0:\n print(\"Yes\")\n for i in range(H):\n print(*ans[i])\n else:\n print(\"No\")\n", "code2": "H,W,h,w=map(int,input().split())\nif H%h==0 and W%w==0:\n print(\"No\")\nelse:\n c=10**9\n ans=[[(c-1)\n for i in range(H):\n for j in range(W):\n if (i+1)%h==0 and (j+1)%w==0:\n ans[i][j]=-c\n if sum(ans[i][j] for i in range(H) for j in range(W))>0:\n print(\"Yes\")\n for i in range(H):\n print(*ans[i])\n else:\n print(\"No\")\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589661224", "date2": "1589661397", "bleu_score": "0.8947171719133229", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 3, "total_score": 96, "input": "3 6 2 3\n", "actual_output": "Yes\n1 1 1 1 1 1\n1 1 -6 1 1 -6\n1 1 1 1 1 1\n", "expected_output": "Yes\n1000 1000 1000 1000 1000 1000\n1000 1000 -5001 1000 1000 -5001\n1000 1000 1000 1000 1000 1000\n\n", "anno_code": ["H,W,h,w=map(int,input().split()) # (0): H=3, W=6, h=2, w=3\nif H%h==0 and W%w==0: # (1): NO CHANGE\n print(\"No\")\nelse:\n ans=[[1 for i in range(W)] for j in range(H)] # (2): ans\n for i in range(H): # (3): i=0 (17): i=1 ... (47): NO CHANGE\n for j in range(W): # (4): j=0 (6): j=1 ... (46): NO CHANGE\n if (i+1)%h==0 and (j+1)%w==0: # (5): NO CHANGE (7): NO CHANGE ... (45): NO CHANGE\n ans[i][j]=-h*w # (24): ans (31): ans\n if sum(ans[i][j] for i in range(H) for j in range(W))>0: # (48): NO CHANGE\n print(\"Yes\") # (49): NO CHANGE\n for i in range(H): # (50): i=0 (52): i=1 (54): i=2\n print(*ans[i]) # (51): NO CHANGE (53): NO CHANGE (55): NO CHANGE\n else:\n print(\"No\")\n"], "anno_status": [true], "diff_content": " H,W,h,w=map(int,input().split())\n if H%h==0 and W%w==0:\n print(\"No\")\n else:\n- ans=[[1 for i in range(W)] for j in range(H)]\n+ c=10**9\n+ ans=[[(c-1)\n for i in range(H):\n for j in range(W):\n if (i+1)%h==0 and (j+1)%w==0:\n- ans[i][j]=-h*w\n+ ans[i][j]=-c\n if sum(ans[i][j] for i in range(H) for j in range(W))>0:\n print(\"Yes\")\n for i in range(H):\n print(*ans[i])\n else:\n print(\"No\")\n \n", "FL_content": " H,W,h,w=map(int,input().split())\n if H%h==0 and W%w==0:\n print(\"No\")\n else:\n- ans=[[1 for i in range(W)] for j in range(H)]\n for i in range(H):\n for j in range(W):\n if (i+1)%h==0 and (j+1)%w==0:\n- ans[i][j]=-h*w\n if sum(ans[i][j] for i in range(H) for j in range(W))>0:\n print(\"Yes\")\n for i in range(H):\n print(*ans[i])\n else:\n print(\"No\")\n \n", "added_lines": 3, "removed_lines": 2, "code1_lines": 16 }, { "user_id": "u488401358", "problem_id": "p03689", "submission1_id": "s563543767", "submission2_id": "s136151189", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H,W,h,w=map(int,input().split())\nif H%h==0 and W%w==0:\n print(\"No\")\nelse:\n print(\"Yes\")\n ans=[[1 for i in range(W)] for j in range(H)]\n for i in range(H):\n for j in range(W):\n if (i+1)%h==0 and (j+1)%w==0:\n ans[i][j]=-h*w\n for i in range(H):\n print(*ans[i])", "code2": "H,W,h,w=map(int,input().split())\nif H%h==0 and W%w==0:\n print(\"No\")\nelse:\n c=10**9\n ans=[[(c-1)\n for i in range(H):\n for j in range(W):\n if (i+1)%h==0 and (j+1)%w==0:\n ans[i][j]=-c\n if sum(ans[i][j] for i in range(H) for j in range(W))>0:\n print(\"Yes\")\n for i in range(H):\n print(*ans[i])\n else:\n print(\"No\")\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589660437", "date2": "1589661397", "bleu_score": "0.7687014958753743", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 3, "total_score": 96, "input": "2 8 4 1\n", "actual_output": "Yes\n1 1 1 1 1 1 1 1\n1 1 1 1 1 1 1 1\n", "expected_output": "Yes\n1000 1000 1000 1000 1000 1000 1000 1000\n1000 1000 1000 1000 1000 1000 1000 1000\n\n", "anno_code": ["H,W,h,w=map(int,input().split()) # (0): H=2, W=8, h=4, w=1\nif H%h==0 and W%w==0: # (1): NO CHANGE\n print(\"No\")\nelse:\n print(\"Yes\") # (2): NO CHANGE\n ans=[[1 for i in range(W)] for j in range(H)] # (3): ans\n for i in range(H): # (4): i=0 (22): i=1 (40): NO CHANGE\n for j in range(W): # (5): j=0 (7): j=1 ... (39): NO CHANGE\n if (i+1)%h==0 and (j+1)%w==0: # (6): NO CHANGE (8): NO CHANGE ... (38): NO CHANGE\n ans[i][j]=-h*w\n for i in range(H): # (41): i=0 (43): i=1\n print(*ans[i]) # (42): NO CHANGE (44): NO CHANGE\n"], "anno_status": [true], "diff_content": " H,W,h,w=map(int,input().split())\n if H%h==0 and W%w==0:\n print(\"No\")\n else:\n- print(\"Yes\")\n- ans=[[1 for i in range(W)] for j in range(H)]\n+ c=10**9\n+ ans=[[(c-1)\n for i in range(H):\n for j in range(W):\n if (i+1)%h==0 and (j+1)%w==0:\n- ans[i][j]=-h*w\n- for i in range(H):\n- print(*ans[i])\n+ ans[i][j]=-c\n+ if sum(ans[i][j] for i in range(H) for j in range(W))>0:\n+ print(\"Yes\")\n+ for i in range(H):\n+ print(*ans[i])\n+ else:\n+ print(\"No\")\n+\n", "FL_content": " H,W,h,w=map(int,input().split())\n if H%h==0 and W%w==0:\n print(\"No\")\n else:\n- print(\"Yes\")\n- ans=[[1 for i in range(W)] for j in range(H)]\n for i in range(H):\n for j in range(W):\n if (i+1)%h==0 and (j+1)%w==0:\n- ans[i][j]=-h*w\n- for i in range(H):\n- print(*ans[i])\n", "added_lines": 10, "removed_lines": 5, "code1_lines": 12 }, { "user_id": "u144913062", "problem_id": "p03689", "submission1_id": "s755380031", "submission2_id": "s353013451", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, W, h, w = map(int, input().split())\nif H % h == 0 and W % h == 0:\n print('No')\n exit()\nprint('Yes')\na = [[1] * W for _ in range(H)]\nfor i in range(h-1, H, h):\n for j in range(w-1, W, w):\n a[i][j] = -h * w\nfor row in a:\n print(*row)\n", "code2": "H, W, h, w = map(int, input().split())\nrem = H * W - (H - H % h) * (W - W % w)\nif rem == 0:\n print('No')\n exit()\nx = (H \nif abs(x) > 10**9 or abs(-(h * w - 1) * x - 1) > 10**9:\n print('No')\n exit()\nprint('Yes')\na = [[x] * W for _ in range(H)]\nfor i in range(h-1, H, h):\n for j in range(w-1, W, w):\n a[i][j] = -(h * w - 1) * x - 1\nfor row in a:\n print(*row)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593796003", "date2": "1593797633", "bleu_score": "0.6208001415315565", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 3, "total_score": 96, "input": "1 11 4 3\n", "actual_output": "Yes\n1 1 1 1 1 1 1 1 1 1 1\n", "expected_output": "Yes\n1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000\n\n", "anno_code": ["H, W, h, w = map(int, input().split()) # (0): H=1, W=11, h=4, w=3\nif H % h == 0 and W % h == 0: # (1): NO CHANGE\n print('No')\n exit()\nprint('Yes') # (2): NO CHANGE\na = [[1] * W for _ in range(H)] # (3): a\nfor i in range(h-1, H, h): # (4): NO CHANGE\n for j in range(w-1, W, w):\n a[i][j] = -h * w\nfor row in a: # (5): row=[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]\n print(*row) # (6): NO CHANGE\n"], "anno_status": [true], "diff_content": " H, W, h, w = map(int, input().split())\n-if H % h == 0 and W % h == 0:\n+rem = H * W - (H - H % h) * (W - W % w)\n+if rem == 0:\n+ print('No')\n+ exit()\n+x = (H \n+if abs(x) > 10**9 or abs(-(h * w - 1) * x - 1) > 10**9:\n print('No')\n exit()\n print('Yes')\n-a = [[1] * W for _ in range(H)]\n+a = [[x] * W for _ in range(H)]\n for i in range(h-1, H, h):\n for j in range(w-1, W, w):\n- a[i][j] = -h * w\n+ a[i][j] = -(h * w - 1) * x - 1\n for row in a:\n print(*row)\n \n", "FL_content": " H, W, h, w = map(int, input().split())\n-if H % h == 0 and W % h == 0:\n print('No')\n exit()\n print('Yes')\n-a = [[1] * W for _ in range(H)]\n for i in range(h-1, H, h):\n for j in range(w-1, W, w):\n- a[i][j] = -h * w\n for row in a:\n print(*row)\n \n", "added_lines": 8, "removed_lines": 3, "code1_lines": 12 }, { "user_id": "u141610915", "problem_id": "p03689", "submission1_id": "s140299713", "submission2_id": "s176219646", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nH, W, h, w = map(int, input().split())\nres = [[1] * W for _ in range(H)]\nfor i in range(h - 1, H, h):\n for j in range(w - 1, W, w): res[i][j] = -h * w\nif sum([sum(r) for r in res]) > 0:\n print(\"Yes\")\n for r in res: print(*r)\nelse: print(\"No\")", "code2": "import sys\ninput = sys.stdin.readline\nH, W, h, w = map(int, input().split())\nunit = 10 ** 9 - 1\nc = H * W\nfor i in range(h - 1, H, h):\n for j in range(w - 1, W, w): c -= 1\nif c == 0:\n print(\"No\")\n exit(0)\nres = [[unit \nfor i in range(h - 1, H, h):\n for j in range(w - 1, W, w): res[i][j] = -(unit \nif sum([sum(r) for r in res]) > 0:\n print(\"Yes\")\n for r in res: print(*r)\nelse: print(\"No\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1588950685", "date2": "1588951831", "bleu_score": "0.6748557187300024", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 3, "total_score": 96, "input": "2 11 2 2\n", "actual_output": "No\n", "expected_output": "Yes\n1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000\n1000 -3001 1000 -3001 1000 -3001 1000 -3001 1000 -3001 1000\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\nH, W, h, w = map(int, input().split()) # (1): H=2, W=11, h=2, w=2\nres = [[1] * W for _ in range(H)] # (2): res\nfor i in range(h - 1, H, h): # (3): i=1 (10): NO CHANGE\n for j in range(w - 1, W, w): res[i][j] = -h * w # (4): res=[[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, -4, 1, 1, 1, 1, 1, 1, 1, 1, 1]], j=1 (5): res, j=3 ... (9): NO CHANGE\nif sum([sum(r) for r in res]) > 0: # (11): NO CHANGE\n print(\"Yes\")\n for r in res: print(*r)\nelse: print(\"No\")"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n H, W, h, w = map(int, input().split())\n-res = [[1] * W for _ in range(H)]\n+unit = 10 ** 9 - 1\n+c = H * W\n for i in range(h - 1, H, h):\n- for j in range(w - 1, W, w): res[i][j] = -h * w\n+ for j in range(w - 1, W, w): c -= 1\n+if c == 0:\n+ print(\"No\")\n+ exit(0)\n+res = [[unit \n+for i in range(h - 1, H, h):\n+ for j in range(w - 1, W, w): res[i][j] = -(unit \n if sum([sum(r) for r in res]) > 0:\n print(\"Yes\")\n for r in res: print(*r)\n else: print(\"No\")\n", "FL_content": " import sys\n input = sys.stdin.readline\n H, W, h, w = map(int, input().split())\n-res = [[1] * W for _ in range(H)]\n for i in range(h - 1, H, h):\n- for j in range(w - 1, W, w): res[i][j] = -h * w\n if sum([sum(r) for r in res]) > 0:\n print(\"Yes\")\n for r in res: print(*r)\n else: print(\"No\")\n", "added_lines": 9, "removed_lines": 2, "code1_lines": 10 }, { "user_id": "u970899068", "problem_id": "p03380", "submission1_id": "s602420285", "submission2_id": "s740237347", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=list(map(int, input().split()))\nans=[]\nx=max(a)\nans.append(x)\ny=x\nb=10**9\nd=10**9\nfor i in range(n):\n c=abs(a[i]-y)\n if b>c:\n d=a[i]\n b=min(b,c)\nans.append(d)\nprint(*ans)\n\n \n\n", "code2": "n=int(input())\na=list(map(int, input().split()))\nans=[]\nx=max(a)\nans.append(x)\na.remove(max(a))\ny=x/2\nb=10**10\nd=10**10\n\nfor i in range(n-1):\n c=abs(a[i]-y)\n if b>c:\n d=a[i]\n b=min(b,c)\nans.append(d)\nprint(*ans)\n\n\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569799453", "date2": "1569800153", "bleu_score": "0.8535400950984214", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "5\n1 9 0 8 16\n", "actual_output": "16 16\n", "expected_output": "16 8\n\n", "anno_code": ["n=int(input()) # (0): n=5\na=list(map(int, input().split())) # (1): a=[1, 9, 0, 8, 16]\nans=[] # (2): ans=[]\nx=max(a) # (3): x=16\nans.append(x) # (4): ans=[16]\ny=x # (5): y=16\nb=10**9 # (6): b=1000000000\nd=10**9 # (7): d=1000000000\nfor i in range(n): # (8): i=0 (13): i=1 ... (31): NO CHANGE\n c=abs(a[i]-y) # (9): c=15 (14): c=7 ... (27): c=0\n if b>c: # (10): NO CHANGE (15): NO CHANGE ... (28): NO CHANGE\n d=a[i] # (11): d=1 (16): d=9 (29): d=16\n b=min(b,c) # (12): b=15 (17): b=7 ... (30): b=0\nans.append(d) # (32): ans=[16, 16]\nprint(*ans)\n\n \n\n"], "anno_status": [true], "diff_content": " n=int(input())\n a=list(map(int, input().split()))\n ans=[]\n x=max(a)\n ans.append(x)\n-y=x\n-b=10**9\n-d=10**9\n-for i in range(n):\n+a.remove(max(a))\n+y=x/2\n+b=10**10\n+d=10**10\n+\n+for i in range(n-1):\n c=abs(a[i]-y)\n if b>c:\n d=a[i]\n b=min(b,c)\n ans.append(d)\n print(*ans)\n \n- \n+\n \n \n", "FL_content": " n=int(input())\n a=list(map(int, input().split()))\n ans=[]\n x=max(a)\n ans.append(x)\n-y=x\n-b=10**9\n-d=10**9\n-for i in range(n):\n c=abs(a[i]-y)\n if b>c:\n d=a[i]\n b=min(b,c)\n ans.append(d)\n print(*ans)\n \n- \n \n \n", "added_lines": 7, "removed_lines": 5, "code1_lines": 19 }, { "user_id": "u131881594", "problem_id": "p03380", "submission1_id": "s699246863", "submission2_id": "s961945835", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=list(map(int,input().split()))\nans1=max(a)\nm=10**9+1\ntemp=ans1/2\ni=0\nfor index,val in enumerate(a):\n if abs(val-temp)\n return n * (min(n-r, r))\n\nn = max(a) # (3): n=11\nans = (n, a[0]) # (4): ans=(11, 11)\nfor i in a[1:]: # (5): i=0 (7): NO CHANGE\n ans = (n, i) if hoge(*ans) < hoge(n, i) else ans # (6): NO CHANGE\nprint(*ans)"], "anno_status": [true], "diff_content": " N = int(input())\n-a = tuple(int(x) for x in input().split())\n+a = sorted(int(x) for x in input().split())\n \n def hoge(n, r):\n return n * (min(n-r, r))\n \n n = max(a)\n ans = (n, a[0])\n for i in a[1:]:\n ans = (n, i) if hoge(*ans) < hoge(n, i) else ans\n print(*ans)\n", "FL_content": " N = int(input())\n-a = tuple(int(x) for x in input().split())\n \n def hoge(n, r):\n return n * (min(n-r, r))\n \n n = max(a)\n ans = (n, a[0])\n for i in a[1:]:\n ans = (n, i) if hoge(*ans) < hoge(n, i) else ans\n print(*ans)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 11 }, { "user_id": "u201928947", "problem_id": "p03380", "submission1_id": "s500887467", "submission2_id": "s881220664", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = sorted(list(map(int,input().split())))\nx = a.pop()\ny = a[0]\nm = abs(x/2 - a[0])\nfor i in range(1,n-1):\n if abs(x/2-a[i]) < m:\n y = a[i]\nprint(x,y)\n ", "code2": "n = int(input())\na = sorted(list(map(int,input().split())))\nx = a.pop()\ny = a[0]\nm = abs(x/2 - a[0])\nfor i in range(1,n-1):\n if abs(x/2-a[i]) < m:\n y = a[i]\n m = abs(x/2-a[i])\nprint(x,y)\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586819050", "date2": "1586819349", "bleu_score": "0.8704230326955802", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 92, "total_score": 100, "input": "5\n2 11 1 12 15\n", "actual_output": "15 12\n", "expected_output": "15 11\n\n", "anno_code": ["n = int(input()) # (0): n=5\na = sorted(list(map(int,input().split()))) # (1): a=[1, 2, 11, 12, 15]\nx = a.pop() # (2): a=[1, 2, 11, 12], x=15\ny = a[0] # (3): y=1\nm = abs(x/2 - a[0]) # (4): m=6.5\nfor i in range(1,n-1): # (5): i=1 (8): i=2 ... (14): NO CHANGE\n if abs(x/2-a[i]) < m: # (6): NO CHANGE (9): NO CHANGE (12): NO CHANGE\n y = a[i] # (7): y=2 (10): y=11 (13): y=12\nprint(x,y)\n "], "anno_status": [true], "diff_content": " n = int(input())\n a = sorted(list(map(int,input().split())))\n x = a.pop()\n y = a[0]\n m = abs(x/2 - a[0])\n for i in range(1,n-1):\n if abs(x/2-a[i]) < m:\n y = a[i]\n+ m = abs(x/2-a[i])\n print(x,y)\n \n", "FL_content": " n = int(input())\n a = sorted(list(map(int,input().split())))\n x = a.pop()\n y = a[0]\n m = abs(x/2 - a[0])\n for i in range(1,n-1):\n if abs(x/2-a[i]) < m:\n y = a[i]\n print(x,y)\n \n", "added_lines": 1, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u818655004", "problem_id": "p03380", "submission1_id": "s078330461", "submission2_id": "s685100409", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na_n = list(map(int, input().split()))\nresult1 = max(a_n)\nmin_delta = max(a_n)\nresult2 = max(a_n)\nfor num in a_n:\n if abs(num-n/2)= temp:\n comb = temp\n aj = a[i]\nprint(a[0], aj)", "code2": "n = int(input())\na = list(map(int,input().split()))\na = sorted(a, reverse = True)\n\nai = a[0] / 2\naj = 0\ncomb = 10 ** 10\nfor i in range(n):\n temp = abs(a[i] - ai)\n if comb >= temp:\n comb = temp\n aj = a[i]\nprint(a[0], aj)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588382645", "date2": "1588382751", "bleu_score": "0.9810183220324818", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "5\n2 0 0 4 1\n", "actual_output": "4 4\n", "expected_output": "4 2\n\n", "anno_code": ["n = int(input()) # (0): n=5\na = list(map(int,input().split())) # (1): a=[2, 0, 0, 4, 1]\na = sorted(a, reverse = True) # (2): a=[4, 2, 1, 0, 0]\n\nai = a[0] # (3): ai=4\naj = 0 # (4): aj=0\ncomb = 10 ** 10 # (5): comb=10000000000\nfor i in range(n): # (6): i=0 (11): i=1 ... (23): NO CHANGE\n temp = abs(a[i] - ai) # (7): temp=0 (12): temp=2 ... (21): NO CHANGE\n if comb >= temp: # (8): NO CHANGE (13): NO CHANGE ... (22): NO CHANGE\n comb = temp # (9): comb=0\n aj = a[i] # (10): aj=4\nprint(a[0], aj)"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int,input().split()))\n a = sorted(a, reverse = True)\n \n-ai = a[0] \n+ai = a[0] / 2\n aj = 0\n comb = 10 ** 10\n for i in range(n):\n temp = abs(a[i] - ai)\n if comb >= temp:\n comb = temp\n aj = a[i]\n print(a[0], aj)\n", "FL_content": " n = int(input())\n a = list(map(int,input().split()))\n a = sorted(a, reverse = True)\n \n-ai = a[0] \n aj = 0\n comb = 10 ** 10\n for i in range(n):\n temp = abs(a[i] - ai)\n if comb >= temp:\n comb = temp\n aj = a[i]\n print(a[0], aj)\n", "added_lines": 1, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u539517139", "problem_id": "p03380", "submission1_id": "s246908732", "submission2_id": "s772815837", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=list(map(int,input().split()))\nm=max(a)\nh=m/2\nd=abs(a[0]-h)\nx=0\nfor i in range(1,n):\n if abs(a[i]-h)\n", "expected_output": "1\n", "anno_code": ["import sys\n\ns = input() # (0): s=BBBWW\n\nbefore = s[0] # (1): before=B\nans = 0 # (2): ans=0\nfor cx in range(1, len(s)): # (3): cx=1 (5): cx=2 ... (13): NO CHANGE\n if before != s[cx]: # (4): NO CHANGE (6): NO CHANGE ... (12): NO CHANGE\n ans += 1 # (9): ans=1\n before = s[cx] # (10): before=W\n\nprint(abs)\n"], "anno_status": [true], "diff_content": " import sys\n \n s = input()\n \n before = s[0]\n ans = 0\n for cx in range(1, len(s)):\n if before != s[cx]:\n ans += 1\n before = s[cx]\n \n-print(abs)\n+print(ans)\n \n", "FL_content": " import sys\n \n s = input()\n \n before = s[0]\n ans = 0\n for cx in range(1, len(s)):\n if before != s[cx]:\n ans += 1\n before = s[cx]\n \n-print(abs)\n \n", "added_lines": 1, "removed_lines": 1, "code1_lines": 13 }, { "user_id": "u261103969", "problem_id": "p02559", "submission1_id": "s372905323", "submission2_id": "s724262106", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nreadline = sys.stdin.readline\nMOD = 10 ** 9 + 7\nINF = float('INF')\nsys.setrecursionlimit(10 ** 5)\n\n\nclass BinaryIndexTree:\n def __init__(self, n):\n self.size = n\n self._container = [0] * (n + 1)\n self.depth = n.bit_length()\n\n def sum(self, i):\n if i == 0:\n return 0\n s = 0\n while i > 0:\n s += self._container[i]\n i -= i & (-i)\n return s\n\n def add(self, i, x):\n if i == 0:\n return\n while i <= self.size:\n self._container[i] += x\n i += i & (-i)\n\n def lower_bound(self, x):\n if x == 0:\n return 0\n\n s = 0\n idx = 0\n for i in range(self.depth, -1, -1):\n k = idx + (1 << i)\n if k <= self.size and s + self._container[k] < x:\n s += self._container[k]\n idx += 1 << i\n return idx + 1\n\n def __repr__(self):\n return str(self._container)\n\n\ndef main():\n N, Q = map(int, readline().split())\n a = list(map(int, readline().split()))\n bit = BinaryIndexTree(N + 1)\n\n for i, x in enumerate(a, 1):\n bit.add(i, x)\n\n for _ in range(Q):\n a, b, c = map(int, readline().split())\n if a == 0:\n bit.add(b, c)\n else:\n b += 1\n c += 1\n print(bit.sum(c - 1) - bit.sum(b - 1))\n\n\nif __name__ == '__main__':\n main()\n", "code2": "import sys\n\nreadline = sys.stdin.readline\nMOD = 10 ** 9 + 7\nINF = float('INF')\nsys.setrecursionlimit(10 ** 5)\n\n\nclass BinaryIndexTree:\n def __init__(self, n):\n self.size = n\n self._container = [0] * (n + 1)\n self.depth = n.bit_length()\n\n def sum(self, i):\n if i == 0:\n return 0\n s = 0\n while i > 0:\n s += self._container[i]\n i -= i & (-i)\n return s\n\n def add(self, i, x):\n if i == 0:\n return\n while i <= self.size:\n self._container[i] += x\n i += i & (-i)\n\n def lower_bound(self, x):\n if x == 0:\n return 0\n\n s = 0\n idx = 0\n for i in range(self.depth, -1, -1):\n k = idx + (1 << i)\n if k <= self.size and s + self._container[k] < x:\n s += self._container[k]\n idx += 1 << i\n return idx + 1\n\n def __repr__(self):\n return str(self._container)\n\n\ndef main():\n N, Q = map(int, readline().split())\n a = list(map(int, readline().split()))\n bit = BinaryIndexTree(N + 1)\n\n for i, x in enumerate(a, 1):\n bit.add(i, x)\n\n for _ in range(Q):\n a, b, c = map(int, readline().split())\n if a == 0:\n b += 1\n bit.add(b, c)\n else:\n b += 1\n c += 1\n print(bit.sum(c - 1) - bit.sum(b - 1))\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1599574596", "date2": "1599604665", "bleu_score": "0.9868829745290159", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 23, "total_score": 101, "input": "5 5\n1 0 5 4 5\n1 1 2\n1 2 4\n0 3 10\n1 0 5\n1 0 3\n", "actual_output": "0\n9\n25\n16\n", "expected_output": "0\n9\n25\n6\n\n", "anno_code": ["import sys\n\nreadline = sys.stdin.readline # (0): readline=\nMOD = 10 ** 9 + 7 # (1): MOD=1000000007\nINF = float('INF') # (2): INF=inf\nsys.setrecursionlimit(10 ** 5) # (3): NO CHANGE\n\n\nclass BinaryIndexTree: # (4): BinaryIndexTree=\n def __init__(self, n):\n self.size = n\n self._container = [0] * (n + 1)\n self.depth = n.bit_length()\n\n def sum(self, i):\n if i == 0:\n return 0\n s = 0\n while i > 0:\n s += self._container[i]\n i -= i & (-i)\n return s\n\n def add(self, i, x):\n if i == 0:\n return\n while i <= self.size:\n self._container[i] += x\n i += i & (-i)\n\n def lower_bound(self, x):\n if x == 0:\n return 0\n\n s = 0\n idx = 0\n for i in range(self.depth, -1, -1):\n k = idx + (1 << i)\n if k <= self.size and s + self._container[k] < x:\n s += self._container[k]\n idx += 1 << i\n return idx + 1\n\n def __repr__(self):\n return str(self._container)\n\n\ndef main(): # (5): main=\n N, Q = map(int, readline().split())\n a = list(map(int, readline().split()))\n bit = BinaryIndexTree(N + 1)\n\n for i, x in enumerate(a, 1):\n bit.add(i, x)\n\n for _ in range(Q):\n a, b, c = map(int, readline().split())\n if a == 0:\n bit.add(b, c)\n else:\n b += 1\n c += 1\n print(bit.sum(c - 1) - bit.sum(b - 1))\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [false], "diff_content": " import sys\n \n readline = sys.stdin.readline\n MOD = 10 ** 9 + 7\n INF = float('INF')\n sys.setrecursionlimit(10 ** 5)\n \n \n class BinaryIndexTree:\n def __init__(self, n):\n self.size = n\n self._container = [0] * (n + 1)\n self.depth = n.bit_length()\n \n def sum(self, i):\n if i == 0:\n return 0\n s = 0\n while i > 0:\n s += self._container[i]\n i -= i & (-i)\n return s\n \n def add(self, i, x):\n if i == 0:\n return\n while i <= self.size:\n self._container[i] += x\n i += i & (-i)\n \n def lower_bound(self, x):\n if x == 0:\n return 0\n \n s = 0\n idx = 0\n for i in range(self.depth, -1, -1):\n k = idx + (1 << i)\n if k <= self.size and s + self._container[k] < x:\n s += self._container[k]\n idx += 1 << i\n return idx + 1\n \n def __repr__(self):\n return str(self._container)\n \n \n def main():\n N, Q = map(int, readline().split())\n a = list(map(int, readline().split()))\n bit = BinaryIndexTree(N + 1)\n \n for i, x in enumerate(a, 1):\n bit.add(i, x)\n \n for _ in range(Q):\n a, b, c = map(int, readline().split())\n if a == 0:\n+ b += 1\n bit.add(b, c)\n else:\n b += 1\n c += 1\n print(bit.sum(c - 1) - bit.sum(b - 1))\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": " import sys\n \n readline = sys.stdin.readline\n MOD = 10 ** 9 + 7\n INF = float('INF')\n sys.setrecursionlimit(10 ** 5)\n \n \n class BinaryIndexTree:\n def __init__(self, n):\n self.size = n\n self._container = [0] * (n + 1)\n self.depth = n.bit_length()\n \n def sum(self, i):\n if i == 0:\n return 0\n s = 0\n while i > 0:\n s += self._container[i]\n i -= i & (-i)\n return s\n \n def add(self, i, x):\n if i == 0:\n return\n while i <= self.size:\n self._container[i] += x\n i += i & (-i)\n \n def lower_bound(self, x):\n if x == 0:\n return 0\n \n s = 0\n idx = 0\n for i in range(self.depth, -1, -1):\n k = idx + (1 << i)\n if k <= self.size and s + self._container[k] < x:\n s += self._container[k]\n idx += 1 << i\n return idx + 1\n \n def __repr__(self):\n return str(self._container)\n \n \n def main():\n N, Q = map(int, readline().split())\n a = list(map(int, readline().split()))\n bit = BinaryIndexTree(N + 1)\n \n for i, x in enumerate(a, 1):\n bit.add(i, x)\n \n for _ in range(Q):\n a, b, c = map(int, readline().split())\n if a == 0:\n bit.add(b, c)\n else:\n b += 1\n c += 1\n print(bit.sum(c - 1) - bit.sum(b - 1))\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 1, "removed_lines": 0, "code1_lines": 68 }, { "user_id": "u572142121", "problem_id": "p02616", "submission1_id": "s347843726", "submission2_id": "s706224064", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K=map(int, input().split())\nA=list(map(int, input().split()))\nD=[]\nzcnt,scnt,fcnt=0,0,0\nfor i in A:\n if i==0:\n zcnt+=1\n D.append((i,0))\n elif i>0:\n D.append((i,0))\n scnt+=1\n else:\n D.append((-i,1))\n fcnt+=1\nD=D[::-1]\nmod=10**9+7\nans=1\nseihu=0\nf,s,z=fcnt,scnt,zcnt\nX,Y,Z=[],[],[]\nfor i in range(K):\n ans*=D[i][0]\n ans%=mod\n seihu+=D[i][1]\n if D[i][0]!=0 and D[i][1]==1:\n fcnt-=1\n Y.append(-D[i][0])\n elif D[i][0]!=0 and D[i][1]==0:\n scnt-=1\n X.append(D[i][0])\n else:\n zcnt-=1\nF=D[K:]\nif seihu%2==0:\n print(ans)\nelse:\n C=[]\n if len(X)>0 and fcnt>0:\n \n for a,b in F:\n if b==1:\n g=-a\n break\n h=(ans*(pow(X[-1],mod-2,mod))*g)%mod\n C.append(h)\n if len(Y)>0 and scnt>0:\n \n for a,b in F:\n if b==0:\n g=a\n break\n h=(ans*(pow(Y[-1],mod-2,mod))*g)%mod\n C.append(h)\n if zcnt>0:\n C.append(0)\n if len(C)==0:\n ans=1\n D=D[::-1]\n for i in range(K):\n ans*=(-D[i][0])\n ans%=mod\n print(ans)\n else:\n print(max(C))", "code2": "N,K=map(int, input().split())\nA=list(map(int, input().split()))\nD,E=[],[]\nzcnt,scnt,fcnt=0,0,0\nfor i in A:\n if i==0:\n zcnt+=1\n D.append(0)\n elif i>0:\n D.append(i)\n scnt+=1\n else:\n E.append(i)\n fcnt+=1\nmod=10**9+7\nans=1\n\nif K==N:\n for i in A:\n ans*=i\n ans%=mod\n print(ans)\n exit()\n\nif K%2==1 and max(A)<0:\n A=sorted(A)[::-1]\n for i in range(K):\n ans*=A[i]\n ans%=mod\n print(ans)\n exit()\n\nif K>scnt+fcnt:\n print(0)\n exit()\nD,E=sorted(D)[::-1],sorted(E)\n\nans=1\ncnt=0\na,b=0,0\nwhile K-cnt>1:\n if a+1<=len(D)-1 and b+1<=len(E)-1:\n d,e=D[a]*D[a+1],E[b]*E[b+1]\n if d>e:\n ans*=D[a]\n a+=1\n cnt+=1\n ans%=mod\n else:\n ans*=e\n b+=2 \n ans%=mod\n cnt+=2\n elif a+1<=len(D)-1:\n d=D[a]*D[a+1]\n ans*=D[a]\n a+=1\n cnt+=1\n ans%=mod\n elif b+1<=len(E)-1:\n e=E[b]*E[b+1]\n ans*=e\n b+=2\n cnt+=2\n ans%=mod\n\nif K-cnt==1:\n Z=[]\n if a!=scnt:\n Z.append(D[a])\n if b!=fcnt:\n Z.append(E[-1])\n if 0 in A:\n Z.append(0)\n ans*=max(Z)\n ans%=mod\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594025802", "date2": "1596186960", "bleu_score": "0.639212226579333", "code1_test_status": [0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1], "code1_test_score": 25, "total_score": 104, "input": "10 2\n1000000000 100001000 10000000 1000000 100000 10000 1000 100 10 1\n", "actual_output": "10\n", "expected_output": "299993007\n\n", "anno_code": ["N,K=map(int, input().split()) # (0): N=10, K=2\nA=list(map(int, input().split())) # (1): A=[1000000000, 100001000, 10000000, 1000000, 100000, 10000, 1000, 100, 10, 1]\nD=[] # (2): D=[]\nzcnt,scnt,fcnt=0,0,0 # (3): zcnt=0, scnt=0, fcnt=0\nfor i in A: # (4): i=1000000000 (9): i=100001000 ... (54): NO CHANGE\n if i==0: # (5): NO CHANGE (10): NO CHANGE ... (50): NO CHANGE\n zcnt+=1\n D.append((i,0))\n elif i>0: # (6): NO CHANGE (11): NO CHANGE ... (51): NO CHANGE\n D.append((i,0)) # (7): D=[(1000000000, 0)] (12): D=[(1000000000, 0), (100001000, 0)] ... (52): D=[(1000000000, 0), (100001000, 0), (10000000, 0), (1000000, 0), (100000, 0), (10000, 0), (1000, 0), (100, 0), (10, 0), (1, 0)]\n scnt+=1 # (8): scnt=1 (13): scnt=2 ... (53): scnt=10\n else:\n D.append((-i,1))\n fcnt+=1\nD=D[::-1] # (55): D=[(1, 0), (10, 0), (100, 0), (1000, 0), (10000, 0), (100000, 0), (1000000, 0), (10000000, 0), (100001000, 0), (1000000000, 0)]\nmod=10**9+7 # (56): mod=1000000007\nans=1 # (57): ans=1\nseihu=0 # (58): seihu=0\nf,s,z=fcnt,scnt,zcnt # (59): f=0, s=10, z=0\nX,Y,Z=[],[],[] # (60): X=[], Y=[], Z=[]\nfor i in range(K): # (61): i=0 (69): i=1 (77): NO CHANGE\n ans*=D[i][0] # (62): NO CHANGE (70): ans=10\n ans%=mod # (63): NO CHANGE (71): NO CHANGE\n seihu+=D[i][1] # (64): NO CHANGE (72): NO CHANGE\n if D[i][0]!=0 and D[i][1]==1: # (65): NO CHANGE (73): NO CHANGE\n fcnt-=1\n Y.append(-D[i][0])\n elif D[i][0]!=0 and D[i][1]==0: # (66): NO CHANGE (74): NO CHANGE\n scnt-=1 # (67): scnt=9 (75): scnt=8\n X.append(D[i][0]) # (68): X=[1] (76): X=[1, 10]\n else:\n zcnt-=1\nF=D[K:] # (78): F=[(100, 0), (1000, 0), (10000, 0), (100000, 0), (1000000, 0), (10000000, 0), (100001000, 0), (1000000000, 0)]\nif seihu%2==0: # (79): NO CHANGE\n print(ans)\nelse:\n C=[]\n if len(X)>0 and fcnt>0:\n \n for a,b in F:\n if b==1:\n g=-a\n break\n h=(ans*(pow(X[-1],mod-2,mod))*g)%mod\n C.append(h)\n if len(Y)>0 and scnt>0:\n \n for a,b in F:\n if b==0:\n g=a\n break\n h=(ans*(pow(Y[-1],mod-2,mod))*g)%mod\n C.append(h)\n if zcnt>0:\n C.append(0)\n if len(C)==0:\n ans=1\n D=D[::-1]\n for i in range(K):\n ans*=(-D[i][0])\n ans%=mod\n print(ans)\n else:\n print(max(C))"], "anno_status": [false], "diff_content": " N,K=map(int, input().split())\n A=list(map(int, input().split()))\n-D=[]\n+D,E=[],[]\n zcnt,scnt,fcnt=0,0,0\n for i in A:\n if i==0:\n zcnt+=1\n- D.append((i,0))\n+ D.append(0)\n elif i>0:\n- D.append((i,0))\n+ D.append(i)\n scnt+=1\n else:\n- D.append((-i,1))\n+ E.append(i)\n fcnt+=1\n-D=D[::-1]\n mod=10**9+7\n ans=1\n-seihu=0\n-f,s,z=fcnt,scnt,zcnt\n-X,Y,Z=[],[],[]\n-for i in range(K):\n- ans*=D[i][0]\n- ans%=mod\n- seihu+=D[i][1]\n- if D[i][0]!=0 and D[i][1]==1:\n- fcnt-=1\n- Y.append(-D[i][0])\n- elif D[i][0]!=0 and D[i][1]==0:\n- scnt-=1\n- X.append(D[i][0])\n- else:\n- zcnt-=1\n-F=D[K:]\n-if seihu%2==0:\n+\n+if K==N:\n+ for i in A:\n+ ans*=i\n+ ans%=mod\n print(ans)\n-else:\n- C=[]\n- if len(X)>0 and fcnt>0:\n- \n- for a,b in F:\n- if b==1:\n- g=-a\n- break\n- h=(ans*(pow(X[-1],mod-2,mod))*g)%mod\n- C.append(h)\n- if len(Y)>0 and scnt>0:\n- \n- for a,b in F:\n- if b==0:\n- g=a\n- break\n- h=(ans*(pow(Y[-1],mod-2,mod))*g)%mod\n- C.append(h)\n- if zcnt>0:\n- C.append(0)\n- if len(C)==0:\n- ans=1\n- D=D[::-1]\n- for i in range(K):\n- ans*=(-D[i][0])\n+ exit()\n+\n+if K%2==1 and max(A)<0:\n+ A=sorted(A)[::-1]\n+ for i in range(K):\n+ ans*=A[i]\n+ ans%=mod\n+ print(ans)\n+ exit()\n+\n+if K>scnt+fcnt:\n+ print(0)\n+ exit()\n+D,E=sorted(D)[::-1],sorted(E)\n+\n+ans=1\n+cnt=0\n+a,b=0,0\n+while K-cnt>1:\n+ if a+1<=len(D)-1 and b+1<=len(E)-1:\n+ d,e=D[a]*D[a+1],E[b]*E[b+1]\n+ if d>e:\n+ ans*=D[a]\n+ a+=1\n+ cnt+=1\n ans%=mod\n- print(ans)\n- else:\n- print(max(C))\n+ else:\n+ ans*=e\n+ b+=2 \n+ ans%=mod\n+ cnt+=2\n+ elif a+1<=len(D)-1:\n+ d=D[a]*D[a+1]\n+ ans*=D[a]\n+ a+=1\n+ cnt+=1\n+ ans%=mod\n+ elif b+1<=len(E)-1:\n+ e=E[b]*E[b+1]\n+ ans*=e\n+ b+=2\n+ cnt+=2\n+ ans%=mod\n+\n+if K-cnt==1:\n+ Z=[]\n+ if a!=scnt:\n+ Z.append(D[a])\n+ if b!=fcnt:\n+ Z.append(E[-1])\n+ if 0 in A:\n+ Z.append(0)\n+ ans*=max(Z)\n+ ans%=mod\n+print(ans)\n", "FL_content": " N,K=map(int, input().split())\n A=list(map(int, input().split()))\n-D=[]\n zcnt,scnt,fcnt=0,0,0\n for i in A:\n if i==0:\n zcnt+=1\n- D.append((i,0))\n elif i>0:\n- D.append((i,0))\n scnt+=1\n else:\n- D.append((-i,1))\n fcnt+=1\n-D=D[::-1]\n mod=10**9+7\n ans=1\n-seihu=0\n-f,s,z=fcnt,scnt,zcnt\n-X,Y,Z=[],[],[]\n-for i in range(K):\n- ans*=D[i][0]\n- ans%=mod\n- seihu+=D[i][1]\n- if D[i][0]!=0 and D[i][1]==1:\n- fcnt-=1\n- Y.append(-D[i][0])\n- elif D[i][0]!=0 and D[i][1]==0:\n- scnt-=1\n- X.append(D[i][0])\n- else:\n- zcnt-=1\n-F=D[K:]\n-if seihu%2==0:\n print(ans)\n-else:\n- C=[]\n- if len(X)>0 and fcnt>0:\n- \n- for a,b in F:\n- if b==1:\n- g=-a\n- break\n- h=(ans*(pow(X[-1],mod-2,mod))*g)%mod\n- C.append(h)\n- if len(Y)>0 and scnt>0:\n- \n- for a,b in F:\n- if b==0:\n- g=a\n- break\n- h=(ans*(pow(Y[-1],mod-2,mod))*g)%mod\n- C.append(h)\n- if zcnt>0:\n- C.append(0)\n- if len(C)==0:\n- ans=1\n- D=D[::-1]\n- for i in range(K):\n- ans*=(-D[i][0])\n ans%=mod\n- print(ans)\n- else:\n- print(max(C))\n", "added_lines": 63, "removed_lines": 50, "code1_lines": 64 }, { "user_id": "u779455925", "problem_id": "p02616", "submission1_id": "s096693886", "submission2_id": "s191902560", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from heapq import *\nimport sys\nfrom collections import *\nfrom itertools import *\nfrom decimal import *\nimport copy\nfrom bisect import *\nimport math\nsys.setrecursionlimit(4100000)\ndef gcd(a,b):\n if(a%b==0):return(b)\n return (gcd(b,a%b))\ninput=lambda :sys.stdin.readline().rstrip()\nN,K=map(int,input().split())\n\nA=list(map(int,input().split()))\nmod=10**9+7\nAm=[-i for i in A if i<0]\nAp=[i for i in A if i>=0]\n\nAm.sort()\nAp.sort()\nAm=deque(Am)\nAp=deque(Ap)\n\n\n\nif N-K==0 and len(Am)%2==0 or len(Ap)==0 and K%2:\n c=1\n while K and (Am or Ap) :\n if Am and Ap:\n if Am[0]Ap[0]:\n\n a=Am.pop()\n c*=a\n h+=1\n else:\n\n b=Ap.pop()\n c*=b\n\n elif Am:\n a=Am.pop()\n c*=a\n h+=1\n elif Ap:\n b=Ap.pop()\n c*=b\n K-=1\n c%=mod\n \n\n\nprint(c%mod)\n", "code2": "from heapq import *\nimport sys\nfrom collections import *\nfrom itertools import *\nfrom decimal import *\nimport copy\nfrom bisect import *\nimport math\nsys.setrecursionlimit(4100000)\ndef gcd(a,b):\n if(a%b==0):return(b)\n return (gcd(b,a%b))\ninput=lambda :sys.stdin.readline().rstrip()\nN,K=map(int,input().split())\n\nA=list(map(int,input().split()))\nmod=10**9+7\nAm=[-i for i in A if i<0]\nAp=[i for i in A if i>=0]\n\nAm.sort()\nAp.sort()\nAm=deque(Am)\nAp=deque(Ap)\n\n\n\nif N==K:\n c=1\n for a in A:\n c*=a\n c%=mod\n\nelif len(Ap)==0 and K%2:\n c=1\n while K :\n c*=Am.popleft()\n\n K-=1\n\n c%=mod\n c=-c\n c%=mod\n \n\nelse:\n \n c=1\n h=0\n a=\"unko\"\n b=\"unko\"\n while K and (Am or Ap) :\n if Am and Ap:\n if Am[-1]>Ap[-1]:\n\n a=Am.pop()\n c*=a\n h+=1\n else:\n\n b=Ap.pop()\n c*=b\n\n elif Am:\n a=Am.pop()\n c*=a\n h+=1\n elif Ap:\n b=Ap.pop()\n c*=b\n K-=1\n c%=mod\n\n if h%2:\n if Am and Ap and a!=\"unko\" and b!=\"unko\":\n if Am[-1]*a>Ap[-1]*b:\n a=Am.pop()\n c*=a\n c*=pow(b,mod-2,mod)\n else:\n b=Ap.pop()\n c*=b\n c*=pow(a,mod-2,mod)\n elif Am and b!=\"unko\":\n a=Am.pop()\n c*=a\n c*=pow(b,mod-2,mod)\n else:\n b=Ap.pop()\n c*=b\n c*=pow(a,mod-2,mod)\n\n\nprint(c%mod)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593981526", "date2": "1593984180", "bleu_score": "0.8362306321451449", "code1_test_status": [0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 101, "total_score": 104, "input": "4 2\n1 2 -4 -1\n", "actual_output": "2\n", "expected_output": "4\n\n", "anno_code": ["from heapq import *\nimport sys\nfrom collections import *\nfrom itertools import *\nfrom decimal import *\nimport copy\nfrom bisect import *\nimport math\nsys.setrecursionlimit(4100000) # (0): NO CHANGE\ndef gcd(a,b): # (1): gcd=\n if(a%b==0):return(b)\n return (gcd(b,a%b))\ninput=lambda :sys.stdin.readline().rstrip() # (2): input= at 0x00000189CEA59EA0>\nN,K=map(int,input().split()) # (3): N=4, K=2\n\nA=list(map(int,input().split())) # (4): A=[1, 2, -4, -1]\nmod=10**9+7 # (5): mod=1000000007\nAm=[-i for i in A if i<0] # (6): Am=[4, 1]\nAp=[i for i in A if i>=0] # (7): Ap=[1, 2]\n\nAm.sort() # (8): Am=[1, 4]\nAp.sort() # (9): NO CHANGE\nAm=deque(Am) # (10): NO CHANGE\nAp=deque(Ap) # (11): NO CHANGE\n\n\n\nif N-K==0 and len(Am)%2==0 or len(Ap)==0 and K%2: # (12): NO CHANGE\n c=1\n while K and (Am or Ap) :\n if Am and Ap:\n if Am[0]Ap[0]: # (22): NO CHANGE (29): NO CHANGE\n\n a=Am.pop()\n c*=a\n h+=1\n else:\n\n b=Ap.pop() # (23): b=2 (30): b=1\n c*=b # (24): c=2 (31): NO CHANGE\n\n elif Am:\n a=Am.pop()\n c*=a\n h+=1\n elif Ap:\n b=Ap.pop()\n c*=b\n K-=1 # (25): K=1 (32): K=0\n c%=mod # (26): NO CHANGE (33): NO CHANGE\n \n\n\nprint(c%mod)\n"], "anno_status": [false], "diff_content": " from heapq import *\n import sys\n from collections import *\n from itertools import *\n from decimal import *\n import copy\n from bisect import *\n import math\n sys.setrecursionlimit(4100000)\n def gcd(a,b):\n if(a%b==0):return(b)\n return (gcd(b,a%b))\n input=lambda :sys.stdin.readline().rstrip()\n N,K=map(int,input().split())\n \n A=list(map(int,input().split()))\n mod=10**9+7\n Am=[-i for i in A if i<0]\n Ap=[i for i in A if i>=0]\n \n Am.sort()\n Ap.sort()\n Am=deque(Am)\n Ap=deque(Ap)\n \n \n \n-if N-K==0 and len(Am)%2==0 or len(Ap)==0 and K%2:\n+if N==K:\n c=1\n- while K and (Am or Ap) :\n- if Am and Ap:\n- if Am[0]Ap[0]:\n+ if Am and Ap:\n+ if Am[-1]>Ap[-1]:\n+\n+ a=Am.pop()\n+ c*=a\n+ h+=1\n+ else:\n \n- a=Am.pop()\n- c*=a\n- h+=1\n- else:\n+ b=Ap.pop()\n+ c*=b\n \n- b=Ap.pop()\n- c*=b\n+ elif Am:\n+ a=Am.pop()\n+ c*=a\n+ h+=1\n+ elif Ap:\n+ b=Ap.pop()\n+ c*=b\n+ K-=1\n+ c%=mod\n \n- elif Am:\n+ if h%2:\n+ if Am and Ap and a!=\"unko\" and b!=\"unko\":\n+ if Am[-1]*a>Ap[-1]*b:\n a=Am.pop()\n c*=a\n- h+=1\n- elif Ap:\n+ c*=pow(b,mod-2,mod)\n+ else:\n b=Ap.pop()\n c*=b\n- K-=1\n- c%=mod\n- \n+ c*=pow(a,mod-2,mod)\n+ elif Am and b!=\"unko\":\n+ a=Am.pop()\n+ c*=a\n+ c*=pow(b,mod-2,mod)\n+ else:\n+ b=Ap.pop()\n+ c*=b\n+ c*=pow(a,mod-2,mod)\n \n \n print(c%mod)\n \n", "FL_content": " from heapq import *\n import sys\n from collections import *\n from itertools import *\n from decimal import *\n import copy\n from bisect import *\n import math\n sys.setrecursionlimit(4100000)\n def gcd(a,b):\n if(a%b==0):return(b)\n return (gcd(b,a%b))\n input=lambda :sys.stdin.readline().rstrip()\n N,K=map(int,input().split())\n \n A=list(map(int,input().split()))\n mod=10**9+7\n Am=[-i for i in A if i<0]\n Ap=[i for i in A if i>=0]\n \n Am.sort()\n Ap.sort()\n Am=deque(Am)\n Ap=deque(Ap)\n \n \n \n-if N-K==0 and len(Am)%2==0 or len(Ap)==0 and K%2:\n c=1\n- while K and (Am or Ap) :\n- if Am and Ap:\n- if Am[0]Ap[0]:\n \n- a=Am.pop()\n- c*=a\n- h+=1\n- else:\n \n- b=Ap.pop()\n- c*=b\n \n- elif Am:\n a=Am.pop()\n c*=a\n- h+=1\n- elif Ap:\n b=Ap.pop()\n c*=b\n- K-=1\n- c%=mod\n- \n \n \n print(c%mod)\n \n", "added_lines": 46, "removed_lines": 30, "code1_lines": 79 }, { "user_id": "u504562455", "problem_id": "p02616", "submission1_id": "s379811765", "submission2_id": "s544270411", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\n\nN, K = [int(_) for _ in input().split()]\nA = [int(_) for _ in input().split()]\nMOD = 10 ** 9 + 7\nA_p = []\nA_n = []\nfor a in A:\n if a >= 0:\n A_p.append(a)\n else:\n A_n.append(-a)\n\nA_p.sort(reverse=True)\nA_n.sort(reverse=True)\nA_p = deque(A_p)\nA_n = deque(A_n)\n\np_top = 0\nn_top = 0\nans_p = deque([])\nans_n = deque([])\nfor i in range(K):\n if len(A_p) == 0:\n ans_n.append(A_n.popleft())\n elif len(A_n) == 0:\n ans_p.append(A_p.popleft())\n elif A_p[0] >= A_n[0]:\n ans_p.append(A_p.popleft())\n else:\n ans_n.append(A_n.popleft())\nif 0 in ans_p:\n ans = 0\nelif len(ans_n) % 2 == 1:\n if len(ans_p) == 0 and len(A_p) > 0:\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_n) == 0 and len(A_n) > 0:\n ans_p.pop()\n ans_n.append(A_n.popleft())\n elif len(ans_p) > 0 and len(ans_n) > 0 and len(A_p) > 0 and len(A_n) > 0 and ans_p[-1] * A_p[0] >= ans_n[-1] * A_n[0]:\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_p) > 0 and len(A_n) > 0:\n ans_p.pop()\n ans_n.append(A_n.popleft())\nans = 1\nfor a in ans_p:\n ans = (a * ans) % MOD\nfor a in ans_n:\n ans = (-a * ans) % MOD\nif ans != 0 and len(ans_n) % 2 == 1:\n ans = 1\n A_abs = [abs(a) for a in A]\n A_abs.sort()\n for i in range(K):\n ans = (ans * A_abs[i]) % MOD\n ans = (-ans) % MOD\nprint(ans)\n\n\n", "code2": "from collections import deque\n\nN, K = [int(_) for _ in input().split()]\nA = [int(_) for _ in input().split()]\nMOD = 10 ** 9 + 7\nA_p = []\nA_n = []\nfor a in A:\n if a >= 0:\n A_p.append(a)\n else:\n A_n.append(-a)\n\nA_p.sort(reverse=True)\nA_n.sort(reverse=True)\nA_p = deque(A_p)\nA_n = deque(A_n)\n\np_top = 0\nn_top = 0\nans_p = deque([])\nans_n = deque([])\nfor i in range(K):\n if len(A_p) == 0:\n ans_n.append(A_n.popleft())\n elif len(A_n) == 0:\n ans_p.append(A_p.popleft())\n elif A_p[0] >= A_n[0]:\n ans_p.append(A_p.popleft())\n else:\n ans_n.append(A_n.popleft())\nif len(ans_n) % 2 == 1:\n if len(ans_p) == 0 and len(A_p) > 0:\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_n) == 0 and len(A_n) > 0:\n ans_p.pop()\n ans_n.append(A_n.popleft())\n elif len(ans_p) > 0 and len(ans_n) > 0 and len(A_p) > 0 and len(A_n) > 0 and ans_p[-1] * A_p[0] >= ans_n[-1] * A_n[0]:\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_p) > 0 and len(A_n) > 0:\n ans_p.pop()\n ans_n.append(A_n.popleft())\n elif len(ans_n) > 0 and len(A_p) > 0:\n ans_n.pop()\n ans_p.append(A_p.popleft())\nans = 1\nfor a in ans_p:\n ans = (a * ans) % MOD\nfor a in ans_n:\n ans = (-a * ans) % MOD\nif ans != 0 and len(ans_n) % 2 == 1:\n ans = 1\n A_abs = [abs(a) for a in A]\n A_abs.sort()\n for i in range(K):\n ans = (ans * A_abs[i]) % MOD\n ans = (-ans) % MOD\nprint(ans)\n\n\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593988952", "date2": "1593989357", "bleu_score": "0.9481308215606573", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 103, "total_score": 104, "input": "4 2\n1 2 -3 0\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["from collections import deque\n\nN, K = [int(_) for _ in input().split()] # (0): N=4, K=2\nA = [int(_) for _ in input().split()] # (1): A=[1, 2, -3, 0]\nMOD = 10 ** 9 + 7 # (2): MOD=1000000007\nA_p = [] # (3): A_p=[]\nA_n = [] # (4): A_n=[]\nfor a in A: # (5): a=1 (8): a=2 ... (17): NO CHANGE\n if a >= 0: # (6): NO CHANGE (9): NO CHANGE ... (15): NO CHANGE\n A_p.append(a) # (7): A_p=[1] (10): A_p=[1, 2] (16): A_p=[1, 2, 0]\n else:\n A_n.append(-a) # (13): A_n=[3]\n\nA_p.sort(reverse=True) # (18): A_p=[2, 1, 0]\nA_n.sort(reverse=True) # (19): NO CHANGE\nA_p = deque(A_p) # (20): NO CHANGE\nA_n = deque(A_n) # (21): NO CHANGE\n\np_top = 0 # (22): p_top=0\nn_top = 0 # (23): n_top=0\nans_p = deque([]) # (24): ans_p=deque([2])\nans_n = deque([]) # (25): ans_n=deque([3])\nfor i in range(K): # (26): i=0 (31): i=1 (35): NO CHANGE\n if len(A_p) == 0: # (27): NO CHANGE (32): NO CHANGE\n ans_n.append(A_n.popleft())\n elif len(A_n) == 0: # (28): NO CHANGE (33): NO CHANGE\n ans_p.append(A_p.popleft()) # (34): NO CHANGE\n elif A_p[0] >= A_n[0]: # (29): NO CHANGE\n ans_p.append(A_p.popleft())\n else:\n ans_n.append(A_n.popleft()) # (30): NO CHANGE\nif 0 in ans_p: # (36): NO CHANGE\n ans = 0\nelif len(ans_n) % 2 == 1: # (37): NO CHANGE\n if len(ans_p) == 0 and len(A_p) > 0: # (38): NO CHANGE\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_n) == 0 and len(A_n) > 0: # (39): NO CHANGE\n ans_p.pop()\n ans_n.append(A_n.popleft())\n elif len(ans_p) > 0 and len(ans_n) > 0 and len(A_p) > 0 and len(A_n) > 0 and ans_p[-1] * A_p[0] >= ans_n[-1] * A_n[0]: # (40): NO CHANGE\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_p) > 0 and len(A_n) > 0: # (41): NO CHANGE\n ans_p.pop()\n ans_n.append(A_n.popleft())\nans = 1 # (42): ans=1\nfor a in ans_p: # (43): a=2 (45): NO CHANGE\n ans = (a * ans) % MOD # (44): ans=2\nfor a in ans_n: # (46): a=3 (48): NO CHANGE\n ans = (-a * ans) % MOD # (47): ans=1000000001\nif ans != 0 and len(ans_n) % 2 == 1: # (49): NO CHANGE\n ans = 1 # (50): ans=1\n A_abs = [abs(a) for a in A] # (51): A_abs=[1, 2, 3, 0]\n A_abs.sort() # (52): A_abs=[0, 1, 2, 3]\n for i in range(K): # (53): i=0 (55): i=1 (57): NO CHANGE\n ans = (ans * A_abs[i]) % MOD # (54): ans=0 (56): NO CHANGE\n ans = (-ans) % MOD # (58): NO CHANGE\nprint(ans)\n\n\n"], "anno_status": [false], "diff_content": " from collections import deque\n \n N, K = [int(_) for _ in input().split()]\n A = [int(_) for _ in input().split()]\n MOD = 10 ** 9 + 7\n A_p = []\n A_n = []\n for a in A:\n if a >= 0:\n A_p.append(a)\n else:\n A_n.append(-a)\n \n A_p.sort(reverse=True)\n A_n.sort(reverse=True)\n A_p = deque(A_p)\n A_n = deque(A_n)\n \n p_top = 0\n n_top = 0\n ans_p = deque([])\n ans_n = deque([])\n for i in range(K):\n if len(A_p) == 0:\n ans_n.append(A_n.popleft())\n elif len(A_n) == 0:\n ans_p.append(A_p.popleft())\n elif A_p[0] >= A_n[0]:\n ans_p.append(A_p.popleft())\n else:\n ans_n.append(A_n.popleft())\n-if 0 in ans_p:\n- ans = 0\n-elif len(ans_n) % 2 == 1:\n+if len(ans_n) % 2 == 1:\n if len(ans_p) == 0 and len(A_p) > 0:\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_n) == 0 and len(A_n) > 0:\n ans_p.pop()\n ans_n.append(A_n.popleft())\n elif len(ans_p) > 0 and len(ans_n) > 0 and len(A_p) > 0 and len(A_n) > 0 and ans_p[-1] * A_p[0] >= ans_n[-1] * A_n[0]:\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_p) > 0 and len(A_n) > 0:\n ans_p.pop()\n ans_n.append(A_n.popleft())\n+ elif len(ans_n) > 0 and len(A_p) > 0:\n+ ans_n.pop()\n+ ans_p.append(A_p.popleft())\n ans = 1\n for a in ans_p:\n ans = (a * ans) % MOD\n for a in ans_n:\n ans = (-a * ans) % MOD\n if ans != 0 and len(ans_n) % 2 == 1:\n ans = 1\n A_abs = [abs(a) for a in A]\n A_abs.sort()\n for i in range(K):\n ans = (ans * A_abs[i]) % MOD\n ans = (-ans) % MOD\n print(ans)\n \n \n \n", "FL_content": " from collections import deque\n \n N, K = [int(_) for _ in input().split()]\n A = [int(_) for _ in input().split()]\n MOD = 10 ** 9 + 7\n A_p = []\n A_n = []\n for a in A:\n if a >= 0:\n A_p.append(a)\n else:\n A_n.append(-a)\n \n A_p.sort(reverse=True)\n A_n.sort(reverse=True)\n A_p = deque(A_p)\n A_n = deque(A_n)\n \n p_top = 0\n n_top = 0\n ans_p = deque([])\n ans_n = deque([])\n for i in range(K):\n if len(A_p) == 0:\n ans_n.append(A_n.popleft())\n elif len(A_n) == 0:\n ans_p.append(A_p.popleft())\n elif A_p[0] >= A_n[0]:\n ans_p.append(A_p.popleft())\n else:\n ans_n.append(A_n.popleft())\n-if 0 in ans_p:\n- ans = 0\n-elif len(ans_n) % 2 == 1:\n if len(ans_p) == 0 and len(A_p) > 0:\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_n) == 0 and len(A_n) > 0:\n ans_p.pop()\n ans_n.append(A_n.popleft())\n elif len(ans_p) > 0 and len(ans_n) > 0 and len(A_p) > 0 and len(A_n) > 0 and ans_p[-1] * A_p[0] >= ans_n[-1] * A_n[0]:\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_p) > 0 and len(A_n) > 0:\n ans_p.pop()\n ans_n.append(A_n.popleft())\n ans = 1\n for a in ans_p:\n ans = (a * ans) % MOD\n for a in ans_n:\n ans = (-a * ans) % MOD\n if ans != 0 and len(ans_n) % 2 == 1:\n ans = 1\n A_abs = [abs(a) for a in A]\n A_abs.sort()\n for i in range(K):\n ans = (ans * A_abs[i]) % MOD\n ans = (-ans) % MOD\n print(ans)\n \n \n \n", "added_lines": 4, "removed_lines": 3, "code1_lines": 62 }, { "user_id": "u723792785", "problem_id": "p02616", "submission1_id": "s684704185", "submission2_id": "s910235180", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int,input().split())\na = list(map(int,input().split()))\nmod = 10**9 + 7\n\nplus = []\nminus = []\n\nfor i in a:\n\tif i >= 0:\n\t\tplus.append(i)\n\telse:\n\t\tminus.append(i)\n\nplus.sort()\nminus.sort(key=lambda x:-x)\n\n\n\n\nnumplus = k\nnumminus = 0\n\n\nwhile numplus > len(plus):\n\tnumplus -= 2\n\tnumminus += 2\n\ntmpminus = -1\n\n\n\nwhile numplus-2 >= 0 and numminus+1 < len(minus):\n\tif plus[numplus-1] * plus[numplus-2] <= minus[numminus] * minus[numminus+1]:\n\t\tnumplus -= 2\n\t\tnumminus += 2\n\t\ttmpminus = numminus\n\telse:\n\t\tbreak\n\n\n\nans = 1\nif tmpminus != -1:\n\tfor i in range(numplus):\n\t\tans = ans * plus[i] % mod\n\tfor i in range(numminus):\n\t\tans = ans * minus[i] % mod\nelse:\n\t\n\t\n\ttmp = sorted(a, key=lambda x:-x)\n\tfor i in range(k):\n\t\tans = ans * tmp[i]%mod\n\nprint(ans)", "code2": "n, k = map(int,input().split())\na = list(map(int,input().split()))\nmod = 10**9 + 7\n\nplus = []\nminus = []\n\nfor i in a:\n\tif i >= 0:\n\t\tplus.append(i)\n\telse:\n\t\tminus.append(i)\n\nplus.sort(key = lambda x:-x)\nminus.sort()\n\n\n\n\n\nnumplus = k\nnumminus = 0\n\n\nwhile numplus > len(plus):\n\tnumplus -= 2\n\tnumminus += 2\n\n\n\nwhile numplus-2 >= 0 and numminus+1 < len(minus):\n\tif plus[numplus-1] * plus[numplus-2] <= minus[numminus] * minus[numminus+1]:\n\t\tnumplus -= 2\n\t\tnumminus += 2\n\telse:\n\t\tbreak\n\n\n\nans = 1\n\nif numplus >= 0 and numminus >= 0 and numminus <= len(minus) and numplus <= len(plus):\n\tfor i in range(numplus):\n\t\tans = ans * plus[i] % mod\n\tfor i in range(numminus):\n\t\tans = ans * minus[i] % mod\nelse:\n\t\n\t\n\ttmp = sorted(a, key=lambda x:-x)\n\tfor i in range(k):\n\t\tans = ans * tmp[i]%mod\n\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593988632", "date2": "1593989065", "bleu_score": "0.9140705278839458", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 101, "total_score": 104, "input": "4 2\n-1 -2 -2 -4\n", "actual_output": "2\n", "expected_output": "8\n\n", "anno_code": ["n, k = map(int,input().split()) # (0): n=4, k=2\na = list(map(int,input().split())) # (1): a=[-1, -2, -2, -4]\nmod = 10**9 + 7 # (2): mod=1000000007\n\nplus = [] # (3): plus=[]\nminus = [] # (4): minus=[]\n\nfor i in a: # (5): i=-1 (8): i=-2 ... (17): NO CHANGE\n\tif i >= 0: # (6): NO CHANGE (9): NO CHANGE ... (15): NO CHANGE\n\t\tplus.append(i)\n\telse:\n\t\tminus.append(i) # (7): minus=[-1] (10): minus=[-1, -2] ... (16): minus=[-1, -2, -2, -4]\n\nplus.sort() # (18): NO CHANGE\nminus.sort(key=lambda x:-x) # (19): NO CHANGE\n\n\n\n\nnumplus = k # (20): numplus=2\nnumminus = 0 # (21): numminus=0\n\n\nwhile numplus > len(plus): # (22): NO CHANGE (25): NO CHANGE\n\tnumplus -= 2 # (23): numplus=0\n\tnumminus += 2 # (24): numminus=2\n\ntmpminus = -1 # (26): tmpminus=-1\n\n\n\nwhile numplus-2 >= 0 and numminus+1 < len(minus): # (27): NO CHANGE\n\tif plus[numplus-1] * plus[numplus-2] <= minus[numminus] * minus[numminus+1]:\n\t\tnumplus -= 2\n\t\tnumminus += 2\n\t\ttmpminus = numminus\n\telse:\n\t\tbreak\n\n\n\nans = 1 # (28): ans=1\nif tmpminus != -1: # (29): NO CHANGE\n\tfor i in range(numplus):\n\t\tans = ans * plus[i] % mod\n\tfor i in range(numminus):\n\t\tans = ans * minus[i] % mod\nelse:\n\t\n\t\n\ttmp = sorted(a, key=lambda x:-x) # (30): tmp=[-1, -2, -2, -4]\n\tfor i in range(k): # (31): i=0 (33): i=1 (35): NO CHANGE\n\t\tans = ans * tmp[i]%mod # (32): ans=1000000006 (34): ans=2\n\nprint(ans)"], "anno_status": [true], "diff_content": " n, k = map(int,input().split())\n a = list(map(int,input().split()))\n mod = 10**9 + 7\n \n plus = []\n minus = []\n \n for i in a:\n \tif i >= 0:\n \t\tplus.append(i)\n \telse:\n \t\tminus.append(i)\n \n-plus.sort()\n-minus.sort(key=lambda x:-x)\n+plus.sort(key = lambda x:-x)\n+minus.sort()\n+\n \n \n \n \n numplus = k\n numminus = 0\n \n \n while numplus > len(plus):\n \tnumplus -= 2\n \tnumminus += 2\n \n-tmpminus = -1\n-\n \n \n while numplus-2 >= 0 and numminus+1 < len(minus):\n \tif plus[numplus-1] * plus[numplus-2] <= minus[numminus] * minus[numminus+1]:\n \t\tnumplus -= 2\n \t\tnumminus += 2\n-\t\ttmpminus = numminus\n \telse:\n \t\tbreak\n \n \n \n ans = 1\n-if tmpminus != -1:\n+\n+if numplus >= 0 and numminus >= 0 and numminus <= len(minus) and numplus <= len(plus):\n \tfor i in range(numplus):\n \t\tans = ans * plus[i] % mod\n \tfor i in range(numminus):\n \t\tans = ans * minus[i] % mod\n else:\n \t\n \t\n \ttmp = sorted(a, key=lambda x:-x)\n \tfor i in range(k):\n \t\tans = ans * tmp[i]%mod\n \n print(ans)\n", "FL_content": " n, k = map(int,input().split())\n a = list(map(int,input().split()))\n mod = 10**9 + 7\n \n plus = []\n minus = []\n \n for i in a:\n \tif i >= 0:\n \t\tplus.append(i)\n \telse:\n \t\tminus.append(i)\n \n-plus.sort()\n-minus.sort(key=lambda x:-x)\n \n \n \n \n numplus = k\n numminus = 0\n \n \n while numplus > len(plus):\n \tnumplus -= 2\n \tnumminus += 2\n \n-tmpminus = -1\n-\n \n \n while numplus-2 >= 0 and numminus+1 < len(minus):\n \tif plus[numplus-1] * plus[numplus-2] <= minus[numminus] * minus[numminus+1]:\n \t\tnumplus -= 2\n \t\tnumminus += 2\n-\t\ttmpminus = numminus\n \telse:\n \t\tbreak\n \n \n \n ans = 1\n-if tmpminus != -1:\n \tfor i in range(numplus):\n \t\tans = ans * plus[i] % mod\n \tfor i in range(numminus):\n \t\tans = ans * minus[i] % mod\n else:\n \t\n \t\n \ttmp = sorted(a, key=lambda x:-x)\n \tfor i in range(k):\n \t\tans = ans * tmp[i]%mod\n \n print(ans)\n", "added_lines": 5, "removed_lines": 6, "code1_lines": 55 }, { "user_id": "u474423089", "problem_id": "p02616", "submission1_id": "s867611646", "submission2_id": "s418073431", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int, input().split(' '))\nA = sorted(list(map(int, input().split(' '))))\nmod = 10 ** 9 + 7\np = 0\nfor i in range(N):\n if A[i] >= 0:\n break\np = i\nif (p==N-1 and K%2 != 0) or (N==K and p%2 == 0):\n ans = 1\n for i in range(K):\n ans *= A[-1-i]\n ans %= mod\n print(ans)\n exit()\nminus = A[:p]\nplus = A[p:]\nlen_m = len(minus)\nlen_p = len(plus)\nm = 0\np = 0\nans = 1\nwhile K > 0:\n if K >= 2 and m <= len_m - 2 and p <= len_p - 2:\n if minus[m] * minus[m] >= plus[p] * plus[p + 1]:\n ans *= minus[m] * minus[m+1]\n ans %= mod\n m += 2\n else:\n ans *= plus[p] * plus[p + 1]\n ans %= mod\n p += 2\n K -= 2\n elif K >= 2 and m <= len_m-2:\n ans *= minus[m] * minus[m+1]\n ans %= mod\n m += 2\n K -= 2\n elif K >= 2 and p <= len_p-2:\n ans *= plus[p] * plus[p + 1]\n ans %= mod\n p += 2\n K -= 2\n elif p <= len_p -1:\n ans *= plus[p]\n ans %= mod\n p += 1\n K -= 1\n else:\n ans *= minus[m]\n ans %= mod\n m += 1\n K -= 1\nprint(ans)", "code2": "N, K = map(int, input().split(' '))\nA = sorted(list(map(int, input().split(' '))))\nmod = 10 ** 9 + 7\np = 0\nfor i in range(N):\n if A[i] >= 0:\n break\np = i\nif (p == N - 1 and K % 2 != 0):\n ans = 1\n for i in range(K):\n ans *= A[-1 - i]\n ans %= mod\n print(ans%mod)\n exit()\nminus = A[:p]\nplus = sorted(A[p:],reverse=True)\nlen_m = len(minus)\nlen_p = len(plus)\nm = 0\np = 0\nans = 1\nwhile K > 0:\n if K >= 2 and m <= len_m - 2 and p <= len_p - 2:\n if minus[m] * minus[m+1] >= plus[p] * plus[p + 1]:\n ans *= minus[m] * minus[m + 1]\n ans %= mod\n m += 2\n else:\n ans *= plus[p] * plus[p + 1]\n ans %= mod\n p += 2\n K -= 2\n elif K >= 2 and m <= len_m - 2:\n ans *= minus[m] * minus[m + 1]\n ans %= mod\n m += 2\n K -= 2\n elif K >= 2 and p <= len_p - 2:\n ans *= plus[p] * plus[p + 1]\n ans %= mod\n p += 2\n K -= 2\n elif p <= len_p - 1:\n ans *= plus[p]\n ans %= mod\n p += 1\n K -= 1\n else:\n ans *= minus[m]\n ans %= mod\n m += 1\n K -= 1\nprint(ans%mod)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593980534", "date2": "1593981667", "bleu_score": "0.9419864526179231", "code1_test_status": [0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1], "code1_test_score": 42, "total_score": 104, "input": "4 2\n1 2 -3 0\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["N, K = map(int, input().split(' ')) # (0): N=4, K=2\nA = sorted(list(map(int, input().split(' ')))) # (1): A=[-3, 0, 1, 2]\nmod = 10 ** 9 + 7 # (2): mod=1000000007\np = 0 # (3): p=0\nfor i in range(N): # (4): i=0 (6): i=1\n if A[i] >= 0: # (5): NO CHANGE (7): NO CHANGE\n break # (8): NO CHANGE\np = i # (9): p=1\nif (p==N-1 and K%2 != 0) or (N==K and p%2 == 0): # (10): NO CHANGE\n ans = 1\n for i in range(K):\n ans *= A[-1-i]\n ans %= mod\n print(ans)\n exit()\nminus = A[:p] # (11): minus=[-3]\nplus = A[p:] # (12): plus=[0, 1, 2]\nlen_m = len(minus) # (13): len_m=1\nlen_p = len(plus) # (14): len_p=3\nm = 0 # (15): m=0\np = 0 # (16): p=0\nans = 1 # (17): ans=1\nwhile K > 0: # (18): NO CHANGE (26): NO CHANGE\n if K >= 2 and m <= len_m - 2 and p <= len_p - 2: # (19): NO CHANGE\n if minus[m] * minus[m] >= plus[p] * plus[p + 1]:\n ans *= minus[m] * minus[m+1]\n ans %= mod\n m += 2\n else:\n ans *= plus[p] * plus[p + 1]\n ans %= mod\n p += 2\n K -= 2\n elif K >= 2 and m <= len_m-2: # (20): NO CHANGE\n ans *= minus[m] * minus[m+1]\n ans %= mod\n m += 2\n K -= 2\n elif K >= 2 and p <= len_p-2: # (21): NO CHANGE\n ans *= plus[p] * plus[p + 1] # (22): ans=0\n ans %= mod # (23): NO CHANGE\n p += 2 # (24): p=2\n K -= 2 # (25): K=0\n elif p <= len_p -1:\n ans *= plus[p]\n ans %= mod\n p += 1\n K -= 1\n else:\n ans *= minus[m]\n ans %= mod\n m += 1\n K -= 1\nprint(ans)"], "anno_status": [false], "diff_content": " N, K = map(int, input().split(' '))\n A = sorted(list(map(int, input().split(' '))))\n mod = 10 ** 9 + 7\n p = 0\n for i in range(N):\n if A[i] >= 0:\n break\n p = i\n-if (p==N-1 and K%2 != 0) or (N==K and p%2 == 0):\n+if (p == N - 1 and K % 2 != 0):\n ans = 1\n for i in range(K):\n- ans *= A[-1-i]\n+ ans *= A[-1 - i]\n ans %= mod\n- print(ans)\n+ print(ans%mod)\n exit()\n minus = A[:p]\n-plus = A[p:]\n+plus = sorted(A[p:],reverse=True)\n len_m = len(minus)\n len_p = len(plus)\n m = 0\n p = 0\n ans = 1\n while K > 0:\n if K >= 2 and m <= len_m - 2 and p <= len_p - 2:\n- if minus[m] * minus[m] >= plus[p] * plus[p + 1]:\n- ans *= minus[m] * minus[m+1]\n+ if minus[m] * minus[m+1] >= plus[p] * plus[p + 1]:\n+ ans *= minus[m] * minus[m + 1]\n ans %= mod\n m += 2\n else:\n ans *= plus[p] * plus[p + 1]\n ans %= mod\n p += 2\n K -= 2\n- elif K >= 2 and m <= len_m-2:\n- ans *= minus[m] * minus[m+1]\n+ elif K >= 2 and m <= len_m - 2:\n+ ans *= minus[m] * minus[m + 1]\n ans %= mod\n m += 2\n K -= 2\n- elif K >= 2 and p <= len_p-2:\n+ elif K >= 2 and p <= len_p - 2:\n ans *= plus[p] * plus[p + 1]\n ans %= mod\n p += 2\n K -= 2\n- elif p <= len_p -1:\n+ elif p <= len_p - 1:\n ans *= plus[p]\n ans %= mod\n p += 1\n K -= 1\n else:\n ans *= minus[m]\n ans %= mod\n m += 1\n K -= 1\n-print(ans)\n+print(ans%mod)\n+\n", "FL_content": " N, K = map(int, input().split(' '))\n A = sorted(list(map(int, input().split(' '))))\n mod = 10 ** 9 + 7\n p = 0\n for i in range(N):\n if A[i] >= 0:\n break\n p = i\n-if (p==N-1 and K%2 != 0) or (N==K and p%2 == 0):\n ans = 1\n for i in range(K):\n- ans *= A[-1-i]\n ans %= mod\n- print(ans)\n exit()\n minus = A[:p]\n-plus = A[p:]\n len_m = len(minus)\n len_p = len(plus)\n m = 0\n p = 0\n ans = 1\n while K > 0:\n if K >= 2 and m <= len_m - 2 and p <= len_p - 2:\n- if minus[m] * minus[m] >= plus[p] * plus[p + 1]:\n- ans *= minus[m] * minus[m+1]\n ans %= mod\n m += 2\n else:\n ans *= plus[p] * plus[p + 1]\n ans %= mod\n p += 2\n K -= 2\n- elif K >= 2 and m <= len_m-2:\n- ans *= minus[m] * minus[m+1]\n ans %= mod\n m += 2\n K -= 2\n- elif K >= 2 and p <= len_p-2:\n ans *= plus[p] * plus[p + 1]\n ans %= mod\n p += 2\n K -= 2\n- elif p <= len_p -1:\n ans *= plus[p]\n ans %= mod\n p += 1\n K -= 1\n else:\n ans *= minus[m]\n ans %= mod\n m += 1\n K -= 1\n-print(ans)\n", "added_lines": 12, "removed_lines": 11, "code1_lines": 54 }, { "user_id": "u459798349", "problem_id": "p02616", "submission1_id": "s880935502", "submission2_id": "s714057408", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k=map(int,input().split())\nA=[int(i) for i in input().split()]\nA.sort(key=lambda x:-abs(x))\nmod=10**9+7\n\n\nans=1\nflg=1\nflgcnt=0\nsave=1\n\nif k==1:\n print(max(A)%mod)\nelif max(A)<0:\n ans=1\n for i in range(k):\n ans=ans*A[n-1-i]%mod\n print(ans)\nelse:\n \n for i in range(k-2):\n now=A[i]\n if now <0:\n flg*=-1\n flgcnt+=1\n ans=ans*now%mod\n if i==k-3:\n save=ans\n \n pl=[]\n mi=[]\n for i in range(k-2,n):\n now=A[i]\n if now<0:\n if len(mi)<2:\n mi.append(now)\n else:\n if len(pl)<2:\n pl.append(now)\n if len(pl)==2 and len(mi)==2:\n break\n \n ck=pl+mi\n can=[]\n for i in range(len(ck)-1):\n for q in range(i+1,len(ck)):\n can.append(ck[i]*ck[q])\n can.sort()\n \n if flg>0:\n print(save*can[-1]%mod)\n else:\n print(save*can[0]%mod)\n \n \n \n", "code2": "n,k=map(int,input().split())\nA=[int(i) for i in input().split()]\nA.sort(key=lambda x:-abs(x))\nmod=10**9+7\n\nans=1\nif (max(A)<=0 and k%2==1) or n==k:\n for i in range(k):\n ans=ans*A[n-1-i]%mod\nelse:\n mi=0\n pl=0\n flg=1\n for i in range(k):\n ans=ans*A[i]%mod\n if A[i]>0:\n pl=A[i]\n if A[i]<0:\n mi=A[i]\n flg*=-1\n if ans==0:\n pass\n elif flg==-1:\n mi2=None\n pl2=None\n for i in range(k,n):\n if A[i]>=0:\n pl2=A[i]\n break\n for i in range(k,n):\n if A[i]<=0:\n mi2=A[i]\n break\n can=0\n if mi!=0 and pl2 is not None and pl!=0 and mi2 is not None:\n if pl2*pl > mi2*mi:\n can = pow(mi,-1,mod)*pl2%mod\n else:\n can = pow(pl,-1,mod)*mi2%mod\n elif mi!=0 and pl2 is not None:\n can = pow(mi,-1,mod)*pl2%mod\n elif pl!=0 and mi2 is not None:\n can = pow(pl,-1,mod)*mi2%mod \n ans=ans*can%mod\n\nprint(ans)\n \n \n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593981463", "date2": "1594457756", "bleu_score": "0.6556566575218353", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 101, "total_score": 104, "input": "4 2\n-1 -2 -2 -4\n", "actual_output": "2\n", "expected_output": "8\n\n", "anno_code": ["n,k=map(int,input().split()) # (0): n=4, k=2\nA=[int(i) for i in input().split()] # (1): A=[-1, -2, -2, -4]\nA.sort(key=lambda x:-abs(x)) # (2): A=[-4, -2, -2, -1]\nmod=10**9+7 # (3): mod=1000000007\n\n\nans=1 # (4): ans=1\nflg=1 # (5): flg=1\nflgcnt=0 # (6): flgcnt=0\nsave=1 # (7): save=1\n\nif k==1: # (8): NO CHANGE\n print(max(A)%mod)\nelif max(A)<0: # (9): NO CHANGE\n ans=1 # (10): NO CHANGE\n for i in range(k): # (11): i=0 (13): i=1 (15): NO CHANGE\n ans=ans*A[n-1-i]%mod # (12): ans=1000000006 (14): ans=2\n print(ans)\nelse:\n \n for i in range(k-2):\n now=A[i]\n if now <0:\n flg*=-1\n flgcnt+=1\n ans=ans*now%mod\n if i==k-3:\n save=ans\n \n pl=[]\n mi=[]\n for i in range(k-2,n):\n now=A[i]\n if now<0:\n if len(mi)<2:\n mi.append(now)\n else:\n if len(pl)<2:\n pl.append(now)\n if len(pl)==2 and len(mi)==2:\n break\n \n ck=pl+mi\n can=[]\n for i in range(len(ck)-1):\n for q in range(i+1,len(ck)):\n can.append(ck[i]*ck[q])\n can.sort()\n \n if flg>0:\n print(save*can[-1]%mod)\n else:\n print(save*can[0]%mod)\n \n \n \n"], "anno_status": [false], "diff_content": " n,k=map(int,input().split())\n A=[int(i) for i in input().split()]\n A.sort(key=lambda x:-abs(x))\n mod=10**9+7\n \n-\n ans=1\n-flg=1\n-flgcnt=0\n-save=1\n-\n-if k==1:\n- print(max(A)%mod)\n-elif max(A)<0:\n- ans=1\n+if (max(A)<=0 and k%2==1) or n==k:\n for i in range(k):\n ans=ans*A[n-1-i]%mod\n- print(ans)\n else:\n- \n- for i in range(k-2):\n- now=A[i]\n- if now <0:\n+ mi=0\n+ pl=0\n+ flg=1\n+ for i in range(k):\n+ ans=ans*A[i]%mod\n+ if A[i]>0:\n+ pl=A[i]\n+ if A[i]<0:\n+ mi=A[i]\n flg*=-1\n- flgcnt+=1\n- ans=ans*now%mod\n- if i==k-3:\n- save=ans\n- \n- pl=[]\n- mi=[]\n- for i in range(k-2,n):\n- now=A[i]\n- if now<0:\n- if len(mi)<2:\n- mi.append(now)\n- else:\n- if len(pl)<2:\n- pl.append(now)\n- if len(pl)==2 and len(mi)==2:\n- break\n- \n- ck=pl+mi\n- can=[]\n- for i in range(len(ck)-1):\n- for q in range(i+1,len(ck)):\n- can.append(ck[i]*ck[q])\n- can.sort()\n- \n- if flg>0:\n- print(save*can[-1]%mod)\n- else:\n- print(save*can[0]%mod)\n- \n- \n+ if ans==0:\n+ pass\n+ elif flg==-1:\n+ mi2=None\n+ pl2=None\n+ for i in range(k,n):\n+ if A[i]>=0:\n+ pl2=A[i]\n+ break\n+ for i in range(k,n):\n+ if A[i]<=0:\n+ mi2=A[i]\n+ break\n+ can=0\n+ if mi!=0 and pl2 is not None and pl!=0 and mi2 is not None:\n+ if pl2*pl > mi2*mi:\n+ can = pow(mi,-1,mod)*pl2%mod\n+ else:\n+ can = pow(pl,-1,mod)*mi2%mod\n+ elif mi!=0 and pl2 is not None:\n+ can = pow(mi,-1,mod)*pl2%mod\n+ elif pl!=0 and mi2 is not None:\n+ can = pow(pl,-1,mod)*mi2%mod \n+ ans=ans*can%mod\n+\n+print(ans)\n+ \n \n \n", "FL_content": " n,k=map(int,input().split())\n A=[int(i) for i in input().split()]\n A.sort(key=lambda x:-abs(x))\n mod=10**9+7\n \n-\n ans=1\n-flg=1\n-flgcnt=0\n-save=1\n-\n-if k==1:\n- print(max(A)%mod)\n-elif max(A)<0:\n- ans=1\n for i in range(k):\n ans=ans*A[n-1-i]%mod\n- print(ans)\n else:\n- \n- for i in range(k-2):\n- now=A[i]\n- if now <0:\n flg*=-1\n- flgcnt+=1\n- ans=ans*now%mod\n- if i==k-3:\n- save=ans\n- \n- pl=[]\n- mi=[]\n- for i in range(k-2,n):\n- now=A[i]\n- if now<0:\n- if len(mi)<2:\n- mi.append(now)\n- else:\n- if len(pl)<2:\n- pl.append(now)\n- if len(pl)==2 and len(mi)==2:\n- break\n- \n- ck=pl+mi\n- can=[]\n- for i in range(len(ck)-1):\n- for q in range(i+1,len(ck)):\n- can.append(ck[i]*ck[q])\n- can.sort()\n- \n- if flg>0:\n- print(save*can[-1]%mod)\n- else:\n- print(save*can[0]%mod)\n- \n- \n \n \n", "added_lines": 37, "removed_lines": 45, "code1_lines": 57 }, { "user_id": "u563676207", "problem_id": "p02697", "submission1_id": "s580408397", "submission2_id": "s164410515", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nN, M = map(int, input().split())\n\n\nans = []\nt = 1\nfor i in range(M):\n ans.append((t, N-t))\n t += 1\n\n\n[print(a, b) for a, b in ans]\n", "code2": "\nN, M = map(int, input().split())\n\n\nans = []\n\nt = 1\nfor _ in range(M\n ans.append((t, M-t+1))\n t += 1\n\nt = M+1\nfor _ in range(-(-M\n ans.append((t, M*3+2-t))\n t += 1\n\n\n[print(a, b) for a, b in ans]\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1588472924", "date2": "1588550636", "bleu_score": "0.6191725228284507", "code1_test_status": [0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 6, "input": "20 9\n", "actual_output": "1 19\n2 18\n3 17\n4 16\n5 15\n6 14\n7 13\n8 12\n9 11\n", "expected_output": "1 10\n2 9\n3 8\n4 7\n5 6\n11 19\n12 18\n13 17\n14 16\n\n", "anno_code": ["\nN, M = map(int, input().split()) # (0): N=20, M=9\n\n\nans = [] # (1): ans=[]\nt = 1 # (2): t=1\nfor i in range(M): # (3): i=0 (6): i=1 ... (30): NO CHANGE\n ans.append((t, N-t)) # (4): ans=[(1, 19)] (7): ans=[(1, 19), (2, 18)] ... (28): ans=[(1, 19), (2, 18), (3, 17), (4, 16), (5, 15), (6, 14), (7, 13), (8, 12), (9, 11)]\n t += 1 # (5): t=2 (8): t=3 ... (29): t=10\n\n\n[print(a, b) for a, b in ans]\n"], "anno_status": [true], "diff_content": " \n N, M = map(int, input().split())\n \n \n ans = []\n+\n t = 1\n-for i in range(M):\n- ans.append((t, N-t))\n+for _ in range(M\n+ ans.append((t, M-t+1))\n+ t += 1\n+\n+t = M+1\n+for _ in range(-(-M\n+ ans.append((t, M*3+2-t))\n t += 1\n \n \n [print(a, b) for a, b in ans]\n \n", "FL_content": " \n N, M = map(int, input().split())\n \n \n ans = []\n t = 1\n-for i in range(M):\n- ans.append((t, N-t))\n t += 1\n \n \n [print(a, b) for a, b in ans]\n \n", "added_lines": 8, "removed_lines": 2, "code1_lines": 13 }, { "user_id": "u802977614", "problem_id": "p02697", "submission1_id": "s998145176", "submission2_id": "s383026422", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict,deque\nimport sys, heapq, bisect, math, itertools, string, queue, copy, time\nsys.setrecursionlimit(10**8)\ninput = sys.stdin.readline\nINF = float('inf')\nmod = 10**9+7\neps = 10**-7\ndef inp():\n \n return int(input())\ndef inpl():\n \n return list(map(int, input().split()))\n\n\nn, m = inpl()\nj_list = [1]\ni=3\nwhile len(j_list) < m:\n if n%i!=0:\n j_list.append(i)\n i += 2\n\nfor i in range(m):\n print(\"{} {}\".format(i+1,i+j_list[-i-1]+1))\n", "code2": "from collections import defaultdict,deque\nimport sys, heapq, bisect, math, itertools, string, queue, copy, time\nsys.setrecursionlimit(10**8)\ninput = sys.stdin.readline\nINF = float('inf')\nmod = 10**9+7\neps = 10**-7\ndef inp():\n \n return int(input())\ndef inpl():\n \n return list(map(int, input().split()))\n\n\nn, m = inpl()\nn = 2 * m + 1\n\nfor i in range(m\n print(i + 1, m - i)\n\nbase=m+1\nfor i in range((n-m)\n print(base + i, n - i)\n\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1588472718", "date2": "1588475259", "bleu_score": "0.7779479091805099", "code1_test_status": [0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 6, "input": "12 5\n", "actual_output": "1 12\n2 11\n3 10\n4 9\n5 6\n", "expected_output": "1 6\n2 5\n3 4\n7 11\n8 10\n\n", "anno_code": ["from collections import defaultdict,deque\nimport sys, heapq, bisect, math, itertools, string, queue, copy, time\nsys.setrecursionlimit(10**8) # (0): NO CHANGE\ninput = sys.stdin.readline # (1): input=\nINF = float('inf') # (2): INF=inf\nmod = 10**9+7 # (3): mod=1000000007\neps = 10**-7 # (4): eps=1e-07\ndef inp(): # (5): inp=\n \n return int(input())\ndef inpl(): # (6): inpl=\n \n return list(map(int, input().split()))\n\n\nn, m = inpl() # (7): n=12, m=5\nj_list = [1] # (8): j_list=[1]\ni=3 # (9): i=3\nwhile len(j_list) < m: # (10): NO CHANGE (13): NO CHANGE ... (29): NO CHANGE\n if n%i!=0: # (11): NO CHANGE (14): NO CHANGE ... (26): NO CHANGE\n j_list.append(i) # (15): j_list=[1, 5] (19): j_list=[1, 5, 7] ... (27): j_list=[1, 5, 7, 9, 11]\n i += 2 # (12): i=5 (16): i=7 ... (28): i=13\n\nfor i in range(m): # (30): i=0 (32): i=1 ... (38): i=4\n print(\"{} {}\".format(i+1,i+j_list[-i-1]+1)) # (31): NO CHANGE (33): NO CHANGE ... (39): NO CHANGE\n"], "anno_status": [true], "diff_content": " from collections import defaultdict,deque\n import sys, heapq, bisect, math, itertools, string, queue, copy, time\n sys.setrecursionlimit(10**8)\n input = sys.stdin.readline\n INF = float('inf')\n mod = 10**9+7\n eps = 10**-7\n def inp():\n \n return int(input())\n def inpl():\n \n return list(map(int, input().split()))\n \n \n n, m = inpl()\n-j_list = [1]\n-i=3\n-while len(j_list) < m:\n- if n%i!=0:\n- j_list.append(i)\n- i += 2\n+n = 2 * m + 1\n+\n+for i in range(m\n+ print(i + 1, m - i)\n+\n+base=m+1\n+for i in range((n-m)\n+ print(base + i, n - i)\n \n-for i in range(m):\n- print(\"{} {}\".format(i+1,i+j_list[-i-1]+1))\n \n", "FL_content": " from collections import defaultdict,deque\n import sys, heapq, bisect, math, itertools, string, queue, copy, time\n sys.setrecursionlimit(10**8)\n input = sys.stdin.readline\n INF = float('inf')\n mod = 10**9+7\n eps = 10**-7\n def inp():\n \n return int(input())\n def inpl():\n \n return list(map(int, input().split()))\n \n \n n, m = inpl()\n-j_list = [1]\n-i=3\n-while len(j_list) < m:\n- if n%i!=0:\n- j_list.append(i)\n- i += 2\n \n-for i in range(m):\n- print(\"{} {}\".format(i+1,i+j_list[-i-1]+1))\n \n", "added_lines": 8, "removed_lines": 8, "code1_lines": 26 }, { "user_id": "u325227960", "problem_id": "p02697", "submission1_id": "s723856144", "submission2_id": "s680975528", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m = map(int,input().split())\nANS = [[0] * 2 for i in range(m)]\n\na = 0\nb = 1\nfor i in range(m):\n if i*4 == n:\n b = (b+1) % n\n ANS[i] = [a, b]\n a = (a-1) % n\n b = (b+1) % n\n \n\nfor i in range(m):\n print(ANS[i][0]+1, ANS[i][1]+1)", "code2": "n,m = map(int,input().split())\nANS = [[0] * 2 for i in range(m)]\n\na = 0\nb = 1\nc = 0\nf = 1\nfor i in range(m):\n if n%2 == 0 and (c+2) > n\n b = (b+1) % n\n f = 0\n ANS[i] = [a, b]\n c += 2\n a = (a-1) % n\n b = (b+1) % n\n \n\nfor i in range(m):\n print(ANS[i][0]+1, ANS[i][1]+1)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1588470364", "date2": "1588470635", "bleu_score": "0.8085585443030627", "code1_test_status": [0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 6, "input": "19 9\n", "actual_output": "1 2\n19 3\n18 4\n17 5\n16 6\n15 7\n14 8\n13 9\n12 10\n", "expected_output": "1 10\n2 9\n3 8\n4 7\n5 6\n11 19\n12 18\n13 17\n14 16\n\n", "anno_code": ["n,m = map(int,input().split()) # (0): n=19, m=9\nANS = [[0] * 2 for i in range(m)] # (1): ANS\n\na = 0 # (2): a=0\nb = 1 # (3): b=1\nfor i in range(m): # (4): i=0 (9): i=1 ... (49): NO CHANGE\n if i*4 == n: # (5): NO CHANGE (10): NO CHANGE ... (45): NO CHANGE\n b = (b+1) % n\n ANS[i] = [a, b] # (6): ANS (11): ANS ... (46): ANS\n a = (a-1) % n # (7): a=18 (12): a=17 ... (47): a=10\n b = (b+1) % n # (8): b=2 (13): b=3 ... (48): b=10\n \n\nfor i in range(m): # (50): i=0 (52): i=1 ... (66): i=8\n print(ANS[i][0]+1, ANS[i][1]+1) # (51): NO CHANGE (53): NO CHANGE ... (67): NO CHANGE\n"], "anno_status": [true], "diff_content": " n,m = map(int,input().split())\n ANS = [[0] * 2 for i in range(m)]\n \n a = 0\n b = 1\n+c = 0\n+f = 1\n for i in range(m):\n- if i*4 == n:\n+ if n%2 == 0 and (c+2) > n\n b = (b+1) % n\n+ f = 0\n ANS[i] = [a, b]\n+ c += 2\n a = (a-1) % n\n b = (b+1) % n\n \n \n for i in range(m):\n print(ANS[i][0]+1, ANS[i][1]+1)\n", "FL_content": " n,m = map(int,input().split())\n ANS = [[0] * 2 for i in range(m)]\n \n a = 0\n b = 1\n for i in range(m):\n- if i*4 == n:\n b = (b+1) % n\n ANS[i] = [a, b]\n a = (a-1) % n\n b = (b+1) % n\n \n \n for i in range(m):\n print(ANS[i][0]+1, ANS[i][1]+1)\n", "added_lines": 5, "removed_lines": 1, "code1_lines": 15 }, { "user_id": "u257162238", "problem_id": "p02697", "submission1_id": "s932359124", "submission2_id": "s086220036", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\nfrom itertools import product\nimport sys\nimport math\n\nsys.setrecursionlimit(200000)\ninput = sys.stdin.readline\n\n\ndef read():\n N, M = map(int, input().strip().split())\n return N, M\n\n\ndef solve(N, M):\n pairs = []\n n = N \n for m in range(M):\n pairs.append((m+1, n-m))\n \n for a, b in pairs:\n print(a, b)\n\nif __name__ == '__main__':\n inputs = read()\n solve(*inputs)\n", "code2": "from collections import deque\nfrom itertools import product\nimport sys\nimport math\n\nsys.setrecursionlimit(200000)\ninput = sys.stdin.readline\n\n\ndef read():\n N, M = map(int, input().strip().split())\n return N, M\n\n\ndef solve(N, M):\n H = (N-1) \n LL = 0\n LR = (H \n RL = N - (H - H\n RR = N\n pairs = []\n while LR - LL > 1:\n pairs.append((LL+1, LR))\n LL += 1\n LR -= 1\n while RR - RL > 1:\n pairs.append((RL+1, RR))\n RL += 1\n RR -= 1\n for i in range(M):\n print(*pairs[i])\n\n\nif __name__ == '__main__':\n inputs = read()\n solve(*inputs)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1588473517", "date2": "1597290417", "bleu_score": "0.6555727707942819", "code1_test_status": [0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 6, "input": "20 9\n", "actual_output": "1 20\n2 19\n3 18\n4 17\n5 16\n6 15\n7 14\n8 13\n9 12\n", "expected_output": "1 10\n2 9\n3 8\n4 7\n5 6\n11 19\n12 18\n13 17\n14 16\n\n", "anno_code": ["from collections import deque\nfrom itertools import product\nimport sys\nimport math\n\nsys.setrecursionlimit(200000) # (0): NO CHANGE\ninput = sys.stdin.readline # (1): input=\n\n\ndef read(): # (2): read=\n N, M = map(int, input().strip().split())\n return N, M\n\n\ndef solve(N, M): # (3): solve=\n pairs = []\n n = N \n for m in range(M):\n pairs.append((m+1, n-m))\n \n for a, b in pairs:\n print(a, b)\n\nif __name__ == '__main__':\n inputs = read()\n solve(*inputs)\n"], "anno_status": [true], "diff_content": " from collections import deque\n from itertools import product\n import sys\n import math\n \n sys.setrecursionlimit(200000)\n input = sys.stdin.readline\n \n \n def read():\n N, M = map(int, input().strip().split())\n return N, M\n \n \n def solve(N, M):\n+ H = (N-1) \n+ LL = 0\n+ LR = (H \n+ RL = N - (H - H\n+ RR = N\n pairs = []\n- n = N \n- for m in range(M):\n- pairs.append((m+1, n-m))\n- \n- for a, b in pairs:\n- print(a, b)\n+ while LR - LL > 1:\n+ pairs.append((LL+1, LR))\n+ LL += 1\n+ LR -= 1\n+ while RR - RL > 1:\n+ pairs.append((RL+1, RR))\n+ RL += 1\n+ RR -= 1\n+ for i in range(M):\n+ print(*pairs[i])\n+\n \n if __name__ == '__main__':\n inputs = read()\n solve(*inputs)\n \n", "FL_content": " from collections import deque\n from itertools import product\n import sys\n import math\n \n sys.setrecursionlimit(200000)\n input = sys.stdin.readline\n \n \n def read():\n N, M = map(int, input().strip().split())\n return N, M\n \n \n def solve(N, M):\n pairs = []\n- n = N \n- for m in range(M):\n- pairs.append((m+1, n-m))\n- \n- for a, b in pairs:\n- print(a, b)\n \n if __name__ == '__main__':\n inputs = read()\n solve(*inputs)\n \n", "added_lines": 16, "removed_lines": 6, "code1_lines": 27 }, { "user_id": "u163783894", "problem_id": "p02697", "submission1_id": "s436075833", "submission2_id": "s441736394", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\n\nfor m in range(1, M + 1):\n if N % 2 is 1:\n print(m, N - m + 1)\n else:\n start = m\n end = N / 2 - m\n if start >= end:\n start = N / 2 + 1\n end = N - m + 1\n print(start, end)\n", "code2": "N, M = map(int, input().split())\n\nif N % 2 == 1:\n for m in range(1, M + 1):\n print(m, N - m + 1)\n\ncount = 1\nif N % 2 == 0:\n for m in range(1, M + 1):\n\n if m <= (N \n start = m\n end = N \n print(start, end)\n else:\n start = N \n end = N - count + 1\n print(start, end)\n count += 1\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1589688203", "date2": "1589689010", "bleu_score": "0.636206903619659", "code1_test_status": [0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 6, "input": "12 5\n", "actual_output": "1 5.0\n2 4.0\n7.0 10\n7.0 9\n7.0 8\n", "expected_output": "1 6\n2 5\n3 4\n7 11\n8 10\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=12, M=5\n\nfor m in range(1, M + 1): # (1): m=1 (7): m=2 ... (29): m=5\n if N % 2 is 1: # (2): NO CHANGE (8): NO CHANGE ... (30): NO CHANGE\n print(m, N - m + 1)\n else:\n start = m # (3): start=1 (9): start=2 ... (31): start=5\n end = N / 2 - m # (4): end=5.0 (10): end=4.0 ... (32): end=1.0\n if start >= end: # (5): NO CHANGE (11): NO CHANGE ... (33): NO CHANGE\n start = N / 2 + 1 # (18): start=7.0 (26): start=7.0 (34): start=7.0\n end = N - m + 1 # (19): end=10 (27): end=9 (35): end=8\n print(start, end) # (6): NO CHANGE (12): NO CHANGE ... (36): NO CHANGE\n"], "anno_status": [true], "diff_content": " N, M = map(int, input().split())\n \n-for m in range(1, M + 1):\n- if N % 2 is 1:\n+if N % 2 == 1:\n+ for m in range(1, M + 1):\n print(m, N - m + 1)\n- else:\n- start = m\n- end = N / 2 - m\n- if start >= end:\n- start = N / 2 + 1\n- end = N - m + 1\n- print(start, end)\n+\n+count = 1\n+if N % 2 == 0:\n+ for m in range(1, M + 1):\n+\n+ if m <= (N \n+ start = m\n+ end = N \n+ print(start, end)\n+ else:\n+ start = N \n+ end = N - count + 1\n+ print(start, end)\n+ count += 1\n \n", "FL_content": " N, M = map(int, input().split())\n \n-for m in range(1, M + 1):\n- if N % 2 is 1:\n print(m, N - m + 1)\n- else:\n- start = m\n- end = N / 2 - m\n- if start >= end:\n- start = N / 2 + 1\n- end = N - m + 1\n- print(start, end)\n \n", "added_lines": 16, "removed_lines": 9, "code1_lines": 13 }, { "user_id": "u060938295", "problem_id": "p02697", "submission1_id": "s551674043", "submission2_id": "s266067472", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nimport sys\n\n\nsys.setrecursionlimit(10 ** 9)\n\n\nmod = 10**9+7\n\n\nN, M = map(int,input().split())\n\n\n\n\n\n\n\nodd = (N % 2 != 0)\nans = []\nif odd:\n x = N - 1\nelse:\n x = N\n\nfor i in range(M):\n ans.append([i+1,x])\n x -= 1\n\nfor a in ans:\n print(' '.join(map(str,a)))\n ", "code2": "\n\n\nimport sys\n\n\nsys.setrecursionlimit(10 ** 9)\n\n\nmod = 10**9+7\n\n\nN, M = map(int,input().split())\n\n\n\n\n\n\n\nodd = (N % 2 != 0)\nans = []\nif odd:\n x = N - 1\n for i in range(M):\n ans.append([i+1,x])\n x -= 1\nelse:\n x = N\n flg = True\n for i in range(M):\n if flg and x - (i+1) <= N\n x -= 1\n flg = False\n ans.append([i+1,x])\n x -= 1\n\n\n\n\n\nfor a in ans:\n print(' '.join(map(str,a)))\n ", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1588470724", "date2": "1588472199", "bleu_score": "0.6083440268991649", "code1_test_status": [0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 6, "input": "24 11\n", "actual_output": "1 24\n2 23\n3 22\n4 21\n5 20\n6 19\n7 18\n8 17\n9 16\n10 15\n11 14\n", "expected_output": "1 12\n2 11\n3 10\n4 9\n5 8\n6 7\n13 23\n14 22\n15 21\n16 20\n17 19\n\n", "anno_code": ["\n\n\nimport sys\n\n\nsys.setrecursionlimit(10 ** 9) # (0): NO CHANGE\n\n\nmod = 10**9+7 # (1): mod=1000000007\n\n\nN, M = map(int,input().split()) # (2): N=24, M=11\n\n\n\n\n\n\n\nodd = (N % 2 != 0) # (3): odd=False\nans = [] # (4): ans=[]\nif odd: # (5): NO CHANGE\n x = N - 1\nelse:\n x = N # (6): x=24\n\nfor i in range(M): # (7): i=0 (10): i=1 ... (40): NO CHANGE\n ans.append([i+1,x]) # (8): ans (11): ans ... (38): ans\n x -= 1 # (9): x=23 (12): x=22 ... (39): x=13\n\nfor a in ans: # (41): a=[1, 24] (43): a=[2, 23] ... (61): a=[11, 14]\n print(' '.join(map(str,a))) # (42): NO CHANGE (44): NO CHANGE ... (62): NO CHANGE\n "], "anno_status": [true], "diff_content": " \n \n \n import sys\n \n \n sys.setrecursionlimit(10 ** 9)\n \n \n mod = 10**9+7\n \n \n N, M = map(int,input().split())\n \n \n \n \n \n \n \n odd = (N % 2 != 0)\n ans = []\n if odd:\n x = N - 1\n+ for i in range(M):\n+ ans.append([i+1,x])\n+ x -= 1\n else:\n x = N\n+ flg = True\n+ for i in range(M):\n+ if flg and x - (i+1) <= N\n+ x -= 1\n+ flg = False\n+ ans.append([i+1,x])\n+ x -= 1\n+\n+\n+\n \n-for i in range(M):\n- ans.append([i+1,x])\n- x -= 1\n \n for a in ans:\n print(' '.join(map(str,a)))\n \n", "FL_content": " \n \n \n import sys\n \n \n sys.setrecursionlimit(10 ** 9)\n \n \n mod = 10**9+7\n \n \n N, M = map(int,input().split())\n \n \n \n \n \n \n \n odd = (N % 2 != 0)\n ans = []\n if odd:\n x = N - 1\n else:\n x = N\n \n-for i in range(M):\n- ans.append([i+1,x])\n- x -= 1\n \n for a in ans:\n print(' '.join(map(str,a)))\n \n", "added_lines": 13, "removed_lines": 3, "code1_lines": 34 }, { "user_id": "u366886346", "problem_id": "p02697", "submission1_id": "s618838705", "submission2_id": "s899690125", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m=map(int,input().split())\ng=m\nk=m-g\nfor i in range(m):\n if i%2==1:\n print(n-g-i-1,n-g+i+1)\n else:\n print(k-i,k+i+1)\n", "code2": "n,m=map(int,input().split())\ng=m\nk=m-g\nfor i in range(m):\n if i%2==1:\n a=n-g-((i+1)\n b=a+i+1\n print(a,b)\n else:\n a=k-(i\n b=a+i+1\n print(a,b)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1588525435", "date2": "1588527430", "bleu_score": "0.6479999952850702", "code1_test_status": [0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 6, "input": "15 7\n", "actual_output": "0 1\n6 10\n-2 3\n4 12\n-4 5\n2 14\n-6 7\n", "expected_output": "1 8\n2 7\n3 6\n4 5\n9 15\n10 14\n11 13\n\n", "anno_code": ["n,m=map(int,input().split()) # (0): n=15, m=7\ng=m # (1): g=7\nk=m-g # (2): k=0\nfor i in range(m): # (3): i=0 (6): i=1 ... (21): i=6\n if i%2==1: # (4): NO CHANGE (7): NO CHANGE ... (22): NO CHANGE\n print(n-g-i-1,n-g+i+1) # (8): NO CHANGE (14): NO CHANGE (20): NO CHANGE\n else:\n print(k-i,k+i+1) # (5): NO CHANGE (11): NO CHANGE ... (23): NO CHANGE\n"], "anno_status": [true], "diff_content": " n,m=map(int,input().split())\n g=m\n k=m-g\n for i in range(m):\n if i%2==1:\n- print(n-g-i-1,n-g+i+1)\n+ a=n-g-((i+1)\n+ b=a+i+1\n+ print(a,b)\n else:\n- print(k-i,k+i+1)\n+ a=k-(i\n+ b=a+i+1\n+ print(a,b)\n \n", "FL_content": " n,m=map(int,input().split())\n g=m\n k=m-g\n for i in range(m):\n if i%2==1:\n- print(n-g-i-1,n-g+i+1)\n else:\n- print(k-i,k+i+1)\n \n", "added_lines": 6, "removed_lines": 2, "code1_lines": 9 }, { "user_id": "u047816928", "problem_id": "p02697", "submission1_id": "s416594463", "submission2_id": "s203014953", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\nl = N\nr = 1\nd = 1\nfor i in range(M):\n print(l, r)\n l-=1\n r+=1\n if min(l-r, N-l+r)==d: \n r+=1\n d = min(l-r, N-l+r)\n", "code2": "N, M = map(int, input().split())\nl = N\nr = 1\nfor i in range(M):\n if N%4==0 and i*4==N: r+=1\n if N%2==0 and l-r==N\n print(l, r)\n l-=1\n r+=1", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1588473484", "date2": "1588475266", "bleu_score": "0.6982926221849795", "code1_test_status": [0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 6, "input": "20 9\n", "actual_output": "20 1\n19 2\n18 3\n17 4\n16 5\n15 7\n14 8\n13 9\n12 10\n", "expected_output": "1 10\n2 9\n3 8\n4 7\n5 6\n11 19\n12 18\n13 17\n14 16\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=20, M=9\nl = N # (1): l=20\nr = 1 # (2): r=1\nd = 1 # (3): d=1\nfor i in range(M): # (4): i=0 (10): i=1 ... (53): i=8\n print(l, r) # (5): NO CHANGE (11): NO CHANGE ... (54): NO CHANGE\n l-=1 # (6): l=19 (12): l=18 ... (55): l=11\n r+=1 # (7): r=2 (13): r=3 ... (56): r=11\n if min(l-r, N-l+r)==d: # (8): NO CHANGE (14): NO CHANGE ... (57): NO CHANGE\n r+=1 # (33): r=7\n d = min(l-r, N-l+r) # (9): d=3 (15): d=5 ... (58): d=0\n"], "anno_status": [true], "diff_content": " N, M = map(int, input().split())\n l = N\n r = 1\n-d = 1\n for i in range(M):\n+ if N%4==0 and i*4==N: r+=1\n+ if N%2==0 and l-r==N\n print(l, r)\n l-=1\n r+=1\n- if min(l-r, N-l+r)==d: \n- r+=1\n- d = min(l-r, N-l+r)\n-\n", "FL_content": " N, M = map(int, input().split())\n l = N\n r = 1\n-d = 1\n for i in range(M):\n print(l, r)\n l-=1\n r+=1\n- if min(l-r, N-l+r)==d: \n- r+=1\n- d = min(l-r, N-l+r)\n-\n", "added_lines": 2, "removed_lines": 5, "code1_lines": 12 }, { "user_id": "u844789719", "problem_id": "p02697", "submission1_id": "s454359895", "submission2_id": "s009610821", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = [int(_) for _ in input().split()]\nse = set()\nans = []\nd = 1\nfor i in range(1, N + 1):\n if i in se:\n continue\n j = (i + d) % N\n ans += [i, j]\n se.add(i)\n se.add(j)\n d += 1\nans = ans[:2 * M]\nprint('\\n'.join(f'{i} {j}' for i, j in zip(ans[::2], ans[1::2])))\n", "code2": "N, M = [int(_) for _ in input().split()]\nl = 1\nr = N\nans = []\nfor _ in range(M - M \n ans += [l, r]\n l += 1\n r -= 1\nif (r - l) % 2 == (l + N - r) % 2:\n r -= 1\nfor _ in range(M \n ans += [l, r]\n l += 1\n r -= 1\nans = ans[:2 * M]\nprint('\\n'.join(f'{a} {b}' for a, b in zip(ans[::2], ans[1::2])))\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596075023", "date2": "1596076726", "bleu_score": "0.6267952408909887", "code1_test_status": [0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 6, "input": "15 7\n", "actual_output": "1 2\n3 5\n4 7\n6 10\n8 13\n9 0\n11 3\n", "expected_output": "1 8\n2 7\n3 6\n4 5\n9 15\n10 14\n11 13\n\n", "anno_code": ["N, M = [int(_) for _ in input().split()] # (0): N=15, M=7\nse = set() # (1): se=set()\nans = [] # (2): ans=[]\nd = 1 # (3): d=1\nfor i in range(1, N + 1): # (4): i=1 (11): i=2 ... (89): NO CHANGE\n if i in se: # (5): NO CHANGE (12): NO CHANGE ... (83): NO CHANGE\n continue # (13): NO CHANGE (30): NO CHANGE ... (74): NO CHANGE\n j = (i + d) % N # (6): j=2 (16): j=5 ... (84): j=10\n ans += [i, j] # (7): ans=[1, 2] (17): ans=[1, 2, 3, 5] ... (85): ans=[1, 2, 3, 5, 4, 7, 6, 10, 8, 13, 9, 0, 11, 3, 12, 5, 14, 8, 15, 10]\n se.add(i) # (8): se={1} (18): se={1, 2, 3} ... (86): se={0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}\n se.add(j) # (9): se={1, 2} (19): se={1, 2, 3, 5} ... (87): NO CHANGE\n d += 1 # (10): d=2 (20): d=3 ... (88): d=11\nans = ans[:2 * M] # (90): ans=[1, 2, 3, 5, 4, 7, 6, 10, 8, 13, 9, 0, 11, 3]\nprint('\\n'.join(f'{i} {j}' for i, j in zip(ans[::2], ans[1::2])))\n"], "anno_status": [true], "diff_content": " N, M = [int(_) for _ in input().split()]\n-se = set()\n+l = 1\n+r = N\n ans = []\n-d = 1\n-for i in range(1, N + 1):\n- if i in se:\n- continue\n- j = (i + d) % N\n- ans += [i, j]\n- se.add(i)\n- se.add(j)\n- d += 1\n+for _ in range(M - M \n+ ans += [l, r]\n+ l += 1\n+ r -= 1\n+if (r - l) % 2 == (l + N - r) % 2:\n+ r -= 1\n+for _ in range(M \n+ ans += [l, r]\n+ l += 1\n+ r -= 1\n ans = ans[:2 * M]\n-print('\\n'.join(f'{i} {j}' for i, j in zip(ans[::2], ans[1::2])))\n+print('\\n'.join(f'{a} {b}' for a, b in zip(ans[::2], ans[1::2])))\n \n", "FL_content": " N, M = [int(_) for _ in input().split()]\n-se = set()\n ans = []\n-d = 1\n-for i in range(1, N + 1):\n- if i in se:\n- continue\n- j = (i + d) % N\n- ans += [i, j]\n- se.add(i)\n- se.add(j)\n- d += 1\n ans = ans[:2 * M]\n-print('\\n'.join(f'{i} {j}' for i, j in zip(ans[::2], ans[1::2])))\n \n", "added_lines": 13, "removed_lines": 11, "code1_lines": 15 }, { "user_id": "u873190923", "problem_id": "p02697", "submission1_id": "s336896653", "submission2_id": "s756388796", "status1": "Wrong Answer", "status2": "Accepted", "code1": "inf = 10**15\nmod = 10**9+7\nn,m = map(int, input().split())\nif n % 2 == 0:\n tmp = n\n for i in range(m):\n print('{} {}'.format(tmp-i, tmp+1+i))\nelse:\n tmp = n\n for i in range(m):\n print('{} {}'.format(tmp-i, tmp+1+i))", "code2": "inf = 10**15\nmod = 10**9+7\nn,m = map(int, input().split())\ntmp = n\nfor i in range(m):\n if i % 2 == 0:\n print('{} {}'.format(tmp-i\n else:\n print('{} {}'.format(1+i", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1588472710", "date2": "1588473536", "bleu_score": "0.6809908908982464", "code1_test_status": [0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 6, "input": "24 11\n", "actual_output": "24 25\n23 26\n22 27\n21 28\n20 29\n19 30\n18 31\n17 32\n16 33\n15 34\n14 35\n", "expected_output": "1 12\n2 11\n3 10\n4 9\n5 8\n6 7\n13 23\n14 22\n15 21\n16 20\n17 19\n\n", "anno_code": ["inf = 10**15 # (0): inf=1000000000000000\nmod = 10**9+7 # (1): mod=1000000007\nn,m = map(int, input().split()) # (2): n=24, m=11\nif n % 2 == 0: # (3): NO CHANGE\n tmp = n # (4): tmp=24\n for i in range(m): # (5): i=0 (7): i=1 ... (25): i=10\n print('{} {}'.format(tmp-i, tmp+1+i)) # (6): NO CHANGE (8): NO CHANGE ... (26): NO CHANGE\nelse:\n tmp = n\n for i in range(m):\n print('{} {}'.format(tmp-i, tmp+1+i))"], "anno_status": [true], "diff_content": " inf = 10**15\n mod = 10**9+7\n n,m = map(int, input().split())\n-if n % 2 == 0:\n- tmp = n\n- for i in range(m):\n- print('{} {}'.format(tmp-i, tmp+1+i))\n-else:\n- tmp = n\n- for i in range(m):\n- print('{} {}'.format(tmp-i, tmp+1+i))\n+tmp = n\n+for i in range(m):\n+ if i % 2 == 0:\n+ print('{} {}'.format(tmp-i\n+ else:\n+ print('{} {}'.format(1+i\n", "FL_content": " inf = 10**15\n mod = 10**9+7\n n,m = map(int, input().split())\n-if n % 2 == 0:\n- tmp = n\n- for i in range(m):\n- print('{} {}'.format(tmp-i, tmp+1+i))\n-else:\n- tmp = n\n- for i in range(m):\n- print('{} {}'.format(tmp-i, tmp+1+i))\n", "added_lines": 6, "removed_lines": 8, "code1_lines": 11 }, { "user_id": "u842689614", "problem_id": "p04014", "submission1_id": "s461733151", "submission2_id": "s079261653", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\ns=int(input())\n\nb_ans=1\n\nif n==s:\n b_ans=n+1\nif b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\n\nif b_ans==1:\n for p in range(1,int(n**0.5)):\n b=int(n/p)\n q=n-p*b\n if s==p+q and q0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\nif b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n\n if b.is_integer() and 0<=s-pn**0.5:\n b_ans=int(b)\n break\n\nif b_ans!=1:\n print(b_ans)\nelse:\n print(-1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566167907", "date2": "1566170554", "bleu_score": "0.8699322293300966", "code1_test_status": [1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 48, "total_score": 105, "input": "87654\n4\n", "actual_output": "-1\n", "expected_output": "43826\n\n", "anno_code": ["n=int(input()) # (0): n=87654\ns=int(input()) # (1): s=4\n\nb_ans=1 # (2): b_ans=1\n\nif n==s: # (3): NO CHANGE\n b_ans=n+1\nif b_ans==1: # (4): NO CHANGE\n for b in range(2,int(n**0.5)+1): # (5): b=2 (61): b=3 ... (4402): NO CHANGE\n nn=n # (6): nn=87654 (62): nn=87654 ... (4389): nn=87654\n st=[] # (7): st=[] (63): st=[] ... (4390): st=[]\n while(nn>0): # (8): NO CHANGE (11): NO CHANGE ... (4400): NO CHANGE\n st.append(nn%b) # (9): st=[0] (12): st=[0, 1.0] ... (4398): st=[38, 0.0, 1.0]\n nn=(nn-st[-1])/b # (10): nn=43827.0 (13): nn=21913.0 ... (4399): nn=0.0\n \n if sum(st)==s: # (60): NO CHANGE (98): NO CHANGE ... (4401): NO CHANGE\n b_ans=b\n break\n\n\nif b_ans==1: # (4403): NO CHANGE\n for p in range(1,int(n**0.5)): # (4404): p=1 (4408): p=2 ... (5584): NO CHANGE\n b=int(n/p) # (4405): b=87654 (4409): b=43827 ... (5581): b=297\n q=n-p*b # (4406): q=0 (4410): NO CHANGE ... (5582): q=39\n if s==p+q and q0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n-\n if b_ans==1:\n- for p in range(1,int(n**0.5)):\n- b=int(n/p)\n- q=n-p*b\n- if s==p+q and qn**0.5:\n+ b_ans=int(b)\n break\n \n if b_ans!=1:\n print(b_ans)\n else:\n print(-1)\n", "FL_content": " n=int(input())\n s=int(input())\n \n b_ans=1\n \n if n==s:\n b_ans=n+1\n if b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n-\n if b_ans==1:\n- for p in range(1,int(n**0.5)):\n- b=int(n/p)\n- q=n-p*b\n- if s==p+q and q0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\n\nif b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n\n if b.is_integer():\n b_ans=int(b)\n break\n\nif b_ans!=1:\n print(b_ans)\nelse:\n print(-1)", "code2": "n=int(input())\ns=int(input())\n\nb_ans=1\n\n\n\nif n==s:\n b_ans=n+1\nif b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\nif b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n\n if b.is_integer() and 0<=s-pn**0.5:\n b_ans=int(b)\n break\n\nif b_ans!=1:\n print(b_ans)\nelse:\n print(-1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566169737", "date2": "1566170554", "bleu_score": "0.9356733828404437", "code1_test_status": [1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 71, "total_score": 105, "input": "31415926535\n3\n", "actual_output": "7853981634\n", "expected_output": "15707963267\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n=int(input())\n s=int(input())\n \n b_ans=1\n \n \n \n if n==s:\n b_ans=n+1\n if b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n-\n if b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n \n- if b.is_integer():\n+ if b.is_integer() and 0<=s-pn**0.5:\n b_ans=int(b)\n break\n \n if b_ans!=1:\n print(b_ans)\n else:\n print(-1)\n", "FL_content": " n=int(input())\n s=int(input())\n \n b_ans=1\n \n \n \n if n==s:\n b_ans=n+1\n if b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n-\n if b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n \n- if b.is_integer():\n b_ans=int(b)\n break\n \n if b_ans!=1:\n print(b_ans)\n else:\n print(-1)\n", "added_lines": 1, "removed_lines": 2, "code1_lines": 34 }, { "user_id": "u279493135", "problem_id": "p04014", "submission1_id": "s995385208", "submission2_id": "s138406168", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\nimport sys\nsys.setrecursionlimit(10000)\ninput = stdin.readline\n\nn = int(input().rstrip())\ns = int(input().rstrip())\n\ndef f(b, n):\n\tif n < b:\n\t\treturn n\n\telse:\n\t\treturn f(b, int(n/b)) + (n % b)\nif s == n:\n\tprint(n+1)\nelse:\n\tfor i in range(2, int(n**(1/2))+1):\n\t\tif f(i, n) == s:\n\t\t\tprint(i)\n\t\t\tbreak\n\telse:\n\t\tfor p in range(1, int(n**(1/2))+1):\n\t\t\tif (n-s) % p == 0:\n\t\t\t\tb = (n-s)/p + 1\n\t\t\t\tif b >= 2 and f(b, n) == s:\n\t\t\t\t\tprint(int(b))\n\t\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tcontinue\n\t\telse:\n\t\t\tprint(-1)", "code2": "from sys import stdin\nimport sys\nsys.setrecursionlimit(10000)\ninput = stdin.readline\n\nn = int(input().rstrip())\ns = int(input().rstrip())\n\ndef f(b, n):\n\tif n < b:\n\t\treturn n\n\telse:\n\t\treturn f(b, int(n/b)) + (n % b)\nif s == n:\n\tprint(n+1)\nelse:\n\tfor i in range(2, int(n**(1/2))+1):\n\t\tif f(i, n) == s:\n\t\t\tprint(i)\n\t\t\tbreak\n\telse:\n\t\tfor p in range(int(n**(1/2)), 0, -1):\n\t\t\tif (n-s) % p == 0:\n\t\t\t\tb = (n-s)/p + 1\n\t\t\t\tif b >= 2 and f(b, n) == s:\n\t\t\t\t\tprint(int(b))\n\t\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tcontinue\n\t\telse:\n\t\t\tprint(-1)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554423699", "date2": "1554424153", "bleu_score": "0.9819555303097414", "code1_test_status": [1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 54, "total_score": 105, "input": "87654\n438\n", "actual_output": "87217\n", "expected_output": "317\n\n", "anno_code": ["from sys import stdin\nimport sys\nsys.setrecursionlimit(10000) # (0): NO CHANGE\ninput = stdin.readline # (1): input=\n\nn = int(input().rstrip()) # (2): n=87654\ns = int(input().rstrip()) # (3): s=438\n\ndef f(b, n): # (4): f=\n\tif n < b: # (8): n=43827 (9): n=21913 ... (1576): stdin=<_io.TextIOWrapper name='../../test/autoComment2\\\\Dev\\\\p04014\\\\input_s995385208.txt' mode='r' encoding='utf-8'>, sys=, input=, n=87654, s=438, f=, i=296, p=1\n\t\treturn n\n\telse:\n\t\treturn f(b, int(n/b)) + (n % b)\nif s == n: # (5): NO CHANGE\n\tprint(n+1)\nelse:\n\tfor i in range(2, int(n**(1/2))+1): # (6): i=2 (25): i=3 ... (1570): NO CHANGE\n\t\tif f(i, n) == s: # (7): b=2 (26): b=3 ... (1566): b=296\n\t\t\tprint(i)\n\t\t\tbreak\n\telse:\n\t\tfor p in range(1, int(n**(1/2))+1): # (1571): p=1\n\t\t\tif (n-s) % p == 0: # (1572): NO CHANGE\n\t\t\t\tb = (n-s)/p + 1 # (1573): b=87217.0\n\t\t\t\tif b >= 2 and f(b, n) == s: # (1574): NO CHANGE\n\t\t\t\t\tprint(int(b)) # (1577): NO CHANGE\n\t\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tcontinue\n\t\telse:\n\t\t\tprint(-1)"], "anno_status": [true], "diff_content": " from sys import stdin\n import sys\n sys.setrecursionlimit(10000)\n input = stdin.readline\n \n n = int(input().rstrip())\n s = int(input().rstrip())\n \n def f(b, n):\n \tif n < b:\n \t\treturn n\n \telse:\n \t\treturn f(b, int(n/b)) + (n % b)\n if s == n:\n \tprint(n+1)\n else:\n \tfor i in range(2, int(n**(1/2))+1):\n \t\tif f(i, n) == s:\n \t\t\tprint(i)\n \t\t\tbreak\n \telse:\n-\t\tfor p in range(1, int(n**(1/2))+1):\n+\t\tfor p in range(int(n**(1/2)), 0, -1):\n \t\t\tif (n-s) % p == 0:\n \t\t\t\tb = (n-s)/p + 1\n \t\t\t\tif b >= 2 and f(b, n) == s:\n \t\t\t\t\tprint(int(b))\n \t\t\t\t\tbreak\n \t\t\telse:\n \t\t\t\tcontinue\n \t\telse:\n \t\t\tprint(-1)\n+\n", "FL_content": " from sys import stdin\n import sys\n sys.setrecursionlimit(10000)\n input = stdin.readline\n \n n = int(input().rstrip())\n s = int(input().rstrip())\n \n def f(b, n):\n \tif n < b:\n \t\treturn n\n \telse:\n \t\treturn f(b, int(n/b)) + (n % b)\n if s == n:\n \tprint(n+1)\n else:\n \tfor i in range(2, int(n**(1/2))+1):\n \t\tif f(i, n) == s:\n \t\t\tprint(i)\n \t\t\tbreak\n \telse:\n-\t\tfor p in range(1, int(n**(1/2))+1):\n \t\t\tif (n-s) % p == 0:\n \t\t\t\tb = (n-s)/p + 1\n \t\t\t\tif b >= 2 and f(b, n) == s:\n \t\t\t\t\tprint(int(b))\n \t\t\t\t\tbreak\n \t\t\telse:\n \t\t\t\tcontinue\n \t\telse:\n \t\t\tprint(-1)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 31 }, { "user_id": "u842689614", "problem_id": "p04014", "submission1_id": "s562883548", "submission2_id": "s079261653", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\ns=int(input())\n\nb_ans=1\n\nif n==s:\n b_ans=n+1\nif b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\n\nif b_ans==1:\n for p in range(1,int(n**0.5)):\n b=int(n/p)\n q=n-p*b\n if s==p+q:\n b_ans=b\n break\n\nif b_ans!=1:\n print(b_ans)\nelse:\n print(-1)", "code2": "n=int(input())\ns=int(input())\n\nb_ans=1\n\n\n\nif n==s:\n b_ans=n+1\nif b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\nif b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n\n if b.is_integer() and 0<=s-pn**0.5:\n b_ans=int(b)\n break\n\nif b_ans!=1:\n print(b_ans)\nelse:\n print(-1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566167681", "date2": "1566170554", "bleu_score": "0.8613501683820108", "code1_test_status": [1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 48, "total_score": 105, "input": "87654\n438\n", "actual_output": "369\n", "expected_output": "317\n\n", "anno_code": ["n=int(input()) # (0): n=87654\ns=int(input()) # (1): s=438\n\nb_ans=1 # (2): b_ans=1\n\nif n==s: # (3): NO CHANGE\n b_ans=n+1\nif b_ans==1: # (4): NO CHANGE\n for b in range(2,int(n**0.5)+1): # (5): b=2 (61): b=3 ... (4402): NO CHANGE\n nn=n # (6): nn=87654 (62): nn=87654 ... (4389): nn=87654\n st=[] # (7): st=[] (63): st=[] ... (4390): st=[]\n while(nn>0): # (8): NO CHANGE (11): NO CHANGE ... (4400): NO CHANGE\n st.append(nn%b) # (9): st=[0] (12): st=[0, 1.0] ... (4398): st=[38, 0.0, 1.0]\n nn=(nn-st[-1])/b # (10): nn=43827.0 (13): nn=21913.0 ... (4399): nn=0.0\n \n if sum(st)==s: # (60): NO CHANGE (98): NO CHANGE ... (4401): NO CHANGE\n b_ans=b\n break\n\n\nif b_ans==1: # (4403): NO CHANGE\n for p in range(1,int(n**0.5)): # (4404): p=1 (4408): p=2 ... (5348): p=237\n b=int(n/p) # (4405): b=87654 (4409): b=43827 ... (5349): b=369\n q=n-p*b # (4406): q=0 (4410): NO CHANGE ... (5350): q=201\n if s==p+q: # (4407): NO CHANGE (4411): NO CHANGE ... (5351): NO CHANGE\n b_ans=b # (5352): b_ans=369\n break # (5353): NO CHANGE\n\nif b_ans!=1: # (5354): NO CHANGE\n print(b_ans)\nelse:\n print(-1)"], "anno_status": [true], "diff_content": " n=int(input())\n s=int(input())\n \n b_ans=1\n \n+\n+\n if n==s:\n b_ans=n+1\n if b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n-\n if b_ans==1:\n- for p in range(1,int(n**0.5)):\n- b=int(n/p)\n- q=n-p*b\n- if s==p+q:\n- b_ans=b\n+ for p in range(int(n**0.5),0,-1):\n+ b=(n-s+p)/p\n+\n+ if b.is_integer() and 0<=s-pn**0.5:\n+ b_ans=int(b)\n break\n \n if b_ans!=1:\n print(b_ans)\n else:\n print(-1)\n", "FL_content": " n=int(input())\n s=int(input())\n \n b_ans=1\n \n if n==s:\n b_ans=n+1\n if b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n-\n if b_ans==1:\n- for p in range(1,int(n**0.5)):\n- b=int(n/p)\n- q=n-p*b\n- if s==p+q:\n- b_ans=b\n break\n \n if b_ans!=1:\n print(b_ans)\n else:\n print(-1)\n", "added_lines": 7, "removed_lines": 6, "code1_lines": 32 }, { "user_id": "u939198091", "problem_id": "p04014", "submission1_id": "s190766273", "submission2_id": "s125763601", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\ndef func(b,n):\n if b > n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n\ndef _func(b,n):\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n\ndef solve(n,s):\n if n == s:\n return n+1\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n\n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n b = int((n-s)/p)+1\n if b < 2:\n continue\n if _func(b, n) == s:\n return b\n\n return -1\n\nif __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n", "code2": "import math\n\ndef func(b,n):\n if b > n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n\ndef _func(b,n):\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n\ndef solve(n,s):\n if n == s:\n return n+1\n ans = float('inf')\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n\n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n b = int((n-s)/p)+1\n if b < 2:\n continue\n if _func(b, n) == s:\n ans = min(ans, b)\n\n if ans < float('inf'):\n return ans\n else:\n return -1\n\nif __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586403576", "date2": "1586403830", "bleu_score": "0.8892172213952186", "code1_test_status": [1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 54, "total_score": 105, "input": "87654\n5894\n", "actual_output": "81761\n", "expected_output": "8177\n\n", "anno_code": ["import math\n\ndef func(b,n): # (0): func=\n if b > n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n\ndef _func(b,n): # (1): _func=\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n\ndef solve(n,s): # (2): solve=\n if n == s:\n return n+1\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n\n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n b = int((n-s)/p)+1\n if b < 2:\n continue\n if _func(b, n) == s:\n return b\n\n return -1\n\nif __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n"], "anno_status": [true], "diff_content": " import math\n \n def func(b,n):\n if b > n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n \n def _func(b,n):\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n \n def solve(n,s):\n if n == s:\n return n+1\n+ ans = float('inf')\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n \n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n b = int((n-s)/p)+1\n if b < 2:\n continue\n if _func(b, n) == s:\n- return b\n+ ans = min(ans, b)\n \n- return -1\n+ if ans < float('inf'):\n+ return ans\n+ else:\n+ return -1\n \n if __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n \n", "FL_content": " import math\n \n def func(b,n):\n if b > n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n \n def _func(b,n):\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n \n def solve(n,s):\n if n == s:\n return n+1\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n \n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n b = int((n-s)/p)+1\n if b < 2:\n continue\n if _func(b, n) == s:\n- return b\n \n- return -1\n \n if __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n \n", "added_lines": 6, "removed_lines": 2, "code1_lines": 41 }, { "user_id": "u842689614", "problem_id": "p04014", "submission1_id": "s632545794", "submission2_id": "s079261653", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\ns=int(input())\n\nb_ans=1\n\n\n\nif n==s:\n b_ans=n+1\nif b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\n\nif b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n\n if b.is_integer() and s-p0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\nif b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n\n if b.is_integer() and 0<=s-pn**0.5:\n b_ans=int(b)\n break\n\nif b_ans!=1:\n print(b_ans)\nelse:\n print(-1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566169945", "date2": "1566170554", "bleu_score": "0.955352874296988", "code1_test_status": [1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 84, "total_score": 105, "input": "87654\n7\n", "actual_output": "660\n", "expected_output": "12522\n\n", "anno_code": ["n=int(input()) # (0): n=87654\ns=int(input()) # (1): s=7\n\nb_ans=1 # (2): b_ans=1\n\n\n\nif n==s: # (3): NO CHANGE\n b_ans=n+1\nif b_ans==1: # (4): NO CHANGE\n for b in range(2,int(n**0.5)+1): # (5): b=2 (61): b=3 ... (4402): NO CHANGE\n nn=n # (6): nn=87654 (62): nn=87654 ... (4389): nn=87654\n st=[] # (7): st=[] (63): st=[] ... (4390): st=[]\n while(nn>0): # (8): NO CHANGE (11): NO CHANGE ... (4400): NO CHANGE\n st.append(nn%b) # (9): st=[0] (12): st=[0, 1.0] ... (4398): st=[38, 0.0, 1.0]\n nn=(nn-st[-1])/b # (10): nn=43827.0 (13): nn=21913.0 ... (4399): nn=0.0\n \n if sum(st)==s: # (60): NO CHANGE (98): NO CHANGE ... (4401): NO CHANGE\n b_ans=b\n break\n\n\nif b_ans==1: # (4403): NO CHANGE\n for p in range(int(n**0.5),0,-1): # (4404): p=296 (4407): p=295 ... (4893): p=133\n b=(n-s+p)/p # (4405): b=297.10473 (4408): b=298.108475 ... (4894): b=660.0\n\n if b.is_integer() and s-p0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n-\n if b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n \n- if b.is_integer() and s-pn**0.5:\n b_ans=int(b)\n break\n \n if b_ans!=1:\n print(b_ans)\n else:\n print(-1)\n", "FL_content": " n=int(input())\n s=int(input())\n \n b_ans=1\n \n \n \n if n==s:\n b_ans=n+1\n if b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n-\n if b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n \n- if b.is_integer() and s-p n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n\ndef _func(b,n):\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n\ndef solve(n,s):\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n\n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n b = int((n-s)/p)+1\n if b < 2:\n continue\n if _func(b, n) == s:\n return b\n\n return -1\n\nif __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n", "code2": "import math\n\ndef func(b,n):\n if b > n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n\ndef _func(b,n):\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n\ndef solve(n,s):\n if n == s:\n return n+1\n ans = float('inf')\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n\n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n b = int((n-s)/p)+1\n if b < 2:\n continue\n if _func(b, n) == s:\n ans = min(ans, b)\n\n if ans < float('inf'):\n return ans\n else:\n return -1\n\nif __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586403275", "date2": "1586403830", "bleu_score": "0.8515063254529821", "code1_test_status": [1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 54, "total_score": 105, "input": "87654\n241\n", "actual_output": "87414\n", "expected_output": "1434\n\n", "anno_code": ["import math\n\ndef func(b,n): # (0): func=\n if b > n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n\ndef _func(b,n): # (1): _func=\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n\ndef solve(n,s): # (2): solve=\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n\n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n b = int((n-s)/p)+1\n if b < 2:\n continue\n if _func(b, n) == s:\n return b\n\n return -1\n\nif __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n"], "anno_status": [true], "diff_content": " import math\n \n def func(b,n):\n if b > n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n \n def _func(b,n):\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n \n def solve(n,s):\n+ if n == s:\n+ return n+1\n+ ans = float('inf')\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n \n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n b = int((n-s)/p)+1\n if b < 2:\n continue\n if _func(b, n) == s:\n- return b\n+ ans = min(ans, b)\n \n- return -1\n+ if ans < float('inf'):\n+ return ans\n+ else:\n+ return -1\n \n if __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n \n", "FL_content": " import math\n \n def func(b,n):\n if b > n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n \n def _func(b,n):\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n \n def solve(n,s):\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n \n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n b = int((n-s)/p)+1\n if b < 2:\n continue\n if _func(b, n) == s:\n- return b\n \n- return -1\n \n if __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n \n", "added_lines": 8, "removed_lines": 2, "code1_lines": 39 }, { "user_id": "u842689614", "problem_id": "p04014", "submission1_id": "s101929788", "submission2_id": "s079261653", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\ns=int(input())\n\nb_ans=1\n\n\n\nif n==s:\n b_ans=n+1\nif b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\n\nif b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=int(n/p)\n q=n-p*b\n if s==p+q and q0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\nif b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n\n if b.is_integer() and 0<=s-pn**0.5:\n b_ans=int(b)\n break\n\nif b_ans!=1:\n print(b_ans)\nelse:\n print(-1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566168910", "date2": "1566170554", "bleu_score": "0.891097790202012", "code1_test_status": [1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 52, "total_score": 105, "input": "87654\n264\n", "actual_output": "-1\n", "expected_output": "972\n\n", "anno_code": ["n=int(input()) # (0): n=87654\ns=int(input()) # (1): s=264\n\nb_ans=1 # (2): b_ans=1\n\n\n\nif n==s: # (3): NO CHANGE\n b_ans=n+1\nif b_ans==1: # (4): NO CHANGE\n for b in range(2,int(n**0.5)+1): # (5): b=2 (61): b=3 ... (4402): NO CHANGE\n nn=n # (6): nn=87654 (62): nn=87654 ... (4389): nn=87654\n st=[] # (7): st=[] (63): st=[] ... (4390): st=[]\n while(nn>0): # (8): NO CHANGE (11): NO CHANGE ... (4400): NO CHANGE\n st.append(nn%b) # (9): st=[0] (12): st=[0, 1.0] ... (4398): st=[38, 0.0, 1.0]\n nn=(nn-st[-1])/b # (10): nn=43827.0 (13): nn=21913.0 ... (4399): nn=0.0\n \n if sum(st)==s: # (60): NO CHANGE (98): NO CHANGE ... (4401): NO CHANGE\n b_ans=b\n break\n\n\nif b_ans==1: # (4403): NO CHANGE\n for p in range(int(n**0.5),0,-1): # (4404): p=296 (4408): p=295 ... (5588): NO CHANGE\n b=int(n/p) # (4405): NO CHANGE (4409): b=297 ... (5585): b=87654\n q=n-p*b # (4406): q=38 (4410): q=39 ... (5586): NO CHANGE\n if s==p+q and q0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n-\n if b_ans==1:\n for p in range(int(n**0.5),0,-1):\n- b=int(n/p)\n- q=n-p*b\n- if s==p+q and qn**0.5:\n+ b_ans=int(b)\n break\n \n if b_ans!=1:\n print(b_ans)\n else:\n print(-1)\n", "FL_content": " n=int(input())\n s=int(input())\n \n b_ans=1\n \n \n \n if n==s:\n b_ans=n+1\n if b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n-\n if b_ans==1:\n for p in range(int(n**0.5),0,-1):\n- b=int(n/p)\n- q=n-p*b\n- if s==p+q and q= 2 and f(b, n) == s):\n print(b)\n sys.exit()\n\nprint(\"-1\")\n", "code2": "import math, sys\n\nn = int(input())\ns = int(input())\n\ndef f(b, n):\n if n < b:\n return n\n else:\n return f(b, math.floor(n/b)) + n % b\n\nif s == n:\n print(n+1)\n sys.exit()\n\n\nfor b in range(2, math.floor(math.sqrt(n))+1):\n \n if(f(b, n) == s):\n print(b)\n sys.exit()\n\n\nfor p in range(1, math.floor(math.sqrt(n))+1):\n \n _p = math.floor(math.sqrt(n))+1-p\n b = int((n-s)/_p) + 1\n if(b >= 2 and f(b, n) == s):\n print(b)\n sys.exit()\n\nprint(\"-1\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1480882997", "date2": "1480884795", "bleu_score": "0.8816920548157158", "code1_test_status": [1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 54, "total_score": 105, "input": "31415926535\n7\n", "actual_output": "31415926529\n", "expected_output": "4487989505\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import math, sys\n \n n = int(input())\n s = int(input())\n \n def f(b, n):\n if n < b:\n return n\n else:\n return f(b, math.floor(n/b)) + n % b\n \n if s == n:\n print(n+1)\n sys.exit()\n \n \n-for b in range(2, math.ceil(math.sqrt(n))):\n+for b in range(2, math.floor(math.sqrt(n))+1):\n \n if(f(b, n) == s):\n print(b)\n sys.exit()\n \n \n-for p in range(1, math.ceil(math.sqrt(n))):\n+for p in range(1, math.floor(math.sqrt(n))+1):\n \n- b = int((n-s)/p) + 1\n+ _p = math.floor(math.sqrt(n))+1-p\n+ b = int((n-s)/_p) + 1\n if(b >= 2 and f(b, n) == s):\n print(b)\n sys.exit()\n \n print(\"-1\")\n-\n", "FL_content": " import math, sys\n \n n = int(input())\n s = int(input())\n \n def f(b, n):\n if n < b:\n return n\n else:\n return f(b, math.floor(n/b)) + n % b\n \n if s == n:\n print(n+1)\n sys.exit()\n \n \n-for b in range(2, math.ceil(math.sqrt(n))):\n \n if(f(b, n) == s):\n print(b)\n sys.exit()\n \n \n-for p in range(1, math.ceil(math.sqrt(n))):\n \n- b = int((n-s)/p) + 1\n if(b >= 2 and f(b, n) == s):\n print(b)\n sys.exit()\n \n print(\"-1\")\n-\n", "added_lines": 4, "removed_lines": 4, "code1_lines": 32 }, { "user_id": "u333917945", "problem_id": "p04014", "submission1_id": "s607195442", "submission2_id": "s431036494", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math, sys\n\nn = int(input())\ns = int(input())\n\ndef f(b, n):\n if n < b:\n return n\n else:\n return f(b, math.floor(n/b)) + n % b\n\nif s == n:\n print(n+1)\n sys.exit()\n\nprint(2, math.ceil(math.sqrt(n)))\nfor b in range(2, math.floor(math.sqrt(n))+1):\n \n if(f(b, n) == s):\n print(b)\n sys.exit()\n\nprint(math.floor(math.sqrt(n))-1)\nfor p in range(1, math.ceil(math.sqrt(n))):\n \n b = int((n-s)/p) + 1\n if(b >= 2 and f(b, n) == s):\n print(b)\n sys.exit()\n\nprint(\"-1\")\n", "code2": "import math, sys\n\nn = int(input())\ns = int(input())\n\ndef f(b, n):\n if n < b:\n return n\n else:\n return f(b, math.floor(n/b)) + n % b\n\nif s == n:\n print(n+1)\n sys.exit()\n\n\nfor b in range(2, math.floor(math.sqrt(n))+1):\n \n if(f(b, n) == s):\n print(b)\n sys.exit()\n\n\nfor p in range(1, math.floor(math.sqrt(n))+1):\n \n _p = math.floor(math.sqrt(n))+1-p\n b = int((n-s)/_p) + 1\n if(b >= 2 and f(b, n) == s):\n print(b)\n sys.exit()\n\nprint(\"-1\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1480883730", "date2": "1480884795", "bleu_score": "0.8985638206980743", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 105, "input": "87654\n264\n", "actual_output": "2 297\n295\n87391\n", "expected_output": "972\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import math, sys\n \n n = int(input())\n s = int(input())\n \n def f(b, n):\n if n < b:\n return n\n else:\n return f(b, math.floor(n/b)) + n % b\n \n if s == n:\n print(n+1)\n sys.exit()\n \n-print(2, math.ceil(math.sqrt(n)))\n+\n for b in range(2, math.floor(math.sqrt(n))+1):\n \n if(f(b, n) == s):\n print(b)\n sys.exit()\n \n-print(math.floor(math.sqrt(n))-1)\n-for p in range(1, math.ceil(math.sqrt(n))):\n+\n+for p in range(1, math.floor(math.sqrt(n))+1):\n \n- b = int((n-s)/p) + 1\n+ _p = math.floor(math.sqrt(n))+1-p\n+ b = int((n-s)/_p) + 1\n if(b >= 2 and f(b, n) == s):\n print(b)\n sys.exit()\n \n print(\"-1\")\n-\n", "FL_content": " import math, sys\n \n n = int(input())\n s = int(input())\n \n def f(b, n):\n if n < b:\n return n\n else:\n return f(b, math.floor(n/b)) + n % b\n \n if s == n:\n print(n+1)\n sys.exit()\n \n-print(2, math.ceil(math.sqrt(n)))\n for b in range(2, math.floor(math.sqrt(n))+1):\n \n if(f(b, n) == s):\n print(b)\n sys.exit()\n \n-print(math.floor(math.sqrt(n))-1)\n-for p in range(1, math.ceil(math.sqrt(n))):\n \n- b = int((n-s)/p) + 1\n if(b >= 2 and f(b, n) == s):\n print(b)\n sys.exit()\n \n print(\"-1\")\n-\n", "added_lines": 5, "removed_lines": 5, "code1_lines": 32 }, { "user_id": "u846552659", "problem_id": "p03505", "submission1_id": "s030960076", "submission2_id": "s307346955", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport math\nk,a,b = map(int, input().split())\nif a >= k:\n print(1)\nelse:\n if a <= b:\n print(-1)\n else:\n print((2*math.ceil((k-a)/(a-b)))+1)", "code2": "\nfrom decimal import *\nimport math\nk,a,b = map(int, input().split())\nif a >= k:\n print(1)\nelse:\n if a <= b:\n print(-1)\n else:\n print(2*math.ceil(Decimal(k-a)/Decimal(a-b))+1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1514081773", "date2": "1514083222", "bleu_score": "0.7950745065357415", "code1_test_status": [1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0], "code1_test_score": 21, "total_score": 103, "input": "1100010010001000000 2 -11\n", "actual_output": "169232309230923073\n", "expected_output": "169232309230923079\n\n", "anno_code": ["\nimport math\nk,a,b = map(int, input().split()) # (0): k=1100010010001000000, a=2, b=-11\nif a >= k: # (1): NO CHANGE\n print(1)\nelse:\n if a <= b: # (2): NO CHANGE\n print(-1)\n else:\n print((2*math.ceil((k-a)/(a-b)))+1)"], "anno_status": [true], "diff_content": " \n+from decimal import *\n import math\n k,a,b = map(int, input().split())\n if a >= k:\n print(1)\n else:\n if a <= b:\n print(-1)\n else:\n- print((2*math.ceil((k-a)/(a-b)))+1)\n+ print(2*math.ceil(Decimal(k-a)/Decimal(a-b))+1)\n", "FL_content": " \n import math\n k,a,b = map(int, input().split())\n if a >= k:\n print(1)\n else:\n if a <= b:\n print(-1)\n else:\n- print((2*math.ceil((k-a)/(a-b)))+1)\n", "added_lines": 2, "removed_lines": 1, "code1_lines": 10 }, { "user_id": "u507611905", "problem_id": "p03505", "submission1_id": "s502070222", "submission2_id": "s353423691", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nfrom decimal import *\n\nnumbers = [int(i) for i in input().split()]\n\ndiff = numbers[1] - numbers[2]\n\nif diff <= 0:\n print(\"-1\")\nelif numbers[0] <= numbers[1]:\n print(\"1\")\nelse:\n rating = 0\n count = 0\n print(math.ceil(Decimal(numbers[0] - numbers[1]) / diff) * 2 + 1)", "code2": "import math\nfrom decimal import *\n\nnumbers = [int(i) for i in input().split()]\n\ndiff = numbers[1] - numbers[2]\n\nif numbers[0] <= numbers[1]:\n print(\"1\")\nelif diff <= 0:\n print(\"-1\")\nelse:\n print(math.ceil(Decimal(numbers[0] - numbers[1]) / diff) * 2 + 1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512590846", "date2": "1512591699", "bleu_score": "0.8955957320836455", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "31 144 600\n", "actual_output": "-1\n", "expected_output": "1\n\n", "anno_code": ["import math\nfrom decimal import *\n\nnumbers = [int(i) for i in input().split()] # (0): numbers=[31, 144, 600]\n\ndiff = numbers[1] - numbers[2] # (1): diff=-456\n\nif diff <= 0: # (2): NO CHANGE\n print(\"-1\")\nelif numbers[0] <= numbers[1]:\n print(\"1\")\nelse:\n rating = 0\n count = 0\n print(math.ceil(Decimal(numbers[0] - numbers[1]) / diff) * 2 + 1)"], "anno_status": [true], "diff_content": " import math\n from decimal import *\n \n numbers = [int(i) for i in input().split()]\n \n diff = numbers[1] - numbers[2]\n \n-if diff <= 0:\n- print(\"-1\")\n-elif numbers[0] <= numbers[1]:\n+if numbers[0] <= numbers[1]:\n print(\"1\")\n+elif diff <= 0:\n+ print(\"-1\")\n else:\n- rating = 0\n- count = 0\n print(math.ceil(Decimal(numbers[0] - numbers[1]) / diff) * 2 + 1)\n", "FL_content": " import math\n from decimal import *\n \n numbers = [int(i) for i in input().split()]\n \n diff = numbers[1] - numbers[2]\n \n-if diff <= 0:\n- print(\"-1\")\n-elif numbers[0] <= numbers[1]:\n print(\"1\")\n else:\n- rating = 0\n- count = 0\n print(math.ceil(Decimal(numbers[0] - numbers[1]) / diff) * 2 + 1)\n", "added_lines": 3, "removed_lines": 5, "code1_lines": 15 }, { "user_id": "u356832650", "problem_id": "p03505", "submission1_id": "s593140435", "submission2_id": "s393259520", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport math\nK, A, B = list(map(int, input().split()))\n\nif (A >= K):\n print(1)\n sys.exit()\nelif (A - B) <= 0:\n print(-1)\n sys.exit()\nd = A - B\n\np = K-A\nq = p/d\nif ((p % d) != 0):\n q += 1\nprint(2*q + 1)", "code2": "import sys\nimport math\nK, A, B = list(map(int, input().split()))\n \nif (A >= K):\n print('1')\n sys.exit()\nelif (A - B) <= 0:\n print('-1')\n sys.exit()\nd = A-B\np = K-A\nq = int(p\nif ((p % d) != 0):\n q += 1\nprint(str(2*q + 1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512520134", "date2": "1512521288", "bleu_score": "0.8876125747791229", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 3, "total_score": 103, "input": "1100000000100000000 4 0\n", "actual_output": "5.5000000005e+17\n", "expected_output": "550000000049999999\n\n", "anno_code": ["import sys\nimport math\nK, A, B = list(map(int, input().split())) # (0): K=1100000000100000000, A=4, B=0\n\nif (A >= K): # (1): NO CHANGE\n print(1)\n sys.exit()\nelif (A - B) <= 0: # (2): NO CHANGE\n print(-1)\n sys.exit()\nd = A - B # (3): d=4\n\np = K-A # (4): p=1100000000099999996\nq = p/d # (5): q=275000000025000000\nif ((p % d) != 0): # (6): NO CHANGE\n q += 1\nprint(2*q + 1)"], "anno_status": [true], "diff_content": " import sys\n import math\n K, A, B = list(map(int, input().split()))\n-\n+ \n if (A >= K):\n- print(1)\n+ print('1')\n sys.exit()\n elif (A - B) <= 0:\n- print(-1)\n+ print('-1')\n sys.exit()\n-d = A - B\n-\n+d = A-B\n p = K-A\n-q = p/d\n+q = int(p\n if ((p % d) != 0):\n q += 1\n-print(2*q + 1)\n+print(str(2*q + 1))\n", "FL_content": " import sys\n import math\n K, A, B = list(map(int, input().split()))\n-\n if (A >= K):\n- print(1)\n sys.exit()\n elif (A - B) <= 0:\n- print(-1)\n sys.exit()\n-d = A - B\n-\n p = K-A\n-q = p/d\n if ((p % d) != 0):\n q += 1\n-print(2*q + 1)\n", "added_lines": 6, "removed_lines": 7, "code1_lines": 17 }, { "user_id": "u846150137", "problem_id": "p03505", "submission1_id": "s524008672", "submission2_id": "s572959561", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import ceil\nk,a,b=map(int,input().split())\nk-=a\nif k<=0:\n print(1)\nelif a>b:\n print(1+ceil(k/(a-b))*2)\nelse:\n print(-1)", "code2": "from math import ceil\nk,a,b=map(int,input().split())\nif k<=a:\n print(1)\nelif a>b:\n print(1+(k-b-1)\nelse:\n print(-1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1536755146", "date2": "1536755967", "bleu_score": "0.8237148912802666", "code1_test_status": [1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0], "code1_test_score": 21, "total_score": 103, "input": "1100110001111001010 2 0\n", "actual_output": "1100110001111000961\n", "expected_output": "1100110001111001009\n\n", "anno_code": ["from math import ceil\nk,a,b=map(int,input().split()) # (0): k=1100110001111001010, a=2, b=0\nk-=a # (1): k=1100110001111001008\nif k<=0: # (2): NO CHANGE\n print(1)\nelif a>b: # (3): NO CHANGE\n print(1+ceil(k/(a-b))*2)\nelse:\n print(-1)"], "anno_status": [true], "diff_content": " from math import ceil\n k,a,b=map(int,input().split())\n-k-=a\n-if k<=0:\n+if k<=a:\n print(1)\n elif a>b:\n- print(1+ceil(k/(a-b))*2)\n+ print(1+(k-b-1)\n else:\n print(-1)\n", "FL_content": " from math import ceil\n k,a,b=map(int,input().split())\n-k-=a\n-if k<=0:\n print(1)\n elif a>b:\n- print(1+ceil(k/(a-b))*2)\n else:\n print(-1)\n", "added_lines": 2, "removed_lines": 3, "code1_lines": 9 }, { "user_id": "u223646582", "problem_id": "p03505", "submission1_id": "s450525296", "submission2_id": "s817270098", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nK,A,B=map(int,input().split())\nif A>=K:\n print(1)\nelif A-B>0:\n print(1+math.ceil((K-A)/(A-B))*2)\nelse:\n print(-1)", "code2": "from decimal import *\nimport math\nK,A,B=map(int,input().split())\nif A>=K:\n print(1)\nelif A-B>0:\n print(1+math.ceil(Decimal(K-A)/Decimal(A-B))*2)\nelse:\n print(-1)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590196354", "date2": "1590197270", "bleu_score": "0.7550906470106066", "code1_test_status": [1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0], "code1_test_score": 21, "total_score": 103, "input": "1100100001011001000 2 1\n", "actual_output": "2200200002022001921\n", "expected_output": "2200200002022001997\n\n", "anno_code": ["import math\nK,A,B=map(int,input().split()) # (0): K=1100100001011001000, A=2, B=1\nif A>=K: # (1): NO CHANGE\n print(1)\nelif A-B>0: # (2): NO CHANGE\n print(1+math.ceil((K-A)/(A-B))*2)\nelse:\n print(-1)"], "anno_status": [true], "diff_content": "+from decimal import *\n import math\n K,A,B=map(int,input().split())\n if A>=K:\n print(1)\n elif A-B>0:\n- print(1+math.ceil((K-A)/(A-B))*2)\n+ print(1+math.ceil(Decimal(K-A)/Decimal(A-B))*2)\n else:\n print(-1)\n+\n", "FL_content": " import math\n K,A,B=map(int,input().split())\n if A>=K:\n print(1)\n elif A-B>0:\n- print(1+math.ceil((K-A)/(A-B))*2)\n else:\n print(-1)\n", "added_lines": 3, "removed_lines": 1, "code1_lines": 8 }, { "user_id": "u356832650", "problem_id": "p03505", "submission1_id": "s200634590", "submission2_id": "s393259520", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport math\nK, A, B = list(map(int, input().split()))\n\nif A >= K:\n print(1)\n sys.exit()\nelif (A - B) <= 0:\n print(-1)\n sys.exit()\nd = A - B\n\np = K-A\nq = math.ceil(float(p)/d)\n", "code2": "import sys\nimport math\nK, A, B = list(map(int, input().split()))\n \nif (A >= K):\n print('1')\n sys.exit()\nelif (A - B) <= 0:\n print('-1')\n sys.exit()\nd = A-B\np = K-A\nq = int(p\nif ((p % d) != 0):\n q += 1\nprint(str(2*q + 1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512519355", "date2": "1512521288", "bleu_score": "0.699471254243273", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 3, "total_score": 103, "input": "1101000010100000000 4 0\n", "actual_output": "", "expected_output": "550500005049999999\n\n", "anno_code": ["import sys\nimport math\nK, A, B = list(map(int, input().split())) # (0): K=1101000010100000000, A=4, B=0\n\nif A >= K: # (1): NO CHANGE\n print(1)\n sys.exit()\nelif (A - B) <= 0: # (2): NO CHANGE\n print(-1)\n sys.exit()\nd = A - B # (3): d=4\n\np = K-A # (4): p=1101000010099999996\nq = math.ceil(float(p)/d)\n"], "anno_status": [true], "diff_content": " import sys\n import math\n K, A, B = list(map(int, input().split()))\n-\n-if A >= K:\n- print(1)\n+ \n+if (A >= K):\n+ print('1')\n sys.exit()\n elif (A - B) <= 0:\n- print(-1)\n+ print('-1')\n sys.exit()\n-d = A - B\n-\n+d = A-B\n p = K-A\n-q = math.ceil(float(p)/d)\n-\n+q = int(p\n+if ((p % d) != 0):\n+ q += 1\n+print(str(2*q + 1))\n", "FL_content": " import sys\n import math\n K, A, B = list(map(int, input().split()))\n-\n-if A >= K:\n- print(1)\n sys.exit()\n elif (A - B) <= 0:\n- print(-1)\n sys.exit()\n-d = A - B\n-\n p = K-A\n-q = math.ceil(float(p)/d)\n-\n", "added_lines": 9, "removed_lines": 8, "code1_lines": 15 }, { "user_id": "u356832650", "problem_id": "p03505", "submission1_id": "s008777039", "submission2_id": "s393259520", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport math\nK, A, B = list(map(int, input().split()))\n\nif A >= K:\n print(1)\n sys.exit()\nelif (A - B) <= 0:\n print(-1)\n sys.exit()\nd = A - B\n\np = K-A\nq = math.ceil(float(p)/d)\nprint(2*q + 1)\n", "code2": "import sys\nimport math\nK, A, B = list(map(int, input().split()))\n \nif (A >= K):\n print('1')\n sys.exit()\nelif (A - B) <= 0:\n print('-1')\n sys.exit()\nd = A-B\np = K-A\nq = int(p\nif ((p % d) != 0):\n q += 1\nprint(str(2*q + 1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512518774", "date2": "1512521288", "bleu_score": "0.7525374078475608", "code1_test_status": [1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 20, "total_score": 103, "input": "0100001110110000011 2 0\n", "actual_output": "100001110110000017\n", "expected_output": "100001110110000011\n\n", "anno_code": ["import sys\nimport math\nK, A, B = list(map(int, input().split())) # (0): K=100001110110000011, A=2, B=0\n\nif A >= K: # (1): NO CHANGE\n print(1)\n sys.exit()\nelif (A - B) <= 0: # (2): NO CHANGE\n print(-1)\n sys.exit()\nd = A - B # (3): d=2\n\np = K-A # (4): p=100001110110000009\nq = math.ceil(float(p)/d) # (5): q=50000555055000008\nprint(2*q + 1)\n"], "anno_status": [true], "diff_content": " import sys\n import math\n K, A, B = list(map(int, input().split()))\n-\n-if A >= K:\n- print(1)\n+ \n+if (A >= K):\n+ print('1')\n sys.exit()\n elif (A - B) <= 0:\n- print(-1)\n+ print('-1')\n sys.exit()\n-d = A - B\n-\n+d = A-B\n p = K-A\n-q = math.ceil(float(p)/d)\n-print(2*q + 1)\n-\n+q = int(p\n+if ((p % d) != 0):\n+ q += 1\n+print(str(2*q + 1))\n", "FL_content": " import sys\n import math\n K, A, B = list(map(int, input().split()))\n-\n-if A >= K:\n- print(1)\n sys.exit()\n elif (A - B) <= 0:\n- print(-1)\n sys.exit()\n-d = A - B\n-\n p = K-A\n-q = math.ceil(float(p)/d)\n-print(2*q + 1)\n-\n", "added_lines": 9, "removed_lines": 9, "code1_lines": 16 }, { "user_id": "u356832650", "problem_id": "p03505", "submission1_id": "s291110351", "submission2_id": "s393259520", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport math\nK, A, B = list(map(int, input().split()))\n\nif (A >= K):\n print(1)\n sys.exit()\nelif (A - B) <= 0:\n print(-1)\n sys.exit()\nd = A - B\n\np = K-A\nq = p/d\nif ((p % d) != 0):\n q += 1\nprint(int(2*q + 1))", "code2": "import sys\nimport math\nK, A, B = list(map(int, input().split()))\n \nif (A >= K):\n print('1')\n sys.exit()\nelif (A - B) <= 0:\n print('-1')\n sys.exit()\nd = A-B\np = K-A\nq = int(p\nif ((p % d) != 0):\n q += 1\nprint(str(2*q + 1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512520226", "date2": "1512521288", "bleu_score": "0.9023794462027179", "code1_test_status": [1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 13, "total_score": 103, "input": "0100001110110000011 2 -2\n", "actual_output": "50000555055000008\n", "expected_output": "50000555055000007\n\n", "anno_code": ["import sys\nimport math\nK, A, B = list(map(int, input().split())) # (0): K=100001110110000011, A=2, B=-2\n\nif (A >= K): # (1): NO CHANGE\n print(1)\n sys.exit()\nelif (A - B) <= 0: # (2): NO CHANGE\n print(-1)\n sys.exit()\nd = A - B # (3): d=4\n\np = K-A # (4): p=100001110110000009\nq = p/d # (5): q=25000277527500004\nif ((p % d) != 0): # (6): NO CHANGE\n q += 1 # (7): NO CHANGE\nprint(int(2*q + 1))"], "anno_status": [true], "diff_content": " import sys\n import math\n K, A, B = list(map(int, input().split()))\n-\n+ \n if (A >= K):\n- print(1)\n+ print('1')\n sys.exit()\n elif (A - B) <= 0:\n- print(-1)\n+ print('-1')\n sys.exit()\n-d = A - B\n-\n+d = A-B\n p = K-A\n-q = p/d\n+q = int(p\n if ((p % d) != 0):\n q += 1\n-print(int(2*q + 1))\n+print(str(2*q + 1))\n", "FL_content": " import sys\n import math\n K, A, B = list(map(int, input().split()))\n-\n if (A >= K):\n- print(1)\n sys.exit()\n elif (A - B) <= 0:\n- print(-1)\n sys.exit()\n-d = A - B\n-\n p = K-A\n-q = p/d\n if ((p % d) != 0):\n q += 1\n-print(int(2*q + 1))\n", "added_lines": 6, "removed_lines": 7, "code1_lines": 17 }, { "user_id": "u507611905", "problem_id": "p03505", "submission1_id": "s357136085", "submission2_id": "s353423691", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nnumbers = [int(i) for i in input().split()]\n\nmax_number = math.pow(10,18)\n\ndiff = numbers[1] - numbers[2]\n\nif numbers[0] > diff * max_number:\n print(\"-1\")\nelse:\n rating = 0\n count = 0\n print(math.ceil(numbers[0] / diff) * 2 - 1)", "code2": "import math\nfrom decimal import *\n\nnumbers = [int(i) for i in input().split()]\n\ndiff = numbers[1] - numbers[2]\n\nif numbers[0] <= numbers[1]:\n print(\"1\")\nelif diff <= 0:\n print(\"-1\")\nelse:\n print(math.ceil(Decimal(numbers[0] - numbers[1]) / diff) * 2 + 1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512519944", "date2": "1512591699", "bleu_score": "0.7457446717396421", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 19, "total_score": 103, "input": "1100100010001000000 1 -2\n", "actual_output": "733400006667333375\n", "expected_output": "733400006667333335\n\n", "anno_code": ["import math\n\nnumbers = [int(i) for i in input().split()] # (0): numbers=[1100100010001000000, 1, -2]\n\nmax_number = math.pow(10,18) # (1): max_number=1e+18\n\ndiff = numbers[1] - numbers[2] # (2): diff=3\n\nif numbers[0] > diff * max_number: # (3): NO CHANGE\n print(\"-1\")\nelse:\n rating = 0 # (4): rating=0\n count = 0 # (5): count=0\n print(math.ceil(numbers[0] / diff) * 2 - 1)"], "anno_status": [true], "diff_content": " import math\n+from decimal import *\n \n numbers = [int(i) for i in input().split()]\n \n-max_number = math.pow(10,18)\n-\n diff = numbers[1] - numbers[2]\n \n-if numbers[0] > diff * max_number:\n+if numbers[0] <= numbers[1]:\n+ print(\"1\")\n+elif diff <= 0:\n print(\"-1\")\n else:\n- rating = 0\n- count = 0\n- print(math.ceil(numbers[0] / diff) * 2 - 1)\n+ print(math.ceil(Decimal(numbers[0] - numbers[1]) / diff) * 2 + 1)\n", "FL_content": " import math\n \n numbers = [int(i) for i in input().split()]\n \n-max_number = math.pow(10,18)\n-\n diff = numbers[1] - numbers[2]\n \n-if numbers[0] > diff * max_number:\n print(\"-1\")\n else:\n- rating = 0\n- count = 0\n- print(math.ceil(numbers[0] / diff) * 2 - 1)\n", "added_lines": 5, "removed_lines": 6, "code1_lines": 14 }, { "user_id": "u356832650", "problem_id": "p03505", "submission1_id": "s460037745", "submission2_id": "s393259520", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport math\nK, A, B = list(map(int, input().split()))\n\nif A >= K:\n print(1)\n sys.exit()\nelif (A - B) <= 0:\n print(-1)\n sys.exit()\nd = A - B\n\np = K-A\nq = p/d\nif (p % d) != 0:\n q += 1\nprint(2*q + 1)", "code2": "import sys\nimport math\nK, A, B = list(map(int, input().split()))\n \nif (A >= K):\n print('1')\n sys.exit()\nelif (A - B) <= 0:\n print('-1')\n sys.exit()\nd = A-B\np = K-A\nq = int(p\nif ((p % d) != 0):\n q += 1\nprint(str(2*q + 1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512520028", "date2": "1512521288", "bleu_score": "0.846868983078784", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 3, "total_score": 103, "input": "0100001110111000010 4 1\n", "actual_output": "6.666740674066667e+16\n", "expected_output": "66667406740666673\n\n", "anno_code": ["import sys\nimport math\nK, A, B = list(map(int, input().split())) # (0): K=100001110111000010, A=4, B=1\n\nif A >= K: # (1): NO CHANGE\n print(1)\n sys.exit()\nelif (A - B) <= 0: # (2): NO CHANGE\n print(-1)\n sys.exit()\nd = A - B # (3): d=3\n\np = K-A # (4): p=100001110111000006\nq = p/d # (5): q=33333703370333336\nif (p % d) != 0: # (6): NO CHANGE\n q += 1 # (7): NO CHANGE\nprint(2*q + 1)"], "anno_status": [true], "diff_content": " import sys\n import math\n K, A, B = list(map(int, input().split()))\n-\n-if A >= K:\n- print(1)\n+ \n+if (A >= K):\n+ print('1')\n sys.exit()\n elif (A - B) <= 0:\n- print(-1)\n+ print('-1')\n sys.exit()\n-d = A - B\n-\n+d = A-B\n p = K-A\n-q = p/d\n-if (p % d) != 0:\n+q = int(p\n+if ((p % d) != 0):\n q += 1\n-print(2*q + 1)\n+print(str(2*q + 1))\n", "FL_content": " import sys\n import math\n K, A, B = list(map(int, input().split()))\n-\n-if A >= K:\n- print(1)\n sys.exit()\n elif (A - B) <= 0:\n- print(-1)\n sys.exit()\n-d = A - B\n-\n p = K-A\n-q = p/d\n-if (p % d) != 0:\n q += 1\n-print(2*q + 1)\n", "added_lines": 8, "removed_lines": 9, "code1_lines": 17 }, { "user_id": "u379559362", "problem_id": "p03739", "submission1_id": "s297569404-FL", "submission2_id": "s455800683", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\nans = 0\n\nwhile a[0] == 0:\n if a[1] > 0:\n a[0] = -1\n elif a[1] < 0:\n a[0] = 1\n else:\n a.pop(0)\n ans += 1\n\nif a[0] < 0:\n a = list(map(lambda x: x * (-1), a))\n\nproduct = 0\n\nfor i in range(len(a)):\n product += a[i]\n\n if i % 2 == 0:\n if product <= 0:\n ans += abs(product) + 1\n product = 1\n\n elif i % 2 == 1:\n if product >= 0:\n ans += abs(product) + 1\n product = -1\n\nprint(ans)\n", "code2": "n = int(input())\na = list(map(int, input().split()))\n_a = list(map(lambda x: x * (-1), a))\n\n\ndef func(l: list):\n _ans = 0\n product = 0\n for i in range(n):\n product += l[i]\n\n if i % 2 == 0:\n if product <= 0:\n _ans += abs(product) + 1\n product = 1\n\n elif i % 2 == 1:\n if product >= 0:\n _ans += abs(product) + 1\n product = -1\n return _ans\n\nans = min(func(a), func(_a))\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1493676542", "date2": "1493677585", "bleu_score": "0.7768195102037689", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1], "code1_test_score": 77, "total_score": 94, "input": "5\n113 -1 -1 1 -2\n", "actual_output": "123\n", "expected_output": "119\n\n", "anno_code": ["n = int(input()) # (0): n=5\na = list(map(int, input().split())) # (1): a=[113, -1, -1, 1, -2]\nans = 0 # (2): ans=0\n\nwhile a[0] == 0: # (3): NO CHANGE\n if a[1] > 0:\n a[0] = -1\n elif a[1] < 0:\n a[0] = 1\n else:\n a.pop(0)\n ans += 1\n\nif a[0] < 0: # (4): NO CHANGE\n a = list(map(lambda x: x * (-1), a))\n\nproduct = 0 # (5): product=0\n\nfor i in range(len(a)): # (6): i=0 (10): i=1 ... (36): NO CHANGE\n product += a[i] # (7): product=113 (11): product=112 ... (31): product=-3\n\n if i % 2 == 0: # (8): NO CHANGE (12): NO CHANGE ... (32): NO CHANGE\n if product <= 0: # (9): NO CHANGE (20): NO CHANGE (33): NO CHANGE\n ans += abs(product) + 1 # (21): ans=116 (34): ans=123\n product = 1 # (22): product=1 (35): product=1\n\n elif i % 2 == 1: # (13): NO CHANGE (26): NO CHANGE\n if product >= 0: # (14): NO CHANGE (27): NO CHANGE\n ans += abs(product) + 1 # (15): ans=113 (28): ans=119\n product = -1 # (16): product=-1 (29): product=-1\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n-ans = 0\n+_a = list(map(lambda x: x * (-1), a))\n \n-while a[0] == 0:\n- if a[1] > 0:\n- a[0] = -1\n- elif a[1] < 0:\n- a[0] = 1\n- else:\n- a.pop(0)\n- ans += 1\n \n-if a[0] < 0:\n- a = list(map(lambda x: x * (-1), a))\n+def func(l: list):\n+ _ans = 0\n+ product = 0\n+ for i in range(n):\n+ product += l[i]\n \n-product = 0\n+ if i % 2 == 0:\n+ if product <= 0:\n+ _ans += abs(product) + 1\n+ product = 1\n \n-for i in range(len(a)):\n- product += a[i]\n-\n- if i % 2 == 0:\n- if product <= 0:\n- ans += abs(product) + 1\n- product = 1\n-\n- elif i % 2 == 1:\n- if product >= 0:\n- ans += abs(product) + 1\n- product = -1\n+ elif i % 2 == 1:\n+ if product >= 0:\n+ _ans += abs(product) + 1\n+ product = -1\n+ return _ans\n \n+ans = min(func(a), func(_a))\n print(ans)\n \n", "FL_content": "\n n = int(input())\n a = list(map(int, input().split()))\n ans = 0\n \n while a[0] == 0:\n if a[1] > 0:\n a[0] = -1\n elif a[1] < 0:\n a[0] = 1\n else:\n a.pop(0)\n ans += 1\n \n if a[0] < 0:\n a = list(map(lambda x: x * (-1), a))\n \n product = 0\n \n for i in range(len(a)):\n product += a[i]\n \n if i % 2 == 0:\n if product <= 0:\n ans += abs(product) + 1\n product = 1\n \n elif i % 2 == 1:\n if product >= 0:\n ans += abs(product) + 1\n product = -1\n \n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 33 }, { "user_id": "u869519920", "problem_id": "p03353", "submission1_id": "s282979148-FL", "submission2_id": "s175973756", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ns = input()\nK = int(input())\n\na_list = sorted(set(s))\nfor i in a_list:\n if K == 1:\n print(i)\n sys.exit()\n p = []\n for j, x in enumerate(s):\n if x == i:\n p.append(s[j:min(j+K,len(s))])\n p.sort()\n print(p)\n t = K\n for j in range(len(p)):\n if j != len(p) - 1:\n if p[j] == p[j+1][0:len(p[j])]:\n continue\n if len(p[j]) < t:\n t -= len(p[j]) - 1\n else:\n print(p[j][0:t])\n sys.exit()\n K = t - 1", "code2": "import sys\ns = input()\nK = int(input())\n\na_list = sorted(set(s))\nfor i in a_list:\n if K == 1:\n print(i)\n sys.exit()\n p = []\n for j, x in enumerate(s):\n if x == i:\n p.append(s[j:min(j+K,len(s))])\n p.sort()\n t = K\n for j in range(len(p)):\n if j != len(p) - 1:\n if p[j] == p[j+1][0:len(p[j])]:\n continue\n if len(p[j]) < t:\n t -= len(p[j]) - 1\n else:\n print(p[j][0:t])\n sys.exit()\n K = t - 1", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596136975", "date2": "1596136996", "bleu_score": "0.9755296011617722", "code1_test_status": [0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 11, "total_score": 103, "input": "bae\n2\n", "actual_output": "['ae']\nae\n", "expected_output": "ae\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " import sys\n s = input()\n K = int(input())\n \n a_list = sorted(set(s))\n for i in a_list:\n if K == 1:\n print(i)\n sys.exit()\n p = []\n for j, x in enumerate(s):\n if x == i:\n p.append(s[j:min(j+K,len(s))])\n p.sort()\n- print(p)\n t = K\n for j in range(len(p)):\n if j != len(p) - 1:\n if p[j] == p[j+1][0:len(p[j])]:\n continue\n if len(p[j]) < t:\n t -= len(p[j]) - 1\n else:\n print(p[j][0:t])\n sys.exit()\n K = t - 1\n", "FL_content": "\n import sys\n s = input()\n K = int(input())\n \n a_list = sorted(set(s))\n for i in a_list:\n if K == 1:\n print(i)\n sys.exit()\n p = []\n for j, x in enumerate(s):\n if x == i:\n p.append(s[j:min(j+K,len(s))])\n p.sort()\n- print(p)\n t = K\n for j in range(len(p)):\n if j != len(p) - 1:\n if p[j] == p[j+1][0:len(p[j])]:\n continue\n if len(p[j]) < t:\n t -= len(p[j]) - 1\n else:\n print(p[j][0:t])\n sys.exit()\n K = t - 1\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 26 }, { "user_id": "u881816188", "problem_id": "p04044", "submission1_id": "s672205061-FL", "submission2_id": "s830177267", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,l=map(int,input().split())\ns=[str(input()) for _ in range(n)]\nsort_s=sorted(s)\n\nprint(''.join(s))", "code2": "n,l=map(int,input().split())\ns=[str(input()) for _ in range(n)]\nsort_s=sorted(s)\n\nprint(''.join(sort_s))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566848922", "date2": "1566849014", "bleu_score": "0.9437719421410621", "code1_test_status": [0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0], "code1_test_score": 16, "total_score": 101, "input": "3 3\ncxx\naxx\nxxd\n", "actual_output": "cxxaxxxxd\n", "expected_output": "axxcxxxxd\n\n", "anno_code": ["n,l=map(int,input().split()) # (0): n=3, l=3\ns=[str(input()) for _ in range(n)] # (1): s=['cxx', 'axx', 'xxd']\nsort_s=sorted(s) # (2): sort_s=['axx', 'cxx', 'xxd']\n\nprint(''.join(s))"], "anno_status": [true], "diff_content": " n,l=map(int,input().split())\n s=[str(input()) for _ in range(n)]\n sort_s=sorted(s)\n \n-print(''.join(s))\n+print(''.join(sort_s))\n", "FL_content": "\n n,l=map(int,input().split())\n s=[str(input()) for _ in range(n)]\n-sort_s=sorted(s)\n \n print(''.join(s))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u201928947", "problem_id": "p03380", "submission1_id": "s500887467-FL", "submission2_id": "s881220664", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = sorted(list(map(int,input().split())))\nx = a.pop()\ny = a[0]\nm = abs(x/2 - a[0])\nfor i in range(1,n-1):\n if abs(x/2-a[i]) < m:\n y = a[i]\nprint(x,y)\n ", "code2": "n = int(input())\na = sorted(list(map(int,input().split())))\nx = a.pop()\ny = a[0]\nm = abs(x/2 - a[0])\nfor i in range(1,n-1):\n if abs(x/2-a[i]) < m:\n y = a[i]\n m = abs(x/2-a[i])\nprint(x,y)\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586819050", "date2": "1586819349", "bleu_score": "0.8704230326955802", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 92, "total_score": 100, "input": "5\n2 11 1 12 15\n", "actual_output": "15 12\n", "expected_output": "15 11\n\n", "anno_code": ["n = int(input()) # (0): n=5\na = sorted(list(map(int,input().split()))) # (1): a=[1, 2, 11, 12, 15]\nx = a.pop() # (2): a=[1, 2, 11, 12], x=15\ny = a[0] # (3): y=1\nm = abs(x/2 - a[0]) # (4): m=6.5\nfor i in range(1,n-1): # (5): i=1 (8): i=2 ... (14): NO CHANGE\n if abs(x/2-a[i]) < m: # (6): NO CHANGE (9): NO CHANGE (12): NO CHANGE\n y = a[i] # (7): y=2 (10): y=11 (13): y=12\nprint(x,y)\n "], "anno_status": [true], "diff_content": " n = int(input())\n a = sorted(list(map(int,input().split())))\n x = a.pop()\n y = a[0]\n m = abs(x/2 - a[0])\n for i in range(1,n-1):\n if abs(x/2-a[i]) < m:\n y = a[i]\n+ m = abs(x/2-a[i])\n print(x,y)\n \n", "FL_content": "\n n = int(input())\n a = sorted(list(map(int,input().split())))\n x = a.pop()\n y = a[0]\n m = abs(x/2 - a[0])\n-for i in range(1,n-1):\n if abs(x/2-a[i]) < m:\n y = a[i]\n print(x,y)\n- \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u682153677", "problem_id": "p02415", "submission1_id": "s604130553-FL", "submission2_id": "s027995764", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nchar = input()\n\nchar.swapcase()\n\nprint(char)\n", "code2": "\n\nchar = input()\nprint(char.swapcase())\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1523707138", "date2": "1523707194", "bleu_score": "0.7940125721212544", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "HAg,S A-IQTH AKK@YPJRODBN BKWUD1Q\n", "actual_output": "HAg,S A-IQTH AKK@YPJRODBN BKWUD1Q\n", "expected_output": "haG,s a-iqth akk@ypjrodbn bkwud1q\n\n", "anno_code": ["\n\nchar = input() # (0): char=HAg,S A-IQTH AKK@YPJRODBN BKWUD1Q\n\nchar.swapcase() # (1): NO CHANGE\n\nprint(char)\n"], "anno_status": [true], "diff_content": " \n \n char = input()\n-\n-char.swapcase()\n-\n-print(char)\n+print(char.swapcase())\n \n", "FL_content": "\n \n \n char = input()\n \n char.swapcase()\n \n-print(char)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u891946219", "problem_id": "p03139", "submission1_id": "s881976371-FL", "submission2_id": "s453687838", "status1": "Wrong Answer", "status2": "Accepted", "code1": "if __name__ == '__main__':\n n, a, b = input().split()\n N, A, B = int(n), int(a), int(b)\n\n ans_max = min(A, B)\n\n n_mid = N / 2\n if A <= (n_mid) and B <= (n_mid):\n ans_min = 0\n else:\n ans_min = max((A - n_mid) + (B - n_mid), 0)\n\n print('{0} {1}'.format(ans_max, ans_min))\n", "code2": "if __name__ == '__main__':\n n, a, b = input().split()\n N, A, B = int(n), int(a), int(b)\n\n ans_max = min(A, B)\n\n if (A + B) <= N:\n ans_min = 0\n else:\n ans_min = max((A + B - N), 0)\n\n print('{0} {1}'.format(ans_max, ans_min))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1548647519", "date2": "1548647932", "bleu_score": "0.785504345005853", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 7, "total_score": 81, "input": "000 101 100\n", "actual_output": "100 201.0\n", "expected_output": "100 201\n\n", "anno_code": ["if __name__ == '__main__':\n n, a, b = input().split()\n N, A, B = int(n), int(a), int(b)\n\n ans_max = min(A, B)\n\n n_mid = N / 2\n if A <= (n_mid) and B <= (n_mid):\n ans_min = 0\n else:\n ans_min = max((A - n_mid) + (B - n_mid), 0)\n\n print('{0} {1}'.format(ans_max, ans_min))\n"], "anno_status": [true], "diff_content": " if __name__ == '__main__':\n n, a, b = input().split()\n N, A, B = int(n), int(a), int(b)\n \n ans_max = min(A, B)\n \n- n_mid = N / 2\n- if A <= (n_mid) and B <= (n_mid):\n+ if (A + B) <= N:\n ans_min = 0\n else:\n- ans_min = max((A - n_mid) + (B - n_mid), 0)\n+ ans_min = max((A + B - N), 0)\n \n print('{0} {1}'.format(ans_max, ans_min))\n \n", "FL_content": "\n if __name__ == '__main__':\n n, a, b = input().split()\n N, A, B = int(n), int(a), int(b)\n \n ans_max = min(A, B)\n \n n_mid = N / 2\n if A <= (n_mid) and B <= (n_mid):\n ans_min = 0\n else:\n- ans_min = max((A - n_mid) + (B - n_mid), 0)\n \n print('{0} {1}'.format(ans_max, ans_min))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u629276590", "problem_id": "p03433", "submission1_id": "s286307275-FL", "submission2_id": "s630122796", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=int(input())\n\nif n%500>a:\n print(\"NO\")\nelse:\n print(\"YES\")", "code2": "n=int(input())\na=int(input())\n\nif n%500>a:\n print(\"No\")\nelse:\n print(\"Yes\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591581656", "date2": "1591581842", "bleu_score": "0.926984400216861", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "2018\n113\n", "actual_output": "YES\n", "expected_output": "Yes\n\n", "anno_code": ["n=int(input()) # (0): n=2018\na=int(input()) # (1): a=113\n\nif n%500>a: # (2): NO CHANGE\n print(\"NO\")\nelse:\n print(\"YES\")"], "anno_status": [true], "diff_content": " n=int(input())\n a=int(input())\n \n if n%500>a:\n- print(\"NO\")\n+ print(\"No\")\n else:\n- print(\"YES\")\n+ print(\"Yes\")\n", "FL_content": "\n n=int(input())\n a=int(input())\n \n if n%500>a:\n- print(\"NO\")\n else:\n- print(\"YES\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u106181248", "problem_id": "p03139", "submission1_id": "s411475446-FL", "submission2_id": "s069987611", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y, z = map(int,input().split())\nprint(min(y,z), max(0, x-y-z))", "code2": "x, y, z = map(int,input().split())\nprint(min(y,z), max(0,y+z-x))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591193584", "date2": "1591193625", "bleu_score": "0.9003193833354567", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 2, "total_score": 81, "input": "000 011 100\n", "actual_output": "11 0\n", "expected_output": "11 111\n\n", "anno_code": ["x, y, z = map(int,input().split()) # (0): x=0, y=11, z=100\nprint(min(y,z), max(0, x-y-z))"], "anno_status": [true], "diff_content": " x, y, z = map(int,input().split())\n-print(min(y,z), max(0, x-y-z))\n+print(min(y,z), max(0,y+z-x))\n", "FL_content": "\n x, y, z = map(int,input().split())\n-print(min(y,z), max(0, x-y-z))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 2 }, { "user_id": "u215065194", "problem_id": "p03712", "submission1_id": "s449841700-FL", "submission2_id": "s285875318", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w=map(int, input().split())\nar=[input() for _ in range(0,h)]\nprint(\"*\"*w+\"**\")\nfor _ in ar:\n print(\"*\"+_+\"*\")\nprint(\"*\"*w+\"**\")\n ", "code2": "h,w=map(int, input().split())\nar=[input() for _ in range(0,h)]\nprint(\"\nfor _ in ar:\n print(\"\nprint(\"\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1533777123", "date2": "1533777223", "bleu_score": "0.7226068467623483", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "1 3\n{\n", "actual_output": "*****\n*{*\n*****\n", "expected_output": "#####\n#{#\n#####\n\n", "anno_code": ["h,w=map(int, input().split()) # (0): h=1, w=3\nar=[input() for _ in range(0,h)] # (1): ar=['{']\nprint(\"*\"*w+\"**\") # (2): NO CHANGE\nfor _ in ar: # (3): _={ (5): NO CHANGE\n print(\"*\"+_+\"*\") # (4): NO CHANGE\nprint(\"*\"*w+\"**\")\n "], "anno_status": [true], "diff_content": " h,w=map(int, input().split())\n ar=[input() for _ in range(0,h)]\n-print(\"*\"*w+\"**\")\n+print(\"\n for _ in ar:\n- print(\"*\"+_+\"*\")\n-print(\"*\"*w+\"**\")\n- \n+ print(\"\n+print(\"\n+ \n", "FL_content": "\n h,w=map(int, input().split())\n ar=[input() for _ in range(0,h)]\n-print(\"*\"*w+\"**\")\n for _ in ar:\n- print(\"*\"+_+\"*\")\n-print(\"*\"*w+\"**\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u733738237", "problem_id": "p03254", "submission1_id": "s755385357-FL", "submission2_id": "s785652437", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,x=[int(i) for i in input().split()]\na = [int(x) for x in input().split()]\na.sort()\ncnt=0\nfor k in range(N):\n\tif x-a[k] >= 0:\n\t\tx -= a[k]\n\t\tcnt += 1\t\t\n\telse:\n\t\tbreak\nif x>0:\n\tcnt -= 1\nprint(cnt)", "code2": "N,x=[int(i) for i in input().split()]\na = [int(x) for x in input().split()]\na.sort()\ncnt=0\nfor k in a:\n\tx -= k\n\tif x < 0:\n\t\tbreak\n\tcnt +=1\nif x >0:\n\tcnt -=1\nprint(cnt)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567545225", "date2": "1567546446", "bleu_score": "0.7653821113663238", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1], "code1_test_score": 50, "total_score": 104, "input": "3 70\n29 39 3\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["N,x=[int(i) for i in input().split()] # (0): N=3, x=70\na = [int(x) for x in input().split()] # (1): a=[29, 39, 3]\na.sort() # (2): a=[3, 29, 39]\ncnt=0 # (3): cnt=0\nfor k in range(N): # (4): k=0 (8): k=1 (12): k=2\n\tif x-a[k] >= 0: # (5): NO CHANGE (9): NO CHANGE (13): NO CHANGE\n\t\tx -= a[k] # (6): x=67 (10): x=38\n\t\tcnt += 1\t\t # (7): cnt=1 (11): cnt=2\n\telse:\n\t\tbreak # (14): NO CHANGE\nif x>0: # (15): NO CHANGE\n\tcnt -= 1 # (16): cnt=1\nprint(cnt)"], "anno_status": [true], "diff_content": " N,x=[int(i) for i in input().split()]\n a = [int(x) for x in input().split()]\n a.sort()\n cnt=0\n-for k in range(N):\n-\tif x-a[k] >= 0:\n-\t\tx -= a[k]\n-\t\tcnt += 1\t\t\n-\telse:\n+for k in a:\n+\tx -= k\n+\tif x < 0:\n \t\tbreak\n-if x>0:\n-\tcnt -= 1\n+\tcnt +=1\n+if x >0:\n+\tcnt -=1\n print(cnt)\n", "FL_content": "\n N,x=[int(i) for i in input().split()]\n a = [int(x) for x in input().split()]\n a.sort()\n cnt=0\n for k in range(N):\n \tif x-a[k] >= 0:\n \t\tx -= a[k]\n \t\tcnt += 1\t\t\n \telse:\n \t\tbreak\n if x>0:\n \tcnt -= 1\n print(cnt)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u893844544", "problem_id": "p02369", "submission1_id": "s258449891-FL", "submission2_id": "s069879099", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nnv,ne = [int(i) for i in input().split()]\n\ng = [[] for i in range(nv)]\n\nfor i in range(ne):\n s,t = [int(j) for j in input().split()]\n g[s].append(t)\n\nvisited = [False for i in range(nv)]\nf = 0\n\ndef pursue_from(index, origin):\n global f\n\n if f == 1 or visited[index]:\n return\n\n visited[index] = True\n\n for next_index in g[index]:\n\n if next_index == 0:\n f = 1\n return\n pursue_from(next_index, origin)\n\nfor i in range(nv):\n pursue_from(i, i)\n\nprint(f)\n", "code2": "\nnv,ne = [int(i) for i in input().split()]\n\ng = [[] for i in range(nv)]\n\nfor i in range(ne):\n s,t = [int(j) for j in input().split()]\n g[s].append(t)\n\nvisited = []\nf = 0\n\ndef pursue_from(index, origin):\n\n if visited[index]:\n return\n\n visited[index] = True\n\n for next_index in g[index]:\n\n if next_index == origin:\n global f\n f = 1\n return\n pursue_from(next_index, origin)\n\nfor i in range(nv):\n visited = [False for i in range(nv)]\n\n pursue_from(i, i)\n\n if f == 1:\n break\n\nprint(f)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1524436507", "date2": "1524436957", "bleu_score": "0.8938303141596448", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 101, "total_score": 102, "input": "3 3\n0 2\n0 2\n1 0\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["\nnv,ne = [int(i) for i in input().split()] # (0): nv=3, ne=3\n\ng = [[] for i in range(nv)] # (1): g\n\nfor i in range(ne): # (2): i=0 (5): g, i=1 ... (11): g\n s,t = [int(j) for j in input().split()] # (3): s=0, t=2 (6): g (9): g, s=1, t=0\n g[s].append(t) # (4): g=[[2], [], []] (7): g (10): g\n\nvisited = [False for i in range(nv)] # (12): g, visited=[False, False, False]\nf = 0 # (13): g, f=0\n\ndef pursue_from(index, origin): # (14): g, pursue_from=\n global f\n\n if f == 1 or visited[index]: # (17): NO CHANGE (22): NO CHANGE ... (41): NO CHANGE\n return # (29): index=0, next_index=2 (42): nv=3, ne=3, g=[[2, 2], [0], []], i=2, s=1, t=0, visited=[True, True, True], f=1, pursue_from=\n\n visited[index] = True # (18): NO CHANGE (23): NO CHANGE (34): NO CHANGE\n\n for next_index in g[index]: # (19): next_index=2 (24): index=0, next_index=2 ... (35): next_index=0\n\n if next_index == 0: # (20): NO CHANGE (26): NO CHANGE (36): NO CHANGE\n f = 1 # (37): NO CHANGE\n return # (38): nv=3, ne=3, g=[[2, 2], [0], []], i=1, s=1, t=0, visited=[True, True, True], f=1, pursue_from=\n pursue_from(next_index, origin) # (21): index=2 (27): index=2\n\nfor i in range(nv): # (15): g, i=0 (31): g, i=1 ... (43): g\n pursue_from(i, i) # (16): index=0, origin=0 (32): index=1, origin=1 (40): index=2, origin=2\n\nprint(f)\n"], "anno_status": [true], "diff_content": " \n nv,ne = [int(i) for i in input().split()]\n \n g = [[] for i in range(nv)]\n \n for i in range(ne):\n s,t = [int(j) for j in input().split()]\n g[s].append(t)\n \n-visited = [False for i in range(nv)]\n+visited = []\n f = 0\n \n def pursue_from(index, origin):\n- global f\n \n- if f == 1 or visited[index]:\n+ if visited[index]:\n return\n \n visited[index] = True\n \n for next_index in g[index]:\n \n- if next_index == 0:\n+ if next_index == origin:\n+ global f\n f = 1\n return\n pursue_from(next_index, origin)\n \n for i in range(nv):\n+ visited = [False for i in range(nv)]\n+\n pursue_from(i, i)\n \n+ if f == 1:\n+ break\n+\n print(f)\n \n+\n", "FL_content": "\n \n nv,ne = [int(i) for i in input().split()]\n \n g = [[] for i in range(nv)]\n \n for i in range(ne):\n s,t = [int(j) for j in input().split()]\n g[s].append(t)\n \n visited = [False for i in range(nv)]\n f = 0\n \n def pursue_from(index, origin):\n global f\n \n if f == 1 or visited[index]:\n return\n \n visited[index] = True\n \n for next_index in g[index]:\n \n- if next_index == 0:\n f = 1\n return\n pursue_from(next_index, origin)\n \n for i in range(nv):\n pursue_from(i, i)\n \n print(f)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 32 }, { "user_id": "u276050131", "problem_id": "p02396", "submission1_id": "s148369650-FL", "submission2_id": "s303475134", "status1": "Wrong Answer", "status2": "Accepted", "code1": "i = 0\nlis = []\nwhile True:\n s = input()\n i += 1\n s = int(s)\n lis.append(s)\n if s == 0:\n break\n\nfor j in range(i):\n fmt = \"case {a}: {b}\"\n s = fmt.format(a = j,b = lis[j])\n print(s)", "code2": "i = 0\nlis = []\nwhile True:\n s = input()\n i += 1\n s = int(s)\n lis.append(s)\n if s == 0:\n break\n\nfor j in range(i - 1):\n fmt = \"Case {a}: {b}\"\n s = fmt.format(a = j + 1,b = lis[j])\n print(s)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1484783151", "date2": "1484783328", "bleu_score": "0.93771798432048", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3\n14\n2\n22\n-1\n35\n0\n", "actual_output": "case 0: 3\ncase 1: 14\ncase 2: 2\ncase 3: 22\ncase 4: -1\ncase 5: 35\ncase 6: 0\n", "expected_output": "Case 1: 3\nCase 2: 14\nCase 3: 2\nCase 4: 22\nCase 5: -1\nCase 6: 35\n\n", "anno_code": ["i = 0 # (0): i=0\nlis = [] # (1): lis=[]\nwhile True: # (2): NO CHANGE (8): NO CHANGE ... (38): NO CHANGE\n s = input() # (3): s=3 (9): s=14 ... (39): s=0\n i += 1 # (4): i=1 (10): i=2 ... (40): i=7\n s = int(s) # (5): s=3 (11): s=14 ... (41): s=0\n lis.append(s) # (6): lis=[3] (12): lis=[3, 14] ... (42): lis=[3, 14, 2, 22, -1, 35, 0]\n if s == 0: # (7): NO CHANGE (13): NO CHANGE ... (43): NO CHANGE\n break # (44): NO CHANGE\n\nfor j in range(i): # (45): j=0 (49): j=1 ... (69): j=6\n fmt = \"case {a}: {b}\" # (46): fmt=case {a}: {b} (50): NO CHANGE ... (70): NO CHANGE\n s = fmt.format(a = j,b = lis[j]) # (47): s=case 0: 3 (51): s=case 1: 14 ... (71): s=case 6: 0\n print(s) # (48): NO CHANGE (52): NO CHANGE ... (72): NO CHANGE\n"], "anno_status": [true], "diff_content": " i = 0\n lis = []\n while True:\n s = input()\n i += 1\n s = int(s)\n lis.append(s)\n if s == 0:\n break\n \n-for j in range(i):\n- fmt = \"case {a}: {b}\"\n- s = fmt.format(a = j,b = lis[j])\n+for j in range(i - 1):\n+ fmt = \"Case {a}: {b}\"\n+ s = fmt.format(a = j + 1,b = lis[j])\n print(s)\n", "FL_content": "\n i = 0\n lis = []\n while True:\n s = input()\n i += 1\n s = int(s)\n lis.append(s)\n if s == 0:\n break\n \n for j in range(i):\n- fmt = \"case {a}: {b}\"\n s = fmt.format(a = j,b = lis[j])\n print(s)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u288430479", "problem_id": "p03944", "submission1_id": "s843681800-FL", "submission2_id": "s565134836", "status1": "Wrong Answer", "status2": "Accepted", "code1": "w,h,n = map(int,input().split())\narea = h*w\na1=0\na2=w\na3=0\na4=h\nfor i in range(n):\n x,y,a = map(int,input().split())\n if a ==1:\n a1 = max(a1,x)\n elif a ==2:\n a2 = min(a2,x)\n elif a ==3:\n a3 = max(a3,y)\n elif a==4:\n a4 = min(a4,y)\n\narea -= a1*h + (w-a2)*h + a3*w + (h-a4)*w \nif area<=0:\n print(0)\nelse:\n print(area-(a1*(a3+(h-a4))+(10-a2)*(a3+(h-a4))))", "code2": "w,h,n = map(int,input().split())\narea = h*w\na1=0\na2=w\na3=0\na4=h\nfor i in range(n):\n x,y,a = map(int,input().split())\n if a ==1:\n a1 = max(a1,x)\n elif a ==2:\n a2 = min(a2,x)\n elif a ==3:\n a3 = max(a3,y)\n elif a==4:\n a4 = min(a4,y)\n\nif a1>=a2 or a3>=a4:\n print(0)\nelse:\n area -= a1*h + (w-a2)*h + a3*w + (h-a4)*w \n \n print(area+(a1*(a3+(h-a4))+(w-a2)*(a3+(h-a4))))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585179012", "date2": "1585191111", "bleu_score": "0.93081737671162", "code1_test_status": [1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0], "code1_test_score": 76, "total_score": 103, "input": "8 4 2\n0 1 3\n6 3 4\n", "actual_output": "12\n", "expected_output": "16\n\n", "anno_code": ["w,h,n = map(int,input().split()) # (0): w=8, h=4, n=2\narea = h*w # (1): area=32\na1=0 # (2): a1=0\na2=w # (3): a2=8\na3=0 # (4): a3=0\na4=h # (5): a4=4\nfor i in range(n): # (6): i=0 (12): i=1 (19): NO CHANGE\n x,y,a = map(int,input().split()) # (7): x=0, y=1, a=3 (13): x=6, y=3, a=4\n if a ==1: # (8): NO CHANGE (14): NO CHANGE\n a1 = max(a1,x)\n elif a ==2: # (9): NO CHANGE (15): NO CHANGE\n a2 = min(a2,x)\n elif a ==3: # (10): NO CHANGE (16): NO CHANGE\n a3 = max(a3,y) # (11): a3=1\n elif a==4: # (17): NO CHANGE\n a4 = min(a4,y) # (18): a4=3\n\narea -= a1*h + (w-a2)*h + a3*w + (h-a4)*w # (20): area=16\nif area<=0: # (21): NO CHANGE\n print(0)\nelse:\n print(area-(a1*(a3+(h-a4))+(10-a2)*(a3+(h-a4))))"], "anno_status": [true], "diff_content": " w,h,n = map(int,input().split())\n area = h*w\n a1=0\n a2=w\n a3=0\n a4=h\n for i in range(n):\n x,y,a = map(int,input().split())\n if a ==1:\n a1 = max(a1,x)\n elif a ==2:\n a2 = min(a2,x)\n elif a ==3:\n a3 = max(a3,y)\n elif a==4:\n a4 = min(a4,y)\n \n-area -= a1*h + (w-a2)*h + a3*w + (h-a4)*w \n-if area<=0:\n+if a1>=a2 or a3>=a4:\n print(0)\n else:\n- print(area-(a1*(a3+(h-a4))+(10-a2)*(a3+(h-a4))))\n+ area -= a1*h + (w-a2)*h + a3*w + (h-a4)*w \n+ \n+ print(area+(a1*(a3+(h-a4))+(w-a2)*(a3+(h-a4))))\n", "FL_content": "\n w,h,n = map(int,input().split())\n area = h*w\n a1=0\n a2=w\n a3=0\n a4=h\n for i in range(n):\n x,y,a = map(int,input().split())\n if a ==1:\n a1 = max(a1,x)\n elif a ==2:\n a2 = min(a2,x)\n elif a ==3:\n a3 = max(a3,y)\n elif a==4:\n a4 = min(a4,y)\n \n area -= a1*h + (w-a2)*h + a3*w + (h-a4)*w \n if area<=0:\n print(0)\n else:\n- print(area-(a1*(a3+(h-a4))+(10-a2)*(a3+(h-a4))))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u797673668", "problem_id": "p00687", "submission1_id": "s907080031-FL", "submission2_id": "s252178819", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n n, a, b = map(int, input().split())\n if not n:\n break\n dp = [False] * (n + abs(a - b))\n dp[1:n + 1] = [True] * n\n for i in range(n - min(a, b)):\n if not dp[i]:\n dp[i + a] = False\n dp[i + b] = False\n print(dp.count(True))", "code2": "while True:\n n, a, b = map(int, input().split())\n if not n:\n break\n if a > b:\n a, b = b, a\n dp = [False] * (n + b - a + 1)\n dp[1:n + 1] = [True] * n\n for i in range(n - a + 1):\n if not dp[i]:\n dp[i + a] = False\n dp[i + b] = False\n print(dp.count(True))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1488451548", "date2": "1488451897", "bleu_score": "0.8565783029605176", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1], "code1_test_score": 65, "total_score": 101, "input": "10 2 3\n28 3 5\n100 10 48\n0 0 0\n", "actual_output": "1\n4\n84\n", "expected_output": "1\n4\n83\n\n", "anno_code": ["while True: # (0): NO CHANGE (37): NO CHANGE ... (351): NO CHANGE\n n, a, b = map(int, input().split()) # (1): n=10, a=2, b=3 (38): n=28, a=3, b=5 ... (352): n=0, a=0, b=0\n if not n: # (2): NO CHANGE (39): NO CHANGE ... (353): NO CHANGE\n break\n dp = [False] * (n + abs(a - b)) # (3): dp=[False, False, False, False, False, False, False, False, False, False, False] (40): dp=[False, False, ..., False, False] (139): dp=[False, False, ..., False, False]\n dp[1:n + 1] = [True] * n # (4): dp=[False, True, True, True, True, True, True, True, True, True, True] (41): dp=[False, True, ..., True, False] (140): dp=[False, True, ..., False, False]\n for i in range(n - min(a, b)): # (5): i=0 (9): i=1 ... (349): NO CHANGE\n if not dp[i]: # (6): NO CHANGE (10): NO CHANGE ... (348): NO CHANGE\n dp[i + a] = False # (7): dp=[False, True, False, True, True, True, True, True, True, True, True] (13): dp=[False, True, False, False, False, True, True, True, True, True, True] ... (345): NO CHANGE\n dp[i + b] = False # (8): dp=[False, True, False, False, True, True, True, True, True, True, True] (14): dp=[False, True, False, False, False, False, True, True, True, True, True] ... (346): NO CHANGE\n print(dp.count(True)) # (36): NO CHANGE (135): NO CHANGE (350): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n n, a, b = map(int, input().split())\n if not n:\n break\n- dp = [False] * (n + abs(a - b))\n+ if a > b:\n+ a, b = b, a\n+ dp = [False] * (n + b - a + 1)\n dp[1:n + 1] = [True] * n\n- for i in range(n - min(a, b)):\n+ for i in range(n - a + 1):\n if not dp[i]:\n dp[i + a] = False\n dp[i + b] = False\n print(dp.count(True))\n", "FL_content": "\n while True:\n n, a, b = map(int, input().split())\n if not n:\n break\n dp = [False] * (n + abs(a - b))\n dp[1:n + 1] = [True] * n\n- for i in range(n - min(a, b)):\n if not dp[i]:\n dp[i + a] = False\n dp[i + b] = False\n print(dp.count(True))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u754022296", "problem_id": "p04008", "submission1_id": "s947234594-FL", "submission2_id": "s783745218", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nsys.setrecursionlimit(10**7)\nn, k = map(int, input().split())\nA = list(map(int, input().split()))\nans = 0\nif A[0] != 1:\n ans += 1\nC = [[] for _ in range(n+1)]\nP = [-1 for _ in range(n+1)]\nfor i, a in enumerate(A[1:], 2):\n C[a].append(i)\n P[i] = a\ndef dfs(v):\n global ans\n temp = 0\n for nv in C[v]:\n temp = max(temp, dfs(nv)+1)\n if v == 1:\n return\n if P[v] != 1 and temp == k-1:\n temp = 0\n ans += 1\n return temp\ndfs(1)\nprint(ans)", "code2": "import sys\ninput = sys.stdin.readline\nsys.setrecursionlimit(10**7)\n\nn, k = map(int, input().split())\nA = list(map(int, input().split()))\nans = 0\nif A[0] != 1:\n ans += 1\nC = [[] for _ in range(n+1)]\nP = [-1]*(n+1)\nfor i, a in enumerate(A[1:], 2):\n C[a].append(i)\n P[i] = a\ndef dfs(v):\n global ans\n temp = 0\n for nv in C[v]:\n temp = max(temp, dfs(nv)+1)\n if v == 1:\n return\n if P[v] != 1 and temp == k-1:\n temp = -1\n ans += 1\n return temp\ndfs(1)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1592374499", "date2": "1592374597", "bleu_score": "0.9543940545981936", "code1_test_status": [1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 85, "total_score": 97, "input": "8 2\n4 1 4 5 1 2 1 3\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\nsys.setrecursionlimit(10**7) # (1): NO CHANGE\nn, k = map(int, input().split()) # (2): n=8, k=2\nA = list(map(int, input().split())) # (3): A=[4, 1, 4, 5, 1, 2, 1, 3]\nans = 0 # (4): ans=0\nif A[0] != 1: # (5): NO CHANGE\n ans += 1 # (6): ans=1\nC = [[] for _ in range(n+1)] # (7): C\nP = [-1 for _ in range(n+1)] # (8): P=[-1, -1, -1, -1, -1, -1, -1, -1, -1]\nfor i, a in enumerate(A[1:], 2): # (9): i=2, a=1 (12): C, i=3, a=4 ... (30): C\n C[a].append(i) # (10): C (13): C ... (28): C\n P[i] = a # (11): C=[[], [2], [], [], [], [], [], [], []], P=[-1, -1, 1, -1, -1, -1, -1, -1, -1] (14): C=[[], [2], [], [], [3], [], [], [], []], P=[-1, -1, 1, 4, -1, -1, -1, -1, -1] ... (29): C, P=[-1, -1, 1, 4, 5, 1, 2, 1, 3]\ndef dfs(v): # (31): C, dfs=\n global ans\n temp = 0 # (33): temp=0 (36): temp=0 ... (76): temp=0\n for nv in C[v]: # (34): nv=2 (37): nv=6 ... (80): NO CHANGE\n temp = max(temp, dfs(nv)+1) # (35): v=2 (38): v=6 ... (75): v=7\n if v == 1: # (41): NO CHANGE (44): NO CHANGE ... (81): NO CHANGE\n return # (82): sys=, input=, n=8, k=2, A=[4, 1, 4, 5, 1, 2, 1, 3], ans=3, C=[[], [2, 5, 7], [6], [8], [3], [4], [], [], []], P=[-1, -1, 1, 4, 5, 1, 2, 1, 3], i=8, a=3, dfs=\n if P[v] != 1 and temp == k-1: # (42): v=2, temp=1, nv=6 (45): v=1, temp=2, nv=2 ... (79): v=1, temp=2, nv=7\n temp = 0 # (64): temp=0 (69): temp=0\n ans += 1 # (65): v=4, temp=1, nv=3 (70): v=5, temp=1, nv=4\n return temp\ndfs(1) # (32): v=1\nprint(ans)"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n sys.setrecursionlimit(10**7)\n+\n n, k = map(int, input().split())\n A = list(map(int, input().split()))\n ans = 0\n if A[0] != 1:\n ans += 1\n C = [[] for _ in range(n+1)]\n-P = [-1 for _ in range(n+1)]\n+P = [-1]*(n+1)\n for i, a in enumerate(A[1:], 2):\n C[a].append(i)\n P[i] = a\n def dfs(v):\n global ans\n temp = 0\n for nv in C[v]:\n temp = max(temp, dfs(nv)+1)\n if v == 1:\n return\n if P[v] != 1 and temp == k-1:\n- temp = 0\n+ temp = -1\n ans += 1\n return temp\n dfs(1)\n print(ans)\n", "FL_content": "\n import sys\n input = sys.stdin.readline\n sys.setrecursionlimit(10**7)\n n, k = map(int, input().split())\n A = list(map(int, input().split()))\n ans = 0\n if A[0] != 1:\n ans += 1\n C = [[] for _ in range(n+1)]\n P = [-1 for _ in range(n+1)]\n for i, a in enumerate(A[1:], 2):\n C[a].append(i)\n P[i] = a\n def dfs(v):\n global ans\n temp = 0\n for nv in C[v]:\n temp = max(temp, dfs(nv)+1)\n if v == 1:\n return\n- if P[v] != 1 and temp == k-1:\n temp = 0\n ans += 1\n return temp\n dfs(1)\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 26 }, { "user_id": "u507758132", "problem_id": "p02396", "submission1_id": "s971046815-FL", "submission2_id": "s162927977", "status1": "Wrong Answer", "status2": "Accepted", "code1": "cnt = 1\nc = int(input())\nwhile c != 0:\n print(cnt,c)\n c = int(input())\n cnt += 1\n", "code2": "cnt = 1\nc = int(input())\nwhile c != 0:\n print(\"Case {0}: {1}\".format(cnt,c))\n c = int(input())\n cnt += 1\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1521101684", "date2": "1521101863", "bleu_score": "0.7581719437752594", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3\n2\n19\n1\n13\n34\n0\n", "actual_output": "1 3\n2 2\n3 19\n4 1\n5 13\n6 34\n", "expected_output": "Case 1: 3\nCase 2: 2\nCase 3: 19\nCase 4: 1\nCase 5: 13\nCase 6: 34\n\n", "anno_code": ["cnt = 1 # (0): cnt=1\nc = int(input()) # (1): c=3\nwhile c != 0: # (2): NO CHANGE (6): NO CHANGE ... (22): NO CHANGE\n print(cnt,c) # (3): NO CHANGE (7): NO CHANGE ... (23): NO CHANGE\n c = int(input()) # (4): c=2 (8): c=19 ... (24): c=0\n cnt += 1 # (5): cnt=2 (9): cnt=3 ... (25): cnt=7\n"], "anno_status": [true], "diff_content": " cnt = 1\n c = int(input())\n while c != 0:\n- print(cnt,c)\n+ print(\"Case {0}: {1}\".format(cnt,c))\n c = int(input())\n cnt += 1\n \n", "FL_content": "\n cnt = 1\n c = int(input())\n while c != 0:\n- print(cnt,c)\n c = int(input())\n cnt += 1\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u672220554", "problem_id": "p03172", "submission1_id": "s964858608-FL", "submission2_id": "s521930773", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n for j in range(K):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n for j in range(K+1):\n dp[i+1][j] %= MOD\n\n return dp[N][K]\n\n\nprint(main())\n", "code2": "def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n for j in range(K+1):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n for j in range(K+1):\n dp[i+1][j] = dp[i+1][j] % MOD\n\n return dp[N][K]\n\n\nprint(main())\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1582135327", "date2": "1582148247", "bleu_score": "0.9677779747247063", "code1_test_status": [1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1], "code1_test_score": 5, "total_score": 103, "input": "4 000001\n101100 100110 101000 100000\n", "actual_output": "1\n", "expected_output": "4\n\n", "anno_code": ["def main(): # (0): main=\n N, K = map(int, input().split()) # (2): N=4, K=1\n if K == 0: # (3): NO CHANGE\n return 1\n A = list(map(int, input().split())) # (4): A=[101100, 100110, 101000, 100000]\n MOD = 10**9+7 # (5): MOD=1000000007\n dp = [[0]*(K+1) for _ in range(N+1)] # (6): dp\n dp[0][0] = 1 # (7): dp\n for i in range(N): # (8): i=0 (22): i=1 ... (50): i=3\n a = A[i] # (9): a=101100 (23): a=100110 ... (51): a=100000\n for j in range(K): # (10): j=0 (13): NO CHANGE ... (55): NO CHANGE\n dp[i+1][j] += dp[i][j] # (11): dp (25): dp ... (53): dp\n if j+a+1 <= K: # (12): NO CHANGE (26): NO CHANGE ... (54): NO CHANGE\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K): # (14): NO CHANGE (16): NO CHANGE ... (58): NO CHANGE\n dp[i+1][j+1] += dp[i+1][j] # (15): dp (29): dp ... (57): dp\n for j in range(K+1): # (17): NO CHANGE (19): j=1 ... (63): NO CHANGE\n dp[i+1][j] %= MOD # (18): NO CHANGE (20): NO CHANGE ... (62): NO CHANGE\n\n return dp[N][K]\n\n\nprint(main()) # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n- for j in range(K):\n+ for j in range(K+1):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n for j in range(K+1):\n- dp[i+1][j] %= MOD\n+ dp[i+1][j] = dp[i+1][j] % MOD\n \n return dp[N][K]\n \n \n print(main())\n \n", "FL_content": "\n def main():\n N, K = map(int, input().split())\n- if K == 0:\n- return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n for j in range(K):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n for j in range(K+1):\n dp[i+1][j] %= MOD\n \n return dp[N][K]\n \n \n print(main())\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u667458133", "problem_id": "p03739", "submission1_id": "s763310132-FL", "submission2_id": "s887713007", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\n\nresult = []\n\nfor i in range(1):\n num = 0\n r = 0\n for j in range(len(a)):\n num += a[j]\n if (j + i) % 2 == 0:\n if num <= 0:\n r -= num - 1\n num = 1\n\n else:\n if num >= 0:\n r += num + 1\n num = -1\n\n result.append(r)\n\nprint(min(result))\n", "code2": "n = int(input())\na = list(map(int, input().split()))\n\nresult = []\n\nfor i in range(2):\n num = 0\n r = 0\n for j in range(len(a)):\n num += a[j]\n if (j + i) % 2 == 0:\n if num <= 0:\n r -= num - 1\n num = 1\n\n else:\n if num >= 0:\n r += num + 1\n num = -1\n\n result.append(r)\n\nprint(min(result))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1543553161", "date2": "1543553286", "bleu_score": "0.9936986998662828", "code1_test_status": [1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 58, "total_score": 94, "input": "5\n35 -1 -1 1 -2\n", "actual_output": "45\n", "expected_output": "41\n\n", "anno_code": ["n = int(input()) # (0): n=5\na = list(map(int, input().split())) # (1): a=[35, -1, -1, 1, -2]\n\nresult = [] # (2): result=[]\n\nfor i in range(1): # (3): i=0 (36): NO CHANGE\n num = 0 # (4): num=0\n r = 0 # (5): r=0\n for j in range(len(a)): # (6): j=0 (10): j=1 ... (34): NO CHANGE\n num += a[j] # (7): num=35 (11): num=34 ... (29): num=-3\n if (j + i) % 2 == 0: # (8): NO CHANGE (12): NO CHANGE ... (30): NO CHANGE\n if num <= 0: # (9): NO CHANGE (19): NO CHANGE (31): NO CHANGE\n r -= num - 1 # (20): r=38 (32): r=45\n num = 1 # (21): num=1 (33): num=1\n\n else:\n if num >= 0: # (13): NO CHANGE (25): NO CHANGE\n r += num + 1 # (14): r=35 (26): r=41\n num = -1 # (15): num=-1 (27): num=-1\n\n result.append(r) # (35): result=[45]\n\nprint(min(result))\n"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n \n result = []\n \n-for i in range(1):\n+for i in range(2):\n num = 0\n r = 0\n for j in range(len(a)):\n num += a[j]\n if (j + i) % 2 == 0:\n if num <= 0:\n r -= num - 1\n num = 1\n \n else:\n if num >= 0:\n r += num + 1\n num = -1\n \n result.append(r)\n \n print(min(result))\n \n", "FL_content": "\n n = int(input())\n a = list(map(int, input().split()))\n \n result = []\n \n-for i in range(1):\n num = 0\n r = 0\n for j in range(len(a)):\n num += a[j]\n if (j + i) % 2 == 0:\n if num <= 0:\n r -= num - 1\n num = 1\n \n else:\n if num >= 0:\n r += num + 1\n num = -1\n \n result.append(r)\n \n print(min(result))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u537550206", "problem_id": "p03338", "submission1_id": "s994795223-FL", "submission2_id": "s578960158", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ns = input()\nch = []\nfor i in range(1, n):\n x = s[:i+1]\n y = s[i:len(s)]\n a = set(x)\n b = set(y)\n c = a.intersection(b)\n ch.append(len(c))\nprint(max(ch))", "code2": "n = int(input())\ns = input()\nch = []\nfor i in range(0, n):\n x = s[:i+1]\n y = s[i+1:len(s)]\n a = set(x)\n b = set(y)\n c = a.intersection(b)\n ch.append(len(c))\nprint(max(ch))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586026797", "date2": "1586027219", "bleu_score": "0.9691501468122027", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 69, "total_score": 103, "input": "10\naba`ababbb\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["n = int(input()) # (0): n=10\ns = input() # (1): s=aba`ababbb\nch = [] # (2): ch=[]\nfor i in range(1, n): # (3): i=1 (10): i=2 ... (66): NO CHANGE\n x = s[:i+1] # (4): x=ab (11): x=aba ... (60): x=aba`ababbb\n y = s[i:len(s)] # (5): y=ba`ababbb (12): y=a`ababbb ... (61): y=b\n a = set(x) # (6): a={'b', 'a'} (13): NO CHANGE ... (62): NO CHANGE\n b = set(y) # (7): b={'b', 'a', '`'} (14): NO CHANGE ... (63): NO CHANGE\n c = a.intersection(b) # (8): c={'b', 'a'} (15): NO CHANGE ... (64): NO CHANGE\n ch.append(len(c)) # (9): ch=[2] (16): ch=[2, 2] ... (65): ch=[2, 2, 3, 2, 2, 2, 1, 1, 1]\nprint(max(ch))"], "anno_status": [true], "diff_content": " n = int(input())\n s = input()\n ch = []\n-for i in range(1, n):\n+for i in range(0, n):\n x = s[:i+1]\n- y = s[i:len(s)]\n+ y = s[i+1:len(s)]\n a = set(x)\n b = set(y)\n c = a.intersection(b)\n ch.append(len(c))\n print(max(ch))\n", "FL_content": "\n n = int(input())\n s = input()\n ch = []\n-for i in range(1, n):\n x = s[:i+1]\n- y = s[i:len(s)]\n a = set(x)\n b = set(y)\n c = a.intersection(b)\n ch.append(len(c))\n print(max(ch))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u088552457", "problem_id": "p03419", "submission1_id": "s406965612-FL", "submission2_id": "s577528844", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\nif n == 1 and m == 1:\n print(1)\n exit(0)\n\nw = n - 2\nh = m - 2\nif w < 1 or h < 1:\n print(max(w, h))\n exit(0)\n \nprint(w*h)\n", "code2": "n, m = map(int, input().split())\nif n == 1 and m == 1:\n print(1)\n exit(0)\n\nw = n - 2\nh = m - 2\nif n == 1:\n print(h)\n exit(0)\nif m == 1:\n print(w)\n exit(0)\n \nprint(w*h)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584035509", "date2": "1584035643", "bleu_score": "0.7923756430152428", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 69, "total_score": 78, "input": "63 0\n", "actual_output": "61\n", "expected_output": "-122\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " n, m = map(int, input().split())\n if n == 1 and m == 1:\n print(1)\n exit(0)\n \n w = n - 2\n h = m - 2\n-if w < 1 or h < 1:\n- print(max(w, h))\n+if n == 1:\n+ print(h)\n+ exit(0)\n+if m == 1:\n+ print(w)\n exit(0)\n \n print(w*h)\n \n", "FL_content": "\n n, m = map(int, input().split())\n if n == 1 and m == 1:\n print(1)\n exit(0)\n \n-w = n - 2\n-h = m - 2\n-if w < 1 or h < 1:\n- print(max(w, h))\n exit(0)\n \n print(w*h)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u411881271", "problem_id": "p02237", "submission1_id": "s498068076-FL", "submission2_id": "s619581654", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\n\nA = [[0 for i in range(n)] for j in range(n)]\n\nfor i in range(n):\n\n\tB = input().split()\n\n\tif B[1]!=0:\n\t\tfor j in range(int(B[1])):\n\t\t\t\n\t\t\tA[i][int(B[2+j])-1] = 1\n\nfor i in range(n):\n\tfor j in range(n):\n\t\tif j!=n-1:\n\t\t\tprint(A[i][j], end=\" \")\n\t\telse:\n\t\t\tprint(end=\"\\n\")\n", "code2": "n = int(input())\n\nA = [[0 for i in range(n)] for j in range(n)]\n\nfor i in range(n):\n\n\tB = input().split()\n\n\tif B[1]!=0:\n\t\tfor j in range(int(B[1])):\n\t\t\t\n\t\t\tA[i][int(B[2+j])-1] = 1\n\nfor i in range(n):\n\tfor j in range(n):\n\t\tif j!=n-1:\n\t\t\tprint(A[i][j], end=\" \")\n\t\telse:\n\t\t\tprint(A[i][j], end=\"\\n\")\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1529482278", "date2": "1529482381", "bleu_score": "0.9643234071836896", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "4\n1 2 1 4\n2 1 1\n7 -1\n4 1 4\n", "actual_output": "1 0 0 \n1 0 0 \n0 0 0 \n0 0 0 \n", "expected_output": "1 0 0 1\n1 0 0 0\n0 0 0 0\n0 0 0 1\n\n", "anno_code": ["n = int(input()) # (0): n=4\n\nA = [[0 for i in range(n)] for j in range(n)] # (1): A\n\nfor i in range(n): # (2): i=0 (10): i=1 ... (26): NO CHANGE\n\n\tB = input().split() # (3): B=['1', '2', '1', '4'] (11): B=['2', '1', '1'] ... (21): B=['4', '1', '4']\n\n\tif B[1]!=0: # (4): NO CHANGE (12): NO CHANGE ... (22): NO CHANGE\n\t\tfor j in range(int(B[1])): # (5): j=0 (7): j=1 ... (25): NO CHANGE\n\t\t\t\n\t\t\tA[i][int(B[2+j])-1] = 1 # (6): A (8): A ... (24): A\n\nfor i in range(n): # (27): i=0 (41): i=1 ... (69): i=3\n\tfor j in range(n): # (28): NO CHANGE (31): j=1 ... (82): NO CHANGE\n\t\tif j!=n-1: # (29): NO CHANGE (32): NO CHANGE ... (80): NO CHANGE\n\t\t\tprint(A[i][j], end=\" \") # (30): NO CHANGE (33): NO CHANGE ... (78): NO CHANGE\n\t\telse:\n\t\t\tprint(end=\"\\n\") # (39): NO CHANGE (53): NO CHANGE ... (81): NO CHANGE\n"], "anno_status": [true], "diff_content": " n = int(input())\n \n A = [[0 for i in range(n)] for j in range(n)]\n \n for i in range(n):\n \n \tB = input().split()\n \n \tif B[1]!=0:\n \t\tfor j in range(int(B[1])):\n \t\t\t\n \t\t\tA[i][int(B[2+j])-1] = 1\n \n for i in range(n):\n \tfor j in range(n):\n \t\tif j!=n-1:\n \t\t\tprint(A[i][j], end=\" \")\n \t\telse:\n-\t\t\tprint(end=\"\\n\")\n+\t\t\tprint(A[i][j], end=\"\\n\")\n \n", "FL_content": "\n n = int(input())\n \n A = [[0 for i in range(n)] for j in range(n)]\n \n for i in range(n):\n \n \tB = input().split()\n \n \tif B[1]!=0:\n \t\tfor j in range(int(B[1])):\n \t\t\t\n \t\t\tA[i][int(B[2+j])-1] = 1\n \n for i in range(n):\n \tfor j in range(n):\n \t\tif j!=n-1:\n \t\t\tprint(A[i][j], end=\" \")\n \t\telse:\n \t\t\tprint(end=\"\\n\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u362127784", "problem_id": "p02639", "submission1_id": "s714891394-FL", "submission2_id": "s213001171", "status1": "Wrong Answer", "status2": "Accepted", "code1": "li = list(map(int,input().split()))\nfor i in range(0,5):\n if li[i] == 0:\n print(i)", "code2": "li = list(map(int,input().split()))\nfor i in range(0,5):\n if li[i] == 0:\n print(i + 1)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592182872", "date2": "1592182938", "bleu_score": "0.9462563573746322", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "0\n", "expected_output": "1\n", "anno_code": ["li = list(map(int,input().split())) # (0): li=[0, 2, 3, 4, 5]\nfor i in range(0,5): # (1): i=0 (4): i=1 ... (10): i=4\n if li[i] == 0: # (2): NO CHANGE (5): NO CHANGE ... (11): NO CHANGE\n print(i) # (3): NO CHANGE\n"], "anno_status": [true], "diff_content": " li = list(map(int,input().split()))\n for i in range(0,5):\n if li[i] == 0:\n- print(i)\n+ print(i + 1)\n", "FL_content": "\n li = list(map(int,input().split()))\n-for i in range(0,5):\n if li[i] == 0:\n print(i)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 4 }, { "user_id": "u634490486", "problem_id": "p02415", "submission1_id": "s794930503-FL", "submission2_id": "s244700311", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\n\ns = list(stdin.readline())\nprint(s)\nfor i in range(len(s)):\n if s[i].islower():\n s[i] = s[i].upper()\n elif s[i].isupper():\n s[i] = s[i].lower()\n\nprint(*s, sep=\"\")\n", "code2": "from sys import stdin\n\ns = list(stdin.readline())\nfor i in range(len(s)):\n if s[i].islower():\n s[i] = s[i].upper()\n elif s[i].isupper():\n s[i] = s[i].lower()\n\nprint(*s, sep=\"\", end=\"\")\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1546098484", "date2": "1546098595", "bleu_score": "0.955986868610191", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "R@g,H GQKT-@ AKK@YOISOCBN BPDUWJ.\n", "actual_output": "['R', '@', 'g', ',', 'H', ' ', 'G', 'Q', 'K', 'T', '-', '@', ' ', 'A', 'K', 'K', '@', 'Y', 'O', 'I', 'S', 'O', 'C', 'B', 'N', ' ', 'B', 'P', 'D', 'U', 'W', 'J', '.', '\\n']\nr@G,h gqkt-@ akk@yoisocbn bpduwj.\n\n", "expected_output": "r@G,h gqkt-@ akk@yoisocbn bpduwj.\n\n", "anno_code": ["from sys import stdin\n\ns = list(stdin.readline()) # (0): s=[R, @, ..., ., \n]\nprint(s) # (1): NO CHANGE\nfor i in range(len(s)): # (2): i=0 (6): i=1 ... (127): NO CHANGE\n if s[i].islower(): # (3): NO CHANGE (7): NO CHANGE ... (125): NO CHANGE\n s[i] = s[i].upper() # (11): s=[r, @, ..., ., \n]\n elif s[i].isupper(): # (4): NO CHANGE (8): NO CHANGE ... (126): NO CHANGE\n s[i] = s[i].lower() # (5): s=[r, @, ..., ., \n] (18): s=[r, @, ..., ., \n] ... (120): s=[r, @, ..., ., \n]\n\nprint(*s, sep=\"\")\n"], "anno_status": [true], "diff_content": " from sys import stdin\n \n s = list(stdin.readline())\n-print(s)\n for i in range(len(s)):\n if s[i].islower():\n s[i] = s[i].upper()\n elif s[i].isupper():\n s[i] = s[i].lower()\n \n-print(*s, sep=\"\")\n+print(*s, sep=\"\", end=\"\")\n \n", "FL_content": "\n from sys import stdin\n \n-s = list(stdin.readline())\n-print(s)\n for i in range(len(s)):\n if s[i].islower():\n s[i] = s[i].upper()\n elif s[i].isupper():\n s[i] = s[i].lower()\n \n print(*s, sep=\"\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u641357568", "problem_id": "p02408", "submission1_id": "s575429229-FL", "submission2_id": "s587747498", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\ncards_num = int(sys.stdin.readline())\ncards =[ card[:-1] for card in sys.stdin.readlines() ]\n\nprint(cards_num)\nprint(cards)\n\nall_cards = [ i + ' ' + str(j) for i in 'SHCD' for j in range(1,14) ]\n\nmissing_cards = [i for i in all_cards if not(i in cards) ]\n\nfor s in missing_cards:\n print(s,end='')\n", "code2": "import sys\n\ncards_num = int(sys.stdin.readline())\ncards =[ card[:-1] for card in sys.stdin.readlines() ]\n\nall_cards = [ i + ' ' + str(j) for i in 'SHCD' for j in range(1,14) ]\n\nmissing_cards = [i for i in all_cards if not(i in cards) ]\n\nfor s in missing_cards:\n print(s)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1520599080", "date2": "1520693150", "bleu_score": "0.8672830344410637", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "47\nS 10\nS 11\nS 12\nS 13\nH 1\nH 2\nS 6\nS 7\nS 8\nS 9\nH 5\nH 8\nH 9\nH 10\nH 11\nH 3\nH 6\nS 2\nS 3\nS 1\nS 5\nH 12\nH 13\nC 1\nC 2\nD 1\nD 2\nD 3\nD 4\nD 5\nD 6\nD 7\nC 3\nC 4\nC 5\nC 6\nC 7\nC 8\nC 9\nC 10\nC 11\nC 13\nD 9\nD 10\nD 11\nD 12\nD 13\n", "actual_output": "47\n['S 10', 'S 11', 'S 12', 'S 13', 'H 1', 'H 2', 'S 6', 'S 7', 'S 8', 'S 9', 'H 5', 'H 8', 'H 9', 'H 10', 'H 11', 'H 3', 'H 6', 'S 2', 'S 3', 'S 1', 'S 5', 'H 12', 'H 13', 'C 1', 'C 2', 'D 1', 'D 2', 'D 3', 'D 4', 'D 5', 'D 6', 'D 7', 'C 3', 'C 4', 'C 5', 'C 6', 'C 7', 'C 8', 'C 9', 'C 10', 'C 11', 'C 13', 'D 9', 'D 10', 'D 11', 'D 12', 'D 13']\nS 4H 4H 7C 12D 8", "expected_output": "S 4\nH 4\nH 7\nC 12\nD 8\n\n", "anno_code": ["import sys\n\ncards_num = int(sys.stdin.readline()) # (0): cards_num=47\ncards =[ card[:-1] for card in sys.stdin.readlines() ] # (1): cards=[S 10, S 11, ..., D 12, D 13]\n\nprint(cards_num) # (2): NO CHANGE\nprint(cards) # (3): NO CHANGE\n\nall_cards = [ i + ' ' + str(j) for i in 'SHCD' for j in range(1,14) ] # (4): all_cards=[S 1, S 2, ..., D 12, D 13]\n\nmissing_cards = [i for i in all_cards if not(i in cards) ] # (5): missing_cards=['S 4', 'H 4', 'H 7', 'C 12', 'D 8']\n\nfor s in missing_cards: # (6): s=S 4 (8): s=H 4 ... (14): s=D 8\n print(s,end='') # (7): NO CHANGE (9): NO CHANGE ... (15): NO CHANGE\n"], "anno_status": [true], "diff_content": " import sys\n \n cards_num = int(sys.stdin.readline())\n cards =[ card[:-1] for card in sys.stdin.readlines() ]\n \n-print(cards_num)\n-print(cards)\n-\n all_cards = [ i + ' ' + str(j) for i in 'SHCD' for j in range(1,14) ]\n \n missing_cards = [i for i in all_cards if not(i in cards) ]\n \n for s in missing_cards:\n- print(s,end='')\n+ print(s)\n \n", "FL_content": "\n import sys\n \n cards_num = int(sys.stdin.readline())\n cards =[ card[:-1] for card in sys.stdin.readlines() ]\n \n-print(cards_num)\n-print(cards)\n-\n all_cards = [ i + ' ' + str(j) for i in 'SHCD' for j in range(1,14) ]\n \n missing_cards = [i for i in all_cards if not(i in cards) ]\n \n for s in missing_cards:\n print(s,end='')\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u538808095", "problem_id": "p02909", "submission1_id": "s557431181-FL", "submission2_id": "s942213055", "status1": "Wrong Answer", "status2": "Accepted", "code1": "weatherlist = [\"Sunny\", \"Cloudy\", \"Rainy\"]\n\nweather = input().rstrip()\nweathernum = weatherlist.index(weather)\n\ntomorrownum = weathernum % 3\n\nprint(weatherlist[tomorrownum])", "code2": "weatherlist = [\"Sunny\", \"Cloudy\", \"Rainy\"]\n \nweather = input().rstrip()\nweathernum = weatherlist.index(weather)\n \ntomorrownum = (weathernum +1) % 3\n\nprint(weatherlist[tomorrownum])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568596136", "date2": "1568597355", "bleu_score": "0.9309229644941145", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "Rainy\n", "actual_output": "Rainy\n", "expected_output": "Sunny\n", "anno_code": ["weatherlist = [\"Sunny\", \"Cloudy\", \"Rainy\"] # (0): weatherlist=['Sunny', 'Cloudy', 'Rainy']\n\nweather = input().rstrip() # (1): weather=Rainy\nweathernum = weatherlist.index(weather) # (2): weathernum=2\n\ntomorrownum = weathernum % 3 # (3): tomorrownum=2\n\nprint(weatherlist[tomorrownum])"], "anno_status": [true], "diff_content": " weatherlist = [\"Sunny\", \"Cloudy\", \"Rainy\"]\n-\n+ \n weather = input().rstrip()\n weathernum = weatherlist.index(weather)\n-\n-tomorrownum = weathernum % 3\n+ \n+tomorrownum = (weathernum +1) % 3\n \n print(weatherlist[tomorrownum])\n", "FL_content": "\n weatherlist = [\"Sunny\", \"Cloudy\", \"Rainy\"]\n \n weather = input().rstrip()\n-weathernum = weatherlist.index(weather)\n \n tomorrownum = weathernum % 3\n \n print(weatherlist[tomorrownum])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u350064373", "problem_id": "p02420", "submission1_id": "s325884976-FL", "submission2_id": "s550826854", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n card = input()\n if card == \"-\":\n break\n for i in range(int(input())):\n h = int(input())\n card = card.lstrip(card[:h]) + card[:h]\n print(card)", "code2": "while True:\n card = input()\n if card == \"-\":\n break\n for i in range(int(input())):\n h = int(input())\n card = card[h:] + card[:h]\n print(card)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1502022130", "date2": "1502022891", "bleu_score": "0.9076780349496731", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0], "code1_test_score": 22, "total_score": 101, "input": "caaa\n3\n2\n0\n2\nvwxyz\n2\n1\n0\n-\n", "actual_output": "ca\nwxyzv\n", "expected_output": "caaa\nwxyzv\n\n", "anno_code": ["while True: # (0): NO CHANGE (14): NO CHANGE (25): NO CHANGE\n card = input() # (1): card=caaa (15): card=vwxyz (26): card=-\n if card == \"-\": # (2): NO CHANGE (16): NO CHANGE (27): NO CHANGE\n break\n for i in range(int(input())): # (3): i=0 (6): i=1 ... (23): NO CHANGE\n h = int(input()) # (4): h=2 (7): h=0 ... (21): h=0\n card = card.lstrip(card[:h]) + card[:h] # (5): card=ca (8): NO CHANGE ... (22): NO CHANGE\n print(card) # (13): NO CHANGE (24): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n card = input()\n if card == \"-\":\n break\n for i in range(int(input())):\n h = int(input())\n- card = card.lstrip(card[:h]) + card[:h]\n+ card = card[h:] + card[:h]\n print(card)\n", "FL_content": "\n while True:\n card = input()\n if card == \"-\":\n break\n for i in range(int(input())):\n h = int(input())\n- card = card.lstrip(card[:h]) + card[:h]\n print(card)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u341543478", "problem_id": "p03377", "submission1_id": "s391093766-FL", "submission2_id": "s303044413", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, x = list(map(int, input().split()))\n\nif (a <= x):\n if x-a at 0x0000021BE6D69BD0>, randint=>\nfrom random import randint\nmod=1370757747362922367 # (1): mod=1370757747362922367\nrr=randint(2,mod-2) # (2): rr=19366531371356330\nn=int(input()) # (3): n=3\nss=[input()[::-1]for _ in range(n)] # (4): ss=['yxxbad', 'wzc', 'aab']\nss.sort(key=len) # (5): ss=['wzc', 'aab', 'yxxbad']\nd={} # (6): d={}\nans=0 # (7): ans=0\nfor s in ss: # (8): s=wzc (31): s=aab ... (125): NO CHANGE\n a=ord(s[-1])-97 # (9): a=2 (32): a=1 (55): a=3\n r=1 # (10): r=1 (33): r=1 (56): r=1\n h=0 # (11): h=0 (34): h=0 (57): NO CHANGE\n y=[0]*26 # (12): y=[0, 0, ..., 0, 0] (35): NO CHANGE (58): NO CHANGE\n for t in s[:-1]: # (13): t=w (20): t=z ... (121): NO CHANGE\n b=ord(t)-97 # (14): b=22 (21): b=25 ... (115): b=0\n if h in d: # (15): NO CHANGE (22): NO CHANGE ... (116): NO CHANGE\n for i in range(26):y[i]+=d[h][i] # (62): i=0 (63): y=[0, 1, ..., 0, 0], i=1 ... (88): NO CHANGE\n ans+=y[b] # (16): NO CHANGE (23): NO CHANGE ... (117): NO CHANGE\n y[b]=0 # (17): NO CHANGE (24): NO CHANGE ... (118): NO CHANGE\n h=(h+b*r)%mod # (18): h=22 (25): h=484163284283908272 ... (119): NO CHANGE\n r=r*rr%mod # (19): r=19366531371356330 (26): r=1212287414521617869 ... (120): r=362541714568733079\n ans+=y[a] # (28): NO CHANGE (51): NO CHANGE (122): NO CHANGE\n if h not in d:d[h]=[0]*26 # (29): d={484163284283908272: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (52): d={484163284283908272: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 0: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (123): d={484163284283908272: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 0: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 214369505576812810: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\n d[h][a]+=1 # (30): d={484163284283908272: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (53): d={484163284283908272: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 0: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (124): d={484163284283908272: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 0: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 214369505576812810: [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\nprint(ans)"], "anno_status": [false], "diff_content": " import sys\n input = lambda: sys.stdin.readline().rstrip()\n-from random import randint\n-mod=1370757747362922367\n-rr=randint(2,mod-2)\n+m=2**150-1\n n=int(input())\n ss=[input()[::-1]for _ in range(n)]\n ss.sort(key=len)\n d={}\n ans=0\n for s in ss:\n a=ord(s[-1])-97\n r=1\n h=0\n y=[0]*26\n for t in s[:-1]:\n b=ord(t)-97\n if h in d:\n for i in range(26):y[i]+=d[h][i]\n ans+=y[b]\n y[b]=0\n- h=(h+b*r)%mod\n- r=r*rr%mod\n+ h=(h*71+b+135)&m\n ans+=y[a]\n if h not in d:d[h]=[0]*26\n d[h][a]+=1\n print(ans)\n", "FL_content": "\n import sys\n input = lambda: sys.stdin.readline().rstrip()\n from random import randint\n-mod=1370757747362922367\n-rr=randint(2,mod-2)\n n=int(input())\n ss=[input()[::-1]for _ in range(n)]\n ss.sort(key=len)\n d={}\n ans=0\n for s in ss:\n a=ord(s[-1])-97\n r=1\n h=0\n y=[0]*26\n for t in s[:-1]:\n b=ord(t)-97\n if h in d:\n for i in range(26):y[i]+=d[h][i]\n ans+=y[b]\n y[b]=0\n h=(h+b*r)%mod\n r=r*rr%mod\n ans+=y[a]\n if h not in d:d[h]=[0]*26\n d[h][a]+=1\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u126823513", "problem_id": "p03523", "submission1_id": "s791167387-FL", "submission2_id": "s603102942", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\nif s.replace(\"A\", \"\") == 'AKIHABARA'.replace(\"A\", \"\"):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n", "code2": "import re\n\ns = input()\n\n\nif re.match('A?KIHA?BA?RA?$', s):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569721026", "date2": "1569721878", "bleu_score": "0.6034728463715504", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 101, "total_score": 102, "input": "AAKIAHBAARA\n", "actual_output": "YES\n", "expected_output": "NO\n", "anno_code": ["s = input() # (0): s=AAKIAHBAARA\n\nif s.replace(\"A\", \"\") == 'AKIHABARA'.replace(\"A\", \"\"): # (1): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n"], "anno_status": [true], "diff_content": "+import re\n+\n s = input()\n \n-if s.replace(\"A\", \"\") == 'AKIHABARA'.replace(\"A\", \"\"):\n+\n+if re.match('A?KIHA?BA?RA?$', s):\n print(\"YES\")\n else:\n print(\"NO\")\n \n \n \n", "FL_content": "\n s = input()\n \n-if s.replace(\"A\", \"\") == 'AKIHABARA'.replace(\"A\", \"\"):\n print(\"YES\")\n else:\n print(\"NO\")\n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u927534107", "problem_id": "p03147", "submission1_id": "s136156767-FL", "submission2_id": "s090586892", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ns = list(map(int,input().split()))\ns = [i-1 for i in s]\nans = 0\nwhile(sum(s)!=-n):\n s_new=[i.replace(\"-1\",\"a\") for i in map(str,s)]\n print(s_new)\n s_join = ''.join(s_new)\n non = s_join.split(\"a\")\n num = len([x for x in non if x])\n ans += num\n s = [max(i-1,-1) for i in s]\nprint(ans)", "code2": "n = int(input())\ns = list(map(int,input().split()))\ns = [i-1 for i in s]\nans = 0\nwhile(sum(s)!=-n):\n s_new=[i.replace(\"-1\",\"a\") for i in map(str,s)]\n s_join = ''.join(s_new)\n non = s_join.split(\"a\")\n num = len([x for x in non if x])\n ans += num\n s = [max(i-1,-1) for i in s]\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1561366472", "date2": "1561366565", "bleu_score": "0.945439282244647", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 99, "input": "8\n4 65 136 0 23 151 22 111\n", "actual_output": "['3', '64', '135', 'a', '22', '150', '21', '110']\n['2', '63', '134', 'a', '21', '149', '20', '109']\n['1', '62', '133', 'a', '20', '148', '19', '108']\n['0', '61', '132', 'a', '19', '147', '18', '107']\n['a', '60', '131', 'a', '18', '146', '17', '106']\n['a', '59', '130', 'a', '17', '145', '16', '105']\n['a', '58', '129', 'a', '16', '144', '15', '104']\n['a', '57', '128', 'a', '15', '143', '14', '103']\n['a', '56', '127', 'a', '14', '142', '13', '102']\n['a', '55', '126', 'a', '13', '141', '12', '101']\n['a', '54', '125', 'a', '12', '140', '11', '100']\n['a', '53', '124', 'a', '11', '139', '10', '99']\n['a', '52', '123', 'a', '10', '138', '9', '98']\n['a', '51', '122', 'a', '9', '137', '8', '97']\n['a', '50', '121', 'a', '8', '136', '7', '96']\n['a', '49', '120', 'a', '7', '135', '6', '95']\n['a', '48', '119', 'a', '6', '134', '5', '94']\n['a', '47', '118', 'a', '5', '133', '4', '93']\n['a', '46', '117', 'a', '4', '132', '3', '92']\n['a', '45', '116', 'a', '3', '131', '2', '91']\n['a', '44', '115', 'a', '2', '130', '1', '90']\n['a', '43', '114', 'a', '1', '129', '0', '89']\n['a', '42', '113', 'a', '0', '128', 'a', '88']\n['a', '41', '112', 'a', 'a', '127', 'a', '87']\n['a', '40', '111', 'a', 'a', '126', 'a', '86']\n['a', '39', '110', 'a', 'a', '125', 'a', '85']\n['a', '38', '109', 'a', 'a', '124', 'a', '84']\n['a', '37', '108', 'a', 'a', '123', 'a', '83']\n['a', '36', '107', 'a', 'a', '122', 'a', '82']\n['a', '35', '106', 'a', 'a', '121', 'a', '81']\n['a', '34', '105', 'a', 'a', '120', 'a', '80']\n['a', '33', '104', 'a', 'a', '119', 'a', '79']\n['a', '32', '103', 'a', 'a', '118', 'a', '78']\n['a', '31', '102', 'a', 'a', '117', 'a', '77']\n['a', '30', '101', 'a', 'a', '116', 'a', '76']\n['a', '29', '100', 'a', 'a', '115', 'a', '75']\n['a', '28', '99', 'a', 'a', '114', 'a', '74']\n['a', '27', '98', 'a', 'a', '113', 'a', '73']\n['a', '26', '97', 'a', 'a', '112', 'a', '72']\n['a', '25', '96', 'a', 'a', '111', 'a', '71']\n['a', '24', '95', 'a', 'a', '110', 'a', '70']\n['a', '23', '94', 'a', 'a', '109', 'a', '69']\n['a', '22', '93', 'a', 'a', '108', 'a', '68']\n['a', '21', '92', 'a', 'a', '107', 'a', '67']\n['a', '20', '91', 'a', 'a', '106', 'a', '66']\n['a', '19', '90', 'a', 'a', '105', 'a', '65']\n['a', '18', '89', 'a', 'a', '104', 'a', '64']\n['a', '17', '88', 'a', 'a', '103', 'a', '63']\n['a', '16', '87', 'a', 'a', '102', 'a', '62']\n['a', '15', '86', 'a', 'a', '101', 'a', '61']\n['a', '14', '85', 'a', 'a', '100', 'a', '60']\n['a', '13', '84', 'a', 'a', '99', 'a', '59']\n['a', '12', '83', 'a', 'a', '98', 'a', '58']\n['a', '11', '82', 'a', 'a', '97', 'a', '57']\n['a', '10', '81', 'a', 'a', '96', 'a', '56']\n['a', '9', '80', 'a', 'a', '95', 'a', '55']\n['a', '8', '79', 'a', 'a', '94', 'a', '54']\n['a', '7', '78', 'a', 'a', '93', 'a', '53']\n['a', '6', '77', 'a', 'a', '92', 'a', '52']\n['a', '5', '76', 'a', 'a', '91', 'a', '51']\n['a', '4', '75', 'a', 'a', '90', 'a', '50']\n['a', '3', '74', 'a', 'a', '89', 'a', '49']\n['a', '2', '73', 'a', 'a', '88', 'a', '48']\n['a', '1', '72', 'a', 'a', '87', 'a', '47']\n['a', '0', '71', 'a', 'a', '86', 'a', '46']\n['a', 'a', '70', 'a', 'a', '85', 'a', '45']\n['a', 'a', '69', 'a', 'a', '84', 'a', '44']\n['a', 'a', '68', 'a', 'a', '83', 'a', '43']\n['a', 'a', '67', 'a', 'a', '82', 'a', '42']\n['a', 'a', '66', 'a', 'a', '81', 'a', '41']\n['a', 'a', '65', 'a', 'a', '80', 'a', '40']\n['a', 'a', '64', 'a', 'a', '79', 'a', '39']\n['a', 'a', '63', 'a', 'a', '78', 'a', '38']\n['a', 'a', '62', 'a', 'a', '77', 'a', '37']\n['a', 'a', '61', 'a', 'a', '76', 'a', '36']\n['a', 'a', '60', 'a', 'a', '75', 'a', '35']\n['a', 'a', '59', 'a', 'a', '74', 'a', '34']\n['a', 'a', '58', 'a', 'a', '73', 'a', '33']\n['a', 'a', '57', 'a', 'a', '72', 'a', '32']\n['a', 'a', '56', 'a', 'a', '71', 'a', '31']\n['a', 'a', '55', 'a', 'a', '70', 'a', '30']\n['a', 'a', '54', 'a', 'a', '69', 'a', '29']\n['a', 'a', '53', 'a', 'a', '68', 'a', '28']\n['a', 'a', '52', 'a', 'a', '67', 'a', '27']\n['a', 'a', '51', 'a', 'a', '66', 'a', '26']\n['a', 'a', '50', 'a', 'a', '65', 'a', '25']\n['a', 'a', '49', 'a', 'a', '64', 'a', '24']\n['a', 'a', '48', 'a', 'a', '63', 'a', '23']\n['a', 'a', '47', 'a', 'a', '62', 'a', '22']\n['a', 'a', '46', 'a', 'a', '61', 'a', '21']\n['a', 'a', '45', 'a', 'a', '60', 'a', '20']\n['a', 'a', '44', 'a', 'a', '59', 'a', '19']\n['a', 'a', '43', 'a', 'a', '58', 'a', '18']\n['a', 'a', '42', 'a', 'a', '57', 'a', '17']\n['a', 'a', '41', 'a', 'a', '56', 'a', '16']\n['a', 'a', '40', 'a', 'a', '55', 'a', '15']\n['a', 'a', '39', 'a', 'a', '54', 'a', '14']\n['a', 'a', '38', 'a', 'a', '53', 'a', '13']\n['a', 'a', '37', 'a', 'a', '52', 'a', '12']\n['a', 'a', '36', 'a', 'a', '51', 'a', '11']\n['a', 'a', '35', 'a', 'a', '50', 'a', '10']\n['a', 'a', '34', 'a', 'a', '49', 'a', '9']\n['a', 'a', '33', 'a', 'a', '48', 'a', '8']\n['a', 'a', '32', 'a', 'a', '47', 'a', '7']\n['a', 'a', '31', 'a', 'a', '46', 'a', '6']\n['a', 'a', '30', 'a', 'a', '45', 'a', '5']\n['a', 'a', '29', 'a', 'a', '44', 'a', '4']\n['a', 'a', '28', 'a', 'a', '43', 'a', '3']\n['a', 'a', '27', 'a', 'a', '42', 'a', '2']\n['a', 'a', '26', 'a', 'a', '41', 'a', '1']\n['a', 'a', '25', 'a', 'a', '40', 'a', '0']\n['a', 'a', '24', 'a', 'a', '39', 'a', 'a']\n['a', 'a', '23', 'a', 'a', '38', 'a', 'a']\n['a', 'a', '22', 'a', 'a', '37', 'a', 'a']\n['a', 'a', '21', 'a', 'a', '36', 'a', 'a']\n['a', 'a', '20', 'a', 'a', '35', 'a', 'a']\n['a', 'a', '19', 'a', 'a', '34', 'a', 'a']\n['a', 'a', '18', 'a', 'a', '33', 'a', 'a']\n['a', 'a', '17', 'a', 'a', '32', 'a', 'a']\n['a', 'a', '16', 'a', 'a', '31', 'a', 'a']\n['a', 'a', '15', 'a', 'a', '30', 'a', 'a']\n['a', 'a', '14', 'a', 'a', '29', 'a', 'a']\n['a', 'a', '13', 'a', 'a', '28', 'a', 'a']\n['a', 'a', '12', 'a', 'a', '27', 'a', 'a']\n['a', 'a', '11', 'a', 'a', '26', 'a', 'a']\n['a', 'a', '10', 'a', 'a', '25', 'a', 'a']\n['a', 'a', '9', 'a', 'a', '24', 'a', 'a']\n['a', 'a', '8', 'a', 'a', '23', 'a', 'a']\n['a', 'a', '7', 'a', 'a', '22', 'a', 'a']\n['a', 'a', '6', 'a', 'a', '21', 'a', 'a']\n['a', 'a', '5', 'a', 'a', '20', 'a', 'a']\n['a', 'a', '4', 'a', 'a', '19', 'a', 'a']\n['a', 'a', '3', 'a', 'a', '18', 'a', 'a']\n['a', 'a', '2', 'a', 'a', '17', 'a', 'a']\n['a', 'a', '1', 'a', 'a', '16', 'a', 'a']\n['a', 'a', '0', 'a', 'a', '15', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '14', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '13', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '12', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '11', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '10', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '9', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '8', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '7', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '6', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '5', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '4', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '3', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '2', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '1', 'a', 'a']\n['a', 'a', 'a', 'a', 'a', '0', 'a', 'a']\n376\n", "expected_output": "376\n\n", "anno_code": ["n = int(input()) # (0): n=8\ns = list(map(int,input().split())) # (1): s=[4, 65, 136, 0, 23, 151, 22, 111]\ns = [i-1 for i in s] # (2): s=[3, 64, 135, -1, 22, 150, 21, 110]\nans = 0 # (3): ans=0\nwhile(sum(s)!=-n): # (4): NO CHANGE (12): NO CHANGE ... (1212): NO CHANGE\n s_new=[i.replace(\"-1\",\"a\") for i in map(str,s)] # (5): s_new=['3', '64', '135', 'a', '22', '150', '21', '110'] (13): s_new=['2', '63', '134', 'a', '21', '149', '20', '109'] ... (1205): s_new=['a', 'a', 'a', 'a', 'a', '0', 'a', 'a']\n print(s_new) # (6): NO CHANGE (14): NO CHANGE ... (1206): NO CHANGE\n s_join = ''.join(s_new) # (7): s_join=364135a2215021110 (15): s_join=263134a2114920109 ... (1207): s_join=aaaaa0aa\n non = s_join.split(\"a\") # (8): non=['364135', '2215021110'] (16): non=['263134', '2114920109'] ... (1208): non=['', '', '', '', '', '0', '', '']\n num = len([x for x in non if x]) # (9): num=2 (17): NO CHANGE ... (1209): NO CHANGE\n ans += num # (10): ans=2 (18): ans=4 ... (1210): ans=376\n s = [max(i-1,-1) for i in s] # (11): s=[2, 63, 134, -1, 21, 149, 20, 109] (19): s=[1, 62, 133, -1, 20, 148, 19, 108] ... (1211): s=[-1, -1, -1, -1, -1, -1, -1, -1]\nprint(ans)"], "anno_status": [false], "diff_content": " n = int(input())\n s = list(map(int,input().split()))\n s = [i-1 for i in s]\n ans = 0\n while(sum(s)!=-n):\n s_new=[i.replace(\"-1\",\"a\") for i in map(str,s)]\n- print(s_new)\n s_join = ''.join(s_new)\n non = s_join.split(\"a\")\n num = len([x for x in non if x])\n ans += num\n s = [max(i-1,-1) for i in s]\n print(ans)\n", "FL_content": "\n n = int(input())\n s = list(map(int,input().split()))\n s = [i-1 for i in s]\n ans = 0\n while(sum(s)!=-n):\n s_new=[i.replace(\"-1\",\"a\") for i in map(str,s)]\n- print(s_new)\n s_join = ''.join(s_new)\n non = s_join.split(\"a\")\n num = len([x for x in non if x])\n ans += num\n s = [max(i-1,-1) for i in s]\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u707808519", "problem_id": "p02601", "submission1_id": "s252305097-FL", "submission2_id": "s041230857", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = map(int, input().split())\nK = int(input())\n\nwhile K > 0:\n if a > b:\n b *= 2\n elif b > c:\n c *= 2\n K -= 1\n\nif a < b < c:\n print('Yes')\nelse:\n print('No')", "code2": "a, b, c = map(int, input().split())\nK = int(input())\n\nwhile K > 0:\n if a >= b:\n b *= 2\n elif b >= c:\n c *= 2\n K -= 1\n\nif a < b < c:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595725680", "date2": "1595726585", "bleu_score": "0.9738865275645977", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 63, "total_score": 102, "input": "1 2 1\n9\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["a, b, c = map(int, input().split()) # (0): a=1, b=2, c=1\nK = int(input()) # (1): K=9\n\nwhile K > 0: # (2): NO CHANGE (7): NO CHANGE ... (39): NO CHANGE\n if a > b: # (3): NO CHANGE (8): NO CHANGE ... (36): NO CHANGE\n b *= 2\n elif b > c: # (4): NO CHANGE (9): NO CHANGE ... (37): NO CHANGE\n c *= 2 # (5): c=2\n K -= 1 # (6): K=8 (10): K=7 ... (38): K=0\n\nif a < b < c: # (40): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " a, b, c = map(int, input().split())\n K = int(input())\n \n while K > 0:\n- if a > b:\n+ if a >= b:\n b *= 2\n- elif b > c:\n+ elif b >= c:\n c *= 2\n K -= 1\n \n if a < b < c:\n print('Yes')\n else:\n print('No')\n", "FL_content": "\n a, b, c = map(int, input().split())\n K = int(input())\n \n while K > 0:\n if a > b:\n b *= 2\n elif b > c:\n c *= 2\n K -= 1\n \n-if a < b < c:\n print('Yes')\n else:\n print('No')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u996276765", "problem_id": "p03944", "submission1_id": "s805618159-FL", "submission2_id": "s037095733", "status1": "Wrong Answer", "status2": "Accepted", "code1": "W, H, N = map(int, input().split())\nx = [0] * N\ny = [0] * N\na = [0] * N\nx_min = 0\nx_max = W\ny_min = 0\ny_max = H\nfor i in range(N):\n x[i], y[i], a[i] = map(int, input().split())\nfor i in range(N):\n if x_max <= x_min or y_max <= y_min:\n print(0)\n break\n elif a[i] == 1:\n if x_min < x[i]:\n x_min = x[i]\n elif a[i] == 2:\n if x_max < x[i]:\n x_max = x[i]\n elif a[i] == 3:\n if y_min < x[i]:\n y_min = y[i]\n elif a[i] == 4:\n if y_max < x[i]:\n y_max = y[i]\nprint((x_max - x_min)*(y_max - y_min))", "code2": "W, H, N = map(int, input().split())\nx = [0] * N\ny = [0] * N\na = [0] * N\nx_min = 0\nx_max = W\ny_min = 0\ny_max = H\nfor i in range(N):\n x[i], y[i], a[i] = map(int, input().split())\nfor i in range(N):\n if a[i] == 1:\n if x_min < x[i]:\n x_min = x[i]\n elif a[i] == 2:\n if x_max > x[i]:\n x_max = x[i]\n elif a[i] == 3:\n if y_min < y[i]:\n y_min = y[i]\n elif a[i] == 4:\n if y_max > y[i]:\n y_max = y[i]\nif x_max <= x_min or y_max <= y_min:\n print(0)\nelse:\n print((x_max - x_min)*(y_max - y_min))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1545968419", "date2": "1545968788", "bleu_score": "0.9456439478536118", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0], "code1_test_score": 15, "total_score": 103, "input": "10 10 5\n1 6 1\n4 1 3\n6 9 4\n9 4 2\n3 1 3\n", "actual_output": "81\n", "expected_output": "64\n", "anno_code": ["W, H, N = map(int, input().split()) # (0): W=10, H=10, N=5\nx = [0] * N # (1): x=[0, 0, 0, 0, 0]\ny = [0] * N # (2): y=[0, 0, 0, 0, 0]\na = [0] * N # (3): a=[0, 0, 0, 0, 0]\nx_min = 0 # (4): x_min=0\nx_max = W # (5): x_max=10\ny_min = 0 # (6): y_min=0\ny_max = H # (7): y_max=10\nfor i in range(N): # (8): i=0 (10): i=1 ... (18): NO CHANGE\n x[i], y[i], a[i] = map(int, input().split()) # (9): x=[1, 0, 0, 0, 0], y=[6, 0, 0, 0, 0], a=[1, 0, 0, 0, 0] (11): x=[1, 4, 0, 0, 0], y=[6, 1, 0, 0, 0], a=[1, 3, 0, 0, 0] ... (17): x=[1, 4, 6, 9, 3], y=[6, 1, 9, 4, 1], a=[1, 3, 4, 2, 3]\nfor i in range(N): # (19): i=0 (24): i=1 ... (50): NO CHANGE\n if x_max <= x_min or y_max <= y_min: # (20): NO CHANGE (25): NO CHANGE ... (44): NO CHANGE\n print(0)\n break\n elif a[i] == 1: # (21): NO CHANGE (26): NO CHANGE ... (45): NO CHANGE\n if x_min < x[i]: # (22): NO CHANGE\n x_min = x[i] # (23): x_min=1\n elif a[i] == 2: # (27): NO CHANGE (34): NO CHANGE ... (46): NO CHANGE\n if x_max < x[i]: # (42): NO CHANGE\n x_max = x[i]\n elif a[i] == 3: # (28): NO CHANGE (35): NO CHANGE (47): NO CHANGE\n if y_min < x[i]: # (29): NO CHANGE (48): NO CHANGE\n y_min = y[i] # (30): y_min=1 (49): NO CHANGE\n elif a[i] == 4: # (36): NO CHANGE\n if y_max < x[i]: # (37): NO CHANGE\n y_max = y[i]\nprint((x_max - x_min)*(y_max - y_min))"], "anno_status": [false], "diff_content": " W, H, N = map(int, input().split())\n x = [0] * N\n y = [0] * N\n a = [0] * N\n x_min = 0\n x_max = W\n y_min = 0\n y_max = H\n for i in range(N):\n x[i], y[i], a[i] = map(int, input().split())\n for i in range(N):\n- if x_max <= x_min or y_max <= y_min:\n- print(0)\n- break\n- elif a[i] == 1:\n+ if a[i] == 1:\n if x_min < x[i]:\n x_min = x[i]\n elif a[i] == 2:\n- if x_max < x[i]:\n+ if x_max > x[i]:\n x_max = x[i]\n elif a[i] == 3:\n- if y_min < x[i]:\n+ if y_min < y[i]:\n y_min = y[i]\n elif a[i] == 4:\n- if y_max < x[i]:\n+ if y_max > y[i]:\n y_max = y[i]\n-print((x_max - x_min)*(y_max - y_min))\n+if x_max <= x_min or y_max <= y_min:\n+ print(0)\n+else:\n+ print((x_max - x_min)*(y_max - y_min))\n+\n", "FL_content": "\n W, H, N = map(int, input().split())\n x = [0] * N\n y = [0] * N\n a = [0] * N\n x_min = 0\n x_max = W\n y_min = 0\n y_max = H\n for i in range(N):\n x[i], y[i], a[i] = map(int, input().split())\n for i in range(N):\n- if x_max <= x_min or y_max <= y_min:\n print(0)\n break\n elif a[i] == 1:\n if x_min < x[i]:\n x_min = x[i]\n elif a[i] == 2:\n if x_max < x[i]:\n x_max = x[i]\n elif a[i] == 3:\n if y_min < x[i]:\n y_min = y[i]\n elif a[i] == 4:\n if y_max < x[i]:\n y_max = y[i]\n print((x_max - x_min)*(y_max - y_min))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u805716376", "problem_id": "p02420", "submission1_id": "s639450457-FL", "submission2_id": "s246393668", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while 1:\n a = input()\n if a == '-':\n break\n n = int(input())\n for i in range(n):\n h = int(input())\n a = a[h:] + a[:h]\n print(a)\n print(a)\n", "code2": "while 1:\n a = input()\n if a == '-':\n break\n n = int(input())\n for i in range(n):\n h = int(input())\n a = a[h:] + a[:h]\n print(a)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556724141", "date2": "1556724212", "bleu_score": "0.9015330854347995", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "aaac\n3\n1\n0\n2\nvyxyz\n2\n1\n5\n-\n", "actual_output": "aaca\naaca\ncaaa\ncaaa\nyxyzv\nyxyzv\nyxyzv\n", "expected_output": "caaa\nyxyzv\n\n", "anno_code": ["while 1: # (0): NO CHANGE (18): NO CHANGE (32): NO CHANGE\n a = input() # (1): a=aaac (19): a=vyxyz (33): a=-\n if a == '-': # (2): NO CHANGE (20): NO CHANGE (34): NO CHANGE\n break\n n = int(input()) # (3): n=3 (21): n=2\n for i in range(n): # (4): i=0 (8): i=1 ... (30): NO CHANGE\n h = int(input()) # (5): h=1 (9): h=0 ... (27): h=5\n a = a[h:] + a[:h] # (6): a=aaca (10): NO CHANGE ... (28): NO CHANGE\n print(a) # (7): NO CHANGE (11): NO CHANGE ... (29): NO CHANGE\n print(a) # (17): NO CHANGE (31): NO CHANGE\n"], "anno_status": [true], "diff_content": " while 1:\n a = input()\n if a == '-':\n break\n n = int(input())\n for i in range(n):\n h = int(input())\n a = a[h:] + a[:h]\n- print(a)\n print(a)\n \n", "FL_content": "\n while 1:\n a = input()\n if a == '-':\n break\n n = int(input())\n for i in range(n):\n h = int(input())\n a = a[h:] + a[:h]\n- print(a)\n- print(a)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u081847415", "problem_id": "p01968", "submission1_id": "s231581831-FL", "submission2_id": "s513497936", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nfrom collections import Counter\ndef inpl(): return tuple(map(int, input().split()))\n\nN = int(input())\nA = list(map(int, input().split()))\n\nC = Counter(A)\nif C[-2] % 2 == 0:\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2]\n print(len(ans))\n if len(ans):\n print(*ans, sep=\"\\n\")\nelif C[-1] > 0:\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2] + [A.index(-1) + 1]\n print(len(ans))\n if len(ans):\n print(*sorted(ans), sep=\"\\n\")\nelse:\n del A[-A[::-1].index(-2) - 1]\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2]\n print(len(ans))\n if len(ans):\n print(*ans, sep=\"\\n\")\n", "code2": "\nfrom collections import Counter\ndef inpl(): return tuple(map(int, input().split()))\n\nN = int(input())\nA = list(map(int, input().split()))\n\nC = Counter(A)\nif C[-2] % 2 == 0:\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2]\n print(len(ans))\n if len(ans):\n print(*ans, sep=\"\\n\")\nelif C[-1] > 0:\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2] + [A.index(-1) + 1]\n print(len(ans))\n if len(ans):\n print(*sorted(ans), sep=\"\\n\")\nelse:\n d = N -A[::-1].index(-2)\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2]\n del ans[ans.index(d)]\n print(len(ans))\n if len(ans):\n print(*ans, sep=\"\\n\")\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1522200494", "date2": "1522201360", "bleu_score": "0.9551191756652561", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 95, "total_score": 97, "input": "4\n0 -2 0 2\n", "actual_output": "1\n3\n", "expected_output": "1\n4\n\n", "anno_code": ["\nfrom collections import Counter\ndef inpl(): return tuple(map(int, input().split()))\n\nN = int(input()) # (0): N=4\nA = list(map(int, input().split())) # (1): A=[0, -2, 0, 2]\n\nC = Counter(A) # (2): C=Counter({0: 2, -2: 1, 2: 1})\nif C[-2] % 2 == 0: # (3): NO CHANGE\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2]\n print(len(ans))\n if len(ans):\n print(*ans, sep=\"\\n\")\nelif C[-1] > 0: # (4): NO CHANGE\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2] + [A.index(-1) + 1]\n print(len(ans))\n if len(ans):\n print(*sorted(ans), sep=\"\\n\")\nelse:\n del A[-A[::-1].index(-2) - 1] # (5): A=[0, 0, 2]\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2] # (6): ans=[3]\n print(len(ans)) # (7): NO CHANGE\n if len(ans): # (8): NO CHANGE\n print(*ans, sep=\"\\n\")\n"], "anno_status": [true], "diff_content": " \n from collections import Counter\n def inpl(): return tuple(map(int, input().split()))\n \n N = int(input())\n A = list(map(int, input().split()))\n \n C = Counter(A)\n if C[-2] % 2 == 0:\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2]\n print(len(ans))\n if len(ans):\n print(*ans, sep=\"\\n\")\n elif C[-1] > 0:\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2] + [A.index(-1) + 1]\n print(len(ans))\n if len(ans):\n print(*sorted(ans), sep=\"\\n\")\n else:\n- del A[-A[::-1].index(-2) - 1]\n+ d = N -A[::-1].index(-2)\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2]\n+ del ans[ans.index(d)]\n print(len(ans))\n if len(ans):\n print(*ans, sep=\"\\n\")\n \n", "FL_content": "\n \n from collections import Counter\n def inpl(): return tuple(map(int, input().split()))\n \n N = int(input())\n A = list(map(int, input().split()))\n \n C = Counter(A)\n if C[-2] % 2 == 0:\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2]\n print(len(ans))\n if len(ans):\n print(*ans, sep=\"\\n\")\n elif C[-1] > 0:\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2] + [A.index(-1) + 1]\n print(len(ans))\n if len(ans):\n print(*sorted(ans), sep=\"\\n\")\n else:\n- del A[-A[::-1].index(-2) - 1]\n ans = [i+1 for i, a in enumerate(A) if abs(a) == 2]\n print(len(ans))\n if len(ans):\n print(*ans, sep=\"\\n\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 25 }, { "user_id": "u027874809", "problem_id": "p02410", "submission1_id": "s288482567-FL", "submission2_id": "s392509213", "status1": "Wrong Answer", "status2": "Accepted", "code1": "vec1 = []\nvec2 = []\n\nn, m = map(int, input().split())\nfor x in range(1, n+1):\n vec1.append(list(map(int, input().split())))\n\nfor y in range(m):\n vec2.append(int(input()))\n\nfor j, z in zip(vec1, vec2):\n print(sum(j)+z)\n\n", "code2": "vec1 = []\nvec2 = []\n\nn, m = map(int, input().split())\nfor x in range(1, n+1):\n vec1.append(list(map(int, input().split())))\n\nfor y in range(m):\n vec2.append(int(input()))\n\nfor j in vec1:\n result = 0\n for w, z in zip(j, vec2):\n result += w * z\n print(result)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1522376291", "date2": "1522378419", "bleu_score": "0.7678749400261176", "code1_test_status": [0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 3, "total_score": 101, "input": "3 4\n0 1 0 1\n1 0 0 2\n8 1 1 0\n1\n2\n0\n0\n", "actual_output": "3\n5\n10\n", "expected_output": "2\n1\n10\n\n", "anno_code": ["vec1 = [] # (0): vec1=[]\nvec2 = [] # (1): vec2=[]\n\nn, m = map(int, input().split()) # (2): n=3, m=4\nfor x in range(1, n+1): # (3): x=1 (5): x=2 ... (9): NO CHANGE\n vec1.append(list(map(int, input().split()))) # (4): vec1=[[0, 1, 0, 1]] (6): vec1 (8): vec1\n\nfor y in range(m): # (10): y=0 (12): y=1 ... (18): NO CHANGE\n vec2.append(int(input())) # (11): vec2=[1] (13): vec2=[1, 2] ... (17): vec2=[1, 2, 0, 0]\n\nfor j, z in zip(vec1, vec2): # (19): j=[0, 1, 0, 1], z=1 (21): j=[1, 0, 0, 2], z=2 (23): j=[8, 1, 1, 0], z=0\n print(sum(j)+z) # (20): NO CHANGE (22): NO CHANGE (24): NO CHANGE\n\n"], "anno_status": [true], "diff_content": " vec1 = []\n vec2 = []\n \n n, m = map(int, input().split())\n for x in range(1, n+1):\n vec1.append(list(map(int, input().split())))\n \n for y in range(m):\n vec2.append(int(input()))\n \n-for j, z in zip(vec1, vec2):\n- print(sum(j)+z)\n+for j in vec1:\n+ result = 0\n+ for w, z in zip(j, vec2):\n+ result += w * z\n+ print(result)\n \n \n", "FL_content": "\n vec1 = []\n vec2 = []\n \n n, m = map(int, input().split())\n for x in range(1, n+1):\n vec1.append(list(map(int, input().split())))\n \n for y in range(m):\n vec2.append(int(input()))\n \n for j, z in zip(vec1, vec2):\n- print(sum(j)+z)\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u497952650", "problem_id": "p03086", "submission1_id": "s309883970-FL", "submission2_id": "s581704440", "status1": "Wrong Answer", "status2": "Accepted", "code1": "gene = [\"A\",\"T\",\"G\",\"C\"]\ndef is_gene(i):\n if i in gene:\n return True\n else:\n return False\n\nS = input()\n\nans = 0\ntmp = 0\n\nfor i in S:\n if is_gene(i):\n tmp += 1\n else:\n ans = max(ans,tmp)\n tmp = 0\n\nprint(ans)", "code2": "gene = [\"A\",\"T\",\"G\",\"C\"]\n\nS = list(input())\n\nans = 0\ntmp = 0\n\nfor i in range(len(S)):\n if S[i] in gene:\n tmp += 1\n ans = max(ans,tmp)\n else:\n tmp = 0\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579761000", "date2": "1579761538", "bleu_score": "0.622389666954574", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "VUKJNIHT\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["gene = [\"A\",\"T\",\"G\",\"C\"] # (0): gene=['A', 'T', 'G', 'C']\ndef is_gene(i): # (1): is_gene=\n if i in gene: # (7): gene=['A', 'T', 'G', 'C'], is_gene=, S=VUKJNIHT, ans=0, tmp=0 (12): gene=['A', 'T', 'G', 'C'], is_gene=, S=VUKJNIHT, ans=0, tmp=0 ... (42): gene=['A', 'T', 'G', 'C'], is_gene=, S=VUKJNIHT, ans=0, tmp=0\n return True\n else:\n return False\n\nS = input() # (2): S=VUKJNIHT\n\nans = 0 # (3): ans=0\ntmp = 0 # (4): tmp=0\n\nfor i in S: # (5): i=V (10): i=U ... (44): NO CHANGE\n if is_gene(i): # (6): NO CHANGE (11): NO CHANGE ... (41): NO CHANGE\n tmp += 1 # (43): tmp=1\n else:\n ans = max(ans,tmp) # (8): NO CHANGE (13): NO CHANGE ... (38): NO CHANGE\n tmp = 0 # (9): NO CHANGE (14): NO CHANGE ... (39): NO CHANGE\n\nprint(ans)"], "anno_status": [true], "diff_content": " gene = [\"A\",\"T\",\"G\",\"C\"]\n-def is_gene(i):\n- if i in gene:\n- return True\n- else:\n- return False\n \n-S = input()\n+S = list(input())\n \n ans = 0\n tmp = 0\n \n-for i in S:\n- if is_gene(i):\n+for i in range(len(S)):\n+ if S[i] in gene:\n tmp += 1\n- else:\n ans = max(ans,tmp)\n+ else:\n tmp = 0\n \n print(ans)\n", "FL_content": "\n gene = [\"A\",\"T\",\"G\",\"C\"]\n def is_gene(i):\n if i in gene:\n return True\n else:\n return False\n \n S = input()\n \n ans = 0\n tmp = 0\n \n for i in S:\n if is_gene(i):\n tmp += 1\n else:\n ans = max(ans,tmp)\n tmp = 0\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u356832650", "problem_id": "p03505", "submission1_id": "s593140435-FL", "submission2_id": "s393259520", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport math\nK, A, B = list(map(int, input().split()))\n\nif (A >= K):\n print(1)\n sys.exit()\nelif (A - B) <= 0:\n print(-1)\n sys.exit()\nd = A - B\n\np = K-A\nq = p/d\nif ((p % d) != 0):\n q += 1\nprint(2*q + 1)", "code2": "import sys\nimport math\nK, A, B = list(map(int, input().split()))\n \nif (A >= K):\n print('1')\n sys.exit()\nelif (A - B) <= 0:\n print('-1')\n sys.exit()\nd = A-B\np = K-A\nq = int(p\nif ((p % d) != 0):\n q += 1\nprint(str(2*q + 1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512520134", "date2": "1512521288", "bleu_score": "0.8876125747791229", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 3, "total_score": 103, "input": "1100000000100000000 4 0\n", "actual_output": "5.5000000005e+17\n", "expected_output": "550000000049999999\n\n", "anno_code": ["import sys\nimport math\nK, A, B = list(map(int, input().split())) # (0): K=1100000000100000000, A=4, B=0\n\nif (A >= K): # (1): NO CHANGE\n print(1)\n sys.exit()\nelif (A - B) <= 0: # (2): NO CHANGE\n print(-1)\n sys.exit()\nd = A - B # (3): d=4\n\np = K-A # (4): p=1100000000099999996\nq = p/d # (5): q=275000000025000000\nif ((p % d) != 0): # (6): NO CHANGE\n q += 1\nprint(2*q + 1)"], "anno_status": [true], "diff_content": " import sys\n import math\n K, A, B = list(map(int, input().split()))\n-\n+ \n if (A >= K):\n- print(1)\n+ print('1')\n sys.exit()\n elif (A - B) <= 0:\n- print(-1)\n+ print('-1')\n sys.exit()\n-d = A - B\n-\n+d = A-B\n p = K-A\n-q = p/d\n+q = int(p\n if ((p % d) != 0):\n q += 1\n-print(2*q + 1)\n+print(str(2*q + 1))\n", "FL_content": "\n import sys\n import math\n K, A, B = list(map(int, input().split()))\n \n if (A >= K):\n print(1)\n sys.exit()\n elif (A - B) <= 0:\n print(-1)\n sys.exit()\n d = A - B\n \n p = K-A\n-q = p/d\n if ((p % d) != 0):\n q += 1\n-print(2*q + 1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u488401358", "problem_id": "p03689", "submission1_id": "s777459173-FL", "submission2_id": "s136151189", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H,W,h,w=map(int,input().split())\nif H%h==0 and W%w==0:\n print(\"No\")\nelse:\n ans=[[1 for i in range(W)] for j in range(H)]\n for i in range(H):\n for j in range(W):\n if (i+1)%h==0 and (j+1)%w==0:\n ans[i][j]=-h*w\n if sum(ans[i][j] for i in range(H) for j in range(W))>0:\n print(\"Yes\")\n for i in range(H):\n print(*ans[i])\n else:\n print(\"No\")\n", "code2": "H,W,h,w=map(int,input().split())\nif H%h==0 and W%w==0:\n print(\"No\")\nelse:\n c=10**9\n ans=[[(c-1)\n for i in range(H):\n for j in range(W):\n if (i+1)%h==0 and (j+1)%w==0:\n ans[i][j]=-c\n if sum(ans[i][j] for i in range(H) for j in range(W))>0:\n print(\"Yes\")\n for i in range(H):\n print(*ans[i])\n else:\n print(\"No\")\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589661224", "date2": "1589661397", "bleu_score": "0.8947171719133229", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 3, "total_score": 96, "input": "3 6 2 3\n", "actual_output": "Yes\n1 1 1 1 1 1\n1 1 -6 1 1 -6\n1 1 1 1 1 1\n", "expected_output": "Yes\n1000 1000 1000 1000 1000 1000\n1000 1000 -5001 1000 1000 -5001\n1000 1000 1000 1000 1000 1000\n\n", "anno_code": ["H,W,h,w=map(int,input().split()) # (0): H=3, W=6, h=2, w=3\nif H%h==0 and W%w==0: # (1): NO CHANGE\n print(\"No\")\nelse:\n ans=[[1 for i in range(W)] for j in range(H)] # (2): ans\n for i in range(H): # (3): i=0 (17): i=1 ... (47): NO CHANGE\n for j in range(W): # (4): j=0 (6): j=1 ... (46): NO CHANGE\n if (i+1)%h==0 and (j+1)%w==0: # (5): NO CHANGE (7): NO CHANGE ... (45): NO CHANGE\n ans[i][j]=-h*w # (24): ans (31): ans\n if sum(ans[i][j] for i in range(H) for j in range(W))>0: # (48): NO CHANGE\n print(\"Yes\") # (49): NO CHANGE\n for i in range(H): # (50): i=0 (52): i=1 (54): i=2\n print(*ans[i]) # (51): NO CHANGE (53): NO CHANGE (55): NO CHANGE\n else:\n print(\"No\")\n"], "anno_status": [true], "diff_content": " H,W,h,w=map(int,input().split())\n if H%h==0 and W%w==0:\n print(\"No\")\n else:\n- ans=[[1 for i in range(W)] for j in range(H)]\n+ c=10**9\n+ ans=[[(c-1)\n for i in range(H):\n for j in range(W):\n if (i+1)%h==0 and (j+1)%w==0:\n- ans[i][j]=-h*w\n+ ans[i][j]=-c\n if sum(ans[i][j] for i in range(H) for j in range(W))>0:\n print(\"Yes\")\n for i in range(H):\n print(*ans[i])\n else:\n print(\"No\")\n \n", "FL_content": "\n H,W,h,w=map(int,input().split())\n if H%h==0 and W%w==0:\n print(\"No\")\n else:\n ans=[[1 for i in range(W)] for j in range(H)]\n for i in range(H):\n for j in range(W):\n- if (i+1)%h==0 and (j+1)%w==0:\n- ans[i][j]=-h*w\n- if sum(ans[i][j] for i in range(H) for j in range(W))>0:\n print(\"Yes\")\n for i in range(H):\n print(*ans[i])\n else:\n print(\"No\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u341087021", "problem_id": "p03719", "submission1_id": "s560786132-FL", "submission2_id": "s136754106", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\na, b, c = [int(x) for x in sys.stdin.readline().split()]\n\nif a <= c and b >= c:\n\tprint('YES')\nelse:\n\tprint('NO')", "code2": "import sys\n\na, b, c = [int(x) for x in sys.stdin.readline().split()]\n\nif a <= c and b >= c:\n\tprint('Yes')\nelse:\n\tprint('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1494724016", "date2": "1494724131", "bleu_score": "0.9527806225305113", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 21, "input": "9 3 1\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["import sys\n\na, b, c = [int(x) for x in sys.stdin.readline().split()] # (0): a=9, b=3, c=1\n\nif a <= c and b >= c: # (1): NO CHANGE\n\tprint('YES')\nelse:\n\tprint('NO')"], "anno_status": [true], "diff_content": " import sys\n \n a, b, c = [int(x) for x in sys.stdin.readline().split()]\n \n if a <= c and b >= c:\n-\tprint('YES')\n+\tprint('Yes')\n else:\n-\tprint('NO')\n+\tprint('No')\n", "FL_content": "\n import sys\n \n a, b, c = [int(x) for x in sys.stdin.readline().split()]\n \n if a <= c and b >= c:\n-\tprint('YES')\n else:\n-\tprint('NO')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u151107315", "problem_id": "p03437", "submission1_id": "s233676892-FL", "submission2_id": "s505718843", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X, Y = map(int, input().split())\nprint(-1 if Y % X == 0 else X)\n", "code2": "X, Y = map(int, input().split())\nprint(-1 if X % Y == 0 else X)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1581629191", "date2": "1581629567", "bleu_score": "0.9495013458695685", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 24, "total_score": 25, "input": "-6 12\n", "actual_output": "-1\n", "expected_output": "-6\n\n", "anno_code": ["X, Y = map(int, input().split()) # (0): X=-6, Y=12\nprint(-1 if Y % X == 0 else X)\n"], "anno_status": [true], "diff_content": " X, Y = map(int, input().split())\n-print(-1 if Y % X == 0 else X)\n+print(-1 if X % Y == 0 else X)\n \n", "FL_content": "\n X, Y = map(int, input().split())\n-print(-1 if Y % X == 0 else X)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 3 }, { "user_id": "u607074939", "problem_id": "p03433", "submission1_id": "s790955937-FL", "submission2_id": "s058504697", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = int(input())\nif(N%100 <= A):\n print('Yes')\nelse:\n print('No')", "code2": "N = int(input())\nA = int(input())\nif(N%500 <= A):\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582175984", "date2": "1582176199", "bleu_score": "0.9708351611332822", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "2763\n84\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["N = int(input()) # (0): N=2763\nA = int(input()) # (1): A=84\nif(N%100 <= A): # (2): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " N = int(input())\n A = int(input())\n-if(N%100 <= A):\n+if(N%500 <= A):\n print('Yes')\n else:\n print('No')\n", "FL_content": "\n N = int(input())\n A = int(input())\n-if(N%100 <= A):\n print('Yes')\n else:\n print('No')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u591589288", "problem_id": "p03031", "submission1_id": "s658039498-FL", "submission2_id": "s477590643", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\n\nn,m = [ int(x) for x in sys.stdin.readline().split() ]\ns = list()\nfor _ in range(m):\n t= [ int(x) for x in sys.stdin.readline().split() ][1:]\n flag = 0\n for x in t: flag|= x\n s.append( flag )\np = [ int(x) for x in sys.stdin.readline().split() ]\n\nans= 0\nfor test in range(2**n):\n fail= False\n for i in range(m):\n if bin(s[i]&test).count(\"1\")%2 != p[i]:\n fail= True\n break\n \n if not fail: ans+= 1\n\nprint( ans )\n", "code2": "\n\nimport sys\n\nn,m = [ int(x) for x in sys.stdin.readline().split() ]\ns = list()\nfor _ in range(m):\n t= [ int(x) for x in sys.stdin.readline().split() ][1:]\n flag = 0\n for x in t: flag|= 2**(x-1)\n s.append( flag )\np = [ int(x) for x in sys.stdin.readline().split() ]\n\nans= 0\nfor test in range(2**n):\n fail= False\n for i in range(m):\n if bin(s[i]&test).count(\"1\")%2 != p[i]:\n fail= True\n break\n \n if not fail: ans+= 1\n\nprint( ans )\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559435679", "date2": "1559435939", "bleu_score": "0.9807771522054649", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "5 2\n1 1 2 5\n2 4 3\n1 0\n", "actual_output": "0\n", "expected_output": "8\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n \n import sys\n \n n,m = [ int(x) for x in sys.stdin.readline().split() ]\n s = list()\n for _ in range(m):\n t= [ int(x) for x in sys.stdin.readline().split() ][1:]\n flag = 0\n- for x in t: flag|= x\n+ for x in t: flag|= 2**(x-1)\n s.append( flag )\n p = [ int(x) for x in sys.stdin.readline().split() ]\n \n ans= 0\n for test in range(2**n):\n fail= False\n for i in range(m):\n if bin(s[i]&test).count(\"1\")%2 != p[i]:\n fail= True\n break\n \n if not fail: ans+= 1\n \n print( ans )\n \n", "FL_content": "\n \n \n import sys\n \n n,m = [ int(x) for x in sys.stdin.readline().split() ]\n s = list()\n for _ in range(m):\n t= [ int(x) for x in sys.stdin.readline().split() ][1:]\n flag = 0\n for x in t: flag|= x\n s.append( flag )\n p = [ int(x) for x in sys.stdin.readline().split() ]\n \n ans= 0\n for test in range(2**n):\n fail= False\n for i in range(m):\n- if bin(s[i]&test).count(\"1\")%2 != p[i]:\n fail= True\n break\n \n if not fail: ans+= 1\n \n print( ans )\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 25 }, { "user_id": "u603049633", "problem_id": "p02413", "submission1_id": "s095312383-FL", "submission2_id": "s558652475", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r,c = map(int, input().split())\nL=[]\nfor i in range(r):\n al = input()\n print(al, end=\"\")\n AL = list(map(int, al.split()))\n S = sum(AL)\n print(\" \" + str(S))\n AL. append(S)\n L.append(AL)\n\nfor i in range(c):\n S = 0\n for j in range(r):\n S += L[j][i]\n print(str(S) + \" \", end=\"\")\nprint()", "code2": "r,c = map(int, input().split())\nL=[]\nfor i in range(r):\n al = input()\n print(al, end=\"\")\n AL = list(map(int, al.split()))\n S = sum(AL)\n print(\" \" + str(S))\n AL. append(S)\n L.append(AL)\n\nfor i in range(c):\n S = 0\n for j in range(r):\n S += L[j][i]\n print(str(S) + \" \", end=\"\")\n\nS = 0\nfor j in range(r):\n S += L[j][-1]\nprint(str(S))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1495678207", "date2": "1495678699", "bleu_score": "0.8523369642628769", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "4 5\n1 1 3 4 8\n2 2 2 4 5\n3 3 0 1 2\n2 6 4 8 6\n", "actual_output": "1 1 3 4 8 17\n2 2 2 4 5 15\n3 3 0 1 2 9\n2 6 4 8 6 26\n8 12 9 17 21 \n", "expected_output": "1 1 3 4 8 17\n2 2 2 4 5 15\n3 3 0 1 2 9\n2 6 4 8 6 26\n8 12 9 17 21 67\n\n", "anno_code": ["r,c = map(int, input().split()) # (0): r=4, c=5\nL=[] # (1): L=[]\nfor i in range(r): # (2): i=0 (10): i=1 ... (34): NO CHANGE\n al = input() # (3): al=1 1 3 4 8 (11): al=2 2 2 4 5 ... (27): al=2 6 4 8 6\n print(al, end=\"\") # (4): NO CHANGE (12): NO CHANGE ... (28): NO CHANGE\n AL = list(map(int, al.split())) # (5): AL=[1, 1, 3, 4, 8] (13): AL=[2, 2, 2, 4, 5] ... (29): AL=[2, 6, 4, 8, 6]\n S = sum(AL) # (6): S=17 (14): S=15 ... (30): S=26\n print(\" \" + str(S)) # (7): NO CHANGE (15): NO CHANGE ... (31): NO CHANGE\n AL. append(S) # (8): AL=[1, 1, 3, 4, 8, 17] (16): AL=[2, 2, 2, 4, 5, 15] ... (32): AL=[2, 6, 4, 8, 6, 26]\n L.append(AL) # (9): L (17): L ... (33): L\n\nfor i in range(c): # (35): i=0 (47): i=1 ... (95): NO CHANGE\n S = 0 # (36): S=0 (48): S=0 ... (84): S=0\n for j in range(r): # (37): j=0 (39): j=1 ... (93): NO CHANGE\n S += L[j][i] # (38): S=1 (40): S=3 ... (92): S=21\n print(str(S) + \" \", end=\"\") # (46): NO CHANGE (58): NO CHANGE ... (94): NO CHANGE\nprint()"], "anno_status": [true], "diff_content": " r,c = map(int, input().split())\n L=[]\n for i in range(r):\n al = input()\n print(al, end=\"\")\n AL = list(map(int, al.split()))\n S = sum(AL)\n print(\" \" + str(S))\n AL. append(S)\n L.append(AL)\n \n for i in range(c):\n S = 0\n for j in range(r):\n S += L[j][i]\n print(str(S) + \" \", end=\"\")\n-print()\n+\n+S = 0\n+for j in range(r):\n+ S += L[j][-1]\n+print(str(S))\n", "FL_content": "\n r,c = map(int, input().split())\n L=[]\n for i in range(r):\n al = input()\n- print(al, end=\"\")\n AL = list(map(int, al.split()))\n S = sum(AL)\n print(\" \" + str(S))\n AL. append(S)\n L.append(AL)\n \n for i in range(c):\n S = 0\n for j in range(r):\n S += L[j][i]\n print(str(S) + \" \", end=\"\")\n print()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u760794812", "problem_id": "p03712", "submission1_id": "s958152825-FL", "submission2_id": "s258566992", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H,W = map(int,input().split())\nList = []\nfor _ in range(H):\n S = input()\n List.append(S)\nprint('*'*(W+2))\nfor i in range(H):\n print('*'.strip(),end='')\n print(List[i].strip(),end='')\n print('*')\nprint('*'*(W+2))", "code2": "H,W = map(int,input().split())\nList = []\nfor _ in range(H):\n S = input()\n List.append(S)\nprint('\nfor i in range(H):\n print('\n print(List[i].strip(),end='')\n print('\nprint('", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573045275", "date2": "1573045399", "bleu_score": "0.781424803667964", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "2 6\nbc`\ncqa\n", "actual_output": "********\n*bc`*\n*cqa*\n********\n", "expected_output": "########\n#bc`#\n#cqa#\n########\n\n", "anno_code": ["H,W = map(int,input().split()) # (0): H=2, W=6\nList = [] # (1): List=[]\nfor _ in range(H): # (2): _=0 (5): _=1 (8): NO CHANGE\n S = input() # (3): S=bc` (6): S=cqa\n List.append(S) # (4): List=['bc`'] (7): List=['bc`', 'cqa']\nprint('*'*(W+2)) # (9): NO CHANGE\nfor i in range(H): # (10): i=0 (14): i=1 (18): NO CHANGE\n print('*'.strip(),end='') # (11): NO CHANGE (15): NO CHANGE\n print(List[i].strip(),end='') # (12): NO CHANGE (16): NO CHANGE\n print('*') # (13): NO CHANGE (17): NO CHANGE\nprint('*'*(W+2))"], "anno_status": [true], "diff_content": " H,W = map(int,input().split())\n List = []\n for _ in range(H):\n S = input()\n List.append(S)\n-print('*'*(W+2))\n+print('\n for i in range(H):\n- print('*'.strip(),end='')\n+ print('\n print(List[i].strip(),end='')\n- print('*')\n-print('*'*(W+2))\n+ print('\n+print('\n", "FL_content": "\n H,W = map(int,input().split())\n List = []\n for _ in range(H):\n S = input()\n List.append(S)\n-print('*'*(W+2))\n for i in range(H):\n- print('*'.strip(),end='')\n- print(List[i].strip(),end='')\n- print('*')\n-print('*'*(W+2))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u475991121", "problem_id": "p02948", "submission1_id": "s246324255-FL", "submission2_id": "s357759759", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\npay = []\nfor _ in range(n):\n a, b = map(int, input().split())\n pay.append((b, a))\npay = sorted(pay, reverse=True)\ndays = 0\nans = 0\nfor i in range(n):\n if days + pay[i][1] <= m:\n days += 1\n ans += pay[i][0]\nprint(ans)", "code2": "from heapq import *\nn, m = map(int, input().split())\npay = []\nfor _ in range(n):\n a, b = map(int, input().split())\n pay.append((a, b))\npay = sorted(pay, reverse=True)\nq = []\nans = 0\nfor i in range(1, m+1):\n while pay and pay[-1][0] <= i:\n a, b = pay.pop()\n heappush(q, -b)\n if q:\n b = -heappop(q)\n ans += b\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565491310", "date2": "1565517174", "bleu_score": "0.6457238013480002", "code1_test_status": [1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 98, "total_score": 102, "input": "3 4\n4 3\n3 0\n2 4\n", "actual_output": "4\n", "expected_output": "7\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=3, m=4\npay = [] # (1): pay=[]\nfor _ in range(n): # (2): _=0 (5): _=1 ... (11): NO CHANGE\n a, b = map(int, input().split()) # (3): a=4, b=3 (6): a=3, b=0 (9): a=2, b=4\n pay.append((b, a)) # (4): pay=[(3, 4)] (7): pay=[(3, 4), (0, 3)] (10): pay=[(3, 4), (0, 3), (4, 2)]\npay = sorted(pay, reverse=True) # (12): pay=[(4, 2), (3, 4), (0, 3)]\ndays = 0 # (13): days=0\nans = 0 # (14): ans=0\nfor i in range(n): # (15): i=0 (19): i=1 ... (25): NO CHANGE\n if days + pay[i][1] <= m: # (16): NO CHANGE (20): NO CHANGE (22): NO CHANGE\n days += 1 # (17): days=1 (23): days=2\n ans += pay[i][0] # (18): ans=4 (24): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": "+from heapq import *\n n, m = map(int, input().split())\n pay = []\n for _ in range(n):\n a, b = map(int, input().split())\n- pay.append((b, a))\n+ pay.append((a, b))\n pay = sorted(pay, reverse=True)\n-days = 0\n+q = []\n ans = 0\n-for i in range(n):\n- if days + pay[i][1] <= m:\n- days += 1\n- ans += pay[i][0]\n+for i in range(1, m+1):\n+ while pay and pay[-1][0] <= i:\n+ a, b = pay.pop()\n+ heappush(q, -b)\n+ if q:\n+ b = -heappop(q)\n+ ans += b\n print(ans)\n", "FL_content": "\n n, m = map(int, input().split())\n pay = []\n for _ in range(n):\n a, b = map(int, input().split())\n pay.append((b, a))\n pay = sorted(pay, reverse=True)\n days = 0\n ans = 0\n for i in range(n):\n- if days + pay[i][1] <= m:\n days += 1\n ans += pay[i][0]\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u491071312", "problem_id": "p02345", "submission1_id": "s876686683-FL", "submission2_id": "s890788536", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import time\n\nN, Q = map(int, input().split())\nSegTree = [0 for i in range(4*N)]\n\ndef modify(i, left, right, value, pos=-1):\n global SegTree\n if left==right:\n if pos != -1:\n SegTree[i] = value\n else:\n SegTree[i] = 2147483647\n return\n\n mid = int((left+right)/2)\n if pos==-1 or pos<=mid:\n modify(i*2, left, mid, value, pos)\n if pos==-1 or pos>mid:\n modify(i*2+1, mid+1, right, value, pos)\n \n SegTree[i] = min(SegTree[i*2], SegTree[i*2+1])\n\ndef query_min(i, L, R, left, right):\n if right < L or R < left:\n return 2147364748\n if left<=L and R<=right:\n return SegTree[i]\n mid = int((L+R)/2)\n return min(query_min(2*i, L, mid, left, right),\n query_min(2*i+1, mid+1, R, left, right))\n\nmodify(i=1, left=0, right=N-1, value=0, pos=-1) \n\nfor querys in range(Q):\n t, a, b = map(int, input().split())\n if t == 0:\n modify(i=1, left=0, right=N-1, pos=a, value=b)\n else:\n print( query_min(i=1, L=0, R=N-1, left=a, right=b) )", "code2": "import time\n\nN, Q = map(int, input().split())\nSegTree = [0 for i in range(4*N)]\n\ndef modify(i, left, right, value, pos=-1):\n global SegTree\n if left==right:\n if pos != -1:\n SegTree[i] = value\n else:\n SegTree[i] = 2147483647\n return\n\n mid = int((left+right)/2)\n if pos==-1 or pos<=mid:\n modify(i*2, left, mid, value, pos)\n if pos==-1 or pos>mid:\n modify(i*2+1, mid+1, right, value, pos)\n \n SegTree[i] = min(SegTree[i*2], SegTree[i*2+1])\n\ndef query_min(i, L, R, left, right):\n if right < L or R < left:\n return 2147483647\n if left<=L and R<=right:\n return SegTree[i]\n mid = int((L+R)/2)\n return min(query_min(2*i, L, mid, left, right),\n query_min(2*i+1, mid+1, R, left, right))\n\nmodify(i=1, left=0, right=N-1, value=0, pos=-1) \n\nfor querys in range(Q):\n t, a, b = map(int, input().split())\n if t == 0:\n modify(i=1, left=0, right=N-1, pos=a, value=b)\n else:\n print( query_min(i=1, L=0, R=N-1, left=a, right=b) )", "original_language1": "Python3", "original_language2": "Python3", "date1": "1437905785", "date2": "1437906172", "bleu_score": "0.9968916834369121", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 63, "total_score": 102, "input": "6 5\n0 0 0\n0 1 2\n1 2 3\n1 0 2\n1 2 2\n", "actual_output": "2147364748\n0\n2147364748\n", "expected_output": "2147483647\n0\n2147483647\n\n", "anno_code": ["import time\n\nN, Q = map(int, input().split()) # (0): N=6, Q=5\nSegTree = [0 for i in range(4*N)] # (1): SegTree=[0, 0, ..., 0, 0]\n\ndef modify(i, left, right, value, pos=-1): # (2): modify=\n global SegTree\n if left==right: # (5): NO CHANGE (9): NO CHANGE ... (107): NO CHANGE\n if pos != -1: # (18): NO CHANGE (24): NO CHANGE ... (108): NO CHANGE\n SegTree[i] = value # (82): NO CHANGE (109): NO CHANGE\n else:\n SegTree[i] = 2147483647 # (19): NO CHANGE (25): NO CHANGE ... (60): NO CHANGE\n return # (20): i=4, right=1, mid=0 (26): i=4, left=0, mid=0 ... (110): i=4, left=0, mid=0\n\n mid = int((left+right)/2) # (6): mid=2 (10): mid=1 ... (103): mid=0\n if pos==-1 or pos<=mid: # (7): NO CHANGE (11): NO CHANGE ... (104): NO CHANGE\n modify(i*2, left, mid, value, pos) # (8): i=2, right=2 (12): i=4, right=1 ... (101): i=4, right=1\n if pos==-1 or pos>mid: # (21): NO CHANGE (28): NO CHANGE ... (114): NO CHANGE\n modify(i*2+1, mid+1, right, value, pos) # (22): i=9, left=1 (29): i=5, left=2 ... (106): i=9, left=1\n \n SegTree[i] = min(SegTree[i*2], SegTree[i*2+1]) # (27): i=2, right=2, mid=1 (34): i=1, right=5, mid=2 ... (115): time=, N=6, Q=5, SegTree=[0, 0, ..., 0, 0], modify=, query_min=, querys=1, t=0, a=1, b=2\n\ndef query_min(i, L, R, left, right): # (3): query_min=\n if right < L or R < left: # (120): NO CHANGE (123): NO CHANGE ... (169): time=, N=6, Q=5, SegTree=[0, 0, ..., 0, 0], modify=, query_min=, querys=4, t=1, a=2, b=2\n return 2147364748\n if left<=L and R<=right: # (121): NO CHANGE (124): NO CHANGE ... (167): i=1, L=0, R=5, mid=2\n return SegTree[i]\n mid = int((L+R)/2) # (122): i=2, R=2 (125): i=4, R=1 ... (163): i=4, R=1\n return min(query_min(2*i, L, mid, left, right),\n query_min(2*i+1, mid+1, R, left, right)) # (127): i=5, L=2 (130): i=3, L=3 ... (168): i=3, L=3\n\nmodify(i=1, left=0, right=N-1, value=0, pos=-1) # (4): i=1, left=0, right=5, value=0, pos=-1\n\nfor querys in range(Q): # (64): querys=0 (90): querys=1 ... (154): querys=4\n t, a, b = map(int, input().split()) # (65): t=0, a=0, b=0 (91): a=1, b=2 ... (155): a=2\n if t == 0: # (66): NO CHANGE (92): NO CHANGE ... (156): NO CHANGE\n modify(i=1, left=0, right=N-1, pos=a, value=b) # (67): i=1, left=0, right=5, value=0, pos=0 (93): i=1, left=0, right=5, value=2, pos=1\n else:\n print( query_min(i=1, L=0, R=N-1, left=a, right=b) ) # (119): i=1, L=0, R=5, left=2, right=3 (146): i=1, L=0, R=5, left=0, right=2 (157): i=1, L=0, R=5, left=2, right=2\n"], "anno_status": [false], "diff_content": " import time\n \n N, Q = map(int, input().split())\n SegTree = [0 for i in range(4*N)]\n \n def modify(i, left, right, value, pos=-1):\n global SegTree\n if left==right:\n if pos != -1:\n SegTree[i] = value\n else:\n SegTree[i] = 2147483647\n return\n \n mid = int((left+right)/2)\n if pos==-1 or pos<=mid:\n modify(i*2, left, mid, value, pos)\n if pos==-1 or pos>mid:\n modify(i*2+1, mid+1, right, value, pos)\n \n SegTree[i] = min(SegTree[i*2], SegTree[i*2+1])\n \n def query_min(i, L, R, left, right):\n if right < L or R < left:\n- return 2147364748\n+ return 2147483647\n if left<=L and R<=right:\n return SegTree[i]\n mid = int((L+R)/2)\n return min(query_min(2*i, L, mid, left, right),\n query_min(2*i+1, mid+1, R, left, right))\n \n modify(i=1, left=0, right=N-1, value=0, pos=-1) \n \n for querys in range(Q):\n t, a, b = map(int, input().split())\n if t == 0:\n modify(i=1, left=0, right=N-1, pos=a, value=b)\n else:\n print( query_min(i=1, L=0, R=N-1, left=a, right=b) )\n", "FL_content": "\n import time\n \n N, Q = map(int, input().split())\n SegTree = [0 for i in range(4*N)]\n \n def modify(i, left, right, value, pos=-1):\n global SegTree\n if left==right:\n if pos != -1:\n SegTree[i] = value\n else:\n SegTree[i] = 2147483647\n return\n \n mid = int((left+right)/2)\n if pos==-1 or pos<=mid:\n modify(i*2, left, mid, value, pos)\n if pos==-1 or pos>mid:\n modify(i*2+1, mid+1, right, value, pos)\n \n SegTree[i] = min(SegTree[i*2], SegTree[i*2+1])\n \n-modify(i=1, left=0, right=N-1, pos=-1) \n \n for querys in range(Q):\n t, a, b = map(int, input().split())\n if t == 0:\n modify(i=1, left=0, right=N-1, pos=a, value=b)\n else:\n print( query_min(i=1, L=0, R=N-1, left=a, right=b) )\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 39 }, { "user_id": "u252745826", "problem_id": "p04000", "submission1_id": "s615539585-FL", "submission2_id": "s890120030", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\n\nh, w, n = list(map(int, input().split()))\nans = [0 for i in range(10)]\n\nif n != 0:\n board = defaultdict(int)\n for i in range(n):\n a, b = list(map(int, input().split()))\n a = a - 1\n b = b - 1\n for dx in range(b-1, b+2):\n if dx <= 0 or dx >= w - 1:\n continue\n for dy in range(a-1, a+2):\n if dy <= 0 or dy >= h - 1:\n continue\n board[(dx, dy)] += 1\n\n for v in board.values():\n ans[v] += 1\n\nfor i in range(10):\n print(ans[i])\n", "code2": "from collections import defaultdict\n\nh, w, n = list(map(int, input().split()))\nans = [0 for i in range(10)]\n\nboard = defaultdict(int)\nfor i in range(n):\n a, b = list(map(int, input().split()))\n a = a - 1\n b = b - 1\n for dx in range(b-1, b+2):\n if dx <= 0 or dx >= w - 1:\n continue\n for dy in range(a-1, a+2):\n if dy <= 0 or dy >= h - 1:\n continue\n board[(dx, dy)] += 1\n\nfor v in board.values():\n ans[v] += 1\nans[0] = (h - 2) * (w - 2) - sum(ans)\n\nfor i in range(10):\n print(ans[i])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1508332943", "date2": "1508333198", "bleu_score": "0.8830332676614862", "code1_test_status": [0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 10, "total_score": 103, "input": "10 10 20\n0 1\n1 4\n1 9\n2 5\n2 6\n4 1\n1 7\n5 9\n6 4\n6 6\n6 5\n2 2\n10 3\n7 8\n16 1\n8 5\n11 10\n9 5\n17 4\n4 9\n", "actual_output": "0\n20\n24\n7\n1\n0\n0\n0\n0\n0\n", "expected_output": "12\n20\n24\n7\n1\n0\n0\n0\n0\n0\n\n", "anno_code": ["from collections import defaultdict\n\nh, w, n = list(map(int, input().split())) # (0): h=10, w=10, n=20\nans = [0 for i in range(10)] # (1): ans=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\nif n != 0: # (2): NO CHANGE\n board = defaultdict(int) # (3): board=defaultdict(, {})\n for i in range(n): # (4): i=0 (27): i=1 ... (716): NO CHANGE\n a, b = list(map(int, input().split())) # (5): a=0, b=1 (28): a=1, b=4 ... (685): a=4, b=9\n a = a - 1 # (6): a=-1 (29): a=0 ... (686): a=3\n b = b - 1 # (7): b=0 (30): b=3 ... (687): b=8\n for dx in range(b-1, b+2): # (8): dx=-1 (11): dx=0 ... (715): NO CHANGE\n if dx <= 0 or dx >= w - 1: # (9): NO CHANGE (12): NO CHANGE ... (713): NO CHANGE\n continue # (10): NO CHANGE (13): NO CHANGE ... (714): NO CHANGE\n for dy in range(a-1, a+2): # (16): dy=-2 (19): dy=-1 ... (711): NO CHANGE\n if dy <= 0 or dy >= h - 1: # (17): NO CHANGE (20): NO CHANGE ... (709): NO CHANGE\n continue # (18): NO CHANGE (21): NO CHANGE ... (681): NO CHANGE\n board[(dx, dy)] += 1 # (41): board=defaultdict(, {(2, 1): 1}) (53): board=defaultdict(, {(2, 1): 1, (3, 1): 1}) ... (710): board=defaultdict(, {(2, 1): 2, (3, 1): 2, (4, 1): 3, (7, 1): 2, (8, 1): 1, (3, 2): 1, (4, 2): 2, (5, 1): 3, (5, 2): 2, (6, 1): 2, (6, 2): 1, (1, 2): 2, (1, 3): 1, (1, 4): 1, (7, 3): 2, (7, 4): 2, (7, 5): 2, (8, 3): 2, (8, 4): 2, (8, 5): 2, (2, 4): 1, (2, 5): 1, (2, 6): 1, (3, 4): 2, (3, 5): 2, (3, 6): 3, (4, 4): 3, (4, 5): 3, (4, 6): 4, (5, 4): 2, (5, 5): 2, (5, 6): 3, (6, 4): 1, (6, 5): 2, (6, 6): 2, (1, 1): 1, (2, 2): 1, (1, 8): 1, (2, 8): 1, (3, 8): 3, (6, 7): 1, (7, 6): 1, (7, 7): 1, (8, 6): 1, (8, 7): 1, (3, 7): 2, (4, 7): 2, (4, 8): 2, (5, 7): 2, (5, 8): 2, (7, 2): 1, (8, 2): 1})\n\n for v in board.values(): # (717): v=2 (719): NO CHANGE ... (821): NO CHANGE\n ans[v] += 1 # (718): ans=[0, 0, 1, 0, 0, 0, 0, 0, 0, 0] (720): ans=[0, 0, 2, 0, 0, 0, 0, 0, 0, 0] ... (820): ans=[0, 20, 24, 7, 1, 0, 0, 0, 0, 0]\n\nfor i in range(10): # (822): i=0 (824): i=1 ... (840): i=9\n print(ans[i]) # (823): NO CHANGE (825): NO CHANGE ... (841): NO CHANGE\n"], "anno_status": [false], "diff_content": " from collections import defaultdict\n \n h, w, n = list(map(int, input().split()))\n ans = [0 for i in range(10)]\n \n-if n != 0:\n- board = defaultdict(int)\n- for i in range(n):\n- a, b = list(map(int, input().split()))\n- a = a - 1\n- b = b - 1\n- for dx in range(b-1, b+2):\n- if dx <= 0 or dx >= w - 1:\n+board = defaultdict(int)\n+for i in range(n):\n+ a, b = list(map(int, input().split()))\n+ a = a - 1\n+ b = b - 1\n+ for dx in range(b-1, b+2):\n+ if dx <= 0 or dx >= w - 1:\n+ continue\n+ for dy in range(a-1, a+2):\n+ if dy <= 0 or dy >= h - 1:\n continue\n- for dy in range(a-1, a+2):\n- if dy <= 0 or dy >= h - 1:\n- continue\n- board[(dx, dy)] += 1\n+ board[(dx, dy)] += 1\n \n- for v in board.values():\n- ans[v] += 1\n+for v in board.values():\n+ ans[v] += 1\n+ans[0] = (h - 2) * (w - 2) - sum(ans)\n \n for i in range(10):\n print(ans[i])\n \n", "FL_content": "\n from collections import defaultdict\n \n h, w, n = list(map(int, input().split()))\n ans = [0 for i in range(10)]\n \n-if n != 0:\n board = defaultdict(int)\n for i in range(n):\n a, b = list(map(int, input().split()))\n a = a - 1\n b = b - 1\n for dx in range(b-1, b+2):\n if dx <= 0 or dx >= w - 1:\n continue\n for dy in range(a-1, a+2):\n if dy <= 0 or dy >= h - 1:\n continue\n board[(dx, dy)] += 1\n \n for v in board.values():\n ans[v] += 1\n \n for i in range(10):\n print(ans[i])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 25 }, { "user_id": "u351241495", "problem_id": "p03545", "submission1_id": "s810045787-FL", "submission2_id": "s355859736", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nlistA=[0,0,0,0]\ni=0\nfor x in s:\n listA[i]=int(x)\n i+=1\na=listA[0]\nb=listA[1]\nc=listA[2]\nd=listA[3]\nif(a+b+c+d==7):\n print(\"%d+%d+%d+%d==7\"% (a,b,c,d))\nelif(a+b+c-d==7):\n print(\"%d+%d+%d-%d==7\"% (a,b,c,d))\nelif(a+b-c+d==7):\n print(\"%d+%d-%d+%d==7\" % (a, b, c, d))\nelif(a+b-c-d==7):\n print(\"%d+%d-%d-%d==7\" % (a, b, c, d))\nelif(a-b+c+d==7):\n print(\"%d-%d+%d+%d==7\" % (a, b, c, d))\nelif(a-b-c+d==7):\n print(\"%d-%d-%d+%d==7\" % (a, b, c, d))\nelif(a-b-c-d==7):\n print(\"%d-%d-%d-%d==7\" % (a, b, c, d))\nelif(a-b+c-d==7):\n print(\"%d-%d+%d-%d==7\" % (a, b, c, d))", "code2": "s=input()\nlistA=[0,0,0,0]\ni=0\nfor x in s:\n listA[i]=int(x)\n i+=1\na=listA[0]\nb=listA[1]\nc=listA[2]\nd=listA[3]\nif(a+b+c+d==7):\n print(\"%d+%d+%d+%d=7\"% (a,b,c,d))\nelif(a+b+c-d==7):\n print(\"%d+%d+%d-%d=7\"% (a,b,c,d))\nelif(a+b-c+d==7):\n print(\"%d+%d-%d+%d=7\" % (a, b, c, d))\nelif(a+b-c-d==7):\n print(\"%d+%d-%d-%d=7\" % (a, b, c, d))\nelif(a-b+c+d==7):\n print(\"%d-%d+%d+%d=7\" % (a, b, c, d))\nelif(a-b-c+d==7):\n print(\"%d-%d-%d+%d=7\" % (a, b, c, d))\nelif(a-b-c-d==7):\n print(\"%d-%d-%d-%d=7\" % (a, b, c, d))\nelif(a-b+c-d==7):\n print(\"%d-%d+%d-%d=7\" % (a, b, c, d))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1511629536", "date2": "1511629639", "bleu_score": "0.9761488934731087", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 99, "input": "1583\n", "actual_output": "1-5+8+3==7\n", "expected_output": "1-5+8+3=7\n\n", "anno_code": ["s=input() # (0): s=1583\nlistA=[0,0,0,0] # (1): listA=[0, 0, 0, 0]\ni=0 # (2): i=0\nfor x in s: # (3): x=1 (6): x=5 ... (15): NO CHANGE\n listA[i]=int(x) # (4): listA=[1, 0, 0, 0] (7): listA=[1, 5, 0, 0] ... (13): listA=[1, 5, 8, 3]\n i+=1 # (5): i=1 (8): i=2 ... (14): i=4\na=listA[0] # (16): a=1\nb=listA[1] # (17): b=5\nc=listA[2] # (18): c=8\nd=listA[3] # (19): d=3\nif(a+b+c+d==7): # (20): NO CHANGE\n print(\"%d+%d+%d+%d==7\"% (a,b,c,d))\nelif(a+b+c-d==7): # (21): NO CHANGE\n print(\"%d+%d+%d-%d==7\"% (a,b,c,d))\nelif(a+b-c+d==7): # (22): NO CHANGE\n print(\"%d+%d-%d+%d==7\" % (a, b, c, d))\nelif(a+b-c-d==7): # (23): NO CHANGE\n print(\"%d+%d-%d-%d==7\" % (a, b, c, d))\nelif(a-b+c+d==7): # (24): NO CHANGE\n print(\"%d-%d+%d+%d==7\" % (a, b, c, d))\nelif(a-b-c+d==7):\n print(\"%d-%d-%d+%d==7\" % (a, b, c, d))\nelif(a-b-c-d==7):\n print(\"%d-%d-%d-%d==7\" % (a, b, c, d))\nelif(a-b+c-d==7):\n print(\"%d-%d+%d-%d==7\" % (a, b, c, d))"], "anno_status": [true], "diff_content": " s=input()\n listA=[0,0,0,0]\n i=0\n for x in s:\n listA[i]=int(x)\n i+=1\n a=listA[0]\n b=listA[1]\n c=listA[2]\n d=listA[3]\n if(a+b+c+d==7):\n- print(\"%d+%d+%d+%d==7\"% (a,b,c,d))\n+ print(\"%d+%d+%d+%d=7\"% (a,b,c,d))\n elif(a+b+c-d==7):\n- print(\"%d+%d+%d-%d==7\"% (a,b,c,d))\n+ print(\"%d+%d+%d-%d=7\"% (a,b,c,d))\n elif(a+b-c+d==7):\n- print(\"%d+%d-%d+%d==7\" % (a, b, c, d))\n+ print(\"%d+%d-%d+%d=7\" % (a, b, c, d))\n elif(a+b-c-d==7):\n- print(\"%d+%d-%d-%d==7\" % (a, b, c, d))\n+ print(\"%d+%d-%d-%d=7\" % (a, b, c, d))\n elif(a-b+c+d==7):\n- print(\"%d-%d+%d+%d==7\" % (a, b, c, d))\n+ print(\"%d-%d+%d+%d=7\" % (a, b, c, d))\n elif(a-b-c+d==7):\n- print(\"%d-%d-%d+%d==7\" % (a, b, c, d))\n+ print(\"%d-%d-%d+%d=7\" % (a, b, c, d))\n elif(a-b-c-d==7):\n- print(\"%d-%d-%d-%d==7\" % (a, b, c, d))\n+ print(\"%d-%d-%d-%d=7\" % (a, b, c, d))\n elif(a-b+c-d==7):\n- print(\"%d-%d+%d-%d==7\" % (a, b, c, d))\n+ print(\"%d-%d+%d-%d=7\" % (a, b, c, d))\n", "FL_content": "\n s=input()\n listA=[0,0,0,0]\n i=0\n for x in s:\n listA[i]=int(x)\n i+=1\n a=listA[0]\n b=listA[1]\n c=listA[2]\n d=listA[3]\n if(a+b+c+d==7):\n- print(\"%d+%d+%d+%d==7\"% (a,b,c,d))\n elif(a+b+c-d==7):\n- print(\"%d+%d+%d-%d==7\"% (a,b,c,d))\n elif(a+b-c+d==7):\n- print(\"%d+%d-%d+%d==7\" % (a, b, c, d))\n elif(a+b-c-d==7):\n- print(\"%d+%d-%d-%d==7\" % (a, b, c, d))\n elif(a-b+c+d==7):\n- print(\"%d-%d+%d+%d==7\" % (a, b, c, d))\n elif(a-b-c+d==7):\n- print(\"%d-%d-%d+%d==7\" % (a, b, c, d))\n elif(a-b-c-d==7):\n- print(\"%d-%d-%d-%d==7\" % (a, b, c, d))\n elif(a-b+c-d==7):\n- print(\"%d-%d+%d-%d==7\" % (a, b, c, d))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 26 }, { "user_id": "u603324902", "problem_id": "p02933", "submission1_id": "s087198533-FL", "submission2_id": "s210709344", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\ns = str(input())\n\nif a <=3200:\n print(s)\nelse:\n print(\"red\")", "code2": "a = int(input())\ns = str(input())\n\nif a >=3200:\n print(s)\nelse:\n print(\"red\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566176797", "date2": "1566176913", "bleu_score": "0.9572799132941563", "code1_test_status": [0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0], "code1_test_score": 51, "total_score": 103, "input": "4049\nqdd\n", "actual_output": "red\n", "expected_output": "qdd\n\n", "anno_code": ["a = int(input()) # (0): a=4049\ns = str(input()) # (1): s=qdd\n\nif a <=3200: # (2): NO CHANGE\n print(s)\nelse:\n print(\"red\")"], "anno_status": [true], "diff_content": " a = int(input())\n s = str(input())\n \n-if a <=3200:\n+if a >=3200:\n print(s)\n else:\n print(\"red\")\n+\n", "FL_content": "\n a = int(input())\n s = str(input())\n \n-if a <=3200:\n print(s)\n else:\n print(\"red\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u896775745", "problem_id": "p02865", "submission1_id": "s315525727-FL", "submission2_id": "s015011296", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nN = int(input())\nans = N/2\n\nif N == 1:\n\tprint(1)\nelse:\n\tprint(math.floor(ans))", "code2": "import math\n\nN = int(input())\nans = math.floor(N / 2)\n\nif N % 2 == 0:\n print(ans - 1)\nelse:\n print(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573476112", "date2": "1573476623", "bleu_score": "0.7029013068600114", "code1_test_status": [1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 31, "total_score": 46, "input": "133044\n", "actual_output": "66522\n", "expected_output": "66521\n\n", "anno_code": ["import math\n\nN = int(input()) # (0): N=133044\nans = N/2 # (1): ans=66522.0\n\nif N == 1: # (2): NO CHANGE\n\tprint(1)\nelse:\n\tprint(math.floor(ans))"], "anno_status": [true], "diff_content": " import math\n \n N = int(input())\n-ans = N/2\n+ans = math.floor(N / 2)\n \n-if N == 1:\n-\tprint(1)\n+if N % 2 == 0:\n+ print(ans - 1)\n else:\n-\tprint(math.floor(ans))\n+ print(ans)\n", "FL_content": "\n import math\n \n N = int(input())\n-ans = N/2\n \n if N == 1:\n \tprint(1)\n else:\n-\tprint(math.floor(ans))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u968166680", "problem_id": "p04044", "submission1_id": "s658843038-FL", "submission2_id": "s209841328", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\nsys.setrecursionlimit(10 ** 9)\nINF = 1 << 60\nMOD = 1000000007\n\n\ndef main():\n N, L = map(int, readline().split())\n S = [readline().strip() for _ in range(L)]\n\n S.sort()\n ans = ''.join(S)\n print(ans)\n return\n\n\nif __name__ == '__main__':\n main()\n", "code2": "import sys\n\nread = sys.stdin.read\nreadline = sys.stdin.readline\nreadlines = sys.stdin.readlines\nsys.setrecursionlimit(10 ** 9)\nINF = 1 << 60\nMOD = 1000000007\n\n\ndef main():\n N, L = map(int, readline().split())\n S = [readline().strip() for _ in range(N)]\n\n S.sort()\n ans = ''.join(S)\n print(ans)\n return\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1594890854", "date2": "1594890963", "bleu_score": "0.9930117393912855", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1], "code1_test_score": 63, "total_score": 101, "input": "3 1\nxxd\nxax\nxyd\n", "actual_output": "xxd\n", "expected_output": "xaxxxdxyd\n\n", "anno_code": ["import sys\n\nread = sys.stdin.read # (0): read=\nreadline = sys.stdin.readline # (1): readline=\nreadlines = sys.stdin.readlines # (2): readlines=\nsys.setrecursionlimit(10 ** 9) # (3): NO CHANGE\nINF = 1 << 60 # (4): INF=1152921504606846976\nMOD = 1000000007 # (5): MOD=1000000007\n\n\ndef main(): # (6): main=\n N, L = map(int, readline().split())\n S = [readline().strip() for _ in range(L)]\n\n S.sort()\n ans = ''.join(S)\n print(ans)\n return\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " import sys\n \n read = sys.stdin.read\n readline = sys.stdin.readline\n readlines = sys.stdin.readlines\n sys.setrecursionlimit(10 ** 9)\n INF = 1 << 60\n MOD = 1000000007\n \n \n def main():\n N, L = map(int, readline().split())\n- S = [readline().strip() for _ in range(L)]\n+ S = [readline().strip() for _ in range(N)]\n \n S.sort()\n ans = ''.join(S)\n print(ans)\n return\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": "\n import sys\n \n read = sys.stdin.read\n readline = sys.stdin.readline\n readlines = sys.stdin.readlines\n sys.setrecursionlimit(10 ** 9)\n INF = 1 << 60\n MOD = 1000000007\n \n \n def main():\n N, L = map(int, readline().split())\n- S = [readline().strip() for _ in range(L)]\n \n- S.sort()\n- ans = ''.join(S)\n- print(ans)\n return\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 23 }, { "user_id": "u148551245", "problem_id": "p02865", "submission1_id": "s602554238-FL", "submission2_id": "s406527640", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nif n % 2 == 1:\n print((n + 1) / 2 - 1)\nelse:\n print(n / 2 - 1)", "code2": "n = int(input())\nif n % 2 == 1:\n print(int((n - 1) / 2))\nelse:\n print(int(n / 2 - 1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573351642", "date2": "1573352078", "bleu_score": "0.8625275891906243", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 46, "input": "999999\n", "actual_output": "499999.0\n", "expected_output": "499999\n", "anno_code": ["n = int(input()) # (0): n=999999\nif n % 2 == 1: # (1): NO CHANGE\n print((n + 1) / 2 - 1)\nelse:\n print(n / 2 - 1)"], "anno_status": [true], "diff_content": " n = int(input())\n if n % 2 == 1:\n- print((n + 1) / 2 - 1)\n+ print(int((n - 1) / 2))\n else:\n- print(n / 2 - 1)\n+ print(int(n / 2 - 1))\n", "FL_content": "\n n = int(input())\n if n % 2 == 1:\n- print((n + 1) / 2 - 1)\n else:\n- print(n / 2 - 1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u479977918", "problem_id": "p03129", "submission1_id": "s382002815-FL", "submission2_id": "s236321095", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nN, K = map(int, input().split())\n\nif int((N+1) /2) >= K:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "\n\nN, K = map(int, input().split())\n\nif int((N+1) /2) >= K:\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1550090543", "date2": "1550090914", "bleu_score": "0.9393209005037124", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 60, "input": "98 50\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["\n\nN, K = map(int, input().split()) # (0): N=98, K=50\n\nif int((N+1) /2) >= K: # (1): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " \n \n N, K = map(int, input().split())\n \n if int((N+1) /2) >= K:\n- print(\"Yes\")\n+ print(\"YES\")\n else:\n- print(\"No\")\n+ print(\"NO\")\n", "FL_content": "\n \n \n N, K = map(int, input().split())\n \n-if int((N+1) /2) >= K:\n- print(\"Yes\")\n else:\n- print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u175590965", "problem_id": "p03643", "submission1_id": "s025345866-FL", "submission2_id": "s315680561", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = input()\nprint(\"ABC\"+\"a\")", "code2": "a = input()\nprint(\"ABC\"+a)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569548660", "date2": "1569548705", "bleu_score": "0.8673920022828956", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "403\n", "actual_output": "ABCa\n", "expected_output": "ABC403\n\n", "anno_code": ["a = input() # (0): a=403\nprint(\"ABC\"+\"a\")"], "anno_status": [true], "diff_content": " a = input()\n-print(\"ABC\"+\"a\")\n+print(\"ABC\"+a)\n", "FL_content": "\n a = input()\n-print(\"ABC\"+\"a\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 2 }, { "user_id": "u787792408", "problem_id": "p02536", "submission1_id": "s586570388-FL", "submission2_id": "s231824049", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m = map(int,input().split())\n\nans = 0\n\nclass UnionFind:\n def __init__(self,n):\n self.root = [i for i in range(n+1)]\n\n def Root_Find(self,x):\n if self.root[x] == x:\n return x\n else:\n self.root[x] = self.Root_Find(self.root[x])\n return self.root[x]\n\n def Unite(self,x,y):\n x = self.Root_Find(x)\n y = self.Root_Find(y)\n if x == y:\n return\n self.root[y] = x\n\ntree = UnionFind(n)\n\nfor i in range(m):\n a,b = map(int,input().split())\n tree.Unite(a,b)\n \nans = len(list(set(tree.root))) - 1\nprint(ans)", "code2": "n,m = map(int,input().split())\n\nans = 0\n\nclass UnionFind:\n def __init__(self,n):\n self.root = [i for i in range(n+1)]\n\n def Root_Find(self,x):\n if self.root[x] == x:\n return x\n else:\n self.root[x] = self.Root_Find(self.root[x])\n return self.root[x]\n\n def Unite(self,x,y):\n x = self.Root_Find(x)\n y = self.Root_Find(y)\n if x == y:\n return\n self.root[y] = x\n\ntree = UnionFind(n)\n\nfor i in range(m):\n a,b = map(int,input().split())\n tree.Unite(a,b)\n\nfor i in range(n+1):\n tree.Root_Find(i)\n\nans = len(list(set(tree.root))) - 2\nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601191605", "date2": "1601192172", "bleu_score": "0.930822391674332", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 90, "input": "5 1\n1 1\n", "actual_output": "5\n", "expected_output": "4\n\n", "anno_code": ["n,m = map(int,input().split()) # (0): n=5, m=1\n\nans = 0 # (1): ans=0\n\nclass UnionFind: # (2): UnionFind=\n def __init__(self,n):\n self.root = [i for i in range(n+1)] # (4): m=1, ans=0, UnionFind=, tree=\n\n def Root_Find(self,x):\n if self.root[x] == x: # (9): y=1 (11): y=1\n return x\n else:\n self.root[x] = self.Root_Find(self.root[x])\n return self.root[x]\n\n def Unite(self,x,y):\n x = self.Root_Find(x) # (8): NO CHANGE\n y = self.Root_Find(y) # (10): NO CHANGE\n if x == y: # (12): NO CHANGE\n return # (13): n=5, m=1, ans=0, UnionFind=, tree=, i=0, a=1, b=1\n self.root[y] = x\n\ntree = UnionFind(n) # (3): self=\n\nfor i in range(m): # (5): i=0 (14): NO CHANGE\n a,b = map(int,input().split()) # (6): a=1, b=1\n tree.Unite(a,b) # (7): self=, x=1, y=1\n \nans = len(list(set(tree.root))) - 1 # (15): ans=5\nprint(ans)"], "anno_status": [true], "diff_content": " n,m = map(int,input().split())\n \n ans = 0\n \n class UnionFind:\n def __init__(self,n):\n self.root = [i for i in range(n+1)]\n \n def Root_Find(self,x):\n if self.root[x] == x:\n return x\n else:\n self.root[x] = self.Root_Find(self.root[x])\n return self.root[x]\n \n def Unite(self,x,y):\n x = self.Root_Find(x)\n y = self.Root_Find(y)\n if x == y:\n return\n self.root[y] = x\n \n tree = UnionFind(n)\n \n for i in range(m):\n a,b = map(int,input().split())\n tree.Unite(a,b)\n- \n-ans = len(list(set(tree.root))) - 1\n+\n+for i in range(n+1):\n+ tree.Root_Find(i)\n+\n+ans = len(list(set(tree.root))) - 2\n print(ans)\n", "FL_content": "\n n,m = map(int,input().split())\n \n ans = 0\n \n class UnionFind:\n def __init__(self,n):\n self.root = [i for i in range(n+1)]\n \n def Root_Find(self,x):\n if self.root[x] == x:\n return x\n else:\n self.root[x] = self.Root_Find(self.root[x])\n return self.root[x]\n \n def Unite(self,x,y):\n x = self.Root_Find(x)\n y = self.Root_Find(y)\n if x == y:\n return\n self.root[y] = x\n \n tree = UnionFind(n)\n \n for i in range(m):\n a,b = map(int,input().split())\n tree.Unite(a,b)\n \n-ans = len(list(set(tree.root))) - 1\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 30 }, { "user_id": "u432805419", "problem_id": "p03719", "submission1_id": "s672560189-FL", "submission2_id": "s292389382", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = list(map(int,input().split()))\nb = sorted(a)\nif a[2] == b[1]:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "a = list(map(int,input().split()))\nif a[0] <= a[2] and a[1] >= a[2]:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1541381455", "date2": "1541381624", "bleu_score": "0.7885235500812869", "code1_test_status": [0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 19, "total_score": 21, "input": "5 -1 0\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["a = list(map(int,input().split())) # (0): a=[5, -1, 0]\nb = sorted(a) # (1): b=[-1, 0, 5]\nif a[2] == b[1]: # (2): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " a = list(map(int,input().split()))\n-b = sorted(a)\n-if a[2] == b[1]:\n+if a[0] <= a[2] and a[1] >= a[2]:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": "\n a = list(map(int,input().split()))\n b = sorted(a)\n-if a[2] == b[1]:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u539367121", "problem_id": "p02537", "submission1_id": "s257992372-FL", "submission2_id": "s211501812", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k=map(int,input().split())\na=[int(input()) for _ in range(n)]\nl=[[] for i in range(n)]\n\nl[0].append(a[0])\nans=0\nfor ai in a[1:]:\n for i in reversed(range(ans+1)): \n for li in l[i]:\n if -k<=(li-ai)<=k:\n ans=max(ans,i+1)\n l[ans].append(ai)\n break\n else:\n continue\n break\n else:\n l[0].append(ai)\n\nprint(ans+1)", "code2": "n,k=map(int,input().split())\na=[int(input()) for _ in range(n)]\nl=[[] for i in range(n)]\n\nl[0].append(a[0])\nans=0\nfor ai in a[1:]:\n for i in reversed(range(ans+1)): \n for li in l[i]:\n if -k<=(li-ai)<=k:\n ans=max(ans,i+1)\n l[i+1].append(ai)\n break\n else:\n continue\n break\n else:\n l[0].append(ai)\n\nprint(ans+1)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601249638", "date2": "1601249874", "bleu_score": "0.9871822205726997", "code1_test_status": [1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 68, "total_score": 101, "input": "10 3\n1\n5\n2\n0\n6\n6\n9\n5\n4\n1\n", "actual_output": "7\n", "expected_output": "6\n\n", "anno_code": ["n,k=map(int,input().split()) # (0): n=10, k=3\na=[int(input()) for _ in range(n)] # (1): a=[1, 5, 2, 0, 6, 6, 9, 5, 4, 1]\nl=[[] for i in range(n)] # (2): l\n\nl[0].append(a[0]) # (3): l\nans=0 # (4): l, ans=0\nfor ai in a[1:]: # (5): l=[[1], [], [], [], [], [], [], [], [], []], ai=5 (13): l, ai=2 ... (98): l\n for i in reversed(range(ans+1)): # (6): l, i=0 (11): l ... (91): l, i=5\n for li in l[i]: # (7): l, li=1 (9): l ... (92): l, li=4\n if -k<=(li-ai)<=k: # (8): l (16): l ... (93): l\n ans=max(ans,i+1) # (17): l=[[1, 5], [], [], [], [], [], [], [], [], []], ans=1 (25): l=[[1, 5], [2], [], [], [], [], [], [], [], []], ans=2 ... (94): l, ans=6\n l[ans].append(ai) # (18): l (26): l ... (95): l\n break # (19): l (27): l ... (96): l\n else:\n continue # (10): l (34): l ... (72): l\n break # (20): l (28): l ... (97): l\n else:\n l[0].append(ai) # (12): l\n\nprint(ans+1)"], "anno_status": [true], "diff_content": " n,k=map(int,input().split())\n a=[int(input()) for _ in range(n)]\n l=[[] for i in range(n)]\n \n l[0].append(a[0])\n ans=0\n for ai in a[1:]:\n for i in reversed(range(ans+1)): \n for li in l[i]:\n if -k<=(li-ai)<=k:\n ans=max(ans,i+1)\n- l[ans].append(ai)\n+ l[i+1].append(ai)\n break\n else:\n continue\n break\n else:\n l[0].append(ai)\n \n print(ans+1)\n", "FL_content": "\n n,k=map(int,input().split())\n a=[int(input()) for _ in range(n)]\n l=[[] for i in range(n)]\n \n l[0].append(a[0])\n ans=0\n for ai in a[1:]:\n for i in reversed(range(ans+1)): \n for li in l[i]:\n if -k<=(li-ai)<=k:\n ans=max(ans,i+1)\n l[ans].append(ai)\n break\n else:\n continue\n break\n else:\n l[0].append(ai)\n \n print(ans+1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u389910364", "problem_id": "p03313", "submission1_id": "s670005400-FL", "submission2_id": "s670005542", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import itertools\nimport os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\n\nsys.setrecursionlimit(10 ** 9)\nINF = float(\"inf\")\nIINF = 10 ** 18\nMOD = 10 ** 9 + 7\n\n\n\ndef cummax(it, first=-float('inf')):\n \n cm = first\n ret = []\n for v in it:\n cm = max(v, cm)\n ret.append(cm)\n return ret\n\n\nN = int(sys.stdin.buffer.readline())\nA = list(map(int, sys.stdin.buffer.readline().split()))\n\n\n\ndp = [None] * (2 ** N)\nfor k in range(1, 2 ** N):\n dp[k] = (A[0], 0), (A[k], k)\n\ndigits = []\nk = 1\nwhile k < 2 ** N:\n digits.append(k)\n k <<= 1\n\nfor bit in range(2, N + 1):\n for ds in itertools.combinations(digits, bit):\n k = sum(ds)\n for rm in ds:\n pass\n \n \n \n \n\nans = [0] * (2 ** N)\nfor k in range(1, 2 ** N):\n (a1, _), (a2, _) = dp[k]\n ans[k] = a1 + a2\n\nans = cummax(ans[1:])\nprint(*ans, sep='\\n')\n", "code2": "import os\nimport sys\n\nif os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\n\nsys.setrecursionlimit(10 ** 9)\nINF = float(\"inf\")\nIINF = 10 ** 18\nMOD = 10 ** 9 + 7\n\n\n\ndef cummax(it, first=-float('inf')):\n \n cm = first\n ret = []\n for v in it:\n cm = max(v, cm)\n ret.append(cm)\n return ret\n\n\nN = int(sys.stdin.buffer.readline())\nA = list(map(int, sys.stdin.buffer.readline().split()))\nSIZE = 2 ** N\n\n\n\ndp = [None] * SIZE\nfor k in range(1, SIZE):\n dp[k] = list(sorted([(A[0], 0), (A[k], k)]))\n\nfor k in range(1, SIZE):\n mask = k\n while mask < SIZE - 1:\n \n next_k = (mask + 1) | k\n mask |= next_k\n\n a1, a2 = dp[k]\n b1, b2 = dp[next_k]\n if a1 > b2:\n \n dp[next_k] = dp[k]\n elif b1 > a2:\n \n pass\n elif a2 > b2:\n dp[next_k] = b2, a2\n elif b2 > a2:\n dp[next_k] = a2, b2\n\nans = [0] * SIZE\nfor k in range(1, SIZE):\n (a1, _), (a2, _) = dp[k]\n ans[k] = a1 + a2\n\nans = cummax(ans[1:])\nprint(*ans, sep='\\n')\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575525133", "date2": "1575610013", "bleu_score": "0.7207804108146525", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "4\n7 2 0 1 19 3 25 34 -3 -2 43 215 11 6 28 1\n", "actual_output": "9\n9\n9\n26\n26\n32\n41\n41\n41\n50\n222\n222\n222\n222\n222\n", "expected_output": "9\n9\n9\n26\n26\n44\n59\n59\n59\n59\n258\n258\n258\n258\n258\n\n", "anno_code": ["import itertools\nimport os\nimport sys\n\nif os.getenv(\"LOCAL\"): # (0): NO CHANGE\n sys.stdin = open(\"_in.txt\", \"r\")\n\nsys.setrecursionlimit(10 ** 9) # (1): NO CHANGE\nINF = float(\"inf\") # (2): INF=inf\nIINF = 10 ** 18 # (3): IINF=1000000000000000000\nMOD = 10 ** 9 + 7 # (4): MOD=1000000007\n\n\n\ndef cummax(it, first=-float('inf')): # (5): cummax=\n \n cm = first # (199): cm=-inf\n ret = [] # (200): ret=[]\n for v in it: # (201): v=9 (204): v=7 ... (246): itertools=, os=, sys=, INF=inf, IINF=1000000000000000000, MOD=1000000007, cummax=, N=4, A=[7, 2, 0, 1, 19, 3, 25, 34, -3, -2, 43, 215, 11, 6, 28, 1], dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=15, digits=[1, 2, 4, 8], bit=4, ds=(1, 2, 4, 8), rm=8, ans=[9, 9, 9, 26, 26, 32, 41, 41, 41, 50, 222, 222, 222, 222, 222], a1=7, _=15, a2=1\n cm = max(v, cm) # (202): cm=9 (205): NO CHANGE ... (244): NO CHANGE\n ret.append(cm) # (203): ret=[9] (206): ret=[9, 9] ... (245): ret=[9, 9, 9, 26, 26, 32, 41, 41, 41, 50, 222, 222, 222, 222, 222]\n return ret\n\n\nN = int(sys.stdin.buffer.readline()) # (6): N=4\nA = list(map(int, sys.stdin.buffer.readline().split())) # (7): A=[7, 2, 0, 1, 19, 3, 25, 34, -3, -2, 43, 215, 11, 6, 28, 1]\n\n\n\ndp = [None] * (2 ** N) # (8): dp=[None, None, None, None, None, None, None, None, None, None, None, None, None, None, None, None]\nfor k in range(1, 2 ** N): # (9): k=1 (11): dp=[None, ((7, 0), (2, 1)), None, None, None, None, None, None, None, None, None, None, None, None, None, None], k=2 ... (39): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))]\n dp[k] = (A[0], 0), (A[k], k) # (10): dp=[None, ((7, 0), (2, 1)), None, None, None, None, None, None, None, None, None, None, None, None, None, None] (12): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), None, None, None, None, None, None, None, None, None, None, None, None, None] ... (38): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))]\n\ndigits = [] # (40): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], digits=[]\nk = 1 # (41): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=1\nwhile k < 2 ** N: # (42): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))] (45): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))] ... (54): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))]\n digits.append(k) # (43): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], digits=[1] (46): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], digits=[1, 2] ... (52): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], digits=[1, 2, 4, 8]\n k <<= 1 # (44): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=2 (47): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=4 ... (53): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=16\n\nfor bit in range(2, N + 1): # (55): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], bit=2 (99): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], bit=3 ... (150): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))]\n for ds in itertools.combinations(digits, bit): # (56): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], ds=(1, 2) (63): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], ds=(1, 4) ... (149): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))]\n k = sum(ds) # (57): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=3 (64): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=5 ... (139): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=15\n for rm in ds: # (58): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], rm=1 (60): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], rm=2 ... (148): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))]\n pass # (59): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))] (61): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))] ... (147): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))]\n \n \n \n \n\nans = [0] * (2 ** N) # (151): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], ans=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor k in range(1, 2 ** N): # (152): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=1 (155): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], k=2 ... (197): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))]\n (a1, _), (a2, _) = dp[k] # (153): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], a1=7, _=1, a2=2 (156): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], _=2, a2=0 ... (195): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], _=15, a2=1\n ans[k] = a1 + a2 # (154): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], ans=[0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (157): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], ans=[0, 9, 7, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (196): dp=[None, ((7, 0), (2, 1)), ((7, 0), (0, 2)), ((7, 0), (1, 3)), ((7, 0), (19, 4)), ((7, 0), (3, 5)), ((7, 0), (25, 6)), ((7, 0), (34, 7)), ((7, 0), (-3, 8)), ((7, 0), (-2, 9)), ((7, 0), (43, 10)), ((7, 0), (215, 11)), ((7, 0), (11, 12)), ((7, 0), (6, 13)), ((7, 0), (28, 14)), ((7, 0), (1, 15))], ans=[0, 9, 7, 8, 26, 10, 32, 41, 4, 5, 50, 222, 18, 13, 35, 8]\n\nans = cummax(ans[1:]) # (198): it=[9, 7, 8, 26, 10, 32, 41, 4, 5, 50, 222, 18, 13, 35, 8], first=-inf\nprint(*ans, sep='\\n')\n"], "anno_status": [false], "diff_content": "-import itertools\n import os\n import sys\n \n if os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\n \n sys.setrecursionlimit(10 ** 9)\n INF = float(\"inf\")\n IINF = 10 ** 18\n MOD = 10 ** 9 + 7\n \n \n \n def cummax(it, first=-float('inf')):\n \n cm = first\n ret = []\n for v in it:\n cm = max(v, cm)\n ret.append(cm)\n return ret\n \n \n N = int(sys.stdin.buffer.readline())\n A = list(map(int, sys.stdin.buffer.readline().split()))\n+SIZE = 2 ** N\n \n \n \n-dp = [None] * (2 ** N)\n-for k in range(1, 2 ** N):\n- dp[k] = (A[0], 0), (A[k], k)\n+dp = [None] * SIZE\n+for k in range(1, SIZE):\n+ dp[k] = list(sorted([(A[0], 0), (A[k], k)]))\n \n-digits = []\n-k = 1\n-while k < 2 ** N:\n- digits.append(k)\n- k <<= 1\n+for k in range(1, SIZE):\n+ mask = k\n+ while mask < SIZE - 1:\n+ \n+ next_k = (mask + 1) | k\n+ mask |= next_k\n \n-for bit in range(2, N + 1):\n- for ds in itertools.combinations(digits, bit):\n- k = sum(ds)\n- for rm in ds:\n- pass\n- \n- \n+ a1, a2 = dp[k]\n+ b1, b2 = dp[next_k]\n+ if a1 > b2:\n \n+ dp[next_k] = dp[k]\n+ elif b1 > a2:\n \n+ pass\n+ elif a2 > b2:\n+ dp[next_k] = b2, a2\n+ elif b2 > a2:\n+ dp[next_k] = a2, b2\n \n-ans = [0] * (2 ** N)\n-for k in range(1, 2 ** N):\n+ans = [0] * SIZE\n+for k in range(1, SIZE):\n (a1, _), (a2, _) = dp[k]\n ans[k] = a1 + a2\n \n ans = cummax(ans[1:])\n print(*ans, sep='\\n')\n \n", "FL_content": "\n import itertools\n import os\n import sys\n \n if os.getenv(\"LOCAL\"):\n sys.stdin = open(\"_in.txt\", \"r\")\n \n sys.setrecursionlimit(10 ** 9)\n INF = float(\"inf\")\n IINF = 10 ** 18\n MOD = 10 ** 9 + 7\n \n \n \n def cummax(it, first=-float('inf')):\n \n cm = first\n ret = []\n for v in it:\n cm = max(v, cm)\n ret.append(cm)\n return ret\n \n \n N = int(sys.stdin.buffer.readline())\n A = list(map(int, sys.stdin.buffer.readline().split()))\n \n \n \n dp = [None] * (2 ** N)\n for k in range(1, 2 ** N):\n- dp[k] = (A[0], 0), (A[k], k)\n \n digits = []\n k = 1\n while k < 2 ** N:\n digits.append(k)\n k <<= 1\n \n for bit in range(2, N + 1):\n for ds in itertools.combinations(digits, bit):\n k = sum(ds)\n for rm in ds:\n pass\n \n \n \n \n \n ans = [0] * (2 ** N)\n for k in range(1, 2 ** N):\n (a1, _), (a2, _) = dp[k]\n ans[k] = a1 + a2\n \n ans = cummax(ans[1:])\n print(*ans, sep='\\n')\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 57 }, { "user_id": "u352394527", "problem_id": "p02368", "submission1_id": "s960929244-FL", "submission2_id": "s126115242", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\ndef dfs(v, visited, edges, order):\n visited[v] = True\n for to in edges[v]:\n if not visited[to]:\n dfs(to, visited, edges, order)\n order.append(v)\n\ndef search_strongly_connection(v, visited, reverse_edges, parent):\n visited[v] = True\n for to in reverse_edges[v]:\n if not visited[to]:\n parent[to] = v\n search_strongly_connection(to, visited, reverse_edges, parent)\n\ndef find(parent, x):\n if parent[x] == x:\n return x\n tmp = find(parent, parent[x])\n parent[x] = tmp\n return tmp\n\nv_num , e_num = map(int, input().split())\nedges = [[] for _ in range(v_num)]\nreverse_edges = [[] for _ in range(v_num)]\nfor _ in range(e_num):\n s, t = map(int, input().split())\n edges[s].append(t)\n reverse_edges[t].append(s)\n\n\norder = []\nvisited = [False] * v_num\ndfs(0, visited, edges, order)\norder.reverse()\n\n\nvisited = [False] * v_num\nparent = [i for i in range(v_num)]\nfor v in order:\n if not visited[v]:\n search_strongly_connection(v, visited, reverse_edges, parent)\n\n\nq_num = int(input())\nfor _ in range(q_num):\n u, v = map(int, input().split())\n if find(parent, u) == find(parent, v):\n print(1)\n else:\n print(0)\n", "code2": "\n\nimport sys\n\nsys.setrecursionlimit(1000000)\n\ndef dfs(v, visited, edges, order):\n visited[v] = True\n for to in edges[v]:\n if not visited[to]:\n dfs(to, visited, edges, order)\n order.append(v)\n\ndef search_strongly_connection(v, visited, reverse_edges, parent):\n visited[v] = True\n for to in reverse_edges[v]:\n if not visited[to]:\n parent[to] = v\n search_strongly_connection(to, visited, reverse_edges, parent)\n\ndef find(parent, x):\n if parent[x] == x:\n return x\n tmp = find(parent, parent[x])\n parent[x] = tmp\n return tmp\n\nv_num , e_num = map(int, input().split())\nedges = [[] for _ in range(v_num)]\nreverse_edges = [[] for _ in range(v_num)]\nfor _ in range(e_num):\n s, t = map(int, input().split())\n edges[s].append(t)\n reverse_edges[t].append(s)\n\n\norder = []\nvisited = [False] * v_num\nfor v in range(v_num):\n if not visited[v]:\n dfs(v, visited, edges, order)\norder.reverse()\n\n\nvisited = [False] * v_num\nparent = [i for i in range(v_num)]\nfor v in order:\n if not visited[v]:\n search_strongly_connection(v, visited, reverse_edges, parent)\n\nq_num = int(input())\nfor _ in range(q_num):\n u, v = map(int, input().split())\n if find(parent, u) == find(parent, v):\n print(1)\n else:\n print(0)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1528128911", "date2": "1528130049", "bleu_score": "0.9230375265916442", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1], "code1_test_score": 42, "total_score": 101, "input": "8 6\n0 1\n2 0\n1 6\n3 4\n6 1\n3 0\n3\n1 2\n1 6\n2 3\n2 4\n", "actual_output": "0\n1\n1\n", "expected_output": "0\n1\n0\n\n", "anno_code": ["\n\n\ndef dfs(v, visited, edges, order): # (0): dfs=\n visited[v] = True # (34): visited=[True, False, False, False, False, False, False, False], edges (38): visited=[True, True, False, False, False, False, False, False], edges (42): visited=[True, True, False, False, False, False, True, False], edges\n for to in edges[v]: # (35): edges, to=1 (39): edges, to=6 ... (49): edges\n if not visited[to]: # (36): edges (40): edges (44): edges\n dfs(to, visited, edges, order) # (37): v=1, edges (41): v=6, edges\n order.append(v) # (46): v=1, edges=[[1], [6], [0], [4, 0], [], [], [1], []], order=[6], to=6 (48): v=0, edges=[[1], [6], [0], [4, 0], [], [], [1], []], order=[6, 1], to=1 (50): dfs=, search_strongly_connection=, find=, v_num=8, e_num=6, edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, _=5, s=3, t=0, order=[6, 1, 0]\n\ndef search_strongly_connection(v, visited, reverse_edges, parent): # (1): search_strongly_connection=\n visited[v] = True # (57): visited=[True, False, False, False, False, False, False, False], reverse_edges (62): visited=[True, False, True, False, False, False, False, False], reverse_edges ... (81): visited=[True, True, True, True, False, False, True, False], reverse_edges\n for to in reverse_edges[v]: # (58): reverse_edges, to=2 (63): v=0, reverse_edges, to=2 ... (85): dfs=, search_strongly_connection=, find=, v_num=8, e_num=6, edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, _=5, s=3, t=0, order=[0, 1, 6]\n if not visited[to]: # (59): reverse_edges (65): reverse_edges ... (83): reverse_edges\n parent[to] = v # (60): reverse_edges, parent=[0, 1, 0, 3, 4, 5, 6, 7] (66): reverse_edges, parent=[0, 1, 0, 0, 4, 5, 6, 7] (79): reverse_edges, parent=[0, 1, 0, 0, 4, 5, 1, 7]\n search_strongly_connection(to, visited, reverse_edges, parent) # (61): v=2, reverse_edges (67): v=3, reverse_edges (80): v=6, reverse_edges\n\ndef find(parent, x): # (2): find=\n if parent[x] == x: # (93): x=2 (94): NO CHANGE ... (117): x=3, tmp=0\n return x\n tmp = find(parent, parent[x]) # (95): x=0 (104): x=1 ... (116): x=0\n parent[x] = tmp # (97): dfs=, search_strongly_connection=, find=, v_num=8, e_num=6, edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges=[[2, 3], [0, 6], [], [], [3], [], [1], []], _=0, s=3, t=0, order=[0, 1, 6], visited=[True, True, True, True, False, False, True, False], v=2, q_num=3, u=1 (106): dfs=, search_strongly_connection=, find=, v_num=8, e_num=6, edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges=[[2, 3], [0, 6], [], [], [3], [], [1], []], _=1, s=3, t=0, order=[0, 1, 6], visited=[True, True, True, True, False, False, True, False], v=6, q_num=3, u=1 ... (118): dfs=, search_strongly_connection=, find=, v_num=8, e_num=6, edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges=[[2, 3], [0, 6], [], [], [3], [], [1], []], _=2, s=3, t=0, order=[0, 1, 6], visited=[True, True, True, True, False, False, True, False], v=3, q_num=3, u=2\n return tmp\n\nv_num , e_num = map(int, input().split()) # (3): v_num=8, e_num=6\nedges = [[] for _ in range(v_num)] # (4): edges\nreverse_edges = [[] for _ in range(v_num)] # (5): reverse_edges\nfor _ in range(e_num): # (6): _=0 (10): edges=[[1], [], [], [], [], [], [], []], reverse_edges, _=1 ... (30): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges\n s, t = map(int, input().split()) # (7): s=0, t=1 (11): edges=[[1], [], [], [], [], [], [], []], reverse_edges=[[], [0], [], [], [], [], [], []], s=2, t=0 ... (27): edges=[[1], [6], [0], [4], [], [], [1], []], reverse_edges, s=3, t=0\n edges[s].append(t) # (8): edges (12): edges, reverse_edges ... (28): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges\n reverse_edges[t].append(s) # (9): edges=[[1], [], [], [], [], [], [], []], reverse_edges (13): edges, reverse_edges ... (29): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges\n\n\norder = [] # (31): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, order=[]\nvisited = [False] * v_num # (32): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, visited=[False, False, False, False, False, False, False, False]\ndfs(0, visited, edges, order) # (33): v=0, edges\norder.reverse() # (51): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, order=[0, 1, 6]\n\n\nvisited = [False] * v_num # (52): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, visited=[False, False, False, False, False, False, False, False]\nparent = [i for i in range(v_num)] # (53): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, parent=[0, 1, 2, 3, 4, 5, 6, 7]\nfor v in order: # (54): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, v=0 (71): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, v=1 ... (88): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges\n if not visited[v]: # (55): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges (72): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges (87): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges\n search_strongly_connection(v, visited, reverse_edges, parent) # (56): reverse_edges (73): reverse_edges\n\n\nq_num = int(input()) # (89): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, q_num=3\nfor _ in range(q_num): # (90): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, _=0 (99): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, _=1 (108): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, _=2\n u, v = map(int, input().split()) # (91): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, v=2, u=1 (100): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, v=6 (109): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges, v=3, u=2\n if find(parent, u) == find(parent, v): # (92): x=1 (101): x=1 (110): x=2\n print(1) # (107): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges (119): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges\n else:\n print(0) # (98): edges=[[1], [6], [0], [4, 0], [], [], [1], []], reverse_edges\n"], "anno_status": [false], "diff_content": " \n \n+import sys\n+\n+sys.setrecursionlimit(1000000)\n \n def dfs(v, visited, edges, order):\n visited[v] = True\n for to in edges[v]:\n if not visited[to]:\n dfs(to, visited, edges, order)\n order.append(v)\n \n def search_strongly_connection(v, visited, reverse_edges, parent):\n visited[v] = True\n for to in reverse_edges[v]:\n if not visited[to]:\n parent[to] = v\n search_strongly_connection(to, visited, reverse_edges, parent)\n \n def find(parent, x):\n if parent[x] == x:\n return x\n tmp = find(parent, parent[x])\n parent[x] = tmp\n return tmp\n \n v_num , e_num = map(int, input().split())\n edges = [[] for _ in range(v_num)]\n reverse_edges = [[] for _ in range(v_num)]\n for _ in range(e_num):\n s, t = map(int, input().split())\n edges[s].append(t)\n reverse_edges[t].append(s)\n \n \n order = []\n visited = [False] * v_num\n-dfs(0, visited, edges, order)\n+for v in range(v_num):\n+ if not visited[v]:\n+ dfs(v, visited, edges, order)\n order.reverse()\n \n \n visited = [False] * v_num\n parent = [i for i in range(v_num)]\n for v in order:\n if not visited[v]:\n search_strongly_connection(v, visited, reverse_edges, parent)\n \n-\n q_num = int(input())\n for _ in range(q_num):\n u, v = map(int, input().split())\n if find(parent, u) == find(parent, v):\n print(1)\n else:\n print(0)\n \n", "FL_content": "\n \n \n \n def dfs(v, visited, edges, order):\n visited[v] = True\n for to in edges[v]:\n if not visited[to]:\n dfs(to, visited, edges, order)\n order.append(v)\n \n def search_strongly_connection(v, visited, reverse_edges, parent):\n visited[v] = True\n for to in reverse_edges[v]:\n if not visited[to]:\n parent[to] = v\n search_strongly_connection(to, visited, reverse_edges, parent)\n \n def find(parent, x):\n if parent[x] == x:\n return x\n tmp = find(parent, parent[x])\n parent[x] = tmp\n return tmp\n \n v_num , e_num = map(int, input().split())\n edges = [[] for _ in range(v_num)]\n reverse_edges = [[] for _ in range(v_num)]\n for _ in range(e_num):\n s, t = map(int, input().split())\n edges[s].append(t)\n reverse_edges[t].append(s)\n \n \n order = []\n visited = [False] * v_num\n dfs(0, visited, edges, order)\n order.reverse()\n \n \n visited = [False] * v_num\n parent = [i for i in range(v_num)]\n for v in order:\n if not visited[v]:\n search_strongly_connection(v, visited, reverse_edges, parent)\n \n \n q_num = int(input())\n for _ in range(q_num):\n u, v = map(int, input().split())\n- if find(parent, u) == find(parent, v):\n print(1)\n else:\n print(0)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 54 }, { "user_id": "u593590006", "problem_id": "p03353", "submission1_id": "s512574383-FL", "submission2_id": "s072312958", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nk=int(input())\nn=len(s)\nl=[]\nfor i in range(n):\n curr=''\n for j in range(i,min(i+10,n)):\n curr+=s[j]\n l.append(curr)\nl.sort()\n\nprint(l[k-1])", "code2": "s=input()\nk=int(input())\nn=len(s)\nl=set()\nfor i in range(n):\n curr=''\n for j in range(i,min(i+7,n)):\n curr+=s[j]\n l.add(curr)\nl=[i for i in l]\nl.sort()\n\nprint(l[k-1])", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1572382525", "date2": "1572382629", "bleu_score": "0.8544258136228686", "code1_test_status": [0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0], "code1_test_score": 58, "total_score": 103, "input": "atcederamdatcoddor\n4\n", "actual_output": "am\n", "expected_output": "amda\n\n", "anno_code": ["s=input() # (0): s=atcederamdatcoddor\nk=int(input()) # (1): k=4\nn=len(s) # (2): n=18\nl=[] # (3): l=[]\nfor i in range(n): # (4): i=0 (37): i=1 ... (463): NO CHANGE\n curr='' # (5): curr= (38): curr= ... (458): curr=\n for j in range(i,min(i+10,n)): # (6): j=0 (9): j=1 ... (462): NO CHANGE\n curr+=s[j] # (7): curr=a (10): curr=at ... (460): curr=r\n l.append(curr) # (8): l=['a'] (11): l=['a', 'at'] ... (461): l=[a, at, ..., or, r]\nl.sort() # (464): l=[a, a, ..., tcoddo, tcoddor]\n\nprint(l[k-1])"], "anno_status": [true], "diff_content": " s=input()\n k=int(input())\n n=len(s)\n-l=[]\n+l=set()\n for i in range(n):\n curr=''\n- for j in range(i,min(i+10,n)):\n+ for j in range(i,min(i+7,n)):\n curr+=s[j]\n- l.append(curr)\n+ l.add(curr)\n+l=[i for i in l]\n l.sort()\n \n print(l[k-1])\n", "FL_content": "\n s=input()\n k=int(input())\n n=len(s)\n l=[]\n for i in range(n):\n curr=''\n- for j in range(i,min(i+10,n)):\n curr+=s[j]\n l.append(curr)\n l.sort()\n \n print(l[k-1])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u067729694", "problem_id": "p03003", "submission1_id": "s825777877-FL", "submission2_id": "s161709927", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\nS = list(map(int, input().split()))\nT = list(map(int, input().split()))\n\ndp = [[0 for i in range(M+1)] for j in range(N+1)] \ndp_sum = [[0 for i in range(M+1)] for j in range(N+1)] \n\n\nfor i, s in enumerate(S):\n for j, t in enumerate(T):\n if s == t:\n dp[i+1][j+1] = dp_sum[i][j] + 1 \n dp_sum[i+1][j+1] = dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]\n \nprint(dp_sum[N][M]+1)\n\n", "code2": "N, M = map(int, input().split())\nS = list(map(int, input().split()))\nT = list(map(int, input().split()))\n\nMOD = 10**9+7\n\ndp = [[0 for i in range(M+1)] for j in range(N+1)] \ndp_sum = [[0 for i in range(M+1)] for j in range(N+1)] \n\n\nret = 0\nfor i, s in enumerate(S):\n for j, t in enumerate(T):\n if s == t:\n dp[i+1][j+1] = dp_sum[i][j] + 1 \n dp_sum[i+1][j+1] = (dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]) % MOD\n \nprint(dp_sum[N][M]+1)\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1566035477", "date2": "1566035792", "bleu_score": "0.9280138261142716", "code1_test_status": [1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0], "code1_test_score": 57, "total_score": 105, "input": "20 20\n1 1 1 0 2 1 1 1 0 1 2 1 1 1 1 1 1 1 1 1\n1 1 1 2 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1\n", "actual_output": "3836684440\n", "expected_output": "836684419\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=20, M=20\nS = list(map(int, input().split())) # (1): S=[1, 1, 1, 0, 2, 1, 1, 1, 0, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]\nT = list(map(int, input().split())) # (2): T=[1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]\n\ndp = [[0 for i in range(M+1)] for j in range(N+1)] # (3): dp\ndp_sum = [[0 for i in range(M+1)] for j in range(N+1)] # (4): dp_sum\n\n\nfor i, s in enumerate(S): # (5): i=0, s=1 (85): i=1 ... (1537): NO CHANGE\n for j, t in enumerate(T): # (6): j=0, t=1 (10): j=1 ... (1536): NO CHANGE\n if s == t: # (7): NO CHANGE (11): NO CHANGE ... (1533): NO CHANGE\n dp[i+1][j+1] = dp_sum[i][j] + 1 # (8): dp (12): dp ... (1534): dp\n dp_sum[i+1][j+1] = dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j] # (9): dp_sum (13): dp_sum ... (1535): dp_sum\n \nprint(dp_sum[N][M]+1)\n\n"], "anno_status": [true], "diff_content": " N, M = map(int, input().split())\n S = list(map(int, input().split()))\n T = list(map(int, input().split()))\n \n+MOD = 10**9+7\n+\n dp = [[0 for i in range(M+1)] for j in range(N+1)] \n dp_sum = [[0 for i in range(M+1)] for j in range(N+1)] \n \n \n+ret = 0\n for i, s in enumerate(S):\n for j, t in enumerate(T):\n if s == t:\n dp[i+1][j+1] = dp_sum[i][j] + 1 \n- dp_sum[i+1][j+1] = dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]\n+ dp_sum[i+1][j+1] = (dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]) % MOD\n \n print(dp_sum[N][M]+1)\n \n \n", "FL_content": "\n N, M = map(int, input().split())\n S = list(map(int, input().split()))\n T = list(map(int, input().split()))\n \n dp = [[0 for i in range(M+1)] for j in range(N+1)] \n dp_sum = [[0 for i in range(M+1)] for j in range(N+1)] \n \n \n for i, s in enumerate(S):\n for j, t in enumerate(T):\n if s == t:\n dp[i+1][j+1] = dp_sum[i][j] + 1 \n dp_sum[i+1][j+1] = dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]\n \n-print(dp_sum[N][M]+1)\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u092736322", "problem_id": "p02401", "submission1_id": "s711609258-FL", "submission2_id": "s216401178", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while 1:\n k=input().split()\n k[0]=int(k[0])\n k[2]=int(k[2])\n \n if k[1]==\"?\":\n break\n elif k[1]==\"+\":\n print(k[0]+k[2])\n elif k[1]==\"-\":\n print(k[0]-k[2])\n elif k[1]==\"*\":\n print(k[0]*k[2])\n elif k[1]==\"/\":\n print(k[0]/k[2])\n\n", "code2": "while 1:\n k=input().split()\n k[0]=int(k[0])\n k[2]=int(k[2])\n \n if k[1]==\"?\":\n break\n elif k[1]==\"+\":\n print(k[0]+k[2])\n elif k[1]==\"-\":\n print(k[0]-k[2])\n elif k[1]==\"*\":\n print(k[0]*k[2])\n elif k[1]==\"/\":\n print(k[0]\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1528762582", "date2": "1528762648", "bleu_score": "0.974480861620321", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "4 , 4\n25 , 18\n10 * 2\n000 / 29\n28 , 81\n0 ? 0\n", "actual_output": "20\n0.0\n", "expected_output": "(4, 4)\n(25, 18)\n20\n0\n(28, 81)\n\n", "anno_code": ["while 1: # (0): NO CHANGE (9): NO CHANGE ... (46): NO CHANGE\n k=input().split() # (1): k=['4', ',', '4'] (10): k=['25', ',', '18'] ... (47): k=['0', '?', '0']\n k[0]=int(k[0]) # (2): NO CHANGE (11): NO CHANGE ... (48): NO CHANGE\n k[2]=int(k[2]) # (3): NO CHANGE (12): NO CHANGE ... (49): NO CHANGE\n \n if k[1]==\"?\": # (4): NO CHANGE (13): NO CHANGE ... (50): NO CHANGE\n break\n elif k[1]==\"+\": # (5): NO CHANGE (14): NO CHANGE ... (42): NO CHANGE\n print(k[0]+k[2])\n elif k[1]==\"-\": # (6): NO CHANGE (15): NO CHANGE ... (43): NO CHANGE\n print(k[0]-k[2])\n elif k[1]==\"*\": # (7): NO CHANGE (16): NO CHANGE ... (44): NO CHANGE\n print(k[0]*k[2]) # (26): NO CHANGE\n elif k[1]==\"/\": # (8): NO CHANGE (17): NO CHANGE ... (45): NO CHANGE\n print(k[0]/k[2]) # (36): NO CHANGE\n\n"], "anno_status": [true], "diff_content": " while 1:\n k=input().split()\n k[0]=int(k[0])\n k[2]=int(k[2])\n \n if k[1]==\"?\":\n break\n elif k[1]==\"+\":\n print(k[0]+k[2])\n elif k[1]==\"-\":\n print(k[0]-k[2])\n elif k[1]==\"*\":\n print(k[0]*k[2])\n elif k[1]==\"/\":\n- print(k[0]/k[2])\n+ print(k[0]\n \n \n", "FL_content": "\n while 1:\n k=input().split()\n k[0]=int(k[0])\n k[2]=int(k[2])\n \n if k[1]==\"?\":\n break\n elif k[1]==\"+\":\n- print(k[0]+k[2])\n elif k[1]==\"-\":\n- print(k[0]-k[2])\n elif k[1]==\"*\":\n- print(k[0]*k[2])\n elif k[1]==\"/\":\n- print(k[0]/k[2])\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u826549974", "problem_id": "p01102", "submission1_id": "s117918888-FL", "submission2_id": "s036920305", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while(1):\n a = input()\n if(a == '.'):\n break\n b = input()\n n = len(a)\n m = len(b)\n l = 0;\n flag = 0\n idx_dif = 0\n error_cou = 0\n\n while(1):\n if(l >= n-1 or l+idx_dif >= m-1):\n flag = 2\n\n if(flag == 0):\n for i in range(l,n):\n if(a[i] == '\\\"'):\n if(i+idx_dif < m and a[l:i] == b[l+idx_dif:i+idx_dif]):\n l = i+1\n flag = 1\n else:\n flag = 2\n break\n\n elif(i == n-1):\n if(a[l:i] != b[l+idx_dif:m-1]):\n flag = 2\n else:\n l = n-1\n break\n if(flag != 0):\n break\n\n elif(flag == 1):\n for i in range(l,n):\n if(a[i] == '\\\"'):\n for j in range(l+idx_dif,m):\n if(b[j] == '\\\"'):\n if(a[l:i] != b[l+idx_dif:j]):\n error_cou += 1\n idx_dif = j-i\n l = i+1\n flag = 0\n break\n if(j == m-1):\n flag = 2\n break\n\n if(flag != 1):\n break\n\n if(flag == 2 or l >= n-1 or l+idx_dif >= m-1):\n break\n\n if(error_cou >= 2 or flag == 2):\n print(\"DIFFERENT\")\n elif(error_cou == 1):\n print(\"CLOSE\")\n elif(error_cou == 0):\n print(\"IDENTICAL\")\n", "code2": "while(1):\n a = input()\n if(a == '.'):\n break\n b = input()\n n = len(a)\n m = len(b)\n l = 0;\n flag = 0\n idx_dif = 0\n error_cou = 0\n\n while(1):\n if(l >= n-1 or l+idx_dif >= m-1):\n flag = 2\n\n if(flag == 0):\n for i in range(l,n):\n if(a[i] == '\\\"'):\n if(i+idx_dif < m and a[l:i+1] == b[l+idx_dif:i+idx_dif+1]):\n l = i+1\n flag = 1\n else:\n flag = 2\n break\n\n elif(i == n-1):\n if(a[l:i] != b[l+idx_dif:m-1]):\n flag = 2\n else:\n l = n-1\n break\n if(flag != 0):\n break\n\n elif(flag == 1):\n for i in range(l,n):\n if(a[i] == '\\\"'):\n for j in range(l+idx_dif,m):\n if(b[j] == '\\\"'):\n if(a[l:i+1] != b[l+idx_dif:j+1]):\n error_cou += 1\n idx_dif = j-i\n l = i+1\n flag = 0\n break\n if(j == m-1):\n flag = 2\n break\n\n if(flag != 1):\n break\n\n if(flag == 2 or l >= n-1 or l+idx_dif >= m-1):\n break\n\n if(error_cou >= 2 or flag == 2):\n print(\"DIFFERENT\")\n elif(error_cou == 1):\n print(\"CLOSE\")\n elif(error_cou == 0):\n print(\"IDENTICAL\")\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526995771", "date2": "1526998609", "bleu_score": "0.9916037922929029", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 20, "total_score": 101, "input": "print\"hello\";print133\nprint\"hello\";qrint123\nread\"B1input\";somve;output;\n;tuptuo;evlos;\"2B\"daer\nread\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"\"\"\"\"\"\"\"\n\"\"\"52\"\"#\"\"\nslow\"progr\"ma\nfast\"code\"\n\"super\"fast\"program\"\n\"super\"faster\"prohram\"\nX\"\"\nY\nI\"S\"\"CREAM\"\nI\"CE\"\"BREAM\"\n11\"12\"11\n13\"3\"111\n.\n", "actual_output": "DIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\nDIFFERENT\nDIFFERENT\n", "expected_output": "DIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\n\n", "anno_code": ["while(1): # (0): NO CHANGE (131): NO CHANGE ... (782): NO CHANGE\n a = input() # (1): a=print\"hello\";print133 (132): a=read\"B1input\";somve;output; ... (783): a=.\n if(a == '.'): # (2): NO CHANGE (133): NO CHANGE ... (784): NO CHANGE\n break\n b = input() # (3): b=print\"hello\";qrint123 (134): b=;tuptuo;evlos;\"2B\"daer ... (755): b=13\"3\"111\n n = len(a) # (4): n=21 (135): n=27 ... (756): n=8\n m = len(b) # (5): m=21 (136): m=22 ... (757): m=8\n l = 0; # (6): l=0 (137): l=0 ... (758): l=0\n flag = 0 # (7): flag=0 (138): flag=0 ... (759): NO CHANGE\n idx_dif = 0 # (8): idx_dif=0 (139): NO CHANGE ... (760): idx_dif=0\n error_cou = 0 # (9): error_cou=0 (140): NO CHANGE ... (761): error_cou=0\n\n while(1): # (10): NO CHANGE (40): NO CHANGE ... (762): NO CHANGE\n if(l >= n-1 or l+idx_dif >= m-1): # (11): NO CHANGE (41): NO CHANGE ... (763): NO CHANGE\n flag = 2 # (635): flag=2\n\n if(flag == 0): # (12): NO CHANGE (42): NO CHANGE ... (764): NO CHANGE\n for i in range(l,n): # (13): i=0 (17): i=1 ... (773): i=2\n if(a[i] == '\\\"'): # (14): NO CHANGE (18): NO CHANGE ... (774): NO CHANGE\n if(i+idx_dif < m and a[l:i] == b[l+idx_dif:i+idx_dif]): # (35): NO CHANGE (162): NO CHANGE ... (775): NO CHANGE\n l = i+1 # (36): l=6 (201): l=5 ... (698): l=5\n flag = 1 # (37): flag=1 (202): flag=1 ... (699): flag=1\n else:\n flag = 2 # (163): flag=2 (480): flag=2 (776): flag=2\n break # (38): NO CHANGE (164): NO CHANGE ... (777): NO CHANGE\n\n elif(i == n-1): # (15): NO CHANGE (19): NO CHANGE ... (771): NO CHANGE\n if(a[l:i] != b[l+idx_dif:m-1]): # (124): NO CHANGE\n flag = 2 # (125): flag=2\n else:\n l = n-1\n break # (126): NO CHANGE\n if(flag != 0): # (16): NO CHANGE (20): NO CHANGE ... (772): NO CHANGE\n break\n\n elif(flag == 1): # (43): NO CHANGE (208): NO CHANGE ... (705): NO CHANGE\n for i in range(l,n): # (44): i=6 (47): i=7 ... (721): i=10\n if(a[i] == '\\\"'): # (45): NO CHANGE (48): NO CHANGE ... (722): NO CHANGE\n for j in range(l+idx_dif,m): # (61): j=6 (64): j=7 ... (738): j=11\n if(b[j] == '\\\"'): # (62): NO CHANGE (65): NO CHANGE ... (739): NO CHANGE\n if(a[l:i] != b[l+idx_dif:j]): # (78): NO CHANGE (225): NO CHANGE ... (740): NO CHANGE\n error_cou += 1 # (226): error_cou=1 (335): error_cou=2 ... (741): error_cou=2\n idx_dif = j-i # (79): NO CHANGE (227): NO CHANGE ... (742): NO CHANGE\n l = i+1 # (80): l=12 (228): l=8 ... (743): l=11\n flag = 0 # (81): flag=0 (229): flag=0 ... (744): flag=0\n break # (82): NO CHANGE (230): NO CHANGE ... (745): NO CHANGE\n if(j == m-1): # (63): NO CHANGE (66): NO CHANGE ... (737): NO CHANGE\n flag = 2\n break\n\n if(flag != 1): # (46): NO CHANGE (49): NO CHANGE ... (746): NO CHANGE\n break # (84): NO CHANGE (232): NO CHANGE ... (747): NO CHANGE\n\n if(flag == 2 or l >= n-1 or l+idx_dif >= m-1): # (39): NO CHANGE (85): NO CHANGE ... (778): NO CHANGE\n break # (128): NO CHANGE (166): NO CHANGE ... (779): NO CHANGE\n\n if(error_cou >= 2 or flag == 2): # (129): NO CHANGE (167): NO CHANGE ... (780): NO CHANGE\n print(\"DIFFERENT\") # (130): NO CHANGE (168): NO CHANGE ... (781): NO CHANGE\n elif(error_cou == 1): # (621): NO CHANGE\n print(\"CLOSE\") # (622): NO CHANGE\n elif(error_cou == 0):\n print(\"IDENTICAL\")\n"], "anno_status": [false], "diff_content": " while(1):\n a = input()\n if(a == '.'):\n break\n b = input()\n n = len(a)\n m = len(b)\n l = 0;\n flag = 0\n idx_dif = 0\n error_cou = 0\n \n while(1):\n if(l >= n-1 or l+idx_dif >= m-1):\n flag = 2\n \n if(flag == 0):\n for i in range(l,n):\n if(a[i] == '\\\"'):\n- if(i+idx_dif < m and a[l:i] == b[l+idx_dif:i+idx_dif]):\n+ if(i+idx_dif < m and a[l:i+1] == b[l+idx_dif:i+idx_dif+1]):\n l = i+1\n flag = 1\n else:\n flag = 2\n break\n \n elif(i == n-1):\n if(a[l:i] != b[l+idx_dif:m-1]):\n flag = 2\n else:\n l = n-1\n break\n if(flag != 0):\n break\n \n elif(flag == 1):\n for i in range(l,n):\n if(a[i] == '\\\"'):\n for j in range(l+idx_dif,m):\n if(b[j] == '\\\"'):\n- if(a[l:i] != b[l+idx_dif:j]):\n+ if(a[l:i+1] != b[l+idx_dif:j+1]):\n error_cou += 1\n idx_dif = j-i\n l = i+1\n flag = 0\n break\n if(j == m-1):\n flag = 2\n break\n \n if(flag != 1):\n break\n \n if(flag == 2 or l >= n-1 or l+idx_dif >= m-1):\n break\n \n if(error_cou >= 2 or flag == 2):\n print(\"DIFFERENT\")\n elif(error_cou == 1):\n print(\"CLOSE\")\n elif(error_cou == 0):\n print(\"IDENTICAL\")\n \n", "FL_content": "\n while(1):\n a = input()\n if(a == '.'):\n break\n b = input()\n n = len(a)\n m = len(b)\n l = 0;\n flag = 0\n idx_dif = 0\n error_cou = 0\n \n while(1):\n if(l >= n-1 or l+idx_dif >= m-1):\n flag = 2\n \n if(flag == 0):\n for i in range(l,n):\n if(a[i] == '\\\"'):\n if(i+idx_dif < m and a[l:i] == b[l+idx_dif:i+idx_dif]):\n l = i+1\n flag = 1\n else:\n flag = 2\n break\n \n elif(i == n-1):\n if(a[l:i] != b[l+idx_dif:m-1]):\n flag = 2\n else:\n l = n-1\n break\n if(flag != 0):\n break\n \n elif(flag == 1):\n for i in range(l,n):\n if(a[i] == '\\\"'):\n for j in range(l+idx_dif,m):\n if(b[j] == '\\\"'):\n if(a[l:i] != b[l+idx_dif:j]):\n error_cou += 1\n idx_dif = j-i\n l = i+1\n flag = 0\n break\n if(j == m-1):\n flag = 2\n break\n \n if(flag != 1):\n break\n \n if(flag == 2 or l >= n-1 or l+idx_dif >= m-1):\n break\n \n if(error_cou >= 2 or flag == 2):\n print(\"DIFFERENT\")\n elif(error_cou == 1):\n print(\"CLOSE\")\n elif(error_cou == 0):\n print(\"IDENTICAL\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 63 }, { "user_id": "u369073975", "problem_id": "p02916", "submission1_id": "s822559130-FL", "submission2_id": "s764389103", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\nC = list(map(int,input().split()))\n \nans = sum(B) \nfor i in range(N-1):\n if A[i+1] - A[i] ==1:\n ans += C[i-1]\nprint(ans)\n", "code2": "N = int(input())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\nC = list(map(int,input().split()))\n \nans = sum(B) \nfor i in range(N-1):\n if A[i+1] - A[i] ==1:\n ans += C[A[i]-1]\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569347087", "date2": "1569348279", "bleu_score": "0.9771566346773642", "code1_test_status": [1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0], "code1_test_score": 44, "total_score": 103, "input": "4\n2 3 4 1\n7 5 1 77\n45 9 8\n", "actual_output": "143\n", "expected_output": "107\n\n", "anno_code": ["N = int(input()) # (0): N=4\nA = list(map(int,input().split())) # (1): A=[2, 3, 4, 1]\nB = list(map(int,input().split())) # (2): B=[7, 5, 1, 77]\nC = list(map(int,input().split())) # (3): C=[45, 9, 8]\n \nans = sum(B) # (4): ans=90\nfor i in range(N-1): # (5): i=0 (8): i=1 ... (13): NO CHANGE\n if A[i+1] - A[i] ==1: # (6): NO CHANGE (9): NO CHANGE (12): NO CHANGE\n ans += C[i-1] # (7): ans=98 (10): ans=143\nprint(ans)\n"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int,input().split()))\n B = list(map(int,input().split()))\n C = list(map(int,input().split()))\n \n ans = sum(B) \n for i in range(N-1):\n if A[i+1] - A[i] ==1:\n- ans += C[i-1]\n+ ans += C[A[i]-1]\n print(ans)\n \n", "FL_content": "\n N = int(input())\n A = list(map(int,input().split()))\n B = list(map(int,input().split()))\n C = list(map(int,input().split()))\n \n ans = sum(B) \n for i in range(N-1):\n if A[i+1] - A[i] ==1:\n- ans += C[i-1]\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u941407962", "problem_id": "p03164", "submission1_id": "s625869936-FL", "submission2_id": "s380482191", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, W = map(int, input().split())\nMV = (10**3)*N+1\nMV = 100\ndp = [[0] + [10**18]*(MV-1) for _ in range(N+1)]\ndp[0][0] = 0\nfor i in range(1, N+1):\n w, v = map(int, input().split())\n for j in range(1, MV):\n dp[i][j] = min(dp[i-1][j], dp[i-1][max(0, j-v)]+w)\nfor i in range(MV):\n if dp[N][MV-i-1] <= W:\n print(MV-i-1)\n break\n\n", "code2": "N, W = map(int, input().split())\nMV = (10**3)*N+1\ndp = [[0] + [10**18]*(MV-1) for _ in range(N+1)]\ndp[0][0] = 0\nfor i in range(1, N+1):\n w, v = map(int, input().split())\n for j in range(1, MV):\n dp[i][j] = min(dp[i-1][j], dp[i-1][max(0, j-v)]+w)\nfor i in range(MV):\n if dp[N][MV-i-1] <= W:\n print(MV-i-1)\n break\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1578145606", "date2": "1578145654", "bleu_score": "0.9719526278341482", "code1_test_status": [1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 73, "total_score": 103, "input": "3 10\n3 35\n1 14\n5 78\n", "actual_output": "99\n", "expected_output": "127\n\n", "anno_code": ["N, W = map(int, input().split()) # (0): N=3, W=10\nMV = (10**3)*N+1 # (1): MV=3001\nMV = 100 # (2): MV=100\ndp = [[0] + [10**18]*(MV-1) for _ in range(N+1)] # (3): dp\ndp[0][0] = 0 # (4): NO CHANGE\nfor i in range(1, N+1): # (5): i=1 (206): i=2 ... (608): NO CHANGE\n w, v = map(int, input().split()) # (6): w=3, v=35 (207): w=1, v=14 (408): w=5, v=78\n for j in range(1, MV): # (7): j=1 (9): j=2 ... (607): NO CHANGE\n dp[i][j] = min(dp[i-1][j], dp[i-1][max(0, j-v)]+w) # (8): dp (10): dp ... (606): dp\nfor i in range(MV): # (609): i=0\n if dp[N][MV-i-1] <= W: # (610): NO CHANGE\n print(MV-i-1) # (611): NO CHANGE\n break\n\n"], "anno_status": [true], "diff_content": " N, W = map(int, input().split())\n MV = (10**3)*N+1\n-MV = 100\n dp = [[0] + [10**18]*(MV-1) for _ in range(N+1)]\n dp[0][0] = 0\n for i in range(1, N+1):\n w, v = map(int, input().split())\n for j in range(1, MV):\n dp[i][j] = min(dp[i-1][j], dp[i-1][max(0, j-v)]+w)\n for i in range(MV):\n if dp[N][MV-i-1] <= W:\n print(MV-i-1)\n break\n \n \n", "FL_content": "\n N, W = map(int, input().split())\n MV = (10**3)*N+1\n-MV = 100\n dp = [[0] + [10**18]*(MV-1) for _ in range(N+1)]\n dp[0][0] = 0\n for i in range(1, N+1):\n w, v = map(int, input().split())\n for j in range(1, MV):\n dp[i][j] = min(dp[i-1][j], dp[i-1][max(0, j-v)]+w)\n for i in range(MV):\n if dp[N][MV-i-1] <= W:\n print(MV-i-1)\n break\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u657361950", "problem_id": "p02234", "submission1_id": "s818005440-FL", "submission2_id": "s481733988", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\ndef get_min_cost(n, p):\n\tm = [[0 for x in range(n+1)] for x in range(n+1)]\n\tfor s in range(n):\n\t\ti = 1\n\t\tfor j in range(s+2, n):\n\t\t\tm[i][j] = sys.maxsize\n\t\t\tfor k in range(i, j+1):\n\t\t\t\tm[i][j] = min(m[i][j], m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j])\n\t\t\ti+=1\t\n\treturn m[1][n]\n\nn = int(input())\np = [0] * (n+1)\nj = 0\nfor i in range(n):\n\ta = list(map(int, input().split()))\n\tif i == 0:\n\t\tp[j] = a[0]\n\t\tj += 1\n\tp[j] = a[1]\n\tj += 1\nprint(get_min_cost(n, p))\n\t\t\n\t\t\n", "code2": "import sys\n\ndef get_min_cost(n, p):\n\tm = [[0 for x in range(n+1)] for x in range(n+1)]\n\tfor s in range(n):\n\t\ti = 1\n\t\tfor j in range(s+2, n+1):\n\t\t\tm[i][j] = sys.maxsize\n\t\t\tfor k in range(i, j):\n\t\t\t\tm[i][j] = min(m[i][j], m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j])\n\t\t\ti+=1\t\n\treturn m[1][n]\n\nn = int(input())\np = [0] * (n+1)\nj = 0\nfor i in range(n):\n\ta = list(map(int, input().split()))\n\tif i == 0:\n\t\tp[j] = a[0]\n\t\tj += 1\n\tp[j] = a[1]\n\tj += 1\nprint(get_min_cost(n, p))\n\t\t\n\t\t\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1535431920", "date2": "1535432084", "bleu_score": "0.9935040438571177", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 70, "total_score": 101, "input": "6\n10 35\n35 15\n15 5\n5 10\n10 20\n20 5\n", "actual_output": "0\n", "expected_output": "5875\n\n", "anno_code": ["import sys\n\ndef get_min_cost(n, p): # (0): get_min_cost=\n\tm = [[0 for x in range(n+1)] for x in range(n+1)] # (38): m\n\tfor s in range(n): # (39): s=0 (74): s=1 ... (154): s=5\n\t\ti = 1 # (40): i=1 (75): i=1 ... (155): NO CHANGE\n\t\tfor j in range(s+2, n): # (41): j=2 (49): j=3 ... (156): NO CHANGE\n\t\t\tm[i][j] = sys.maxsize # (42): m (50): m ... (137): m\n\t\t\tfor k in range(i, j+1): # (43): k=1 (45): k=2 ... (148): NO CHANGE\n\t\t\t\tm[i][j] = min(m[i][j], m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j]) # (44): m (46): NO CHANGE ... (147): NO CHANGE\n\t\t\ti+=1\t # (48): i=2 (56): i=3 ... (149): i=2\n\treturn m[1][n]\n\nn = int(input()) # (1): n=6\np = [0] * (n+1) # (2): p=[0, 0, 0, 0, 0, 0, 0]\nj = 0 # (3): j=0\nfor i in range(n): # (4): i=0 (11): i=1 ... (36): NO CHANGE\n\ta = list(map(int, input().split())) # (5): a=[10, 35] (12): a=[35, 15] ... (32): a=[20, 5]\n\tif i == 0: # (6): NO CHANGE (13): NO CHANGE ... (33): NO CHANGE\n\t\tp[j] = a[0] # (7): p=[10, 0, 0, 0, 0, 0, 0]\n\t\tj += 1 # (8): j=1\n\tp[j] = a[1] # (9): p=[10, 35, 0, 0, 0, 0, 0] (14): p=[10, 35, 15, 0, 0, 0, 0] ... (34): p=[10, 35, 15, 5, 10, 20, 5]\n\tj += 1 # (10): j=2 (15): j=3 ... (35): j=7\nprint(get_min_cost(n, p)) # (37): NO CHANGE\n\t\t\n\t\t\n"], "anno_status": [true], "diff_content": " import sys\n \n def get_min_cost(n, p):\n \tm = [[0 for x in range(n+1)] for x in range(n+1)]\n \tfor s in range(n):\n \t\ti = 1\n-\t\tfor j in range(s+2, n):\n+\t\tfor j in range(s+2, n+1):\n \t\t\tm[i][j] = sys.maxsize\n-\t\t\tfor k in range(i, j+1):\n+\t\t\tfor k in range(i, j):\n \t\t\t\tm[i][j] = min(m[i][j], m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j])\n \t\t\ti+=1\t\n \treturn m[1][n]\n \n n = int(input())\n p = [0] * (n+1)\n j = 0\n for i in range(n):\n \ta = list(map(int, input().split()))\n \tif i == 0:\n \t\tp[j] = a[0]\n \t\tj += 1\n \tp[j] = a[1]\n \tj += 1\n print(get_min_cost(n, p))\n \t\t\n \t\t\n \n", "FL_content": "\n import sys\n \n def get_min_cost(n, p):\n \tm = [[0 for x in range(n+1)] for x in range(n+1)]\n \tfor s in range(n):\n \t\ti = 1\n-\t\tfor j in range(s+2, n):\n \t\t\tm[i][j] = sys.maxsize\n \t\t\tfor k in range(i, j+1):\n \t\t\t\tm[i][j] = min(m[i][j], m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j])\n \t\t\ti+=1\t\n \treturn m[1][n]\n \n n = int(input())\n p = [0] * (n+1)\n j = 0\n for i in range(n):\n \ta = list(map(int, input().split()))\n \tif i == 0:\n \t\tp[j] = a[0]\n \t\tj += 1\n \tp[j] = a[1]\n \tj += 1\n print(get_min_cost(n, p))\n \t\t\n \t\t\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u048472001", "problem_id": "p03838", "submission1_id": "s537624712-FL", "submission2_id": "s450624224", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nx, y = map(int, input() .split())\n\n\nif y > x:\n\tif abs(x) > abs(y):\n\t\ta = y-x\n\telse:\n\t\ta = min(y-x, y-abs(x)+1)\nelse:\n\tif x < 0:\n\t\ta = abs(abs(x) - abs(y)) + 2\n\telse:\n\t\ta = abs(abs(x) - abs(y)) + 1\n\nprint (a)\n\n", "code2": "\nx, y = map(int, input() .split())\n\n\nif y > x:\n\tif x*y >= 0:\n\t\ta = y-x\n\telse:\n\t\ta = abs(abs(x) - abs(y)) + 1\nelse:\n\tif x*y > 0:\n\t\ta = abs(abs(x) - abs(y)) + 2\n\telse:\n\t\ta = abs(abs(x) - abs(y)) + 1\n\nprint (a)\n\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1487613694", "date2": "1487614115", "bleu_score": "0.8833277741560989", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 90, "input": "101 1\n", "actual_output": "101\n", "expected_output": "102\n\n", "anno_code": ["\nx, y = map(int, input() .split()) # (0): x=101, y=1\n\n\nif y > x: # (1): NO CHANGE\n\tif abs(x) > abs(y):\n\t\ta = y-x\n\telse:\n\t\ta = min(y-x, y-abs(x)+1)\nelse:\n\tif x < 0: # (2): NO CHANGE\n\t\ta = abs(abs(x) - abs(y)) + 2\n\telse:\n\t\ta = abs(abs(x) - abs(y)) + 1 # (3): a=101\n\nprint (a)\n\n"], "anno_status": [true], "diff_content": " \n x, y = map(int, input() .split())\n \n \n if y > x:\n-\tif abs(x) > abs(y):\n+\tif x*y >= 0:\n \t\ta = y-x\n \telse:\n-\t\ta = min(y-x, y-abs(x)+1)\n+\t\ta = abs(abs(x) - abs(y)) + 1\n else:\n-\tif x < 0:\n+\tif x*y > 0:\n \t\ta = abs(abs(x) - abs(y)) + 2\n \telse:\n \t\ta = abs(abs(x) - abs(y)) + 1\n \n print (a)\n \n \n+\n", "FL_content": "\n \n x, y = map(int, input() .split())\n \n \n if y > x:\n \tif abs(x) > abs(y):\n \t\ta = y-x\n \telse:\n \t\ta = min(y-x, y-abs(x)+1)\n else:\n \tif x < 0:\n-\t\ta = abs(abs(x) - abs(y)) + 2\n \telse:\n-\t\ta = abs(abs(x) - abs(y)) + 1\n \n print (a)\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u558528117", "problem_id": "p03856", "submission1_id": "s120247655-FL", "submission2_id": "s023355238", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\ndef solve(s):\n sys.stderr.write(s)\n sys.stderr.write(\"\\n\")\n\n while(len(s) >= 1):\n if s == \"\":\n return True\n elif s.startswith(\"maerd\"):\n s = s[5:]\n elif s.startswith(\"remaerd\"):\n s = s[7:]\n elif s.startswith(\"esare\"):\n s = s[5:]\n elif s.startswith(\"resare\"):\n s = s[6:]\n else:\n return False\n\n\n\ndef main():\n line = sys.stdin.readline().rstrip()\n line_rev = line[::-1]\n\n if solve(line):\n print(\"YES\")\n else:\n print(\"NO\")\n\n return 0\n\nif __name__ == '__main__':\n sys.exit(main())\n", "code2": "import sys\n\ndef solve(s):\n tmp_s = s\n while(len(tmp_s) > 0):\n if tmp_s.startswith(\"maerd\"):\n tmp_s = tmp_s[5:]\n elif tmp_s.startswith(\"remaerd\"):\n tmp_s = tmp_s[7:]\n elif tmp_s.startswith(\"esare\"):\n tmp_s = tmp_s[5:]\n elif tmp_s.startswith(\"resare\"):\n tmp_s = tmp_s[6:]\n else:\n return False\n\n return True\n\ndef main():\n line = sys.stdin.readline().rstrip()\n line_rev = line[::-1]\n\n if solve(line_rev):\n print(\"YES\")\n else:\n print(\"NO\")\n\n return 0\n\nif __name__ == '__main__':\n sys.exit(main())\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1492947783", "date2": "1492948313", "bleu_score": "0.839662200924308", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "NO\n", "expected_output": "YES\n", "anno_code": ["import sys\n\ndef solve(s): # (0): solve=\n sys.stderr.write(s)\n sys.stderr.write(\"\\n\")\n\n while(len(s) >= 1):\n if s == \"\":\n return True\n elif s.startswith(\"maerd\"):\n s = s[5:]\n elif s.startswith(\"remaerd\"):\n s = s[7:]\n elif s.startswith(\"esare\"):\n s = s[5:]\n elif s.startswith(\"resare\"):\n s = s[6:]\n else:\n return False\n\n\n\ndef main(): # (1): main=\n line = sys.stdin.readline().rstrip()\n line_rev = line[::-1]\n\n if solve(line):\n print(\"YES\")\n else:\n print(\"NO\")\n\n return 0\n\nif __name__ == '__main__':\n sys.exit(main())\n"], "anno_status": [true], "diff_content": " import sys\n \n def solve(s):\n- sys.stderr.write(s)\n- sys.stderr.write(\"\\n\")\n-\n- while(len(s) >= 1):\n- if s == \"\":\n- return True\n- elif s.startswith(\"maerd\"):\n- s = s[5:]\n- elif s.startswith(\"remaerd\"):\n- s = s[7:]\n- elif s.startswith(\"esare\"):\n- s = s[5:]\n- elif s.startswith(\"resare\"):\n- s = s[6:]\n+ tmp_s = s\n+ while(len(tmp_s) > 0):\n+ if tmp_s.startswith(\"maerd\"):\n+ tmp_s = tmp_s[5:]\n+ elif tmp_s.startswith(\"remaerd\"):\n+ tmp_s = tmp_s[7:]\n+ elif tmp_s.startswith(\"esare\"):\n+ tmp_s = tmp_s[5:]\n+ elif tmp_s.startswith(\"resare\"):\n+ tmp_s = tmp_s[6:]\n else:\n return False\n \n-\n+ return True\n \n def main():\n line = sys.stdin.readline().rstrip()\n line_rev = line[::-1]\n \n- if solve(line):\n+ if solve(line_rev):\n print(\"YES\")\n else:\n print(\"NO\")\n \n return 0\n \n if __name__ == '__main__':\n sys.exit(main())\n \n", "FL_content": "\n import sys\n \n def solve(s):\n sys.stderr.write(s)\n sys.stderr.write(\"\\n\")\n \n while(len(s) >= 1):\n if s == \"\":\n return True\n- elif s.startswith(\"maerd\"):\n s = s[5:]\n- elif s.startswith(\"remaerd\"):\n s = s[7:]\n- elif s.startswith(\"esare\"):\n s = s[5:]\n- elif s.startswith(\"resare\"):\n s = s[6:]\n else:\n return False\n \n \n \n def main():\n line = sys.stdin.readline().rstrip()\n line_rev = line[::-1]\n \n if solve(line):\n print(\"YES\")\n else:\n print(\"NO\")\n \n return 0\n \n if __name__ == '__main__':\n sys.exit(main())\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 36 }, { "user_id": "u060432908", "problem_id": "p02555", "submission1_id": "s037035981-FL", "submission2_id": "s085563363", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=int(input())\na=[0]*(s+1)\na[0]=1\nfor i in range(3,s+1):\n a[i]=a[i-3]+a[i-1]\nprint(a[s])\n", "code2": "s=int(input())\na=[0]*(s+1)\na[0]=1\nmod=10**9+7\nfor i in range(3,s+1):\n a[i]=a[i-3]+a[i-1]\nprint(a[s]%mod)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600282749", "date2": "1600282794", "bleu_score": "0.8306469110815197", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "1175\n", "actual_output": "222082587837603619274593483203391180802037866641192048751248765122136742137783076324009281892235152635363849727350867532428947938145250190943173841430893752789035492017850556523457835441497662096\n", "expected_output": "531468532\n\n", "anno_code": ["s=int(input()) # (0): s=1175\na=[0]*(s+1) # (1): a=[0, 0, ..., 0, 0]\na[0]=1 # (2): a=[1, 0, ..., 0, 0]\nfor i in range(3,s+1): # (3): i=3 (5): i=4 ... (2349): NO CHANGE\n a[i]=a[i-3]+a[i-1] # (4): a=[1, 0, ..., 0, 0] (6): a=[1, 0, ..., 0, 0] ... (2348): a=[1, 0, ..., 151533124427675273326248664315745577724209644216272302728291518006463361373946705970034209568937249497738664313353291116196259709064772797621455304105994055257351873614134613660044963440038854511, 222082587837603619274593483203391180802037866641192048751248765122136742137783076324009281892235152635363849727350867532428947938145250190943173841430893752789035492017850556523457835441497662096]\nprint(a[s])\n"], "anno_status": [true], "diff_content": " s=int(input())\n a=[0]*(s+1)\n a[0]=1\n+mod=10**9+7\n for i in range(3,s+1):\n a[i]=a[i-3]+a[i-1]\n-print(a[s])\n+print(a[s]%mod)\n \n", "FL_content": "\n s=int(input())\n a=[0]*(s+1)\n a[0]=1\n for i in range(3,s+1):\n- a[i]=a[i-3]+a[i-1]\n print(a[s])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u744021017", "problem_id": "p03558", "submission1_id": "s648988676-FL", "submission2_id": "s853431842", "status1": "Wrong Answer", "status2": "Accepted", "code1": "K = int(input())\n\nL = {i: -1 for i in range(K)}\nL[1] = 1\nbiq = [1]\n\nwhile len(biq) > 0:\n i = biq.pop(0)\n j = (i * 10) % K\n if L[j] < 0:\n L[j] = L[i]\n biq.insert(0, j)\n k = 0 if i == K - 1 else i + 1\n if L[k] < 0:\n L[k] = L[i] + 1\n biq.insert(-1, k)\n\nprint(L[0])\n", "code2": "from collections import deque\nK = int(input())\n\nL = {i: 10**6 for i in range(K)}\nL[1] = 1\nbiq = deque()\nbiq.append(1)\n\nwhile len(biq) > 0:\n i = biq.popleft()\n if i == 0:\n break\n j = (i * 10) % K\n if L[j] > L[i]:\n L[j] = L[i]\n biq.appendleft(j)\n k = 0 if i == K - 1 else i + 1\n if L[k] > L[i]:\n L[k] = L[i] + 1\n biq.append(k)\n\nprint(L[0])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1513745469", "date2": "1513746020", "bleu_score": "0.6853635742056177", "code1_test_status": [1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 10, "total_score": 22, "input": "9736\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": "+from collections import deque\n K = int(input())\n \n-L = {i: -1 for i in range(K)}\n+L = {i: 10**6 for i in range(K)}\n L[1] = 1\n-biq = [1]\n+biq = deque()\n+biq.append(1)\n \n while len(biq) > 0:\n- i = biq.pop(0)\n+ i = biq.popleft()\n+ if i == 0:\n+ break\n j = (i * 10) % K\n- if L[j] < 0:\n+ if L[j] > L[i]:\n L[j] = L[i]\n- biq.insert(0, j)\n+ biq.appendleft(j)\n k = 0 if i == K - 1 else i + 1\n- if L[k] < 0:\n+ if L[k] > L[i]:\n L[k] = L[i] + 1\n- biq.insert(-1, k)\n+ biq.append(k)\n \n print(L[0])\n \n", "FL_content": "\n K = int(input())\n \n-L = {i: -1 for i in range(K)}\n L[1] = 1\n biq = [1]\n \n while len(biq) > 0:\n i = biq.pop(0)\n j = (i * 10) % K\n if L[j] < 0:\n L[j] = L[i]\n biq.insert(0, j)\n k = 0 if i == K - 1 else i + 1\n if L[k] < 0:\n L[k] = L[i] + 1\n biq.insert(-1, k)\n \n print(L[0])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u957840591", "problem_id": "p00015", "submission1_id": "s503839163-FL", "submission2_id": "s121335692", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nA=[]\nB=[]\nfor i in range(N):\n a = int(input())\n b = int(input())\n A.append(a)\n B.append(b)\n\nfor i in range(N):\n if A[i] >= 10 ** 79 or B[i] >= 10 ** 79:\n print(\"overflow\")\n elif A[i] + B[i]>= 10 ** 79:\n print(\"overflow\")\n else:\n print(str(A[i]+B[i]))", "code2": "N = int(input())\nA = []\nB = []\nfor i in range(N):\n a = int(input())\n b = int(input())\n A.append(a)\n B.append(b)\n\nfor i in range(N):\n if A[i] >= 10 ** 80 or B[i] >= 10 ** 80:\n print(\"overflow\")\n elif A[i] + B[i] >= 10 ** 80:\n print(\"overflow\")\n else:\n print(str(A[i] + B[i]))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1497342277", "date2": "1497342577", "bleu_score": "0.9063659341768328", "code1_test_status": [0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0], "code1_test_score": 34, "total_score": 101, "input": "6\n1000\n476\n9999999999999999999999999999999999999999\n1\n193919268602104111709736623030259273252485145760643079255618727884865768962159432\n0\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n0\n101000000000100000000000000000000000000000000000000000000000000000000000000000000\n1\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n100000010000000000000000000000001000000000000000000000000000000000000000000000000\n", "actual_output": "1476\n10000000000000000000000000000000000000000\noverflow\noverflow\noverflow\noverflow\n", "expected_output": "1476\n10000000000000000000000000000000000000000\noverflow\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\noverflow\noverflow\n\n", "anno_code": ["N=int(input()) # (0): N=6\nA=[] # (1): A=[]\nB=[] # (2): B=[]\nfor i in range(N): # (3): i=0 (8): i=1 ... (33): NO CHANGE\n a = int(input()) # (4): a=1000 (9): a=9999999999999999999999999999999999999999 ... (29): a=100000000000000000000000000000000000000000000000000000000000000000000000000000000\n b = int(input()) # (5): b=476 (10): b=1 ... (30): b=100000010000000000000000000000001000000000000000000000000000000000000000000000000\n A.append(a) # (6): A=[1000] (11): A=[1000, 9999999999999999999999999999999999999999] ... (31): A=[1000, 9999999999999999999999999999999999999999, 193919268602104111709736623030259273252485145760643079255618727884865768962159432, 99999999999999999999999999999999999999999999999999999999999999999999999999999999, 101000000000100000000000000000000000000000000000000000000000000000000000000000000, 100000000000000000000000000000000000000000000000000000000000000000000000000000000]\n B.append(b) # (7): B=[476] (12): B=[476, 1] ... (32): B=[476, 1, 0, 0, 1, 100000010000000000000000000000001000000000000000000000000000000000000000000000000]\n\nfor i in range(N): # (34): i=0 (38): i=1 ... (51): i=5\n if A[i] >= 10 ** 79 or B[i] >= 10 ** 79: # (35): NO CHANGE (39): NO CHANGE ... (52): NO CHANGE\n print(\"overflow\") # (44): NO CHANGE (47): NO CHANGE ... (53): NO CHANGE\n elif A[i] + B[i]>= 10 ** 79: # (36): NO CHANGE (40): NO CHANGE\n print(\"overflow\")\n else:\n print(str(A[i]+B[i])) # (37): NO CHANGE (41): NO CHANGE\n"], "anno_status": [false], "diff_content": "-N=int(input())\n-A=[]\n-B=[]\n+N = int(input())\n+A = []\n+B = []\n for i in range(N):\n a = int(input())\n b = int(input())\n A.append(a)\n B.append(b)\n \n for i in range(N):\n- if A[i] >= 10 ** 79 or B[i] >= 10 ** 79:\n+ if A[i] >= 10 ** 80 or B[i] >= 10 ** 80:\n print(\"overflow\")\n- elif A[i] + B[i]>= 10 ** 79:\n+ elif A[i] + B[i] >= 10 ** 80:\n print(\"overflow\")\n else:\n- print(str(A[i]+B[i]))\n+ print(str(A[i] + B[i]))\n", "FL_content": "\n N=int(input())\n A=[]\n B=[]\n for i in range(N):\n a = int(input())\n b = int(input())\n A.append(a)\n B.append(b)\n \n for i in range(N):\n- if A[i] >= 10 ** 79 or B[i] >= 10 ** 79:\n print(\"overflow\")\n- elif A[i] + B[i]>= 10 ** 79:\n print(\"overflow\")\n else:\n print(str(A[i]+B[i]))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u527993431", "problem_id": "p03012", "submission1_id": "s438372287-FL", "submission2_id": "s908791509", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A = int(input())\nW = list(map(int,input().split()))\ntmp = 0\nans = 0\nwa = 0\n\nfor i in range (A):\n wa += W[i]\nfor i in range (A):\n tmp += W[i]\n tmp_r = wa-tmp\n if i == 0:\n ans = tmp\n if ans > abs(tmp-tmp_r):\n ans = abs(tmp-tmp_r)\nprint(ans)", "code2": "A = int(input())\nW = list(map(int,input().split()))\ntmp = 0\nans = 0\nwa = 0\n\nfor i in range (A):\n wa += W[i]\nfor i in range (A):\n tmp += W[i]\n tmp_r = wa-tmp\n if i == 0:\n ans = abs(tmp-tmp_r)\n if ans > abs(tmp-tmp_r):\n ans = abs(tmp-tmp_r)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577566274", "date2": "1577566711", "bleu_score": "0.9492973426535558", "code1_test_status": [0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 19, "total_score": 100, "input": "8\n1 5 38 0 0 1 235 5\n", "actual_output": "1\n", "expected_output": "195\n\n", "anno_code": ["A = int(input()) # (0): A=8\nW = list(map(int,input().split())) # (1): W=[1, 5, 38, 0, 0, 1, 235, 5]\ntmp = 0 # (2): tmp=0\nans = 0 # (3): ans=0\nwa = 0 # (4): wa=0\n\nfor i in range (A): # (5): i=0 (7): i=1 ... (21): NO CHANGE\n wa += W[i] # (6): wa=1 (8): wa=6 ... (20): wa=285\nfor i in range (A): # (22): i=0 (28): i=1 ... (63): NO CHANGE\n tmp += W[i] # (23): tmp=1 (29): tmp=6 ... (59): tmp=285\n tmp_r = wa-tmp # (24): tmp_r=284 (30): tmp_r=279 ... (60): tmp_r=0\n if i == 0: # (25): NO CHANGE (31): NO CHANGE ... (61): NO CHANGE\n ans = tmp # (26): ans=1\n if ans > abs(tmp-tmp_r): # (27): NO CHANGE (32): NO CHANGE ... (62): NO CHANGE\n ans = abs(tmp-tmp_r)\nprint(ans)"], "anno_status": [true], "diff_content": " A = int(input())\n W = list(map(int,input().split()))\n tmp = 0\n ans = 0\n wa = 0\n \n for i in range (A):\n wa += W[i]\n for i in range (A):\n tmp += W[i]\n tmp_r = wa-tmp\n if i == 0:\n- ans = tmp\n+ ans = abs(tmp-tmp_r)\n if ans > abs(tmp-tmp_r):\n ans = abs(tmp-tmp_r)\n print(ans)\n", "FL_content": "\n A = int(input())\n W = list(map(int,input().split()))\n tmp = 0\n ans = 0\n wa = 0\n \n for i in range (A):\n wa += W[i]\n for i in range (A):\n tmp += W[i]\n tmp_r = wa-tmp\n- if i == 0:\n- ans = tmp\n if ans > abs(tmp-tmp_r):\n ans = abs(tmp-tmp_r)\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u754022296", "problem_id": "p03880", "submission1_id": "s022571856-FL", "submission2_id": "s230585668", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nA = [int(input()) for _ in range(n)]\nm = 30\nC = [False]*m\nx = 0\nfor a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\ntotal = 0\nans = 0\nfor i in range(m):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\nelse:\n print(ans)", "code2": "n = int(input())\nA = [int(input()) for _ in range(n)]\nm = 30\nC = [False]*m\nx = 0\nfor a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\n break\ntotal = 0\nans = 0\nfor i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\nelse:\n print(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1583188218", "date2": "1583188454", "bleu_score": "0.9289522765432772", "code1_test_status": [1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 70, "total_score": 89, "input": "3\n2\n5\n6\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["n = int(input()) # (0): n=3\nA = [int(input()) for _ in range(n)] # (1): A=[2, 5, 6]\nm = 30 # (2): m=30\nC = [False]*m # (3): C=[False, False, ..., False, False]\nx = 0 # (4): x=0\nfor a in A: # (5): a=2 (69): a=5 ... (199): NO CHANGE\n x ^= a # (6): x=2 (70): x=7 (135): x=1\n for i in range(m): # (7): i=0 (9): i=1 ... (198): NO CHANGE\n if a>>i & 1: # (8): NO CHANGE (10): NO CHANGE ... (197): NO CHANGE\n C[i] = True # (11): C=[False, True, ..., False, False] (73): C=[True, True, ..., False, False] ... (143): NO CHANGE\ntotal = 0 # (200): total=0\nans = 0 # (201): ans=0\nfor i in range(m): # (202): i=0 (207): i=1 ... (268): NO CHANGE\n if (x>>i & 1) ^ total: # (203): NO CHANGE (208): NO CHANGE ... (267): NO CHANGE\n if C[i]: # (204): NO CHANGE (209): NO CHANGE\n ans += 1 # (205): ans=1 (210): ans=2\n total ^= 1 # (206): total=1 (211): total=0\n else:\n print(-1)\n break\nelse:\n print(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n A = [int(input()) for _ in range(n)]\n m = 30\n C = [False]*m\n x = 0\n for a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\n+ break\n total = 0\n ans = 0\n-for i in range(m):\n+for i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\n else:\n print(ans)\n", "FL_content": "\n n = int(input())\n A = [int(input()) for _ in range(n)]\n-m = 30\n-C = [False]*m\n x = 0\n for a in A:\n x ^= a\n- for i in range(m):\n- if a>>i & 1:\n- C[i] = True\n total = 0\n ans = 0\n for i in range(m):\n if (x>>i & 1) ^ total:\n- if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\n else:\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u087356957", "problem_id": "p02702", "submission1_id": "s331921778-FL", "submission2_id": "s042020839", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\n\nS = stdin.readline().rstrip()\nN = len(S)\nSp = S\n\nres_map = [0 for _ in range(N)]\n\naa_list2 = [1]\nfor i in range(1,N):\n aa_list2.append((aa_list2[i-1]*10)%2019)\n\n\nres_map[N-1] = int(S[N-1])\nindex=1\nfor i in range(N-2,-1,-1):\n res_map[i] = (int(S[i])*aa_list2[index] + res_map[i+1])%2019\n index+=1\n\nres_map.sort()\ntemp_num=res_map[0]\nindex=1\ntot = 0\n\nfor i in range(1,N):\n if temp_num==res_map[i]:\n index+=1\n continue\n else:\n if index==1 and temp_num==0:\n tot+=1\n elif index>1:\n tot += index*(index-1)/2\n \n index=1\n temp_num=res_map[i]\n\n\n\n\n\nprint(int(tot))\n\n", "code2": "from sys import stdin\n\nS = stdin.readline().rstrip()\nN = len(S)\nSp = S\n\nres_map = [0 for _ in range(N)]\n\naa_list2 = [1]\nfor i in range(1,N):\n aa_list2.append((aa_list2[i-1]*10)%2019)\n\nres_map[N-1] = int(S[N-1])\nindex=1\n\n\nfor i in range(N-2,-1,-1):\n res_map[i] = (int(S[i])*aa_list2[index] + res_map[i+1])%2019\n index+=1\n\naa_table = [0 for i in range(2019)]\nfor i in range(len(res_map)):\n aa_table[res_map[i]]+=1\n\naa_table[0]+=1\n\ntot = 0\nfor i in range(2019):\n tot+=int((aa_table[i]-1)*aa_table[i]/2)\n\nprint(tot)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1587954058", "date2": "1587957615", "bleu_score": "0.6095067740074601", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 69, "total_score": 74, "input": "3054417607960\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["from sys import stdin\n\nS = stdin.readline().rstrip() # (0): S=3054417607960\nN = len(S) # (1): N=13\nSp = S # (2): Sp=3054417607960\n\nres_map = [0 for _ in range(N)] # (3): res_map=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\naa_list2 = [1] # (4): aa_list2=[1]\nfor i in range(1,N): # (5): i=1 (7): i=2 ... (29): NO CHANGE\n aa_list2.append((aa_list2[i-1]*10)%2019) # (6): aa_list2=[1, 10] (8): aa_list2=[1, 10, 100] ... (28): aa_list2=[1, 10, 100, 1000, 1924, 1069, 595, 1912, 949, 1414, 7, 70, 700]\n\n\nres_map[N-1] = int(S[N-1]) # (30): NO CHANGE\nindex=1 # (31): index=1\nfor i in range(N-2,-1,-1): # (32): i=11 (35): i=10 ... (68): NO CHANGE\n res_map[i] = (int(S[i])*aa_list2[index] + res_map[i+1])%2019 # (33): res_map=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 60, 0] (36): res_map=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 960, 60, 0] ... (66): res_map=[1753, 1672, 1672, 1637, 19, 261, 368, 241, 1903, 1903, 960, 60, 0]\n index+=1 # (34): index=2 (37): index=3 ... (67): index=13\n\nres_map.sort() # (69): res_map=[0, 19, 60, 241, 261, 368, 960, 1637, 1672, 1672, 1753, 1903, 1903]\ntemp_num=res_map[0] # (70): temp_num=0\nindex=1 # (71): index=1\ntot = 0 # (72): tot=0\n\nfor i in range(1,N): # (73): i=1 (79): i=2 ... (142): NO CHANGE\n if temp_num==res_map[i]: # (74): NO CHANGE (80): NO CHANGE ... (139): NO CHANGE\n index+=1 # (123): index=2 (140): index=2\n continue # (124): NO CHANGE (141): NO CHANGE\n else:\n if index==1 and temp_num==0: # (75): NO CHANGE (81): NO CHANGE ... (134): NO CHANGE\n tot+=1 # (76): tot=1\n elif index>1: # (82): NO CHANGE (88): NO CHANGE ... (135): NO CHANGE\n tot += index*(index-1)/2 # (129): tot=2.0\n \n index=1 # (77): NO CHANGE (83): NO CHANGE ... (136): NO CHANGE\n temp_num=res_map[i] # (78): temp_num=19 (84): temp_num=60 ... (137): temp_num=1903\n\n\n\n\n\nprint(int(tot))\n\n"], "anno_status": [false], "diff_content": " from sys import stdin\n \n S = stdin.readline().rstrip()\n N = len(S)\n Sp = S\n \n res_map = [0 for _ in range(N)]\n \n aa_list2 = [1]\n for i in range(1,N):\n aa_list2.append((aa_list2[i-1]*10)%2019)\n \n-\n res_map[N-1] = int(S[N-1])\n index=1\n+\n+\n for i in range(N-2,-1,-1):\n res_map[i] = (int(S[i])*aa_list2[index] + res_map[i+1])%2019\n index+=1\n \n-res_map.sort()\n-temp_num=res_map[0]\n-index=1\n-tot = 0\n+aa_table = [0 for i in range(2019)]\n+for i in range(len(res_map)):\n+ aa_table[res_map[i]]+=1\n \n-for i in range(1,N):\n- if temp_num==res_map[i]:\n- index+=1\n- continue\n- else:\n- if index==1 and temp_num==0:\n- tot+=1\n- elif index>1:\n- tot += index*(index-1)/2\n- \n- index=1\n- temp_num=res_map[i]\n+aa_table[0]+=1\n \n+tot = 0\n+for i in range(2019):\n+ tot+=int((aa_table[i]-1)*aa_table[i]/2)\n \n-\n-\n-\n-print(int(tot))\n-\n+print(tot)\n \n", "FL_content": "\n from sys import stdin\n \n S = stdin.readline().rstrip()\n N = len(S)\n Sp = S\n \n res_map = [0 for _ in range(N)]\n \n aa_list2 = [1]\n for i in range(1,N):\n aa_list2.append((aa_list2[i-1]*10)%2019)\n \n \n res_map[N-1] = int(S[N-1])\n index=1\n for i in range(N-2,-1,-1):\n res_map[i] = (int(S[i])*aa_list2[index] + res_map[i+1])%2019\n index+=1\n \n res_map.sort()\n temp_num=res_map[0]\n index=1\n tot = 0\n \n for i in range(1,N):\n if temp_num==res_map[i]:\n index+=1\n continue\n else:\n if index==1 and temp_num==0:\n tot+=1\n elif index>1:\n tot += index*(index-1)/2\n \n index=1\n temp_num=res_map[i]\n \n \n \n \n \n print(int(tot))\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 44 }, { "user_id": "u513844316", "problem_id": "p03448", "submission1_id": "s364884144-FL", "submission2_id": "s002126293", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A=int(input())\nB=int(input())\nC=int(input())\nX=int(input())\n\nc=0\nfor i in range(A):\n for j in range(B):\n for k in range(C):\n if 500*(i+1)+100*(j+1)+50*(k+1)==X:\n c+=1\n\nprint(c)", "code2": "A=int(input())\nB=int(input())\nC=int(input())\nX=int(input())\n\nc=0\nfor i in range(A+1):\n for j in range(B+1):\n for k in range(C+1):\n if 500*i+100*j+50*k==X:\n c+=1\n\nprint(c)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549779756", "date2": "1549779889", "bleu_score": "0.9092348382261609", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0], "code1_test_score": 86, "total_score": 103, "input": "2\n2\n5\n100\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["A=int(input()) # (0): A=2\nB=int(input()) # (1): B=2\nC=int(input()) # (2): C=5\nX=int(input()) # (3): X=100\n\nc=0 # (4): c=0\nfor i in range(A): # (5): i=0 (31): i=1 (57): NO CHANGE\n for j in range(B): # (6): j=0 (18): j=1 ... (56): NO CHANGE\n for k in range(C): # (7): k=0 (9): k=1 ... (55): NO CHANGE\n if 500*(i+1)+100*(j+1)+50*(k+1)==X: # (8): NO CHANGE (10): NO CHANGE ... (54): NO CHANGE\n c+=1\n\nprint(c)"], "anno_status": [true], "diff_content": " A=int(input())\n B=int(input())\n C=int(input())\n X=int(input())\n \n c=0\n-for i in range(A):\n- for j in range(B):\n- for k in range(C):\n- if 500*(i+1)+100*(j+1)+50*(k+1)==X:\n+for i in range(A+1):\n+ for j in range(B+1):\n+ for k in range(C+1):\n+ if 500*i+100*j+50*k==X:\n c+=1\n \n print(c)\n+\n", "FL_content": "\n A=int(input())\n B=int(input())\n C=int(input())\n X=int(input())\n \n c=0\n-for i in range(A):\n- for j in range(B):\n- for k in range(C):\n- if 500*(i+1)+100*(j+1)+50*(k+1)==X:\n- c+=1\n \n print(c)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u205087376", "problem_id": "p02921", "submission1_id": "s168313238-FL", "submission2_id": "s025492598", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = str(input())\nt = str(input())\ncnt = 0\nfor i in range(0,2):\n if s[i] == t[i]:\n cnt += 1\nprint(int(cnt))", "code2": "s = str(input())\nt = str(input())\ncnt = 0\nfor i in range(0,3):\n if s[i] == t[i]:\n cnt += 1\nprint(int(cnt))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586422389", "date2": "1586422505", "bleu_score": "0.976792959791408", "code1_test_status": [1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 80, "total_score": 103, "input": "RTR\nSTR\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["s = str(input()) # (0): s=RTR\nt = str(input()) # (1): t=STR\ncnt = 0 # (2): cnt=0\nfor i in range(0,2): # (3): i=0 (5): i=1 (8): NO CHANGE\n if s[i] == t[i]: # (4): NO CHANGE (6): NO CHANGE\n cnt += 1 # (7): cnt=1\nprint(int(cnt))"], "anno_status": [true], "diff_content": " s = str(input())\n t = str(input())\n cnt = 0\n-for i in range(0,2):\n+for i in range(0,3):\n if s[i] == t[i]:\n cnt += 1\n print(int(cnt))\n", "FL_content": "\n s = str(input())\n t = str(input())\n cnt = 0\n-for i in range(0,2):\n if s[i] == t[i]:\n cnt += 1\n print(int(cnt))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u566311709", "problem_id": "p02401", "submission1_id": "s245542691-FL", "submission2_id": "s319812853", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n a, op, b = map(str, input().split())\n a = int(a)\n b = int(b)\n if op == \"+\":\n print(a + b)\n elif op == \"-\":\n print(a - b)\n elif op == \"*\":\n print(a * b)\n elif op == \"/\":\n print(a / b)\n elif op == \"?\":\n break\n else:\n break\n", "code2": "while True:\n a, op, b = map(str, input().split())\n a = int(a)\n b = int(b)\n if op == \"+\":\n print(a + b)\n elif op == \"-\":\n print(a - b)\n elif op == \"*\":\n print(a * b)\n elif op == \"/\":\n print(a \n elif op == \"?\":\n break\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1521459547", "date2": "1521460008", "bleu_score": "0.906268338934968", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "1 , 2\n56 - 18\n21 * 2\n100 / 7\n1 , 81\n-1 ? 0\n", "actual_output": "", "expected_output": "(1, 2)\n38\n42\n14\n(1, 81)\n\n", "anno_code": ["while True: # (0): NO CHANGE\n a, op, b = map(str, input().split()) # (1): a=1, op=,, b=2\n a = int(a) # (2): a=1\n b = int(b) # (3): b=2\n if op == \"+\": # (4): NO CHANGE\n print(a + b)\n elif op == \"-\": # (5): NO CHANGE\n print(a - b)\n elif op == \"*\": # (6): NO CHANGE\n print(a * b)\n elif op == \"/\": # (7): NO CHANGE\n print(a / b)\n elif op == \"?\": # (8): NO CHANGE\n break\n else:\n break\n"], "anno_status": [true], "diff_content": " while True:\n a, op, b = map(str, input().split())\n a = int(a)\n b = int(b)\n if op == \"+\":\n print(a + b)\n elif op == \"-\":\n print(a - b)\n elif op == \"*\":\n print(a * b)\n elif op == \"/\":\n- print(a / b)\n+ print(a \n elif op == \"?\":\n break\n- else:\n- break\n \n", "FL_content": "\n while True:\n a, op, b = map(str, input().split())\n a = int(a)\n b = int(b)\n if op == \"+\":\n print(a + b)\n elif op == \"-\":\n print(a - b)\n elif op == \"*\":\n print(a * b)\n elif op == \"/\":\n- print(a / b)\n elif op == \"?\":\n break\n else:\n break\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u595952233", "problem_id": "p03643", "submission1_id": "s656824911-FL", "submission2_id": "s718854995", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print('ABC'.format(int(input())))", "code2": "print('ABC{}'.format(input()))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594488695", "date2": "1594488734", "bleu_score": "0.7911368526486684", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "-111\n", "actual_output": "ABC\n", "expected_output": "ABC-111\n\n", "anno_code": ["print('ABC'.format(int(input())))"], "anno_status": [true], "diff_content": "-print('ABC'.format(int(input())))\n+print('ABC{}'.format(input()))\n", "FL_content": "\n-print('ABC'.format(int(input())))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 1 }, { "user_id": "u423585790", "problem_id": "p04008", "submission1_id": "s365945895-FL", "submission2_id": "s321934376", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(10**6)\nn,k = map(int,input().split())\na = [int(i)-1 for i in input().split()]\nedg = [[] for i in range(n)]\nfor i in range(1,n):\n edg[a[i]].append(i)\nans = [0] * n\nans[0] = a[0] != 0\ndef dfs(now):\n res = 0\n for e in edg[now]:\n res = max(res, dfs(e))\n if res == k - 1 and a[now] != 0:\n ans[now] = 1\n res = 0\n return res + 1\n \ndfs(0)\nprint(sum(ans))\n", "code2": "import sys\nsys.setrecursionlimit(10**6)\nn,k = map(int,input().split())\na = [int(i)-1 for i in input().split()]\nedg = [[] for i in range(n)]\nfor i in range(1,n):\n edg[a[i]].append(i)\nans = [0] * n\nans[0] = a[0] != 0\ndef dfs(now):\n res = 0\n for e in edg[now]:\n res = max(res, dfs(e)+1)\n if res == k - 1 and a[now] != 0:\n ans[now] = 1\n res = -1\n return res\n \ndfs(0)\nprint(sum(ans))\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1590165956", "date2": "1590166300", "bleu_score": "0.9791805163079995", "code1_test_status": [1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 85, "total_score": 97, "input": "8 2\n4 1 2 3 1 2 4 6\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["import sys\nsys.setrecursionlimit(10**6) # (0): NO CHANGE\nn,k = map(int,input().split()) # (1): n=8, k=2\na = [int(i)-1 for i in input().split()] # (2): a=[3, 0, 1, 2, 0, 1, 3, 5]\nedg = [[] for i in range(n)] # (3): edg\nfor i in range(1,n): # (4): i=1 (6): edg, i=2 ... (18): edg\n edg[a[i]].append(i) # (5): edg (7): edg ... (17): edg\nans = [0] * n # (19): edg, ans=[0, 0, 0, 0, 0, 0, 0, 0]\nans[0] = a[0] != 0 # (20): edg, ans=[True, 0, 0, 0, 0, 0, 0, 0]\ndef dfs(now): # (21): edg, dfs=\n res = 0 # (23): res=0 (26): res=0 ... (62): res=0\n for e in edg[now]: # (24): e=1 (27): e=2 ... (65): NO CHANGE\n res = max(res, dfs(e)) # (25): now=1 (28): now=2 ... (61): now=4\n if res == k - 1 and a[now] != 0: # (37): now=3, res=1, e=6 (39): NO CHANGE ... (66): sys=, n=8, k=2, a=[3, 0, 1, 2, 0, 1, 3, 5], edg=[[1, 4], [2, 5], [3], [6], [], [7], [], []], i=7, ans=[True, 0, 1, 1, 0, 1, 0, 0], dfs=\n ans[now] = 1 # (40): NO CHANGE (44): NO CHANGE (56): NO CHANGE\n res = 0 # (41): now=2, e=3 (45): now=1, e=2 (57): now=1, e=5\n return res + 1\n \ndfs(0) # (22): now=0\nprint(sum(ans))\n"], "anno_status": [true], "diff_content": " import sys\n sys.setrecursionlimit(10**6)\n n,k = map(int,input().split())\n a = [int(i)-1 for i in input().split()]\n edg = [[] for i in range(n)]\n for i in range(1,n):\n edg[a[i]].append(i)\n ans = [0] * n\n ans[0] = a[0] != 0\n def dfs(now):\n res = 0\n for e in edg[now]:\n- res = max(res, dfs(e))\n+ res = max(res, dfs(e)+1)\n if res == k - 1 and a[now] != 0:\n ans[now] = 1\n- res = 0\n- return res + 1\n+ res = -1\n+ return res\n \n dfs(0)\n print(sum(ans))\n \n", "FL_content": "\n import sys\n sys.setrecursionlimit(10**6)\n n,k = map(int,input().split())\n a = [int(i)-1 for i in input().split()]\n edg = [[] for i in range(n)]\n for i in range(1,n):\n edg[a[i]].append(i)\n ans = [0] * n\n-ans[0] = a[0] != 0\n def dfs(now):\n res = 0\n for e in edg[now]:\n res = max(res, dfs(e))\n if res == k - 1 and a[now] != 0:\n ans[now] = 1\n res = 0\n return res + 1\n \n dfs(0)\n print(sum(ans))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 21 }, { "user_id": "u703890795", "problem_id": "p02830", "submission1_id": "s134180056-FL", "submission2_id": "s536939056", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nST = input()\nS = \"\"\nfor i in range(N):\n S += ST[i]\n S += ST[N+i]\nprint(S)", "code2": "N = int(input())\nST = input()\nS = \"\"\nfor i in range(N):\n S += ST[i]\n S += ST[N+i+1]\nprint(S)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583372459", "date2": "1583372535", "bleu_score": "0.961928649275358", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "5\naa_ba bb`_b\n", "actual_output": "a ab_bb`a_\n", "expected_output": "abab_`b_ab\n\n", "anno_code": ["N = int(input()) # (0): N=5\nST = input() # (1): ST=aa_ba bb`_b\nS = \"\" # (2): S=\nfor i in range(N): # (3): i=0 (6): i=1 ... (18): NO CHANGE\n S += ST[i] # (4): S=a (7): S=a a ... (16): S=a ab_bb`a\n S += ST[N+i] # (5): S=a (8): S=a ab ... (17): S=a ab_bb`a_\nprint(S)"], "anno_status": [true], "diff_content": " N = int(input())\n ST = input()\n S = \"\"\n for i in range(N):\n S += ST[i]\n- S += ST[N+i]\n+ S += ST[N+i+1]\n print(S)\n", "FL_content": "\n N = int(input())\n ST = input()\n S = \"\"\n for i in range(N):\n S += ST[i]\n- S += ST[N+i]\n print(S)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u672866777", "problem_id": "p03456", "submission1_id": "s982618161-FL", "submission2_id": "s434939079", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nimport math\na, b = map(int, input().split())\n\nconnected_num = int(str(a) + str(b))\nc = int(math.sqrt(connected_num))\n\nprint(connected_num)\nif connected_num == c*c:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "\n\n\nimport math\na, b = map(int, input().split())\n\nconnected_num = int(str(a) + str(b))\nc = int(math.sqrt(connected_num))\n\nif connected_num == c*c:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598498831", "date2": "1598498894", "bleu_score": "0.8861083357326075", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 91, "input": "11 84\n", "actual_output": "1184\nNo\n", "expected_output": "No\n\n", "anno_code": ["\n\n\nimport math\na, b = map(int, input().split()) # (0): a=11, b=84\n\nconnected_num = int(str(a) + str(b)) # (1): connected_num=1184\nc = int(math.sqrt(connected_num)) # (2): c=34\n\nprint(connected_num) # (3): NO CHANGE\nif connected_num == c*c: # (4): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " \n \n \n import math\n a, b = map(int, input().split())\n \n connected_num = int(str(a) + str(b))\n c = int(math.sqrt(connected_num))\n \n-print(connected_num)\n if connected_num == c*c:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": "\n \n \n \n import math\n a, b = map(int, input().split())\n \n connected_num = int(str(a) + str(b))\n c = int(math.sqrt(connected_num))\n \n-print(connected_num)\n if connected_num == c*c:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u047535298", "problem_id": "p02948", "submission1_id": "s474487274-FL", "submission2_id": "s165700334", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\nW = [tuple(map(int, input().split())) for i in range(N)]\nW.sort(key=lambda x: -1000000*x[1]-x[0])\n\nday = 0\nans = 0\nfor i in range(N):\n if M-day-W[i][0] >= 0:\n ans += W[i][1]\n day += 1\n if day >= M:\n break\n\nprint(ans)", "code2": "import heapq\nN, M = map(int, input().split())\nW = [tuple(map(int, input().split())) for i in range(N)]\nW.sort()\nh = []\n\nj = 0\nans = 0\nfor i in range(M+1):\n while j < N and W[j][0] < i+1:\n heapq.heappush(h, (-W[j][1], W[j][1]))\n j += 1\n if h:\n p = heapq.heappop(h)\n ans += p[1]\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566267856", "date2": "1566269265", "bleu_score": "0.6174973655274477", "code1_test_status": [1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 98, "total_score": 102, "input": "3 4\n4 3\n3 0\n3 4\n", "actual_output": "4\n", "expected_output": "7\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=3, M=4\nW = [tuple(map(int, input().split())) for i in range(N)] # (1): W=[(4, 3), (3, 0), (3, 4)]\nW.sort(key=lambda x: -1000000*x[1]-x[0]) # (2): W=[(3, 4), (4, 3), (3, 0)]\n\nday = 0 # (3): day=0\nans = 0 # (4): ans=0\nfor i in range(N): # (5): i=0 (10): i=1 ... (18): NO CHANGE\n if M-day-W[i][0] >= 0: # (6): NO CHANGE (11): NO CHANGE (14): NO CHANGE\n ans += W[i][1] # (7): ans=4 (15): NO CHANGE\n day += 1 # (8): day=1 (16): day=2\n if day >= M: # (9): NO CHANGE (12): NO CHANGE (17): NO CHANGE\n break\n\nprint(ans)"], "anno_status": [true], "diff_content": "+import heapq\n N, M = map(int, input().split())\n W = [tuple(map(int, input().split())) for i in range(N)]\n-W.sort(key=lambda x: -1000000*x[1]-x[0])\n+W.sort()\n+h = []\n \n-day = 0\n+j = 0\n ans = 0\n-for i in range(N):\n- if M-day-W[i][0] >= 0:\n- ans += W[i][1]\n- day += 1\n- if day >= M:\n- break\n+for i in range(M+1):\n+ while j < N and W[j][0] < i+1:\n+ heapq.heappush(h, (-W[j][1], W[j][1]))\n+ j += 1\n+ if h:\n+ p = heapq.heappop(h)\n+ ans += p[1]\n \n print(ans)\n", "FL_content": "\n N, M = map(int, input().split())\n W = [tuple(map(int, input().split())) for i in range(N)]\n-W.sort(key=lambda x: -1000000*x[1]-x[0])\n \n day = 0\n ans = 0\n for i in range(N):\n if M-day-W[i][0] >= 0:\n ans += W[i][1]\n day += 1\n if day >= M:\n break\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u684325232", "problem_id": "p01102", "submission1_id": "s337113095-FL", "submission2_id": "s884705708", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=[]\n\nwhile 1:\n l1=input()\n if l1==\".\":\n break\n l2=input()\n\n sp1=l1.split('\"')\n sp2=l2.split('\"')\n \n t=0\n if len(sp1)==len(sp2):\n for i in range(len(sp1)):\n if i%2==1 and sp1[i]!=sp2[i]:\n t+=1\n elif i%2!=1 and sp1[i]!=sp2[i]:\n t+=2\n\n\n if sp1==sp2:\n s+=[\"INDENTCAL\"]\n elif t==1:\n s+=[\"CLODSE\"]\n else:\n s+=[\"DIFFERENT\"]\n\nfor x in s:\n print(x)\n\n", "code2": "s=[]\n\nwhile 1:\n l1=input()\n if l1==\".\":\n break\n l2=input()\n\n sp1=l1.split('\"')\n sp2=l2.split('\"')\n \n t=0\n if len(sp1)==len(sp2):\n for i in range(len(sp1)):\n if i%2==1 and sp1[i]!=sp2[i]:\n t+=1\n elif i%2!=1 and sp1[i]!=sp2[i]:\n t+=2\n\n\n if sp1==sp2:\n s+=[\"IDENTICAL\"]\n elif t==1:\n s+=[\"CLOSE\"]\n else:\n s+=[\"DIFFERENT\"]\n\nfor x in s:\n print(x)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526720204", "date2": "1526720614", "bleu_score": "0.9837789417716355", "code1_test_status": [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 63, "total_score": 101, "input": "print\"hello\";print123\nprint\"hello\";print123\nread\"B1input\";solve;output;\nread\"B2\";stlve;ovtpuo;\nread\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"\"\"\"\"\"\"\"\n\"\"\"42\"\"\"\"\"\nslwo\"program\"\nfast\"code\"\n\"super\"fast\"program\"\n\"super\"faster\"program\"\n\"\"X\nX\nI\"S\"\"CREAM\"\nI\"CE\"\"CREAM\"\n11\"22\"11\n1\"33\"111\n.\n", "actual_output": "INDENTCAL\nDIFFERENT\nDIFFERENT\nCLODSE\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLODSE\nDIFFERENT\n", "expected_output": "IDENTICAL\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\n\n", "anno_code": ["s=[] # (0): s=[]\n\nwhile 1: # (1): NO CHANGE (21): NO CHANGE ... (220): NO CHANGE\n l1=input() # (2): l1=print\"hello\";print123 (22): l1=read\"B1input\";solve;output; ... (221): l1=.\n if l1==\".\": # (3): NO CHANGE (23): NO CHANGE ... (222): NO CHANGE\n break # (223): NO CHANGE\n l2=input() # (4): l2=print\"hello\";print123 (24): l2=read\"B2\";stlve;ovtpuo; ... (200): l2=1\"33\"111\n\n sp1=l1.split('\"') # (5): sp1=['print', 'hello', ';print123'] (25): sp1=['read', 'B1input', ';solve;output;'] ... (201): sp1=['11', '22', '11']\n sp2=l2.split('\"') # (6): sp2=['print', 'hello', ';print123'] (26): sp2=['read', 'B2', ';stlve;ovtpuo;'] ... (202): sp2=['1', '33', '111']\n \n t=0 # (7): t=0 (27): NO CHANGE ... (203): t=0\n if len(sp1)==len(sp2): # (8): NO CHANGE (28): NO CHANGE ... (204): NO CHANGE\n for i in range(len(sp1)): # (9): i=0 (12): i=1 ... (216): NO CHANGE\n if i%2==1 and sp1[i]!=sp2[i]: # (10): NO CHANGE (13): NO CHANGE ... (213): NO CHANGE\n t+=1 # (34): t=1 (56): t=1 ... (211): t=3\n elif i%2!=1 and sp1[i]!=sp2[i]: # (11): NO CHANGE (14): NO CHANGE ... (214): NO CHANGE\n t+=2 # (38): t=3 (120): t=2 ... (215): t=5\n\n\n if sp1==sp2: # (19): NO CHANGE (40): NO CHANGE ... (217): NO CHANGE\n s+=[\"INDENTCAL\"] # (20): s=['INDENTCAL']\n elif t==1: # (41): NO CHANGE (68): NO CHANGE ... (218): NO CHANGE\n s+=[\"CLODSE\"] # (108): s=['INDENTCAL', 'DIFFERENT', 'DIFFERENT', 'CLODSE'] (196): s=['INDENTCAL', 'DIFFERENT', 'DIFFERENT', 'CLODSE', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'CLODSE']\n else:\n s+=[\"DIFFERENT\"] # (42): s=['INDENTCAL', 'DIFFERENT'] (69): s=['INDENTCAL', 'DIFFERENT', 'DIFFERENT'] ... (219): s=['INDENTCAL', 'DIFFERENT', 'DIFFERENT', 'CLODSE', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'CLODSE', 'DIFFERENT']\n\nfor x in s: # (224): x=INDENTCAL (226): x=DIFFERENT ... (240): x=DIFFERENT\n print(x) # (225): NO CHANGE (227): NO CHANGE ... (241): NO CHANGE\n\n"], "anno_status": [false], "diff_content": " s=[]\n \n while 1:\n l1=input()\n if l1==\".\":\n break\n l2=input()\n \n sp1=l1.split('\"')\n sp2=l2.split('\"')\n \n t=0\n if len(sp1)==len(sp2):\n for i in range(len(sp1)):\n if i%2==1 and sp1[i]!=sp2[i]:\n t+=1\n elif i%2!=1 and sp1[i]!=sp2[i]:\n t+=2\n \n \n if sp1==sp2:\n- s+=[\"INDENTCAL\"]\n+ s+=[\"IDENTICAL\"]\n elif t==1:\n- s+=[\"CLODSE\"]\n+ s+=[\"CLOSE\"]\n else:\n s+=[\"DIFFERENT\"]\n \n for x in s:\n print(x)\n \n-\n", "FL_content": "\n s=[]\n \n while 1:\n l1=input()\n if l1==\".\":\n break\n l2=input()\n \n sp1=l1.split('\"')\n sp2=l2.split('\"')\n \n t=0\n if len(sp1)==len(sp2):\n for i in range(len(sp1)):\n if i%2==1 and sp1[i]!=sp2[i]:\n t+=1\n elif i%2!=1 and sp1[i]!=sp2[i]:\n t+=2\n \n \n if sp1==sp2:\n- s+=[\"INDENTCAL\"]\n elif t==1:\n- s+=[\"CLODSE\"]\n else:\n s+=[\"DIFFERENT\"]\n \n for x in s:\n print(x)\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 31 }, { "user_id": "u016128476", "problem_id": "p02929", "submission1_id": "s613027010-FL", "submission2_id": "s862526364", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import factorial\nN = int(input())\nS = input()\nMOD = 10 ** 9 + 7\n\nLR = [True] \nfor i in range(N*2-1):\n LR += [LR[-1]] if S[i+1] != S[i] else [not LR[-1]]\n\n\ncmb = 1\ncr = 0\nfor i in range(N*2-1, -1, -1):\n if not LR[i]:\n cr += 1\n else:\n cmb *= cr\n cmb %= MOD\n cr -= 1\n\nprint((factorial(N) * cmb) % MOD)\n", "code2": "from math import factorial\nN = int(input())\nS = input()\nMOD = 10 ** 9 + 7\n\nLR = [True] \nfor i in range(N*2-1):\n LR += [LR[-1]] if S[i+1] != S[i] else [not LR[-1]]\n\nvalid = S[0] == S[-1] == 'B' and not LR[-1] and LR.count(True) == N\n\nif valid:\n \n cmb = 1\n cr = 0\n for i in range(N*2-1, -1, -1):\n if not LR[i]:\n cr += 1\n else:\n cmb *= cr\n cmb %= MOD\n cr -= 1\n\n print((factorial(N) * cmb) % MOD)\nelse:\n print(0)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566763621", "date2": "1566763957", "bleu_score": "0.6952759947555577", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0], "code1_test_score": 74, "total_score": 103, "input": "5\nWXWWVWWWWW\n", "actual_output": "720\n", "expected_output": "0\n\n", "anno_code": ["from math import factorial\nN = int(input()) # (0): N=5\nS = input() # (1): S=WXWWVWWWWW\nMOD = 10 ** 9 + 7 # (2): MOD=1000000007\n\nLR = [True] # (3): LR=[True]\nfor i in range(N*2-1): # (4): i=0 (6): i=1 ... (22): NO CHANGE\n LR += [LR[-1]] if S[i+1] != S[i] else [not LR[-1]] # (5): LR=[True, True] (7): LR=[True, True, True] ... (21): LR=[True, True, True, False, False, False, True, False, True, False]\n\n\ncmb = 1 # (23): cmb=1\ncr = 0 # (24): cr=0\nfor i in range(N*2-1, -1, -1): # (25): i=9 (28): i=8 ... (65): NO CHANGE\n if not LR[i]: # (26): NO CHANGE (29): NO CHANGE ... (61): NO CHANGE\n cr += 1 # (27): cr=1 (35): cr=1 ... (49): cr=3\n else:\n cmb *= cr # (30): NO CHANGE (38): NO CHANGE ... (62): NO CHANGE\n cmb %= MOD # (31): NO CHANGE (39): NO CHANGE ... (63): NO CHANGE\n cr -= 1 # (32): cr=0 (40): cr=0 ... (64): cr=0\n\nprint((factorial(N) * cmb) % MOD)\n"], "anno_status": [true], "diff_content": " from math import factorial\n N = int(input())\n S = input()\n MOD = 10 ** 9 + 7\n \n LR = [True] \n for i in range(N*2-1):\n LR += [LR[-1]] if S[i+1] != S[i] else [not LR[-1]]\n \n+valid = S[0] == S[-1] == 'B' and not LR[-1] and LR.count(True) == N\n \n-cmb = 1\n-cr = 0\n-for i in range(N*2-1, -1, -1):\n- if not LR[i]:\n- cr += 1\n- else:\n- cmb *= cr\n- cmb %= MOD\n- cr -= 1\n+if valid:\n+ \n+ cmb = 1\n+ cr = 0\n+ for i in range(N*2-1, -1, -1):\n+ if not LR[i]:\n+ cr += 1\n+ else:\n+ cmb *= cr\n+ cmb %= MOD\n+ cr -= 1\n \n-print((factorial(N) * cmb) % MOD)\n+ print((factorial(N) * cmb) % MOD)\n+else:\n+ print(0)\n \n", "FL_content": "\n from math import factorial\n N = int(input())\n S = input()\n MOD = 10 ** 9 + 7\n \n LR = [True] \n for i in range(N*2-1):\n LR += [LR[-1]] if S[i+1] != S[i] else [not LR[-1]]\n \n \n cmb = 1\n cr = 0\n for i in range(N*2-1, -1, -1):\n if not LR[i]:\n cr += 1\n else:\n cmb *= cr\n cmb %= MOD\n cr -= 1\n \n print((factorial(N) * cmb) % MOD)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u067729694", "problem_id": "p03003", "submission1_id": "s156184943-FL", "submission2_id": "s161709927", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\nS = list(map(int, input().split()))\nT = list(map(int, input().split()))\n\ndp = [[0 for i in range(M+1)] for j in range(N+1)] \ndp_sum = [[0 for i in range(M+1)] for j in range(N+1)] \n\n\nfor i, s in enumerate(S):\n for j, t in enumerate(T):\n if s == t:\n dp[i+1][j+1] = dp_sum[i][j] + 1 \n else:\n dp[i+1][j+1] = 0\n dp_sum[i+1][j+1] = dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]\n \nprint(dp_sum[N][M]+1)\n\n", "code2": "N, M = map(int, input().split())\nS = list(map(int, input().split()))\nT = list(map(int, input().split()))\n\nMOD = 10**9+7\n\ndp = [[0 for i in range(M+1)] for j in range(N+1)] \ndp_sum = [[0 for i in range(M+1)] for j in range(N+1)] \n\n\nret = 0\nfor i, s in enumerate(S):\n for j, t in enumerate(T):\n if s == t:\n dp[i+1][j+1] = dp_sum[i][j] + 1 \n dp_sum[i+1][j+1] = (dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]) % MOD\n \nprint(dp_sum[N][M]+1)\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1566035328", "date2": "1566035792", "bleu_score": "0.9163918012383347", "code1_test_status": [1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0], "code1_test_score": 57, "total_score": 105, "input": "20 20\n1 1 0 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1\n1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n", "actual_output": "17672631900\n", "expected_output": "672631781\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=20, M=20\nS = list(map(int, input().split())) # (1): S=[1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]\nT = list(map(int, input().split())) # (2): T=[1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]\n\ndp = [[0 for i in range(M+1)] for j in range(N+1)] # (3): dp\ndp_sum = [[0 for i in range(M+1)] for j in range(N+1)] # (4): dp_sum\n\n\nfor i, s in enumerate(S): # (5): i=0, s=1 (87): i=1 ... (1645): NO CHANGE\n for j, t in enumerate(T): # (6): j=0, t=1 (10): j=1 ... (1644): NO CHANGE\n if s == t: # (7): NO CHANGE (11): NO CHANGE ... (1641): NO CHANGE\n dp[i+1][j+1] = dp_sum[i][j] + 1 # (8): dp (12): dp ... (1642): dp\n else:\n dp[i+1][j+1] = 0 # (16): NO CHANGE (98): NO CHANGE ... (1574): NO CHANGE\n dp_sum[i+1][j+1] = dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j] # (9): dp_sum (13): dp_sum ... (1643): dp_sum\n \nprint(dp_sum[N][M]+1)\n\n"], "anno_status": [false], "diff_content": " N, M = map(int, input().split())\n S = list(map(int, input().split()))\n T = list(map(int, input().split()))\n \n+MOD = 10**9+7\n+\n dp = [[0 for i in range(M+1)] for j in range(N+1)] \n dp_sum = [[0 for i in range(M+1)] for j in range(N+1)] \n \n \n+ret = 0\n for i, s in enumerate(S):\n for j, t in enumerate(T):\n if s == t:\n dp[i+1][j+1] = dp_sum[i][j] + 1 \n- else:\n- dp[i+1][j+1] = 0\n- dp_sum[i+1][j+1] = dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]\n+ dp_sum[i+1][j+1] = (dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]) % MOD\n \n print(dp_sum[N][M]+1)\n \n \n", "FL_content": "\n N, M = map(int, input().split())\n S = list(map(int, input().split()))\n T = list(map(int, input().split()))\n \n dp = [[0 for i in range(M+1)] for j in range(N+1)] \n dp_sum = [[0 for i in range(M+1)] for j in range(N+1)] \n \n \n for i, s in enumerate(S):\n for j, t in enumerate(T):\n if s == t:\n dp[i+1][j+1] = dp_sum[i][j] + 1 \n else:\n dp[i+1][j+1] = 0\n dp_sum[i+1][j+1] = dp[i+1][j+1] + dp_sum[i][j+1] + dp_sum[i+1][j] - dp_sum[i][j]\n \n-print(dp_sum[N][M]+1)\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u478719560", "problem_id": "p02899", "submission1_id": "s659428730-FL", "submission2_id": "s960467847", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nfrom sys import stdin\nimport heapq\n\nN = int(input())\nAs = [int(x) for x in stdin.readline().rstrip().split()]\nans = [0] * N\n\nfor i in range(N):\n x = As[i]\n ans[x-1] = i + 1\n\nprint(ans)\n", "code2": "\nfrom sys import stdin\nimport heapq\n\nN = int(input())\nAs = [int(x) for x in stdin.readline().rstrip().split()]\nans = [0] * N\n\nfor i in range(N):\n x = As[i]\n ans[x-1] = i + 1\n\nans = ' '.join(map(str, ans))\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569721226", "date2": "1569721504", "bleu_score": "0.8605111275743289", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 11, "input": "8\n8 2 7 3 4 5 6 1\n", "actual_output": "[8, 2, 4, 5, 6, 7, 3, 1]\n", "expected_output": "8 2 4 5 6 7 3 1\n", "anno_code": ["\nfrom sys import stdin\nimport heapq\n\nN = int(input()) # (0): N=8\nAs = [int(x) for x in stdin.readline().rstrip().split()] # (1): As=[8, 2, 7, 3, 4, 5, 6, 1]\nans = [0] * N # (2): ans=[0, 0, 0, 0, 0, 0, 0, 0]\n\nfor i in range(N): # (3): i=0 (6): i=1 ... (27): NO CHANGE\n x = As[i] # (4): x=8 (7): x=2 ... (25): x=1\n ans[x-1] = i + 1 # (5): ans=[0, 0, 0, 0, 0, 0, 0, 1] (8): ans=[0, 2, 0, 0, 0, 0, 0, 1] ... (26): ans=[8, 2, 4, 5, 6, 7, 3, 1]\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " \n from sys import stdin\n import heapq\n \n N = int(input())\n As = [int(x) for x in stdin.readline().rstrip().split()]\n ans = [0] * N\n \n for i in range(N):\n x = As[i]\n ans[x-1] = i + 1\n \n+ans = ' '.join(map(str, ans))\n print(ans)\n \n", "FL_content": "\n \n from sys import stdin\n import heapq\n \n N = int(input())\n As = [int(x) for x in stdin.readline().rstrip().split()]\n ans = [0] * N\n \n for i in range(N):\n x = As[i]\n ans[x-1] = i + 1\n \n-print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u644778646", "problem_id": "p03523", "submission1_id": "s347254734-FL", "submission2_id": "s424341439", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n s = input()\n l = [\"K\", \"I\", \"H\", \"B\", \"R\"]\n for i in range(len(l)):\n if l[i] not in s:\n print(\"NO\")\n\n c = 0\n ac = 0\n for i in range(len(s)):\n if c == 0:\n if s[i] == \"K\":\n c = 1\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 1:\n if s[i] != \"I\":\n print(\"NO\")\n exit()\n c = 2\n elif c == 2:\n if s[i] != \"H\":\n print(\"NO\")\n exit()\n c = 3\n elif c == 3:\n if s[i] == \"B\":\n c = 4\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 4:\n if s[i] == \"R\":\n c = 5\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 5:\n if s[i] == \"A\":\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n print(\"YES\")\n\n\nif __name__ == '__main__':\n main()\n", "code2": "def main():\n s = input()\n l = [\"K\", \"I\", \"H\", \"B\", \"R\"]\n for i in range(len(l)):\n if l[i] not in s:\n print(\"NO\")\n exit()\n\n c = 0\n ac = 0\n for i in range(len(s)):\n if c == 0:\n if s[i] == \"K\":\n c = 1\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n else:\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 1:\n if s[i] != \"I\":\n print(\"NO\")\n exit()\n c = 2\n elif c == 2:\n if s[i] != \"H\":\n print(\"NO\")\n exit()\n c = 3\n elif c == 3:\n if s[i] == \"B\":\n c = 4\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n else:\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 4:\n if s[i] == \"R\":\n c = 5\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n else:\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 5:\n if s[i] == \"A\":\n ac += 1\n else:\n print(\"NO\")\n exit()\n if ac > 1:\n print(\"NO\")\n exit()\n print(\"YES\")\n\n\nif __name__ == '__main__':\n main()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567873790", "date2": "1567876211", "bleu_score": "0.9032455933731395", "code1_test_status": [1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 9, "total_score": 102, "input": "DSAJI\n", "actual_output": "NO\nNO\nNO\nNO\nNO\n", "expected_output": "NO\n\n", "anno_code": ["def main(): # (0): main=\n s = input()\n l = [\"K\", \"I\", \"H\", \"B\", \"R\"]\n for i in range(len(l)):\n if l[i] not in s:\n print(\"NO\")\n\n c = 0\n ac = 0\n for i in range(len(s)):\n if c == 0:\n if s[i] == \"K\":\n c = 1\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 1:\n if s[i] != \"I\":\n print(\"NO\")\n exit()\n c = 2\n elif c == 2:\n if s[i] != \"H\":\n print(\"NO\")\n exit()\n c = 3\n elif c == 3:\n if s[i] == \"B\":\n c = 4\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 4:\n if s[i] == \"R\":\n c = 5\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 5:\n if s[i] == \"A\":\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n print(\"YES\")\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " def main():\n s = input()\n l = [\"K\", \"I\", \"H\", \"B\", \"R\"]\n for i in range(len(l)):\n if l[i] not in s:\n print(\"NO\")\n+ exit()\n \n c = 0\n ac = 0\n for i in range(len(s)):\n if c == 0:\n if s[i] == \"K\":\n c = 1\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n- ac += 1\n+ else:\n+ ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 1:\n if s[i] != \"I\":\n print(\"NO\")\n exit()\n c = 2\n elif c == 2:\n if s[i] != \"H\":\n print(\"NO\")\n exit()\n c = 3\n elif c == 3:\n if s[i] == \"B\":\n c = 4\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n- ac += 1\n+ else:\n+ ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 4:\n if s[i] == \"R\":\n c = 5\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n- ac += 1\n+ else:\n+ ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 5:\n if s[i] == \"A\":\n ac += 1\n+ else:\n+ print(\"NO\")\n+ exit()\n if ac > 1:\n print(\"NO\")\n exit()\n print(\"YES\")\n \n \n if __name__ == '__main__':\n main()\n-\n", "FL_content": "\n def main():\n s = input()\n l = [\"K\", \"I\", \"H\", \"B\", \"R\"]\n for i in range(len(l)):\n if l[i] not in s:\n print(\"NO\")\n \n c = 0\n ac = 0\n for i in range(len(s)):\n if c == 0:\n if s[i] == \"K\":\n c = 1\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 1:\n if s[i] != \"I\":\n print(\"NO\")\n exit()\n c = 2\n elif c == 2:\n if s[i] != \"H\":\n print(\"NO\")\n exit()\n c = 3\n elif c == 3:\n if s[i] == \"B\":\n c = 4\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 4:\n if s[i] == \"R\":\n c = 5\n ac = 0\n elif s[i] != \"A\":\n print(\"NO\")\n exit()\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n elif c == 5:\n if s[i] == \"A\":\n ac += 1\n if ac > 1:\n print(\"NO\")\n exit()\n print(\"YES\")\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 65 }, { "user_id": "u084647893", "problem_id": "p03207", "submission1_id": "s243054655-FL", "submission2_id": "s372440951", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\np = list()\nfor i in range(N):\n p.append(int(input()))\nsum = 0\nfor i in range(0,N):\n sum += p[i]\nprint(sum - max(p) + max(p)/2)\n", "code2": "N = int(input())\np = list()\nfor i in range(N):\n p.append(int(input()))\nsum = 0\nfor i in range(0,N):\n sum += p[i]\nprint(sum - max(p) + max(p)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1546905087", "date2": "1546905361", "bleu_score": "0.9764024401807828", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "3\n12\n11402\n1144\n", "actual_output": "6857.0\n", "expected_output": "6857\n\n", "anno_code": ["N = int(input()) # (0): N=3\np = list() # (1): p=[]\nfor i in range(N): # (2): i=0 (4): i=1 ... (8): NO CHANGE\n p.append(int(input())) # (3): p=[12] (5): p=[12, 11402] (7): p=[12, 11402, 1144]\nsum = 0 # (9): sum=0\nfor i in range(0,N): # (10): i=0 (12): i=1 ... (16): NO CHANGE\n sum += p[i] # (11): sum=12 (13): sum=11414 (15): sum=12558\nprint(sum - max(p) + max(p)/2)\n"], "anno_status": [true], "diff_content": " N = int(input())\n p = list()\n for i in range(N):\n p.append(int(input()))\n sum = 0\n for i in range(0,N):\n sum += p[i]\n-print(sum - max(p) + max(p)/2)\n+print(sum - max(p) + max(p)\n \n", "FL_content": "\n N = int(input())\n p = list()\n for i in range(N):\n p.append(int(input()))\n sum = 0\n for i in range(0,N):\n sum += p[i]\n-print(sum - max(p) + max(p)/2)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u597455618", "problem_id": "p02958", "submission1_id": "s711958904-FL", "submission2_id": "s299471696", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\np = list(map(int, input().split()))\ncnt = 0\ncheck = 0\nfor i in range(n-1):\n if p[i+1] - p[i] == 1:\n cnt += 1\n else :\n check += 1\n \nif (cnt == n-1) or (check == 2 and cnt == n-3) :\n print(\"YES\")\nelse:\n print(\"NO\") ", "code2": "n = int(input())\np = list(map(int, input().split()))\ncnt = 0\nfor i in range(n):\n if p[i] != i + 1:\n cnt += 1\n \nif cnt == 0 or cnt == 2 :\n print(\"YES\")\nelse:\n print(\"NO\") ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567899844", "date2": "1567903556", "bleu_score": "0.6535950980553915", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 98, "total_score": 100, "input": "5\n3 4 3 4 1\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["n = int(input()) # (0): n=5\np = list(map(int, input().split())) # (1): p=[3, 4, 3, 4, 1]\ncnt = 0 # (2): cnt=0\ncheck = 0 # (3): check=0\nfor i in range(n-1): # (4): i=0 (7): i=1 ... (16): NO CHANGE\n if p[i+1] - p[i] == 1: # (5): NO CHANGE (8): NO CHANGE ... (14): NO CHANGE\n cnt += 1 # (6): cnt=1 (12): cnt=2\n else :\n check += 1 # (9): check=1 (15): check=2\n \nif (cnt == n-1) or (check == 2 and cnt == n-3) : # (17): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\") "], "anno_status": [true], "diff_content": " n = int(input())\n p = list(map(int, input().split()))\n cnt = 0\n-check = 0\n-for i in range(n-1):\n- if p[i+1] - p[i] == 1:\n+for i in range(n):\n+ if p[i] != i + 1:\n cnt += 1\n- else :\n- check += 1\n \n-if (cnt == n-1) or (check == 2 and cnt == n-3) :\n+if cnt == 0 or cnt == 2 :\n print(\"YES\")\n else:\n print(\"NO\") \n", "FL_content": "\n n = int(input())\n p = list(map(int, input().split()))\n cnt = 0\n check = 0\n for i in range(n-1):\n if p[i+1] - p[i] == 1:\n cnt += 1\n else :\n check += 1\n \n-if (cnt == n-1) or (check == 2 and cnt == n-3) :\n print(\"YES\")\n else:\n print(\"NO\") \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u552143188", "problem_id": "p02601", "submission1_id": "s467619221-FL", "submission2_id": "s774145460", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = map(int, input().split())\nK = int(input())\n\n\nif A < B and B < C :\n print('Yes')\n exit()\n\nfor i in range(K):\n if A < C and C < B:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif B < A and A < C:\n B = B * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif B < C and C < A:\n B = B * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif C < A and A < B:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif C < B and B < A:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\nprint('No')", "code2": "A, B, C = map(int, input().split())\nK = int(input())\n\nif A < B and B < C :\n print('Yes')\n exit()\n\nfor i in range(K):\n if A <= C and C <= B:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif B <= A and A <= C:\n B = B * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif B <= C and C <= A:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif C <= A and A <= B:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif C <= B and B <= A:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\nprint('No')\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595727928", "date2": "1595728388", "bleu_score": "0.9494847647872153", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 61, "total_score": 102, "input": "12 7 7\n7\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["A, B, C = map(int, input().split()) # (0): A=12, B=7, C=7\nK = int(input()) # (1): K=7\n\n\nif A < B and B < C : # (2): NO CHANGE\n print('Yes')\n exit()\n\nfor i in range(K): # (3): i=0 (9): i=1 ... (45): NO CHANGE\n if A < C and C < B: # (4): NO CHANGE (10): NO CHANGE ... (40): NO CHANGE\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif B < A and A < C: # (5): NO CHANGE (11): NO CHANGE ... (41): NO CHANGE\n B = B * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif B < C and C < A: # (6): NO CHANGE (12): NO CHANGE ... (42): NO CHANGE\n B = B * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif C < A and A < B: # (7): NO CHANGE (13): NO CHANGE ... (43): NO CHANGE\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif C < B and B < A: # (8): NO CHANGE (14): NO CHANGE ... (44): NO CHANGE\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\nprint('No')"], "anno_status": [true], "diff_content": " A, B, C = map(int, input().split())\n K = int(input())\n \n-\n if A < B and B < C :\n print('Yes')\n exit()\n \n for i in range(K):\n- if A < C and C < B:\n+ if A <= C and C <= B:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n- elif B < A and A < C:\n+ elif B <= A and A <= C:\n B = B * 2\n if A < B and B < C:\n print('Yes')\n exit()\n- elif B < C and C < A:\n- B = B * 2\n+ elif B <= C and C <= A:\n+ C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n- elif C < A and A < B:\n+ elif C <= A and A <= B:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n- elif C < B and B < A:\n+ elif C <= B and B <= A:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n print('No')\n+\n", "FL_content": "\n A, B, C = map(int, input().split())\n K = int(input())\n \n \n-if A < B and B < C :\n print('Yes')\n exit()\n \n for i in range(K):\n- if A < C and C < B:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif B < A and A < C:\n B = B * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif B < C and C < A:\n B = B * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif C < A and A < B:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n elif C < B and B < A:\n C = C * 2\n if A < B and B < C:\n print('Yes')\n exit()\n print('No')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 35 }, { "user_id": "u451017206", "problem_id": "p03558", "submission1_id": "s435962410-FL", "submission2_id": "s840033726", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict, deque\n\nINF = float('inf')\nK = int(input())\nG = defaultdict(list)\n\nfor v in range(K):\n G[v].append((0, (v * 10) % K))\n G[v].append((1, (v + 1) % K))\n\ndef zero_one_bfs_shortest_path(s):\n d = [INF] * K\n d[s] = 0\n dq = deque()\n dq.appendleft(s)\n while len(dq) != 0:\n u = dq.popleft()\n for w, v in G[u]:\n if d[v] != INF:continue\n d[v] = d[u] + w\n if w == 0: dq.appendleft(v)\n else: dq.append(v)\n return d\n\nprint(zero_one_bfs_shortest_path(1)[0] + 1)", "code2": "from collections import defaultdict, deque\n\nINF = float('inf')\nK = int(input())\n\ndef zero_one_bfs_shortest_path(s, K):\n G = defaultdict(list)\n for v in range(K):\n G[v].append((0, (v * 10) % K))\n G[v].append((1, (v + 1) % K))\n d = [INF] * K\n d[s] = 0\n dq = deque()\n dq.appendleft(s)\n while len(dq) != 0:\n u = dq.popleft()\n for w, v in G[u]:\n if d[v] > d[u] + w:\n d[v] = d[u] + w\n if w == 0: dq.appendleft(v)\n else: dq.append(v)\n return d\n\nprint(zero_one_bfs_shortest_path(1, K)[0] + 1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1510111529", "date2": "1510114602", "bleu_score": "0.9122696541016028", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 18, "total_score": 22, "input": "379\n", "actual_output": "5\n", "expected_output": "2\n\n", "anno_code": ["from collections import defaultdict, deque\n\nINF = float('inf') # (0): INF=inf\nK = int(input()) # (1): K=379\nG = defaultdict(list) # (2): G=defaultdict(, {})\n\nfor v in range(K): # (3): v=0 (6): v=1 ... (1140): NO CHANGE\n G[v].append((0, (v * 10) % K)) # (4): G=defaultdict(, {0: [(0, 0)]}) (7): G=defaultdict(, {0: [(0, 0), (1, 1)], 1: [(0, 10)]}) ... (1138): G=defaultdict(, {0: [(0, 0), (1, 1)], 1: [(0, 10), (1, 2)], 2: [(0, 20), (1, 3)], 3: [(0, 30), (1, 4)], 4: [(0, 40), (1, 5)], 5: [(0, 50), (1, 6)], 6: [(0, 60), (1, 7)], 7: [(0, 70), (1, 8)], 8: [(0, 80), (1, 9)], 9: [(0, 90), (1, 10)], 10: [(0, 100), (1, 11)], 11: [(0, 110), (1, 12)], 12: [(0, 120), (1, 13)], 13: [(0, 130), (1, 14)], 14: [(0, 140), (1, 15)], 15: [(0, 150), (1, 16)], 16: [(0, 160), (1, 17)], 17: [(0, 170), (1, 18)], 18: [(0, 180), (1, 19)], 19: [(0, 190), (1, 20)], 20: [(0, 200), (1, 21)], 21: [(0, 210), (1, 22)], 22: [(0, 220), (1, 23)], 23: [(0, 230), (1, 24)], 24: [(0, 240), (1, 25)], 25: [(0, 250), (1, 26)], 26: [(0, 260), (1, 27)], 27: [(0, 270), (1, 28)], 28: [(0, 280), (1, 29)], 29: [(0, 290), (1, 30)], 30: [(0, 300), (1, 31)], 31: [(0, 310), (1, 32)], 32: [(0, 320), (1, 33)], 33: [(0, 330), (1, 34)], 34: [(0, 340), (1, 35)], 35: [(0, 350), (1, 36)], 36: [(0, 360), (1, 37)], 37: [(0, 370), (1, 38)], 38: [(0, 1), (1, 39)], 39: [(0, 11), (1, 40)], 40: [(0, 21), (1, 41)], 41: [(0, 31), (1, 42)], 42: [(0, 41), (1, 43)], 43: [(0, 51), (1, 44)], 44: [(0, 61), (1, 45)], 45: [(0, 71), (1, 46)], 46: [(0, 81), (1, 47)], 47: [(0, 91), (1, 48)], 48: [(0, 101), (1, 49)], 49: [(0, 111), (1, 50)], 50: [(0, 121), (1, 51)], 51: [(0, 131), (1, 52)], 52: [(0, 141), (1, 53)], 53: [(0, 151), (1, 54)], 54: [(0, 161), (1, 55)], 55: [(0, 171), (1, 56)], 56: [(0, 181), (1, 57)], 57: [(0, 191), (1, 58)], 58: [(0, 201), (1, 59)], 59: [(0, 211), (1, 60)], 60: [(0, 221), (1, 61)], 61: [(0, 231), (1, 62)], 62: [(0, 241), (1, 63)], 63: [(0, 251), (1, 64)], 64: [(0, 261), (1, 65)], 65: [(0, 271), (1, 66)], 66: [(0, 281), (1, 67)], 67: [(0, 291), (1, 68)], 68: [(0, 301), (1, 69)], 69: [(0, 311), (1, 70)], 70: [(0, 321), (1, 71)], 71: [(0, 331), (1, 72)], 72: [(0, 341), (1, 73)], 73: [(0, 351), (1, 74)], 74: [(0, 361), (1, 75)], 75: [(0, 371), (1, 76)], 76: [(0, 2), (1, 77)], 77: [(0, 12), (1, 78)], 78: [(0, 22), (1, 79)], 79: [(0, 32), (1, 80)], 80: [(0, 42), (1, 81)], 81: [(0, 52), (1, 82)], 82: [(0, 62), (1, 83)], 83: [(0, 72), (1, 84)], 84: [(0, 82), (1, 85)], 85: [(0, 92), (1, 86)], 86: [(0, 102), (1, 87)], 87: [(0, 112), (1, 88)], 88: [(0, 122), (1, 89)], 89: [(0, 132), (1, 90)], 90: [(0, 142), (1, 91)], 91: [(0, 152), (1, 92)], 92: [(0, 162), (1, 93)], 93: [(0, 172), (1, 94)], 94: [(0, 182), (1, 95)], 95: [(0, 192), (1, 96)], 96: [(0, 202), (1, 97)], 97: [(0, 212), (1, 98)], 98: [(0, 222), (1, 99)], 99: [(0, 232), (1, 100)], 100: [(0, 242), (1, 101)], 101: [(0, 252), (1, 102)], 102: [(0, 262), (1, 103)], 103: [(0, 272), (1, 104)], 104: [(0, 282), (1, 105)], 105: [(0, 292), (1, 106)], 106: [(0, 302), (1, 107)], 107: [(0, 312), (1, 108)], 108: [(0, 322), (1, 109)], 109: [(0, 332), (1, 110)], 110: [(0, 342), (1, 111)], 111: [(0, 352), (1, 112)], 112: [(0, 362), (1, 113)], 113: [(0, 372), (1, 114)], 114: [(0, 3), (1, 115)], 115: [(0, 13), (1, 116)], 116: [(0, 23), (1, 117)], 117: [(0, 33), (1, 118)], 118: [(0, 43), (1, 119)], 119: [(0, 53), (1, 120)], 120: [(0, 63), (1, 121)], 121: [(0, 73), (1, 122)], 122: [(0, 83), (1, 123)], 123: [(0, 93), (1, 124)], 124: [(0, 103), (1, 125)], 125: [(0, 113), (1, 126)], 126: [(0, 123), (1, 127)], 127: [(0, 133), (1, 128)], 128: [(0, 143), (1, 129)], 129: [(0, 153), (1, 130)], 130: [(0, 163), (1, 131)], 131: [(0, 173), (1, 132)], 132: [(0, 183), (1, 133)], 133: [(0, 193), (1, 134)], 134: [(0, 203), (1, 135)], 135: [(0, 213), (1, 136)], 136: [(0, 223), (1, 137)], 137: [(0, 233), (1, 138)], 138: [(0, 243), (1, 139)], 139: [(0, 253), (1, 140)], 140: [(0, 263), (1, 141)], 141: [(0, 273), (1, 142)], 142: [(0, 283), (1, 143)], 143: [(0, 293), (1, 144)], 144: [(0, 303), (1, 145)], 145: [(0, 313), (1, 146)], 146: [(0, 323), (1, 147)], 147: [(0, 333), (1, 148)], 148: [(0, 343), (1, 149)], 149: [(0, 353), (1, 150)], 150: [(0, 363), (1, 151)], 151: [(0, 373), (1, 152)], 152: [(0, 4), (1, 153)], 153: [(0, 14), (1, 154)], 154: [(0, 24), (1, 155)], 155: [(0, 34), (1, 156)], 156: [(0, 44), (1, 157)], 157: [(0, 54), (1, 158)], 158: [(0, 64), (1, 159)], 159: [(0, 74), (1, 160)], 160: [(0, 84), (1, 161)], 161: [(0, 94), (1, 162)], 162: [(0, 104), (1, 163)], 163: [(0, 114), (1, 164)], 164: [(0, 124), (1, 165)], 165: [(0, 134), (1, 166)], 166: [(0, 144), (1, 167)], 167: [(0, 154), (1, 168)], 168: [(0, 164), (1, 169)], 169: [(0, 174), (1, 170)], 170: [(0, 184), (1, 171)], 171: [(0, 194), (1, 172)], 172: [(0, 204), (1, 173)], 173: [(0, 214), (1, 174)], 174: [(0, 224), (1, 175)], 175: [(0, 234), (1, 176)], 176: [(0, 244), (1, 177)], 177: [(0, 254), (1, 178)], 178: [(0, 264), (1, 179)], 179: [(0, 274), (1, 180)], 180: [(0, 284), (1, 181)], 181: [(0, 294), (1, 182)], 182: [(0, 304), (1, 183)], 183: [(0, 314), (1, 184)], 184: [(0, 324), (1, 185)], 185: [(0, 334), (1, 186)], 186: [(0, 344), (1, 187)], 187: [(0, 354), (1, 188)], 188: [(0, 364), (1, 189)], 189: [(0, 374), (1, 190)], 190: [(0, 5), (1, 191)], 191: [(0, 15), (1, 192)], 192: [(0, 25), (1, 193)], 193: [(0, 35), (1, 194)], 194: [(0, 45), (1, 195)], 195: [(0, 55), (1, 196)], 196: [(0, 65), (1, 197)], 197: [(0, 75), (1, 198)], 198: [(0, 85), (1, 199)], 199: [(0, 95), (1, 200)], 200: [(0, 105), (1, 201)], 201: [(0, 115), (1, 202)], 202: [(0, 125), (1, 203)], 203: [(0, 135), (1, 204)], 204: [(0, 145), (1, 205)], 205: [(0, 155), (1, 206)], 206: [(0, 165), (1, 207)], 207: [(0, 175), (1, 208)], 208: [(0, 185), (1, 209)], 209: [(0, 195), (1, 210)], 210: [(0, 205), (1, 211)], 211: [(0, 215), (1, 212)], 212: [(0, 225), (1, 213)], 213: [(0, 235), (1, 214)], 214: [(0, 245), (1, 215)], 215: [(0, 255), (1, 216)], 216: [(0, 265), (1, 217)], 217: [(0, 275), (1, 218)], 218: [(0, 285), (1, 219)], 219: [(0, 295), (1, 220)], 220: [(0, 305), (1, 221)], 221: [(0, 315), (1, 222)], 222: [(0, 325), (1, 223)], 223: [(0, 335), (1, 224)], 224: [(0, 345), (1, 225)], 225: [(0, 355), (1, 226)], 226: [(0, 365), (1, 227)], 227: [(0, 375), (1, 228)], 228: [(0, 6), (1, 229)], 229: [(0, 16), (1, 230)], 230: [(0, 26), (1, 231)], 231: [(0, 36), (1, 232)], 232: [(0, 46), (1, 233)], 233: [(0, 56), (1, 234)], 234: [(0, 66), (1, 235)], 235: [(0, 76), (1, 236)], 236: [(0, 86), (1, 237)], 237: [(0, 96), (1, 238)], 238: [(0, 106), (1, 239)], 239: [(0, 116), (1, 240)], 240: [(0, 126), (1, 241)], 241: [(0, 136), (1, 242)], 242: [(0, 146), (1, 243)], 243: [(0, 156), (1, 244)], 244: [(0, 166), (1, 245)], 245: [(0, 176), (1, 246)], 246: [(0, 186), (1, 247)], 247: [(0, 196), (1, 248)], 248: [(0, 206), (1, 249)], 249: [(0, 216), (1, 250)], 250: [(0, 226), (1, 251)], 251: [(0, 236), (1, 252)], 252: [(0, 246), (1, 253)], 253: [(0, 256), (1, 254)], 254: [(0, 266), (1, 255)], 255: [(0, 276), (1, 256)], 256: [(0, 286), (1, 257)], 257: [(0, 296), (1, 258)], 258: [(0, 306), (1, 259)], 259: [(0, 316), (1, 260)], 260: [(0, 326), (1, 261)], 261: [(0, 336), (1, 262)], 262: [(0, 346), (1, 263)], 263: [(0, 356), (1, 264)], 264: [(0, 366), (1, 265)], 265: [(0, 376), (1, 266)], 266: [(0, 7), (1, 267)], 267: [(0, 17), (1, 268)], 268: [(0, 27), (1, 269)], 269: [(0, 37), (1, 270)], 270: [(0, 47), (1, 271)], 271: [(0, 57), (1, 272)], 272: [(0, 67), (1, 273)], 273: [(0, 77), (1, 274)], 274: [(0, 87), (1, 275)], 275: [(0, 97), (1, 276)], 276: [(0, 107), (1, 277)], 277: [(0, 117), (1, 278)], 278: [(0, 127), (1, 279)], 279: [(0, 137), (1, 280)], 280: [(0, 147), (1, 281)], 281: [(0, 157), (1, 282)], 282: [(0, 167), (1, 283)], 283: [(0, 177), (1, 284)], 284: [(0, 187), (1, 285)], 285: [(0, 197), (1, 286)], 286: [(0, 207), (1, 287)], 287: [(0, 217), (1, 288)], 288: [(0, 227), (1, 289)], 289: [(0, 237), (1, 290)], 290: [(0, 247), (1, 291)], 291: [(0, 257), (1, 292)], 292: [(0, 267), (1, 293)], 293: [(0, 277), (1, 294)], 294: [(0, 287), (1, 295)], 295: [(0, 297), (1, 296)], 296: [(0, 307), (1, 297)], 297: [(0, 317), (1, 298)], 298: [(0, 327), (1, 299)], 299: [(0, 337), (1, 300)], 300: [(0, 347), (1, 301)], 301: [(0, 357), (1, 302)], 302: [(0, 367), (1, 303)], 303: [(0, 377), (1, 304)], 304: [(0, 8), (1, 305)], 305: [(0, 18), (1, 306)], 306: [(0, 28), (1, 307)], 307: [(0, 38), (1, 308)], 308: [(0, 48), (1, 309)], 309: [(0, 58), (1, 310)], 310: [(0, 68), (1, 311)], 311: [(0, 78), (1, 312)], 312: [(0, 88), (1, 313)], 313: [(0, 98), (1, 314)], 314: [(0, 108), (1, 315)], 315: [(0, 118), (1, 316)], 316: [(0, 128), (1, 317)], 317: [(0, 138), (1, 318)], 318: [(0, 148), (1, 319)], 319: [(0, 158), (1, 320)], 320: [(0, 168), (1, 321)], 321: [(0, 178), (1, 322)], 322: [(0, 188), (1, 323)], 323: [(0, 198), (1, 324)], 324: [(0, 208), (1, 325)], 325: [(0, 218), (1, 326)], 326: [(0, 228), (1, 327)], 327: [(0, 238), (1, 328)], 328: [(0, 248), (1, 329)], 329: [(0, 258), (1, 330)], 330: [(0, 268), (1, 331)], 331: [(0, 278), (1, 332)], 332: [(0, 288), (1, 333)], 333: [(0, 298), (1, 334)], 334: [(0, 308), (1, 335)], 335: [(0, 318), (1, 336)], 336: [(0, 328), (1, 337)], 337: [(0, 338), (1, 338)], 338: [(0, 348), (1, 339)], 339: [(0, 358), (1, 340)], 340: [(0, 368), (1, 341)], 341: [(0, 378), (1, 342)], 342: [(0, 9), (1, 343)], 343: [(0, 19), (1, 344)], 344: [(0, 29), (1, 345)], 345: [(0, 39), (1, 346)], 346: [(0, 49), (1, 347)], 347: [(0, 59), (1, 348)], 348: [(0, 69), (1, 349)], 349: [(0, 79), (1, 350)], 350: [(0, 89), (1, 351)], 351: [(0, 99), (1, 352)], 352: [(0, 109), (1, 353)], 353: [(0, 119), (1, 354)], 354: [(0, 129), (1, 355)], 355: [(0, 139), (1, 356)], 356: [(0, 149), (1, 357)], 357: [(0, 159), (1, 358)], 358: [(0, 169), (1, 359)], 359: [(0, 179), (1, 360)], 360: [(0, 189), (1, 361)], 361: [(0, 199), (1, 362)], 362: [(0, 209), (1, 363)], 363: [(0, 219), (1, 364)], 364: [(0, 229), (1, 365)], 365: [(0, 239), (1, 366)], 366: [(0, 249), (1, 367)], 367: [(0, 259), (1, 368)], 368: [(0, 269), (1, 369)], 369: [(0, 279), (1, 370)], 370: [(0, 289), (1, 371)], 371: [(0, 299), (1, 372)], 372: [(0, 309), (1, 373)], 373: [(0, 319), (1, 374)], 374: [(0, 329), (1, 375)], 375: [(0, 339), (1, 376)], 376: [(0, 349), (1, 377)], 377: [(0, 359), (1, 378)], 378: [(0, 369)]})\n G[v].append((1, (v + 1) % K)) # (5): G=defaultdict(, {0: [(0, 0), (1, 1)]}) (8): G=defaultdict(, {0: [(0, 0), (1, 1)], 1: [(0, 10), (1, 2)]}) ... (1139): G=defaultdict(, {0: [(0, 0), (1, 1)], 1: [(0, 10), (1, 2)], 2: [(0, 20), (1, 3)], 3: [(0, 30), (1, 4)], 4: [(0, 40), (1, 5)], 5: [(0, 50), (1, 6)], 6: [(0, 60), (1, 7)], 7: [(0, 70), (1, 8)], 8: [(0, 80), (1, 9)], 9: [(0, 90), (1, 10)], 10: [(0, 100), (1, 11)], 11: [(0, 110), (1, 12)], 12: [(0, 120), (1, 13)], 13: [(0, 130), (1, 14)], 14: [(0, 140), (1, 15)], 15: [(0, 150), (1, 16)], 16: [(0, 160), (1, 17)], 17: [(0, 170), (1, 18)], 18: [(0, 180), (1, 19)], 19: [(0, 190), (1, 20)], 20: [(0, 200), (1, 21)], 21: [(0, 210), (1, 22)], 22: [(0, 220), (1, 23)], 23: [(0, 230), (1, 24)], 24: [(0, 240), (1, 25)], 25: [(0, 250), (1, 26)], 26: [(0, 260), (1, 27)], 27: [(0, 270), (1, 28)], 28: [(0, 280), (1, 29)], 29: [(0, 290), (1, 30)], 30: [(0, 300), (1, 31)], 31: [(0, 310), (1, 32)], 32: [(0, 320), (1, 33)], 33: [(0, 330), (1, 34)], 34: [(0, 340), (1, 35)], 35: [(0, 350), (1, 36)], 36: [(0, 360), (1, 37)], 37: [(0, 370), (1, 38)], 38: [(0, 1), (1, 39)], 39: [(0, 11), (1, 40)], 40: [(0, 21), (1, 41)], 41: [(0, 31), (1, 42)], 42: [(0, 41), (1, 43)], 43: [(0, 51), (1, 44)], 44: [(0, 61), (1, 45)], 45: [(0, 71), (1, 46)], 46: [(0, 81), (1, 47)], 47: [(0, 91), (1, 48)], 48: [(0, 101), (1, 49)], 49: [(0, 111), (1, 50)], 50: [(0, 121), (1, 51)], 51: [(0, 131), (1, 52)], 52: [(0, 141), (1, 53)], 53: [(0, 151), (1, 54)], 54: [(0, 161), (1, 55)], 55: [(0, 171), (1, 56)], 56: [(0, 181), (1, 57)], 57: [(0, 191), (1, 58)], 58: [(0, 201), (1, 59)], 59: [(0, 211), (1, 60)], 60: [(0, 221), (1, 61)], 61: [(0, 231), (1, 62)], 62: [(0, 241), (1, 63)], 63: [(0, 251), (1, 64)], 64: [(0, 261), (1, 65)], 65: [(0, 271), (1, 66)], 66: [(0, 281), (1, 67)], 67: [(0, 291), (1, 68)], 68: [(0, 301), (1, 69)], 69: [(0, 311), (1, 70)], 70: [(0, 321), (1, 71)], 71: [(0, 331), (1, 72)], 72: [(0, 341), (1, 73)], 73: [(0, 351), (1, 74)], 74: [(0, 361), (1, 75)], 75: [(0, 371), (1, 76)], 76: [(0, 2), (1, 77)], 77: [(0, 12), (1, 78)], 78: [(0, 22), (1, 79)], 79: [(0, 32), (1, 80)], 80: [(0, 42), (1, 81)], 81: [(0, 52), (1, 82)], 82: [(0, 62), (1, 83)], 83: [(0, 72), (1, 84)], 84: [(0, 82), (1, 85)], 85: [(0, 92), (1, 86)], 86: [(0, 102), (1, 87)], 87: [(0, 112), (1, 88)], 88: [(0, 122), (1, 89)], 89: [(0, 132), (1, 90)], 90: [(0, 142), (1, 91)], 91: [(0, 152), (1, 92)], 92: [(0, 162), (1, 93)], 93: [(0, 172), (1, 94)], 94: [(0, 182), (1, 95)], 95: [(0, 192), (1, 96)], 96: [(0, 202), (1, 97)], 97: [(0, 212), (1, 98)], 98: [(0, 222), (1, 99)], 99: [(0, 232), (1, 100)], 100: [(0, 242), (1, 101)], 101: [(0, 252), (1, 102)], 102: [(0, 262), (1, 103)], 103: [(0, 272), (1, 104)], 104: [(0, 282), (1, 105)], 105: [(0, 292), (1, 106)], 106: [(0, 302), (1, 107)], 107: [(0, 312), (1, 108)], 108: [(0, 322), (1, 109)], 109: [(0, 332), (1, 110)], 110: [(0, 342), (1, 111)], 111: [(0, 352), (1, 112)], 112: [(0, 362), (1, 113)], 113: [(0, 372), (1, 114)], 114: [(0, 3), (1, 115)], 115: [(0, 13), (1, 116)], 116: [(0, 23), (1, 117)], 117: [(0, 33), (1, 118)], 118: [(0, 43), (1, 119)], 119: [(0, 53), (1, 120)], 120: [(0, 63), (1, 121)], 121: [(0, 73), (1, 122)], 122: [(0, 83), (1, 123)], 123: [(0, 93), (1, 124)], 124: [(0, 103), (1, 125)], 125: [(0, 113), (1, 126)], 126: [(0, 123), (1, 127)], 127: [(0, 133), (1, 128)], 128: [(0, 143), (1, 129)], 129: [(0, 153), (1, 130)], 130: [(0, 163), (1, 131)], 131: [(0, 173), (1, 132)], 132: [(0, 183), (1, 133)], 133: [(0, 193), (1, 134)], 134: [(0, 203), (1, 135)], 135: [(0, 213), (1, 136)], 136: [(0, 223), (1, 137)], 137: [(0, 233), (1, 138)], 138: [(0, 243), (1, 139)], 139: [(0, 253), (1, 140)], 140: [(0, 263), (1, 141)], 141: [(0, 273), (1, 142)], 142: [(0, 283), (1, 143)], 143: [(0, 293), (1, 144)], 144: [(0, 303), (1, 145)], 145: [(0, 313), (1, 146)], 146: [(0, 323), (1, 147)], 147: [(0, 333), (1, 148)], 148: [(0, 343), (1, 149)], 149: [(0, 353), (1, 150)], 150: [(0, 363), (1, 151)], 151: [(0, 373), (1, 152)], 152: [(0, 4), (1, 153)], 153: [(0, 14), (1, 154)], 154: [(0, 24), (1, 155)], 155: [(0, 34), (1, 156)], 156: [(0, 44), (1, 157)], 157: [(0, 54), (1, 158)], 158: [(0, 64), (1, 159)], 159: [(0, 74), (1, 160)], 160: [(0, 84), (1, 161)], 161: [(0, 94), (1, 162)], 162: [(0, 104), (1, 163)], 163: [(0, 114), (1, 164)], 164: [(0, 124), (1, 165)], 165: [(0, 134), (1, 166)], 166: [(0, 144), (1, 167)], 167: [(0, 154), (1, 168)], 168: [(0, 164), (1, 169)], 169: [(0, 174), (1, 170)], 170: [(0, 184), (1, 171)], 171: [(0, 194), (1, 172)], 172: [(0, 204), (1, 173)], 173: [(0, 214), (1, 174)], 174: [(0, 224), (1, 175)], 175: [(0, 234), (1, 176)], 176: [(0, 244), (1, 177)], 177: [(0, 254), (1, 178)], 178: [(0, 264), (1, 179)], 179: [(0, 274), (1, 180)], 180: [(0, 284), (1, 181)], 181: [(0, 294), (1, 182)], 182: [(0, 304), (1, 183)], 183: [(0, 314), (1, 184)], 184: [(0, 324), (1, 185)], 185: [(0, 334), (1, 186)], 186: [(0, 344), (1, 187)], 187: [(0, 354), (1, 188)], 188: [(0, 364), (1, 189)], 189: [(0, 374), (1, 190)], 190: [(0, 5), (1, 191)], 191: [(0, 15), (1, 192)], 192: [(0, 25), (1, 193)], 193: [(0, 35), (1, 194)], 194: [(0, 45), (1, 195)], 195: [(0, 55), (1, 196)], 196: [(0, 65), (1, 197)], 197: [(0, 75), (1, 198)], 198: [(0, 85), (1, 199)], 199: [(0, 95), (1, 200)], 200: [(0, 105), (1, 201)], 201: [(0, 115), (1, 202)], 202: [(0, 125), (1, 203)], 203: [(0, 135), (1, 204)], 204: [(0, 145), (1, 205)], 205: [(0, 155), (1, 206)], 206: [(0, 165), (1, 207)], 207: [(0, 175), (1, 208)], 208: [(0, 185), (1, 209)], 209: [(0, 195), (1, 210)], 210: [(0, 205), (1, 211)], 211: [(0, 215), (1, 212)], 212: [(0, 225), (1, 213)], 213: [(0, 235), (1, 214)], 214: [(0, 245), (1, 215)], 215: [(0, 255), (1, 216)], 216: [(0, 265), (1, 217)], 217: [(0, 275), (1, 218)], 218: [(0, 285), (1, 219)], 219: [(0, 295), (1, 220)], 220: [(0, 305), (1, 221)], 221: [(0, 315), (1, 222)], 222: [(0, 325), (1, 223)], 223: [(0, 335), (1, 224)], 224: [(0, 345), (1, 225)], 225: [(0, 355), (1, 226)], 226: [(0, 365), (1, 227)], 227: [(0, 375), (1, 228)], 228: [(0, 6), (1, 229)], 229: [(0, 16), (1, 230)], 230: [(0, 26), (1, 231)], 231: [(0, 36), (1, 232)], 232: [(0, 46), (1, 233)], 233: [(0, 56), (1, 234)], 234: [(0, 66), (1, 235)], 235: [(0, 76), (1, 236)], 236: [(0, 86), (1, 237)], 237: [(0, 96), (1, 238)], 238: [(0, 106), (1, 239)], 239: [(0, 116), (1, 240)], 240: [(0, 126), (1, 241)], 241: [(0, 136), (1, 242)], 242: [(0, 146), (1, 243)], 243: [(0, 156), (1, 244)], 244: [(0, 166), (1, 245)], 245: [(0, 176), (1, 246)], 246: [(0, 186), (1, 247)], 247: [(0, 196), (1, 248)], 248: [(0, 206), (1, 249)], 249: [(0, 216), (1, 250)], 250: [(0, 226), (1, 251)], 251: [(0, 236), (1, 252)], 252: [(0, 246), (1, 253)], 253: [(0, 256), (1, 254)], 254: [(0, 266), (1, 255)], 255: [(0, 276), (1, 256)], 256: [(0, 286), (1, 257)], 257: [(0, 296), (1, 258)], 258: [(0, 306), (1, 259)], 259: [(0, 316), (1, 260)], 260: [(0, 326), (1, 261)], 261: [(0, 336), (1, 262)], 262: [(0, 346), (1, 263)], 263: [(0, 356), (1, 264)], 264: [(0, 366), (1, 265)], 265: [(0, 376), (1, 266)], 266: [(0, 7), (1, 267)], 267: [(0, 17), (1, 268)], 268: [(0, 27), (1, 269)], 269: [(0, 37), (1, 270)], 270: [(0, 47), (1, 271)], 271: [(0, 57), (1, 272)], 272: [(0, 67), (1, 273)], 273: [(0, 77), (1, 274)], 274: [(0, 87), (1, 275)], 275: [(0, 97), (1, 276)], 276: [(0, 107), (1, 277)], 277: [(0, 117), (1, 278)], 278: [(0, 127), (1, 279)], 279: [(0, 137), (1, 280)], 280: [(0, 147), (1, 281)], 281: [(0, 157), (1, 282)], 282: [(0, 167), (1, 283)], 283: [(0, 177), (1, 284)], 284: [(0, 187), (1, 285)], 285: [(0, 197), (1, 286)], 286: [(0, 207), (1, 287)], 287: [(0, 217), (1, 288)], 288: [(0, 227), (1, 289)], 289: [(0, 237), (1, 290)], 290: [(0, 247), (1, 291)], 291: [(0, 257), (1, 292)], 292: [(0, 267), (1, 293)], 293: [(0, 277), (1, 294)], 294: [(0, 287), (1, 295)], 295: [(0, 297), (1, 296)], 296: [(0, 307), (1, 297)], 297: [(0, 317), (1, 298)], 298: [(0, 327), (1, 299)], 299: [(0, 337), (1, 300)], 300: [(0, 347), (1, 301)], 301: [(0, 357), (1, 302)], 302: [(0, 367), (1, 303)], 303: [(0, 377), (1, 304)], 304: [(0, 8), (1, 305)], 305: [(0, 18), (1, 306)], 306: [(0, 28), (1, 307)], 307: [(0, 38), (1, 308)], 308: [(0, 48), (1, 309)], 309: [(0, 58), (1, 310)], 310: [(0, 68), (1, 311)], 311: [(0, 78), (1, 312)], 312: [(0, 88), (1, 313)], 313: [(0, 98), (1, 314)], 314: [(0, 108), (1, 315)], 315: [(0, 118), (1, 316)], 316: [(0, 128), (1, 317)], 317: [(0, 138), (1, 318)], 318: [(0, 148), (1, 319)], 319: [(0, 158), (1, 320)], 320: [(0, 168), (1, 321)], 321: [(0, 178), (1, 322)], 322: [(0, 188), (1, 323)], 323: [(0, 198), (1, 324)], 324: [(0, 208), (1, 325)], 325: [(0, 218), (1, 326)], 326: [(0, 228), (1, 327)], 327: [(0, 238), (1, 328)], 328: [(0, 248), (1, 329)], 329: [(0, 258), (1, 330)], 330: [(0, 268), (1, 331)], 331: [(0, 278), (1, 332)], 332: [(0, 288), (1, 333)], 333: [(0, 298), (1, 334)], 334: [(0, 308), (1, 335)], 335: [(0, 318), (1, 336)], 336: [(0, 328), (1, 337)], 337: [(0, 338), (1, 338)], 338: [(0, 348), (1, 339)], 339: [(0, 358), (1, 340)], 340: [(0, 368), (1, 341)], 341: [(0, 378), (1, 342)], 342: [(0, 9), (1, 343)], 343: [(0, 19), (1, 344)], 344: [(0, 29), (1, 345)], 345: [(0, 39), (1, 346)], 346: [(0, 49), (1, 347)], 347: [(0, 59), (1, 348)], 348: [(0, 69), (1, 349)], 349: [(0, 79), (1, 350)], 350: [(0, 89), (1, 351)], 351: [(0, 99), (1, 352)], 352: [(0, 109), (1, 353)], 353: [(0, 119), (1, 354)], 354: [(0, 129), (1, 355)], 355: [(0, 139), (1, 356)], 356: [(0, 149), (1, 357)], 357: [(0, 159), (1, 358)], 358: [(0, 169), (1, 359)], 359: [(0, 179), (1, 360)], 360: [(0, 189), (1, 361)], 361: [(0, 199), (1, 362)], 362: [(0, 209), (1, 363)], 363: [(0, 219), (1, 364)], 364: [(0, 229), (1, 365)], 365: [(0, 239), (1, 366)], 366: [(0, 249), (1, 367)], 367: [(0, 259), (1, 368)], 368: [(0, 269), (1, 369)], 369: [(0, 279), (1, 370)], 370: [(0, 289), (1, 371)], 371: [(0, 299), (1, 372)], 372: [(0, 309), (1, 373)], 373: [(0, 319), (1, 374)], 374: [(0, 329), (1, 375)], 375: [(0, 339), (1, 376)], 376: [(0, 349), (1, 377)], 377: [(0, 359), (1, 378)], 378: [(0, 369), (1, 0)]})\n\ndef zero_one_bfs_shortest_path(s): # (1141): zero_one_bfs_shortest_path=\n d = [INF] * K # (1143): d=[inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf]\n d[s] = 0 # (1144): d=[inf, 0, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf]\n dq = deque() # (1145): dq=deque([])\n dq.appendleft(s) # (1146): NO CHANGE\n while len(dq) != 0: # (1147): NO CHANGE (1159): NO CHANGE ... (4746): NO CHANGE\n u = dq.popleft() # (1148): u=1 (1160): u=10 ... (4747): u=320\n for w, v in G[u]: # (1149): w=0, v=10 (1153): w=1, v=2 ... (4752): NO CHANGE\n if d[v] != INF:continue # (1150): NO CHANGE (1154): NO CHANGE ... (4751): NO CHANGE\n d[v] = d[u] + w # (1151): d=[inf, 0, inf, inf, inf, inf, inf, inf, inf, inf, 0, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf] (1155): d=[inf, 0, 1, inf, inf, inf, inf, inf, inf, inf, 0, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf, inf] ... (4679): d=[4, 0, ..., 2, 3]\n if w == 0: dq.appendleft(v) # (1152): NO CHANGE (1156): NO CHANGE ... (4680): NO CHANGE\n else: dq.append(v) # (1157): NO CHANGE (1169): NO CHANGE ... (4681): NO CHANGE\n return d\n\nprint(zero_one_bfs_shortest_path(1)[0] + 1) # (1142): s=1\n"], "anno_status": [false], "diff_content": " from collections import defaultdict, deque\n \n INF = float('inf')\n K = int(input())\n-G = defaultdict(list)\n \n-for v in range(K):\n- G[v].append((0, (v * 10) % K))\n- G[v].append((1, (v + 1) % K))\n-\n-def zero_one_bfs_shortest_path(s):\n+def zero_one_bfs_shortest_path(s, K):\n+ G = defaultdict(list)\n+ for v in range(K):\n+ G[v].append((0, (v * 10) % K))\n+ G[v].append((1, (v + 1) % K))\n d = [INF] * K\n d[s] = 0\n dq = deque()\n dq.appendleft(s)\n while len(dq) != 0:\n u = dq.popleft()\n for w, v in G[u]:\n- if d[v] != INF:continue\n- d[v] = d[u] + w\n- if w == 0: dq.appendleft(v)\n- else: dq.append(v)\n+ if d[v] > d[u] + w:\n+ d[v] = d[u] + w\n+ if w == 0: dq.appendleft(v)\n+ else: dq.append(v)\n return d\n \n-print(zero_one_bfs_shortest_path(1)[0] + 1)\n+print(zero_one_bfs_shortest_path(1, K)[0] + 1)\n", "FL_content": "\n from collections import defaultdict, deque\n \n INF = float('inf')\n K = int(input())\n G = defaultdict(list)\n \n for v in range(K):\n G[v].append((0, (v * 10) % K))\n G[v].append((1, (v + 1) % K))\n \n def zero_one_bfs_shortest_path(s):\n d = [INF] * K\n d[s] = 0\n dq = deque()\n dq.appendleft(s)\n while len(dq) != 0:\n u = dq.popleft()\n for w, v in G[u]:\n if d[v] != INF:continue\n d[v] = d[u] + w\n if w == 0: dq.appendleft(v)\n else: dq.append(v)\n return d\n \n-print(zero_one_bfs_shortest_path(1)[0] + 1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 25 }, { "user_id": "u498487134", "problem_id": "p03183", "submission1_id": "s100207052-FL", "submission2_id": "s109651631", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\ndef I(): return int(input())\ndef MI(): return map(int, input().split())\ndef LI(): return list(map(int, input().split()))\n\ndef main():\n mod=10**9+7\n \n \n N=I()\n wsv=[]\n for i in range(N):\n w,s,v=MI()\n wsv.append([w,s,v])\n \n wsv.sort(key=lambda x:(x[0]+x[1]))\n \n N2=2*(10**4) +1\n dp=[[-1]*N2 for _ in range(N+1)]\n \n for i in range(N):\n w,s,v=wsv[i]\n for j in range(N2):\n dp[i+1][j]=max(dp[i][j],dp[i+1][j])\n if s>=j and j+w<=(N2-1):\n dp[i+1][j+w]=max(dp[i+1][j+w],dp[i][j]+v)\n \n print(max(dp[-1]))\n \n \n\nmain()\n", "code2": "\ndef I(): return int(input())\ndef MI(): return map(int, input().split())\ndef LI(): return list(map(int, input().split()))\n\ndef main():\n mod=10**9+7\n \n \n N=I()\n wsv=[]\n for i in range(N):\n w,s,v=MI()\n wsv.append([w,s,v])\n \n wsv.sort(key=lambda x:(x[0]+x[1]))\n \n N2=2*(10**4) +1\n dp=[[0]*N2 for _ in range(N+1)]\n \n for i in range(N):\n w,s,v=wsv[i]\n for j in range(N2):\n dp[i+1][j]=max(dp[i][j],dp[i+1][j])\n if s>=j and j+w<=(N2-1):\n dp[i+1][j+w]=max(dp[i+1][j+w],dp[i][j]+v)\n \n print(max(dp[-1]))\n \n \n\nmain()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589510594", "date2": "1589510692", "bleu_score": "0.9915664365281138", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 104, "input": "5\n1 10001 1000000001\n1 10101 1000001000\n1 10000 1000000000\n2 11001 1000001000\n1 00010 1000010010\n", "actual_output": "5000012010\n", "expected_output": "5000012011\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n-\n-\n def I(): return int(input())\n def MI(): return map(int, input().split())\n def LI(): return list(map(int, input().split()))\n \n def main():\n mod=10**9+7\n \n \n N=I()\n wsv=[]\n for i in range(N):\n w,s,v=MI()\n wsv.append([w,s,v])\n \n wsv.sort(key=lambda x:(x[0]+x[1]))\n \n N2=2*(10**4) +1\n- dp=[[-1]*N2 for _ in range(N+1)]\n+ dp=[[0]*N2 for _ in range(N+1)]\n \n for i in range(N):\n w,s,v=wsv[i]\n for j in range(N2):\n dp[i+1][j]=max(dp[i][j],dp[i+1][j])\n if s>=j and j+w<=(N2-1):\n dp[i+1][j+w]=max(dp[i+1][j+w],dp[i][j]+v)\n \n print(max(dp[-1]))\n \n \n \n main()\n \n", "FL_content": "\n \n \n \n def I(): return int(input())\n def MI(): return map(int, input().split())\n def LI(): return list(map(int, input().split()))\n \n def main():\n mod=10**9+7\n \n \n N=I()\n wsv=[]\n for i in range(N):\n w,s,v=MI()\n wsv.append([w,s,v])\n \n wsv.sort(key=lambda x:(x[0]+x[1]))\n \n N2=2*(10**4) +1\n dp=[[-1]*N2 for _ in range(N+1)]\n \n for i in range(N):\n w,s,v=wsv[i]\n for j in range(N2):\n dp[i+1][j]=max(dp[i][j],dp[i+1][j])\n- if s>=j and j+w<=(N2-1):\n dp[i+1][j+w]=max(dp[i+1][j+w],dp[i][j]+v)\n \n print(max(dp[-1]))\n \n \n \n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 35 }, { "user_id": "u567380442", "problem_id": "p02368", "submission1_id": "s095147313-FL", "submission2_id": "s885336644", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def search(g, g_dash, v):\n \n visited = set()\n prenum = []\n for root in range(v):\n if root in visited:\n continue\n dfs_stack = [root]\n while dfs_stack:\n u = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n prenum.append(u)\n dfs_stack.extend(g[u] - visited)\n\n \n visited.clear()\n lowest = [None] * v\n for root in prenum:\n if root in visited:\n continue\n dfs_stack = [root]\n while dfs_stack:\n u = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n lowest[u] = root\n dfs_stack.extend(g_dash[u] - visited)\n return lowest\n\nfrom sys import stdin\nreadline = stdin.readline\n\ndef main():\n v, e = map(int, readline().split())\n from collections import defaultdict\n g = defaultdict(set)\n g_dash = defaultdict(set)\n \n\n for _ in range(e):\n s, t = map(int, readline().split())\n g[s] |= {t} \n g_dash[t] |= {s} \n \n lowest = search(g, g_dash, v)\n q = int(readline())\n for u, v in [map(int, readline().split()) for _ in range(q)]:\n print(1 if lowest[u] == lowest[v] else 0)\nmain()", "code2": "from collections import UserList\nclass Stack(UserList):\n def __init__(self):\n UserList.__init__(self)\n self.contains = set()\n def __contains__(self, x):\n return x in self.contains\n def __and__(self, x):\n return self.contains & x\n def push(self, x):\n if x in self.contains:\n return\n self.data.append(x)\n self.contains |= {x}\n def pop(self):\n x = self.data.pop()\n self.contains -= {x}\n return x\n\ndef search(g, g_dash,v):\n \n visited = set()\n postorder = []\n for root in range(v):\n if root in visited:\n continue\n route = Stack()\n route.push(None)\n dfs_stack = [(root, None)] \n while dfs_stack:\n u, prev = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n dfs_stack.extend((v, u) for v in g[u] - visited)\n while route[-1] != prev:\n postorder.append(route.pop())\n route.push(u)\n while route[-1] is not None:\n postorder.append(route.pop())\n\n \n visited.clear()\n lowest = [None] * v\n for root in postorder[::-1]:\n if root in visited:\n continue\n dfs_stack = [root]\n while dfs_stack:\n u = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n lowest[u] = root\n dfs_stack.extend(g_dash[u] - visited)\n return lowest\n\nfrom sys import stdin\nfrom collections import defaultdict\nreadline = stdin.readline\n\ndef main():\n v, e = map(int, readline().split())\n g = defaultdict(set)\n g_dash = defaultdict(set)\n\n for _ in range(e):\n s, t = map(int, readline().split())\n g[s] |= {t} \n g_dash[t] |= {s} \n \n lowest = search(g,g_dash, v)\n q = int(readline())\n for u, v in [map(int, readline().split()) for _ in range(q)]:\n print(1 if lowest[u] == lowest[v] else 0)\nmain()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1428213008", "date2": "1428218620", "bleu_score": "0.6197393079330996", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1], "code1_test_score": 44, "total_score": 101, "input": "8 6\n0 1\n2 0\n1 4\n3 4\n4 2\n3 2\n3\n1 2\n0 6\n2 3\n2 4\n", "actual_output": "1\n0\n1\n", "expected_output": "1\n0\n0\n\n", "anno_code": ["def search(g, g_dash, v): # (0): search=, stdin=<_io.TextIOWrapper name='../../test/autoComment2\\\\Dev\\\\p02368\\\\input_s095147313.txt' mode='r' encoding='utf-8'>\n \n visited = set() # (33): visited=set()\n prenum = [] # (34): prenum=[]\n for root in range(v): # (35): root=0 (63): root=1 ... (112): NO CHANGE\n if root in visited: # (36): NO CHANGE (64): NO CHANGE ... (103): NO CHANGE\n continue # (65): NO CHANGE (68): NO CHANGE (81): NO CHANGE\n dfs_stack = [root] # (37): dfs_stack=[0] (71): dfs_stack=[3] ... (104): dfs_stack=[7]\n while dfs_stack: # (38): NO CHANGE (44): NO CHANGE ... (111): NO CHANGE\n u = dfs_stack.pop() # (39): dfs_stack=[], u=0 (45): dfs_stack=[], u=1 ... (106): dfs_stack=[], u=7\n if u in visited: # (40): NO CHANGE (46): NO CHANGE ... (107): NO CHANGE\n continue\n visited |= {u} # (41): visited={0} (47): visited={0, 1} ... (108): visited={0, 1, 2, 3, 4, 5, 6, 7}\n prenum.append(u) # (42): prenum=[0] (48): prenum=[0, 1] ... (109): prenum=[0, 1, 4, 2, 3, 5, 6, 7]\n dfs_stack.extend(g[u] - visited) # (43): dfs_stack=[1] (49): dfs_stack=[4] ... (110): g=defaultdict(, {0: {1}, 2: {0}, 1: {4}, 3: {2, 4}, 4: {2}, 5: set(), 6: set(), 7: set()})\n\n \n visited.clear() # (113): visited=set()\n lowest = [None] * v # (114): lowest=[None, None, None, None, None, None, None, None]\n for root in prenum: # (115): root=0 (153): root=1 ... (195): e=6, defaultdict=, _=5, s=3, t=2\n if root in visited: # (116): NO CHANGE (154): NO CHANGE ... (186): NO CHANGE\n continue # (155): NO CHANGE (158): NO CHANGE ... (164): NO CHANGE\n dfs_stack = [root] # (117): dfs_stack=[0] (167): dfs_stack=[5] ... (187): dfs_stack=[7]\n while dfs_stack: # (118): NO CHANGE (124): NO CHANGE ... (194): NO CHANGE\n u = dfs_stack.pop() # (119): dfs_stack=[], u=0 (125): dfs_stack=[], u=2 ... (189): dfs_stack=[], u=7\n if u in visited: # (120): NO CHANGE (126): NO CHANGE ... (190): NO CHANGE\n continue # (151): NO CHANGE\n visited |= {u} # (121): visited={0} (127): visited={0, 2} ... (191): visited={0, 1, 2, 3, 4, 5, 6, 7}\n lowest[u] = root # (122): lowest=[0, None, None, None, None, None, None, None] (128): lowest=[0, None, 0, None, None, None, None, None] ... (192): lowest=[0, 0, 0, 0, 0, 5, 6, 7]\n dfs_stack.extend(g_dash[u] - visited) # (123): dfs_stack=[2] (129): dfs_stack=[3, 4] ... (193): g_dash=defaultdict(, {1: {0}, 0: {2}, 4: {1, 3}, 2: {3, 4}, 3: set(), 5: set(), 6: set(), 7: set()})\n return lowest\n\nfrom sys import stdin\nreadline = stdin.readline # (1): readline=\n\ndef main(): # (2): main=\n v, e = map(int, readline().split()) # (4): v=8, e=6, defaultdict=\n from collections import defaultdict\n g = defaultdict(set) # (5): g=defaultdict(, {})\n g_dash = defaultdict(set) # (6): g_dash=defaultdict(, {})\n \n\n for _ in range(e): # (7): _=0 (11): _=1 ... (31): NO CHANGE\n s, t = map(int, readline().split()) # (8): s=0, t=1 (12): s=2, t=0 ... (28): s=3\n g[s] |= {t} # (9): g=defaultdict(, {0: {1}}) (13): g=defaultdict(, {0: {1}, 2: {0}}) ... (29): g=defaultdict(, {0: {1}, 2: {0}, 1: {4}, 3: {2, 4}, 4: {2}})\n g_dash[t] |= {s} # (10): g_dash=defaultdict(, {1: {0}}) (14): g_dash=defaultdict(, {1: {0}, 0: {2}}) ... (30): g_dash=defaultdict(, {1: {0}, 0: {2}, 4: {1, 3}, 2: {3, 4}})\n \n lowest = search(g, g_dash, v) # (32): NO CHANGE\n q = int(readline()) # (196): q=3\n for u, v in [map(int, readline().split()) for _ in range(q)]: # (197): v=2, u=1 (199): v=6, u=0 (201): v=3, u=2\n print(1 if lowest[u] == lowest[v] else 0) # (198): NO CHANGE (200): NO CHANGE (202): NO CHANGE\nmain() # (3): NO CHANGE\n"], "anno_status": [false], "diff_content": "-def search(g, g_dash, v):\n+from collections import UserList\n+class Stack(UserList):\n+ def __init__(self):\n+ UserList.__init__(self)\n+ self.contains = set()\n+ def __contains__(self, x):\n+ return x in self.contains\n+ def __and__(self, x):\n+ return self.contains & x\n+ def push(self, x):\n+ if x in self.contains:\n+ return\n+ self.data.append(x)\n+ self.contains |= {x}\n+ def pop(self):\n+ x = self.data.pop()\n+ self.contains -= {x}\n+ return x\n+\n+def search(g, g_dash,v):\n \n visited = set()\n- prenum = []\n+ postorder = []\n for root in range(v):\n if root in visited:\n continue\n- dfs_stack = [root]\n+ route = Stack()\n+ route.push(None)\n+ dfs_stack = [(root, None)] \n while dfs_stack:\n- u = dfs_stack.pop()\n+ u, prev = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n- prenum.append(u)\n- dfs_stack.extend(g[u] - visited)\n+ dfs_stack.extend((v, u) for v in g[u] - visited)\n+ while route[-1] != prev:\n+ postorder.append(route.pop())\n+ route.push(u)\n+ while route[-1] is not None:\n+ postorder.append(route.pop())\n \n \n visited.clear()\n lowest = [None] * v\n- for root in prenum:\n+ for root in postorder[::-1]:\n if root in visited:\n continue\n dfs_stack = [root]\n while dfs_stack:\n u = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n lowest[u] = root\n dfs_stack.extend(g_dash[u] - visited)\n return lowest\n \n from sys import stdin\n+from collections import defaultdict\n readline = stdin.readline\n \n def main():\n v, e = map(int, readline().split())\n- from collections import defaultdict\n g = defaultdict(set)\n g_dash = defaultdict(set)\n- \n \n for _ in range(e):\n s, t = map(int, readline().split())\n g[s] |= {t} \n g_dash[t] |= {s} \n \n- lowest = search(g, g_dash, v)\n+ lowest = search(g,g_dash, v)\n q = int(readline())\n for u, v in [map(int, readline().split()) for _ in range(q)]:\n print(1 if lowest[u] == lowest[v] else 0)\n main()\n", "FL_content": "\n def search(g, g_dash, v):\n \n visited = set()\n prenum = []\n for root in range(v):\n if root in visited:\n continue\n dfs_stack = [root]\n while dfs_stack:\n u = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n prenum.append(u)\n dfs_stack.extend(g[u] - visited)\n \n \n visited.clear()\n lowest = [None] * v\n for root in prenum:\n if root in visited:\n continue\n dfs_stack = [root]\n while dfs_stack:\n u = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n lowest[u] = root\n dfs_stack.extend(g_dash[u] - visited)\n return lowest\n \n from sys import stdin\n readline = stdin.readline\n \n def main():\n v, e = map(int, readline().split())\n from collections import defaultdict\n g = defaultdict(set)\n g_dash = defaultdict(set)\n \n \n for _ in range(e):\n s, t = map(int, readline().split())\n g[s] |= {t} \n g_dash[t] |= {s} \n \n lowest = search(g, g_dash, v)\n q = int(readline())\n for u, v in [map(int, readline().split()) for _ in range(q)]:\n- print(1 if lowest[u] == lowest[v] else 0)\n main()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 52 }, { "user_id": "u333917945", "problem_id": "p04014", "submission1_id": "s607195442-FL", "submission2_id": "s431036494", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math, sys\n\nn = int(input())\ns = int(input())\n\ndef f(b, n):\n if n < b:\n return n\n else:\n return f(b, math.floor(n/b)) + n % b\n\nif s == n:\n print(n+1)\n sys.exit()\n\nprint(2, math.ceil(math.sqrt(n)))\nfor b in range(2, math.floor(math.sqrt(n))+1):\n \n if(f(b, n) == s):\n print(b)\n sys.exit()\n\nprint(math.floor(math.sqrt(n))-1)\nfor p in range(1, math.ceil(math.sqrt(n))):\n \n b = int((n-s)/p) + 1\n if(b >= 2 and f(b, n) == s):\n print(b)\n sys.exit()\n\nprint(\"-1\")\n", "code2": "import math, sys\n\nn = int(input())\ns = int(input())\n\ndef f(b, n):\n if n < b:\n return n\n else:\n return f(b, math.floor(n/b)) + n % b\n\nif s == n:\n print(n+1)\n sys.exit()\n\n\nfor b in range(2, math.floor(math.sqrt(n))+1):\n \n if(f(b, n) == s):\n print(b)\n sys.exit()\n\n\nfor p in range(1, math.floor(math.sqrt(n))+1):\n \n _p = math.floor(math.sqrt(n))+1-p\n b = int((n-s)/_p) + 1\n if(b >= 2 and f(b, n) == s):\n print(b)\n sys.exit()\n\nprint(\"-1\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1480883730", "date2": "1480884795", "bleu_score": "0.8985638206980743", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 105, "input": "87654\n264\n", "actual_output": "2 297\n295\n87391\n", "expected_output": "972\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import math, sys\n \n n = int(input())\n s = int(input())\n \n def f(b, n):\n if n < b:\n return n\n else:\n return f(b, math.floor(n/b)) + n % b\n \n if s == n:\n print(n+1)\n sys.exit()\n \n-print(2, math.ceil(math.sqrt(n)))\n+\n for b in range(2, math.floor(math.sqrt(n))+1):\n \n if(f(b, n) == s):\n print(b)\n sys.exit()\n \n-print(math.floor(math.sqrt(n))-1)\n-for p in range(1, math.ceil(math.sqrt(n))):\n+\n+for p in range(1, math.floor(math.sqrt(n))+1):\n \n- b = int((n-s)/p) + 1\n+ _p = math.floor(math.sqrt(n))+1-p\n+ b = int((n-s)/_p) + 1\n if(b >= 2 and f(b, n) == s):\n print(b)\n sys.exit()\n \n print(\"-1\")\n-\n", "FL_content": "\n import math, sys\n \n n = int(input())\n s = int(input())\n \n def f(b, n):\n if n < b:\n return n\n else:\n return f(b, math.floor(n/b)) + n % b\n \n if s == n:\n- print(n+1)\n sys.exit()\n \n-print(2, math.ceil(math.sqrt(n)))\n-for b in range(2, math.floor(math.sqrt(n))+1):\n- \n if(f(b, n) == s):\n print(b)\n sys.exit()\n \n-print(math.floor(math.sqrt(n))-1)\n-for p in range(1, math.ceil(math.sqrt(n))):\n- \n- b = int((n-s)/p) + 1\n- if(b >= 2 and f(b, n) == s):\n- print(b)\n- sys.exit()\n \n print(\"-1\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 32 }, { "user_id": "u776781549", "problem_id": "p03502", "submission1_id": "s590822939-FL", "submission2_id": "s228727173", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = input()\nif int(n) % sum(list(map(int, n))) == 0:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "code2": "n = input()\nif int(n) % sum(list(map(int, n))) == 0:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512851965", "date2": "1512852052", "bleu_score": "0.9305163849527504", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 23, "input": "190\n", "actual_output": "YES\n", "expected_output": "Yes\n\n", "anno_code": ["n = input() # (0): n=190\nif int(n) % sum(list(map(int, n))) == 0: # (1): NO CHANGE\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")"], "anno_status": [true], "diff_content": " n = input()\n if int(n) % sum(list(map(int, n))) == 0:\n-\tprint(\"YES\")\n+\tprint(\"Yes\")\n else:\n-\tprint(\"NO\")\n+\tprint(\"No\")\n", "FL_content": "\n n = input()\n if int(n) % sum(list(map(int, n))) == 0:\n-\tprint(\"YES\")\n else:\n-\tprint(\"NO\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u610816226", "problem_id": "p02410", "submission1_id": "s033768142-FL", "submission2_id": "s630286297", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\nn_l = []\nans = [0, 0, 0]\n\nfor _ in range(n):\n l = list(map(int, input().split()))\n n_l.append(l)\nfor x in range(m):\n p = int(input())\n n_l[:0] *= p\nfor i in n_l:\n print(sum(i))\n", "code2": "n, m = map(int, input().split())\nn_l = []\nans = [0, 0, 0]\n\nfor _ in range(n):\n l = list(map(int, input().split()))\n n_l.append(l)\nfor x in range(m):\n p = int(input())\n for o in range(n):\n n_l[o][x] *= p\nfor i in n_l:\n print(sum(i))\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556868788", "date2": "1556870831", "bleu_score": "0.8722257626902015", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 4\n1 4 0 1\n0 3 1 2\n4 1 1 0\n0\n-1\n3\n-1\n", "actual_output": "6\n6\n6\n", "expected_output": "-5\n-2\n2\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=3, m=4\nn_l = [] # (1): n_l=[]\nans = [0, 0, 0] # (2): ans=[0, 0, 0]\n\nfor _ in range(n): # (3): _=0 (6): _=1 ... (12): NO CHANGE\n l = list(map(int, input().split())) # (4): l=[1, 4, 0, 1] (7): l=[0, 3, 1, 2] (10): l=[4, 1, 1, 0]\n n_l.append(l) # (5): n_l=[[1, 4, 0, 1]] (8): n_l (11): n_l\nfor x in range(m): # (13): x=0 (16): x=1 ... (25): NO CHANGE\n p = int(input()) # (14): p=0 (17): p=-1 ... (23): p=-1\n n_l[:0] *= p # (15): NO CHANGE (18): NO CHANGE ... (24): NO CHANGE\nfor i in n_l: # (26): i=[1, 4, 0, 1] (28): i=[0, 3, 1, 2] (30): i=[4, 1, 1, 0]\n print(sum(i)) # (27): NO CHANGE (29): NO CHANGE (31): NO CHANGE\n"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n n_l = []\n ans = [0, 0, 0]\n \n for _ in range(n):\n l = list(map(int, input().split()))\n n_l.append(l)\n for x in range(m):\n p = int(input())\n- n_l[:0] *= p\n+ for o in range(n):\n+ n_l[o][x] *= p\n for i in n_l:\n print(sum(i))\n \n", "FL_content": "\n n, m = map(int, input().split())\n n_l = []\n-ans = [0, 0, 0]\n \n for _ in range(n):\n l = list(map(int, input().split()))\n n_l.append(l)\n for x in range(m):\n p = int(input())\n- n_l[:0] *= p\n for i in n_l:\n print(sum(i))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u535719732", "problem_id": "p02420", "submission1_id": "s603580998-FL", "submission2_id": "s431146096", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n data = input()\n if(data == \"-\"):break\n m = int(input())\n tmp = []\n flag = False\n for i in range(m):\n num = int(input())\n if(flag):\n tmp = data[num:] + data[:num] \n flag = True\n data = \"\"\n else:\n data = tmp[num:] + tmp[:num]\n flag = False\n tmp = \"\"\n", "code2": "while True:\n data = input()\n if(data == \"-\"):break\n m = int(input())\n tmp = []\n\n for i in range(m):\n num = int(input())\n if(len(tmp) == 0):\n tmp = data[num:] + data[:num]\n data = \"\"\n else:\n data = tmp[num:] + tmp[:num]\n tmp = \"\"\n if(data): print(data)\n else: print(tmp)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1559296290", "date2": "1559297037", "bleu_score": "0.8286454418725804", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "aaac\n3\n1\n2\n2\nvxxyz\n2\n3\n4\n-\n", "actual_output": "", "expected_output": "aaca\nxyzvx\n\n", "anno_code": ["while True: # (0): NO CHANGE (25): NO CHANGE (44): NO CHANGE\n data = input() # (1): data=aaac (26): data=vxxyz (45): data=-\n if(data == \"-\"):break # (2): NO CHANGE (27): NO CHANGE\n m = int(input()) # (3): m=3 (28): m=2\n tmp = [] # (4): tmp=[] (29): tmp=[]\n flag = False # (5): flag=False (30): NO CHANGE\n for i in range(m): # (6): i=0 (12): i=1 ... (43): NO CHANGE\n num = int(input()) # (7): num=1 (13): num=2 ... (38): num=4\n if(flag): # (8): NO CHANGE (14): NO CHANGE ... (39): NO CHANGE\n tmp = data[num:] + data[:num] \n flag = True\n data = \"\"\n else:\n data = tmp[num:] + tmp[:num] # (9): data=[] (15): data= ... (40): data=\n flag = False # (10): NO CHANGE (16): NO CHANGE ... (41): NO CHANGE\n tmp = \"\" # (11): tmp= (17): NO CHANGE ... (42): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n data = input()\n if(data == \"-\"):break\n m = int(input())\n tmp = []\n- flag = False\n+\n for i in range(m):\n num = int(input())\n- if(flag):\n- tmp = data[num:] + data[:num] \n- flag = True\n+ if(len(tmp) == 0):\n+ tmp = data[num:] + data[:num]\n data = \"\"\n else:\n data = tmp[num:] + tmp[:num]\n- flag = False\n tmp = \"\"\n+ if(data): print(data)\n+ else: print(tmp)\n \n", "FL_content": "\n while True:\n data = input()\n if(data == \"-\"):break\n m = int(input())\n tmp = []\n flag = False\n for i in range(m):\n num = int(input())\n if(flag):\n tmp = data[num:] + data[:num] \n flag = True\n data = \"\"\n else:\n data = tmp[num:] + tmp[:num]\n flag = False\n tmp = \"\"\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u844789719", "problem_id": "p02839", "submission1_id": "s704997025-FL", "submission2_id": "s332876090", "status1": "Wrong Answer", "status2": "Accepted", "code1": "I = [int(_) for _ in open(0).read().split()]\nH, W = I[:2]\nA = I[2:2 + H * W]\nB = I[2 + H * W:]\nD = [abs(a - b) for a, b in zip(A, B)]\ndp = [0] + [1] + [0] * (W - 1)\nfor h in range(H):\n dpo = dp\n dp = [0] * (W + 1)\n for w, d in enumerate(D[W * h:W * (h + 1)]):\n s = dp[w] | dpo[w + 1]\n dp[w + 1] = (s << d) | (s >> d)\n t = bin(s)[2:][-1 - d:][::-1]\n t += '0' * (d - len(t))\n dp[w + 1] |= int(t, 2)\nfor i in range(160 * 80):\n if dp[-1] & 2**i:\n print(i)\n exit()\n", "code2": "I = [int(_) for _ in open(0).read().split()]\nH, W = I[:2]\nA = I[2:2 + H * W]\nB = I[2 + H * W:]\nD = [abs(a - b) for a, b in zip(A, B)]\ndp = [0] + [1] + [0] * (W - 1)\nfor h in range(H):\n dpo = dp\n dp = [0] * (W + 1)\n for w, d in enumerate(D[W * h:W * (h + 1)]):\n s = dp[w] | dpo[w + 1]\n dp[w + 1] = (s << d) | (s >> d)\n if d:\n t = bin(s)[2:][::-1][:d + 1]\n t += '0' * (d + 1 - len(t))\n dp[w + 1] |= int(t, 2)\nfor i in range(160 * 80):\n if dp[-1] & 2**i:\n print(i)\n exit()\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1595641955", "date2": "1595642399", "bleu_score": "0.9352444332996089", "code1_test_status": [0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 6, "total_score": 102, "input": "1 3\n0 10 4\n151 14 1\n1 2 3\n3 2 6\n", "actual_output": "143\n", "expected_output": "144\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " I = [int(_) for _ in open(0).read().split()]\n H, W = I[:2]\n A = I[2:2 + H * W]\n B = I[2 + H * W:]\n D = [abs(a - b) for a, b in zip(A, B)]\n dp = [0] + [1] + [0] * (W - 1)\n for h in range(H):\n dpo = dp\n dp = [0] * (W + 1)\n for w, d in enumerate(D[W * h:W * (h + 1)]):\n s = dp[w] | dpo[w + 1]\n dp[w + 1] = (s << d) | (s >> d)\n- t = bin(s)[2:][-1 - d:][::-1]\n- t += '0' * (d - len(t))\n- dp[w + 1] |= int(t, 2)\n+ if d:\n+ t = bin(s)[2:][::-1][:d + 1]\n+ t += '0' * (d + 1 - len(t))\n+ dp[w + 1] |= int(t, 2)\n for i in range(160 * 80):\n if dp[-1] & 2**i:\n print(i)\n exit()\n \n", "FL_content": "\n I = [int(_) for _ in open(0).read().split()]\n H, W = I[:2]\n A = I[2:2 + H * W]\n B = I[2 + H * W:]\n D = [abs(a - b) for a, b in zip(A, B)]\n dp = [0] + [1] + [0] * (W - 1)\n for h in range(H):\n dpo = dp\n dp = [0] * (W + 1)\n for w, d in enumerate(D[W * h:W * (h + 1)]):\n s = dp[w] | dpo[w + 1]\n dp[w + 1] = (s << d) | (s >> d)\n t = bin(s)[2:][-1 - d:][::-1]\n- t += '0' * (d - len(t))\n dp[w + 1] |= int(t, 2)\n for i in range(160 * 80):\n if dp[-1] & 2**i:\n print(i)\n exit()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u829249049", "problem_id": "p02837", "submission1_id": "s695743237-FL", "submission2_id": "s137340713", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nALL=[]\nfor i in range(N):\n A=int(input())\n XY=[]\n for k in range(A):\n x,y=map(int,input().split())\n XY+=[[x,y]]\n ALL+=[XY]\nans=0 \nfor i in range(2**N):\n people=[-1]*N\n anssub=0\n for k in range(N):\n if ((i >> k) & 1):\n if people[k]==1:\n people[k]=-2 \n people[k]=0\n anssub+=1\n for t in ALL[k]:\n if people[t[0]-1]!=t[1] and people[t[0]-1]!=-1:\n people[t[0]-1]=-2\n else:\n people[t[0]-1]=t[1]\n else:\n if people[k]==0:\n people[k]=-2\n people[k]=1 \n for t in ALL[k]:\n if t[1]==0:\n if people[t[0]-1]!=1 and people[t[0]-1]!=-1:\n people[t[0]-1]=-2\n else:\n people[t[0]-1]=1\n else:\n if people[t[0]-1]!=0 and people[t[0]-1]!=-1:\n people[t[0]-1]=-2\n else:\n people[t[0]-1]=0\n if not -2 in people:\n ans=max(ans,anssub)\nprint(ans) ", "code2": "N=int(input())\nALL=[]\nfor i in range(N):\n A=int(input())\n XY=[]\n for k in range(A):\n x,y=map(int,input().split())\n XY+=[[x,y]]\n ALL+=[XY]\nans=0 \nfor i in range(2**N):\n people=[-1]*N\n anssub=0\n for k in range(N):\n if ((i >> k) & 1):\n if people[k]==0 or people[k]==-2:\n people[k]=-2 \n else:\n people[k]=1\n anssub+=1\n for t in ALL[k]:\n if people[t[0]-1]!=t[1] and people[t[0]-1]!=-1:\n people[t[0]-1]=-2\n else:\n people[t[0]-1]=t[1]\n else:\n if people[k]==1 or people[k]==-2:\n people[k]=-2\n else:\n people[k]=0 \n if not -2 in people:\n ans=max(ans,anssub)\nprint(ans) ", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589935909", "date2": "1589938740", "bleu_score": "0.6786547889269854", "code1_test_status": [0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0], "code1_test_score": 17, "total_score": 103, "input": "3\n2\n2 0\n3 0\n2\n2 1\n1 0\n2\n1 1\n2 0\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["N=int(input()) # (0): N=3\nALL=[] # (1): ALL=[]\nfor i in range(N): # (2): i=0 (13): i=1 ... (35): NO CHANGE\n A=int(input()) # (3): A=2 (14): NO CHANGE (25): NO CHANGE\n XY=[] # (4): XY=[] (15): XY=[] (26): XY=[]\n for k in range(A): # (5): k=0 (8): k=1 ... (33): NO CHANGE\n x,y=map(int,input().split()) # (6): x=2, y=0 (9): x=3 ... (31): x=2, y=0\n XY+=[[x,y]] # (7): XY (10): XY ... (32): XY\n ALL+=[XY] # (12): ALL=[[[2, 0], [3, 0]]] (23): ALL (34): ALL\nans=0 # (36): ans=0\nfor i in range(2**N): # (37): i=0 (81): i=1 ... (385): NO CHANGE\n people=[-1]*N # (38): people=[-1, -1, -1] (82): people=[-1, -1, -1] ... (345): people=[-1, -1, -1]\n anssub=0 # (39): anssub=0 (83): NO CHANGE ... (346): anssub=0\n for k in range(N): # (40): k=0 (53): k=1 ... (383): NO CHANGE\n if ((i >> k) & 1): # (41): NO CHANGE (54): NO CHANGE ... (372): NO CHANGE\n if people[k]==1: # (86): NO CHANGE (144): NO CHANGE ... (373): NO CHANGE\n people[k]=-2 # (145): people=[1, -2, 1] (245): people=[1, -2, -2] ... (332): people=[-2, -2, -2]\n people[k]=0 # (87): people=[0, -1, -1] (146): people=[1, 0, 1] ... (374): NO CHANGE\n anssub+=1 # (88): anssub=1 (147): anssub=1 ... (375): anssub=3\n for t in ALL[k]: # (89): NO CHANGE (92): t=[3, 0] ... (382): NO CHANGE\n if people[t[0]-1]!=t[1] and people[t[0]-1]!=-1: # (90): NO CHANGE (93): NO CHANGE ... (380): NO CHANGE\n people[t[0]-1]=-2 # (150): people=[1, -2, 1] (153): people=[-2, -2, 1] ... (381): NO CHANGE\n else:\n people[t[0]-1]=t[1] # (91): people=[0, 0, -1] (94): people=[0, 0, 0] ... (369): NO CHANGE\n else:\n if people[k]==0: # (42): NO CHANGE (55): NO CHANGE ... (305): NO CHANGE\n people[k]=-2 # (99): people=[0, -2, 0] (113): people=[-2, -2, -2] ... (275): people=[0, -2, 0]\n people[k]=1 # (43): people=[1, -1, -1] (56): NO CHANGE ... (306): people=[1, -1, -1]\n for t in ALL[k]: # (44): t=[2, 0] (48): t=[3, 0] ... (315): NO CHANGE\n if t[1]==0: # (45): NO CHANGE (49): NO CHANGE ... (312): NO CHANGE\n if people[t[0]-1]!=1 and people[t[0]-1]!=-1: # (46): NO CHANGE (50): NO CHANGE ... (313): NO CHANGE\n people[t[0]-1]=-2 # (77): NO CHANGE (108): people=[-2, -2, 0] ... (284): people=[-2, -2, 0]\n else:\n people[t[0]-1]=1 # (47): people=[1, 1, -1] (51): people=[1, 1, 1] ... (314): people=[1, 1, 1]\n else:\n if people[t[0]-1]!=0 and people[t[0]-1]!=-1: # (59): NO CHANGE (72): NO CHANGE ... (279): NO CHANGE\n people[t[0]-1]=-2 # (60): people=[1, -2, 1] (73): people=[-2, -2, 1] ... (280): people=[0, -2, 0]\n else:\n people[t[0]-1]=0 # (205): NO CHANGE\n if not -2 in people: # (80): NO CHANGE (125): NO CHANGE ... (384): NO CHANGE\n ans=max(ans,anssub)\nprint(ans) "], "anno_status": [false], "diff_content": " N=int(input())\n ALL=[]\n for i in range(N):\n A=int(input())\n XY=[]\n for k in range(A):\n x,y=map(int,input().split())\n XY+=[[x,y]]\n ALL+=[XY]\n ans=0 \n for i in range(2**N):\n people=[-1]*N\n anssub=0\n for k in range(N):\n if ((i >> k) & 1):\n- if people[k]==1:\n+ if people[k]==0 or people[k]==-2:\n people[k]=-2 \n- people[k]=0\n+ else:\n+ people[k]=1\n anssub+=1\n for t in ALL[k]:\n if people[t[0]-1]!=t[1] and people[t[0]-1]!=-1:\n people[t[0]-1]=-2\n else:\n people[t[0]-1]=t[1]\n else:\n- if people[k]==0:\n+ if people[k]==1 or people[k]==-2:\n people[k]=-2\n- people[k]=1 \n- for t in ALL[k]:\n- if t[1]==0:\n- if people[t[0]-1]!=1 and people[t[0]-1]!=-1:\n- people[t[0]-1]=-2\n- else:\n- people[t[0]-1]=1\n- else:\n- if people[t[0]-1]!=0 and people[t[0]-1]!=-1:\n- people[t[0]-1]=-2\n- else:\n- people[t[0]-1]=0\n+ else:\n+ people[k]=0 \n if not -2 in people:\n ans=max(ans,anssub)\n-print(ans) \n+print(ans) \n", "FL_content": "\n N=int(input())\n ALL=[]\n for i in range(N):\n A=int(input())\n XY=[]\n for k in range(A):\n x,y=map(int,input().split())\n XY+=[[x,y]]\n ALL+=[XY]\n ans=0 \n for i in range(2**N):\n people=[-1]*N\n anssub=0\n for k in range(N):\n if ((i >> k) & 1):\n if people[k]==1:\n people[k]=-2 \n people[k]=0\n anssub+=1\n for t in ALL[k]:\n if people[t[0]-1]!=t[1] and people[t[0]-1]!=-1:\n people[t[0]-1]=-2\n else:\n people[t[0]-1]=t[1]\n else:\n if people[k]==0:\n people[k]=-2\n people[k]=1 \n for t in ALL[k]:\n if t[1]==0:\n if people[t[0]-1]!=1 and people[t[0]-1]!=-1:\n people[t[0]-1]=-2\n else:\n people[t[0]-1]=1\n else:\n if people[t[0]-1]!=0 and people[t[0]-1]!=-1:\n people[t[0]-1]=-2\n else:\n people[t[0]-1]=0\n if not -2 in people:\n ans=max(ans,anssub)\n print(ans) \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 42 }, { "user_id": "u619455726", "problem_id": "p03147", "submission1_id": "s867863500-FL", "submission2_id": "s059877023", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nn=int(input()) \nglobal h\nh=list(map(int, input().split())) \nglobal cnt\ncnt=0\nwhile sum(h) !=0:\n for L in range(0,len(h)):\n if h[L] != 0:\n for r in range(L+1 ,len(h)):\n if h[r] == 0:\n \n for k in range(L,r):\n h[k]-=1\n cnt+=1\n break\n else:\n r = len(h)\n for k in range(L,r):\n h[k]-=1\n cnt+=1\n break\nprint(cnt)\n", "code2": "\n\nn=int(input()) \nh=list(map(int, input().split())) \ncnt=0\nL=0\nwhile L != len(h):\n if h[L] != 0:\n for r in range(L+1 ,len(h)):\n if h[r] == 0:\n \n for k in range(L,r):\n h[k]-=1\n cnt+=1\n break\n else:\n r = len(h)\n for k in range(L,r):\n h[k]-=1\n cnt+=1\n elif h[L] == 0:\n L+=1\nprint(cnt)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569258269", "date2": "1569258826", "bleu_score": "0.7755406461030453", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 42, "total_score": 99, "input": "8\n3 65 13 0 0 84 8 011\n", "actual_output": "157\n", "expected_output": "152\n\n", "anno_code": ["\n\nn=int(input()) # (0): n=8\nglobal h\nh=list(map(int, input().split())) # (1): h=[3, 65, 13, 0, 0, 84, 8, 11]\nglobal cnt\ncnt=0 # (2): cnt=0\nwhile sum(h) !=0: # (3): NO CHANGE (64): NO CHANGE ... (2679): NO CHANGE\n for L in range(0,len(h)): # (4): L=0 (21): L=1 ... (2678): NO CHANGE\n if h[L] != 0: # (5): NO CHANGE (22): NO CHANGE ... (2677): NO CHANGE\n for r in range(L+1 ,len(h)): # (6): r=1 (8): r=2 ... (2667): NO CHANGE\n if h[r] == 0: # (7): NO CHANGE (9): NO CHANGE ... (2668): NO CHANGE\n \n for k in range(L,r): # (12): k=0 (14): k=1 ... (2671): NO CHANGE\n h[k]-=1 # (13): h=[2, 65, 13, 0, 0, 84, 8, 11] (15): h=[2, 64, 13, 0, 0, 84, 8, 11] ... (2670): h=[0, 0, 0, 0, 0, 0, 0, 0]\n cnt+=1 # (19): cnt=1 (32): cnt=2 ... (2672): cnt=157\n break # (20): NO CHANGE (33): NO CHANGE ... (2673): NO CHANGE\n else:\n r = len(h) # (54): r=8 (115): r=8 ... (491): r=8\n for k in range(L,r): # (55): k=5 (57): k=6 ... (494): NO CHANGE\n h[k]-=1 # (56): h=[2, 63, 10, 0, 0, 83, 8, 11] (58): h=[2, 63, 10, 0, 0, 83, 7, 11] ... (493): h=[0, 51, 0, 0, 0, 73, 0, 0]\n cnt+=1 # (62): cnt=4 (123): cnt=8 ... (495): cnt=33\n break # (63): NO CHANGE (124): NO CHANGE ... (496): NO CHANGE\nprint(cnt)\n"], "anno_status": [true], "diff_content": " \n \n n=int(input()) \n-global h\n h=list(map(int, input().split())) \n-global cnt\n cnt=0\n-while sum(h) !=0:\n- for L in range(0,len(h)):\n- if h[L] != 0:\n- for r in range(L+1 ,len(h)):\n- if h[r] == 0:\n- \n- for k in range(L,r):\n- h[k]-=1\n- cnt+=1\n- break\n- else:\n- r = len(h)\n+L=0\n+while L != len(h):\n+ if h[L] != 0:\n+ for r in range(L+1 ,len(h)):\n+ if h[r] == 0:\n+ \n for k in range(L,r):\n h[k]-=1\n cnt+=1\n break\n+ else:\n+ r = len(h)\n+ for k in range(L,r):\n+ h[k]-=1\n+ cnt+=1\n+ elif h[L] == 0:\n+ L+=1\n print(cnt)\n \n", "FL_content": "\n \n \n n=int(input()) \n global h\n h=list(map(int, input().split())) \n global cnt\n cnt=0\n while sum(h) !=0:\n for L in range(0,len(h)):\n if h[L] != 0:\n for r in range(L+1 ,len(h)):\n if h[r] == 0:\n \n for k in range(L,r):\n h[k]-=1\n cnt+=1\n break\n else:\n r = len(h)\n for k in range(L,r):\n h[k]-=1\n cnt+=1\n break\n print(cnt)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 25 }, { "user_id": "u020390084", "problem_id": "p02839", "submission1_id": "s712069849-FL", "submission2_id": "s257046511", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\n\n\ndef solve(H: int, W: int, A: \"List[List[int]]\", B: \"List[List[int]]\"):\n\n \n ab = [[0]*W for _ in range(H)]\n\n for h in range(H):\n for w in range(W):\n ab[h][w] = abs(A[h][w]-B[h][w])\n \n setlist = [set() for _ in range(H+W-1)]\n setlist[0].add(ab[0][0])\n for i in range(1,H+W-1):\n h = i\n w = 0\n while h >= 0:\n if h >= H or w>=W:\n h -= 1\n w += 1\n continue\n for num in setlist[i-1]:\n if abs(num+ab[h][w]) < 160:\n setlist[i].add(abs(num+ab[h][w]))\n setlist[i].add(abs(num-ab[h][w]))\n h -= 1\n w += 1\n \n print(min(setlist[H+W-2]))\n return\n\n\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n H = int(next(tokens)) \n W = int(next(tokens)) \n A = [[int(next(tokens)) for _ in range(W)] for _ in range(H)] \n B = [[int(next(tokens)) for _ in range(W)] for _ in range(H)] \n solve(H, W, A, B)\n\nif __name__ == '__main__':\n main()\n", "code2": "\nimport sys\n\ndef solve(H: int, W: int, A: \"List[List[int]]\", B: \"List[List[int]]\"):\n SA=[[0]*W for i in range(H)]\n MAX = (H+W)*80\n for i in range(H):\n for j in range(W):\n SA[i][j]=abs(A[i][j]-B[i][j])\n\n DP=[[0 for i in range(W)] for j in range(H)]\n DP[0][0]=1<>SA[i+1][j]\n\n if j>SA[i][j+1]\n\n ANS=1<\n\n \n ab = [[0]*W for _ in range(H)]\n\n for h in range(H):\n for w in range(W):\n ab[h][w] = abs(A[h][w]-B[h][w])\n \n setlist = [set() for _ in range(H+W-1)]\n setlist[0].add(ab[0][0])\n for i in range(1,H+W-1):\n h = i\n w = 0\n while h >= 0:\n if h >= H or w>=W:\n h -= 1\n w += 1\n continue\n for num in setlist[i-1]:\n if abs(num+ab[h][w]) < 160:\n setlist[i].add(abs(num+ab[h][w]))\n setlist[i].add(abs(num-ab[h][w]))\n h -= 1\n w += 1\n \n print(min(setlist[H+W-2]))\n return\n\n\n\ndef main(): # (1): main=\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n H = int(next(tokens)) \n W = int(next(tokens)) \n A = [[int(next(tokens)) for _ in range(W)] for _ in range(H)] \n B = [[int(next(tokens)) for _ in range(W)] for _ in range(H)] \n solve(H, W, A, B)\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [false], "diff_content": " \n import sys\n \n-\n def solve(H: int, W: int, A: \"List[List[int]]\", B: \"List[List[int]]\"):\n-\n- \n- ab = [[0]*W for _ in range(H)]\n-\n- for h in range(H):\n- for w in range(W):\n- ab[h][w] = abs(A[h][w]-B[h][w])\n- \n- setlist = [set() for _ in range(H+W-1)]\n- setlist[0].add(ab[0][0])\n- for i in range(1,H+W-1):\n- h = i\n- w = 0\n- while h >= 0:\n- if h >= H or w>=W:\n- h -= 1\n- w += 1\n- continue\n- for num in setlist[i-1]:\n- if abs(num+ab[h][w]) < 160:\n- setlist[i].add(abs(num+ab[h][w]))\n- setlist[i].add(abs(num-ab[h][w]))\n- h -= 1\n- w += 1\n- \n- print(min(setlist[H+W-2]))\n+ SA=[[0]*W for i in range(H)]\n+ MAX = (H+W)*80\n+ for i in range(H):\n+ for j in range(W):\n+ SA[i][j]=abs(A[i][j]-B[i][j])\n+\n+ DP=[[0 for i in range(W)] for j in range(H)]\n+ DP[0][0]=1<>SA[i+1][j]\n+\n+ if j>SA[i][j+1]\n+\n+ ANS=1<= 0:\n if h >= H or w>=W:\n h -= 1\n w += 1\n continue\n for num in setlist[i-1]:\n- if abs(num+ab[h][w]) < 160:\n setlist[i].add(abs(num+ab[h][w]))\n setlist[i].add(abs(num-ab[h][w]))\n h -= 1\n w += 1\n \n print(min(setlist[H+W-2]))\n return\n \n \n \n def main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n H = int(next(tokens)) \n W = int(next(tokens)) \n A = [[int(next(tokens)) for _ in range(W)] for _ in range(H)] \n B = [[int(next(tokens)) for _ in range(W)] for _ in range(H)] \n solve(H, W, A, B)\n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 50 }, { "user_id": "u979075927", "problem_id": "p03433", "submission1_id": "s743573036-FL", "submission2_id": "s626017916", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = int(input())\n\nn \nif n <= a:\n print(\"Yes\")\nelse:\n print('No')", "code2": "n = int(input())\na = int(input())\n\nn %= 500\nif n <= a:\n print(\"Yes\")\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1519005705", "date2": "1519005772", "bleu_score": "0.917775907756491", "code1_test_status": [1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 97, "total_score": 103, "input": "2018\n110\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["n = int(input()) # (0): n=2018\na = int(input()) # (1): a=110\n\nn # (2): NO CHANGE\nif n <= a: # (3): NO CHANGE\n print(\"Yes\")\nelse:\n print('No')"], "anno_status": [true], "diff_content": " n = int(input())\n a = int(input())\n \n-n \n+n %= 500\n if n <= a:\n print(\"Yes\")\n else:\n print('No')\n", "FL_content": "\n n = int(input())\n a = int(input())\n \n-n \n-if n <= a:\n print(\"Yes\")\n else:\n print('No')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u435300817", "problem_id": "p02396", "submission1_id": "s168178809-FL", "submission2_id": "s456462209", "status1": "Wrong Answer", "status2": "Accepted", "code1": "values = input()\ni_list = [int(x) for x in values.split()]\nfor i, v in enumerate(i_list):\n if 0 == v:\n break\n print('Case {0}: {1}'.format(i + 1, v))", "code2": "values = []\nwhile True:\n v = int(input())\n if 0 == v:\n break\n values.append(v)\n\nfor i, v in enumerate(values):\n print('Case {0}: {1}'.format(i + 1, v)) ", "original_language1": "Python3", "original_language2": "Python3", "date1": "1480170051", "date2": "1480177924", "bleu_score": "0.7366912048513323", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 101, "input": "3\n1\n20\n9\n23\n34\n0\n", "actual_output": "Case 1: 3\n", "expected_output": "Case 1: 3\nCase 2: 1\nCase 3: 20\nCase 4: 9\nCase 5: 23\nCase 6: 34\n\n", "anno_code": ["values = input() # (0): values=3\ni_list = [int(x) for x in values.split()] # (1): i_list=[3]\nfor i, v in enumerate(i_list): # (2): i=0, v=3\n if 0 == v: # (3): NO CHANGE\n break\n print('Case {0}: {1}'.format(i + 1, v)) # (4): NO CHANGE\n"], "anno_status": [true], "diff_content": "-values = input()\n-i_list = [int(x) for x in values.split()]\n-for i, v in enumerate(i_list):\n+values = []\n+while True:\n+ v = int(input())\n if 0 == v:\n break\n- print('Case {0}: {1}'.format(i + 1, v))\n+ values.append(v)\n+\n+for i, v in enumerate(values):\n+ print('Case {0}: {1}'.format(i + 1, v)) \n", "FL_content": "\n-values = input()\n-i_list = [int(x) for x in values.split()]\n for i, v in enumerate(i_list):\n if 0 == v:\n break\n- print('Case {0}: {1}'.format(i + 1, v))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u129978636", "problem_id": "p03338", "submission1_id": "s629722823-FL", "submission2_id": "s237999604", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int( input())\nS = list( input())\n\nintger2 = 0\n\nfor i in range(N):\n intger1 = 0\n str1 = list(set(S[i:]))\n str2 = list(set(S[:i + 1]))\n l = len(str2)\n \n for j in range(l):\n if( str2[j] in str1):\n intger1 += 1\n \n else:\n continue\n \n if( intger2 <= intger1):\n intger2 = intger1\n \n else:\n continue\n \nprint(intger2)", "code2": "N = int( input())\nS = list( input())\n\nintger2 = 0\nc = []\n\nfor i in range(N):\n intger1 = 0\n str1 = list(set(S[i + 1:]))\n str2 = list(set(S[:i + 1]))\n l = len(str2)\n \n for j in range(l):\n if( str2[j] in str1):\n intger1 += 1\n \n else:\n continue\n \n if( intger2 <= intger1):\n intger2 = intger1\n c.append(intger2)\n \n else:\n continue\n\nprint(max(c))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1542468872", "date2": "1542473024", "bleu_score": "0.9124929266872315", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 69, "total_score": 103, "input": "6\nab`dcb\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["N = int( input()) # (0): N=6\nS = list( input()) # (1): S=['a', 'b', '`', 'd', 'c', 'b']\n\nintger2 = 0 # (2): intger2=0\n\nfor i in range(N): # (3): i=0 (14): i=1 ... (111): NO CHANGE\n intger1 = 0 # (4): intger1=0 (15): intger1=0 ... (89): intger1=0\n str1 = list(set(S[i:])) # (5): str1=['d', 'c', '`', 'b', 'a'] (16): str1=['d', '`', 'b', 'c'] ... (90): str1=['b']\n str2 = list(set(S[:i + 1])) # (6): str2=['a'] (17): str2=['b', 'a'] ... (91): NO CHANGE\n l = len(str2) # (7): l=1 (18): l=2 ... (92): NO CHANGE\n \n for j in range(l): # (8): j=0 (11): NO CHANGE ... (108): NO CHANGE\n if( str2[j] in str1): # (9): NO CHANGE (20): NO CHANGE ... (106): NO CHANGE\n intger1 += 1 # (10): intger1=1 (21): intger1=1 ... (104): intger1=1\n \n else:\n continue # (24): NO CHANGE (41): NO CHANGE ... (107): NO CHANGE\n \n if( intger2 <= intger1): # (12): NO CHANGE (26): NO CHANGE ... (109): NO CHANGE\n intger2 = intger1 # (13): intger2=1 (27): NO CHANGE ... (87): NO CHANGE\n \n else:\n continue # (110): NO CHANGE\n \nprint(intger2)"], "anno_status": [true], "diff_content": " N = int( input())\n S = list( input())\n \n intger2 = 0\n+c = []\n \n for i in range(N):\n intger1 = 0\n- str1 = list(set(S[i:]))\n+ str1 = list(set(S[i + 1:]))\n str2 = list(set(S[:i + 1]))\n l = len(str2)\n \n for j in range(l):\n if( str2[j] in str1):\n intger1 += 1\n \n else:\n continue\n \n if( intger2 <= intger1):\n intger2 = intger1\n+ c.append(intger2)\n \n else:\n continue\n- \n-print(intger2)\n+\n+print(max(c))\n", "FL_content": "\n N = int( input())\n S = list( input())\n \n intger2 = 0\n \n for i in range(N):\n intger1 = 0\n str1 = list(set(S[i:]))\n str2 = list(set(S[:i + 1]))\n l = len(str2)\n \n for j in range(l):\n if( str2[j] in str1):\n intger1 += 1\n \n else:\n continue\n \n if( intger2 <= intger1):\n intger2 = intger1\n \n else:\n continue\n \n print(intger2)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 25 }, { "user_id": "u957843607", "problem_id": "p02837", "submission1_id": "s772531005-FL", "submission2_id": "s580859994", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\na = [[] for _ in range(N)]\nfor i in range(N):\n A_i = int(input())\n for j in range(A_i):\n a[i].append(list(map(int, input().split())))\n \nfor i in range(2**N):\n contradiction = False\n max_honest = 0\n honest_p = []\n unkind_p = []\n doubt_honest_p = []\n doubt_unkind_p = []\n length = len(format(2**N-1, \"b\"))\n bin_num = format(i, \"b\").zfill(length)\n for j in range(length):\n if (i >> j) & 1:\n if not j+1 in honest_p:\n \thonest_p.append(j+1)\n if not j+1 in doubt_honest_p:\n \tdoubt_honest_p.append(j+1)\n for k in a[j]:\n p = k[0]\n t = k[1]\n if t:\n if not p in honest_p:\n \thonest_p.append(p)\n else:\n if not p in unkind_p: \n \tunkind_p.append(p)\n else:\n if not j+1 in unkind_p:\n unkind_p.append(j+1)\n if not j+1 in doubt_unkind_p:\n \tdoubt_unkind_p.append(j+1)\n if len(list(set(honest_p) & set(unkind_p))) != 0:\n contradiction = True\n if not contradiction and max_honest <= len(doubt_honest_p):\n max_honest = len(doubt_honest_p)\n \nprint(max_honest)", "code2": "N = int(input())\na = [[] for _ in range(N)]\nfor i in range(N):\n A_i = int(input())\n for j in range(A_i):\n a[i].append(list(map(int, input().split())))\n \nmax_honest = 0\nfor i in range(2**N):\n contradiction = False\n honest_p = []\n unkind_p = []\n doubt_honest_p = []\n doubt_unkind_p = []\n length = len(format(2**N-1, \"b\"))\n bin_num = format(i, \"b\").zfill(length)\n for j in range(length):\n if (i >> j) & 1:\n if not j+1 in honest_p:\n \thonest_p.append(j+1)\n if not j+1 in doubt_honest_p:\n \tdoubt_honest_p.append(j+1)\n for k in a[j]:\n p = k[0]\n t = k[1]\n if t:\n if not p in honest_p:\n \thonest_p.append(p)\n else:\n if not p in unkind_p: \n \tunkind_p.append(p)\n else:\n if not j+1 in unkind_p:\n unkind_p.append(j+1)\n if not j+1 in doubt_unkind_p:\n \tdoubt_unkind_p.append(j+1)\n if len(list(set(honest_p) & set(unkind_p))) != 0:\n contradiction = True\n if not contradiction and max_honest <= len(doubt_honest_p):\n max_honest = len(doubt_honest_p)\n \nprint(max_honest)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576688722", "date2": "1576694739", "bleu_score": "0.9929168596308554", "code1_test_status": [1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0], "code1_test_score": 28, "total_score": 103, "input": "3\n1\n3 1\n1\n1 0\n1\n2 0\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["N = int(input()) # (0): N=3\na = [[] for _ in range(N)] # (1): a\nfor i in range(N): # (2): i=0 (7): a, i=1 ... (17): NO CHANGE\n A_i = int(input()) # (3): A_i=1 (8): a (13): a\n for j in range(A_i): # (4): j=0 (6): a ... (16): NO CHANGE\n a[i].append(list(map(int, input().split()))) # (5): a=[[[3, 1]], [], []] (10): a (15): a\n \nfor i in range(2**N): # (18): i=0 (49): i=1 ... (344): NO CHANGE\n contradiction = False # (19): contradiction=False (50): NO CHANGE ... (294): contradiction=False\n max_honest = 0 # (20): max_honest=0 (51): NO CHANGE ... (295): NO CHANGE\n honest_p = [] # (21): honest_p=[] (52): NO CHANGE ... (296): honest_p=[]\n unkind_p = [] # (22): unkind_p=[] (53): unkind_p=[] ... (297): unkind_p=[]\n doubt_honest_p = [] # (23): doubt_honest_p=[] (54): NO CHANGE ... (298): doubt_honest_p=[]\n doubt_unkind_p = [] # (24): doubt_unkind_p=[] (55): doubt_unkind_p=[] ... (299): doubt_unkind_p=[]\n length = len(format(2**N-1, \"b\")) # (25): length=3 (56): NO CHANGE ... (300): NO CHANGE\n bin_num = format(i, \"b\").zfill(length) # (26): bin_num=000 (57): bin_num=001 ... (301): bin_num=111\n for j in range(length): # (27): NO CHANGE (33): j=1 ... (340): NO CHANGE\n if (i >> j) & 1: # (28): NO CHANGE (34): NO CHANGE ... (329): NO CHANGE\n if not j+1 in honest_p: # (60): NO CHANGE (104): NO CHANGE ... (330): NO CHANGE\n \thonest_p.append(j+1) # (61): honest_p=[1] (105): honest_p=[2] ... (318): honest_p=[1, 3, 2]\n if not j+1 in doubt_honest_p: # (62): NO CHANGE (106): NO CHANGE ... (331): NO CHANGE\n \tdoubt_honest_p.append(j+1) # (63): doubt_honest_p=[1] (107): doubt_honest_p=[2] ... (332): doubt_honest_p=[1, 2, 3]\n for k in a[j]: # (64): k=[3, 1] (70): NO CHANGE ... (339): NO CHANGE\n p = k[0] # (65): p=3 (109): p=1 ... (334): p=2\n t = k[1] # (66): t=1 (110): t=0 ... (335): NO CHANGE\n if t: # (67): NO CHANGE (111): NO CHANGE ... (336): NO CHANGE\n if not p in honest_p: # (68): NO CHANGE (143): NO CHANGE ... (312): NO CHANGE\n \thonest_p.append(p) # (69): honest_p=[1, 3] (144): honest_p=[1, 3] ... (313): honest_p=[1, 3]\n else:\n if not p in unkind_p: # (112): NO CHANGE (156): NO CHANGE ... (337): NO CHANGE\n \tunkind_p.append(p) # (157): unkind_p=[1] (287): unkind_p=[1, 2] ... (338): unkind_p=[1, 2]\n else:\n if not j+1 in unkind_p: # (29): NO CHANGE (35): NO CHANGE ... (260): NO CHANGE\n unkind_p.append(j+1) # (30): unkind_p=[1] (36): unkind_p=[1, 2] ... (261): unkind_p=[1]\n if not j+1 in doubt_unkind_p: # (31): NO CHANGE (37): NO CHANGE ... (262): NO CHANGE\n \tdoubt_unkind_p.append(j+1) # (32): doubt_unkind_p=[1] (38): doubt_unkind_p=[1, 2] ... (263): doubt_unkind_p=[1]\n if len(list(set(honest_p) & set(unkind_p))) != 0: # (46): NO CHANGE (84): NO CHANGE ... (341): NO CHANGE\n contradiction = True # (85): contradiction=True (167): contradiction=True ... (342): contradiction=True\n if not contradiction and max_honest <= len(doubt_honest_p): # (47): NO CHANGE (86): NO CHANGE ... (343): NO CHANGE\n max_honest = len(doubt_honest_p) # (48): NO CHANGE (123): max_honest=1 ... (248): max_honest=2\n \nprint(max_honest)"], "anno_status": [false], "diff_content": " N = int(input())\n a = [[] for _ in range(N)]\n for i in range(N):\n A_i = int(input())\n for j in range(A_i):\n a[i].append(list(map(int, input().split())))\n- \n+ \n+max_honest = 0\n for i in range(2**N):\n contradiction = False\n- max_honest = 0\n honest_p = []\n unkind_p = []\n doubt_honest_p = []\n doubt_unkind_p = []\n length = len(format(2**N-1, \"b\"))\n bin_num = format(i, \"b\").zfill(length)\n for j in range(length):\n if (i >> j) & 1:\n if not j+1 in honest_p:\n \thonest_p.append(j+1)\n if not j+1 in doubt_honest_p:\n \tdoubt_honest_p.append(j+1)\n for k in a[j]:\n p = k[0]\n t = k[1]\n if t:\n if not p in honest_p:\n \thonest_p.append(p)\n else:\n if not p in unkind_p: \n \tunkind_p.append(p)\n else:\n if not j+1 in unkind_p:\n unkind_p.append(j+1)\n if not j+1 in doubt_unkind_p:\n \tdoubt_unkind_p.append(j+1)\n if len(list(set(honest_p) & set(unkind_p))) != 0:\n contradiction = True\n if not contradiction and max_honest <= len(doubt_honest_p):\n max_honest = len(doubt_honest_p)\n \n print(max_honest)\n", "FL_content": "\n N = int(input())\n a = [[] for _ in range(N)]\n for i in range(N):\n A_i = int(input())\n for j in range(A_i):\n a[i].append(list(map(int, input().split())))\n \n for i in range(2**N):\n contradiction = False\n max_honest = 0\n honest_p = []\n unkind_p = []\n doubt_honest_p = []\n doubt_unkind_p = []\n length = len(format(2**N-1, \"b\"))\n bin_num = format(i, \"b\").zfill(length)\n for j in range(length):\n if (i >> j) & 1:\n if not j+1 in honest_p:\n \thonest_p.append(j+1)\n if not j+1 in doubt_honest_p:\n \tdoubt_honest_p.append(j+1)\n for k in a[j]:\n p = k[0]\n t = k[1]\n if t:\n if not p in honest_p:\n \thonest_p.append(p)\n else:\n if not p in unkind_p: \n \tunkind_p.append(p)\n else:\n if not j+1 in unkind_p:\n unkind_p.append(j+1)\n if not j+1 in doubt_unkind_p:\n \tdoubt_unkind_p.append(j+1)\n if len(list(set(honest_p) & set(unkind_p))) != 0:\n contradiction = True\n if not contradiction and max_honest <= len(doubt_honest_p):\n max_honest = len(doubt_honest_p)\n \n print(max_honest)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 42 }, { "user_id": "u404561212", "problem_id": "p03129", "submission1_id": "s177371784-FL", "submission2_id": "s871899883", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = list(map(int, input().split()))\nnum = 0\n\nfor n in range(1,N+1):\n if n%2!=0:\n num += 1\nif num < K:\n print(\"No\")\nelse:\n print(\"Yes\")", "code2": "N, K = list(map(int, input().split()))\nnum = 0\n\nfor n in range(1,N+1):\n if n%2!=0:\n num += 1\nif num=0:\n cnt+=1\nprint(cnt)", "code2": "import math\n\nN,D = map(int,input().split())\ncnt = 0\nfor n in range(N):\n a,b = map(int,input().split())\n if math.sqrt(a**2 + b**2)-D<=0:\n cnt+=1\nprint(cnt)\n\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597074578", "date2": "1597074758", "bleu_score": "0.9730644290195725", "code1_test_status": [0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0], "code1_test_score": 12, "total_score": 103, "input": "4 5\n0 5\n-2 4\n5 4\n4 -2\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["import math\n\nN,D = map(int,input().split()) # (0): N=4, D=5\ncnt = 0 # (1): cnt=0\nfor n in range(N): # (2): n=0 (6): n=1 ... (16): NO CHANGE\n a,b = map(int,input().split()) # (3): a=0, b=5 (7): a=-2, b=4 ... (14): a=4, b=-2\n if math.sqrt(a**2 + b**2)-D>=0: # (4): NO CHANGE (8): NO CHANGE ... (15): NO CHANGE\n cnt+=1 # (5): cnt=1 (12): cnt=2\nprint(cnt)"], "anno_status": [true], "diff_content": " import math\n \n N,D = map(int,input().split())\n cnt = 0\n for n in range(N):\n a,b = map(int,input().split())\n- if math.sqrt(a**2 + b**2)-D>=0:\n+ if math.sqrt(a**2 + b**2)-D<=0:\n cnt+=1\n print(cnt)\n+\n+\n", "FL_content": "\n import math\n \n N,D = map(int,input().split())\n cnt = 0\n for n in range(N):\n a,b = map(int,input().split())\n- if math.sqrt(a**2 + b**2)-D>=0:\n- cnt+=1\n print(cnt)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u527261492", "problem_id": "p02899", "submission1_id": "s737595767-FL", "submission2_id": "s324229954", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nA=list(map(int,input().split()))\na=[]\nfor i in range(n):\n a.append([i+1])\nfor j in range(n):\n a[j].append(A[j])\nsorted(a,key=lambda x:x[1])\nlst=[]\nfor i in range(n):\n lst.append(a[i][0])\nprint(lst)\n \n", "code2": "n=int(input())\nA=list(map(int,input().split()))\na=[]\nfor i in range(n):\n a.append([i+1,A[i]])\nb=sorted(a,key=lambda x:x[1])\nlst=[]\nfor k in range(n):\n lst.append(b[k][0])\nprint(*lst)\n \n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569720128", "date2": "1569723806", "bleu_score": "0.7685692546042097", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 11, "input": "5\n2 1 3 4 5\n", "actual_output": "[1, 2, 3, 4, 5]\n", "expected_output": "2 1 3 4 5 \n\n", "anno_code": ["n=int(input()) # (0): n=5\nA=list(map(int,input().split())) # (1): A=[2, 1, 3, 4, 5]\na=[] # (2): a=[]\nfor i in range(n): # (3): i=0 (5): i=1 ... (13): NO CHANGE\n a.append([i+1]) # (4): a (6): a ... (12): a\nfor j in range(n): # (14): j=0 (16): a, j=1 ... (24): NO CHANGE\n a[j].append(A[j]) # (15): a (17): a ... (23): a\nsorted(a,key=lambda x:x[1]) # (25): NO CHANGE\nlst=[] # (26): lst=[]\nfor i in range(n): # (27): i=0 (29): i=1 ... (37): NO CHANGE\n lst.append(a[i][0]) # (28): lst=[1] (30): lst=[1, 2] ... (36): lst=[1, 2, 3, 4, 5]\nprint(lst)\n \n"], "anno_status": [true], "diff_content": " n=int(input())\n A=list(map(int,input().split()))\n a=[]\n for i in range(n):\n- a.append([i+1])\n-for j in range(n):\n- a[j].append(A[j])\n-sorted(a,key=lambda x:x[1])\n+ a.append([i+1,A[i]])\n+b=sorted(a,key=lambda x:x[1])\n lst=[]\n-for i in range(n):\n- lst.append(a[i][0])\n-print(lst)\n+for k in range(n):\n+ lst.append(b[k][0])\n+print(*lst)\n \n \n", "FL_content": "\n n=int(input())\n A=list(map(int,input().split()))\n a=[]\n for i in range(n):\n a.append([i+1])\n for j in range(n):\n a[j].append(A[j])\n-sorted(a,key=lambda x:x[1])\n lst=[]\n for i in range(n):\n lst.append(a[i][0])\n-print(lst)\n- \n-\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u507611905", "problem_id": "p03505", "submission1_id": "s357136085-FL", "submission2_id": "s353423691", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nnumbers = [int(i) for i in input().split()]\n\nmax_number = math.pow(10,18)\n\ndiff = numbers[1] - numbers[2]\n\nif numbers[0] > diff * max_number:\n print(\"-1\")\nelse:\n rating = 0\n count = 0\n print(math.ceil(numbers[0] / diff) * 2 - 1)", "code2": "import math\nfrom decimal import *\n\nnumbers = [int(i) for i in input().split()]\n\ndiff = numbers[1] - numbers[2]\n\nif numbers[0] <= numbers[1]:\n print(\"1\")\nelif diff <= 0:\n print(\"-1\")\nelse:\n print(math.ceil(Decimal(numbers[0] - numbers[1]) / diff) * 2 + 1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512519944", "date2": "1512591699", "bleu_score": "0.7457446717396421", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 19, "total_score": 103, "input": "1100100010001000000 1 -2\n", "actual_output": "733400006667333375\n", "expected_output": "733400006667333335\n\n", "anno_code": ["import math\n\nnumbers = [int(i) for i in input().split()] # (0): numbers=[1100100010001000000, 1, -2]\n\nmax_number = math.pow(10,18) # (1): max_number=1e+18\n\ndiff = numbers[1] - numbers[2] # (2): diff=3\n\nif numbers[0] > diff * max_number: # (3): NO CHANGE\n print(\"-1\")\nelse:\n rating = 0 # (4): rating=0\n count = 0 # (5): count=0\n print(math.ceil(numbers[0] / diff) * 2 - 1)"], "anno_status": [true], "diff_content": " import math\n+from decimal import *\n \n numbers = [int(i) for i in input().split()]\n \n-max_number = math.pow(10,18)\n-\n diff = numbers[1] - numbers[2]\n \n-if numbers[0] > diff * max_number:\n+if numbers[0] <= numbers[1]:\n+ print(\"1\")\n+elif diff <= 0:\n print(\"-1\")\n else:\n- rating = 0\n- count = 0\n- print(math.ceil(numbers[0] / diff) * 2 - 1)\n+ print(math.ceil(Decimal(numbers[0] - numbers[1]) / diff) * 2 + 1)\n", "FL_content": "\n import math\n \n numbers = [int(i) for i in input().split()]\n \n-max_number = math.pow(10,18)\n \n diff = numbers[1] - numbers[2]\n \n-if numbers[0] > diff * max_number:\n print(\"-1\")\n else:\n rating = 0\n count = 0\n- print(math.ceil(numbers[0] / diff) * 2 - 1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u922901775", "problem_id": "p02948", "submission1_id": "s638581473-FL", "submission2_id": "s500788709", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nimport heapq\nfrom collections import defaultdict\n\n\ndef solve(N: int, M: int, A: \"List[int]\", B: \"List[int]\"):\n Q = defaultdict(list)\n Q2 = []\n for a, b in zip(A, B):\n heapq.heappush(Q[a], -b)\n \n for a in Q.keys():\n rank = M-a+1\n for i, b in enumerate(Q[a]):\n if i >= rank:\n break\n score = i + a\n Q2.append((b, score))\n Q2.sort()\n\n count = 0\n res = 0\n for b, score in Q2:\n if count >= M:\n break\n if count >= score:\n continue\n res -= b\n count += 1\n print(res)\n return\n\n\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n N = int(next(tokens)) \n M = int(next(tokens)) \n A = [int()] * (N) \n B = [int()] * (N) \n for i in range(N):\n A[i] = int(next(tokens))\n B[i] = int(next(tokens))\n solve(N, M, A, B)\n\nif __name__ == '__main__':\n main()\n", "code2": "\nimport sys\nimport heapq\nfrom collections import defaultdict\n\n\ndef solve(N: int, M: int, A: \"List[int]\", B: \"List[int]\"):\n \n L = [] \n Q = defaultdict(list)\n for a, b in zip(A, B):\n heapq.heappush(Q[a], -b)\n \n res = 0\n for d in range(1, M+1):\n for b in Q[d]:\n heapq.heappush(L, b)\n if len(L) == 0:\n continue\n b = heapq.heappop(L)\n res -= b\n\n print(res)\n\n\n\ndef main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n N = int(next(tokens)) \n M = int(next(tokens)) \n A = [int()] * (N) \n B = [int()] * (N) \n for i in range(N):\n A[i] = int(next(tokens))\n B[i] = int(next(tokens))\n solve(N, M, A, B)\n\nif __name__ == '__main__':\n main()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1565490140", "date2": "1565492005", "bleu_score": "0.7352471547296464", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 102, "input": "5 5\n1 2\n1 0\n1 4\n1 1\n2 5\n", "actual_output": "7\n", "expected_output": "12\n\n", "anno_code": ["\nimport sys\nimport heapq\nfrom collections import defaultdict\n\n\ndef solve(N: int, M: int, A: \"List[int]\", B: \"List[int]\"): # (0): solve=\n Q = defaultdict(list)\n Q2 = []\n for a, b in zip(A, B):\n heapq.heappush(Q[a], -b)\n \n for a in Q.keys():\n rank = M-a+1\n for i, b in enumerate(Q[a]):\n if i >= rank:\n break\n score = i + a\n Q2.append((b, score))\n Q2.sort()\n\n count = 0\n res = 0\n for b, score in Q2:\n if count >= M:\n break\n if count >= score:\n continue\n res -= b\n count += 1\n print(res)\n return\n\n\n\ndef main(): # (1): main=\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n N = int(next(tokens)) \n M = int(next(tokens)) \n A = [int()] * (N) \n B = [int()] * (N) \n for i in range(N):\n A[i] = int(next(tokens))\n B[i] = int(next(tokens))\n solve(N, M, A, B)\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " \n import sys\n import heapq\n from collections import defaultdict\n \n \n def solve(N: int, M: int, A: \"List[int]\", B: \"List[int]\"):\n+ \n+ L = [] \n Q = defaultdict(list)\n- Q2 = []\n for a, b in zip(A, B):\n heapq.heappush(Q[a], -b)\n \n- for a in Q.keys():\n- rank = M-a+1\n- for i, b in enumerate(Q[a]):\n- if i >= rank:\n- break\n- score = i + a\n- Q2.append((b, score))\n- Q2.sort()\n-\n- count = 0\n res = 0\n- for b, score in Q2:\n- if count >= M:\n- break\n- if count >= score:\n+ for d in range(1, M+1):\n+ for b in Q[d]:\n+ heapq.heappush(L, b)\n+ if len(L) == 0:\n continue\n+ b = heapq.heappop(L)\n res -= b\n- count += 1\n+\n print(res)\n- return\n \n \n \n def main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n N = int(next(tokens)) \n M = int(next(tokens)) \n A = [int()] * (N) \n B = [int()] * (N) \n for i in range(N):\n A[i] = int(next(tokens))\n B[i] = int(next(tokens))\n solve(N, M, A, B)\n \n if __name__ == '__main__':\n main()\n \n", "FL_content": "\n \n import sys\n import heapq\n from collections import defaultdict\n \n \n def solve(N: int, M: int, A: \"List[int]\", B: \"List[int]\"):\n Q = defaultdict(list)\n Q2 = []\n for a, b in zip(A, B):\n heapq.heappush(Q[a], -b)\n \n for a in Q.keys():\n rank = M-a+1\n for i, b in enumerate(Q[a]):\n if i >= rank:\n break\n score = i + a\n Q2.append((b, score))\n Q2.sort()\n \n count = 0\n res = 0\n for b, score in Q2:\n if count >= M:\n break\n if count >= score:\n continue\n res -= b\n count += 1\n print(res)\n return\n \n \n \n def main():\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n N = int(next(tokens)) \n M = int(next(tokens)) \n A = [int()] * (N) \n B = [int()] * (N) \n for i in range(N):\n A[i] = int(next(tokens))\n B[i] = int(next(tokens))\n solve(N, M, A, B)\n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 53 }, { "user_id": "u482227082", "problem_id": "p02408", "submission1_id": "s286361635-FL", "submission2_id": "s087075707", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = [0] * 13\nh = [0] * 13\nc = [0] * 13\nd = [0] * 13\n\nnum = int(input())\nfor i in range(num):\n m, n = input().split()\n n = int(n)\n if m == \"s\":\n s[n] = 1\n if m == \"h\":\n h[n] = 1\n if m == \"c\":\n c[n] = 1\n if m == \"d\":\n h[n] = 1\n\nfor i in range(1,13):\n if s[i] == 0:\n print(\"S %d\" % i)\n\nfor i in range(1,13):\n if h[i] == 0:\n print(\"H %d\" % i)\n\nfor i in range(1,13):\n if c[i] == 0:\n print(\"C %d\" % i)\n\nfor i in range(1,13):\n if d[i] == 0:\n print(\"D %d\" % i)\n\n\n\n\n", "code2": "s = [0] * 13\nh = [0] * 13\nc = [0] * 13\nd = [0] * 13\n\nnum = int(input())\nfor i in range(num):\n m, n = input().split()\n x = int(n) - 1\n if m == \"S\":\n s[x] = 1\n elif m == \"H\":\n h[x] = 1\n elif m == \"C\":\n c[x] = 1\n elif m == \"D\":\n d[x] = 1\n else:\n break\n\nfor i in range(13):\n if s[i] == 0:\n print(\"S %d\" % (i+1))\n\nfor i in range(13):\n if h[i] == 0:\n print(\"H %d\" % (i+1))\n\nfor i in range(13):\n if c[i] == 0:\n print(\"C %d\" % (i+1))\n\nfor i in range(13):\n if d[i] == 0:\n print(\"D %d\" % (i+1))\n\n\n\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556432535", "date2": "1556433481", "bleu_score": "0.8418497464411887", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "47\nS 10\nS 11\nS 12\nS 13\nH 1\nH 2\nS 6\nS 7\nS 8\nS 9\nH 6\nH 8\nH 9\nH 10\nH 11\nH 4\nH 5\nS 2\nS 3\nS 4\nS 5\nH 12\nH 13\nC 1\nC 2\nD 1\nD 2\nD 3\nD 8\nD 5\nD 6\nD 7\nC 3\nC 4\nC 5\nC 6\nC 7\nC 8\nC 12\nC 10\nC 11\nC 13\nD 9\nD 10\nD 11\nD 12\nD 13\n", "actual_output": "S 1\nS 2\nS 3\nS 4\nS 5\nS 6\nS 7\nS 8\nS 9\nS 10\nS 11\nS 12\nH 1\nH 2\nH 3\nH 4\nH 5\nH 6\nH 7\nH 8\nH 9\nH 10\nH 11\nH 12\nC 1\nC 2\nC 3\nC 4\nC 5\nC 6\nC 7\nC 8\nC 9\nC 10\nC 11\nC 12\nD 1\nD 2\nD 3\nD 4\nD 5\nD 6\nD 7\nD 8\nD 9\nD 10\nD 11\nD 12\n", "expected_output": "S 1\nH 3\nH 7\nC 9\nD 4\n\n", "anno_code": ["s = [0] * 13 # (0): s=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nh = [0] * 13 # (1): h=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nc = [0] * 13 # (2): c=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nd = [0] * 13 # (3): d=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\nnum = int(input()) # (4): num=47\nfor i in range(num): # (5): i=0 (12): i=1 ... (334): NO CHANGE\n m, n = input().split() # (6): m=S, n=10 (13): n=11 ... (328): n=13\n n = int(n) # (7): n=10 (14): n=11 ... (329): n=13\n if m == \"s\": # (8): NO CHANGE (15): NO CHANGE ... (330): NO CHANGE\n s[n] = 1\n if m == \"h\": # (9): NO CHANGE (16): NO CHANGE ... (331): NO CHANGE\n h[n] = 1\n if m == \"c\": # (10): NO CHANGE (17): NO CHANGE ... (332): NO CHANGE\n c[n] = 1\n if m == \"d\": # (11): NO CHANGE (18): NO CHANGE ... (333): NO CHANGE\n h[n] = 1\n\nfor i in range(1,13): # (335): i=1 (338): i=2 ... (371): NO CHANGE\n if s[i] == 0: # (336): NO CHANGE (339): NO CHANGE ... (369): NO CHANGE\n print(\"S %d\" % i) # (337): NO CHANGE (340): NO CHANGE ... (370): NO CHANGE\n\nfor i in range(1,13): # (372): i=1 (375): i=2 ... (408): NO CHANGE\n if h[i] == 0: # (373): NO CHANGE (376): NO CHANGE ... (406): NO CHANGE\n print(\"H %d\" % i) # (374): NO CHANGE (377): NO CHANGE ... (407): NO CHANGE\n\nfor i in range(1,13): # (409): i=1 (412): i=2 ... (445): NO CHANGE\n if c[i] == 0: # (410): NO CHANGE (413): NO CHANGE ... (443): NO CHANGE\n print(\"C %d\" % i) # (411): NO CHANGE (414): NO CHANGE ... (444): NO CHANGE\n\nfor i in range(1,13): # (446): i=1 (449): i=2 ... (479): i=12\n if d[i] == 0: # (447): NO CHANGE (450): NO CHANGE ... (480): NO CHANGE\n print(\"D %d\" % i) # (448): NO CHANGE (451): NO CHANGE ... (481): NO CHANGE\n\n\n\n\n"], "anno_status": [false], "diff_content": " s = [0] * 13\n h = [0] * 13\n c = [0] * 13\n d = [0] * 13\n \n num = int(input())\n for i in range(num):\n m, n = input().split()\n- n = int(n)\n- if m == \"s\":\n- s[n] = 1\n- if m == \"h\":\n- h[n] = 1\n- if m == \"c\":\n- c[n] = 1\n- if m == \"d\":\n- h[n] = 1\n-\n-for i in range(1,13):\n+ x = int(n) - 1\n+ if m == \"S\":\n+ s[x] = 1\n+ elif m == \"H\":\n+ h[x] = 1\n+ elif m == \"C\":\n+ c[x] = 1\n+ elif m == \"D\":\n+ d[x] = 1\n+ else:\n+ break\n+\n+for i in range(13):\n if s[i] == 0:\n- print(\"S %d\" % i)\n+ print(\"S %d\" % (i+1))\n \n-for i in range(1,13):\n+for i in range(13):\n if h[i] == 0:\n- print(\"H %d\" % i)\n+ print(\"H %d\" % (i+1))\n \n-for i in range(1,13):\n+for i in range(13):\n if c[i] == 0:\n- print(\"C %d\" % i)\n+ print(\"C %d\" % (i+1))\n \n-for i in range(1,13):\n+for i in range(13):\n if d[i] == 0:\n- print(\"D %d\" % i)\n+ print(\"D %d\" % (i+1))\n \n \n \n \n \n", "FL_content": "\n s = [0] * 13\n h = [0] * 13\n c = [0] * 13\n d = [0] * 13\n \n num = int(input())\n for i in range(num):\n m, n = input().split()\n n = int(n)\n if m == \"s\":\n s[n] = 1\n if m == \"h\":\n h[n] = 1\n if m == \"c\":\n c[n] = 1\n if m == \"d\":\n- h[n] = 1\n \n for i in range(1,13):\n if s[i] == 0:\n print(\"S %d\" % i)\n \n for i in range(1,13):\n if h[i] == 0:\n print(\"H %d\" % i)\n \n for i in range(1,13):\n if c[i] == 0:\n print(\"C %d\" % i)\n \n for i in range(1,13):\n if d[i] == 0:\n print(\"D %d\" % i)\n \n \n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 38 }, { "user_id": "u773686010", "problem_id": "p03147", "submission1_id": "s157524928-FL", "submission2_id": "s949218125", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nn=int(input())\nTree_List=list(map(int,input().split()))\n\nct =0\nfor i in range(n):\n while Tree_List[i] != 0:\n \n if i == n-1:\n Tree_List[i] -= 1\n print(Tree_List)\n \n else:\n \n k = i + 1\n while Tree_List[k] != 0: \n k+=1\n if k == n:\n break\n \n \n \n Tree_List[i:k]=map(lambda x:x-1,Tree_List[i:k])\n \n ct += 1\n \n \n \n \n \nprint(ct)", "code2": "\nn=int(input())\nTree_List=list(map(int,input().split()))\n\nct =0\nfor i in range(n):\n while Tree_List[i] != 0:\n \n if i == n-1:\n Tree_List[i] -= 1\n \n else:\n \n k = i + 1\n while Tree_List[k] != 0: \n k+=1\n if k == n:\n break\n Tree_List[i:k]=map(lambda x:x-1,Tree_List[i:k])\n \n ct += 1\n \nprint(ct)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590875974", "date2": "1590876048", "bleu_score": "0.7987405525741004", "code1_test_status": [1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0], "code1_test_score": 33, "total_score": 99, "input": "8\n8 65 136 0 0 108 31 101\n", "actual_output": "[0, 0, 0, 0, 0, 0, 0, 69]\n[0, 0, 0, 0, 0, 0, 0, 68]\n[0, 0, 0, 0, 0, 0, 0, 67]\n[0, 0, 0, 0, 0, 0, 0, 66]\n[0, 0, 0, 0, 0, 0, 0, 65]\n[0, 0, 0, 0, 0, 0, 0, 64]\n[0, 0, 0, 0, 0, 0, 0, 63]\n[0, 0, 0, 0, 0, 0, 0, 62]\n[0, 0, 0, 0, 0, 0, 0, 61]\n[0, 0, 0, 0, 0, 0, 0, 60]\n[0, 0, 0, 0, 0, 0, 0, 59]\n[0, 0, 0, 0, 0, 0, 0, 58]\n[0, 0, 0, 0, 0, 0, 0, 57]\n[0, 0, 0, 0, 0, 0, 0, 56]\n[0, 0, 0, 0, 0, 0, 0, 55]\n[0, 0, 0, 0, 0, 0, 0, 54]\n[0, 0, 0, 0, 0, 0, 0, 53]\n[0, 0, 0, 0, 0, 0, 0, 52]\n[0, 0, 0, 0, 0, 0, 0, 51]\n[0, 0, 0, 0, 0, 0, 0, 50]\n[0, 0, 0, 0, 0, 0, 0, 49]\n[0, 0, 0, 0, 0, 0, 0, 48]\n[0, 0, 0, 0, 0, 0, 0, 47]\n[0, 0, 0, 0, 0, 0, 0, 46]\n[0, 0, 0, 0, 0, 0, 0, 45]\n[0, 0, 0, 0, 0, 0, 0, 44]\n[0, 0, 0, 0, 0, 0, 0, 43]\n[0, 0, 0, 0, 0, 0, 0, 42]\n[0, 0, 0, 0, 0, 0, 0, 41]\n[0, 0, 0, 0, 0, 0, 0, 40]\n[0, 0, 0, 0, 0, 0, 0, 39]\n[0, 0, 0, 0, 0, 0, 0, 38]\n[0, 0, 0, 0, 0, 0, 0, 37]\n[0, 0, 0, 0, 0, 0, 0, 36]\n[0, 0, 0, 0, 0, 0, 0, 35]\n[0, 0, 0, 0, 0, 0, 0, 34]\n[0, 0, 0, 0, 0, 0, 0, 33]\n[0, 0, 0, 0, 0, 0, 0, 32]\n[0, 0, 0, 0, 0, 0, 0, 31]\n[0, 0, 0, 0, 0, 0, 0, 30]\n[0, 0, 0, 0, 0, 0, 0, 29]\n[0, 0, 0, 0, 0, 0, 0, 28]\n[0, 0, 0, 0, 0, 0, 0, 27]\n[0, 0, 0, 0, 0, 0, 0, 26]\n[0, 0, 0, 0, 0, 0, 0, 25]\n[0, 0, 0, 0, 0, 0, 0, 24]\n[0, 0, 0, 0, 0, 0, 0, 23]\n[0, 0, 0, 0, 0, 0, 0, 22]\n[0, 0, 0, 0, 0, 0, 0, 21]\n[0, 0, 0, 0, 0, 0, 0, 20]\n[0, 0, 0, 0, 0, 0, 0, 19]\n[0, 0, 0, 0, 0, 0, 0, 18]\n[0, 0, 0, 0, 0, 0, 0, 17]\n[0, 0, 0, 0, 0, 0, 0, 16]\n[0, 0, 0, 0, 0, 0, 0, 15]\n[0, 0, 0, 0, 0, 0, 0, 14]\n[0, 0, 0, 0, 0, 0, 0, 13]\n[0, 0, 0, 0, 0, 0, 0, 12]\n[0, 0, 0, 0, 0, 0, 0, 11]\n[0, 0, 0, 0, 0, 0, 0, 10]\n[0, 0, 0, 0, 0, 0, 0, 9]\n[0, 0, 0, 0, 0, 0, 0, 8]\n[0, 0, 0, 0, 0, 0, 0, 7]\n[0, 0, 0, 0, 0, 0, 0, 6]\n[0, 0, 0, 0, 0, 0, 0, 5]\n[0, 0, 0, 0, 0, 0, 0, 4]\n[0, 0, 0, 0, 0, 0, 0, 3]\n[0, 0, 0, 0, 0, 0, 0, 2]\n[0, 0, 0, 0, 0, 0, 0, 1]\n[0, 0, 0, 0, 0, 0, 0, 0]\n314\n", "expected_output": "314\n\n", "anno_code": ["\nn=int(input()) # (0): n=8\nTree_List=list(map(int,input().split())) # (1): Tree_List=[8, 65, 136, 0, 0, 108, 31, 101]\n\nct =0 # (2): ct=0\nfor i in range(n): # (3): i=0 (101): i=1 ... (2238): NO CHANGE\n while Tree_List[i] != 0: # (4): NO CHANGE (16): NO CHANGE ... (2237): NO CHANGE\n \n if i == n-1: # (5): NO CHANGE (17): NO CHANGE ... (2233): NO CHANGE\n Tree_List[i] -= 1 # (1889): Tree_List=[0, 0, 0, 0, 0, 0, 0, 69] (1894): Tree_List=[0, 0, 0, 0, 0, 0, 0, 68] ... (2234): Tree_List=[0, 0, 0, 0, 0, 0, 0, 0]\n print(Tree_List) # (1890): NO CHANGE (1895): NO CHANGE ... (2235): NO CHANGE\n \n else:\n \n k = i + 1 # (6): k=1 (18): k=1 ... (1879): NO CHANGE\n while Tree_List[k] != 0: # (7): NO CHANGE (10): NO CHANGE ... (1880): NO CHANGE\n k+=1 # (8): k=2 (11): k=3 ... (1416): k=8\n if k == n: # (9): NO CHANGE (12): NO CHANGE ... (1417): NO CHANGE\n break # (1058): NO CHANGE (1070): NO CHANGE ... (1418): NO CHANGE\n \n \n \n Tree_List[i:k]=map(lambda x:x-1,Tree_List[i:k]) # (14): Tree_List=[7, 64, 135, 0, 0, 108, 31, 101] (26): Tree_List=[6, 63, 134, 0, 0, 108, 31, 101] ... (1881): Tree_List=[0, 0, 0, 0, 0, 0, 0, 70]\n \n ct += 1 # (15): ct=1 (27): ct=2 ... (2236): ct=314\n \n \n \n \n \nprint(ct)"], "anno_status": [false], "diff_content": " \n n=int(input())\n Tree_List=list(map(int,input().split()))\n \n ct =0\n for i in range(n):\n while Tree_List[i] != 0:\n \n if i == n-1:\n Tree_List[i] -= 1\n- print(Tree_List)\n \n else:\n \n k = i + 1\n while Tree_List[k] != 0: \n k+=1\n if k == n:\n break\n- \n- \n- \n Tree_List[i:k]=map(lambda x:x-1,Tree_List[i:k])\n \n ct += 1\n \n- \n- \n- \n- \n print(ct)\n", "FL_content": "\n \n n=int(input())\n Tree_List=list(map(int,input().split()))\n \n ct =0\n for i in range(n):\n while Tree_List[i] != 0:\n \n if i == n-1:\n Tree_List[i] -= 1\n- print(Tree_List)\n \n else:\n \n k = i + 1\n while Tree_List[k] != 0: \n k+=1\n if k == n:\n break\n \n \n \n Tree_List[i:k]=map(lambda x:x-1,Tree_List[i:k])\n \n ct += 1\n \n \n \n \n \n print(ct)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 31 }, { "user_id": "u780962115", "problem_id": "p04000", "submission1_id": "s753303242-FL", "submission2_id": "s796166305", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nh,w,n=map(int,input().split())\ndic={}\nfor _ in range(n):\n a,b=map(int,input().split())\n for i in range(a-1,a+2):\n for j in range(b-1,b+2):\n if (i,j) in dic.keys():\n dic[(i,j)]+=1\n else:\n dic[(i,j)]=1\n \nhowmany=[0 for i in range(10)]\nfor some in dic.keys():\n a,b=some[0],some[1]\n if 2<=a<=h-1 and 2<=b<=w-1:\n howmany[dic[some]]+=1\nfor i in range(10):\n print(howmany[i])", "code2": "\nh,w,n=map(int,input().split())\ndic={}\nfor _ in range(n):\n a,b=map(int,input().split())\n for i in range(a-1,a+2):\n for j in range(b-1,b+2):\n if (i,j) in dic.keys():\n dic[(i,j)]+=1\n else:\n dic[(i,j)]=1\n \nhowmany=[0 for i in range(10)]\nfor some in dic.keys():\n a,b=some[0],some[1]\n if 2<=a<=h-1 and 2<=b<=w-1:\n howmany[dic[some]]+=1\nJ=(h-2)*(w-2)-sum(howmany)\nprint(J)\nfor i in range(1,10):\n print(howmany[i])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583040606", "date2": "1583040926", "bleu_score": "0.919228313446399", "code1_test_status": [0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 10, "total_score": 103, "input": "10 10 20\n0 1\n1 4\n1 9\n2 5\n3 6\n4 2\n1 7\n5 9\n6 4\n6 6\n6 7\n2 2\n7 3\n7 8\n16 1\n8 5\n8 10\n9 4\n10 4\n4 9\n", "actual_output": "0\n21\n27\n12\n0\n0\n0\n0\n0\n0\n", "expected_output": "4\n21\n27\n12\n0\n0\n0\n0\n0\n0\n\n", "anno_code": ["\nh,w,n=map(int,input().split()) # (0): h=10, w=10, n=20\ndic={} # (1): dic={}\nfor _ in range(n): # (2): _=0 (38): _=1 ... (722): NO CHANGE\n a,b=map(int,input().split()) # (3): a=0, b=1 (39): a=1, b=4 ... (687): a=4, b=9\n for i in range(a-1,a+2): # (4): i=-1 (15): i=0 ... (721): NO CHANGE\n for j in range(b-1,b+2): # (5): j=0 (8): j=1 ... (720): NO CHANGE\n if (i,j) in dic.keys(): # (6): NO CHANGE (9): NO CHANGE ... (718): NO CHANGE\n dic[(i,j)]+=1 # (115): dic={(-1, 0): 1, (-1, 1): 1, (-1, 2): 1, (0, 0): 1, (0, 1): 1, (0, 2): 1, (1, 0): 1, (1, 1): 1, (1, 2): 1, (0, 3): 1, (0, 4): 1, (0, 5): 1, (1, 3): 1, (1, 4): 2, (1, 5): 1, (2, 3): 1, (2, 4): 1, (2, 5): 1, (0, 8): 1, (0, 9): 1, (0, 10): 1, (1, 8): 1, (1, 9): 1, (1, 10): 1, (2, 8): 1, (2, 9): 1, (2, 10): 1} (118): dic={(-1, 0): 1, (-1, 1): 1, (-1, 2): 1, (0, 0): 1, (0, 1): 1, (0, 2): 1, (1, 0): 1, (1, 1): 1, (1, 2): 1, (0, 3): 1, (0, 4): 1, (0, 5): 1, (1, 3): 1, (1, 4): 2, (1, 5): 2, (2, 3): 1, (2, 4): 1, (2, 5): 1, (0, 8): 1, (0, 9): 1, (0, 10): 1, (1, 8): 1, (1, 9): 1, (1, 10): 1, (2, 8): 1, (2, 9): 1, (2, 10): 1} ... (719): dic={(-1, 0): 1, (-1, 1): 1, (-1, 2): 1, (0, 0): 1, (0, 1): 1, (0, 2): 1, (1, 0): 1, (1, 1): 2, (1, 2): 2, (0, 3): 1, (0, 4): 1, (0, 5): 1, (1, 3): 2, (1, 4): 2, (1, 5): 2, (2, 3): 2, (2, 4): 2, (2, 5): 3, (0, 8): 2, (0, 9): 1, (0, 10): 1, (1, 8): 2, (1, 9): 1, (1, 10): 1, (2, 8): 2, (2, 9): 1, (2, 10): 1, (1, 6): 2, (2, 6): 3, (3, 4): 1, (3, 5): 2, (3, 6): 2, (2, 7): 2, (3, 7): 1, (4, 5): 1, (4, 6): 1, (4, 7): 1, (3, 1): 2, (3, 2): 2, (3, 3): 2, (4, 1): 1, (4, 2): 1, (4, 3): 1, (5, 1): 1, (5, 2): 1, (5, 3): 2, (0, 6): 1, (0, 7): 1, (1, 7): 1, (4, 8): 2, (4, 9): 2, (4, 10): 2, (5, 8): 3, (5, 9): 2, (5, 10): 2, (6, 8): 3, (6, 9): 2, (6, 10): 1, (5, 4): 1, (5, 5): 2, (6, 3): 2, (6, 4): 2, (6, 5): 2, (7, 3): 2, (7, 4): 3, (7, 5): 3, (5, 6): 2, (5, 7): 2, (6, 6): 2, (6, 7): 3, (7, 6): 3, (7, 7): 3, (7, 8): 2, (2, 1): 1, (2, 2): 1, (6, 2): 1, (7, 2): 1, (8, 2): 1, (8, 3): 2, (8, 4): 3, (7, 9): 2, (8, 7): 1, (8, 8): 1, (8, 9): 2, (15, 0): 1, (15, 1): 1, (15, 2): 1, (16, 0): 1, (16, 1): 1, (16, 2): 1, (17, 0): 1, (17, 1): 1, (17, 2): 1, (8, 5): 2, (8, 6): 1, (9, 4): 3, (9, 5): 3, (9, 6): 1, (7, 10): 1, (7, 11): 1, (8, 10): 1, (8, 11): 1, (9, 9): 1, (9, 10): 1, (9, 11): 1, (9, 3): 2, (10, 3): 2, (10, 4): 2, (10, 5): 2, (11, 3): 1, (11, 4): 1, (11, 5): 1, (3, 8): 1, (3, 9): 1, (3, 10): 1}\n else:\n dic[(i,j)]=1 # (7): dic={(-1, 0): 1} (10): dic={(-1, 0): 1, (-1, 1): 1} ... (697): dic={(-1, 0): 1, (-1, 1): 1, (-1, 2): 1, (0, 0): 1, (0, 1): 1, (0, 2): 1, (1, 0): 1, (1, 1): 2, (1, 2): 2, (0, 3): 1, (0, 4): 1, (0, 5): 1, (1, 3): 2, (1, 4): 2, (1, 5): 2, (2, 3): 2, (2, 4): 2, (2, 5): 3, (0, 8): 2, (0, 9): 1, (0, 10): 1, (1, 8): 2, (1, 9): 1, (1, 10): 1, (2, 8): 2, (2, 9): 1, (2, 10): 1, (1, 6): 2, (2, 6): 3, (3, 4): 1, (3, 5): 2, (3, 6): 2, (2, 7): 2, (3, 7): 1, (4, 5): 1, (4, 6): 1, (4, 7): 1, (3, 1): 2, (3, 2): 2, (3, 3): 2, (4, 1): 1, (4, 2): 1, (4, 3): 1, (5, 1): 1, (5, 2): 1, (5, 3): 2, (0, 6): 1, (0, 7): 1, (1, 7): 1, (4, 8): 1, (4, 9): 1, (4, 10): 1, (5, 8): 2, (5, 9): 1, (5, 10): 1, (6, 8): 3, (6, 9): 2, (6, 10): 1, (5, 4): 1, (5, 5): 2, (6, 3): 2, (6, 4): 2, (6, 5): 2, (7, 3): 2, (7, 4): 3, (7, 5): 3, (5, 6): 2, (5, 7): 2, (6, 6): 2, (6, 7): 3, (7, 6): 3, (7, 7): 3, (7, 8): 2, (2, 1): 1, (2, 2): 1, (6, 2): 1, (7, 2): 1, (8, 2): 1, (8, 3): 2, (8, 4): 3, (7, 9): 2, (8, 7): 1, (8, 8): 1, (8, 9): 2, (15, 0): 1, (15, 1): 1, (15, 2): 1, (16, 0): 1, (16, 1): 1, (16, 2): 1, (17, 0): 1, (17, 1): 1, (17, 2): 1, (8, 5): 2, (8, 6): 1, (9, 4): 3, (9, 5): 3, (9, 6): 1, (7, 10): 1, (7, 11): 1, (8, 10): 1, (8, 11): 1, (9, 9): 1, (9, 10): 1, (9, 11): 1, (9, 3): 2, (10, 3): 2, (10, 4): 2, (10, 5): 2, (11, 3): 1, (11, 4): 1, (11, 5): 1, (3, 8): 1, (3, 9): 1, (3, 10): 1}\n \nhowmany=[0 for i in range(10)] # (723): howmany=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor some in dic.keys(): # (724): some=(-1, 0) (727): some=(-1, 1) ... (1129): NO CHANGE\n a,b=some[0],some[1] # (725): a=-1, b=0 (728): b=1 ... (1127): b=10\n if 2<=a<=h-1 and 2<=b<=w-1: # (726): NO CHANGE (729): NO CHANGE ... (1128): NO CHANGE\n howmany[dic[some]]+=1 # (772): howmany=[0, 0, 1, 0, 0, 0, 0, 0, 0, 0] (776): howmany=[0, 0, 2, 0, 0, 0, 0, 0, 0, 0] ... (1125): howmany=[0, 21, 27, 12, 0, 0, 0, 0, 0, 0]\nfor i in range(10): # (1130): i=0 (1132): i=1 ... (1148): i=9\n print(howmany[i]) # (1131): NO CHANGE (1133): NO CHANGE ... (1149): NO CHANGE\n"], "anno_status": [false], "diff_content": " \n h,w,n=map(int,input().split())\n dic={}\n for _ in range(n):\n a,b=map(int,input().split())\n for i in range(a-1,a+2):\n for j in range(b-1,b+2):\n if (i,j) in dic.keys():\n dic[(i,j)]+=1\n else:\n dic[(i,j)]=1\n \n howmany=[0 for i in range(10)]\n for some in dic.keys():\n a,b=some[0],some[1]\n if 2<=a<=h-1 and 2<=b<=w-1:\n howmany[dic[some]]+=1\n-for i in range(10):\n+J=(h-2)*(w-2)-sum(howmany)\n+print(J)\n+for i in range(1,10):\n print(howmany[i])\n+\n", "FL_content": "\n \n h,w,n=map(int,input().split())\n dic={}\n for _ in range(n):\n a,b=map(int,input().split())\n for i in range(a-1,a+2):\n for j in range(b-1,b+2):\n if (i,j) in dic.keys():\n dic[(i,j)]+=1\n else:\n dic[(i,j)]=1\n \n howmany=[0 for i in range(10)]\n for some in dic.keys():\n a,b=some[0],some[1]\n- if 2<=a<=h-1 and 2<=b<=w-1:\n howmany[dic[some]]+=1\n for i in range(10):\n print(howmany[i])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u252828980", "problem_id": "p02536", "submission1_id": "s918476426-FL", "submission2_id": "s552872716", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m = map(int,input().split())\n\nclass Unionfind:\n \n def __init__(self,n):\n self.uf = [-1]*n\n \n def find(self,x):\n if self.uf[x] < 0:\n return x\n else:\n self.uf[x] = self.find(self.uf[x])\n return self.uf[x]\n \n def same(self,x,y):\n return self.find(x) == self.find(y)\n \n def union(self,x,y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return False\n if self.uf[x] > self.uf[y]:\n x,y = y,x\n self.uf[x] += self.uf[y]\n self.uf[y] = x\n return True\n \n def size(self,x):\n x = self.find(x)\n return -self.uf[x]\n\nd = Unionfind(n)\n\nfor i in range(m):\n a,b = map(int,input().split())\n d.union(a-1,b-1)\n \nL = []\nfor i in range(n):\n c = d.size(i)\n L.append(c)\nprint(len(set(L))-1)", "code2": "n,m = map(int,input().split())\n\nclass Unionfind:\n \n def __init__(self,n):\n self.uf = [-1]*n\n \n def find(self,x):\n if self.uf[x] < 0:\n return x\n else:\n self.uf[x] = self.find(self.uf[x])\n return self.uf[x]\n \n def same(self,x,y):\n return self.find(x) == self.find(y)\n \n def union(self,x,y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return False\n if self.uf[x] > self.uf[y]:\n x,y = y,x\n self.uf[x] += self.uf[y]\n self.uf[y] = x\n return True\n \n def size(self,x):\n x = self.find(x)\n return -self.uf[x]\n\nd = Unionfind(n)\n\nfor i in range(m):\n a,b = map(int,input().split())\n d.union(a-1,b-1)\n \nL = []\nfor i in range(n):\n c = d.find(i)\n L.append(c)\n\nprint(len(set(L))-1)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1601219336", "date2": "1601219799", "bleu_score": "0.9917431301829578", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 90, "input": "3 1\n3 3\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["n,m = map(int,input().split()) # (0): n=3, m=1\n\nclass Unionfind: # (1): Unionfind=\n \n def __init__(self,n):\n self.uf = [-1]*n # (3): m=1, Unionfind=, d=\n \n def find(self,x):\n if self.uf[x] < 0: # (8): y=2 (10): y=2 ... (27): n=3, m=1, Unionfind=, d=, i=2, a=3, b=3, L=[1, 1], c=1\n return x\n else:\n self.uf[x] = self.find(self.uf[x])\n return self.uf[x]\n \n def same(self,x,y):\n return self.find(x) == self.find(y)\n \n def union(self,x,y):\n x = self.find(x) # (7): NO CHANGE\n y = self.find(y) # (9): NO CHANGE\n if x == y: # (11): n=3, m=1, Unionfind=, d=, i=0, a=3, b=3\n return False\n if self.uf[x] > self.uf[y]:\n x,y = y,x\n self.uf[x] += self.uf[y]\n self.uf[y] = x\n return True\n \n def size(self,x):\n x = self.find(x) # (16): NO CHANGE (21): NO CHANGE (26): NO CHANGE\n return -self.uf[x]\n\nd = Unionfind(n) # (2): self=\n\nfor i in range(m): # (4): i=0 (12): NO CHANGE\n a,b = map(int,input().split()) # (5): a=3, b=3\n d.union(a-1,b-1) # (6): self=, x=2, y=2\n \nL = [] # (13): L=[]\nfor i in range(n): # (14): NO CHANGE (19): i=1 ... (29): NO CHANGE\n c = d.size(i) # (15): self=, x=0 (20): self=, x=1 (25): self=, x=2\n L.append(c) # (18): L=[1] (23): L=[1, 1] (28): L=[1, 1, 1]\nprint(len(set(L))-1)"], "anno_status": [true], "diff_content": " n,m = map(int,input().split())\n \n class Unionfind:\n \n def __init__(self,n):\n self.uf = [-1]*n\n \n def find(self,x):\n if self.uf[x] < 0:\n return x\n else:\n self.uf[x] = self.find(self.uf[x])\n return self.uf[x]\n \n def same(self,x,y):\n return self.find(x) == self.find(y)\n \n def union(self,x,y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return False\n if self.uf[x] > self.uf[y]:\n x,y = y,x\n self.uf[x] += self.uf[y]\n self.uf[y] = x\n return True\n \n def size(self,x):\n x = self.find(x)\n return -self.uf[x]\n \n d = Unionfind(n)\n \n for i in range(m):\n a,b = map(int,input().split())\n d.union(a-1,b-1)\n \n L = []\n for i in range(n):\n- c = d.size(i)\n+ c = d.find(i)\n L.append(c)\n+\n print(len(set(L))-1)\n", "FL_content": "\n n,m = map(int,input().split())\n \n class Unionfind:\n \n def __init__(self,n):\n self.uf = [-1]*n\n \n def find(self,x):\n if self.uf[x] < 0:\n return x\n else:\n self.uf[x] = self.find(self.uf[x])\n return self.uf[x]\n \n def same(self,x,y):\n return self.find(x) == self.find(y)\n \n def union(self,x,y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return False\n if self.uf[x] > self.uf[y]:\n x,y = y,x\n self.uf[x] += self.uf[y]\n self.uf[y] = x\n return True\n \n def size(self,x):\n x = self.find(x)\n return -self.uf[x]\n \n d = Unionfind(n)\n \n for i in range(m):\n a,b = map(int,input().split())\n d.union(a-1,b-1)\n \n L = []\n-for i in range(n):\n c = d.size(i)\n L.append(c)\n print(len(set(L))-1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 43 }, { "user_id": "u241159583", "problem_id": "p03556", "submission1_id": "s677067282-FL", "submission2_id": "s379956855", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nN = int(input())\nn = math.sqrt(N)\nprint(round(n)**2)", "code2": "import math\nN = int(input())\nn = math.sqrt(N)\nprint(math.floor(n)**2)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577469849", "date2": "1577470039", "bleu_score": "0.8360199227843976", "code1_test_status": [0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 45, "total_score": 83, "input": "115087508\n", "actual_output": "115089984\n", "expected_output": "115068529\n\n", "anno_code": ["import math\nN = int(input()) # (0): N=115087508\nn = math.sqrt(N) # (1): n=10727.8846\nprint(round(n)**2)"], "anno_status": [true], "diff_content": " import math\n N = int(input())\n n = math.sqrt(N)\n-print(round(n)**2)\n+print(math.floor(n)**2)\n", "FL_content": "\n import math\n N = int(input())\n-n = math.sqrt(N)\n-print(round(n)**2)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 4 }, { "user_id": "u341926204", "problem_id": "p03730", "submission1_id": "s234306838-FL", "submission2_id": "s046268974", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def b():\n a, b, c = map(int, input().split())\n i = 2\n while i <= c:\n if a*i % b == c:\n print('YES')\n break\n i += 1\n else: print('NO')\n\nb()", "code2": "def b():\n a, b, c = map(int, input().split())\n for i in range(2, 200):\n if a*i % b == c:\n print('YES')\n break\n else: print('NO')\n\nb()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1493519092", "date2": "1493519216", "bleu_score": "0.8060929289298935", "code1_test_status": [1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1], "code1_test_score": 37, "total_score": 92, "input": "38 13 0\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["def b(): # (0): b=\n a, b, c = map(int, input().split()) # (2): a=38, b=13, c=0\n i = 2 # (3): i=2\n while i <= c: # (4): NO CHANGE\n if a*i % b == c:\n print('YES')\n break\n i += 1\n else: print('NO')\n\nb() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " def b():\n a, b, c = map(int, input().split())\n- i = 2\n- while i <= c:\n+ for i in range(2, 200):\n if a*i % b == c:\n print('YES')\n break\n- i += 1\n else: print('NO')\n \n b()\n", "FL_content": "\n def b():\n a, b, c = map(int, input().split())\n- i = 2\n- while i <= c:\n- if a*i % b == c:\n print('YES')\n break\n i += 1\n else: print('NO')\n \n b()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u471400255", "problem_id": "p00613", "submission1_id": "s164691992-FL", "submission2_id": "s955218501", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n K = int(input())\n if K == 0:\n break\n else:\n po = [int(i) for i in input().split()]\n print(sum(po)/(K-1))", "code2": "while True:\n K = int(input())\n if K == 0:\n break\n elif K == 1:\n print(int(input()))\n else:\n po = [int(i) for i in input().split()]\n print(int(sum(po)/(K-1)))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1513676351", "date2": "1513677665", "bleu_score": "0.7442357219301391", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "2\n2\n2\n2 21 1\n0\n", "actual_output": "2.0\n24.0\n", "expected_output": "2\n24\n\n", "anno_code": ["while True: # (0): NO CHANGE (5): NO CHANGE (10): NO CHANGE\n K = int(input()) # (1): K=2 (6): NO CHANGE (11): K=0\n if K == 0: # (2): NO CHANGE (7): NO CHANGE (12): NO CHANGE\n break\n else:\n po = [int(i) for i in input().split()] # (3): po=[2] (8): po=[2, 21, 1]\n print(sum(po)/(K-1)) # (4): NO CHANGE (9): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n K = int(input())\n if K == 0:\n break\n+ elif K == 1:\n+ print(int(input()))\n else:\n po = [int(i) for i in input().split()]\n- print(sum(po)/(K-1))\n+ print(int(sum(po)/(K-1)))\n", "FL_content": "\n while True:\n K = int(input())\n if K == 0:\n break\n else:\n po = [int(i) for i in input().split()]\n- print(sum(po)/(K-1))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u686036872", "problem_id": "p02549", "submission1_id": "s291847586-FL", "submission2_id": "s990556771", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int, input().split())\n\nDP = [0]*(N+1)\nDP[1] = 1\n\nS = []\nfor i in range(K):\n S.append(list(map(int, input().split())))\n\nfor i in range(2, N+1):\n for l, r in S:\n DP[i] += (DP[max(i-r, 0)] - DP[max(i-l-1, 0)])%998244353\n DP[i] += DP[i-1]\n\nprint(DP[N]%998244353)", "code2": "N, K = map(int, input().split())\n\nDP = [0]*(N+1)\nDP[1] = 1\n\nS = []\nfor i in range(K):\n S.append(list(map(int, input().split())))\n\nfor i in range(2, N+1):\n for l, r in S:\n DP[i] += (DP[max(i-l, 0)] - DP[max(i-r-1, 0)])\n DP[i] += DP[i-1]\n DP[i] %= 998244353\n\nprint((DP[N] - DP[N-1])%998244353)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600641180", "date2": "1600641388", "bleu_score": "0.8948800284708603", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "50 3\n5 4\n1 3\n1 20\n", "actual_output": "829714759\n", "expected_output": "465231607\n\n", "anno_code": ["N, K = map(int, input().split()) # (0): N=50, K=3\n\nDP = [0]*(N+1) # (1): DP=[0, 0, ..., 0, 0]\nDP[1] = 1 # (2): DP=[0, 1, ..., 0, 0]\n\nS = [] # (3): S=[]\nfor i in range(K): # (4): i=0 (6): i=1 ... (10): NO CHANGE\n S.append(list(map(int, input().split()))) # (5): S=[[5, 4]] (7): S (9): S\n\nfor i in range(2, N+1): # (11): NO CHANGE (20): i=3 ... (452): NO CHANGE\n for l, r in S: # (12): l=5, r=4 (14): l=1, r=3 ... (450): NO CHANGE\n DP[i] += (DP[max(i-r, 0)] - DP[max(i-l-1, 0)])%998244353 # (13): NO CHANGE (15): NO CHANGE ... (449): DP=[0, 1, ..., 69187196078, 521379038]\n DP[i] += DP[i-1] # (19): DP=[0, 1, ..., 0, 0] (28): DP=[0, 1, ..., 0, 0] ... (451): DP=[0, 1, ..., 69187196078, 69708575116]\n\nprint(DP[N]%998244353)"], "anno_status": [true], "diff_content": " N, K = map(int, input().split())\n \n DP = [0]*(N+1)\n DP[1] = 1\n \n S = []\n for i in range(K):\n S.append(list(map(int, input().split())))\n \n for i in range(2, N+1):\n for l, r in S:\n- DP[i] += (DP[max(i-r, 0)] - DP[max(i-l-1, 0)])%998244353\n+ DP[i] += (DP[max(i-l, 0)] - DP[max(i-r-1, 0)])\n DP[i] += DP[i-1]\n+ DP[i] %= 998244353\n \n-print(DP[N]%998244353)\n+print((DP[N] - DP[N-1])%998244353)\n", "FL_content": "\n N, K = map(int, input().split())\n \n DP = [0]*(N+1)\n DP[1] = 1\n \n S = []\n for i in range(K):\n S.append(list(map(int, input().split())))\n \n for i in range(2, N+1):\n for l, r in S:\n- DP[i] += (DP[max(i-r, 0)] - DP[max(i-l-1, 0)])%998244353\n DP[i] += DP[i-1]\n \n print(DP[N]%998244353)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u244493040", "problem_id": "p02401", "submission1_id": "s816769603-FL", "submission2_id": "s340905709", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,o,b = input().split()\na,b = map(int,(a,b))\nprint(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a/b)\n", "code2": "while 1:\n a,o,b = input().split()\n if o=='?': break\n a,b = map(int,(a,b))\n print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1523639419", "date2": "1523639695", "bleu_score": "0.7363173272308701", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "1 + 2\n56 - 18\n21 * 4\n100 / 10\n1 , 81\n-1 ? -1\n", "actual_output": "3\n", "expected_output": "3\n38\n84\n10\n(1, 81)\n\n", "anno_code": ["a,o,b = input().split() # (0): a=1, o=+, b=2\na,b = map(int,(a,b)) # (1): a=1, b=2\nprint(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a/b)\n"], "anno_status": [true], "diff_content": "-a,o,b = input().split()\n-a,b = map(int,(a,b))\n-print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a/b)\n+while 1:\n+ a,o,b = input().split()\n+ if o=='?': break\n+ a,b = map(int,(a,b))\n+ print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a\n \n", "FL_content": "\n a,o,b = input().split()\n a,b = map(int,(a,b))\n-print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a/b)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 4 }, { "user_id": "u091051505", "problem_id": "p04000", "submission1_id": "s736188501-FL", "submission2_id": "s972124129", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter, defaultdict\n\nans = defaultdict(lambda: 0)\nh, w, n = map(int, input().split())\nfor _ in range(n):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n for a_i in range(a - 2, a + 1):\n for b_i in range(b - 2, b + 1):\n if (0 <= a_i < h - 2) & (0 <= b_i < w - 2):\n ans[(a_i, b_i)] += 1\n\nk = Counter(ans.values())\nfor i in range(10):\n if i in k.keys():\n print(k[i])\n else:\n print(0)", "code2": "from collections import Counter, defaultdict\n\nans = defaultdict(lambda: 0)\nh, w, n = map(int, input().split())\nfor _ in range(n):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n for a_i in range(a - 2, a + 1):\n for b_i in range(b - 2, b + 1):\n if (0 <= a_i < h - 2) & (0 <= b_i < w - 2):\n ans[(a_i, b_i)] += 1\n\nk = Counter(ans.values())\nprint((h - 2) * (w - 2) - sum(k.values()))\nfor i in range(1, 10):\n if i in k.keys():\n print(k[i])\n else:\n print(0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567562050", "date2": "1567562289", "bleu_score": "0.9096563845467414", "code1_test_status": [0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 10, "total_score": 103, "input": "10 10 20\n0 1\n1 4\n1 9\n2 4\n0 6\n4 1\n1 7\n5 9\n6 4\n6 6\n6 5\n2 1\n10 3\n7 8\n16 1\n8 5\n11 10\n9 5\n17 4\n4 4\n", "actual_output": "0\n23\n21\n5\n2\n0\n0\n0\n0\n0\n", "expected_output": "13\n23\n21\n5\n2\n0\n0\n0\n0\n0\n\n", "anno_code": ["from collections import Counter, defaultdict\n\nans = defaultdict(lambda: 0) # (0): ans=defaultdict( at 0x000001CBFB185BD0>, {})\nh, w, n = map(int, input().split()) # (1): h=10, w=10, n=20\nfor _ in range(n): # (2): _=0 (31): _=1 ... (670): NO CHANGE\n a, b = map(int, input().split()) # (3): a=0, b=1 (32): a=1, b=4 ... (633): a=4, b=4\n a -= 1 # (4): a=-1 (33): a=0 ... (634): a=3\n b -= 1 # (5): b=0 (34): b=3 ... (635): b=3\n for a_i in range(a - 2, a + 1): # (6): a_i=-3 (14): a_i=-2 ... (669): NO CHANGE\n for b_i in range(b - 2, b + 1): # (7): b_i=-2 (9): b_i=-1 ... (668): NO CHANGE\n if (0 <= a_i < h - 2) & (0 <= b_i < w - 2): # (8): NO CHANGE (10): NO CHANGE ... (666): NO CHANGE\n ans[(a_i, b_i)] += 1 # (54): ans=defaultdict( at 0x000001CBFB185BD0>, {(0, 1): 1}) (57): ans=defaultdict( at 0x000001CBFB185BD0>, {(0, 1): 1, (0, 2): 1}) ... (667): ans=defaultdict( at 0x000001CBFB185BD0>, {(0, 1): 2, (0, 2): 2, (0, 3): 2, (0, 6): 2, (0, 7): 1, (1, 1): 2, (1, 2): 2, (1, 3): 2, (1, 0): 2, (2, 0): 1, (3, 0): 1, (0, 4): 1, (0, 5): 1, (2, 6): 1, (2, 7): 1, (3, 6): 1, (3, 7): 1, (4, 6): 2, (4, 7): 2, (3, 1): 2, (3, 2): 3, (3, 3): 4, (4, 1): 1, (4, 2): 2, (4, 3): 3, (5, 1): 1, (5, 2): 3, (5, 3): 4, (3, 4): 2, (3, 5): 1, (4, 4): 2, (4, 5): 2, (5, 4): 3, (5, 5): 2, (0, 0): 1, (7, 0): 1, (7, 1): 1, (7, 2): 3, (5, 6): 1, (5, 7): 1, (6, 5): 1, (6, 6): 1, (6, 7): 1, (6, 2): 2, (6, 3): 2, (6, 4): 2, (7, 3): 2, (7, 4): 2, (2, 1): 1, (2, 2): 1, (2, 3): 1})\n\nk = Counter(ans.values()) # (671): k=Counter({1: 23, 2: 21, 3: 5, 4: 2})\nfor i in range(10): # (672): i=0 (675): i=1 ... (699): i=9\n if i in k.keys(): # (673): NO CHANGE (676): NO CHANGE ... (700): NO CHANGE\n print(k[i]) # (677): NO CHANGE (680): NO CHANGE ... (686): NO CHANGE\n else:\n print(0) # (674): NO CHANGE (689): NO CHANGE ... (701): NO CHANGE\n"], "anno_status": [false], "diff_content": " from collections import Counter, defaultdict\n \n ans = defaultdict(lambda: 0)\n h, w, n = map(int, input().split())\n for _ in range(n):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n for a_i in range(a - 2, a + 1):\n for b_i in range(b - 2, b + 1):\n if (0 <= a_i < h - 2) & (0 <= b_i < w - 2):\n ans[(a_i, b_i)] += 1\n \n k = Counter(ans.values())\n-for i in range(10):\n+print((h - 2) * (w - 2) - sum(k.values()))\n+for i in range(1, 10):\n if i in k.keys():\n print(k[i])\n else:\n print(0)\n", "FL_content": "\n from collections import Counter, defaultdict\n \n ans = defaultdict(lambda: 0)\n h, w, n = map(int, input().split())\n for _ in range(n):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n for a_i in range(a - 2, a + 1):\n for b_i in range(b - 2, b + 1):\n- if (0 <= a_i < h - 2) & (0 <= b_i < w - 2):\n ans[(a_i, b_i)] += 1\n \n k = Counter(ans.values())\n for i in range(10):\n if i in k.keys():\n print(k[i])\n else:\n print(0)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u691896522", "problem_id": "p03838", "submission1_id": "s648831731-FL", "submission2_id": "s242155799", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y = map(int, input().split())\n\n\n\nabs_cost = 0\nif x == y:\n print(0)\n exit()\nif y >= 0 and x >= 0:\n if y > x:\n print(y - x)\n else:\n print(abs(x) - abs(y) + 2)\nelif y < 0 and x >= 0:\n if abs(y) > abs(x):\n print(abs(y) - x + 1)\n else:\n print(x - abs(y) + 1)\nelif y >= 0 and x < 0:\n print(y - abs(x) + 1)\nelse:\n if y > x:\n print(y - x)\n else:\n print(abs(y) - abs(x) + 2)\n\n\n", "code2": "\nx, y = map(int, input().split())\n\n\n\nif x == 0:\n if y >= 0:\n print(y)\n else:\n print(abs(y) + 1)\n exit()\nelif y == 0:\n if x >= 0:\n print(1 + abs(x))\n else:\n print(abs(x))\n exit()\nif y > 0 and x > 0:\n if y >= x:\n print(y - x)\n else:\n print(abs(x) - abs(y) + 2)\nelif y < 0 and x > 0:\n if abs(y) > abs(x):\n print(abs(y) - x + 1)\n else:\n print(x - abs(y) + 1)\nelif y > 0 and x < 0:\n if abs(x) < abs(y):\n print(y - abs(x) + 1)\n else:\n print(abs(x) - y + 1)\nelse:\n if y >= x:\n print(y - x)\n else:\n print(abs(y) - abs(x) + 2)\n\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1583979510", "date2": "1583980961", "bleu_score": "0.6541190582533486", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 68, "total_score": 90, "input": "370 0\n", "actual_output": "372\n", "expected_output": "371\n\n", "anno_code": ["x, y = map(int, input().split()) # (0): x=370, y=0\n\n\n\nabs_cost = 0 # (1): abs_cost=0\nif x == y: # (2): NO CHANGE\n print(0)\n exit()\nif y >= 0 and x >= 0: # (3): NO CHANGE\n if y > x: # (4): NO CHANGE\n print(y - x)\n else:\n print(abs(x) - abs(y) + 2)\nelif y < 0 and x >= 0:\n if abs(y) > abs(x):\n print(abs(y) - x + 1)\n else:\n print(x - abs(y) + 1)\nelif y >= 0 and x < 0:\n print(y - abs(x) + 1)\nelse:\n if y > x:\n print(y - x)\n else:\n print(abs(y) - abs(x) + 2)\n\n\n"], "anno_status": [true], "diff_content": "+\n x, y = map(int, input().split())\n \n \n \n-abs_cost = 0\n-if x == y:\n- print(0)\n+if x == 0:\n+ if y >= 0:\n+ print(y)\n+ else:\n+ print(abs(y) + 1)\n exit()\n-if y >= 0 and x >= 0:\n- if y > x:\n+elif y == 0:\n+ if x >= 0:\n+ print(1 + abs(x))\n+ else:\n+ print(abs(x))\n+ exit()\n+if y > 0 and x > 0:\n+ if y >= x:\n print(y - x)\n else:\n print(abs(x) - abs(y) + 2)\n-elif y < 0 and x >= 0:\n+elif y < 0 and x > 0:\n if abs(y) > abs(x):\n print(abs(y) - x + 1)\n else:\n print(x - abs(y) + 1)\n-elif y >= 0 and x < 0:\n- print(y - abs(x) + 1)\n+elif y > 0 and x < 0:\n+ if abs(x) < abs(y):\n+ print(y - abs(x) + 1)\n+ else:\n+ print(abs(x) - y + 1)\n else:\n- if y > x:\n+ if y >= x:\n print(y - x)\n else:\n print(abs(y) - abs(x) + 2)\n \n \n \n", "FL_content": "\n x, y = map(int, input().split())\n \n \n \n abs_cost = 0\n if x == y:\n print(0)\n exit()\n if y >= 0 and x >= 0:\n if y > x:\n print(y - x)\n else:\n print(abs(x) - abs(y) + 2)\n elif y < 0 and x >= 0:\n if abs(y) > abs(x):\n print(abs(y) - x + 1)\n else:\n print(x - abs(y) + 1)\n elif y >= 0 and x < 0:\n print(y - abs(x) + 1)\n else:\n if y > x:\n print(y - x)\n else:\n- print(abs(y) - abs(x) + 2)\n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 28 }, { "user_id": "u354918239", "problem_id": "p03456", "submission1_id": "s732128146-FL", "submission2_id": "s824700840", "status1": "Wrong Answer", "status2": "Accepted", "code1": "L = []\na,b = map(str,input().split())\nL.append(a)\nL.append(b)\nc = int(L[0]+L[1])\nK = []\nfor i in range(1,101) :\n k = i**2\n K.append(k)\nif c in K :\n print(\"Yes\")\nelse :\n print(\"No\")\n \n", "code2": "L = []\na,b = map(str,input().split())\nL.append(a)\nL.append(b)\nc = int(L[0]+L[1])\nK = []\nif int(c**(1/2))**2 == c :\n print(\"Yes\")\nelse :\n print(\"No\")\n\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1533302168", "date2": "1533302673", "bleu_score": "0.7093824065505426", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 90, "total_score": 91, "input": "000 000\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["L = [] # (0): L=[]\na,b = map(str,input().split()) # (1): a=000, b=000\nL.append(a) # (2): L=['000']\nL.append(b) # (3): L=['000', '000']\nc = int(L[0]+L[1]) # (4): c=0\nK = [] # (5): K=[]\nfor i in range(1,101) : # (6): i=1 (9): i=2 ... (306): NO CHANGE\n k = i**2 # (7): k=1 (10): k=4 ... (304): k=10000\n K.append(k) # (8): K=[1] (11): K=[1, 4] ... (305): K=[1, 4, ..., 9801, 10000]\nif c in K : # (307): NO CHANGE\n print(\"Yes\")\nelse :\n print(\"No\")\n \n"], "anno_status": [true], "diff_content": " L = []\n a,b = map(str,input().split())\n L.append(a)\n L.append(b)\n c = int(L[0]+L[1])\n K = []\n-for i in range(1,101) :\n- k = i**2\n- K.append(k)\n-if c in K :\n+if int(c**(1/2))**2 == c :\n print(\"Yes\")\n else :\n print(\"No\")\n- \n \n+ \n", "FL_content": "\n L = []\n a,b = map(str,input().split())\n L.append(a)\n L.append(b)\n c = int(L[0]+L[1])\n K = []\n-for i in range(1,101) :\n k = i**2\n K.append(k)\n if c in K :\n print(\"Yes\")\n else :\n print(\"No\")\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u757117214", "problem_id": "p03031", "submission1_id": "s385693430-FL", "submission2_id": "s820225434", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M=map(int,input().split())\nlights=[]\nfor i in range(M):\n k,*s=map(int,input().split())\n lights.append(list(map(lambda x:x-1,s)))\nP=list(map(int,input().split()))\ncnt=0\nfor b in range(1<>switch)&2:\n on_cnt+=1\n if on_cnt==0 or on_cnt%2 != P[m]:\n flg=False\n if flg:\n cnt+=1\nprint(cnt) ", "code2": "N,M=map(int,input().split())\nlights=[]\nfor i in range(M):\n k,*s=map(int,input().split())\n lights.append(list(map(lambda x:x-1,s)))\nP=list(map(int,input().split()))\ncnt=0\nfor b in range(1<>switch)&1:\n on_cnt+=1\n \n if on_cnt%2 != P[m]:\n flg=False\n if flg:\n cnt+=1\n \nprint(cnt) ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580691048", "date2": "1580691602", "bleu_score": "0.9455124091173454", "code1_test_status": [0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0], "code1_test_score": 92, "total_score": 103, "input": "2 2\n2 1 2\n1 2\n0 1\n", "actual_output": "0\n", "expected_output": "1\n", "anno_code": ["N,M=map(int,input().split()) # (0): N=2, M=2\nlights=[] # (1): lights=[]\nfor i in range(M): # (2): i=0 (5): i=1 (8): lights\n k,*s=map(int,input().split()) # (3): k=2, s=[1, 2] (6): k=1, s=[2]\n lights.append(list(map(lambda x:x-1,s))) # (4): lights (7): lights\nP=list(map(int,input().split())) # (9): lights, P=[0, 1]\ncnt=0 # (10): lights, cnt=0\nfor b in range(1<>switch)&2: # (16): lights (18): lights ... (87): lights\n on_cnt+=1 # (57): lights, on_cnt=1 (78): lights, on_cnt=1\n if on_cnt==0 or on_cnt%2 != P[m]: # (20): lights (27): lights ... (89): lights\n flg=False # (21): lights, flg=False (28): lights ... (90): lights\n if flg: # (30): lights (50): lights ... (92): lights\n cnt+=1\nprint(cnt) "], "anno_status": [true], "diff_content": " N,M=map(int,input().split())\n lights=[]\n for i in range(M):\n k,*s=map(int,input().split())\n lights.append(list(map(lambda x:x-1,s)))\n P=list(map(int,input().split()))\n cnt=0\n for b in range(1<>switch)&2:\n+ if (b>>switch)&1:\n on_cnt+=1\n- if on_cnt==0 or on_cnt%2 != P[m]:\n+ \n+ if on_cnt%2 != P[m]:\n flg=False\n if flg:\n cnt+=1\n+ \n print(cnt) \n", "FL_content": "\n N,M=map(int,input().split())\n lights=[]\n for i in range(M):\n k,*s=map(int,input().split())\n lights.append(list(map(lambda x:x-1,s)))\n P=list(map(int,input().split()))\n cnt=0\n for b in range(1<>switch)&2:\n on_cnt+=1\n if on_cnt==0 or on_cnt%2 != P[m]:\n flg=False\n if flg:\n cnt+=1\n print(cnt) \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u504562455", "problem_id": "p02616", "submission1_id": "s379811765-FL", "submission2_id": "s544270411", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\n\nN, K = [int(_) for _ in input().split()]\nA = [int(_) for _ in input().split()]\nMOD = 10 ** 9 + 7\nA_p = []\nA_n = []\nfor a in A:\n if a >= 0:\n A_p.append(a)\n else:\n A_n.append(-a)\n\nA_p.sort(reverse=True)\nA_n.sort(reverse=True)\nA_p = deque(A_p)\nA_n = deque(A_n)\n\np_top = 0\nn_top = 0\nans_p = deque([])\nans_n = deque([])\nfor i in range(K):\n if len(A_p) == 0:\n ans_n.append(A_n.popleft())\n elif len(A_n) == 0:\n ans_p.append(A_p.popleft())\n elif A_p[0] >= A_n[0]:\n ans_p.append(A_p.popleft())\n else:\n ans_n.append(A_n.popleft())\nif 0 in ans_p:\n ans = 0\nelif len(ans_n) % 2 == 1:\n if len(ans_p) == 0 and len(A_p) > 0:\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_n) == 0 and len(A_n) > 0:\n ans_p.pop()\n ans_n.append(A_n.popleft())\n elif len(ans_p) > 0 and len(ans_n) > 0 and len(A_p) > 0 and len(A_n) > 0 and ans_p[-1] * A_p[0] >= ans_n[-1] * A_n[0]:\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_p) > 0 and len(A_n) > 0:\n ans_p.pop()\n ans_n.append(A_n.popleft())\nans = 1\nfor a in ans_p:\n ans = (a * ans) % MOD\nfor a in ans_n:\n ans = (-a * ans) % MOD\nif ans != 0 and len(ans_n) % 2 == 1:\n ans = 1\n A_abs = [abs(a) for a in A]\n A_abs.sort()\n for i in range(K):\n ans = (ans * A_abs[i]) % MOD\n ans = (-ans) % MOD\nprint(ans)\n\n\n", "code2": "from collections import deque\n\nN, K = [int(_) for _ in input().split()]\nA = [int(_) for _ in input().split()]\nMOD = 10 ** 9 + 7\nA_p = []\nA_n = []\nfor a in A:\n if a >= 0:\n A_p.append(a)\n else:\n A_n.append(-a)\n\nA_p.sort(reverse=True)\nA_n.sort(reverse=True)\nA_p = deque(A_p)\nA_n = deque(A_n)\n\np_top = 0\nn_top = 0\nans_p = deque([])\nans_n = deque([])\nfor i in range(K):\n if len(A_p) == 0:\n ans_n.append(A_n.popleft())\n elif len(A_n) == 0:\n ans_p.append(A_p.popleft())\n elif A_p[0] >= A_n[0]:\n ans_p.append(A_p.popleft())\n else:\n ans_n.append(A_n.popleft())\nif len(ans_n) % 2 == 1:\n if len(ans_p) == 0 and len(A_p) > 0:\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_n) == 0 and len(A_n) > 0:\n ans_p.pop()\n ans_n.append(A_n.popleft())\n elif len(ans_p) > 0 and len(ans_n) > 0 and len(A_p) > 0 and len(A_n) > 0 and ans_p[-1] * A_p[0] >= ans_n[-1] * A_n[0]:\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_p) > 0 and len(A_n) > 0:\n ans_p.pop()\n ans_n.append(A_n.popleft())\n elif len(ans_n) > 0 and len(A_p) > 0:\n ans_n.pop()\n ans_p.append(A_p.popleft())\nans = 1\nfor a in ans_p:\n ans = (a * ans) % MOD\nfor a in ans_n:\n ans = (-a * ans) % MOD\nif ans != 0 and len(ans_n) % 2 == 1:\n ans = 1\n A_abs = [abs(a) for a in A]\n A_abs.sort()\n for i in range(K):\n ans = (ans * A_abs[i]) % MOD\n ans = (-ans) % MOD\nprint(ans)\n\n\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593988952", "date2": "1593989357", "bleu_score": "0.9481308215606573", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 103, "total_score": 104, "input": "4 2\n1 2 -3 0\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["from collections import deque\n\nN, K = [int(_) for _ in input().split()] # (0): N=4, K=2\nA = [int(_) for _ in input().split()] # (1): A=[1, 2, -3, 0]\nMOD = 10 ** 9 + 7 # (2): MOD=1000000007\nA_p = [] # (3): A_p=[]\nA_n = [] # (4): A_n=[]\nfor a in A: # (5): a=1 (8): a=2 ... (17): NO CHANGE\n if a >= 0: # (6): NO CHANGE (9): NO CHANGE ... (15): NO CHANGE\n A_p.append(a) # (7): A_p=[1] (10): A_p=[1, 2] (16): A_p=[1, 2, 0]\n else:\n A_n.append(-a) # (13): A_n=[3]\n\nA_p.sort(reverse=True) # (18): A_p=[2, 1, 0]\nA_n.sort(reverse=True) # (19): NO CHANGE\nA_p = deque(A_p) # (20): NO CHANGE\nA_n = deque(A_n) # (21): NO CHANGE\n\np_top = 0 # (22): p_top=0\nn_top = 0 # (23): n_top=0\nans_p = deque([]) # (24): ans_p=deque([2])\nans_n = deque([]) # (25): ans_n=deque([3])\nfor i in range(K): # (26): i=0 (31): i=1 (35): NO CHANGE\n if len(A_p) == 0: # (27): NO CHANGE (32): NO CHANGE\n ans_n.append(A_n.popleft())\n elif len(A_n) == 0: # (28): NO CHANGE (33): NO CHANGE\n ans_p.append(A_p.popleft()) # (34): NO CHANGE\n elif A_p[0] >= A_n[0]: # (29): NO CHANGE\n ans_p.append(A_p.popleft())\n else:\n ans_n.append(A_n.popleft()) # (30): NO CHANGE\nif 0 in ans_p: # (36): NO CHANGE\n ans = 0\nelif len(ans_n) % 2 == 1: # (37): NO CHANGE\n if len(ans_p) == 0 and len(A_p) > 0: # (38): NO CHANGE\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_n) == 0 and len(A_n) > 0: # (39): NO CHANGE\n ans_p.pop()\n ans_n.append(A_n.popleft())\n elif len(ans_p) > 0 and len(ans_n) > 0 and len(A_p) > 0 and len(A_n) > 0 and ans_p[-1] * A_p[0] >= ans_n[-1] * A_n[0]: # (40): NO CHANGE\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_p) > 0 and len(A_n) > 0: # (41): NO CHANGE\n ans_p.pop()\n ans_n.append(A_n.popleft())\nans = 1 # (42): ans=1\nfor a in ans_p: # (43): a=2 (45): NO CHANGE\n ans = (a * ans) % MOD # (44): ans=2\nfor a in ans_n: # (46): a=3 (48): NO CHANGE\n ans = (-a * ans) % MOD # (47): ans=1000000001\nif ans != 0 and len(ans_n) % 2 == 1: # (49): NO CHANGE\n ans = 1 # (50): ans=1\n A_abs = [abs(a) for a in A] # (51): A_abs=[1, 2, 3, 0]\n A_abs.sort() # (52): A_abs=[0, 1, 2, 3]\n for i in range(K): # (53): i=0 (55): i=1 (57): NO CHANGE\n ans = (ans * A_abs[i]) % MOD # (54): ans=0 (56): NO CHANGE\n ans = (-ans) % MOD # (58): NO CHANGE\nprint(ans)\n\n\n"], "anno_status": [false], "diff_content": " from collections import deque\n \n N, K = [int(_) for _ in input().split()]\n A = [int(_) for _ in input().split()]\n MOD = 10 ** 9 + 7\n A_p = []\n A_n = []\n for a in A:\n if a >= 0:\n A_p.append(a)\n else:\n A_n.append(-a)\n \n A_p.sort(reverse=True)\n A_n.sort(reverse=True)\n A_p = deque(A_p)\n A_n = deque(A_n)\n \n p_top = 0\n n_top = 0\n ans_p = deque([])\n ans_n = deque([])\n for i in range(K):\n if len(A_p) == 0:\n ans_n.append(A_n.popleft())\n elif len(A_n) == 0:\n ans_p.append(A_p.popleft())\n elif A_p[0] >= A_n[0]:\n ans_p.append(A_p.popleft())\n else:\n ans_n.append(A_n.popleft())\n-if 0 in ans_p:\n- ans = 0\n-elif len(ans_n) % 2 == 1:\n+if len(ans_n) % 2 == 1:\n if len(ans_p) == 0 and len(A_p) > 0:\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_n) == 0 and len(A_n) > 0:\n ans_p.pop()\n ans_n.append(A_n.popleft())\n elif len(ans_p) > 0 and len(ans_n) > 0 and len(A_p) > 0 and len(A_n) > 0 and ans_p[-1] * A_p[0] >= ans_n[-1] * A_n[0]:\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_p) > 0 and len(A_n) > 0:\n ans_p.pop()\n ans_n.append(A_n.popleft())\n+ elif len(ans_n) > 0 and len(A_p) > 0:\n+ ans_n.pop()\n+ ans_p.append(A_p.popleft())\n ans = 1\n for a in ans_p:\n ans = (a * ans) % MOD\n for a in ans_n:\n ans = (-a * ans) % MOD\n if ans != 0 and len(ans_n) % 2 == 1:\n ans = 1\n A_abs = [abs(a) for a in A]\n A_abs.sort()\n for i in range(K):\n ans = (ans * A_abs[i]) % MOD\n ans = (-ans) % MOD\n print(ans)\n \n \n \n", "FL_content": "\n from collections import deque\n \n N, K = [int(_) for _ in input().split()]\n A = [int(_) for _ in input().split()]\n MOD = 10 ** 9 + 7\n A_p = []\n A_n = []\n for a in A:\n if a >= 0:\n A_p.append(a)\n else:\n A_n.append(-a)\n \n A_p.sort(reverse=True)\n A_n.sort(reverse=True)\n A_p = deque(A_p)\n A_n = deque(A_n)\n \n p_top = 0\n n_top = 0\n ans_p = deque([])\n ans_n = deque([])\n for i in range(K):\n if len(A_p) == 0:\n ans_n.append(A_n.popleft())\n elif len(A_n) == 0:\n ans_p.append(A_p.popleft())\n elif A_p[0] >= A_n[0]:\n ans_p.append(A_p.popleft())\n else:\n ans_n.append(A_n.popleft())\n ans = 0\n if 0 in ans_p:\n ans = 0\n elif len(ans_n) % 2 == 1:\n if len(ans_p) == 0 and len(A_p) > 0:\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_n) == 0 and len(A_n) > 0:\n ans_p.pop()\n ans_n.append(A_n.popleft())\n elif len(ans_p) > 0 and len(ans_n) > 0 and len(A_p) > 0 and len(A_n) > 0 and ans_p[-1] * A_p[0] >= ans_n[-1] * A_n[0]:\n ans_n.pop()\n ans_p.append(A_p.popleft())\n elif len(ans_p) > 0 and len(A_n) > 0:\n ans_p.pop()\n ans_n.append(A_n.popleft())\n ans = 1\n for a in ans_p:\n ans = (a * ans) % MOD\n for a in ans_n:\n ans = (-a * ans) % MOD\n if ans != 0 and len(ans_n) % 2 == 1:\n ans = 1\n A_abs = [abs(a) for a in A]\n A_abs.sort()\n for i in range(K):\n ans = (ans * A_abs[i]) % MOD\n ans = (-ans) % MOD\n print(ans)\n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 62 }, { "user_id": "u226155577", "problem_id": "p03558", "submission1_id": "s068607107-FL", "submission2_id": "s100959080", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\nK = int(input())\ndist = {1: 1}\n\ndeq = deque([1])\nwhile deq:\n v = deq.popleft()\n \n w = (10 * v) % K\n if w not in dist:\n dist[w] = dist[v]\n deq.appendleft(w)\n \n w = (v + 1) % K\n if w not in dist:\n dist[w] = dist[v] + 1\n deq.append(w)\nprint(dist[0])\n", "code2": "from collections import deque\nK = int(input())\ndist = {1: 1}\n\ndeq = deque([1])\nwhile deq:\n v = deq.popleft()\n \n w = (10 * v) % K\n if dist[v] < dist.get(w, 10**9):\n dist[w] = dist[v]\n deq.appendleft(w)\n \n w = (v + 1) % K\n if dist[v] + 1 < dist.get(w, 10**9):\n dist[w] = dist[v] + 1\n deq.append(w)\nprint(dist[0])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1517620817", "date2": "1517620985", "bleu_score": "0.8499566458762361", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 18, "total_score": 22, "input": "551\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["from collections import deque\nK = int(input()) # (0): K=551\ndist = {1: 1} # (1): dist={1: 1}\n\ndeq = deque([1]) # (2): deq=deque([])\nwhile deq: # (3): NO CHANGE (13): NO CHANGE ... (4409): NO CHANGE\n v = deq.popleft() # (4): v=1 (14): v=10 ... (4404): v=537\n \n w = (10 * v) % K # (5): w=10 (15): w=100 ... (4405): w=411\n if w not in dist: # (6): NO CHANGE (16): NO CHANGE ... (4406): NO CHANGE\n dist[w] = dist[v] # (7): dist={1: 1, 10: 1} (17): dist={1: 1, 10: 1, 2: 2, 100: 1} ... (4285): dist={1: 1, 10: 1, 2: 2, 100: 1, 11: 2, 449: 1, 101: 2, 82: 1, 450: 2, 269: 1, 83: 2, 486: 1, 270: 2, 452: 1, 487: 2, 112: 1, 453: 2, 18: 1, 113: 2, 180: 1, 19: 2, 147: 1, 181: 2, 368: 1, 148: 2, 374: 1, 369: 2, 434: 1, 375: 2, 483: 1, 435: 2, 422: 1, 484: 2, 363: 1, 423: 2, 324: 1, 364: 2, 485: 1, 325: 2, 442: 1, 12: 1, 443: 2, 120: 1, 13: 2, 98: 1, 121: 2, 429: 1, 99: 2, 433: 1, 430: 2, 473: 1, 322: 1, 474: 2, 465: 1, 323: 2, 242: 1, 466: 2, 216: 1, 243: 2, 507: 1, 217: 2, 111: 1, 508: 2, 8: 1, 80: 1, 9: 2, 249: 1, 81: 2, 286: 1, 250: 2, 105: 1, 287: 2, 499: 1, 106: 2, 31: 1, 500: 2, 310: 1, 32: 2, 345: 1, 311: 2, 144: 1, 346: 2, 338: 1, 145: 2, 74: 1, 339: 2, 189: 1, 75: 2, 237: 1, 190: 2, 166: 1, 238: 2, 7: 1, 167: 2, 70: 1, 149: 1, 71: 2, 388: 1, 150: 2, 23: 1, 389: 2, 230: 1, 24: 2, 96: 1, 231: 2, 409: 1, 97: 2, 233: 1, 410: 2, 126: 1, 234: 2, 158: 1, 127: 2, 478: 1, 159: 2, 372: 1, 479: 2, 414: 1, 373: 2, 283: 1, 415: 2, 284: 2, 20: 2, 3: 3, 200: 2, 21: 3, 347: 2, 201: 3, 164: 2, 348: 3, 538: 2, 165: 3, 421: 2, 539: 3, 353: 2, 224: 2, 354: 3, 36: 2, 225: 3, 360: 2, 37: 3, 294: 2, 361: 3, 185: 2, 295: 3, 197: 2, 186: 3, 317: 2, 198: 3, 318: 3, 110: 2, 549: 2, 531: 2, 550: 3, 351: 2, 532: 3, 204: 2, 352: 3, 387: 2, 205: 3, 459: 2, 102: 3, 182: 2, 460: 3, 183: 3, 92: 2, 451: 3, 93: 3, 279: 2, 84: 3, 35: 2, 280: 3, 350: 2, 194: 2, 195: 3, 496: 2, 271: 3, 497: 3, 462: 2, 488: 3, 212: 2, 463: 3, 467: 2, 213: 3, 262: 2, 468: 3, 416: 2, 263: 3, 303: 2, 417: 3, 275: 2, 304: 3, 546: 2, 276: 3, 501: 2, 547: 3, 51: 2, 502: 3, 510: 2, 52: 3, 141: 2, 511: 3, 308: 2, 142: 3, 309: 3, 122: 2, 454: 3, 118: 2, 123: 3, 78: 2, 119: 3, 229: 2, 79: 3, 86: 2, 87: 3, 28: 2, 114: 3, 29: 3, 157: 2, 378: 2, 379: 3, 384: 2, 370: 3, 534: 2, 385: 3, 381: 2, 535: 3, 504: 2, 382: 3, 505: 3, 444: 2, 376: 3, 445: 3, 493: 2, 436: 3, 522: 2, 494: 3, 261: 2, 523: 3, 406: 2, 203: 2, 407: 3, 377: 2, 464: 2, 232: 2, 116: 2, 58: 2, 117: 3, 59: 3, 432: 2, 424: 3, 334: 2, 365: 3, 34: 2, 335: 3, 340: 2, 94: 2, 341: 3, 95: 3, 495: 2, 326: 3, 542: 2, 461: 2, 543: 3, 202: 2, 367: 2, 22: 2, 220: 2, 221: 3, 130: 2, 14: 3, 131: 3, 108: 2, 529: 2, 109: 3, 331: 2, 530: 3, 4: 2, 332: 3, 40: 2, 5: 3, 400: 2, 41: 3, 143: 2, 401: 3, 328: 2, 525: 2, 329: 3, 291: 2, 526: 3, 155: 2, 292: 3, 448: 2, 156: 3, 72: 2, 169: 2, 73: 3, 170: 3, 439: 2, 533: 2, 440: 3, 371: 2, 404: 2, 405: 3, 431: 3, 475: 3, 252: 2, 316: 2, 253: 3, 226: 2, 244: 3, 56: 2, 227: 3, 57: 3, 517: 2, 218: 3, 211: 2, 518: 3, 457: 2, 162: 2, 458: 3, 163: 3, 509: 3, 90: 2, 349: 2, 91: 3, 184: 2, 187: 2, 188: 3, 259: 2, 386: 2, 260: 3, 296: 2, 251: 3, 297: 3, 115: 2, 288: 3, 48: 2, 480: 2, 49: 3, 392: 2, 481: 3, 63: 2, 393: 3, 64: 3, 107: 3, 320: 2, 33: 3, 321: 3, 355: 2, 312: 3, 356: 3, 154: 2, 438: 2, 146: 3, 199: 2, 76: 3, 337: 2, 247: 2, 191: 3, 266: 2, 248: 3, 456: 2, 267: 3, 152: 2, 418: 2, 153: 3, 419: 3, 176: 2, 239: 3, 177: 3, 17: 2, 168: 3, 398: 2, 151: 3, 399: 3, 390: 3, 240: 2, 25: 3, 196: 2, 241: 3, 307: 2, 315: 2, 395: 2, 396: 3, 411: 3, 136: 2, 235: 3, 258: 2, 137: 3, 128: 3, 160: 3, 293: 2, 175: 2, 85: 2, 285: 3, 299: 2, 300: 3, 30: 3, 210: 3, 447: 3, 62: 3, 69: 3, 139: 3, 140: 4, 357: 3, 264: 3, 358: 4, 265: 4, 174: 3, 548: 3, 521: 3, 540: 4, 46: 3, 47: 4, 38: 4, 362: 4, 207: 3, 208: 4, 327: 3, 515: 3, 516: 4, 425: 3, 319: 4, 426: 4, 541: 3, 0: 4, 214: 3, 215: 4, 397: 3, 206: 4, 469: 3, 103: 4, 282: 3, 470: 4, 65: 3, 66: 4, 192: 3, 193: 4, 289: 3, 135: 3, 290: 4, 45: 3, 281: 4, 506: 3, 272: 4, 498: 4, 472: 3, 489: 4, 222: 3, 16: 3, 223: 4, 477: 3, 313: 3, 314: 4, 305: 4, 277: 4, 61: 3, 503: 4, 520: 3, 53: 4, 512: 4, 132: 3, 455: 4, 133: 4, 124: 4, 88: 3, 89: 4, 380: 4, 394: 3, 544: 3, 545: 4, 391: 3, 536: 4, 514: 3, 383: 4, 42: 3, 446: 4, 420: 3, 43: 4, 343: 3, 344: 4, 437: 4, 524: 4, 408: 4, 68: 3, 129: 3, 39: 3, 60: 4, 366: 4, 44: 3, 336: 4, 104: 3, 342: 4, 471: 3, 302: 3, 6: 3, 15: 4, 333: 4, 50: 3, 402: 4, 330: 4, 301: 3, 527: 4, 255: 3, 256: 4, 179: 3, 171: 4, 441: 4, 476: 4, 254: 4, 236: 3, 245: 4, 228: 4, 219: 4, 519: 4, 172: 3, 67: 3, 173: 4, 528: 3, 359: 3, 306: 3, 298: 4, 125: 3, 490: 3, 492: 3, 491: 4, 482: 4, 209: 3, 77: 4, 257: 3, 268: 4, 428: 3, 178: 4, 27: 3, 26: 4, 412: 4, 138: 4, 161: 4, 274: 4, 427: 4, 413: 4, 273: 4, 403: 4, 55: 4, 278: 5, 54: 5, 513: 5, 134: 5, 537: 5, 246: 4}\n deq.appendleft(w) # (8): NO CHANGE (18): NO CHANGE ... (4286): NO CHANGE\n \n w = (v + 1) % K # (9): w=2 (19): w=11 ... (4407): w=538\n if w not in dist: # (10): NO CHANGE (20): NO CHANGE ... (4408): NO CHANGE\n dist[w] = dist[v] + 1 # (11): dist={1: 1, 10: 1, 2: 2} (21): dist={1: 1, 10: 1, 2: 2, 100: 1, 11: 2} ... (4153): dist={1: 1, 10: 1, 2: 2, 100: 1, 11: 2, 449: 1, 101: 2, 82: 1, 450: 2, 269: 1, 83: 2, 486: 1, 270: 2, 452: 1, 487: 2, 112: 1, 453: 2, 18: 1, 113: 2, 180: 1, 19: 2, 147: 1, 181: 2, 368: 1, 148: 2, 374: 1, 369: 2, 434: 1, 375: 2, 483: 1, 435: 2, 422: 1, 484: 2, 363: 1, 423: 2, 324: 1, 364: 2, 485: 1, 325: 2, 442: 1, 12: 1, 443: 2, 120: 1, 13: 2, 98: 1, 121: 2, 429: 1, 99: 2, 433: 1, 430: 2, 473: 1, 322: 1, 474: 2, 465: 1, 323: 2, 242: 1, 466: 2, 216: 1, 243: 2, 507: 1, 217: 2, 111: 1, 508: 2, 8: 1, 80: 1, 9: 2, 249: 1, 81: 2, 286: 1, 250: 2, 105: 1, 287: 2, 499: 1, 106: 2, 31: 1, 500: 2, 310: 1, 32: 2, 345: 1, 311: 2, 144: 1, 346: 2, 338: 1, 145: 2, 74: 1, 339: 2, 189: 1, 75: 2, 237: 1, 190: 2, 166: 1, 238: 2, 7: 1, 167: 2, 70: 1, 149: 1, 71: 2, 388: 1, 150: 2, 23: 1, 389: 2, 230: 1, 24: 2, 96: 1, 231: 2, 409: 1, 97: 2, 233: 1, 410: 2, 126: 1, 234: 2, 158: 1, 127: 2, 478: 1, 159: 2, 372: 1, 479: 2, 414: 1, 373: 2, 283: 1, 415: 2, 284: 2, 20: 2, 3: 3, 200: 2, 21: 3, 347: 2, 201: 3, 164: 2, 348: 3, 538: 2, 165: 3, 421: 2, 539: 3, 353: 2, 224: 2, 354: 3, 36: 2, 225: 3, 360: 2, 37: 3, 294: 2, 361: 3, 185: 2, 295: 3, 197: 2, 186: 3, 317: 2, 198: 3, 318: 3, 110: 2, 549: 2, 531: 2, 550: 3, 351: 2, 532: 3, 204: 2, 352: 3, 387: 2, 205: 3, 459: 2, 102: 3, 182: 2, 460: 3, 183: 3, 92: 2, 451: 3, 93: 3, 279: 2, 84: 3, 35: 2, 280: 3, 350: 2, 194: 2, 195: 3, 496: 2, 271: 3, 497: 3, 462: 2, 488: 3, 212: 2, 463: 3, 467: 2, 213: 3, 262: 2, 468: 3, 416: 2, 263: 3, 303: 2, 417: 3, 275: 2, 304: 3, 546: 2, 276: 3, 501: 2, 547: 3, 51: 2, 502: 3, 510: 2, 52: 3, 141: 2, 511: 3, 308: 2, 142: 3, 309: 3, 122: 2, 454: 3, 118: 2, 123: 3, 78: 2, 119: 3, 229: 2, 79: 3, 86: 2, 87: 3, 28: 2, 114: 3, 29: 3, 157: 2, 378: 2, 379: 3, 384: 2, 370: 3, 534: 2, 385: 3, 381: 2, 535: 3, 504: 2, 382: 3, 505: 3, 444: 2, 376: 3, 445: 3, 493: 2, 436: 3, 522: 2, 494: 3, 261: 2, 523: 3, 406: 2, 203: 2, 407: 3, 377: 2, 464: 2, 232: 2, 116: 2, 58: 2, 117: 3, 59: 3, 432: 2, 424: 3, 334: 2, 365: 3, 34: 2, 335: 3, 340: 2, 94: 2, 341: 3, 95: 3, 495: 2, 326: 3, 542: 2, 461: 2, 543: 3, 202: 2, 367: 2, 22: 2, 220: 2, 221: 3, 130: 2, 14: 3, 131: 3, 108: 2, 529: 2, 109: 3, 331: 2, 530: 3, 4: 2, 332: 3, 40: 2, 5: 3, 400: 2, 41: 3, 143: 2, 401: 3, 328: 2, 525: 2, 329: 3, 291: 2, 526: 3, 155: 2, 292: 3, 448: 2, 156: 3, 72: 2, 169: 2, 73: 3, 170: 3, 439: 2, 533: 2, 440: 3, 371: 2, 404: 2, 405: 3, 431: 3, 475: 3, 252: 2, 316: 2, 253: 3, 226: 2, 244: 3, 56: 2, 227: 3, 57: 3, 517: 2, 218: 3, 211: 2, 518: 3, 457: 2, 162: 2, 458: 3, 163: 3, 509: 3, 90: 2, 349: 2, 91: 3, 184: 2, 187: 2, 188: 3, 259: 2, 386: 2, 260: 3, 296: 2, 251: 3, 297: 3, 115: 2, 288: 3, 48: 2, 480: 2, 49: 3, 392: 2, 481: 3, 63: 2, 393: 3, 64: 3, 107: 3, 320: 2, 33: 3, 321: 3, 355: 2, 312: 3, 356: 3, 154: 2, 438: 2, 146: 3, 199: 2, 76: 3, 337: 2, 247: 2, 191: 3, 266: 2, 248: 3, 456: 2, 267: 3, 152: 2, 418: 2, 153: 3, 419: 3, 176: 2, 239: 3, 177: 3, 17: 2, 168: 3, 398: 2, 151: 3, 399: 3, 390: 3, 240: 2, 25: 3, 196: 2, 241: 3, 307: 2, 315: 2, 395: 2, 396: 3, 411: 3, 136: 2, 235: 3, 258: 2, 137: 3, 128: 3, 160: 3, 293: 2, 175: 2, 85: 2, 285: 3, 299: 2, 300: 3, 30: 3, 210: 3, 447: 3, 62: 3, 69: 3, 139: 3, 140: 4, 357: 3, 264: 3, 358: 4, 265: 4, 174: 3, 548: 3, 521: 3, 540: 4, 46: 3, 47: 4, 38: 4, 362: 4, 207: 3, 208: 4, 327: 3, 515: 3, 516: 4, 425: 3, 319: 4, 426: 4, 541: 3, 0: 4, 214: 3, 215: 4, 397: 3, 206: 4, 469: 3, 103: 4, 282: 3, 470: 4, 65: 3, 66: 4, 192: 3, 193: 4, 289: 3, 135: 3, 290: 4, 45: 3, 281: 4, 506: 3, 272: 4, 498: 4, 472: 3, 489: 4, 222: 3, 16: 3, 223: 4, 477: 3, 313: 3, 314: 4, 305: 4, 277: 4, 61: 3, 503: 4, 520: 3, 53: 4, 512: 4, 132: 3, 455: 4, 133: 4, 124: 4, 88: 3, 89: 4, 380: 4, 394: 3, 544: 3, 545: 4, 391: 3, 536: 4, 514: 3, 383: 4, 42: 3, 446: 4, 420: 3, 43: 4, 343: 3, 344: 4, 437: 4, 524: 4, 408: 4, 68: 3, 129: 3, 39: 3, 60: 4, 366: 4, 44: 3, 336: 4, 104: 3, 342: 4, 471: 3, 302: 3, 6: 3, 15: 4, 333: 4, 50: 3, 402: 4, 330: 4, 301: 3, 527: 4, 255: 3, 256: 4, 179: 3, 171: 4, 441: 4, 476: 4, 254: 4, 236: 3, 245: 4, 228: 4, 219: 4, 519: 4, 172: 3, 67: 3, 173: 4, 528: 3, 359: 3, 306: 3, 298: 4, 125: 3, 490: 3, 492: 3, 491: 4, 482: 4, 209: 3, 77: 4, 257: 3, 268: 4, 428: 3, 178: 4, 27: 3, 26: 4, 412: 4, 138: 4, 161: 4, 274: 4, 427: 4, 413: 4, 273: 4, 403: 4, 55: 4, 278: 5, 54: 5, 513: 5, 134: 5, 537: 5}\n deq.append(w) # (12): NO CHANGE (22): NO CHANGE ... (4154): NO CHANGE\nprint(dist[0])\n"], "anno_status": [false], "diff_content": " from collections import deque\n K = int(input())\n dist = {1: 1}\n \n deq = deque([1])\n while deq:\n v = deq.popleft()\n \n w = (10 * v) % K\n- if w not in dist:\n+ if dist[v] < dist.get(w, 10**9):\n dist[w] = dist[v]\n deq.appendleft(w)\n \n w = (v + 1) % K\n- if w not in dist:\n+ if dist[v] + 1 < dist.get(w, 10**9):\n dist[w] = dist[v] + 1\n deq.append(w)\n print(dist[0])\n-\n", "FL_content": "\n from collections import deque\n K = int(input())\n dist = {1: 1}\n \n deq = deque([1])\n while deq:\n v = deq.popleft()\n \n w = (10 * v) % K\n if w not in dist:\n dist[w] = dist[v]\n deq.appendleft(w)\n \n w = (v + 1) % K\n if w not in dist:\n dist[w] = dist[v] + 1\n deq.append(w)\n print(dist[0])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u986478725", "problem_id": "p02404", "submission1_id": "s264826080-FL", "submission2_id": "s587641435", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def numinput():\n a = input().split()\n for i in range(len(a)):\n a[i] = int(a[i])\n return a\n \ndef main():\n while True:\n a = numinput()\n if a[0] == 0 and a[1] == 0: break\n H = a[0]; W = a[1]\n for i in range(H):\n bar = \"\"\n for j in range(W):\n if i > 0 and i < H - 1 and j > 0 and j < W - 1: bar += \".\"\n else: bar += \"*\"\n if i < H - 1: print(bar)\n else: print(bar + '\\n')\n \nif __name__ == \"__main__\":\n main()\n", "code2": "def numinput():\n a = input().split()\n for i in range(len(a)):\n a[i] = int(a[i])\n return a\n \ndef main():\n while True:\n a = numinput()\n if a[0] == 0 and a[1] == 0: break\n H = a[0]; W = a[1]\n for i in range(H):\n bar = \"\"\n for j in range(W):\n if i > 0 and i < H - 1 and j > 0 and j < W - 1: bar += \".\"\n else: bar += \"\n if i < H - 1: print(bar)\n else: print(bar + '\\n')\n \nif __name__ == \"__main__\":\n main()\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1525936529", "date2": "1525936618", "bleu_score": "0.9919223297797368", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 8\n4 10\n4 4\n0 0\n", "actual_output": "********\n*......*\n********\n\n**********\n*........*\n*........*\n**********\n\n****\n*..*\n*..*\n****\n\n", "expected_output": "########\n#......#\n########\n\n##########\n#........#\n#........#\n##########\n\n####\n#..#\n#..#\n####\n\n\n", "anno_code": ["def numinput(): # (0): numinput=\n a = input().split()\n for i in range(len(a)):\n a[i] = int(a[i])\n return a\n \ndef main(): # (1): main=\n while True:\n a = numinput()\n if a[0] == 0 and a[1] == 0: break\n H = a[0]; W = a[1]\n for i in range(H):\n bar = \"\"\n for j in range(W):\n if i > 0 and i < H - 1 and j > 0 and j < W - 1: bar += \".\"\n else: bar += \"*\"\n if i < H - 1: print(bar)\n else: print(bar + '\\n')\n \nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " def numinput():\n a = input().split()\n for i in range(len(a)):\n a[i] = int(a[i])\n return a\n- \n+ \n def main():\n while True:\n a = numinput()\n if a[0] == 0 and a[1] == 0: break\n H = a[0]; W = a[1]\n for i in range(H):\n bar = \"\"\n for j in range(W):\n if i > 0 and i < H - 1 and j > 0 and j < W - 1: bar += \".\"\n- else: bar += \"*\"\n+ else: bar += \"\n if i < H - 1: print(bar)\n else: print(bar + '\\n')\n- \n+ \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": "\n def numinput():\n a = input().split()\n for i in range(len(a)):\n a[i] = int(a[i])\n return a\n \n def main():\n while True:\n a = numinput()\n if a[0] == 0 and a[1] == 0: break\n H = a[0]; W = a[1]\n for i in range(H):\n bar = \"\"\n for j in range(W):\n if i > 0 and i < H - 1 and j > 0 and j < W - 1: bar += \".\"\n else: bar += \"*\"\n if i < H - 1: print(bar)\n else: print(bar + '\\n')\n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u280512618", "problem_id": "p03297", "submission1_id": "s655986270-FL", "submission2_id": "s802848106", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class query:\n def __init__(self, a, b, c, d):\n self.a = a\n self.b = b\n self.c = c\n self.d = d\n def isEternal(self):\n if self.a < self.b:\n return \"No\"\n if self.a % self.b > self.c:\n return \"No\"\n if self.d < self.b:\n return \"No\"\n d = self.b - self.c\n if d <= 0:\n return \"Yes\"\n if self.b % d == 0 and self.d % d == 0:\n return \"Yes\"\n if self.a % self.b + self.d == self.a:\n return \"Yes\"\n return \"No\"\n\nif __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n", "code2": "def gcd(a, b):\n r = a % b\n while r != 0:\n a, b, r = b, r, b % r\n return b\n\nclass query:\n def __init__(self, a, b, c, d):\n self.a = a\n self.b = b\n self.c = c\n self.d = d\n def isEternal(self):\n if self.a < self.b:\n return \"No\"\n if self.d < self.b:\n return \"No\"\n if self.b <= self.c:\n return \"Yes\"\n g = gcd(self.d, self.b)\n if self.b - g + self.a % g > self.c:\n return \"No\"\n return \"Yes\"\n\nif __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531619243", "date2": "1531631102", "bleu_score": "0.8618353132956962", "code1_test_status": [1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 70, "total_score": 102, "input": "14\n7 7 5 9\n15 7 1 9\n14 5 7 14\n14 5 1 12\n14 8 14 11\n14 11 5 11\n14 9 12 11\n14 10 11 11\n0 10 3 11\n0 13 9 6\n11 4 9 4\n16 10 5 10\n1100010000100000000 17 5 999999999999999985\n1000000000000000000 16 15 2424336645253281229\n", "actual_output": "No\nNo\nYes\nNo\nYes\nYes\nYes\nYes\nNo\nNo\nYes\nNo\nNo\nYes\n", "expected_output": "No\nNo\nYes\nNo\nYes\nYes\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\n\n", "anno_code": ["class query: # (0): query=\n def __init__(self, a, b, c, d):\n self.a = a\n self.b = b\n self.c = c\n self.d = d\n def isEternal(self):\n if self.a < self.b:\n return \"No\"\n if self.a % self.b > self.c:\n return \"No\"\n if self.d < self.b:\n return \"No\"\n d = self.b - self.c\n if d <= 0:\n return \"Yes\"\n if self.b % d == 0 and self.d % d == 0:\n return \"Yes\"\n if self.a % self.b + self.d == self.a:\n return \"Yes\"\n return \"No\"\n\nif __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n"], "anno_status": [false], "diff_content": "+def gcd(a, b):\n+ r = a % b\n+ while r != 0:\n+ a, b, r = b, r, b % r\n+ return b\n+\n class query:\n def __init__(self, a, b, c, d):\n self.a = a\n self.b = b\n self.c = c\n self.d = d\n def isEternal(self):\n if self.a < self.b:\n return \"No\"\n- if self.a % self.b > self.c:\n- return \"No\"\n if self.d < self.b:\n return \"No\"\n- d = self.b - self.c\n- if d <= 0:\n- return \"Yes\"\n- if self.b % d == 0 and self.d % d == 0:\n+ if self.b <= self.c:\n return \"Yes\"\n- if self.a % self.b + self.d == self.a:\n- return \"Yes\"\n- return \"No\"\n+ g = gcd(self.d, self.b)\n+ if self.b - g + self.a % g > self.c:\n+ return \"No\"\n+ return \"Yes\"\n \n if __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n \n", "FL_content": "\n class query:\n def __init__(self, a, b, c, d):\n self.a = a\n self.b = b\n self.c = c\n self.d = d\n def isEternal(self):\n if self.a < self.b:\n return \"No\"\n- if self.a % self.b > self.c:\n- return \"No\"\n- if self.d < self.b:\n- return \"No\"\n- d = self.b - self.c\n- if d <= 0:\n- return \"Yes\"\n- if self.b % d == 0 and self.d % d == 0:\n- return \"Yes\"\n- if self.a % self.b + self.d == self.a:\n- return \"Yes\"\n return \"No\"\n \n if __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 28 }, { "user_id": "u187516587", "problem_id": "p02536", "submission1_id": "s496203560-FL", "submission2_id": "s709908482", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ndef input():\n return sys.stdin.readline()[:-1]\nN,M=map(int,input().split())\nsys.setrecursionlimit(200000)\nclass uf:\n def __init__(self,n):\n self.n=n\n self.l=[-1]*n\n def ro(self,n): \n if self.l[n]<0:\n return n\n r=self.ro(self.l[n])\n self.l[n]=r\n return r\n def me(self,a,b): \n ra=self.ro(a)\n rb=self.ro(b)\n if self.l[ra]>self.l[rb]:\n ra,rb=rb,ra\n if ra!=rb:\n self.l[ra]+=self.l[rb]\n self.l[rb]=ra\n def size(self,n):\n return -self.l[self.ro(n)]\n def sa(self,a,b): \n return self.ro(a)==self.ro(b)\n def rl(self): \n return [i for i,v in enumerate(self.l) if v<0]\n \n def len(self): \n return len(self.rl())\n def ul(self):\n d={n:i for i,n in enumerate(self.rl())}\n m=[[]for i in range(self.len())]\n for i in range(self.n):\n m[d[self.ro(i)]].append(i)\n return m\n def __str__(self):\n return f\"{self.ul()}\"\n def __setitem__(self,i,v):\n self.l[i]=v\nu=uf(N)\nfor i in range(M):\n u.me(*map(lambda x: int(x)-1,input().split()))\nprint(N-u.len())", "code2": "import sys\ndef input():\n return sys.stdin.readline()[:-1]\nN,M=map(int,input().split())\nsys.setrecursionlimit(200000)\nclass uf:\n def __init__(self,n):\n self.n=n\n self.l=[-1]*n\n def ro(self,n): \n if self.l[n]<0:\n return n\n r=self.ro(self.l[n])\n self.l[n]=r\n return r\n def me(self,a,b): \n ra=self.ro(a)\n rb=self.ro(b)\n if self.l[ra]>self.l[rb]:\n ra,rb=rb,ra\n if ra!=rb:\n self.l[ra]+=self.l[rb]\n self.l[rb]=ra\n def size(self,n):\n return -self.l[self.ro(n)]\n def sa(self,a,b): \n return self.ro(a)==self.ro(b)\n def rl(self): \n return [i for i,v in enumerate(self.l) if v<0]\n \n def len(self): \n return len(self.rl())\n def ul(self):\n d={n:i for i,n in enumerate(self.rl())}\n m=[[]for i in range(self.len())]\n for i in range(self.n):\n m[d[self.ro(i)]].append(i)\n return m\n def __str__(self):\n return f\"{self.ul()}\"\n def __setitem__(self,i,v):\n self.l[i]=v\nu=uf(N)\nfor i in range(M):\n u.me(*map(lambda x: int(x)-1,input().split()))\nprint(u.len()-1)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601487973", "date2": "1601488061", "bleu_score": "0.9966902756500268", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 90, "input": "34 1\n2 13\n", "actual_output": "1\n", "expected_output": "32\n\n", "anno_code": ["import sys\ndef input(): # (0): input=\n return sys.stdin.readline()[:-1]\nN,M=map(int,input().split()) # (1): N=34, M=1\nsys.setrecursionlimit(200000) # (2): NO CHANGE\nclass uf: # (3): uf=\n def __init__(self,n):\n self.n=n # (5): NO CHANGE\n self.l=[-1]*n # (6): sys=, input=, N=34, M=1, uf=, u\n def ro(self,n): \n if self.l[n]<0: # (10): a=1, b=12, ra=1 (12): a=1, b=12, ra=1, rb=12\n return n\n r=self.ro(self.l[n])\n self.l[n]=r\n return r\n def me(self,a,b): \n ra=self.ro(a) # (9): n=1\n rb=self.ro(b) # (11): n=12\n if self.l[ra]>self.l[rb]: # (13): NO CHANGE\n ra,rb=rb,ra\n if ra!=rb: # (14): NO CHANGE\n self.l[ra]+=self.l[rb] # (15): NO CHANGE\n self.l[rb]=ra # (16): sys=, input=, N=34, M=1, uf=, u, i=0\n def size(self,n):\n return -self.l[self.ro(n)]\n def sa(self,a,b): \n return self.ro(a)==self.ro(b)\n def rl(self): \n return [i for i,v in enumerate(self.l) if v<0]\n \n def len(self): \n return len(self.rl())\n def ul(self):\n d={n:i for i,n in enumerate(self.rl())}\n m=[[]for i in range(self.len())]\n for i in range(self.n):\n m[d[self.ro(i)]].append(i)\n return m\n def __str__(self):\n return f\"{self.ul()}\"\n def __setitem__(self,i,v):\n self.l[i]=v\nu=uf(N) # (4): self, n=34\nfor i in range(M): # (7): i=0 (17): NO CHANGE\n u.me(*map(lambda x: int(x)-1,input().split())) # (8): self, a=1, b=12\nprint(N-u.len())"], "anno_status": [false], "diff_content": " import sys\n def input():\n return sys.stdin.readline()[:-1]\n N,M=map(int,input().split())\n sys.setrecursionlimit(200000)\n class uf:\n def __init__(self,n):\n self.n=n\n self.l=[-1]*n\n def ro(self,n): \n if self.l[n]<0:\n return n\n r=self.ro(self.l[n])\n self.l[n]=r\n return r\n def me(self,a,b): \n ra=self.ro(a)\n rb=self.ro(b)\n if self.l[ra]>self.l[rb]:\n ra,rb=rb,ra\n if ra!=rb:\n self.l[ra]+=self.l[rb]\n self.l[rb]=ra\n def size(self,n):\n return -self.l[self.ro(n)]\n def sa(self,a,b): \n return self.ro(a)==self.ro(b)\n def rl(self): \n return [i for i,v in enumerate(self.l) if v<0]\n \n def len(self): \n return len(self.rl())\n def ul(self):\n d={n:i for i,n in enumerate(self.rl())}\n m=[[]for i in range(self.len())]\n for i in range(self.n):\n m[d[self.ro(i)]].append(i)\n return m\n def __str__(self):\n return f\"{self.ul()}\"\n def __setitem__(self,i,v):\n self.l[i]=v\n u=uf(N)\n for i in range(M):\n u.me(*map(lambda x: int(x)-1,input().split()))\n-print(N-u.len())\n+print(u.len()-1)\n", "FL_content": "\n import sys\n def input():\n return sys.stdin.readline()[:-1]\n N,M=map(int,input().split())\n sys.setrecursionlimit(200000)\n class uf:\n def __init__(self,n):\n self.n=n\n self.l=[-1]*n\n def ro(self,n): \n if self.l[n]<0:\n return n\n r=self.ro(self.l[n])\n self.l[n]=r\n return r\n def me(self,a,b): \n ra=self.ro(a)\n rb=self.ro(b)\n if self.l[ra]>self.l[rb]:\n ra,rb=rb,ra\n if ra!=rb:\n self.l[ra]+=self.l[rb]\n self.l[rb]=ra\n def size(self,n):\n return -self.l[self.ro(n)]\n def sa(self,a,b): \n return self.ro(a)==self.ro(b)\n def rl(self): \n return [i for i,v in enumerate(self.l) if v<0]\n \n def len(self): \n return len(self.rl())\n def ul(self):\n d={n:i for i,n in enumerate(self.rl())}\n m=[[]for i in range(self.len())]\n for i in range(self.n):\n m[d[self.ro(i)]].append(i)\n return m\n def __str__(self):\n return f\"{self.ul()}\"\n def __setitem__(self,i,v):\n self.l[i]=v\n u=uf(N)\n for i in range(M):\n u.me(*map(lambda x: int(x)-1,input().split()))\n-print(N-u.len())\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 46 }, { "user_id": "u472883337", "problem_id": "p03739", "submission1_id": "s883231030-FL", "submission2_id": "s355850718", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\nl = len(a)\nb = []\nfor i in range(l):\n b.append(a[i])\n \nans = 0\nAns = 0\nsummary = a[0]\n\nif(summary == 0):\n a[0] = 1\n ans+= 1\n b[0] = -1\n Ans+= 1\nelse:\n b[0] = int(-a[0]/ abs(a[0]))\n Ans+= abs(a[0]- b[0])\n\nSummary = b[0] \n \nfor i in range(1, l):\n if(summary* (summary+ a[i])>= 0):\n if(summary > 0):\n ans+= a[i]+ summary+ 1\n a[i] = -summary- 1 \n summary= -1\n else:\n ans+= -summary+ 1- a[i]\n a[i] = -summary+ 1\n summary= 1\n else:\n summary+= a[i]\n\nfor i in range(1, l):\n if(Summary* (Summary+ b[i])>= 0):\n if(Summary > 0):\n Ans+= b[i]+ Summary+ 1\n b[i] = -Summary- 1 \n Summary= -1\n else:\n Ans+= -Summary+ 1- b[i]\n b[i] = -Summary+ 1\n Summary= 1\n else:\n Summary+= b[i]\n \nprint(min(ans, Ans))\nprint(a, b)", "code2": "n = int(input())\na = list(map(int, input().split()))\nl = len(a)\nb = []\nfor i in range(l):\n b.append(a[i])\n \nans = 0\nAns = 0\nsummary = a[0]\n\nif(summary == 0):\n summary = 1\n ans+= 1\n Summary = -1\n Ans+= 1\nelse:\n b[0] = int(-a[0]/ abs(a[0]))\n Ans+= abs(a[0]- b[0])\n Summary = b[0] \n \nfor i in range(1, l):\n if(summary* (summary+ a[i])>= 0):\n if(summary > 0):\n ans+= a[i]+ summary+ 1\n a[i] = -summary- 1 \n summary= -1\n else:\n ans+= -summary+ 1- a[i]\n a[i] = -summary+ 1\n summary= 1\n else:\n summary+= a[i]\n\nfor i in range(1, l):\n if(Summary* (Summary+ b[i])>= 0):\n if(Summary > 0):\n Ans+= b[i]+ Summary+ 1\n b[i] = -Summary- 1 \n Summary= -1\n else:\n Ans+= -Summary+ 1- b[i]\n b[i] = -Summary+ 1\n Summary= 1\n else:\n Summary+= b[i]\n \nprint(min(ans, Ans))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591063117", "date2": "1591063855", "bleu_score": "0.9709230851471963", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 94, "input": "6\n9 -1 -7 1 -1 0\n", "actual_output": "22\n[9, -10, 2, -2, 2, -2] [-1, 2, -7, 7, -2, 2]\n", "expected_output": "22\n\n", "anno_code": ["n = int(input()) # (0): n=6\na = list(map(int, input().split())) # (1): a=[9, -1, -7, 1, -1, 0]\nl = len(a) # (2): l=6\nb = [] # (3): b=[]\nfor i in range(l): # (4): i=0 (6): i=1 ... (16): NO CHANGE\n b.append(a[i]) # (5): b=[9] (7): b=[9, -1] ... (15): b=[9, -1, -7, 1, -1, 0]\n \nans = 0 # (17): ans=0\nAns = 0 # (18): Ans=0\nsummary = a[0] # (19): summary=9\n\nif(summary == 0): # (20): NO CHANGE\n a[0] = 1\n ans+= 1\n b[0] = -1\n Ans+= 1\nelse:\n b[0] = int(-a[0]/ abs(a[0])) # (21): b=[-1, -1, -7, 1, -1, 0]\n Ans+= abs(a[0]- b[0]) # (22): Ans=10\n\nSummary = b[0] # (23): Summary=-1\n \nfor i in range(1, l): # (24): i=1 (30): i=2 ... (54): NO CHANGE\n if(summary* (summary+ a[i])>= 0): # (25): NO CHANGE (31): NO CHANGE ... (49): NO CHANGE\n if(summary > 0): # (26): NO CHANGE (32): NO CHANGE ... (50): NO CHANGE\n ans+= a[i]+ summary+ 1 # (27): ans=9 (39): ans=21 (51): ans=26\n a[i] = -summary- 1 # (28): a=[9, -10, -7, 1, -1, 0] (40): a=[9, -10, 2, -2, -1, 0] (52): a=[9, -10, 2, -2, 2, -2]\n summary= -1 # (29): summary=-1 (41): summary=-1 (53): summary=-1\n else:\n ans+= -summary+ 1- a[i] # (33): ans=18 (45): ans=24\n a[i] = -summary+ 1 # (34): a=[9, -10, 2, 1, -1, 0] (46): a=[9, -10, 2, -2, 2, 0]\n summary= 1 # (35): summary=1 (47): summary=1\n else:\n summary+= a[i]\n\nfor i in range(1, l): # (55): i=1 (61): i=2 ... (82): NO CHANGE\n if(Summary* (Summary+ b[i])>= 0): # (56): NO CHANGE (62): NO CHANGE ... (77): NO CHANGE\n if(Summary > 0): # (57): NO CHANGE (66): NO CHANGE ... (78): NO CHANGE\n Ans+= b[i]+ Summary+ 1 # (73): Ans=20\n b[i] = -Summary- 1 # (74): b=[-1, 2, -7, 7, -2, 0]\n Summary= -1 # (75): Summary=-1\n else:\n Ans+= -Summary+ 1- b[i] # (58): Ans=13 (67): Ans=19 (79): Ans=22\n b[i] = -Summary+ 1 # (59): b=[-1, 2, -7, 1, -1, 0] (68): b=[-1, 2, -7, 7, -1, 0] (80): b=[-1, 2, -7, 7, -2, 2]\n Summary= 1 # (60): Summary=1 (69): Summary=1 (81): Summary=1\n else:\n Summary+= b[i] # (63): Summary=-6\n \nprint(min(ans, Ans)) # (83): NO CHANGE\nprint(a, b)"], "anno_status": [false], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n l = len(a)\n b = []\n for i in range(l):\n b.append(a[i])\n \n ans = 0\n Ans = 0\n summary = a[0]\n \n if(summary == 0):\n- a[0] = 1\n+ summary = 1\n ans+= 1\n- b[0] = -1\n+ Summary = -1\n Ans+= 1\n else:\n b[0] = int(-a[0]/ abs(a[0]))\n Ans+= abs(a[0]- b[0])\n-\n-Summary = b[0] \n+ Summary = b[0] \n \n for i in range(1, l):\n if(summary* (summary+ a[i])>= 0):\n if(summary > 0):\n ans+= a[i]+ summary+ 1\n a[i] = -summary- 1 \n summary= -1\n else:\n ans+= -summary+ 1- a[i]\n a[i] = -summary+ 1\n summary= 1\n else:\n summary+= a[i]\n \n for i in range(1, l):\n if(Summary* (Summary+ b[i])>= 0):\n if(Summary > 0):\n Ans+= b[i]+ Summary+ 1\n b[i] = -Summary- 1 \n Summary= -1\n else:\n Ans+= -Summary+ 1- b[i]\n b[i] = -Summary+ 1\n Summary= 1\n else:\n Summary+= b[i]\n \n print(min(ans, Ans))\n-print(a, b)\n", "FL_content": "\n n = int(input())\n a = list(map(int, input().split()))\n l = len(a)\n b = []\n for i in range(l):\n b.append(a[i])\n \n ans = 0\n Ans = 0\n summary = a[0]\n \n if(summary == 0):\n a[0] = 1\n ans+= 1\n b[0] = -1\n Ans+= 1\n else:\n b[0] = int(-a[0]/ abs(a[0]))\n Ans+= abs(a[0]- b[0])\n \n Summary = b[0] \n \n for i in range(1, l):\n if(summary* (summary+ a[i])>= 0):\n if(summary > 0):\n ans+= a[i]+ summary+ 1\n a[i] = -summary- 1 \n summary= -1\n else:\n ans+= -summary+ 1- a[i]\n a[i] = -summary+ 1\n summary= 1\n else:\n summary+= a[i]\n \n for i in range(1, l):\n if(Summary* (Summary+ b[i])>= 0):\n if(Summary > 0):\n Ans+= b[i]+ Summary+ 1\n b[i] = -Summary- 1 \n Summary= -1\n else:\n Ans+= -Summary+ 1- b[i]\n b[i] = -Summary+ 1\n Summary= 1\n else:\n Summary+= b[i]\n \n print(min(ans, Ans))\n-print(a, b)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 50 }, { "user_id": "u490992416", "problem_id": "p02843", "submission1_id": "s066453000-FL", "submission2_id": "s660323897", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x = int(input())\nl = int(x/105)\nu = int(x/100)+1\nflag = False\nfor n in range(l, u):\n for a in range(0, u):\n for b in range(n-a, u):\n for c in range(n-a-b, u):\n for d in range(n-a-b-c, u):\n for e in range(n-a-b-c-d, u):\n for f in range(n-a-b-c-d-e, u):\n if 100*a + 101*b + 102*c + 103*d + 104*e + 105*f == x:\n \n flag = True\n break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n\nif flag:\n print('1')\nelse:\n print('0')", "code2": "x = int(input())\nl = int(x/105)\nu = int(x/100)+1\nflag = False\nfor n in range(l, u):\n for a in range(0, u):\n for b in range(0, u-a):\n for c in range(0, u-a-b):\n for d in range(0, u-a-b-c):\n for e in range(0, u-a-b-c-d):\n for f in range(0, u-a-b-c-d-e):\n if 100*a + 101*b + 102*c + 103*d + 104*e + 105*f == x:\n \n flag = True\n break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n\nif flag:\n print('1')\nelse:\n print('0')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575260292", "date2": "1575260363", "bleu_score": "0.9675100140069466", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1], "code1_test_score": 18, "total_score": 26, "input": "420\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " x = int(input())\n l = int(x/105)\n u = int(x/100)+1\n flag = False\n for n in range(l, u):\n for a in range(0, u):\n- for b in range(n-a, u):\n- for c in range(n-a-b, u):\n- for d in range(n-a-b-c, u):\n- for e in range(n-a-b-c-d, u):\n- for f in range(n-a-b-c-d-e, u):\n+ for b in range(0, u-a):\n+ for c in range(0, u-a-b):\n+ for d in range(0, u-a-b-c):\n+ for e in range(0, u-a-b-c-d):\n+ for f in range(0, u-a-b-c-d-e):\n if 100*a + 101*b + 102*c + 103*d + 104*e + 105*f == x:\n \n flag = True\n break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n if flag == True: break\n \n if flag:\n print('1')\n else:\n print('0')\n", "FL_content": "\n x = int(input())\n-l = int(x/105)\n-u = int(x/100)+1\n flag = False\n-for n in range(l, u):\n- for a in range(0, u):\n- for b in range(n-a, u):\n- for c in range(n-a-b, u):\n- for d in range(n-a-b-c, u):\n- for e in range(n-a-b-c-d, u):\n- for f in range(n-a-b-c-d-e, u):\n- if 100*a + 101*b + 102*c + 103*d + 104*e + 105*f == x:\n- \n- flag = True\n- break\n- if flag == True: break\n- if flag == True: break\n- if flag == True: break\n- if flag == True: break\n- if flag == True: break\n- if flag == True: break\n- if flag == True: break\n \n if flag:\n print('1')\n else:\n print('0')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u634873566", "problem_id": "p04044", "submission1_id": "s158234892-FL", "submission2_id": "s154147528", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, l = map(int, input().split())\nd = {input() for _ in range(n)}\nprint(sorted(d))", "code2": "n, l = map(int, input().split())\nd = sorted([input() for _ in range(n)])\nprint(''.join(d))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590363900", "date2": "1590364023", "bleu_score": "0.8142660498513914", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 3\ncwx\nxxa\nyxd\n", "actual_output": "['cwx', 'xxa', 'yxd']\n", "expected_output": "cwxxxayxd\n\n", "anno_code": ["n, l = map(int, input().split()) # (0): n=3, l=3\nd = {input() for _ in range(n)} # (1): d={'yxd', 'xxa', 'cwx'}\nprint(sorted(d))"], "anno_status": [true], "diff_content": " n, l = map(int, input().split())\n-d = {input() for _ in range(n)}\n-print(sorted(d))\n+d = sorted([input() for _ in range(n)])\n+print(''.join(d))\n", "FL_content": "\n n, l = map(int, input().split())\n d = {input() for _ in range(n)}\n-print(sorted(d))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 3 }, { "user_id": "u216392490", "problem_id": "p02549", "submission1_id": "s828066217-FL", "submission2_id": "s865887487", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nn, k = list(map(int, input().split()))\ns = list()\nfor i in range(k):\n l, r = list(map(int, input().split()))\n s.append((l, r))\n\nmod = 998244353\ni = 1\ndp = [0] * (n+1)\ndp[1] = 1\ndpsum = [0] * (n+1)\ndpsum[1] = 1\nfor i in range(2, n+1):\n for l, r in s:\n li = i-r\n ri = i-l\n if ri < 1: continue\n li = max(li, 1)\n dp[i] += dpsum[ri] - dpsum[li-1]\n dpsum[i] = (dpsum[i-1] + dp[i]) % mod\n \nprint(dp[n])\n", "code2": "\nn, k = list(map(int, input().split()))\ns = list()\nfor i in range(k):\n l, r = list(map(int, input().split()))\n s.append((l, r))\n\nmod = 998244353\ni = 1\ndp = [0] * (n+1)\ndp[1] = 1\ndpsum = [0] * (n+1)\ndpsum[1] = 1\nfor i in range(2, n+1):\n for l, r in s:\n li = i-r\n ri = i-l\n if ri < 1: continue\n li = max(li, 1)\n dp[i] = (dp[i] + dpsum[ri] - dpsum[li-1]) % mod\n dpsum[i] = (dpsum[i-1] + dp[i]) % mod\n \nprint(dp[n])\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600604441", "date2": "1600604557", "bleu_score": "0.9599674979754907", "code1_test_status": [1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 81, "total_score": 102, "input": "84 3\n5 4\n1 3\n1 20\n", "actual_output": "-1383036571\n", "expected_output": "613452135\n\n", "anno_code": ["\nn, k = list(map(int, input().split())) # (0): n=84, k=3\ns = list() # (1): s=[]\nfor i in range(k): # (2): i=0 (5): i=1 ... (11): NO CHANGE\n l, r = list(map(int, input().split())) # (3): l=5, r=4 (6): l=1, r=3 (9): r=20\n s.append((l, r)) # (4): s=[(5, 4)] (7): s=[(5, 4), (1, 3)] (10): s=[(5, 4), (1, 3), (1, 20)]\n\nmod = 998244353 # (12): mod=998244353\ni = 1 # (13): i=1\ndp = [0] * (n+1) # (14): dp=[0, 0, ..., 0, 0]\ndp[1] = 1 # (15): dp=[0, 1, ..., 0, 0]\ndpsum = [0] * (n+1) # (16): dpsum=[0, 0, ..., 0, 0]\ndpsum[1] = 1 # (17): dpsum=[0, 1, ..., 0, 0]\nfor i in range(2, n+1): # (18): i=2 (37): i=3 ... (1753): NO CHANGE\n for l, r in s: # (19): l=5, r=4 (23): l=1, r=3 ... (1751): NO CHANGE\n li = i-r # (20): li=-2 (24): li=-1 ... (1746): li=64\n ri = i-l # (21): ri=-3 (25): ri=1 ... (1747): NO CHANGE\n if ri < 1: continue # (22): NO CHANGE (26): NO CHANGE ... (1748): NO CHANGE\n li = max(li, 1) # (27): li=1 (33): li=1 ... (1749): NO CHANGE\n dp[i] += dpsum[ri] - dpsum[li-1] # (28): dp=[0, 1, ..., 0, 0] (34): dp=[0, 1, ..., 0, 0] ... (1750): dp=[0, 1, ..., 399387422, -1383036571]\n dpsum[i] = (dpsum[i-1] + dp[i]) % mod # (36): dpsum=[0, 1, ..., 0, 0] (55): dpsum=[0, 1, ..., 0, 0] ... (1752): dpsum=[0, 1, ..., 40854599, 654306734]\n \nprint(dp[n])\n"], "anno_status": [true], "diff_content": " \n n, k = list(map(int, input().split()))\n s = list()\n for i in range(k):\n l, r = list(map(int, input().split()))\n s.append((l, r))\n \n mod = 998244353\n i = 1\n dp = [0] * (n+1)\n dp[1] = 1\n dpsum = [0] * (n+1)\n dpsum[1] = 1\n for i in range(2, n+1):\n for l, r in s:\n li = i-r\n ri = i-l\n if ri < 1: continue\n li = max(li, 1)\n- dp[i] += dpsum[ri] - dpsum[li-1]\n+ dp[i] = (dp[i] + dpsum[ri] - dpsum[li-1]) % mod\n dpsum[i] = (dpsum[i-1] + dp[i]) % mod\n \n print(dp[n])\n \n", "FL_content": "\n \n n, k = list(map(int, input().split()))\n s = list()\n for i in range(k):\n l, r = list(map(int, input().split()))\n s.append((l, r))\n \n mod = 998244353\n i = 1\n dp = [0] * (n+1)\n dp[1] = 1\n dpsum = [0] * (n+1)\n dpsum[1] = 1\n for i in range(2, n+1):\n for l, r in s:\n li = i-r\n ri = i-l\n if ri < 1: continue\n li = max(li, 1)\n dp[i] += dpsum[ri] - dpsum[li-1]\n dpsum[i] = (dpsum[i-1] + dp[i]) % mod\n \n print(dp[n])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u432251613", "problem_id": "p03545", "submission1_id": "s635376393-FL", "submission2_id": "s695873618", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n (A,B,C,D) = map(int, input())\n operation = ['+','-']\n for op1 in operation:\n sum = A\n if op1=='+':\n sum+=B\n else:\n sum-=B\n for op2 in operation:\n if op2=='+':\n sum+=C\n else:\n sum-=C\n if 7-sum==D:\n op3 = '+'\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7')\n return\n elif sum-7==D:\n op3 = '-'\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7')\n return\n\nmain()\n", "code2": "def main():\n (A,B,C,D) = map(int, input())\n operation = ['+','-']\n sumA = A\n for op1 in operation:\n sum = sumA\n if op1=='+':\n sum+=B\n else:\n sum-=B\n sumAB = sum\n for op2 in operation:\n sum = sumAB\n if op2=='+':\n sum+=C\n else:\n sum-=C\n if 7-sum==D:\n op3 = '+'\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7')\n return\n elif sum-7==D:\n op3 = '-'\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7')\n return\n\nmain()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591095802", "date2": "1591096738", "bleu_score": "0.908883551051966", "code1_test_status": [1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 65, "total_score": 99, "input": "2368\n", "actual_output": "2-3-6+8=7\n", "expected_output": "2+3-6+8=7\n\n", "anno_code": ["def main(): # (0): main=\n (A,B,C,D) = map(int, input()) # (2): A=2, B=3, C=6, D=8\n operation = ['+','-'] # (3): operation=['+', '-']\n for op1 in operation: # (4): op1=+ (19): op1=-\n sum = A # (5): sum=2 (20): sum=2\n if op1=='+': # (6): NO CHANGE (21): NO CHANGE\n sum+=B # (7): sum=5\n else:\n sum-=B # (22): sum=-1\n for op2 in operation: # (8): op2=+ (13): op2=- ... (28): op2=-\n if op2=='+': # (9): NO CHANGE (14): NO CHANGE ... (29): NO CHANGE\n sum+=C # (10): sum=11 (25): sum=5\n else:\n sum-=C # (15): sum=5 (30): sum=-1\n if 7-sum==D: # (11): NO CHANGE (16): NO CHANGE ... (31): NO CHANGE\n op3 = '+' # (32): op3=+\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7') # (33): NO CHANGE\n return\n elif sum-7==D: # (12): NO CHANGE (17): NO CHANGE (27): NO CHANGE\n op3 = '-'\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7')\n return\n\nmain() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " def main():\n (A,B,C,D) = map(int, input())\n operation = ['+','-']\n+ sumA = A\n for op1 in operation:\n- sum = A\n+ sum = sumA\n if op1=='+':\n sum+=B\n else:\n sum-=B\n+ sumAB = sum\n for op2 in operation:\n+ sum = sumAB\n if op2=='+':\n sum+=C\n else:\n sum-=C\n if 7-sum==D:\n op3 = '+'\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7')\n return\n elif sum-7==D:\n op3 = '-'\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7')\n return\n \n main()\n \n", "FL_content": "\n def main():\n (A,B,C,D) = map(int, input())\n operation = ['+','-']\n for op1 in operation:\n sum = A\n if op1=='+':\n sum+=B\n else:\n sum-=B\n for op2 in operation:\n if op2=='+':\n sum+=C\n else:\n sum-=C\n- if 7-sum==D:\n op3 = '+'\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7')\n return\n- elif sum-7==D:\n op3 = '-'\n print(str(A)+op1+str(B)+op2+str(C)+op3+str(D)+'=7')\n return\n \n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 25 }, { "user_id": "u585391547", "problem_id": "p00015", "submission1_id": "s194661465-FL", "submission2_id": "s980917527", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nfor n in range(n):\n\ta=int(input())\n\tb=int(input())\n\tc=a+b\n\tif a>=int(1e79) or b>=int(1e79) or c>=int(1e79):\n\t\tprint(\"overflow\")\n\telse:\n\t\tprint(c)", "code2": "n=int(input())\nfor i in range(n):\n\ta=int(input())\n\tb=int(input())\n\tc=a+b\n\tc=str(c)\n\tif len(c)>80:\n\t\tprint(\"overflow\")\n\telse:\n\t\tprint(c)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1412872736", "date2": "1413205987", "bleu_score": "0.703102183007645", "code1_test_status": [0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0], "code1_test_score": 34, "total_score": 101, "input": "6\n1001\n755\n9999999999999999999999999999999999999999\n2\n193919268602104111709736623030259273252485145760643079255618727884865768962159432\n0\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n0\n101000000000100000000000000000000000000000000000000000000000000000000000000000000\n1\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n100000010000000000000000000000001000000000000000000000000000000000000000000000000\n", "actual_output": "1756\n10000000000000000000000000000000000000001\noverflow\noverflow\noverflow\noverflow\n", "expected_output": "1756\n10000000000000000000000000000000000000001\noverflow\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\noverflow\noverflow\n\n", "anno_code": ["n=int(input()) # (0): n=6\nfor n in range(n): # (1): n=0 (7): n=1 ... (31): n=5\n\ta=int(input()) # (2): a=1001 (8): a=9999999999999999999999999999999999999999 ... (32): a=100000000000000000000000000000000000000000000000000000000000000000000000000000000\n\tb=int(input()) # (3): b=755 (9): b=2 ... (33): b=100000010000000000000000000000001000000000000000000000000000000000000000000000000\n\tc=a+b # (4): c=1756 (10): c=10000000000000000000000000000000000000001 ... (34): c=200000010000000000000000000000001000000000000000000000000000000000000000000000000\n\tif a>=int(1e79) or b>=int(1e79) or c>=int(1e79): # (5): NO CHANGE (11): NO CHANGE ... (35): NO CHANGE\n\t\tprint(\"overflow\") # (18): NO CHANGE (24): NO CHANGE ... (36): NO CHANGE\n\telse:\n\t\tprint(c) # (6): NO CHANGE (12): NO CHANGE\n"], "anno_status": [false], "diff_content": " n=int(input())\n-for n in range(n):\n+for i in range(n):\n \ta=int(input())\n \tb=int(input())\n \tc=a+b\n-\tif a>=int(1e79) or b>=int(1e79) or c>=int(1e79):\n+\tc=str(c)\n+\tif len(c)>80:\n \t\tprint(\"overflow\")\n \telse:\n \t\tprint(c)\n", "FL_content": "\n-n=int(input())\n-for n in range(n):\n-\ta=int(input())\n-\tb=int(input())\n-\tc=a+b\n-\tif a>=int(1e79) or b>=int(1e79) or c>=int(1e79):\n \t\tprint(\"overflow\")\n \telse:\n \t\tprint(c)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u371763408", "problem_id": "p04039", "submission1_id": "s949780138-FL", "submission2_id": "s005428046", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k=map(int,input().split())\nD=list(map(int,input().split()))\n\nfor i in range(n,10001):\n for j in str(i):\n if int(j) in D:\n break\n else:\n print(i)\n exit()", "code2": "n,k=map(int,input().split())\nD=list(map(int,input().split()))\n\nfor i in range(n,88889):\n for j in str(i):\n if int(j) in D:\n break\n else:\n print(i)\n exit()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554299727", "date2": "1554300000", "bleu_score": "0.9613539001024424", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 72, "total_score": 94, "input": "17691 1\n2\n", "actual_output": "no output\n", "expected_output": "17691\n\n", "anno_code": ["n,k=map(int,input().split()) # (0): n=17691, k=1\nD=list(map(int,input().split())) # (1): D=[2]\n\nfor i in range(n,10001):\n for j in str(i):\n if int(j) in D:\n break\n else:\n print(i)\n exit()"], "anno_status": [true], "diff_content": " n,k=map(int,input().split())\n D=list(map(int,input().split()))\n \n-for i in range(n,10001):\n+for i in range(n,88889):\n for j in str(i):\n if int(j) in D:\n break\n else:\n print(i)\n exit()\n", "FL_content": "\n n,k=map(int,input().split())\n-D=list(map(int,input().split()))\n \n-for i in range(n,10001):\n for j in str(i):\n if int(j) in D:\n break\n else:\n print(i)\n exit()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u250583425", "problem_id": "p02702", "submission1_id": "s145912414-FL", "submission2_id": "s500523892", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ndef input(): return sys.stdin.readline().rstrip()\n\ndef main():\n S = input()\n ans = 0\n for i in range(0, 200000, 2019):\n ind = -1\n stri = str(i)\n while True:\n ind = S.find(stri, ind + 1)\n if ind >= 0:\n ans += 1\n else:\n break\n print(ans)\n\nif __name__ == '__main__':\n main()\n", "code2": "import sys\ndef input(): return sys.stdin.readline().rstrip()\n\ndef main():\n S = input()\n s_list = list(map(int, list(S)))[::-1]\n MOD = 2019\n\n sum_v = 0\n cnt = [0] * MOD\n cnt[0] = 1\n for i, s in enumerate(s_list):\n sum_v += s * pow(10, i, MOD)\n sum_v %= MOD\n cnt[sum_v] += 1\n print(sum([c * (c - 1) \n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1587951034", "date2": "1588174233", "bleu_score": "0.6048023939264042", "code1_test_status": [1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 66, "total_score": 74, "input": "2612900314\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["import sys\ndef input(): return sys.stdin.readline().rstrip()\n\ndef main(): # (0): main=\n S = input()\n ans = 0\n for i in range(0, 200000, 2019):\n ind = -1\n stri = str(i)\n while True:\n ind = S.find(stri, ind + 1)\n if ind >= 0:\n ans += 1\n else:\n break\n print(ans)\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " import sys\n def input(): return sys.stdin.readline().rstrip()\n \n def main():\n S = input()\n- ans = 0\n- for i in range(0, 200000, 2019):\n- ind = -1\n- stri = str(i)\n- while True:\n- ind = S.find(stri, ind + 1)\n- if ind >= 0:\n- ans += 1\n- else:\n- break\n- print(ans)\n+ s_list = list(map(int, list(S)))[::-1]\n+ MOD = 2019\n+\n+ sum_v = 0\n+ cnt = [0] * MOD\n+ cnt[0] = 1\n+ for i, s in enumerate(s_list):\n+ sum_v += s * pow(10, i, MOD)\n+ sum_v %= MOD\n+ cnt[sum_v] += 1\n+ print(sum([c * (c - 1) \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": "\n import sys\n def input(): return sys.stdin.readline().rstrip()\n \n def main():\n S = input()\n ans = 0\n for i in range(0, 200000, 2019):\n ind = -1\n stri = str(i)\n while True:\n ind = S.find(stri, ind + 1)\n if ind >= 0:\n- ans += 1\n else:\n break\n print(ans)\n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u962535482", "problem_id": "p02921", "submission1_id": "s293067536-FL", "submission2_id": "s433059441", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nT = input()\ncounter = 0\nfor i in range(2):\n if S[i] == T[i]:\n counter += 1\n \nprint(counter)\n", "code2": "S = input()\nT = input()\ncounter = 0\nfor i in range(3):\n if S[i] == T[i]:\n counter += 1\n \nprint(counter)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567366734", "date2": "1567366795", "bleu_score": "0.9789435002605391", "code1_test_status": [1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 80, "total_score": 103, "input": "VRS\nQTS\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["S = input() # (0): S=VRS\nT = input() # (1): T=QTS\ncounter = 0 # (2): counter=0\nfor i in range(2): # (3): i=0 (5): i=1 (7): NO CHANGE\n if S[i] == T[i]: # (4): NO CHANGE (6): NO CHANGE\n counter += 1\n \nprint(counter)\n"], "anno_status": [true], "diff_content": " S = input()\n T = input()\n counter = 0\n-for i in range(2):\n+for i in range(3):\n if S[i] == T[i]:\n counter += 1\n \n print(counter)\n \n", "FL_content": "\n S = input()\n T = input()\n counter = 0\n-for i in range(2):\n if S[i] == T[i]:\n counter += 1\n \n print(counter)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u642528832", "problem_id": "p02916", "submission1_id": "s633504969-FL", "submission2_id": "s756762340", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nla = list(map(int,input().split()))\nlb = list(map(int,input().split()))\nlc = list(map(int,input().split()))\n\ncon = 0\n\nfor i in range(len(la)-1):\n if la[(i+1)%3]==la[i]+1:\n con += lc[la[i]-1]\n\nprint(sum(lb)+con)", "code2": "n = int(input())\nla = list(map(int,input().split()))\nlb = list(map(int,input().split()))\nlc = list(map(int,input().split()))\n\ncon = 0\n\nfor i in range(n-1):\n if la[i+1]==la[i]+1:\n con += lc[la[i]-1]\n\nprint(sum(lb)+con)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595214467", "date2": "1595214687", "bleu_score": "0.9344136003469655", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 98, "total_score": 103, "input": "4\n2 3 0 1\n7 5 4 24\n45 9 21\n", "actual_output": "49\n", "expected_output": "70\n\n", "anno_code": ["n = int(input()) # (0): n=4\nla = list(map(int,input().split())) # (1): la=[2, 3, 0, 1]\nlb = list(map(int,input().split())) # (2): lb=[7, 5, 4, 24]\nlc = list(map(int,input().split())) # (3): lc=[45, 9, 21]\n\ncon = 0 # (4): con=0\n\nfor i in range(len(la)-1): # (5): i=0 (8): i=1 ... (12): NO CHANGE\n if la[(i+1)%3]==la[i]+1: # (6): NO CHANGE (9): NO CHANGE (11): NO CHANGE\n con += lc[la[i]-1] # (7): con=9\n\nprint(sum(lb)+con)"], "anno_status": [true], "diff_content": " n = int(input())\n la = list(map(int,input().split()))\n lb = list(map(int,input().split()))\n lc = list(map(int,input().split()))\n \n con = 0\n \n-for i in range(len(la)-1):\n- if la[(i+1)%3]==la[i]+1:\n+for i in range(n-1):\n+ if la[i+1]==la[i]+1:\n con += lc[la[i]-1]\n \n print(sum(lb)+con)\n", "FL_content": "\n n = int(input())\n la = list(map(int,input().split()))\n lb = list(map(int,input().split()))\n lc = list(map(int,input().split()))\n \n con = 0\n \n-for i in range(len(la)-1):\n- if la[(i+1)%3]==la[i]+1:\n- con += lc[la[i]-1]\n \n print(sum(lb)+con)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u398846051", "problem_id": "p03003", "submission1_id": "s747517651-FL", "submission2_id": "s002546735", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\ns = list(map(int, input().split()))\nt = list(map(int, input().split()))\ndp = [[0] * (m+2) for _ in range(n+2)]\nmod = 1000000007\ndp[0][0] = 1\nfor i in range(1, n+1):\n for j in range(1, m+1):\n dp[i][j] = (dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]) % mod\n if s[i-1] == t[j-1]:\n dp[i][j] += 1 + dp[i-1][j-1]\n dp[i][j] %= mod\nprint(dp[n][m])\n", "code2": "n, m = map(int, input().split())\ns = list(map(int, input().split()))\nt = list(map(int, input().split()))\ndp = [[0] * (m+2) for _ in range(n+2)]\nmod = 1000000007\n\nfor i in range(n+1):\n dp[i][0] = 1\nfor i in range(m+1):\n dp[0][i] = 1\n\nfor i in range(1, n+1):\n for j in range(1, m+1):\n dp[i][j] = (dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]) % mod\n if s[i-1] == t[j-1]:\n dp[i][j] += dp[i-1][j-1]\n dp[i][j] %= mod\nprint(dp[n][m])\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1560766592", "date2": "1560766940", "bleu_score": "0.8581596183818463", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 105, "input": "20 20\n1 1 1 1 1 1 1 0 1 1 1 1 2 1 1 1 1 1 1 -1\n1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 2\n", "actual_output": "150262454\n", "expected_output": "150262455\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=20, m=20\ns = list(map(int, input().split())) # (1): s=[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, -1]\nt = list(map(int, input().split())) # (2): t=[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 2]\ndp = [[0] * (m+2) for _ in range(n+2)] # (3): dp\nmod = 1000000007 # (4): mod=1000000007\ndp[0][0] = 1 # (5): dp\nfor i in range(1, n+1): # (6): i=1 (102): i=2 ... (1830): NO CHANGE\n for j in range(1, m+1): # (7): j=1 (12): j=2 ... (1829): NO CHANGE\n dp[i][j] = (dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]) % mod # (8): dp (13): dp ... (1827): dp\n if s[i-1] == t[j-1]: # (9): NO CHANGE (14): NO CHANGE ... (1828): NO CHANGE\n dp[i][j] += 1 + dp[i-1][j-1] # (10): dp (15): dp ... (1762): dp\n dp[i][j] %= mod # (11): dp (16): NO CHANGE ... (1763): dp\nprint(dp[n][m])\n"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n s = list(map(int, input().split()))\n t = list(map(int, input().split()))\n dp = [[0] * (m+2) for _ in range(n+2)]\n mod = 1000000007\n-dp[0][0] = 1\n+\n+for i in range(n+1):\n+ dp[i][0] = 1\n+for i in range(m+1):\n+ dp[0][i] = 1\n+\n for i in range(1, n+1):\n for j in range(1, m+1):\n dp[i][j] = (dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]) % mod\n if s[i-1] == t[j-1]:\n- dp[i][j] += 1 + dp[i-1][j-1]\n+ dp[i][j] += dp[i-1][j-1]\n dp[i][j] %= mod\n print(dp[n][m])\n \n", "FL_content": "\n n, m = map(int, input().split())\n s = list(map(int, input().split()))\n t = list(map(int, input().split()))\n dp = [[0] * (m+2) for _ in range(n+2)]\n mod = 1000000007\n dp[0][0] = 1\n for i in range(1, n+1):\n for j in range(1, m+1):\n dp[i][j] = (dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]) % mod\n if s[i-1] == t[j-1]:\n dp[i][j] += 1 + dp[i-1][j-1]\n dp[i][j] %= mod\n-print(dp[n][m])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u227082700", "problem_id": "p03944", "submission1_id": "s065767111-FL", "submission2_id": "s037417624", "status1": "Wrong Answer", "status2": "Accepted", "code1": "w,h,n=map(int,input().split())\nx,y=0,0\nfor i in range(n):\n a,b,c=map(int,input().split())\n if c\n if n==0: # (6): NO CHANGE (12): NO CHANGE ... (65581): NO CHANGE\n return 1\n elif n<0: # (7): NO CHANGE (13): NO CHANGE ... (65582): NO CHANGE\n return 0\n elif L[n]!=-1: # (8): NO CHANGE (14): NO CHANGE ... (65583): n=1729, tmp=3332216002, i=9\n return L[n]\n else:\n tmp=0 # (9): tmp=0 (15): tmp=0 ... (65526): tmp=0\n for i in range(3,10): # (10): i=3 (16): i=3 ... (65584): NO CHANGE\n tmp+=f(n-i) # (11): n=1726 (17): n=1723 ... (65580): n=1720\n L[n]=tmp%mod # (3495): n=4, i=3 (3520): n=7, i=3 ... (65563): n=1729, tmp=1926896794, i=5\n return L[n]\nprint(f(S)) # (5): n=1729\n"], "anno_status": [true], "diff_content": " mod=10**9+7\n \n S=int(input())\n ans=0\n L=[-1]*(S+1)\n \n def f(n):\n if n==0:\n return 1\n elif n<0:\n return 0\n elif L[n]!=-1:\n return L[n]\n else:\n tmp=0\n- for i in range(3,10):\n+ for i in range(3,n+1):\n tmp+=f(n-i)\n- L[n]=tmp%mod\n- return L[n]\n-print(f(S))\n+ L[n]=tmp\n+ return tmp\n+print(f(S)%mod)\n", "FL_content": "\n mod=10**9+7\n \n S=int(input())\n ans=0\n-L=[-1]*(S+1)\n \n def f(n):\n if n==0:\n return 1\n elif n<0:\n return 0\n elif L[n]!=-1:\n return L[n]\n else:\n tmp=0\n- for i in range(3,10):\n tmp+=f(n-i)\n L[n]=tmp%mod\n return L[n]\n print(f(S))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u404629709", "problem_id": "p03086", "submission1_id": "s298354113-FL", "submission2_id": "s803740365", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=input()\nl=[\"A\",\"T\",\"C\",\"G\"]\nres=0\ncnt=0\n\nfor i in range(len(n)):\n if n[i] in l:\n if cnt>res:\n res=cnt\n cnt+=1\n else:\n if cnt>res:\n res=cnt\n cnt=0\n \nprint(res)", "code2": "n=input()\nl=[\"A\",\"T\",\"C\",\"G\"]\nres=0\ncnt=0\n\nfor i in range(len(n)):\n if n[i] in l:\n cnt+=1\n if cnt>res:\n res=cnt\n else:\n cnt=0\n if cnt>res:\n res=cnt\n \nprint(res)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553458544", "date2": "1553458723", "bleu_score": "0.9894737819195992", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 103, "input": "AXCH@TAH\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["n=input() # (0): n=AXCH@TAH\nl=[\"A\",\"T\",\"C\",\"G\"] # (1): l=['A', 'T', 'C', 'G']\nres=0 # (2): res=0\ncnt=0 # (3): cnt=0\n\nfor i in range(len(n)): # (4): i=0 (8): i=1 ... (37): NO CHANGE\n if n[i] in l: # (5): NO CHANGE (9): NO CHANGE ... (33): NO CHANGE\n if cnt>res: # (6): NO CHANGE (15): NO CHANGE ... (29): NO CHANGE\n res=cnt # (30): res=2\n cnt+=1 # (7): cnt=1 (16): cnt=1 ... (31): cnt=3\n else:\n if cnt>res: # (10): NO CHANGE (19): NO CHANGE ... (34): NO CHANGE\n res=cnt # (11): res=1 (35): res=3\n cnt=0 # (12): cnt=0 (36): cnt=0\n \nprint(res)"], "anno_status": [true], "diff_content": " n=input()\n l=[\"A\",\"T\",\"C\",\"G\"]\n res=0\n cnt=0\n \n for i in range(len(n)):\n if n[i] in l:\n+ cnt+=1\n if cnt>res:\n res=cnt\n- cnt+=1\n else:\n+ cnt=0\n if cnt>res:\n res=cnt\n- cnt=0\n \n print(res)\n", "FL_content": "\n n=input()\n l=[\"A\",\"T\",\"C\",\"G\"]\n res=0\n cnt=0\n \n for i in range(len(n)):\n if n[i] in l:\n if cnt>res:\n res=cnt\n cnt+=1\n else:\n if cnt>res:\n res=cnt\n cnt=0\n \n print(res)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u888380104", "problem_id": "p02909", "submission1_id": "s750264236-FL", "submission2_id": "s262709594", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\n\nif S == 'Sunny':\n print('cloudy')\n\nelif S == 'cloudy':\n print('Rainy')\n\nelif S == 'Rainy':\n print('Sunny')\n ", "code2": "S = input()\n\nif S == 'Sunny':\n print('Cloudy')\n\nelif S == 'Cloudy':\n print('Rainy')\n\nelif S =='Rainy':\n print('Sunny')\n\n\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598577922", "date2": "1598578842", "bleu_score": "0.9119487658885977", "code1_test_status": [1, 0], "code1_test_score": 1, "total_score": 2, "input": "Sunny\n", "actual_output": "cloudy\n", "expected_output": "Cloudy\n", "anno_code": ["S = input() # (0): S=Sunny\n\nif S == 'Sunny': # (1): NO CHANGE\n print('cloudy')\n\nelif S == 'cloudy':\n print('Rainy')\n\nelif S == 'Rainy':\n print('Sunny')\n "], "anno_status": [true], "diff_content": " S = input()\n \n if S == 'Sunny':\n- print('cloudy')\n+ print('Cloudy')\n \n-elif S == 'cloudy':\n+elif S == 'Cloudy':\n print('Rainy')\n \n-elif S == 'Rainy':\n+elif S =='Rainy':\n print('Sunny')\n- \n+\n+\n+\n", "FL_content": "\n S = input()\n \n if S == 'Sunny':\n- print('cloudy')\n \n-elif S == 'cloudy':\n print('Rainy')\n \n-elif S == 'Rainy':\n print('Sunny')\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u538381753", "problem_id": "p04039", "submission1_id": "s023550828-FL", "submission2_id": "s991915497", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = [int(x) for x in input().split(' ')]\nd = set(x for x in input().split(' '))\n\nfor i in range(10000):\n if set(str(i)).isdisjoint(d) and i >= n:\n print(i)\n exit()", "code2": "n, k = [int(x) for x in input().split(' ')]\nd = set(x for x in input().split(' '))\n\nfor i in range(100000):\n if set(str(i)).isdisjoint(d) and i >= n:\n print(i)\n exit()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567464287", "date2": "1567464482", "bleu_score": "0.9945203417194042", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 72, "total_score": 94, "input": "20079 1\n-1\n", "actual_output": "no output\n", "expected_output": "20079\n\n", "anno_code": ["n, k = [int(x) for x in input().split(' ')] # (0): n=20079, k=1\nd = set(x for x in input().split(' ')) # (1): d={'-1'}\n\nfor i in range(10000): # (2): i=0 (4): i=1 ... (20000): i=9999\n if set(str(i)).isdisjoint(d) and i >= n: # (3): NO CHANGE (5): NO CHANGE ... (20001): NO CHANGE\n print(i)\n exit()"], "anno_status": [true], "diff_content": " n, k = [int(x) for x in input().split(' ')]\n d = set(x for x in input().split(' '))\n \n-for i in range(10000):\n+for i in range(100000):\n if set(str(i)).isdisjoint(d) and i >= n:\n print(i)\n exit()\n", "FL_content": "\n n, k = [int(x) for x in input().split(' ')]\n-d = set(x for x in input().split(' '))\n \n for i in range(10000):\n if set(str(i)).isdisjoint(d) and i >= n:\n print(i)\n exit()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u827202523", "problem_id": "p04039", "submission1_id": "s169382877-FL", "submission2_id": "s436772052", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def dig_check(i,d):\n for k in [int(j) for j in str(i)]:\n if k in d:\n return False\n return True\n\n\nN,K = input().split()\nN = int(N)\n\nd = [int(i) for i in input().split()]\n\nfor i in range(10001):\n if i >= N :\n if dig_check(i,d):\n print(i)\n break\n\n", "code2": "def dig_check(i,d):\n for k in [int(j) for j in str(i)]:\n if k in d:\n return False\n return True\n\n\nN,K = input().split()\nN = int(N)\n\nd = [int(i) for i in input().split()]\n\nfor i in range(100001):\n if i >= N :\n if dig_check(i,d):\n print(i)\n break\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1537589189", "date2": "1537589558", "bleu_score": "0.9966610552288375", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 72, "total_score": 94, "input": "17212 1\n-1\n", "actual_output": "no output\n", "expected_output": "17212\n\n", "anno_code": ["def dig_check(i,d): # (0): dig_check=\n for k in [int(j) for j in str(i)]:\n if k in d:\n return False\n return True\n\n\nN,K = input().split() # (1): N=17212, K=1\nN = int(N) # (2): N=17212\n\nd = [int(i) for i in input().split()] # (3): d=[-1]\n\nfor i in range(10001): # (4): i=0 (6): i=1 ... (20004): i=10000\n if i >= N : # (5): NO CHANGE (7): NO CHANGE ... (20005): NO CHANGE\n if dig_check(i,d):\n print(i)\n break\n\n"], "anno_status": [true], "diff_content": " def dig_check(i,d):\n for k in [int(j) for j in str(i)]:\n if k in d:\n return False\n return True\n \n \n N,K = input().split()\n N = int(N)\n \n d = [int(i) for i in input().split()]\n \n-for i in range(10001):\n+for i in range(100001):\n if i >= N :\n if dig_check(i,d):\n print(i)\n break\n \n \n", "FL_content": "\n def dig_check(i,d):\n for k in [int(j) for j in str(i)]:\n if k in d:\n return False\n return True\n \n \n N,K = input().split()\n N = int(N)\n \n d = [int(i) for i in input().split()]\n \n-for i in range(10001):\n if i >= N :\n if dig_check(i,d):\n print(i)\n break\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u854931881", "problem_id": "p02639", "submission1_id": "s838409936-FL", "submission2_id": "s274082340", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=list(map(int,input().split()))\nfor i in range(len(n)):\n if n[i]==0:\n print(i)\n break", "code2": "n=list(map(int,input().split()))\nfor i in range(len(n)):\n if n[i]==0:\n print(i+1)\n break", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598462929", "date2": "1598462972", "bleu_score": "0.9601961388479883", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "0\n", "expected_output": "1\n", "anno_code": ["n=list(map(int,input().split())) # (0): n=[0, 2, 3, 4, 5]\nfor i in range(len(n)): # (1): i=0\n if n[i]==0: # (2): NO CHANGE\n print(i) # (3): NO CHANGE\n break"], "anno_status": [true], "diff_content": " n=list(map(int,input().split()))\n for i in range(len(n)):\n if n[i]==0:\n- print(i)\n+ print(i+1)\n break\n", "FL_content": "\n n=list(map(int,input().split()))\n for i in range(len(n)):\n if n[i]==0:\n- print(i)\n break\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u852084108", "problem_id": "p02975", "submission1_id": "s247903623-FL", "submission2_id": "s338792371", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndata = {}\nN = int(input())\nfor i in input().split():\n if i not in data:\n data.update({i: 1})\n else:\n data[str(i)] += 1\n\nok = 0\n\nif len(data.items()) > 3:\n pass\nelif len(data.items()) == 1:\n if list(data.keys())[0] == \"0\":\n ok = 1\nelif len(data.items()) == 2:\n print(data)\n if \"0\" in data.keys() and data[\"0\"] == N/3:\n ok = 1\nelse:\n sum = 0\n for i, count in data.items():\n if not count == N/3:\n ok = -1\n break\n sum = sum ^ int(i)\n if ok == 0 and sum == 0:\n ok = 1\n\nif ok == -1:\n ok = 0\nprint(\"Yes\" if ok else \"No\")\n\n", "code2": "\ndata = {}\nN = int(input())\nfor i in input().split():\n if i not in data:\n data.update({i: 1})\n else:\n data[str(i)] += 1\n\nok = 0\n\nif len(data.keys()) > 3:\n pass\nelif len(data.keys()) == 1:\n if list(data.keys())[0] == \"0\":\n ok = 1\nelif len(data.keys()) == 2:\n if \"0\" in data.keys() and data[\"0\"] == N/3:\n ok = 1\nelse:\n sum = 0\n for i, count in data.items():\n if not count == N/3:\n ok = -1\n break\n sum = sum ^ int(i)\n if ok == 0 and sum == 0:\n ok = 1\n\nif ok == -1:\n ok = 0\nprint(\"Yes\" if ok else \"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566941747", "date2": "1566941911", "bleu_score": "0.9463079136779838", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 51, "total_score": 58, "input": "4\n1 4 1 1\n", "actual_output": "{'1': 3, '4': 1}\nNo\n", "expected_output": "No\n\n", "anno_code": ["\ndata = {} # (0): data={}\nN = int(input()) # (1): N=4\nfor i in input().split(): # (2): i=1 (5): i=4 ... (14): NO CHANGE\n if i not in data: # (3): NO CHANGE (6): NO CHANGE ... (12): NO CHANGE\n data.update({i: 1}) # (4): data={'1': 1} (7): data={'1': 1, '4': 1}\n else:\n data[str(i)] += 1 # (10): data={'1': 2, '4': 1} (13): data={'1': 3, '4': 1}\n\nok = 0 # (15): ok=0\n\nif len(data.items()) > 3: # (16): NO CHANGE\n pass\nelif len(data.items()) == 1: # (17): NO CHANGE\n if list(data.keys())[0] == \"0\":\n ok = 1\nelif len(data.items()) == 2: # (18): NO CHANGE\n print(data) # (19): NO CHANGE\n if \"0\" in data.keys() and data[\"0\"] == N/3: # (20): NO CHANGE\n ok = 1\nelse:\n sum = 0\n for i, count in data.items():\n if not count == N/3:\n ok = -1\n break\n sum = sum ^ int(i)\n if ok == 0 and sum == 0:\n ok = 1\n\nif ok == -1: # (21): NO CHANGE\n ok = 0\nprint(\"Yes\" if ok else \"No\")\n\n"], "anno_status": [true], "diff_content": " \n data = {}\n N = int(input())\n for i in input().split():\n if i not in data:\n data.update({i: 1})\n else:\n data[str(i)] += 1\n \n ok = 0\n \n-if len(data.items()) > 3:\n+if len(data.keys()) > 3:\n pass\n-elif len(data.items()) == 1:\n+elif len(data.keys()) == 1:\n if list(data.keys())[0] == \"0\":\n ok = 1\n-elif len(data.items()) == 2:\n- print(data)\n+elif len(data.keys()) == 2:\n if \"0\" in data.keys() and data[\"0\"] == N/3:\n ok = 1\n else:\n sum = 0\n for i, count in data.items():\n if not count == N/3:\n ok = -1\n break\n sum = sum ^ int(i)\n if ok == 0 and sum == 0:\n ok = 1\n \n if ok == -1:\n ok = 0\n print(\"Yes\" if ok else \"No\")\n \n-\n", "FL_content": "\n \n data = {}\n N = int(input())\n for i in input().split():\n if i not in data:\n data.update({i: 1})\n else:\n data[str(i)] += 1\n \n ok = 0\n \n if len(data.items()) > 3:\n pass\n elif len(data.items()) == 1:\n if list(data.keys())[0] == \"0\":\n ok = 1\n elif len(data.items()) == 2:\n- print(data)\n if \"0\" in data.keys() and data[\"0\"] == N/3:\n ok = 1\n else:\n sum = 0\n for i, count in data.items():\n if not count == N/3:\n ok = -1\n break\n sum = sum ^ int(i)\n if ok == 0 and sum == 0:\n ok = 1\n \n if ok == -1:\n ok = 0\n print(\"Yes\" if ok else \"No\")\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 35 }, { "user_id": "u596421790", "problem_id": "p03892", "submission1_id": "s493244762-FL", "submission2_id": "s003717735", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c,d = map(int, input().split())\n\ndef gcd(u,v):\n while v:\n u,v = v,u%v\n return u\n\ns = c-a\nt = d-b\nu = gcd(s,t)\ns \nt \nprint(u*(s+t-1))", "code2": "a,b,c,d = map(int, input().split())\ndef gcd(u,v):\n while v: u,v = v,u%v\n return u\ns = abs(c-a)\nt = abs(d-b)\nu = gcd(s,t)\nprint(u*((s+t)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580601042", "date2": "1580601250", "bleu_score": "0.8132804338996698", "code1_test_status": [1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 9, "total_score": 100, "input": "32 16 -1 6\n", "actual_output": "44\n", "expected_output": "42\n\n", "anno_code": ["a,b,c,d = map(int, input().split()) # (0): a=32, b=16, c=-1, d=6\n\ndef gcd(u,v): # (1): gcd=\n while v: # (5): NO CHANGE (7): NO CHANGE ... (11): a=32, b=16, c=-1, d=6, gcd=, s=-33, t=-10\n u,v = v,u%v # (6): u=-10, v=-3 (8): u=-3, v=-1 (10): u=-1, v=0\n return u\n\ns = c-a # (2): s=-33\nt = d-b # (3): t=-10\nu = gcd(s,t) # (4): u=-33, v=-10\ns # (12): NO CHANGE\nt # (13): NO CHANGE\nprint(u*(s+t-1))"], "anno_status": [true], "diff_content": " a,b,c,d = map(int, input().split())\n-\n def gcd(u,v):\n- while v:\n- u,v = v,u%v\n+ while v: u,v = v,u%v\n return u\n-\n-s = c-a\n-t = d-b\n+s = abs(c-a)\n+t = abs(d-b)\n u = gcd(s,t)\n-s \n-t \n-print(u*(s+t-1))\n+print(u*((s+t)\n+\n", "FL_content": "\n a,b,c,d = map(int, input().split())\n \n def gcd(u,v):\n while v:\n u,v = v,u%v\n return u\n \n s = c-a\n t = d-b\n u = gcd(s,t)\n-s \n-t \n-print(u*(s+t-1))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u780475861", "problem_id": "p03856", "submission1_id": "s755934755-FL", "submission2_id": "s393470762", "status1": "Wrong Answer", "status2": "Accepted", "code1": "if not input().replace('eraser', '').replace('erase', '').replace('dream', '').replace('dreamer', ''):\n print('Yes')\nelse:\n print('No')", "code2": "if not input().replace('eraser', '').replace('erase', '').replace('dreamer', '').replace('dream', ''):\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589869603", "date2": "1589869692", "bleu_score": "0.9573365533289768", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "Yes\n", "expected_output": "YES\n", "anno_code": ["if not input().replace('eraser', '').replace('erase', '').replace('dream', '').replace('dreamer', ''): # (0): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": "-if not input().replace('eraser', '').replace('erase', '').replace('dream', '').replace('dreamer', ''):\n- print('Yes')\n+if not input().replace('eraser', '').replace('erase', '').replace('dreamer', '').replace('dream', ''):\n+ print('YES')\n else:\n- print('No')\n+ print('NO')\n", "FL_content": "\n-if not input().replace('eraser', '').replace('erase', '').replace('dream', '').replace('dreamer', ''):\n- print('Yes')\n else:\n- print('No')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 4 }, { "user_id": "u595375942", "problem_id": "p03433", "submission1_id": "s808659918-FL", "submission2_id": "s617116672", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nX=int(input())\nc=N&500\nans='Yes' if c <= X else 'No'\nprint(ans)", "code2": "N=int(input())\nX=int(input())\nc=N%500\nans='Yes' if c <= X else 'No'\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575755286", "date2": "1575755399", "bleu_score": "0.9669816961515574", "code1_test_status": [1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 97, "total_score": 103, "input": "2018\n101\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N=int(input()) # (0): N=2018\nX=int(input()) # (1): X=101\nc=N&500 # (2): c=480\nans='Yes' if c <= X else 'No' # (3): ans=No\nprint(ans)"], "anno_status": [true], "diff_content": " N=int(input())\n X=int(input())\n-c=N&500\n+c=N%500\n ans='Yes' if c <= X else 'No'\n print(ans)\n", "FL_content": "\n N=int(input())\n X=int(input())\n-c=N&500\n ans='Yes' if c <= X else 'No'\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u421499233", "problem_id": "p03433", "submission1_id": "s942125315-FL", "submission2_id": "s630501287", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = int(input())\nif N <= A:\n print(\"Yes\")\nelif N - 500 <= A:\n print (\"Yes\")\nelse:\n print(\"No\")\n ", "code2": "N = int(input())\nA = int(input())\nNs = N % 500\nif Ns <= A:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579654912", "date2": "1579655060", "bleu_score": "0.6609208720153253", "code1_test_status": [1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 93, "total_score": 103, "input": "37\n001\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["N = int(input()) # (0): N=37\nA = int(input()) # (1): A=1\nif N <= A: # (2): NO CHANGE\n print(\"Yes\")\nelif N - 500 <= A: # (3): NO CHANGE\n print (\"Yes\")\nelse:\n print(\"No\")\n "], "anno_status": [true], "diff_content": " N = int(input())\n A = int(input())\n-if N <= A:\n+Ns = N % 500\n+if Ns <= A:\n print(\"Yes\")\n-elif N - 500 <= A:\n- print (\"Yes\")\n else:\n print(\"No\")\n- \n", "FL_content": "\n N = int(input())\n-A = int(input())\n if N <= A:\n print(\"Yes\")\n-elif N - 500 <= A:\n print (\"Yes\")\n else:\n print(\"No\")\n- \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u192042624", "problem_id": "p02722", "submission1_id": "s086127594-FL", "submission2_id": "s516180711", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\n\nN = int(input())\n\nnn = int(math.sqrt(N))\n\nans = 0\nfor x in range(2,nn+1):\n\n if N % x > 1:\n continue\n\n if N % x == 1:\n ans += 1\n continue\n \n tmp = N\n while True:\n tmp = tmp / x\n if tmp % x == 1:\n ans += 1\n break\n elif tmp == x :\n ans += 1\n break\n elif tmp % x >= 1:\n break\n\nprint(ans+3)\n\n\n\n\n", "code2": "import math\n\n\nN = int(input())\n\nnn = int(math.sqrt(N))\n\n\nans = 1\nfor x in range(2,nn+1):\n\n if N % x == 1:\n ans += 1\n continue\n \n if N % x > 1:\n continue\n\n tmp = N\n while tmp > x:\n tmp = tmp / x\n if tmp % x == 1 :\n ans += 1\n break\n elif tmp % x > 1 :\n break\n elif tmp == x:\n ans += 1\n break\n\nx = 1\ntmp = N - 1\nwhile tmp / x > nn:\n if tmp % x == 0:\n ans += 1\n x += 1\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586054367", "date2": "1586111920", "bleu_score": "0.7936412039577081", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 8, "total_score": 81, "input": "2777701\n", "actual_output": "38\n", "expected_output": "72\n\n", "anno_code": ["import math\n\n\nN = int(input()) # (0): N=2777701\n\nnn = int(math.sqrt(N)) # (1): nn=1666\n\nans = 0 # (2): ans=0\nfor x in range(2,nn+1): # (3): x=2 (8): x=3 ... (5087): NO CHANGE\n\n if N % x > 1: # (4): NO CHANGE (9): NO CHANGE ... (5085): NO CHANGE\n continue # (30): NO CHANGE (33): NO CHANGE ... (5086): NO CHANGE\n\n if N % x == 1: # (5): NO CHANGE (10): NO CHANGE ... (4316): NO CHANGE\n ans += 1 # (6): ans=1 (11): ans=2 ... (4317): ans=35\n continue # (7): NO CHANGE (12): NO CHANGE ... (4318): NO CHANGE\n \n tmp = N # (133): tmp=2777701 (4187): tmp=2777701\n while True: # (134): NO CHANGE (139): NO CHANGE (4188): NO CHANGE\n tmp = tmp / x # (135): tmp=75073.0 (140): tmp=2029.0 (4189): tmp=2029.0\n if tmp % x == 1: # (136): NO CHANGE (141): NO CHANGE (4190): NO CHANGE\n ans += 1\n break\n elif tmp == x : # (137): NO CHANGE (142): NO CHANGE (4191): NO CHANGE\n ans += 1\n break\n elif tmp % x >= 1: # (138): NO CHANGE (143): NO CHANGE (4192): NO CHANGE\n break # (144): NO CHANGE (4193): NO CHANGE\n\nprint(ans+3)\n\n\n\n\n"], "anno_status": [true], "diff_content": " import math\n \n \n N = int(input())\n \n nn = int(math.sqrt(N))\n \n-ans = 0\n-for x in range(2,nn+1):\n \n- if N % x > 1:\n- continue\n+ans = 1\n+for x in range(2,nn+1):\n \n if N % x == 1:\n ans += 1\n continue\n \n+ if N % x > 1:\n+ continue\n+\n tmp = N\n- while True:\n+ while tmp > x:\n tmp = tmp / x\n- if tmp % x == 1:\n+ if tmp % x == 1 :\n ans += 1\n break\n- elif tmp == x :\n- ans += 1\n+ elif tmp % x > 1 :\n break\n- elif tmp % x >= 1:\n+ elif tmp == x:\n+ ans += 1\n break\n \n-print(ans+3)\n-\n-\n-\n+x = 1\n+tmp = N - 1\n+while tmp / x > nn:\n+ if tmp % x == 0:\n+ ans += 1\n+ x += 1\n \n+print(ans)\n \n", "FL_content": "\n import math\n \n \n N = int(input())\n \n nn = int(math.sqrt(N))\n \n ans = 0\n for x in range(2,nn+1):\n \n if N % x > 1:\n continue\n \n if N % x == 1:\n ans += 1\n continue\n \n tmp = N\n while True:\n tmp = tmp / x\n- if tmp % x == 1:\n ans += 1\n break\n elif tmp == x :\n ans += 1\n break\n elif tmp % x >= 1:\n break\n \n print(ans+3)\n \n \n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 35 }, { "user_id": "u052499405", "problem_id": "p03880", "submission1_id": "s494428707-FL", "submission2_id": "s199578019", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nxor = 0\nrank = [0] * 35 \nfor i in range(n):\n a = int(input())\n LSB = (a & -a).bit_length()\n rank[LSB] += 1\n xor ^= a \n\nprev = False \nans = 0\nfor i in range(33, -1, -1):\n bit = xor & (1 << i)\n if bit ^ prev:\n if rank[i+1] == 0:\n print(-1)\n exit()\n else:\n ans += 1\n prev = bit\nprint(ans)", "code2": "n = int(input())\nxor = 0\nrank = [0] * 35 \nfor i in range(n):\n a = int(input())\n LSB = (a & -a).bit_length()\n rank[LSB] += 1\n xor ^= a \n\nprev = False \nans = 0\nfor i in range(33, -1, -1):\n bit = xor & (1 << i)\n if (bit > 0 and prev == 0) or (bit == 0 and prev > 0):\n if rank[i+1] == 0:\n print(-1)\n exit()\n else:\n ans += 1\n prev = bit\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566944422", "date2": "1566945050", "bleu_score": "0.8885527757346167", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 83, "total_score": 89, "input": "3\n3\n5\n8\n", "actual_output": "-1\n", "expected_output": "2\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " n = int(input())\n xor = 0\n rank = [0] * 35 \n for i in range(n):\n a = int(input())\n LSB = (a & -a).bit_length()\n rank[LSB] += 1\n xor ^= a \n \n prev = False \n ans = 0\n for i in range(33, -1, -1):\n bit = xor & (1 << i)\n- if bit ^ prev:\n+ if (bit > 0 and prev == 0) or (bit == 0 and prev > 0):\n if rank[i+1] == 0:\n print(-1)\n exit()\n else:\n ans += 1\n prev = bit\n print(ans)\n", "FL_content": "\n n = int(input())\n xor = 0\n rank = [0] * 35 \n for i in range(n):\n a = int(input())\n LSB = (a & -a).bit_length()\n rank[LSB] += 1\n xor ^= a \n \n prev = False \n ans = 0\n for i in range(33, -1, -1):\n bit = xor & (1 << i)\n if bit ^ prev:\n- if rank[i+1] == 0:\n print(-1)\n exit()\n else:\n ans += 1\n prev = bit\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 21 }, { "user_id": "u185948224", "problem_id": "p03380", "submission1_id": "s159628753-FL", "submission2_id": "s163416319", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\n\nai = max(a)\naj = min(a)\n\nfor i in a:\n if aj < min(i, ai - i):\n aj = i\n \nprint(ai, aj)", "code2": "n = int(input())\na = list(map(int, input().split()))\n\nai = max(a)\naj = min(a)\n\nfor i in a:\n if min(aj, ai -aj) < min(i, ai - i):\n aj = i\n \nprint(ai, aj)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589032652", "date2": "1589033417", "bleu_score": "0.9050132673048904", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 100, "input": "5\n8 1 1 -1 1\n", "actual_output": "8 8\n", "expected_output": "8 1\n\n", "anno_code": ["n = int(input()) # (0): n=5\na = list(map(int, input().split())) # (1): a=[8, 1, 1, -1, 1]\n\nai = max(a) # (2): ai=8\naj = min(a) # (3): aj=-1\n\nfor i in a: # (4): i=8 (7): i=1 ... (15): NO CHANGE\n if aj < min(i, ai - i): # (5): NO CHANGE (8): NO CHANGE ... (14): NO CHANGE\n aj = i # (6): aj=8\n \nprint(ai, aj)"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n \n ai = max(a)\n aj = min(a)\n \n for i in a:\n- if aj < min(i, ai - i):\n+ if min(aj, ai -aj) < min(i, ai - i):\n aj = i\n \n print(ai, aj)\n", "FL_content": "\n n = int(input())\n a = list(map(int, input().split()))\n \n ai = max(a)\n aj = min(a)\n \n-for i in a:\n- if aj < min(i, ai - i):\n- aj = i\n- \n print(ai, aj)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u301337088", "problem_id": "p02933", "submission1_id": "s544485610-FL", "submission2_id": "s878352844", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\na = int(input())\n\nif a >= 3200:\n print('pink')\n\nelif a < 3200:\n print('red')", "code2": "a = int(input())\ns = input()\n\nif a < 3200:\n print('red')\n\nelse:\n print(s)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598289615", "date2": "1598291400", "bleu_score": "0.7289791507927132", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 3, "total_score": 103, "input": "4049\nrdc\n", "actual_output": "pink\n", "expected_output": "rdc\n\n", "anno_code": ["\n\n\n\na = int(input()) # (0): a=4049\n\nif a >= 3200: # (1): NO CHANGE\n print('pink')\n\nelif a < 3200:\n print('red')"], "anno_status": [true], "diff_content": "-\n-\n-\n-\n a = int(input())\n+s = input()\n \n-if a >= 3200:\n- print('pink')\n-\n-elif a < 3200:\n+if a < 3200:\n print('red')\n+\n+else:\n+ print(s)\n", "FL_content": "\n \n \n \n \n a = int(input())\n \n if a >= 3200:\n- print('pink')\n \n elif a < 3200:\n print('red')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u519227872", "problem_id": "p02276", "submission1_id": "s911280967-FL", "submission2_id": "s531932459", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nA = list(map(int, input().split()))\n\ndef partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n\ni = partition(A, 0, n-1)\nprint(' '.join(map(str, A[:i])) + ' [' + str(A[i]) + '] ' + ' '.join(map(str, A[i:])))", "code2": "n = int(input())\nA = list(map(int, input().split()))\n\ndef partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n\ni = partition(A, 0, n-1)\nprint(' '.join(map(str, A[:i])) + ' [' + str(A[i]) + '] ' + ' '.join(map(str, A[i+1:])))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1502019536", "date2": "1502019578", "bleu_score": "0.9906155308368195", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "12\n74 19 6 2 12 7 0 5 21 -1 10 22\n", "actual_output": "19 6 2 12 7 0 5 21 -1 10 [22] 22 74\n", "expected_output": "19 6 2 12 7 0 5 21 -1 10 [22] 74\n\n", "anno_code": ["n = int(input()) # (0): n=12\nA = list(map(int, input().split())) # (1): A=[74, 19, 6, 2, 12, 7, 0, 5, 21, -1, 10, 22]\n\ndef partition(A, p, r): # (2): partition=\n x = A[r] # (4): x=22\n i = p - 1 # (5): i=-1\n for j in range(p, r): # (6): j=0 (8): j=1 ... (48): NO CHANGE\n if A[j] <= x: # (7): NO CHANGE (9): NO CHANGE ... (45): NO CHANGE\n i += 1 # (10): i=0 (14): i=1 ... (46): i=9\n A[i], A[j] = A[j], A[i] # (11): A=[19, 74, 6, 2, 12, 7, 0, 5, 21, -1, 10, 22] (15): A=[19, 6, 74, 2, 12, 7, 0, 5, 21, -1, 10, 22] ... (47): A=[19, 6, 2, 12, 7, 0, 5, 21, -1, 10, 74, 22]\n A[i + 1], A[r] = A[r], A[i + 1] # (49): n=12, A=[19, 6, 2, 12, 7, 0, 5, 21, -1, 10, 22, 74], partition=, i=10\n return i + 1\n\ni = partition(A, 0, n-1) # (3): p=0, r=11\nprint(' '.join(map(str, A[:i])) + ' [' + str(A[i]) + '] ' + ' '.join(map(str, A[i:])))"], "anno_status": [true], "diff_content": " n = int(input())\n A = list(map(int, input().split()))\n \n def partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n \n i = partition(A, 0, n-1)\n-print(' '.join(map(str, A[:i])) + ' [' + str(A[i]) + '] ' + ' '.join(map(str, A[i:])))\n+print(' '.join(map(str, A[:i])) + ' [' + str(A[i]) + '] ' + ' '.join(map(str, A[i+1:])))\n", "FL_content": "\n n = int(input())\n A = list(map(int, input().split()))\n \n def partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n \n i = partition(A, 0, n-1)\n-print(' '.join(map(str, A[:i])) + ' [' + str(A[i]) + '] ' + ' '.join(map(str, A[i:])))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u377989038", "problem_id": "p02720", "submission1_id": "s171501051-FL", "submission2_id": "s076495420", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def dfs(r):\n global l\n if len(r) == 11:\n return\n l.append(int(r))\n for i in range(-1, 2):\n tmp = int(r[-1]) + i\n if 0 <= tmp <= 9:\n dfs(r + str(tmp))\n\n\nk = int(input())\nl = []\nfor i in range(1, 10):\n dfs(str(i))\nprint(sorted(l)[k])", "code2": "def dfs(r):\n global l\n if len(r) == 11:\n return\n l.append(int(r))\n for i in range(-1, 2):\n tmp = int(r[-1]) + i\n if 0 <= tmp <= 9:\n dfs(r + str(tmp))\n\n\nk = int(input())\nl = []\nfor i in range(1, 10):\n dfs(str(i))\nprint(sorted(l)[k - 1])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588648081", "date2": "1588648551", "bleu_score": "0.9812673671160095", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "179\n", "actual_output": "3443\n", "expected_output": "3434\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " def dfs(r):\n global l\n if len(r) == 11:\n return\n l.append(int(r))\n for i in range(-1, 2):\n tmp = int(r[-1]) + i\n if 0 <= tmp <= 9:\n dfs(r + str(tmp))\n \n \n k = int(input())\n l = []\n for i in range(1, 10):\n dfs(str(i))\n-print(sorted(l)[k])\n+print(sorted(l)[k - 1])\n", "FL_content": "\n def dfs(r):\n global l\n- if len(r) == 11:\n return\n l.append(int(r))\n for i in range(-1, 2):\n tmp = int(r[-1]) + i\n if 0 <= tmp <= 9:\n dfs(r + str(tmp))\n \n \n k = int(input())\n l = []\n for i in range(1, 10):\n dfs(str(i))\n print(sorted(l)[k])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u536017058", "problem_id": "p02536", "submission1_id": "s052588276-FL", "submission2_id": "s850695324", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class UnionFind:\n __slots__ = [\"_data_size\", \"_roots\"]\n \n def __init__(self, data_size: int) -> None:\n self._data_size = data_size\n self._roots = [-1] * data_size\n \n def __getitem__(self, x: int) -> int:\n while self._roots[x] >= 0:\n x = self._roots[x]\n return x\n \n def is_connected(self, x: int, y: int) -> bool:\n return self[x] == self[y]\n \n def unite(self, x: int, y: int) -> None:\n x, y = self[x], self[y]\n if x == y:\n return\n if self._roots[x] > self._roots[y]:\n x, y = y, x\n self._roots[x] += self._roots[y]\n self._roots[y] = x\n \n \nimport sys\n \nreadline = sys.stdin.readline\n \nN, Q = map(int, readline().split())\ntree = UnionFind(N)\nres = []\nans=0\nfor _ in range(Q):\n u, v = map(int, readline().split())\n tree.unite(u-1, v-1)\nfor u in range(1,N):\n \n if not tree.is_connected(u, 0):\n ans+=1\n tree.unite(u-1, 0)\nprint(ans)\n", "code2": "class UnionFind:\n __slots__ = [\"_data_size\", \"_roots\"]\n \n def __init__(self, data_size: int) -> None:\n self._data_size = data_size\n self._roots = [-1] * data_size\n \n def __getitem__(self, x: int) -> int:\n while self._roots[x] >= 0:\n x = self._roots[x]\n return x\n \n def is_connected(self, x: int, y: int) -> bool:\n return self[x] == self[y]\n \n def unite(self, x: int, y: int) -> None:\n x, y = self[x], self[y]\n if x == y:\n return\n if self._roots[x] > self._roots[y]:\n x, y = y, x\n self._roots[x] += self._roots[y]\n self._roots[y] = x\n \n \nimport sys\n \nreadline = sys.stdin.readline\n \nN, Q = map(int, readline().split())\ntree = UnionFind(N)\nres = []\nans=0\nfor _ in range(Q):\n u, v = map(int, readline().split())\n tree.unite(u-1, v-1)\nfor u in range(1,N):\n if not tree.is_connected(u, 0):\n ans+=1\n tree.unite(u, 0)\nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601170975", "date2": "1601171158", "bleu_score": "0.99319687513348", "code1_test_status": [1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 83, "total_score": 90, "input": "6 1\n3 4\n", "actual_output": "5\n", "expected_output": "4\n\n", "anno_code": ["class UnionFind: # (0): UnionFind=, sys=\n __slots__ = [\"_data_size\", \"_roots\"]\n \n def __init__(self, data_size: int) -> None:\n self._data_size = data_size # (4): NO CHANGE\n self._roots = [-1] * data_size # (5): UnionFind=, sys=, readline=, N=6, Q=1, tree=\n \n def __getitem__(self, x: int) -> int:\n while self._roots[x] >= 0: # (12): x=3 (13): x=2, y=3 ... (99): x=4, y=2\n x = self._roots[x] # (46): x=2 (49): x=1 ... (98): x=2\n return x\n \n def is_connected(self, x: int, y: int) -> bool:\n return self[x] == self[y]\n \n def unite(self, x: int, y: int) -> None:\n x, y = self[x], self[y] # (11): NO CHANGE (25): NO CHANGE ... (93): NO CHANGE\n if x == y: # (14): NO CHANGE (28): NO CHANGE ... (100): NO CHANGE\n return # (29): UnionFind=, sys=, readline=, N=6, Q=1, tree=, res=[], ans=1, _=0, u=1, v=4 (82): UnionFind=, sys=, readline=, N=6, Q=1, tree=, res=[], ans=4, _=0, u=4, v=4\n if self._roots[x] > self._roots[y]: # (15): NO CHANGE (40): NO CHANGE ... (101): NO CHANGE\n x, y = y, x # (102): x=2, y=4\n self._roots[x] += self._roots[y] # (16): NO CHANGE (41): NO CHANGE ... (103): NO CHANGE\n self._roots[y] = x # (17): UnionFind=, sys=, readline=, N=6, Q=1, tree=, res=[], ans=0, _=0, u=3, v=4 (42): UnionFind=, sys=, readline=, N=6, Q=1, tree=, res=[], ans=2, _=0, u=2, v=4 ... (104): UnionFind=, sys=, readline=, N=6, Q=1, tree=, res=[], ans=5, _=0, u=5, v=4\n \n \nimport sys\n \nreadline = sys.stdin.readline # (1): readline=\n \nN, Q = map(int, readline().split()) # (2): N=6, Q=1\ntree = UnionFind(N) # (3): self=, data_size=6\nres = [] # (6): res=[]\nans=0 # (7): ans=0\nfor _ in range(Q): # (8): _=0 (18): NO CHANGE\n u, v = map(int, readline().split()) # (9): u=3, v=4\n tree.unite(u-1, v-1) # (10): self=, x=2, y=3\nfor u in range(1,N): # (19): u=1 (30): u=2 ... (105): NO CHANGE\n \n if not tree.is_connected(u, 0): # (20): self=, x=1 (31): self=, x=2 ... (84): self=, x=5\n ans+=1 # (23): ans=1 (34): ans=2 ... (91): ans=5\n tree.unite(u-1, 0) # (24): self=, x=0, y=0 (35): self=, x=1, y=0 ... (92): self=, x=4, y=0\nprint(ans)\n"], "anno_status": [false], "diff_content": " class UnionFind:\n __slots__ = [\"_data_size\", \"_roots\"]\n \n def __init__(self, data_size: int) -> None:\n self._data_size = data_size\n self._roots = [-1] * data_size\n \n def __getitem__(self, x: int) -> int:\n while self._roots[x] >= 0:\n x = self._roots[x]\n return x\n \n def is_connected(self, x: int, y: int) -> bool:\n return self[x] == self[y]\n \n def unite(self, x: int, y: int) -> None:\n x, y = self[x], self[y]\n if x == y:\n return\n if self._roots[x] > self._roots[y]:\n x, y = y, x\n self._roots[x] += self._roots[y]\n self._roots[y] = x\n \n \n import sys\n \n readline = sys.stdin.readline\n \n N, Q = map(int, readline().split())\n tree = UnionFind(N)\n res = []\n ans=0\n for _ in range(Q):\n u, v = map(int, readline().split())\n tree.unite(u-1, v-1)\n for u in range(1,N):\n- \n if not tree.is_connected(u, 0):\n ans+=1\n- tree.unite(u-1, 0)\n+ tree.unite(u, 0)\n print(ans)\n \n", "FL_content": "\n class UnionFind:\n __slots__ = [\"_data_size\", \"_roots\"]\n \n def __init__(self, data_size: int) -> None:\n self._data_size = data_size\n self._roots = [-1] * data_size\n \n def __getitem__(self, x: int) -> int:\n while self._roots[x] >= 0:\n x = self._roots[x]\n return x\n \n def is_connected(self, x: int, y: int) -> bool:\n return self[x] == self[y]\n \n def unite(self, x: int, y: int) -> None:\n x, y = self[x], self[y]\n if x == y:\n return\n if self._roots[x] > self._roots[y]:\n x, y = y, x\n self._roots[x] += self._roots[y]\n self._roots[y] = x\n \n \n import sys\n \n readline = sys.stdin.readline\n \n N, Q = map(int, readline().split())\n tree = UnionFind(N)\n-res = []\n ans=0\n for _ in range(Q):\n u, v = map(int, readline().split())\n tree.unite(u-1, v-1)\n-for u in range(1,N):\n- \n- if not tree.is_connected(u, 0):\n- ans+=1\n- tree.unite(u-1, 0)\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 43 }, { "user_id": "u077337864", "problem_id": "p03945", "submission1_id": "s621346883-FL", "submission2_id": "s118575716", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input().strip()\n\nprev = None\nans1, ans2 = 0, 0\nfor _s in s:\n if prev is None:\n prev = _s\n elif prev != _s:\n ans1 += 1\n prev = _s\nprev = None\nfor _s in s[::-1]:\n if prev is None:\n prev = _s\n elif prev != _s:\n ans1 += 1\n prev = _s\nprint(min(ans1, ans2))", "code2": "s = input().strip()\n\nprev = None\nans1, ans2 = 0, 0\nfor _s in s:\n if prev is None:\n prev = _s\n elif prev != _s:\n ans1 += 1\n prev = _s\nprev = None\nfor _s in s[::-1]:\n if prev is None:\n prev = _s\n elif prev != _s:\n ans2 += 1\n prev = _s\nprint(min(ans1, ans2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1547555871", "date2": "1547555902", "bleu_score": "0.9909005086067052", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 1, "total_score": 103, "input": "WWXUXW\n", "actual_output": "0\n", "expected_output": "4\n\n", "anno_code": ["s = input().strip() # (0): s=WWXUXW\n\nprev = None # (1): prev=None\nans1, ans2 = 0, 0 # (2): ans1=0, ans2=0\nfor _s in s: # (3): _s=W (6): NO CHANGE ... (29): NO CHANGE\n if prev is None: # (4): NO CHANGE (7): NO CHANGE ... (25): NO CHANGE\n prev = _s # (5): prev=W\n elif prev != _s: # (8): NO CHANGE (11): NO CHANGE ... (26): NO CHANGE\n ans1 += 1 # (12): ans1=1 (17): ans1=2 ... (27): ans1=4\n prev = _s # (13): prev=X (18): prev=U ... (28): prev=W\nprev = None # (30): prev=None\nfor _s in s[::-1]: # (31): NO CHANGE (34): _s=X ... (57): NO CHANGE\n if prev is None: # (32): NO CHANGE (35): NO CHANGE ... (55): NO CHANGE\n prev = _s # (33): prev=W\n elif prev != _s: # (36): NO CHANGE (41): NO CHANGE ... (56): NO CHANGE\n ans1 += 1 # (37): ans1=5 (42): ans1=6 ... (52): ans1=8\n prev = _s # (38): prev=X (43): prev=U ... (53): prev=W\nprint(min(ans1, ans2))"], "anno_status": [true], "diff_content": " s = input().strip()\n \n prev = None\n ans1, ans2 = 0, 0\n for _s in s:\n if prev is None:\n prev = _s\n elif prev != _s:\n ans1 += 1\n prev = _s\n prev = None\n for _s in s[::-1]:\n if prev is None:\n prev = _s\n elif prev != _s:\n- ans1 += 1\n+ ans2 += 1\n prev = _s\n print(min(ans1, ans2))\n", "FL_content": "\n s = input().strip()\n \n prev = None\n ans1, ans2 = 0, 0\n for _s in s:\n if prev is None:\n prev = _s\n elif prev != _s:\n ans1 += 1\n prev = _s\n prev = None\n for _s in s[::-1]:\n if prev is None:\n prev = _s\n elif prev != _s:\n ans1 += 1\n prev = _s\n-print(min(ans1, ans2))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u515647766", "problem_id": "p02722", "submission1_id": "s254348205-FL", "submission2_id": "s546102049", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def divisor(n):\n list1 = []\n for i in range(1, int(n ** (0.5)) + 1):\n if n % i == 0:\n list1.append(i)\n list1.append(int(n / i))\n list1 = list(set(list1))\n return len(list1) - 1\n\ndef function(n):\n ans = 0\n if n >= 2:\n ans += 1\n for i in range(2, int(n ** (0.5)) + 1):\n m = n\n if m % i == 0:\n while m % i == 0:\n m = int(m / i)\n ans += divisor(m)\n ans += divisor(n - 1)\n return ans\nn = int(input())\nprint(function(n))", "code2": "def divisor(n):\n list1 = []\n for i in range(1, int(n ** (0.5)) + 1):\n if n % i == 0:\n list1.append(i)\n list1.append(int(n / i))\n list1 = list(set(list1))\n return len(list1) - 1\n\ndef function(n):\n ans = 0\n if n >= 2:\n ans += 1\n for i in range(2, int(n ** (0.5)) + 1):\n m = n\n if m % i == 0:\n while m % i == 0:\n m = int(m / i)\n if m % i == 1:\n ans += 1\n ans += divisor(n - 1)\n return ans\nn = int(input())\nprint(function(n))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589076703", "date2": "1589077368", "bleu_score": "0.9478163249273924", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0], "code1_test_score": 11, "total_score": 81, "input": "7705668993\n", "actual_output": "545\n", "expected_output": "64\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " def divisor(n):\n list1 = []\n for i in range(1, int(n ** (0.5)) + 1):\n if n % i == 0:\n list1.append(i)\n list1.append(int(n / i))\n list1 = list(set(list1))\n return len(list1) - 1\n \n def function(n):\n ans = 0\n if n >= 2:\n ans += 1\n for i in range(2, int(n ** (0.5)) + 1):\n m = n\n if m % i == 0:\n while m % i == 0:\n m = int(m / i)\n- ans += divisor(m)\n+ if m % i == 1:\n+ ans += 1\n ans += divisor(n - 1)\n return ans\n n = int(input())\n print(function(n))\n", "FL_content": "\n def divisor(n):\n list1 = []\n for i in range(1, int(n ** (0.5)) + 1):\n if n % i == 0:\n list1.append(i)\n list1.append(int(n / i))\n list1 = list(set(list1))\n return len(list1) - 1\n \n def function(n):\n ans = 0\n if n >= 2:\n ans += 1\n- for i in range(2, int(n ** (0.5)) + 1):\n m = n\n if m % i == 0:\n while m % i == 0:\n m = int(m / i)\n ans += divisor(m)\n ans += divisor(n - 1)\n return ans\n n = int(input())\n print(function(n))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 23 }, { "user_id": "u970308980", "problem_id": "p03545", "submission1_id": "s060747056-FL", "submission2_id": "s602313531", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input().rstrip()\nop = ['+', '-', '*', '/']\nfor op1 in op:\n for op2 in op:\n for op3 in op:\n func = S[0] + op1 + S[1] + op2 + S[2] + op3 + S[3]\n res = 0\n try:\n res = eval(func)\n except:\n pass\n if res == 7:\n print(func + '=7')\n exit()\n", "code2": "S = input().rstrip()\nop = ['+', '-']\nfor op1 in op:\n for op2 in op:\n for op3 in op:\n res = 0\n try:\n func = S[0] + op1 + S[1] + op2 + S[2] + op3 + S[3]\n res = eval(func)\n except:\n pass\n if res == 7:\n print(func + '=7')\n exit()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566262351", "date2": "1566262931", "bleu_score": "0.9713977399403594", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 99, "input": "6120\n", "actual_output": "6+1+2*0=7\n", "expected_output": "6-1+2+0=7\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " S = input().rstrip()\n-op = ['+', '-', '*', '/']\n+op = ['+', '-']\n for op1 in op:\n for op2 in op:\n for op3 in op:\n- func = S[0] + op1 + S[1] + op2 + S[2] + op3 + S[3]\n res = 0\n try:\n+ func = S[0] + op1 + S[1] + op2 + S[2] + op3 + S[3]\n res = eval(func)\n except:\n pass\n if res == 7:\n print(func + '=7')\n exit()\n \n", "FL_content": "\n S = input().rstrip()\n op = ['+', '-', '*', '/']\n for op1 in op:\n for op2 in op:\n for op3 in op:\n func = S[0] + op1 + S[1] + op2 + S[2] + op3 + S[3]\n res = 0\n try:\n res = eval(func)\n except:\n pass\n if res == 7:\n print(func + '=7')\n exit()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u178432859", "problem_id": "p03377", "submission1_id": "s433922922-FL", "submission2_id": "s439232937", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, x = map(int, input().split())\nif a+b-1 >= x:\n print(\"YES\")\nelse:\n print(\"NO\")", "code2": "a, b, x = map(int, input().split())\nif a > x:\n print(\"NO\")\nelif a+b >= x:\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1578550337", "date2": "1578550460", "bleu_score": "0.739861677696476", "code1_test_status": [1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0], "code1_test_score": 60, "total_score": 87, "input": "4 1 1\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["a, b, x = map(int, input().split()) # (0): a=4, b=1, x=1\nif a+b-1 >= x: # (1): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")"], "anno_status": [true], "diff_content": " a, b, x = map(int, input().split())\n-if a+b-1 >= x:\n+if a > x:\n+ print(\"NO\")\n+elif a+b >= x:\n print(\"YES\")\n else:\n print(\"NO\")\n", "FL_content": "\n a, b, x = map(int, input().split())\n-if a+b-1 >= x:\n print(\"YES\")\n else:\n print(\"NO\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u591717585", "problem_id": "p03643", "submission1_id": "s070466637-FL", "submission2_id": "s710873673", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print(\"ABC\",input())", "code2": "print(\"ABC\"+input())", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571370854", "date2": "1571370872", "bleu_score": "0.8578928092681435", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "-84\n", "actual_output": "ABC -84\n", "expected_output": "ABC-84\n\n", "anno_code": ["print(\"ABC\",input())"], "anno_status": [true], "diff_content": "-print(\"ABC\",input())\n+print(\"ABC\"+input())\n", "FL_content": "\n-print(\"ABC\",input())\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 1 }, { "user_id": "u026155812", "problem_id": "p03730", "submission1_id": "s887101206-FL", "submission2_id": "s471526267", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = [int(i) for i in input().split()]\na = 0\n\nfor i in range(B):\n if A*i%B == C:\n a += 1\n print('YES')\nif a == 0:\n print('NO')", "code2": "A, B, C = [int(i) for i in input().split()]\n\nfor i in range(B):\n if (A*i)%B == C:\n print('YES')\n break\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1544296943", "date2": "1544297275", "bleu_score": "0.8134678484881147", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 81, "total_score": 92, "input": "459 30 0\n", "actual_output": "YES\nYES\nYES\n", "expected_output": "YES\n\n", "anno_code": ["A, B, C = [int(i) for i in input().split()] # (0): A=459, B=30, C=0\na = 0 # (1): a=0\n\nfor i in range(B): # (2): i=0 (6): i=1 ... (68): NO CHANGE\n if A*i%B == C: # (3): NO CHANGE (7): NO CHANGE ... (67): NO CHANGE\n a += 1 # (4): a=1 (26): a=2 (48): a=3\n print('YES') # (5): NO CHANGE (27): NO CHANGE (49): NO CHANGE\nif a == 0:\n print('NO')"], "anno_status": [true], "diff_content": " A, B, C = [int(i) for i in input().split()]\n-a = 0\n \n for i in range(B):\n- if A*i%B == C:\n- a += 1\n+ if (A*i)%B == C:\n print('YES')\n-if a == 0:\n+ break\n+else:\n print('NO')\n", "FL_content": "\n A, B, C = [int(i) for i in input().split()]\n a = 0\n \n-for i in range(B):\n- if A*i%B == C:\n a += 1\n- print('YES')\n if a == 0:\n print('NO')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u612721349", "problem_id": "p03556", "submission1_id": "s743762565-FL", "submission2_id": "s035344807", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print((lambda x:max([i*i for i in range(10001) if x>=i]))(int(input())))", "code2": "print((lambda x:max([i*i for i in range(100001) if x>=i*i]))(int(input())))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1516110204", "date2": "1516110525", "bleu_score": "0.9487277412175072", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 83, "input": "473588\n", "actual_output": "100000000\n", "expected_output": "473344\n\n", "anno_code": ["print((lambda x:max([i*i for i in range(10001) if x>=i]))(int(input())))"], "anno_status": [true], "diff_content": "-print((lambda x:max([i*i for i in range(10001) if x>=i]))(int(input())))\n+print((lambda x:max([i*i for i in range(100001) if x>=i*i]))(int(input())))\n", "FL_content": "\n-print((lambda x:max([i*i for i in range(10001) if x>=i]))(int(input())))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 1 }, { "user_id": "u859210968", "problem_id": "p03338", "submission1_id": "s990749763-FL", "submission2_id": "s083353733", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nS = str(input())\n\nM = 0\nfor n in range(1,N) :\n set1 = set([])\n set2 = set([])\n I = set([])\n for c in (S[:n]) :\n set1.add(c)\n for d in (S[n+1:]) :\n set2.add(d)\n I = set1 & set2\n if(len(I)>M) :\n M = len(I)\nprint(M)", "code2": "N = int(input())\nS = str(input())\n\nM = 0\nfor n in range(1,N) :\n set1 = set([])\n set2 = set([])\n I = set([])\n for c in (S[:n]) :\n set1.add(c)\n for d in (S[n:]) :\n set2.add(d)\n I = set1 & set2\n if(len(I)>M) :\n M = len(I)\nprint(M)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1527386532", "date2": "1527386603", "bleu_score": "0.9870004318408176", "code1_test_status": [1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1], "code1_test_score": 64, "total_score": 103, "input": "6\ncaacb^\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["N = int(input()) # (0): N=6\nS = str(input()) # (1): S=caacb^\n\nM = 0 # (2): M=0\nfor n in range(1,N) : # (3): n=1 (22): n=2 ... (94): NO CHANGE\n set1 = set([]) # (4): set1=set() (23): set1=set() ... (77): set1=set()\n set2 = set([]) # (5): set2=set() (24): set2=set() ... (78): set2=set()\n I = set([]) # (6): I=set() (25): I=set() ... (79): NO CHANGE\n for c in (S[:n]) : # (7): c=c (9): NO CHANGE ... (90): NO CHANGE\n set1.add(c) # (8): set1={'c'} (27): set1={'c'} ... (89): set1={'c', 'a', 'b'}\n for d in (S[n+1:]) : # (10): d=a (12): d=c ... (91): NO CHANGE\n set2.add(d) # (11): set2={'a'} (13): set2={'c', 'a'} ... (72): set2={'^'}\n I = set1 & set2 # (19): I={'c'} (38): I={'c'} ... (92): NO CHANGE\n if(len(I)>M) : # (20): NO CHANGE (39): NO CHANGE ... (93): NO CHANGE\n M = len(I) # (21): M=1\nprint(M)"], "anno_status": [true], "diff_content": " N = int(input())\n S = str(input())\n \n M = 0\n for n in range(1,N) :\n set1 = set([])\n set2 = set([])\n I = set([])\n for c in (S[:n]) :\n set1.add(c)\n- for d in (S[n+1:]) :\n+ for d in (S[n:]) :\n set2.add(d)\n I = set1 & set2\n if(len(I)>M) :\n M = len(I)\n print(M)\n", "FL_content": "\n N = int(input())\n S = str(input())\n \n M = 0\n-for n in range(1,N) :\n set1 = set([])\n set2 = set([])\n I = set([])\n for c in (S[:n]) :\n set1.add(c)\n for d in (S[n+1:]) :\n set2.add(d)\n I = set1 & set2\n if(len(I)>M) :\n M = len(I)\n print(M)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u690700473", "problem_id": "p03558", "submission1_id": "s620547233-FL", "submission2_id": "s021949960", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\n\n\ndef solve(K):\n s = 1\n q = deque()\n q.append(s)\n dists = {}\n dists[s] = 1\n while len(q) > 0:\n n = q.pop()\n if n == 0:\n break\n m = (n*10)%K\n if m not in dists:\n dists[m] = dists[n]\n q.append(m)\n if dists[m] > dists[n]:\n dists[m] = dists[n]\n if n % 10 != 9:\n m = (n+1)%K\n if m not in dists:\n dists[m] = dists[n] + 1\n q.appendleft(m)\n if dists[m] > dists[n] + 1:\n dists[m] = dists[n] + 1\n return dists[0]\n\n\ndef main():\n K = int(input())\n print(solve(K))\n\n\nif __name__ == '__main__':\n main()\n", "code2": "from collections import deque\n\n\ndef solve(K):\n s = 1\n q = deque()\n q.append(s)\n dists = {}\n dists[s] = 1\n while len(q) > 0:\n n = q.pop()\n if n == 0:\n break\n m = (n*10)%K\n if m not in dists:\n dists[m] = dists[n]\n q.append(m)\n elif dists[m] > dists[n]:\n dists[m] = dists[n]\n q.append(m)\n if n % 10 != 9:\n m = (n+1)%K\n if m not in dists:\n dists[m] = dists[n] + 1\n q.appendleft(m)\n elif dists[m] > dists[n] + 1:\n dists[m] = dists[n] + 1\n q.appendleft(m)\n return dists[0]\n\n\ndef main():\n K = int(input())\n print(solve(K))\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553946437", "date2": "1553946737", "bleu_score": "0.9183315677781149", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 18, "total_score": 22, "input": "1246\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["from collections import deque\n\n\ndef solve(K): # (0): solve=\n s = 1\n q = deque()\n q.append(s)\n dists = {}\n dists[s] = 1\n while len(q) > 0:\n n = q.pop()\n if n == 0:\n break\n m = (n*10)%K\n if m not in dists:\n dists[m] = dists[n]\n q.append(m)\n if dists[m] > dists[n]:\n dists[m] = dists[n]\n if n % 10 != 9:\n m = (n+1)%K\n if m not in dists:\n dists[m] = dists[n] + 1\n q.appendleft(m)\n if dists[m] > dists[n] + 1:\n dists[m] = dists[n] + 1\n return dists[0]\n\n\ndef main(): # (1): main=\n K = int(input())\n print(solve(K))\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " from collections import deque\n \n \n def solve(K):\n s = 1\n q = deque()\n q.append(s)\n dists = {}\n dists[s] = 1\n while len(q) > 0:\n n = q.pop()\n if n == 0:\n break\n m = (n*10)%K\n if m not in dists:\n dists[m] = dists[n]\n q.append(m)\n- if dists[m] > dists[n]:\n+ elif dists[m] > dists[n]:\n dists[m] = dists[n]\n+ q.append(m)\n if n % 10 != 9:\n m = (n+1)%K\n if m not in dists:\n dists[m] = dists[n] + 1\n q.appendleft(m)\n- if dists[m] > dists[n] + 1:\n+ elif dists[m] > dists[n] + 1:\n dists[m] = dists[n] + 1\n+ q.appendleft(m)\n return dists[0]\n \n \n def main():\n K = int(input())\n print(solve(K))\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": "\n from collections import deque\n \n \n def solve(K):\n s = 1\n q = deque()\n q.append(s)\n dists = {}\n dists[s] = 1\n while len(q) > 0:\n n = q.pop()\n if n == 0:\n break\n m = (n*10)%K\n if m not in dists:\n dists[m] = dists[n]\n q.append(m)\n if dists[m] > dists[n]:\n dists[m] = dists[n]\n if n % 10 != 9:\n m = (n+1)%K\n if m not in dists:\n dists[m] = dists[n] + 1\n q.appendleft(m)\n if dists[m] > dists[n] + 1:\n dists[m] = dists[n] + 1\n return dists[0]\n \n \n def main():\n K = int(input())\n print(solve(K))\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 37 }, { "user_id": "u905582793", "problem_id": "p03558", "submission1_id": "s270959957-FL", "submission2_id": "s602673233", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\nn = int(input())\nmins = [100 for i in range(n+1)]\nused = [0 for i in range(n+1)]\ndeq = deque()\ndeq.append((1,1))\nwhile deq:\n x,cnt = deq.popleft()\n mins[x] = cnt\n used[x] = 1\n if used[10*x%n] == 0:\n deq.appendleft((10*x%n,cnt))\n if used[(x+1)%n] == 0:\n deq.append(((x+1)%n,cnt+1))\nprint(mins[0])", "code2": "from collections import deque\nn = int(input())\nmins = [1000 for i in range(n+1)]\nused = [0 for i in range(n+1)]\ndeq = deque()\ndeq.append((1,1))\nwhile deq:\n x,cnt = deq.popleft()\n mins[x] = min(mins[x],cnt)\n used[x] = 1\n if used[10*x%n] == 0:\n deq.appendleft((10*x%n,cnt))\n if used[(x+1)%n] == 0:\n deq.append(((x+1)%n,cnt+1))\nprint(mins[0])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580071481", "date2": "1580071704", "bleu_score": "0.9504476805920274", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 21, "total_score": 22, "input": "551\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["from collections import deque\nn = int(input()) # (0): n=551\nmins = [100 for i in range(n+1)] # (1): mins=[100, 100, ..., 100, 100]\nused = [0 for i in range(n+1)] # (2): used=[0, 0, ..., 0, 0]\ndeq = deque() # (3): deq=deque([])\ndeq.append((1,1)) # (4): NO CHANGE\nwhile deq: # (5): NO CHANGE (13): NO CHANGE ... (5779): NO CHANGE\n x,cnt = deq.popleft() # (6): x=1, cnt=1 (14): x=10 ... (5774): x=0, cnt=4\n mins[x] = cnt # (7): mins=[100, 1, ..., 100, 100] (15): mins=[100, 1, ..., 100, 100] ... (5775): mins=[4, 1, ..., 3, 100]\n used[x] = 1 # (8): used=[0, 1, ..., 0, 0] (16): used=[0, 1, ..., 0, 0] ... (5776): NO CHANGE\n if used[10*x%n] == 0: # (9): NO CHANGE (17): NO CHANGE ... (5777): NO CHANGE\n deq.appendleft((10*x%n,cnt)) # (10): NO CHANGE (18): NO CHANGE ... (4192): NO CHANGE\n if used[(x+1)%n] == 0: # (11): NO CHANGE (19): NO CHANGE ... (5778): NO CHANGE\n deq.append(((x+1)%n,cnt+1)) # (12): NO CHANGE (20): NO CHANGE ... (5286): NO CHANGE\nprint(mins[0])"], "anno_status": [true], "diff_content": " from collections import deque\n n = int(input())\n-mins = [100 for i in range(n+1)]\n+mins = [1000 for i in range(n+1)]\n used = [0 for i in range(n+1)]\n deq = deque()\n deq.append((1,1))\n while deq:\n x,cnt = deq.popleft()\n- mins[x] = cnt\n+ mins[x] = min(mins[x],cnt)\n used[x] = 1\n if used[10*x%n] == 0:\n deq.appendleft((10*x%n,cnt))\n if used[(x+1)%n] == 0:\n deq.append(((x+1)%n,cnt+1))\n print(mins[0])\n", "FL_content": "\n from collections import deque\n n = int(input())\n mins = [100 for i in range(n+1)]\n used = [0 for i in range(n+1)]\n deq = deque()\n deq.append((1,1))\n while deq:\n x,cnt = deq.popleft()\n mins[x] = cnt\n used[x] = 1\n if used[10*x%n] == 0:\n deq.appendleft((10*x%n,cnt))\n if used[(x+1)%n] == 0:\n deq.append(((x+1)%n,cnt+1))\n print(mins[0])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u509368316", "problem_id": "p03172", "submission1_id": "s521282330-FL", "submission2_id": "s390468072", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K=map(int,input().split())\nA=list(map(int,input().split()))\nd=[[0]*(K+2) for i in range(N+1)]\nd[0]=[0]+[1]*(K+1)\nm=10**9+7\nfor i in range(N):\n for j in range(K+1):\n d[i+1][j+1]=(d[i][j+1]-d[i][max(0,j-A[i])]+d[i+1][j])%m\nprint(d[-1][-1]-d[-1][-2])", "code2": "N,K=map(int,input().split())\nA=list(map(int,input().split()))\nd=[[0]*(K+2) for i in range(N+1)]\nd[0]=[0]+[1]*(K+1)\nm=10**9+7\nfor i in range(N):\n for j in range(K+1):\n d[i+1][j+1]=(d[i][j+1]-d[i][max(0,j-A[i])]+d[i+1][j])%m\nprint((d[-1][-1]-d[-1][-2])%m)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589676036", "date2": "1589676107", "bleu_score": "0.9818170376361564", "code1_test_status": [1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1], "code1_test_score": 66, "total_score": 103, "input": "4 101000\n101000 100110 101001 100000\n", "actual_output": "-251741768\n", "expected_output": "748258239\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N,K=map(int,input().split())\n A=list(map(int,input().split()))\n d=[[0]*(K+2) for i in range(N+1)]\n d[0]=[0]+[1]*(K+1)\n m=10**9+7\n for i in range(N):\n for j in range(K+1):\n d[i+1][j+1]=(d[i][j+1]-d[i][max(0,j-A[i])]+d[i+1][j])%m\n-print(d[-1][-1]-d[-1][-2])\n+print((d[-1][-1]-d[-1][-2])%m)\n", "FL_content": "\n N,K=map(int,input().split())\n A=list(map(int,input().split()))\n d=[[0]*(K+2) for i in range(N+1)]\n d[0]=[0]+[1]*(K+1)\n m=10**9+7\n for i in range(N):\n for j in range(K+1):\n d[i+1][j+1]=(d[i][j+1]-d[i][max(0,j-A[i])]+d[i+1][j])%m\n-print(d[-1][-1]-d[-1][-2])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u983918956", "problem_id": "p03739", "submission1_id": "s206736033-FL", "submission2_id": "s939459579", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nA = list(map(int,input().split()))\ndef func(list1,op,acc = 0,count = 0):\n for i in range(n):\n acc += list1[i]\n if i % 2 == 1 and acc * op >= 0:\n count += op * acc + 1\n acc = -op\n elif i % 2 == 0 and acc * op <= 0:\n count += -op * acc + 1\n acc = op\n if acc == 0:\n count += 1\n return count\nif A[0] > 0:\n ans = func(A,1)\nelif A[0] < 0:\n ans = func(A,-1)\nelif A[0] == 0:\n ans = min(func(A,1),func(A,-1))\nprint(ans)", "code2": "n = int(input())\nA = list(map(int,input().split()))\ndef func(list1,op,acc = 0,count = 0):\n for i in range(n):\n acc += list1[i]\n if i % 2 == 1 and acc * op >= 0:\n count += op * acc + 1\n acc = -op\n elif i % 2 == 0 and acc * op <= 0:\n count += -op * acc + 1\n acc = op\n if acc == 0:\n count += 1\n return count\nans = min(func(A,1),func(A,-1))\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1545108722", "date2": "1545109699", "bleu_score": "0.8093874690353725", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 80, "total_score": 94, "input": "5\n40 -1 -1 1 -5\n", "actual_output": "53\n", "expected_output": "46\n\n", "anno_code": ["n = int(input()) # (0): n=5\nA = list(map(int,input().split())) # (1): A=[40, -1, -1, 1, -5]\ndef func(list1,op,acc = 0,count = 0): # (2): func=\n for i in range(n): # (5): i=0 (9): i=1 ... (31): NO CHANGE\n acc += list1[i] # (6): acc=40 (10): acc=39 ... (26): acc=-6\n if i % 2 == 1 and acc * op >= 0: # (7): NO CHANGE (11): NO CHANGE ... (27): NO CHANGE\n count += op * acc + 1 # (12): count=40 (23): count=46\n acc = -op # (13): acc=-1 (24): acc=-1\n elif i % 2 == 0 and acc * op <= 0: # (8): NO CHANGE (17): NO CHANGE (28): NO CHANGE\n count += -op * acc + 1 # (18): count=43 (29): count=53\n acc = op # (19): acc=1 (30): acc=1\n if acc == 0: # (32): n=5, A=[40, -1, -1, 1, -5], func=, ans=53\n count += 1\n return count\nif A[0] > 0: # (3): NO CHANGE\n ans = func(A,1) # (4): list1=[40, -1, -1, 1, -5], op=1, acc=0, count=0\nelif A[0] < 0:\n ans = func(A,-1)\nelif A[0] == 0:\n ans = min(func(A,1),func(A,-1))\nprint(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n A = list(map(int,input().split()))\n def func(list1,op,acc = 0,count = 0):\n for i in range(n):\n acc += list1[i]\n if i % 2 == 1 and acc * op >= 0:\n count += op * acc + 1\n acc = -op\n elif i % 2 == 0 and acc * op <= 0:\n count += -op * acc + 1\n acc = op\n if acc == 0:\n count += 1\n return count\n-if A[0] > 0:\n- ans = func(A,1)\n-elif A[0] < 0:\n- ans = func(A,-1)\n-elif A[0] == 0:\n- ans = min(func(A,1),func(A,-1))\n+ans = min(func(A,1),func(A,-1))\n print(ans)\n", "FL_content": "\n n = int(input())\n A = list(map(int,input().split()))\n def func(list1,op,acc = 0,count = 0):\n for i in range(n):\n acc += list1[i]\n if i % 2 == 1 and acc * op >= 0:\n count += op * acc + 1\n acc = -op\n elif i % 2 == 0 and acc * op <= 0:\n count += -op * acc + 1\n acc = op\n if acc == 0:\n count += 1\n return count\n if A[0] > 0:\n ans = func(A,1)\n elif A[0] < 0:\n ans = func(A,-1)\n elif A[0] == 0:\n ans = min(func(A,1),func(A,-1))\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 21 }, { "user_id": "u762557532", "problem_id": "p03502", "submission1_id": "s047722906-FL", "submission2_id": "s223480304", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\n\n\n\n\n\nimport sys\n\ndef input(): return sys.stdin.readline().rstrip()\ndef iIn(): return int(input())\ndef iInM(): return map(int, input().split())\ndef iInM1(): return map(int1, input().split())\ndef iInLH(): return list(map(int, input().split()))\ndef iInLH1(): return list(map(int1, input().split()))\ndef iInLV(n): return [iIn() for _ in range(n)]\ndef iInLV1(n): return [iIn()-1 for _ in range(n)]\ndef iInLD(n): return [iInLH() for _ in range(n)]\ndef iInLD1(n): return [iInLH1() for _ in range(n)]\ndef sInLH(): return list(input().split())\ndef sInLV(n): return [input().rstrip('\\n') for _ in range(n)]\ndef sInLD(n): return [sInLH() for _ in range(n)]\n\ndef OutH(lst, deli=' '): print(deli.join(map(str, lst)))\ndef OutV(lst): print('\\n'.join(map(str, lst)))\n\nsys.setrecursionlimit(10 ** 6)\n\nint1 = lambda x: int(x) - 1\n\nINF = int(1e9)\nMOD = 1000000007\ndx = (-1, 0, 1, 0)\ndy = (0, -1, 0, 1)\n\n\nN = iIn()\n\nfN = sum(list(map(int, list(str(N)))))\n\nans = 'Yes' if N == fN else 'No'\n\nprint(ans)", "code2": "\n\n\n\n\n\n\n\n\n\nimport sys\n\ndef input(): return sys.stdin.readline().rstrip()\ndef iIn(): return int(input())\ndef iInM(): return map(int, input().split())\ndef iInM1(): return map(int1, input().split())\ndef iInLH(): return list(map(int, input().split()))\ndef iInLH1(): return list(map(int1, input().split()))\ndef iInLV(n): return [iIn() for _ in range(n)]\ndef iInLV1(n): return [iIn()-1 for _ in range(n)]\ndef iInLD(n): return [iInLH() for _ in range(n)]\ndef iInLD1(n): return [iInLH1() for _ in range(n)]\ndef sInLH(): return list(input().split())\ndef sInLV(n): return [input().rstrip('\\n') for _ in range(n)]\ndef sInLD(n): return [sInLH() for _ in range(n)]\n\ndef OutH(lst, deli=' '): print(deli.join(map(str, lst)))\ndef OutV(lst): print('\\n'.join(map(str, lst)))\n\nsys.setrecursionlimit(10 ** 6)\n\nint1 = lambda x: int(x) - 1\n\nINF = int(1e9)\nMOD = 1000000007\ndx = (-1, 0, 1, 0)\ndy = (0, -1, 0, 1)\n\n\nN = iIn()\n\nfN = sum(list(map(int, list(str(N)))))\n\nans = 'Yes' if N % fN == 0 else 'No'\n\nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593828803", "date2": "1593828836", "bleu_score": "0.9941728506855295", "code1_test_status": [1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 20, "total_score": 23, "input": "117\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["\n\n\n\n\n\n\n\n\n\nimport sys\n\ndef input(): return sys.stdin.readline().rstrip()\ndef iIn(): return int(input())\ndef iInM(): return map(int, input().split())\ndef iInM1(): return map(int1, input().split())\ndef iInLH(): return list(map(int, input().split()))\ndef iInLH1(): return list(map(int1, input().split()))\ndef iInLV(n): return [iIn() for _ in range(n)]\ndef iInLV1(n): return [iIn()-1 for _ in range(n)]\ndef iInLD(n): return [iInLH() for _ in range(n)]\ndef iInLD1(n): return [iInLH1() for _ in range(n)]\ndef sInLH(): return list(input().split())\ndef sInLV(n): return [input().rstrip('\\n') for _ in range(n)]\ndef sInLD(n): return [sInLH() for _ in range(n)]\n\ndef OutH(lst, deli=' '): print(deli.join(map(str, lst))) # (0): OutH=\ndef OutV(lst): print('\\n'.join(map(str, lst))) # (1): OutV=\n\nsys.setrecursionlimit(10 ** 6) # (2): NO CHANGE\n\nint1 = lambda x: int(x) - 1 # (3): int1= at 0x000001E85AD3A3B0>\n\nINF = int(1e9) # (4): INF=1000000000\nMOD = 1000000007 # (5): MOD=1000000007\ndx = (-1, 0, 1, 0) # (6): dx=(-1, 0, 1, 0)\ndy = (0, -1, 0, 1) # (7): dy=(0, -1, 0, 1)\n\n\nN = iIn() # (8): N=117\n\nfN = sum(list(map(int, list(str(N))))) # (9): fN=9\n\nans = 'Yes' if N == fN else 'No' # (10): ans=No\n\nprint(ans)"], "anno_status": [true], "diff_content": " \n \n \n \n \n \n \n \n \n \n import sys\n \n def input(): return sys.stdin.readline().rstrip()\n def iIn(): return int(input())\n def iInM(): return map(int, input().split())\n def iInM1(): return map(int1, input().split())\n def iInLH(): return list(map(int, input().split()))\n def iInLH1(): return list(map(int1, input().split()))\n def iInLV(n): return [iIn() for _ in range(n)]\n def iInLV1(n): return [iIn()-1 for _ in range(n)]\n def iInLD(n): return [iInLH() for _ in range(n)]\n def iInLD1(n): return [iInLH1() for _ in range(n)]\n def sInLH(): return list(input().split())\n def sInLV(n): return [input().rstrip('\\n') for _ in range(n)]\n def sInLD(n): return [sInLH() for _ in range(n)]\n \n def OutH(lst, deli=' '): print(deli.join(map(str, lst)))\n def OutV(lst): print('\\n'.join(map(str, lst)))\n \n sys.setrecursionlimit(10 ** 6)\n \n int1 = lambda x: int(x) - 1\n \n INF = int(1e9)\n MOD = 1000000007\n dx = (-1, 0, 1, 0)\n dy = (0, -1, 0, 1)\n \n \n N = iIn()\n \n fN = sum(list(map(int, list(str(N)))))\n \n-ans = 'Yes' if N == fN else 'No'\n+ans = 'Yes' if N % fN == 0 else 'No'\n \n print(ans)\n", "FL_content": "\n \n \n \n \n \n \n \n \n \n \n import sys\n \n def input(): return sys.stdin.readline().rstrip()\n def iIn(): return int(input())\n def iInM(): return map(int, input().split())\n def iInM1(): return map(int1, input().split())\n def iInLH(): return list(map(int, input().split()))\n def iInLH1(): return list(map(int1, input().split()))\n def iInLV(n): return [iIn() for _ in range(n)]\n def iInLV1(n): return [iIn()-1 for _ in range(n)]\n def iInLD(n): return [iInLH() for _ in range(n)]\n def iInLD1(n): return [iInLH1() for _ in range(n)]\n def sInLH(): return list(input().split())\n def sInLV(n): return [input().rstrip('\\n') for _ in range(n)]\n def sInLD(n): return [sInLH() for _ in range(n)]\n \n def OutH(lst, deli=' '): print(deli.join(map(str, lst)))\n def OutV(lst): print('\\n'.join(map(str, lst)))\n \n sys.setrecursionlimit(10 ** 6)\n \n int1 = lambda x: int(x) - 1\n \n INF = int(1e9)\n MOD = 1000000007\n dx = (-1, 0, 1, 0)\n dy = (0, -1, 0, 1)\n \n \n N = iIn()\n \n-fN = sum(list(map(int, list(str(N)))))\n \n ans = 'Yes' if N == fN else 'No'\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 46 }, { "user_id": "u204883389", "problem_id": "p02415", "submission1_id": "s747234247-FL", "submission2_id": "s766223270", "status1": "Wrong Answer", "status2": "Accepted", "code1": "str = \" \";\nprint(str.swapcase())", "code2": "s = input()\nprint(s.swapcase())", "original_language1": "Python3", "original_language2": "Python3", "date1": "1470270746", "date2": "1470285699", "bleu_score": "0.6100529007280512", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "R@gH, G,KSQ@ AKK@YOISOCBN .PWUDKB\n", "actual_output": "no output\n", "expected_output": "r@Gh, g,ksq@ akk@yoisocbn .pwudkb\n\n", "anno_code": ["str = \" \"; # (0): str= \nprint(str.swapcase())"], "anno_status": [true], "diff_content": "-str = \" \";\n-print(str.swapcase())\n+s = input()\n+print(s.swapcase())\n", "FL_content": "\n-str = \" \";\n print(str.swapcase())\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 2 }, { "user_id": "u948524308", "problem_id": "p03254", "submission1_id": "s043979948-FL", "submission2_id": "s744805793", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,x = map(int,input().split())\na = list(map(int,input().split()))\n\na.sort()\n\nif x0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\n\nif b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=int(n/p)\n q=n-p*b\n if s==p+q and q0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\nif b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n\n if b.is_integer() and 0<=s-pn**0.5:\n b_ans=int(b)\n break\n\nif b_ans!=1:\n print(b_ans)\nelse:\n print(-1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566168910", "date2": "1566170554", "bleu_score": "0.891097790202012", "code1_test_status": [1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 52, "total_score": 105, "input": "87654\n264\n", "actual_output": "-1\n", "expected_output": "972\n\n", "anno_code": ["n=int(input()) # (0): n=87654\ns=int(input()) # (1): s=264\n\nb_ans=1 # (2): b_ans=1\n\n\n\nif n==s: # (3): NO CHANGE\n b_ans=n+1\nif b_ans==1: # (4): NO CHANGE\n for b in range(2,int(n**0.5)+1): # (5): b=2 (61): b=3 ... (4402): NO CHANGE\n nn=n # (6): nn=87654 (62): nn=87654 ... (4389): nn=87654\n st=[] # (7): st=[] (63): st=[] ... (4390): st=[]\n while(nn>0): # (8): NO CHANGE (11): NO CHANGE ... (4400): NO CHANGE\n st.append(nn%b) # (9): st=[0] (12): st=[0, 1.0] ... (4398): st=[38, 0.0, 1.0]\n nn=(nn-st[-1])/b # (10): nn=43827.0 (13): nn=21913.0 ... (4399): nn=0.0\n \n if sum(st)==s: # (60): NO CHANGE (98): NO CHANGE ... (4401): NO CHANGE\n b_ans=b\n break\n\n\nif b_ans==1: # (4403): NO CHANGE\n for p in range(int(n**0.5),0,-1): # (4404): p=296 (4408): p=295 ... (5588): NO CHANGE\n b=int(n/p) # (4405): NO CHANGE (4409): b=297 ... (5585): b=87654\n q=n-p*b # (4406): q=38 (4410): q=39 ... (5586): NO CHANGE\n if s==p+q and q0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n-\n if b_ans==1:\n for p in range(int(n**0.5),0,-1):\n- b=int(n/p)\n- q=n-p*b\n- if s==p+q and qn**0.5:\n+ b_ans=int(b)\n break\n \n if b_ans!=1:\n print(b_ans)\n else:\n print(-1)\n", "FL_content": "\n n=int(input())\n s=int(input())\n \n b_ans=1\n \n \n \n if n==s:\n b_ans=n+1\n if b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n \n if b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=int(n/p)\n q=n-p*b\n- if s==p+q and q\n x = A[r] # (8): x=11\n i = p - 1 # (9): i=-1\n for j in range(p, r): # (10): j=0 (12): j=1 ... (46): NO CHANGE\n if A[j] <= x: # (11): NO CHANGE (13): NO CHANGE ... (43): NO CHANGE\n i += 1 # (16): i=0 (20): i=1 ... (44): i=6\n A[i], A[j] = A[j], A[i] # (17): A=[9, 19, 13, 5, 12, 8, 7, 4, 21, 2, 10, 11] (21): A=[9, 5, 13, 19, 12, 8, 7, 4, 21, 2, 10, 11] ... (45): A=[9, 5, 8, 7, 4, 2, 10, 12, 21, 13, 19, 11]\n A[i + 1], A[r] = A[r], A[i] # (47): n=12, A=[9, 5, 8, 7, 4, 2, 10, 11, 21, 13, 19, 10], idx=7\n return i + 1\n\n\ndef main(): # (1): main=\n n = int(input()) # (3): n=12\n A = [int(e) for e in input().split()] # (4): A=[13, 19, 9, 5, 12, 8, 7, 4, 21, 2, 10, 11]\n p = 0 # (5): p=0\n r = len(A) - 1 # (6): r=11\n idx = partition(A, p, r) # (7): NO CHANGE\n A = [str(e) for e in A] # (48): A=['9', '5', '8', '7', '4', '2', '10', '11', '21', '13', '19', '10']\n A[idx] = \"[{}]\".format(A[idx])\n return \" \".join(A)\n\n\nmain() # (2): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n \n \n def partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n- A[i + 1], A[r] = A[r], A[i]\n+ A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n \n \n def main():\n n = int(input())\n A = [int(e) for e in input().split()]\n p = 0\n- r = len(A) - 1\n- idx = partition(A, p, r)\n+ idx = partition(A, p, n - 1)\n A = [str(e) for e in A]\n A[idx] = \"[{}]\".format(A[idx])\n return \" \".join(A)\n \n \n-main()\n+print(main())\n", "FL_content": "\n \n \n \n def partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n A[i + 1], A[r] = A[r], A[i]\n return i + 1\n \n \n def main():\n n = int(input())\n A = [int(e) for e in input().split()]\n p = 0\n r = len(A) - 1\n idx = partition(A, p, r)\n A = [str(e) for e in A]\n A[idx] = \"[{}]\".format(A[idx])\n return \" \".join(A)\n \n \n-main()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 26 }, { "user_id": "u365858785", "problem_id": "p03207", "submission1_id": "s968595864-FL", "submission2_id": "s634285799", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=int(input())\nb=[int(input()) for i in range(a)]\nprint(sum(b)-max(b)/2)\n ", "code2": "a=int(input())\nb=[int(input()) for i in range(a)]\nprint(int(sum(b)-max(b)/2))\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558158012", "date2": "1558158076", "bleu_score": "0.9265210237160726", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "3\n32\n7980\n4990\n", "actual_output": "9012.0\n", "expected_output": "9012\n\n", "anno_code": ["a=int(input()) # (0): a=3\nb=[int(input()) for i in range(a)] # (1): b=[32, 7980, 4990]\nprint(sum(b)-max(b)/2)\n "], "anno_status": [true], "diff_content": " a=int(input())\n b=[int(input()) for i in range(a)]\n-print(sum(b)-max(b)/2)\n+print(int(sum(b)-max(b)/2))\n \n", "FL_content": "\n a=int(input())\n b=[int(input()) for i in range(a)]\n-print(sum(b)-max(b)/2)\n- \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 4 }, { "user_id": "u207799478", "problem_id": "p03502", "submission1_id": "s211198937-FL", "submission2_id": "s916157731", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nimport string\n\n\ndef readints():\n return list(map(int, input().split()))\n\n\ndef nCr(n, r):\n return math.factorial(n)\n\n\ndef has_duplicates2(seq):\n seen = []\n for item in seq:\n if not(item in seen):\n seen.append(item)\n return len(seq) != len(seen)\n\n\ndef divisor(n):\n divisor = []\n for i in range(1, n+1):\n if n % i == 0:\n divisor.append(i)\n return divisor\n\n\n\ndx = [-1, -1, -1, 0, 0, 1, 1, 1]\ndy = [-1, 0, 1, -1, 1, -1, 0, 1]\n\nn = input()\nprint(n)\nprint(sum(map(int, n)))\nx = sum(map(int, n))\nprint(int(n)/x)\n\nif int(n) % sum(map(int, n)) == 0:\n print('Yes')\n exit()\nelse:\n print('No')\n", "code2": "import math\nimport string\n\n\ndef readints():\n return list(map(int, input().split()))\n\n\ndef nCr(n, r):\n return math.factorial(n)\n\n\ndef has_duplicates2(seq):\n seen = []\n for item in seq:\n if not(item in seen):\n seen.append(item)\n return len(seq) != len(seen)\n\n\ndef divisor(n):\n divisor = []\n for i in range(1, n+1):\n if n % i == 0:\n divisor.append(i)\n return divisor\n\n\n\ndx = [-1, -1, -1, 0, 0, 1, 1, 1]\ndy = [-1, 0, 1, -1, 1, -1, 0, 1]\n\nn = input()\n\n\nx = sum(map(int, n))\n\n\nif int(n) % sum(map(int, n)) == 0:\n print('Yes')\n exit()\nelse:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584924489", "date2": "1584924575", "bleu_score": "0.9227443581959335", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 23, "input": "172\n", "actual_output": "172\n10\n17.2\nNo\n", "expected_output": "No\n\n", "anno_code": ["import math\nimport string\n\n\ndef readints(): # (0): readints=\n return list(map(int, input().split()))\n\n\ndef nCr(n, r): # (1): nCr=\n return math.factorial(n)\n\n\ndef has_duplicates2(seq): # (2): has_duplicates2=\n seen = []\n for item in seq:\n if not(item in seen):\n seen.append(item)\n return len(seq) != len(seen)\n\n\ndef divisor(n): # (3): divisor=\n divisor = []\n for i in range(1, n+1):\n if n % i == 0:\n divisor.append(i)\n return divisor\n\n\n\ndx = [-1, -1, -1, 0, 0, 1, 1, 1] # (4): dx=[-1, -1, -1, 0, 0, 1, 1, 1]\ndy = [-1, 0, 1, -1, 1, -1, 0, 1] # (5): dy=[-1, 0, 1, -1, 1, -1, 0, 1]\n\nn = input() # (6): n=172\nprint(n) # (7): NO CHANGE\nprint(sum(map(int, n))) # (8): NO CHANGE\nx = sum(map(int, n)) # (9): x=10\nprint(int(n)/x) # (10): NO CHANGE\n\nif int(n) % sum(map(int, n)) == 0: # (11): NO CHANGE\n print('Yes')\n exit()\nelse:\n print('No')\n"], "anno_status": [true], "diff_content": " import math\n import string\n \n \n def readints():\n return list(map(int, input().split()))\n \n \n def nCr(n, r):\n return math.factorial(n)\n \n \n def has_duplicates2(seq):\n seen = []\n for item in seq:\n if not(item in seen):\n seen.append(item)\n return len(seq) != len(seen)\n \n \n def divisor(n):\n divisor = []\n for i in range(1, n+1):\n if n % i == 0:\n divisor.append(i)\n return divisor\n \n \n \n dx = [-1, -1, -1, 0, 0, 1, 1, 1]\n dy = [-1, 0, 1, -1, 1, -1, 0, 1]\n \n n = input()\n-print(n)\n-print(sum(map(int, n)))\n+\n+\n x = sum(map(int, n))\n-print(int(n)/x)\n+\n \n if int(n) % sum(map(int, n)) == 0:\n print('Yes')\n exit()\n else:\n print('No')\n \n", "FL_content": "\n import math\n import string\n \n \n def readints():\n return list(map(int, input().split()))\n \n \n def nCr(n, r):\n return math.factorial(n)\n \n \n def has_duplicates2(seq):\n seen = []\n for item in seq:\n if not(item in seen):\n seen.append(item)\n return len(seq) != len(seen)\n \n \n def divisor(n):\n divisor = []\n for i in range(1, n+1):\n if n % i == 0:\n divisor.append(i)\n return divisor\n \n \n \n dx = [-1, -1, -1, 0, 0, 1, 1, 1]\n dy = [-1, 0, 1, -1, 1, -1, 0, 1]\n \n n = input()\n-print(n)\n-print(sum(map(int, n)))\n-x = sum(map(int, n))\n-print(int(n)/x)\n \n-if int(n) % sum(map(int, n)) == 0:\n print('Yes')\n exit()\n else:\n print('No')\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 44 }, { "user_id": "u430726059", "problem_id": "p02536", "submission1_id": "s711493104-FL", "submission2_id": "s747708610", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class UnionFind():\n \n \n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, x):\n \n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n \n def unite(self, x, y):\n \n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n \n def size(self, x):\n \n return -self.parents[self.find(x)]\n \n def same(self, x, y):\n \n return self.find(x) == self.find(y)\n \n def members(self, x):\n \n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n \n def roots(self):\n \n return [i for i, x in enumerate(self.parents) if x < 0]\n \n def group_count(self):\n \n return len(self.roots())\n \nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\n \n \n \nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\nn,m=map(int,input().split())\nu=UnionFind(n)\nfor i in range(m):\n a,b=map(int,input().split())\n a-=1\n b-=1\n u.unite(a,b)\nprint(n-len(u.roots()))", "code2": "class UnionFind():\n \n \n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, x):\n \n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n \n def unite(self, x, y):\n \n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n \n def size(self, x):\n \n return -self.parents[self.find(x)]\n \n def same(self, x, y):\n \n return self.find(x) == self.find(y)\n \n def members(self, x):\n \n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n \n def roots(self):\n \n return [i for i, x in enumerate(self.parents) if x < 0]\n \n def group_count(self):\n \n return len(self.roots())\n \nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\n \n \n \nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\nn,m=map(int,input().split())\nu=UnionFind(n)\nfor i in range(m):\n a,b=map(int,input().split())\n a-=1\n b-=1\n u.unite(a,b)\nprint(len(u.roots())-1)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1601170627", "date2": "1601170853", "bleu_score": "0.9968957596679202", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 90, "input": "13 1\n4 2\n", "actual_output": "1\n", "expected_output": "11\n\n", "anno_code": ["class UnionFind(): # (0): UnionFind=, sys=\n \n \n def __init__(self, n):\n self.n = n # (7): NO CHANGE\n self.parents = [-1] * n # (8): UnionFind=, sys=, input=, m=1, u=\n \n def find(self, x):\n \n if self.parents[x] < 0: # (15): y=1 (17): x=3, y=1\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n \n def unite(self, x, y):\n \n x = self.find(x) # (14): NO CHANGE\n y = self.find(y) # (16): x=1\n if x == y: # (18): NO CHANGE\n return\n if self.parents[x] > self.parents[y]: # (19): NO CHANGE\n x, y = y, x\n self.parents[x] += self.parents[y] # (20): NO CHANGE\n self.parents[y] = x # (21): UnionFind=, sys=, input=, n=13, m=1, u=, i=0, a=3, b=1\n \n def size(self, x):\n \n return -self.parents[self.find(x)]\n \n def same(self, x, y):\n \n return self.find(x) == self.find(y)\n \n def members(self, x):\n \n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n \n def roots(self):\n \n return [i for i, x in enumerate(self.parents) if x < 0]\n \n def group_count(self):\n \n return len(self.roots())\n \nimport sys\nsys.setrecursionlimit(10**9) # (1): NO CHANGE\ninput = sys.stdin.readline # (2): input=\n \n \n \nimport sys\nsys.setrecursionlimit(10**9) # (3): NO CHANGE\ninput = sys.stdin.readline # (4): NO CHANGE\nn,m=map(int,input().split()) # (5): n=13, m=1\nu=UnionFind(n) # (6): self=\nfor i in range(m): # (9): i=0 (22): NO CHANGE\n a,b=map(int,input().split()) # (10): a=4, b=2\n a-=1 # (11): a=3\n b-=1 # (12): b=1\n u.unite(a,b) # (13): self=, x=3, y=1\nprint(n-len(u.roots()))"], "anno_status": [false], "diff_content": " class UnionFind():\n \n \n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, x):\n \n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n \n def unite(self, x, y):\n \n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n \n def size(self, x):\n \n return -self.parents[self.find(x)]\n \n def same(self, x, y):\n \n return self.find(x) == self.find(y)\n \n def members(self, x):\n \n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n \n def roots(self):\n \n return [i for i, x in enumerate(self.parents) if x < 0]\n \n def group_count(self):\n \n return len(self.roots())\n \n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n \n \n \n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n n,m=map(int,input().split())\n u=UnionFind(n)\n for i in range(m):\n a,b=map(int,input().split())\n a-=1\n b-=1\n u.unite(a,b)\n-print(n-len(u.roots()))\n+print(len(u.roots())-1)\n", "FL_content": "\n class UnionFind():\n \n \n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, x):\n \n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n \n def unite(self, x, y):\n \n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n \n def size(self, x):\n \n return -self.parents[self.find(x)]\n \n def same(self, x, y):\n \n return self.find(x) == self.find(y)\n \n def members(self, x):\n \n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n \n def roots(self):\n \n return [i for i, x in enumerate(self.parents) if x < 0]\n \n def group_count(self):\n \n return len(self.roots())\n \n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n \n \n \n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n n,m=map(int,input().split())\n u=UnionFind(n)\n for i in range(m):\n a,b=map(int,input().split())\n a-=1\n b-=1\n u.unite(a,b)\n-print(n-len(u.roots()))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 64 }, { "user_id": "u861466636", "problem_id": "p03031", "submission1_id": "s501819462-FL", "submission2_id": "s038087543", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nN, M = map(int, input().split())\nlight_s_dict = dict()\nlight_n_dict = dict()\n\n\nfor i in range(1, M+1):\n l = [int(j) for j in input().split()]\n connected_s = [0]*N\n for s in l[1:]:\n connected_s[s-1] = 1\n light_s_dict[i] = connected_s\n light_n_dict[i] = l[0]\n\n\ns_patterns = []\nfor i in range(2**N):\n p_str = bin(i)[2:].zfill(N)\n s_patterns.append([int(i) for i in list(p_str)])\n \n\nlight_conditions = [int(p) for p in input().split()]\n\n\nans = 0\nfor pattern in s_patterns:\n cond = 0\n for light in range(1, M+1): \n for i, p in enumerate(pattern):\n if p == 1:\n cond += light_s_dict[light][i]\n if cond % 2 != light_conditions[light-1]:\n break\n else: \n ans += 1\nprint(ans)", "code2": "\n\n\nN, M = map(int, input().split())\n\nlight_s_dict = dict()\n\nfor i in range(M):\n l = [int(j) for j in input().split()]\n connected_s = [0]*N\n for s in l[1:]:\n connected_s[s-1] = 1\n light_s_dict[i] = connected_s\n\n\ns_patterns = []\nfor i in range(2**N):\n p_str = bin(i)[2:].zfill(N)\n s_patterns.append([int(i) for i in list(p_str)])\n \n\nlight_conditions = [int(p) for p in input().split()]\n\n\nans = 0\nfor pattern in s_patterns:\n for light in range(M): \n cond = 0 \n for i, p in enumerate(pattern): \n if p == 1:\n cond += light_s_dict[light][i] \n if cond % 2 != light_conditions[light]:\n break\n else: \n ans += 1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558922064", "date2": "1558922614", "bleu_score": "0.906138784057539", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "2 3\n2 1 2\n1 1\n1 2\n0 1 0\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["\n\n\nN, M = map(int, input().split()) # (0): N=2, M=3\nlight_s_dict = dict() # (1): light_s_dict={}\nlight_n_dict = dict() # (2): light_n_dict={}\n\n\nfor i in range(1, M+1): # (3): i=1 (13): i=2 ... (29): NO CHANGE\n l = [int(j) for j in input().split()] # (4): l=[2, 1, 2] (14): l=[1, 1] (22): l=[1, 2]\n connected_s = [0]*N # (5): connected_s=[0, 0] (15): connected_s=[0, 0] (23): connected_s=[0, 0]\n for s in l[1:]: # (6): s=1 (8): s=2 ... (26): NO CHANGE\n connected_s[s-1] = 1 # (7): connected_s=[1, 0] (9): connected_s=[1, 1] ... (25): connected_s=[0, 1]\n light_s_dict[i] = connected_s # (11): light_s_dict={1: [1, 1]} (19): light_s_dict={1: [1, 1], 2: [1, 0]} (27): light_s_dict={1: [1, 1], 2: [1, 0], 3: [0, 1]}\n light_n_dict[i] = l[0] # (12): light_n_dict={1: 2} (20): light_n_dict={1: 2, 2: 1} (28): light_n_dict={1: 2, 2: 1, 3: 1}\n\n\ns_patterns = [] # (30): s_patterns=[]\nfor i in range(2**N): # (31): i=0 (34): i=1 ... (43): NO CHANGE\n p_str = bin(i)[2:].zfill(N) # (32): p_str=00 (35): p_str=01 ... (41): p_str=11\n s_patterns.append([int(i) for i in list(p_str)]) # (33): s_patterns (36): s_patterns ... (42): s_patterns\n \n\nlight_conditions = [int(p) for p in input().split()] # (44): light_conditions=[0, 1, 0]\n\n\nans = 0 # (45): ans=0\nfor pattern in s_patterns: # (46): pattern=[0, 0] (63): pattern=[0, 1] ... (116): NO CHANGE\n cond = 0 # (47): cond=0 (64): NO CHANGE ... (86): cond=0\n for light in range(1, M+1): # (48): light=1 (55): light=2 ... (114): NO CHANGE\n for i, p in enumerate(pattern): # (49): i=0, p=0 (51): i=1 ... (112): NO CHANGE\n if p == 1: # (50): NO CHANGE (52): NO CHANGE ... (110): NO CHANGE\n cond += light_s_dict[light][i] # (70): cond=1 (79): cond=1 ... (111): cond=4\n if cond % 2 != light_conditions[light-1]: # (54): NO CHANGE (61): NO CHANGE ... (113): NO CHANGE\n break # (62): NO CHANGE (73): NO CHANGE (84): NO CHANGE\n else: \n ans += 1 # (115): ans=1\nprint(ans)"], "anno_status": [false], "diff_content": " \n \n \n N, M = map(int, input().split())\n-light_s_dict = dict()\n-light_n_dict = dict()\n \n+light_s_dict = dict()\n \n-for i in range(1, M+1):\n+for i in range(M):\n l = [int(j) for j in input().split()]\n connected_s = [0]*N\n for s in l[1:]:\n connected_s[s-1] = 1\n light_s_dict[i] = connected_s\n- light_n_dict[i] = l[0]\n \n \n s_patterns = []\n for i in range(2**N):\n p_str = bin(i)[2:].zfill(N)\n s_patterns.append([int(i) for i in list(p_str)])\n \n \n light_conditions = [int(p) for p in input().split()]\n \n \n ans = 0\n for pattern in s_patterns:\n- cond = 0\n- for light in range(1, M+1): \n- for i, p in enumerate(pattern):\n+ for light in range(M): \n+ cond = 0 \n+ for i, p in enumerate(pattern): \n if p == 1:\n- cond += light_s_dict[light][i]\n- if cond % 2 != light_conditions[light-1]:\n+ cond += light_s_dict[light][i] \n+ if cond % 2 != light_conditions[light]:\n break\n else: \n ans += 1\n print(ans)\n", "FL_content": "\n \n \n \n N, M = map(int, input().split())\n light_s_dict = dict()\n light_n_dict = dict()\n \n \n for i in range(1, M+1):\n l = [int(j) for j in input().split()]\n connected_s = [0]*N\n for s in l[1:]:\n connected_s[s-1] = 1\n light_s_dict[i] = connected_s\n light_n_dict[i] = l[0]\n \n \n s_patterns = []\n for i in range(2**N):\n p_str = bin(i)[2:].zfill(N)\n s_patterns.append([int(i) for i in list(p_str)])\n \n \n light_conditions = [int(p) for p in input().split()]\n \n \n ans = 0\n for pattern in s_patterns:\n cond = 0\n for light in range(1, M+1): \n for i, p in enumerate(pattern):\n if p == 1:\n cond += light_s_dict[light][i]\n if cond % 2 != light_conditions[light-1]:\n break\n else: \n ans += 1\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 38 }, { "user_id": "u227020436", "problem_id": "p03291", "submission1_id": "s971494841-FL", "submission2_id": "s339830139", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n \nmodulo = 10 ** 9 + 7\n \nS = input()\n \ndef nleft(S, c):\n \n \n \n n = [0 for c in S]\n for i in range(len(S)):\n n[i] = n[i-1] + (1 if S[i-1] == c else 0)\n\n q = 0 \n pow3q = 1 \n for i in range(len(n)):\n if q > 0:\n n[i] *= pow3q \n n[i] += pow3q1 * q \n n[i] %= modulo\n if S[i] == '?':\n q += 1\n pow3q1 = pow3q\n pow3q = pow3q * 3 % modulo\n return n\n \ndef nright(S, c):\n \n n = [0 for c in S]\n for i in range(len(S) - 1, 0, -1):\n n[i-1] = n[i] + (1 if S[i] == c else 0)\n\n q = 0 \n pow3q = 1 \n for i in range(len(n) - 1, -1, -1):\n if q > 0:\n n[i] *= pow3q \n n[i] += pow3q1 * q \n n[i] %= modulo\n if S[i] == '?':\n q += 1\n pow3q1 = pow3q\n pow3q = pow3q * 3 % modulo\n return n\n \n \nleft = nleft (S, 'A')\nright = nright(S, 'C')\n \n\nabc = 0\nfor i in range(0, len(S)):\n if S[i] in 'B?':\n abc += left[i] * right[i]\n \nabc = int(abc) % modulo\nprint(abc)\n", "code2": "\n\n \nmodulo = 10 ** 9 + 7\n \nS = input()\n \ndef nleft(S, c):\n \n \n \n n = [0 for c in S]\n for i in range(1, len(S)):\n n[i] = n[i-1] + (1 if S[i-1] == c else 0)\n \n q = 0 \n pow3q = 1 \n for i in range(len(n)):\n if q > 0:\n n[i] *= pow3q \n n[i] += pow3q1 * q \n n[i] %= modulo\n if S[i] == '?':\n q += 1\n pow3q1 = pow3q\n pow3q = pow3q * 3 % modulo\n return n\n \ndef nright(S, c):\n \n n = [0 for c in S]\n for i in range(len(S) - 1, 0, -1):\n n[i-1] = n[i] + (1 if S[i] == c else 0)\n \n q = 0 \n pow3q = 1 \n for i in range(len(n) - 1, -1, -1):\n if q > 0:\n n[i] *= pow3q \n n[i] += pow3q1 * q \n n[i] %= modulo\n if S[i] == '?':\n q += 1\n pow3q1 = pow3q\n pow3q = pow3q * 3 % modulo\n return n\n \n \nleft = nleft (S, 'A')\nright = nright(S, 'C')\n \n\nabc = 0\nfor i in range(0, len(S)):\n if S[i] in 'B?':\n abc += left[i] * right[i]\n \nabc = int(abc) % modulo\nprint(abc)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1533591597", "date2": "1533594555", "bleu_score": "0.9913439974586936", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 101, "total_score": 103, "input": ">?@===A@;=@@C>??@??@=>A>A\n", "actual_output": "603\n", "expected_output": "252\n\n", "anno_code": ["\n\n \nmodulo = 10 ** 9 + 7 # (0): modulo=1000000007\n \nS = input() # (1): S=>?@===A@;=@@C>??@??@=>A>A\n \ndef nleft(S, c): # (2): nleft=\n \n \n \n n = [0 for c in S] # (5): n=[0, 0, ..., 0, 0]\n for i in range(len(S)): # (6): i=0 (8): i=1 ... (56): NO CHANGE\n n[i] = n[i-1] + (1 if S[i-1] == c else 0) # (7): n=[1, 0, ..., 0, 0] (9): n=[1, 1, ..., 0, 0] ... (55): n=[1, 1, ..., 3, 3]\n\n q = 0 # (57): q=0\n pow3q = 1 # (58): pow3q=1\n for i in range(len(n)): # (59): i=0 (62): i=1 ... (218): modulo=1000000007, nleft=, nright=, left=[1, 1, ..., 1134, 1134]\n if q > 0: # (60): NO CHANGE (63): NO CHANGE ... (213): NO CHANGE\n n[i] *= pow3q # (70): n=[1, 1, ..., 3, 3] (76): n=[1, 1, ..., 3, 3] ... (214): n=[1, 1, ..., 1134, 729]\n n[i] += pow3q1 * q # (71): n=[1, 1, ..., 3, 3] (77): n=[1, 1, ..., 3, 3] ... (215): n=[1, 1, ..., 1134, 1134]\n n[i] %= modulo # (72): NO CHANGE (78): NO CHANGE ... (216): NO CHANGE\n if S[i] == '?': # (61): NO CHANGE (64): NO CHANGE ... (217): NO CHANGE\n q += 1 # (65): q=1 (146): q=2 ... (179): q=5\n pow3q1 = pow3q # (66): pow3q1=1 (147): pow3q1=3 ... (180): pow3q1=81\n pow3q = pow3q * 3 % modulo # (67): pow3q=3 (148): pow3q=9 ... (181): pow3q=243\n return n\n \ndef nright(S, c): # (3): nright=\n \n n = [0 for c in S] # (220): n=[0, 0, ..., 0, 0]\n for i in range(len(S) - 1, 0, -1): # (221): i=24 (223): i=23 ... (269): NO CHANGE\n n[i-1] = n[i] + (1 if S[i] == c else 0) # (222): NO CHANGE (224): NO CHANGE ... (268): n=[1, 1, ..., 0, 0]\n\n q = 0 # (270): q=0\n pow3q = 1 # (271): pow3q=1\n for i in range(len(n) - 1, -1, -1): # (272): i=24 (275): i=23 ... (416): modulo=1000000007, nleft=, nright=, left=[1, 1, ..., 1134, 1134], right=[648, 189, ..., 0, 0]\n if q > 0: # (273): NO CHANGE (276): NO CHANGE ... (411): NO CHANGE\n n[i] *= pow3q # (298): NO CHANGE (307): NO CHANGE ... (412): n=[243, 189, ..., 0, 0]\n n[i] += pow3q1 * q # (299): n=[1, 1, ..., 0, 0] (308): n=[1, 1, ..., 0, 0] ... (413): n=[648, 189, ..., 0, 0]\n n[i] %= modulo # (300): NO CHANGE (309): NO CHANGE ... (414): NO CHANGE\n if S[i] == '?': # (274): NO CHANGE (277): NO CHANGE ... (415): NO CHANGE\n q += 1 # (293): q=1 (302): q=2 ... (407): q=5\n pow3q1 = pow3q # (294): pow3q1=1 (303): pow3q1=3 ... (408): pow3q1=81\n pow3q = pow3q * 3 % modulo # (295): pow3q=3 (304): pow3q=9 ... (409): pow3q=243\n return n\n \n \nleft = nleft (S, 'A') # (4): c=A\nright = nright(S, 'C') # (219): c=C\n \n\nabc = 0 # (417): abc=0\nfor i in range(0, len(S)): # (418): i=0 (420): i=1 ... (473): NO CHANGE\n if S[i] in 'B?': # (419): NO CHANGE (421): NO CHANGE ... (472): NO CHANGE\n abc += left[i] * right[i] # (422): abc=189 (449): abc=378 ... (460): NO CHANGE\n \nabc = int(abc) % modulo # (474): NO CHANGE\nprint(abc)\n"], "anno_status": [false], "diff_content": " \n \n \n modulo = 10 ** 9 + 7\n \n S = input()\n \n def nleft(S, c):\n \n \n \n n = [0 for c in S]\n- for i in range(len(S)):\n+ for i in range(1, len(S)):\n n[i] = n[i-1] + (1 if S[i-1] == c else 0)\n-\n+ \n q = 0 \n pow3q = 1 \n for i in range(len(n)):\n if q > 0:\n n[i] *= pow3q \n n[i] += pow3q1 * q \n n[i] %= modulo\n if S[i] == '?':\n q += 1\n pow3q1 = pow3q\n pow3q = pow3q * 3 % modulo\n return n\n \n def nright(S, c):\n \n n = [0 for c in S]\n for i in range(len(S) - 1, 0, -1):\n n[i-1] = n[i] + (1 if S[i] == c else 0)\n-\n+ \n q = 0 \n pow3q = 1 \n for i in range(len(n) - 1, -1, -1):\n if q > 0:\n n[i] *= pow3q \n n[i] += pow3q1 * q \n n[i] %= modulo\n if S[i] == '?':\n q += 1\n pow3q1 = pow3q\n pow3q = pow3q * 3 % modulo\n return n\n \n \n left = nleft (S, 'A')\n right = nright(S, 'C')\n \n \n abc = 0\n for i in range(0, len(S)):\n if S[i] in 'B?':\n abc += left[i] * right[i]\n \n abc = int(abc) % modulo\n print(abc)\n-\n", "FL_content": "\n \n \n \n modulo = 10 ** 9 + 7\n \n S = input()\n \n def nleft(S, c):\n \n \n \n n = [0 for c in S]\n for i in range(len(S)):\n n[i] = n[i-1] + (1 if S[i-1] == c else 0)\n \n q = 0 \n pow3q = 1 \n for i in range(len(n)):\n if q > 0:\n n[i] *= pow3q \n n[i] += pow3q1 * q \n n[i] %= modulo\n if S[i] == '?':\n q += 1\n pow3q1 = pow3q\n pow3q = pow3q * 3 % modulo\n return n\n \n def nright(S, c):\n \n n = [0 for c in S]\n for i in range(len(S) - 1, 0, -1):\n n[i-1] = n[i] + (1 if S[i] == c else 0)\n \n q = 0 \n pow3q = 1 \n for i in range(len(n) - 1, -1, -1):\n if q > 0:\n n[i] *= pow3q \n n[i] += pow3q1 * q \n n[i] %= modulo\n if S[i] == '?':\n q += 1\n pow3q1 = pow3q\n pow3q = pow3q * 3 % modulo\n return n\n \n \n left = nleft (S, 'A')\n right = nright(S, 'C')\n \n \n abc = 0\n for i in range(0, len(S)):\n if S[i] in 'B?':\n abc += left[i] * right[i]\n \n abc = int(abc) % modulo\n print(abc)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 60 }, { "user_id": "u190079347", "problem_id": "p03433", "submission1_id": "s062215171-FL", "submission2_id": "s997369149", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = int(input())\nif n % 500 <= a:\n print(\"YES\")\nelse:\n print(\"NO\")", "code2": "n = int(input())\na = int(input())\nif n % 500 <= a:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588188439", "date2": "1588188482", "bleu_score": "0.9305163849527504", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "2763\n-30\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["n = int(input()) # (0): n=2763\na = int(input()) # (1): a=-30\nif n % 500 <= a: # (2): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")"], "anno_status": [true], "diff_content": " n = int(input())\n a = int(input())\n if n % 500 <= a:\n- print(\"YES\")\n+ print(\"Yes\")\n else:\n- print(\"NO\")\n+ print(\"No\")\n", "FL_content": "\n n = int(input())\n a = int(input())\n-if n % 500 <= a:\n- print(\"YES\")\n else:\n- print(\"NO\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u714642969", "problem_id": "p02839", "submission1_id": "s941418214-FL", "submission2_id": "s735487167", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(10**9)\nINF=10**18\ndef input():\n return sys.stdin.readline().rstrip()\n\ndef main():\n H,W=map(int,input().split())\n A=[[] for _ in range(H)]\n B=[[] for _ in range(H)]\n C=[[0]*W for _ in range(H)]\n minusdigit=80\n for i in range(H):\n A[i]=list(map(int,input().split()))\n for i in range(H):\n B[i]=list(map(int,input().split()))\n for i in range(H):\n for j in range(W):\n C[i][j]=abs(A[i][j]-B[i][j])\n dp=[[0]*W for _ in range(H)]\n dp[0][0]=((1<>C[0][0])\n for i in range(1,H):\n dp[i][0]=(dp[i-1][0]<>C[i][0])\n for j in range(1,W):\n dp[0][j]=(dp[0][j-1]<>C[0][j])\n \n for i in range(1,H):\n for j in range(1,W):\n dp[i][j]=(dp[i-1][j]<>C[i][j])|(dp[i][j-1]<>C[i][j])\n ans=dp[H-1][W-1]>>minusdigit\n for i in range(len(bin(ans))-2):\n if (ans>>i)&0b1==1:\n print(i)\n exit()\n \n \n\nif __name__ == '__main__':\n main()\n", "code2": "import sys\nsys.setrecursionlimit(10**9)\nINF = 10**18\n\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\ndef main():\n H, W = map(int, input().split())\n A = [[] for _ in range(H)]\n B = [[] for _ in range(H)]\n C = [[0] * W for _ in range(H)]\n minusdigit = 80 * 80 * 2\n for i in range(H):\n A[i] = list(map(int, input().split()))\n for i in range(H):\n B[i] = list(map(int, input().split()))\n for i in range(H):\n for j in range(W):\n C[i][j] = abs(A[i][j] - B[i][j])\n dp = [[0] * W for _ in range(H)]\n dp[0][0] = ((1 << minusdigit) << C[0][0]) | ((1 << minusdigit) >> C[0][0])\n for i in range(1, H):\n dp[i][0] = (dp[i - 1][0] << C[i][0]) | (dp[i - 1][0] >> C[i][0])\n for j in range(1, W):\n dp[0][j] = (dp[0][j - 1] << C[0][j]) | (dp[0][j - 1] >> C[0][j])\n\n for i in range(1, H):\n for j in range(1, W):\n dp[i][j] = (dp[i - 1][j] << C[i][j]) | (dp[i - 1][j] >> C[i][j]) | (dp[i][j - 1] << C[i][j]) | (dp[i][j - 1] >> C[i][j])\n ans = dp[H - 1][W - 1]\n for i in range(len(bin(ans)) - (2 + minusdigit)):\n if (ans >> (i + minusdigit)) & 0b1 == 1 or (-i + minusdigit >= 0 and (ans >> (-i + minusdigit)) & 0b1 == 1):\n print(i)\n exit()\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575942575", "date2": "1575950024", "bleu_score": "0.732562541218604", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 95, "total_score": 102, "input": "1 3\n0 9 133\n80 14 1\n1 2 3\n4 2 11\n", "actual_output": "57\n", "expected_output": "47\n\n", "anno_code": ["import sys\nsys.setrecursionlimit(10**9) # (0): NO CHANGE\nINF=10**18 # (1): INF=1000000000000000000\ndef input(): # (2): input=\n return sys.stdin.readline().rstrip()\n\ndef main(): # (3): main=\n H,W=map(int,input().split())\n A=[[] for _ in range(H)]\n B=[[] for _ in range(H)]\n C=[[0]*W for _ in range(H)]\n minusdigit=80\n for i in range(H):\n A[i]=list(map(int,input().split()))\n for i in range(H):\n B[i]=list(map(int,input().split()))\n for i in range(H):\n for j in range(W):\n C[i][j]=abs(A[i][j]-B[i][j])\n dp=[[0]*W for _ in range(H)]\n dp[0][0]=((1<>C[0][0])\n for i in range(1,H):\n dp[i][0]=(dp[i-1][0]<>C[i][0])\n for j in range(1,W):\n dp[0][j]=(dp[0][j-1]<>C[0][j])\n \n for i in range(1,H):\n for j in range(1,W):\n dp[i][j]=(dp[i-1][j]<>C[i][j])|(dp[i][j-1]<>C[i][j])\n ans=dp[H-1][W-1]>>minusdigit\n for i in range(len(bin(ans))-2):\n if (ans>>i)&0b1==1:\n print(i)\n exit()\n \n \n\nif __name__ == '__main__':\n main()\n"], "anno_status": [false], "diff_content": " import sys\n sys.setrecursionlimit(10**9)\n-INF=10**18\n+INF = 10**18\n+\n+\n def input():\n return sys.stdin.readline().rstrip()\n \n+\n def main():\n- H,W=map(int,input().split())\n- A=[[] for _ in range(H)]\n- B=[[] for _ in range(H)]\n- C=[[0]*W for _ in range(H)]\n- minusdigit=80\n+ H, W = map(int, input().split())\n+ A = [[] for _ in range(H)]\n+ B = [[] for _ in range(H)]\n+ C = [[0] * W for _ in range(H)]\n+ minusdigit = 80 * 80 * 2\n for i in range(H):\n- A[i]=list(map(int,input().split()))\n+ A[i] = list(map(int, input().split()))\n for i in range(H):\n- B[i]=list(map(int,input().split()))\n+ B[i] = list(map(int, input().split()))\n for i in range(H):\n for j in range(W):\n- C[i][j]=abs(A[i][j]-B[i][j])\n- dp=[[0]*W for _ in range(H)]\n- dp[0][0]=((1<>C[0][0])\n- for i in range(1,H):\n- dp[i][0]=(dp[i-1][0]<>C[i][0])\n- for j in range(1,W):\n- dp[0][j]=(dp[0][j-1]<>C[0][j])\n- \n- for i in range(1,H):\n- for j in range(1,W):\n- dp[i][j]=(dp[i-1][j]<>C[i][j])|(dp[i][j-1]<>C[i][j])\n- ans=dp[H-1][W-1]>>minusdigit\n- for i in range(len(bin(ans))-2):\n- if (ans>>i)&0b1==1:\n+ C[i][j] = abs(A[i][j] - B[i][j])\n+ dp = [[0] * W for _ in range(H)]\n+ dp[0][0] = ((1 << minusdigit) << C[0][0]) | ((1 << minusdigit) >> C[0][0])\n+ for i in range(1, H):\n+ dp[i][0] = (dp[i - 1][0] << C[i][0]) | (dp[i - 1][0] >> C[i][0])\n+ for j in range(1, W):\n+ dp[0][j] = (dp[0][j - 1] << C[0][j]) | (dp[0][j - 1] >> C[0][j])\n+\n+ for i in range(1, H):\n+ for j in range(1, W):\n+ dp[i][j] = (dp[i - 1][j] << C[i][j]) | (dp[i - 1][j] >> C[i][j]) | (dp[i][j - 1] << C[i][j]) | (dp[i][j - 1] >> C[i][j])\n+ ans = dp[H - 1][W - 1]\n+ for i in range(len(bin(ans)) - (2 + minusdigit)):\n+ if (ans >> (i + minusdigit)) & 0b1 == 1 or (-i + minusdigit >= 0 and (ans >> (-i + minusdigit)) & 0b1 == 1):\n print(i)\n exit()\n- \n- \n+\n \n if __name__ == '__main__':\n main()\n \n", "FL_content": "\n import sys\n sys.setrecursionlimit(10**9)\n INF=10**18\n def input():\n return sys.stdin.readline().rstrip()\n \n def main():\n H,W=map(int,input().split())\n A=[[] for _ in range(H)]\n B=[[] for _ in range(H)]\n C=[[0]*W for _ in range(H)]\n minusdigit=80\n for i in range(H):\n A[i]=list(map(int,input().split()))\n for i in range(H):\n B[i]=list(map(int,input().split()))\n for i in range(H):\n for j in range(W):\n C[i][j]=abs(A[i][j]-B[i][j])\n- dp=[[0]*W for _ in range(H)]\n- dp[0][0]=((1<>C[0][0])\n for i in range(1,H):\n dp[i][0]=(dp[i-1][0]<>C[i][0])\n for j in range(1,W):\n dp[0][j]=(dp[0][j-1]<>C[0][j])\n \n for i in range(1,H):\n for j in range(1,W):\n dp[i][j]=(dp[i-1][j]<>C[i][j])|(dp[i][j-1]<>C[i][j])\n ans=dp[H-1][W-1]>>minusdigit\n for i in range(len(bin(ans))-2):\n if (ans>>i)&0b1==1:\n print(i)\n exit()\n \n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 40 }, { "user_id": "u313600138", "problem_id": "p02415", "submission1_id": "s448769392-FL", "submission2_id": "s191492663", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nfor c in s:\n if 'A' <= c and c <= 'Z':\n print(c.lower(), end='')\n elif 'a' <= c and c <= 'z':\n print(c.upper(), end='')\n else:\n print(c)\n", "code2": "s=input()\nfor c in s:\n if 'A' <= c and c <= 'Z':\n print(c.lower(), end='')\n elif 'a' <= c and c <= 'z':\n print(c.upper(), end='')\n else:\n print(c,end='')\nprint()\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1559544212", "date2": "1559544265", "bleu_score": "0.9057478707429393", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "g@RI, ,QSF@K OLKANOISACCY B.KUXPD\n", "actual_output": "G@\nri,\n \n,\nqsf@\nk \nolkanoisaccy \nb.\nkuxpd", "expected_output": "G@ri, ,qsf@k olkanoisaccy b.kuxpd\n\n", "anno_code": ["s=input() # (0): s=g@RI, ,QSF@K OLKANOISACCY B.KUXPD\nfor c in s: # (1): c=g (5): c=@ ... (106): c=D\n if 'A' <= c and c <= 'Z': # (2): NO CHANGE (6): NO CHANGE ... (107): NO CHANGE\n print(c.lower(), end='') # (11): NO CHANGE (14): NO CHANGE ... (108): NO CHANGE\n elif 'a' <= c and c <= 'z': # (3): NO CHANGE (7): NO CHANGE ... (92): NO CHANGE\n print(c.upper(), end='') # (4): NO CHANGE\n else:\n print(c) # (8): NO CHANGE (18): NO CHANGE ... (93): NO CHANGE\n"], "anno_status": [true], "diff_content": " s=input()\n for c in s:\n if 'A' <= c and c <= 'Z':\n print(c.lower(), end='')\n elif 'a' <= c and c <= 'z':\n print(c.upper(), end='')\n else:\n- print(c)\n+ print(c,end='')\n+print()\n \n", "FL_content": "\n s=input()\n for c in s:\n if 'A' <= c and c <= 'Z':\n- print(c.lower(), end='')\n elif 'a' <= c and c <= 'z':\n- print(c.upper(), end='')\n else:\n- print(c)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u672494157", "problem_id": "p03353", "submission1_id": "s661449400-FL", "submission2_id": "s920772467", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nfrom functools import reduce\nimport copy\nimport math\n\n\nsys.setrecursionlimit(4100000)\n\n\ndef inputs(num_of_input):\n ins = [input() for i in range(num_of_input)]\n return ins\n\n\ndef solve(inputs):\n S = inputs[0]\n K = int(inputs[1])\n\n sets = set()\n print(K)\n for i in range(len(S)):\n j = i\n while j < len(S) and j - i <= K:\n j += 1\n sets.add(S[i:j])\n new_sets = set()\n\n for k in sets:\n for i in range(len(k)):\n j = i\n while j < len(k) and j - i <= K:\n j += 1\n new_sets.add(k[i:j])\n l = list(new_sets)\n l.sort()\n return l[K-1]\n\n\ndef string_to_int(string):\n return list(map(int, string.split()))\n\n\nif __name__ == \"__main__\":\n ret = solve(inputs(2))\n print(ret)\n", "code2": "import sys\nfrom functools import reduce\nimport copy\nimport math\n\n\nsys.setrecursionlimit(4100000)\n\n\ndef inputs(num_of_input):\n ins = [input() for i in range(num_of_input)]\n return ins\n\n\ndef solve(inputs):\n S = inputs[0]\n K = int(inputs[1])\n\n sets = set()\n for i in range(len(S)):\n j = i\n while j < len(S) and j - i <= K:\n j += 1\n sets.add(S[i:j])\n new_sets = set()\n\n for k in sets:\n for i in range(len(k)):\n j = i\n while j < len(k) and j - i <= K:\n j += 1\n new_sets.add(k[i:j])\n l = list(new_sets)\n l.sort()\n return l[K-1]\n\n\ndef string_to_int(string):\n return list(map(int, string.split()))\n\n\nif __name__ == \"__main__\":\n ret = solve(inputs(2))\n print(ret)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568254465", "date2": "1568254511", "bleu_score": "0.9836378759303366", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "eab\n6\n", "actual_output": "6\neab\n", "expected_output": "eab\n\n", "anno_code": ["import sys\nfrom functools import reduce\nimport copy\nimport math\n\n\nsys.setrecursionlimit(4100000) # (0): NO CHANGE\n\n\ndef inputs(num_of_input): # (1): inputs=\n ins = [input() for i in range(num_of_input)]\n return ins\n\n\ndef solve(inputs): # (2): solve=\n S = inputs[0]\n K = int(inputs[1])\n\n sets = set()\n print(K)\n for i in range(len(S)):\n j = i\n while j < len(S) and j - i <= K:\n j += 1\n sets.add(S[i:j])\n new_sets = set()\n\n for k in sets:\n for i in range(len(k)):\n j = i\n while j < len(k) and j - i <= K:\n j += 1\n new_sets.add(k[i:j])\n l = list(new_sets)\n l.sort()\n return l[K-1]\n\n\ndef string_to_int(string): # (3): string_to_int=\n return list(map(int, string.split()))\n\n\nif __name__ == \"__main__\":\n ret = solve(inputs(2))\n print(ret)\n"], "anno_status": [true], "diff_content": " import sys\n from functools import reduce\n import copy\n import math\n \n \n sys.setrecursionlimit(4100000)\n \n \n def inputs(num_of_input):\n ins = [input() for i in range(num_of_input)]\n return ins\n \n \n def solve(inputs):\n S = inputs[0]\n K = int(inputs[1])\n \n sets = set()\n- print(K)\n for i in range(len(S)):\n j = i\n while j < len(S) and j - i <= K:\n j += 1\n sets.add(S[i:j])\n new_sets = set()\n \n for k in sets:\n for i in range(len(k)):\n j = i\n while j < len(k) and j - i <= K:\n j += 1\n new_sets.add(k[i:j])\n l = list(new_sets)\n l.sort()\n return l[K-1]\n \n \n def string_to_int(string):\n return list(map(int, string.split()))\n \n \n if __name__ == \"__main__\":\n ret = solve(inputs(2))\n print(ret)\n \n", "FL_content": "\n import sys\n from functools import reduce\n import copy\n import math\n \n \n sys.setrecursionlimit(4100000)\n \n \n def inputs(num_of_input):\n ins = [input() for i in range(num_of_input)]\n return ins\n \n \n def solve(inputs):\n S = inputs[0]\n K = int(inputs[1])\n \n sets = set()\n- print(K)\n for i in range(len(S)):\n j = i\n while j < len(S) and j - i <= K:\n j += 1\n sets.add(S[i:j])\n new_sets = set()\n \n for k in sets:\n for i in range(len(k)):\n j = i\n while j < len(k) and j - i <= K:\n j += 1\n new_sets.add(k[i:j])\n l = list(new_sets)\n l.sort()\n return l[K-1]\n \n \n def string_to_int(string):\n return list(map(int, string.split()))\n \n \n if __name__ == \"__main__\":\n ret = solve(inputs(2))\n print(ret)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 46 }, { "user_id": "u052746401", "problem_id": "p03129", "submission1_id": "s240700877-FL", "submission2_id": "s147407905", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int, input().split())\n\nif N > K:\n print('YES')\nelse:\n print('NO')\n", "code2": "N, K = map(int, input().split())\n\nif (N % 2 == 0 and N \n print('YES')\nelse:\n print('NO')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549764116", "date2": "1549764523", "bleu_score": "0.806746586426211", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 51, "total_score": 60, "input": "87 50\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["N, K = map(int, input().split()) # (0): N=87, K=50\n\nif N > K: # (1): NO CHANGE\n print('YES')\nelse:\n print('NO')\n"], "anno_status": [true], "diff_content": " N, K = map(int, input().split())\n \n-if N > K:\n+if (N % 2 == 0 and N \n print('YES')\n else:\n print('NO')\n \n", "FL_content": "\n N, K = map(int, input().split())\n \n-if N > K:\n print('YES')\n else:\n print('NO')\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u100813820", "problem_id": "p02413", "submission1_id": "s697242338-FL", "submission2_id": "s987936642", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nr,c = map( int,input().split() )\n\ndata = []\ncsum = [0]*c\n\nfor i in range(r):\n\tdata.append( list(map( int,input().split() )) )\n\nfor i in range( r ):\n\tfor j in range(c):\n\t\tprint(\"{0} \".format(data[i][j]), end=\"\")\n\t\tcsum[j] +=data[i][j]\n\tprint( sum(data[i]) )\n\n\n\n\n", "code2": "\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nr,c = map( int,input().split() )\n\ndata = []\ncsum = [0]*c\n\nfor i in range(r):\n\tdata.append( list(map( int,input().split() )) )\n\nfor i in range( r ):\n\tfor j in range(c):\n\t\tprint(\"{0} \".format(data[i][j]), end=\"\")\n\t\tcsum[j] +=data[i][j]\n\tprint( sum(data[i]) )\n\nfor j in range(c):\n\tprint(\"{0} \".format( csum[j] ), end=\"\" )\n\nprint( sum(csum) )", "original_language1": "Python3", "original_language2": "Python3", "date1": "1463626428", "date2": "1463626439", "bleu_score": "0.800235121248693", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "4 5\n1 1 11 8 8\n2 2 2 4 5\n3 5 0 0 2\n2 9 4 8 1\n", "actual_output": "1 1 11 8 8 29\n2 2 2 4 5 15\n3 5 0 0 2 10\n2 9 4 8 1 24\n", "expected_output": "1 1 11 8 8 29\n2 2 2 4 5 15\n3 5 0 0 2 10\n2 9 4 8 1 24\n8 17 17 20 16 78\n\n", "anno_code": ["\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nr,c = map( int,input().split() ) # (0): r=4, c=5\n\ndata = [] # (1): data=[]\ncsum = [0]*c # (2): csum=[0, 0, 0, 0, 0]\n\nfor i in range(r): # (3): i=0 (5): i=1 ... (11): NO CHANGE\n\tdata.append( list(map( int,input().split() )) ) # (4): data (6): data ... (10): data\n\nfor i in range( r ): # (12): i=0 (30): i=1 ... (66): i=3\n\tfor j in range(c): # (13): j=0 (16): j=1 ... (82): NO CHANGE\n\t\tprint(\"{0} \".format(data[i][j]), end=\"\") # (14): NO CHANGE (17): NO CHANGE ... (80): NO CHANGE\n\t\tcsum[j] +=data[i][j] # (15): csum=[1, 0, 0, 0, 0] (18): csum=[1, 1, 0, 0, 0] ... (81): csum=[8, 17, 17, 20, 16]\n\tprint( sum(data[i]) ) # (29): NO CHANGE (47): NO CHANGE ... (83): NO CHANGE\n\n\n\n\n"], "anno_status": [true], "diff_content": " \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n r,c = map( int,input().split() )\n \n data = []\n csum = [0]*c\n \n for i in range(r):\n \tdata.append( list(map( int,input().split() )) )\n \n for i in range( r ):\n \tfor j in range(c):\n \t\tprint(\"{0} \".format(data[i][j]), end=\"\")\n \t\tcsum[j] +=data[i][j]\n \tprint( sum(data[i]) )\n \n+for j in range(c):\n+\tprint(\"{0} \".format( csum[j] ), end=\"\" )\n \n-\n-\n-\n+print( sum(csum) )\n", "FL_content": "\n```\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n ", "added_lines": 0, "removed_lines": 0, "code1_lines": 75 }, { "user_id": "u931462344", "problem_id": "p03129", "submission1_id": "s624449788-FL", "submission2_id": "s051244006", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nn, k = map(int, input().split())\n\ncnt = 1\nfor i in range(1,n,2):\n cnt += 1\nif cnt < k:\n print(\"NO\")\nelse:\n print(\"YES\")", "code2": "import sys\n\nn, k = map(int, input().split())\n\ncnt = 0\nfor i in range(1,n+1,2):\n cnt += 1\nif cnt < k:\n print(\"NO\")\nelse:\n print(\"YES\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549764324", "date2": "1549765578", "bleu_score": "0.9587445563542245", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 59, "total_score": 60, "input": "98 50\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["import sys\n\nn, k = map(int, input().split()) # (0): n=98, k=50\n\ncnt = 1 # (1): cnt=1\nfor i in range(1,n,2): # (2): i=1 (4): i=3 ... (100): NO CHANGE\n cnt += 1 # (3): cnt=2 (5): cnt=3 ... (99): cnt=50\nif cnt < k: # (101): NO CHANGE\n print(\"NO\")\nelse:\n print(\"YES\")"], "anno_status": [true], "diff_content": " import sys\n \n n, k = map(int, input().split())\n \n-cnt = 1\n-for i in range(1,n,2):\n+cnt = 0\n+for i in range(1,n+1,2):\n cnt += 1\n if cnt < k:\n print(\"NO\")\n else:\n print(\"YES\")\n", "FL_content": "\n import sys\n \n n, k = map(int, input().split())\n \n-cnt = 1\n-for i in range(1,n,2):\n- cnt += 1\n-if cnt < k:\n print(\"NO\")\n else:\n print(\"YES\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u984276646", "problem_id": "p03086", "submission1_id": "s800001472-FL", "submission2_id": "s500050027", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nF = \"ATGC\"\ncnt = 0\nn = len(S)\nfor i in range(n-1):\n for j in range(i+1, n):\n flg = True\n for k in range(i, j):\n flg *= (S[k] in F)\n if flg:\n cnt = max(cnt, j - i)\nprint(cnt)\n", "code2": "S = input()\nF = \"ATGC\"\ncnt = 0\nn = len(S)\nfor i in range(n):\n for j in range(i+1, n+1):\n flg = True\n for k in range(i, j):\n flg *= (S[k] in F)\n if flg:\n cnt = max(cnt, j - i)\nprint(cnt)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593684123", "date2": "1593684273", "bleu_score": "0.9840104453068924", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "JUKVNIHT\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["S = input() # (0): S=JUKVNIHT\nF = \"ATGC\" # (1): F=ATGC\ncnt = 0 # (2): cnt=0\nn = len(S) # (3): n=8\nfor i in range(n-1): # (4): i=0 (90): i=1 ... (298): NO CHANGE\n for j in range(i+1, n): # (5): j=1 (11): j=2 ... (297): NO CHANGE\n flg = True # (6): flg=True (12): flg=True ... (292): flg=True\n for k in range(i, j): # (7): k=0 (9): NO CHANGE ... (295): NO CHANGE\n flg *= (S[k] in F) # (8): flg=0 (14): flg=0 ... (294): flg=0\n if flg: # (10): NO CHANGE (18): NO CHANGE ... (296): NO CHANGE\n cnt = max(cnt, j - i)\nprint(cnt)\n"], "anno_status": [true], "diff_content": " S = input()\n F = \"ATGC\"\n cnt = 0\n n = len(S)\n-for i in range(n-1):\n- for j in range(i+1, n):\n+for i in range(n):\n+ for j in range(i+1, n+1):\n flg = True\n for k in range(i, j):\n flg *= (S[k] in F)\n if flg:\n cnt = max(cnt, j - i)\n print(cnt)\n \n", "FL_content": "\n S = input()\n F = \"ATGC\"\n cnt = 0\n n = len(S)\n-for i in range(n-1):\n- for j in range(i+1, n):\n flg = True\n for k in range(i, j):\n flg *= (S[k] in F)\n if flg:\n cnt = max(cnt, j - i)\n print(cnt)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u460185449", "problem_id": "p03012", "submission1_id": "s466983457-FL", "submission2_id": "s811740409", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nW = list(map(int,input().split()))\nprint(W)\nans = 10 ** 9\nfor i in range(1,N):\n ans = min(ans, abs(sum(W[:i]) - sum(W[i:])))\nprint(ans)\n \n ", "code2": "N = int(input())\nW = list(map(int,input().split()))\nans = 10 ** 9\nfor i in range(1,N):\n ans = min(ans, abs(sum(W[:i]) - sum(W[i:])))\nprint(ans)\n \n ", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589126556", "date2": "1589126586", "bleu_score": "0.9504201648849708", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "8\n1 5 1 0 1 0 106 4\n", "actual_output": "[1, 5, 1, 0, 1, 0, 106, 4]\n102\n", "expected_output": "102\n\n", "anno_code": ["N = int(input()) # (0): N=8\nW = list(map(int,input().split())) # (1): W=[1, 5, 1, 0, 1, 0, 106, 4]\nprint(W) # (2): NO CHANGE\nans = 10 ** 9 # (3): ans=1000000000\nfor i in range(1,N): # (4): i=1 (6): i=2 ... (18): NO CHANGE\n ans = min(ans, abs(sum(W[:i]) - sum(W[i:]))) # (5): ans=116 (7): ans=106 ... (17): NO CHANGE\nprint(ans)\n \n "], "anno_status": [true], "diff_content": " N = int(input())\n W = list(map(int,input().split()))\n-print(W)\n ans = 10 ** 9\n for i in range(1,N):\n ans = min(ans, abs(sum(W[:i]) - sum(W[i:])))\n print(ans)\n \n \n", "FL_content": "\n N = int(input())\n W = list(map(int,input().split()))\n-print(W)\n ans = 10 ** 9\n for i in range(1,N):\n ans = min(ans, abs(sum(W[:i]) - sum(W[i:])))\n print(ans)\n- \n- \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u149475724", "problem_id": "p02639", "submission1_id": "s802544753-FL", "submission2_id": "s902163887", "status1": "Wrong Answer", "status2": "Accepted", "code1": "user_input = list(map(int, input().split()))\n\n\nindexOfZero = [x for x in range(0, 5) if user_input[x] == 0]\nprint(indexOfZero[0])", "code2": "user_input = list(map(int, input().split()))\n\n\nindexOfZero = [x for x in range(0, 5) if user_input[x] == 0]\nprint(indexOfZero[0] + 1)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597735042", "date2": "1597735137", "bleu_score": "0.9638477598135974", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "0\n", "expected_output": "1\n", "anno_code": ["user_input = list(map(int, input().split())) # (0): user_input=[0, 2, 3, 4, 5]\n\n\nindexOfZero = [x for x in range(0, 5) if user_input[x] == 0] # (1): indexOfZero=[0]\nprint(indexOfZero[0])"], "anno_status": [true], "diff_content": " user_input = list(map(int, input().split()))\n \n \n indexOfZero = [x for x in range(0, 5) if user_input[x] == 0]\n-print(indexOfZero[0])\n+print(indexOfZero[0] + 1)\n", "FL_content": "\n user_input = list(map(int, input().split()))\n \n \n-indexOfZero = [x for x in range(0, 5) if user_input[x] == 0]\n print(indexOfZero[0])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u197615397", "problem_id": "p02368", "submission1_id": "s912570064-FL", "submission2_id": "s974543153", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def solve():\n N, M = map(int, input().split())\n edges = [[] for _ in [0]*N]\n r_edges = [[] for _ in [0]*N]\n\n for _ in [0]*M:\n a, b = map(int, input().split())\n edges[a].append(b)\n r_edges[b].append(a)\n c = get_strongly_connected_components(edges, r_edges)\n group = [0]*N\n for i in range(len(c)):\n for v in c[i]:\n group[v] = i\n\n result = []\n append = result.append\n for _ in [0]*int(input()):\n a, b = map(int, input().split())\n append(\"1\" if group[a] == group[b] else \"0\")\n\n print(\"\\n\".join(result))\n\n\ndef get_strongly_connected_components(edges, r_edges):\n import sys\n sys.setrecursionlimit(10**7)\n v_count = len(edges)\n order = [0]*v_count\n k = 1\n\n def get_order(v):\n order[v] = 1\n nonlocal k\n for dest in edges[v]:\n if order[dest] == 0:\n get_order(dest)\n order[v] = k\n k += 1\n\n def get_components(v):\n order[v] = 0\n return [v] + [_v for dest in r_edges[v] if order[dest] > 0 for _v in get_components(dest)]\n\n get_order(0)\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n\nif __name__ == \"__main__\":\n solve()", "code2": "def solve():\n N, M = map(int, input().split())\n edges = [[] for _ in [0]*N]\n r_edges = [[] for _ in [0]*N]\n\n for _ in [0]*M:\n a, b = map(int, input().split())\n edges[a].append(b)\n r_edges[b].append(a)\n \n c = get_strongly_connected_components(edges, r_edges)\n group = [0]*N\n for i in range(len(c)):\n for v in c[i]:\n group[v] = i\n\n result = []\n append = result.append\n for _ in [0]*int(input()):\n a, b = map(int, input().split())\n append(\"1\" if group[a] == group[b] else \"0\")\n\n print(\"\\n\".join(result))\n\n\ndef get_strongly_connected_components(edges, r_edges):\n import sys\n sys.setrecursionlimit(10**7)\n v_count = len(edges)\n order = [0]*v_count\n k = 1\n\n def get_order(v):\n order[v] = 1\n nonlocal k\n for dest in edges[v]:\n if order[dest] == 0:\n get_order(dest)\n order[v] = k\n k += 1\n\n def get_components(v):\n order[v] = 0\n return [v] + [_v for dest in r_edges[v] if order[dest] > 0 for _v in get_components(dest)]\n\n [None for v in range(v_count) if order[v] == 0 and get_order(v)]\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n\nif __name__ == \"__main__\":\n solve()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1508055568", "date2": "1508056098", "bleu_score": "0.9511467536246383", "code1_test_status": [1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1], "code1_test_score": 30, "total_score": 101, "input": "7 6\n0 2\n2 0\n1 2\n4 4\n4 3\n3 2\n1\n0 1\n0 3\n2 6\n3 4\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["def solve(): # (0): solve=\n N, M = map(int, input().split())\n edges = [[] for _ in [0]*N]\n r_edges = [[] for _ in [0]*N]\n\n for _ in [0]*M:\n a, b = map(int, input().split())\n edges[a].append(b)\n r_edges[b].append(a)\n c = get_strongly_connected_components(edges, r_edges)\n group = [0]*N\n for i in range(len(c)):\n for v in c[i]:\n group[v] = i\n\n result = []\n append = result.append\n for _ in [0]*int(input()):\n a, b = map(int, input().split())\n append(\"1\" if group[a] == group[b] else \"0\")\n\n print(\"\\n\".join(result))\n\n\ndef get_strongly_connected_components(edges, r_edges): # (1): get_strongly_connected_components=\n import sys\n sys.setrecursionlimit(10**7)\n v_count = len(edges)\n order = [0]*v_count\n k = 1\n\n def get_order(v):\n order[v] = 1\n nonlocal k\n for dest in edges[v]:\n if order[dest] == 0:\n get_order(dest)\n order[v] = k\n k += 1\n\n def get_components(v):\n order[v] = 0\n return [v] + [_v for dest in r_edges[v] if order[dest] > 0 for _v in get_components(dest)]\n\n get_order(0)\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n\nif __name__ == \"__main__\":\n solve()"], "anno_status": [true], "diff_content": " def solve():\n N, M = map(int, input().split())\n edges = [[] for _ in [0]*N]\n r_edges = [[] for _ in [0]*N]\n \n for _ in [0]*M:\n a, b = map(int, input().split())\n edges[a].append(b)\n r_edges[b].append(a)\n+ \n c = get_strongly_connected_components(edges, r_edges)\n group = [0]*N\n for i in range(len(c)):\n for v in c[i]:\n group[v] = i\n \n result = []\n append = result.append\n for _ in [0]*int(input()):\n a, b = map(int, input().split())\n append(\"1\" if group[a] == group[b] else \"0\")\n \n print(\"\\n\".join(result))\n \n \n def get_strongly_connected_components(edges, r_edges):\n import sys\n sys.setrecursionlimit(10**7)\n v_count = len(edges)\n order = [0]*v_count\n k = 1\n \n def get_order(v):\n order[v] = 1\n nonlocal k\n for dest in edges[v]:\n if order[dest] == 0:\n get_order(dest)\n order[v] = k\n k += 1\n \n def get_components(v):\n order[v] = 0\n return [v] + [_v for dest in r_edges[v] if order[dest] > 0 for _v in get_components(dest)]\n \n- get_order(0)\n+ [None for v in range(v_count) if order[v] == 0 and get_order(v)]\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n \n if __name__ == \"__main__\":\n solve()\n", "FL_content": "\n def solve():\n N, M = map(int, input().split())\n edges = [[] for _ in [0]*N]\n r_edges = [[] for _ in [0]*N]\n \n for _ in [0]*M:\n a, b = map(int, input().split())\n edges[a].append(b)\n r_edges[b].append(a)\n c = get_strongly_connected_components(edges, r_edges)\n group = [0]*N\n for i in range(len(c)):\n for v in c[i]:\n group[v] = i\n \n result = []\n append = result.append\n for _ in [0]*int(input()):\n a, b = map(int, input().split())\n append(\"1\" if group[a] == group[b] else \"0\")\n \n print(\"\\n\".join(result))\n \n \n def get_strongly_connected_components(edges, r_edges):\n import sys\n sys.setrecursionlimit(10**7)\n v_count = len(edges)\n order = [0]*v_count\n k = 1\n \n def get_order(v):\n order[v] = 1\n nonlocal k\n for dest in edges[v]:\n if order[dest] == 0:\n get_order(dest)\n order[v] = k\n k += 1\n \n def get_components(v):\n order[v] = 0\n return [v] + [_v for dest in r_edges[v] if order[dest] > 0 for _v in get_components(dest)]\n \n get_order(0)\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n \n if __name__ == \"__main__\":\n solve()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 49 }, { "user_id": "u760961723", "problem_id": "p02843", "submission1_id": "s530765036-FL", "submission2_id": "s446300266", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X = int(input())\nif X >2000:\n print(\"1\")\nelse:\n for i in range(1,20,1):\n if not (X in range(100*i,105*i +1)) == False:\n print(\"1\")\n flag = True\n break\n else:\n print(\"0\")", "code2": "X = int(input())\nif X >2000:\n print(\"1\")\nelse:\n flag = False\n for i in range(1,20,1):\n if not (X in range(100*i,105*i +1)) == False:\n print(\"1\")\n flag = True\n break\n if flag ==False:\n print(\"0\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585697321", "date2": "1585697649", "bleu_score": "0.8756671814179192", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 26, "input": "173\n", "actual_output": "0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n", "expected_output": "0\n\n", "anno_code": ["X = int(input()) # (0): X=173\nif X >2000: # (1): NO CHANGE\n print(\"1\")\nelse:\n for i in range(1,20,1): # (2): i=1 (5): i=2 ... (56): i=19\n if not (X in range(100*i,105*i +1)) == False: # (3): NO CHANGE (6): NO CHANGE ... (57): NO CHANGE\n print(\"1\")\n flag = True\n break\n else:\n print(\"0\") # (4): NO CHANGE (7): NO CHANGE ... (58): NO CHANGE\n"], "anno_status": [true], "diff_content": " X = int(input())\n if X >2000:\n print(\"1\")\n else:\n+ flag = False\n for i in range(1,20,1):\n if not (X in range(100*i,105*i +1)) == False:\n print(\"1\")\n flag = True\n break\n- else:\n- print(\"0\")\n+ if flag ==False:\n+ print(\"0\")\n", "FL_content": "\n X = int(input())\n if X >2000:\n print(\"1\")\n else:\n- for i in range(1,20,1):\n- if not (X in range(100*i,105*i +1)) == False:\n- print(\"1\")\n- flag = True\n- break\n- else:\n- print(\"0\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u558528117", "problem_id": "p03856", "submission1_id": "s966245761-FL", "submission2_id": "s023355238", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\ndef solve(s):\n if s == \"\":\n return True\n elif s.endswith(\"dream\"):\n return solve(s[:-5])\n elif s.endswith(\"dreamer\"):\n return solve(s[:-7])\n elif s.endswith(\"erase\"):\n return solve(s[:-5])\n elif s.endswith(\"eraser\"):\n return solve(s[:-6])\n else:\n return False\n return False\n\n\ndef main():\n line = sys.stdin.readline()\n\n if solve(line):\n print(\"YES\")\n else:\n print(\"NO\")\n\n return 0\n\nif __name__ == '__main__':\n sys.exit(main())\n", "code2": "import sys\n\ndef solve(s):\n tmp_s = s\n while(len(tmp_s) > 0):\n if tmp_s.startswith(\"maerd\"):\n tmp_s = tmp_s[5:]\n elif tmp_s.startswith(\"remaerd\"):\n tmp_s = tmp_s[7:]\n elif tmp_s.startswith(\"esare\"):\n tmp_s = tmp_s[5:]\n elif tmp_s.startswith(\"resare\"):\n tmp_s = tmp_s[6:]\n else:\n return False\n\n return True\n\ndef main():\n line = sys.stdin.readline().rstrip()\n line_rev = line[::-1]\n\n if solve(line_rev):\n print(\"YES\")\n else:\n print(\"NO\")\n\n return 0\n\nif __name__ == '__main__':\n sys.exit(main())\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1492901645", "date2": "1492948313", "bleu_score": "0.6221692314045402", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "NO\n", "expected_output": "YES\n", "anno_code": ["import sys\n\ndef solve(s): # (0): solve=\n if s == \"\":\n return True\n elif s.endswith(\"dream\"):\n return solve(s[:-5])\n elif s.endswith(\"dreamer\"):\n return solve(s[:-7])\n elif s.endswith(\"erase\"):\n return solve(s[:-5])\n elif s.endswith(\"eraser\"):\n return solve(s[:-6])\n else:\n return False\n return False\n\n\ndef main(): # (1): main=\n line = sys.stdin.readline()\n\n if solve(line):\n print(\"YES\")\n else:\n print(\"NO\")\n\n return 0\n\nif __name__ == '__main__':\n sys.exit(main())\n"], "anno_status": [true], "diff_content": " import sys\n \n def solve(s):\n- if s == \"\":\n- return True\n- elif s.endswith(\"dream\"):\n- return solve(s[:-5])\n- elif s.endswith(\"dreamer\"):\n- return solve(s[:-7])\n- elif s.endswith(\"erase\"):\n- return solve(s[:-5])\n- elif s.endswith(\"eraser\"):\n- return solve(s[:-6])\n- else:\n- return False\n- return False\n+ tmp_s = s\n+ while(len(tmp_s) > 0):\n+ if tmp_s.startswith(\"maerd\"):\n+ tmp_s = tmp_s[5:]\n+ elif tmp_s.startswith(\"remaerd\"):\n+ tmp_s = tmp_s[7:]\n+ elif tmp_s.startswith(\"esare\"):\n+ tmp_s = tmp_s[5:]\n+ elif tmp_s.startswith(\"resare\"):\n+ tmp_s = tmp_s[6:]\n+ else:\n+ return False\n \n+ return True\n \n def main():\n- line = sys.stdin.readline()\n+ line = sys.stdin.readline().rstrip()\n+ line_rev = line[::-1]\n \n- if solve(line):\n+ if solve(line_rev):\n print(\"YES\")\n else:\n print(\"NO\")\n \n return 0\n \n if __name__ == '__main__':\n sys.exit(main())\n \n", "FL_content": "\n import sys\n \n def solve(s):\n if s == \"\":\n return True\n- elif s.endswith(\"dream\"):\n return solve(s[:-5])\n- elif s.endswith(\"dreamer\"):\n return solve(s[:-7])\n- elif s.endswith(\"erase\"):\n return solve(s[:-5])\n- elif s.endswith(\"eraser\"):\n return solve(s[:-6])\n else:\n return False\n return False\n \n \n def main():\n line = sys.stdin.readline()\n \n if solve(line):\n print(\"YES\")\n else:\n print(\"NO\")\n \n return 0\n \n if __name__ == '__main__':\n sys.exit(main())\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 31 }, { "user_id": "u757827098", "problem_id": "p02410", "submission1_id": "s681956776-FL", "submission2_id": "s515347797", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m =[int(r) for r in input().split()]\n\nmatrix = []\nfor ni in range(n):\n matrix.append([int(a)for a in input().split()])\n\nvector = []\nfor mi in range(m):\n vector.append(int(input()))\n\nfor i in range(len(matrix)):\n\n sum = 0\n for j in range(len(matrix[i])):\n\n sum += matrix[i][j] * vector[j]", "code2": "n,m =[int(r) for r in input().split()]\n\nmatrix = []\nfor ni in range(n):\n matrix.append([int(a)for a in input().split()])\n\nvector = []\nfor mi in range(m):\n vector.append(int(input()))\n\nfor ni in range(n):\n\n sum = 0\n for mi in range(m):\n sum += matrix[ni][mi] * vector[mi]\n\n print(sum)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1470112853", "date2": "1470113014", "bleu_score": "0.8851677329098987", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 4\n0 7 -13 0\n0 0 0 1\n4 2 2 0\n1\n1\n3\n-1\n", "actual_output": "no output\n", "expected_output": "-32\n-1\n12\n\n", "anno_code": ["n,m =[int(r) for r in input().split()] # (0): n=3, m=4\n\nmatrix = [] # (1): matrix=[]\nfor ni in range(n): # (2): ni=0 (4): ni=1 ... (8): NO CHANGE\n matrix.append([int(a)for a in input().split()]) # (3): matrix=[[0, 7, -13, 0]] (5): matrix (7): matrix\n\nvector = [] # (9): vector=[]\nfor mi in range(m): # (10): mi=0 (12): mi=1 ... (18): NO CHANGE\n vector.append(int(input())) # (11): vector=[1] (13): vector=[1, 1] ... (17): vector=[1, 1, 3, -1]\n\nfor i in range(len(matrix)): # (19): i=0 (30): i=1 (41): i=2\n\n sum = 0 # (20): sum=0 (31): sum=0 (42): sum=0\n for j in range(len(matrix[i])): # (21): j=0 (23): j=1 ... (51): NO CHANGE\n\n sum += matrix[i][j] * vector[j] # (22): NO CHANGE (24): sum=7 ... (50): NO CHANGE\n"], "anno_status": [true], "diff_content": " n,m =[int(r) for r in input().split()]\n \n matrix = []\n for ni in range(n):\n matrix.append([int(a)for a in input().split()])\n \n vector = []\n for mi in range(m):\n vector.append(int(input()))\n \n-for i in range(len(matrix)):\n+for ni in range(n):\n \n sum = 0\n- for j in range(len(matrix[i])):\n+ for mi in range(m):\n+ sum += matrix[ni][mi] * vector[mi]\n \n- sum += matrix[i][j] * vector[j]\n+ print(sum)\n", "FL_content": "\n n,m =[int(r) for r in input().split()]\n \n matrix = []\n for ni in range(n):\n matrix.append([int(a)for a in input().split()])\n \n vector = []\n for mi in range(m):\n vector.append(int(input()))\n \n for i in range(len(matrix)):\n \n sum = 0\n for j in range(len(matrix[i])):\n \n sum += matrix[i][j] * vector[j]\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u584529823", "problem_id": "p03254", "submission1_id": "s503282936-FL", "submission2_id": "s248277399", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, x = map(int, input().split())\nalist = list(map(int, input().split()))\n\nmax = 0\nfor i in range(1, N + 1):\n if sum(sorted(alist)[:i]) <= x:\n max = i\nprint(max)", "code2": "N, x = map(int, input().split())\na = list(map(int, input().split()))\n\na.sort()\nmax = 0\nfor i in range(1, N + 1):\n if sum(a[:i]) <= x:\n max = i\nif sum(a[:N + 1]) < x:\n print(N - 1)\nelse:\n print(max)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560105155", "date2": "1560107604", "bleu_score": "0.7204032212748392", "code1_test_status": [0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0], "code1_test_score": 70, "total_score": 104, "input": "3 24\n0 2 5\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["N, x = map(int, input().split()) # (0): N=3, x=24\nalist = list(map(int, input().split())) # (1): alist=[0, 2, 5]\n\nmax = 0 # (2): max=0\nfor i in range(1, N + 1): # (3): i=1 (6): i=2 ... (12): NO CHANGE\n if sum(sorted(alist)[:i]) <= x: # (4): NO CHANGE (7): NO CHANGE (10): NO CHANGE\n max = i # (5): max=1 (8): max=2 (11): max=3\nprint(max)"], "anno_status": [true], "diff_content": " N, x = map(int, input().split())\n-alist = list(map(int, input().split()))\n+a = list(map(int, input().split()))\n \n+a.sort()\n max = 0\n for i in range(1, N + 1):\n- if sum(sorted(alist)[:i]) <= x:\n+ if sum(a[:i]) <= x:\n max = i\n-print(max)\n+if sum(a[:N + 1]) < x:\n+ print(N - 1)\n+else:\n+ print(max)\n", "FL_content": "\n N, x = map(int, input().split())\n alist = list(map(int, input().split()))\n \n max = 0\n for i in range(1, N + 1):\n- if sum(sorted(alist)[:i]) <= x:\n max = i\n print(max)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u247457760", "problem_id": "p02595", "submission1_id": "s969982157-FL", "submission2_id": "s062030964", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nn, d = map(int, input().split())\n\ncount = 0\n\nfor i in range(n):\n x, y = map(int, input().split())\n if math.sqrt((x)**2 + (y)**2) <= d:\n count += 1\n else:\n break\n\nprint(count)", "code2": "import math\n\nn, d = map(int, input().split())\n\ncount = 0\n\nfor i in range(n):\n x, y = map(int, input().split())\n if math.sqrt((x)**2 + (y)**2) <= d:\n count += 1\n\nprint(count)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596417535", "date2": "1596417647", "bleu_score": "0.8999449396997149", "code1_test_status": [0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0], "code1_test_score": 54, "total_score": 103, "input": "12 3\n0 1\n1 1\n1 1\n1 2\n0 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n3 3\n", "actual_output": "5\n", "expected_output": "7\n\n", "anno_code": ["import math\n\nn, d = map(int, input().split()) # (0): n=12, d=3\n\ncount = 0 # (1): count=0\n\nfor i in range(n): # (2): i=0 (6): i=1 ... (22): i=5\n x, y = map(int, input().split()) # (3): x=0, y=1 (7): x=1 ... (23): x=1, y=3\n if math.sqrt((x)**2 + (y)**2) <= d: # (4): NO CHANGE (8): NO CHANGE ... (24): NO CHANGE\n count += 1 # (5): count=1 (9): count=2 ... (21): count=5\n else:\n break # (25): NO CHANGE\n\nprint(count)"], "anno_status": [true], "diff_content": " import math\n \n n, d = map(int, input().split())\n \n count = 0\n \n for i in range(n):\n x, y = map(int, input().split())\n if math.sqrt((x)**2 + (y)**2) <= d:\n count += 1\n- else:\n- break\n \n print(count)\n", "FL_content": "\n import math\n \n n, d = map(int, input().split())\n \n count = 0\n \n for i in range(n):\n x, y = map(int, input().split())\n- if math.sqrt((x)**2 + (y)**2) <= d:\n count += 1\n- else:\n- break\n \n print(count)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u356832650", "problem_id": "p03505", "submission1_id": "s460037745-FL", "submission2_id": "s393259520", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport math\nK, A, B = list(map(int, input().split()))\n\nif A >= K:\n print(1)\n sys.exit()\nelif (A - B) <= 0:\n print(-1)\n sys.exit()\nd = A - B\n\np = K-A\nq = p/d\nif (p % d) != 0:\n q += 1\nprint(2*q + 1)", "code2": "import sys\nimport math\nK, A, B = list(map(int, input().split()))\n \nif (A >= K):\n print('1')\n sys.exit()\nelif (A - B) <= 0:\n print('-1')\n sys.exit()\nd = A-B\np = K-A\nq = int(p\nif ((p % d) != 0):\n q += 1\nprint(str(2*q + 1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512520028", "date2": "1512521288", "bleu_score": "0.846868983078784", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 3, "total_score": 103, "input": "0100001110111000010 4 1\n", "actual_output": "6.666740674066667e+16\n", "expected_output": "66667406740666673\n\n", "anno_code": ["import sys\nimport math\nK, A, B = list(map(int, input().split())) # (0): K=100001110111000010, A=4, B=1\n\nif A >= K: # (1): NO CHANGE\n print(1)\n sys.exit()\nelif (A - B) <= 0: # (2): NO CHANGE\n print(-1)\n sys.exit()\nd = A - B # (3): d=3\n\np = K-A # (4): p=100001110111000006\nq = p/d # (5): q=33333703370333336\nif (p % d) != 0: # (6): NO CHANGE\n q += 1 # (7): NO CHANGE\nprint(2*q + 1)"], "anno_status": [true], "diff_content": " import sys\n import math\n K, A, B = list(map(int, input().split()))\n-\n-if A >= K:\n- print(1)\n+ \n+if (A >= K):\n+ print('1')\n sys.exit()\n elif (A - B) <= 0:\n- print(-1)\n+ print('-1')\n sys.exit()\n-d = A - B\n-\n+d = A-B\n p = K-A\n-q = p/d\n-if (p % d) != 0:\n+q = int(p\n+if ((p % d) != 0):\n q += 1\n-print(2*q + 1)\n+print(str(2*q + 1))\n", "FL_content": "\n import sys\n import math\n K, A, B = list(map(int, input().split()))\n \n if A >= K:\n print(1)\n sys.exit()\n elif (A - B) <= 0:\n print(-1)\n sys.exit()\n d = A - B\n \n p = K-A\n-q = p/d\n if (p % d) != 0:\n q += 1\n-print(2*q + 1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u813098295", "problem_id": "p03012", "submission1_id": "s665223582-FL", "submission2_id": "s387868164", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nw = sorted([ int(x) for x in input().split() ])\nans = sum(w)\nl, r = 0, sum(w)\nfor i in range(n):\n l += w[i]\n r -= w[i]\n ans = min(ans, abs(l-r))\n\nprint(ans)\n", "code2": "n = int(input())\nw = [ int(x) for x in input().split() ]\nans = sum(w)\nl, r = 0, sum(w)\nfor i in range(n):\n l += w[i]\n r -= w[i]\n ans = min(ans, abs(l-r))\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585472820", "date2": "1585472915", "bleu_score": "0.9329130351131311", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 4, "total_score": 100, "input": "8\n1 5 20 0 0 1 106 5\n", "actual_output": "74\n", "expected_output": "84\n\n", "anno_code": ["n = int(input()) # (0): n=8\nw = sorted([ int(x) for x in input().split() ]) # (1): w=[0, 0, 1, 1, 5, 5, 20, 106]\nans = sum(w) # (2): ans=138\nl, r = 0, sum(w) # (3): l=0, r=138\nfor i in range(n): # (4): i=0 (8): i=1 ... (36): NO CHANGE\n l += w[i] # (5): NO CHANGE (9): NO CHANGE ... (33): l=138\n r -= w[i] # (6): NO CHANGE (10): NO CHANGE ... (34): r=0\n ans = min(ans, abs(l-r)) # (7): NO CHANGE (11): NO CHANGE ... (35): NO CHANGE\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " n = int(input())\n-w = sorted([ int(x) for x in input().split() ])\n+w = [ int(x) for x in input().split() ]\n ans = sum(w)\n l, r = 0, sum(w)\n for i in range(n):\n l += w[i]\n r -= w[i]\n ans = min(ans, abs(l-r))\n \n print(ans)\n-\n", "FL_content": "\n n = int(input())\n w = sorted([ int(x) for x in input().split() ])\n-ans = sum(w)\n-l, r = 0, sum(w)\n for i in range(n):\n l += w[i]\n r -= w[i]\n ans = min(ans, abs(l-r))\n \n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u739815962", "problem_id": "p03012", "submission1_id": "s948219536-FL", "submission2_id": "s966981182", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=0\nt_list=[]\ntry:\n t_list = [int(n) for n in input().split(' ')]\nexcept:\n print('age,price must be numbers')\n sys.exit(1)\n\nmin_v = 10000\nfor i in range(n):\n diff = abs(sum(t_list[0:i]) - sum(t_list[i:n]))\n if min_v > diff:\n min_v = diff\nprint(min_v)", "code2": "n=0\nt_list=[]\ntry:\n n=int(input())\n t_list = [int(n) for n in input().split(' ')]\nexcept:\n print('age,price must be numbers')\n sys.exit(1)\n\nmin_v = 10000\nfor i in range(n):\n diff = abs(sum(t_list[0:i]) - sum(t_list[i:n]))\n if min_v > diff:\n min_v = diff\nprint(min_v)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560130787", "date2": "1560130854", "bleu_score": "0.9255617524705966", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "8\n1 5 10 0 1 0 190 0\n", "actual_output": "10000\n", "expected_output": "173\n\n", "anno_code": ["n=0 # (0): n=0\nt_list=[] # (1): t_list=[]\ntry: # (2): NO CHANGE\n t_list = [int(n) for n in input().split(' ')] # (3): t_list=[8]\nexcept:\n print('age,price must be numbers')\n sys.exit(1)\n\nmin_v = 10000 # (4): min_v=10000\nfor i in range(n): # (5): NO CHANGE\n diff = abs(sum(t_list[0:i]) - sum(t_list[i:n]))\n if min_v > diff:\n min_v = diff\nprint(min_v)"], "anno_status": [true], "diff_content": " n=0\n t_list=[]\n try:\n- t_list = [int(n) for n in input().split(' ')]\n+ n=int(input())\n+ t_list = [int(n) for n in input().split(' ')]\n except:\n print('age,price must be numbers')\n sys.exit(1)\n \n min_v = 10000\n for i in range(n):\n diff = abs(sum(t_list[0:i]) - sum(t_list[i:n]))\n if min_v > diff:\n min_v = diff\n print(min_v)\n", "FL_content": "\n n=0\n t_list=[]\n try:\n t_list = [int(n) for n in input().split(' ')]\n except:\n print('age,price must be numbers')\n sys.exit(1)\n \n min_v = 10000\n-for i in range(n):\n diff = abs(sum(t_list[0:i]) - sum(t_list[i:n]))\n if min_v > diff:\n min_v = diff\n print(min_v)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u121921603", "problem_id": "p02865", "submission1_id": "s714047246-FL", "submission2_id": "s775572162", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nif n%2 == 0:\n print(n>>1-1)\nelse:\n print(n>>1)\n", "code2": "n=int(input())\nif n%2 == 0:\n print((n>>1)-1)\nelse:\n print(n>>1)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1573351529", "date2": "1573351653", "bleu_score": "0.9370299028591313", "code1_test_status": [1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 31, "total_score": 46, "input": "1412384\n", "actual_output": "1412384\n", "expected_output": "706191\n\n", "anno_code": ["n=int(input()) # (0): n=1412384\nif n%2 == 0: # (1): NO CHANGE\n print(n>>1-1)\nelse:\n print(n>>1)\n"], "anno_status": [true], "diff_content": " n=int(input())\n if n%2 == 0:\n- print(n>>1-1)\n+ print((n>>1)-1)\n else:\n print(n>>1)\n \n", "FL_content": "\n n=int(input())\n if n%2 == 0:\n- print(n>>1-1)\n else:\n- print(n>>1)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u342801789", "problem_id": "p02601", "submission1_id": "s666502921-FL", "submission2_id": "s659435844", "status1": "Wrong Answer", "status2": "Accepted", "code1": "numbers = [int(s) for s in input().split()] \nK = int(input())\nfor i in range(K):\n if(numbers[2] < numbers[0]):\n numbers[2] *= 2\n \n elif(numbers[1] < numbers[0]):\n numbers[1] *= 2\n \n elif(numbers[2] < numbers[1]):\n numbers[2] *= 2\n \n else:\n break\nif(numbers[1] > numbers[0] and numbers[2] > numbers[1]):\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "numbers = [int(s) for s in input().split()] \nK = int(input())\nfor i in range(K):\n if(numbers[2] <= numbers[0]):\n numbers[2] *= 2\n elif(numbers[1] <= numbers[0]):\n numbers[1] *= 2\n elif(numbers[2] <= numbers[1]):\n numbers[2] *= 2\n else:\n break\nif(numbers[1] > numbers[0] and numbers[2] > numbers[1]):\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595728746", "date2": "1595728947", "bleu_score": "0.9197232137037599", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 63, "total_score": 102, "input": "4 2 5\n3\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["numbers = [int(s) for s in input().split()] # (0): numbers=[4, 2, 5]\nK = int(input()) # (1): K=3\nfor i in range(K): # (2): i=0 (6): i=1\n if(numbers[2] < numbers[0]): # (3): NO CHANGE (7): NO CHANGE\n numbers[2] *= 2\n \n elif(numbers[1] < numbers[0]): # (4): NO CHANGE (8): NO CHANGE\n numbers[1] *= 2 # (5): numbers=[4, 4, 5]\n \n elif(numbers[2] < numbers[1]): # (9): NO CHANGE\n numbers[2] *= 2\n \n else:\n break # (10): NO CHANGE\nif(numbers[1] > numbers[0] and numbers[2] > numbers[1]): # (11): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " numbers = [int(s) for s in input().split()] \n K = int(input())\n for i in range(K):\n- if(numbers[2] < numbers[0]):\n+ if(numbers[2] <= numbers[0]):\n numbers[2] *= 2\n- \n- elif(numbers[1] < numbers[0]):\n+ elif(numbers[1] <= numbers[0]):\n numbers[1] *= 2\n- \n- elif(numbers[2] < numbers[1]):\n+ elif(numbers[2] <= numbers[1]):\n numbers[2] *= 2\n- \n else:\n break\n if(numbers[1] > numbers[0] and numbers[2] > numbers[1]):\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": "\n numbers = [int(s) for s in input().split()] \n K = int(input())\n for i in range(K):\n if(numbers[2] < numbers[0]):\n numbers[2] *= 2\n \n elif(numbers[1] < numbers[0]):\n numbers[1] *= 2\n \n elif(numbers[2] < numbers[1]):\n numbers[2] *= 2\n \n else:\n break\n-if(numbers[1] > numbers[0] and numbers[2] > numbers[1]):\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u170650966", "problem_id": "p03698", "submission1_id": "s019583391-FL", "submission2_id": "s325834829", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(input())\ns.sort()\nflag = True\nfor i in range(len(s) - 1):\n if s[i] == [i + 1]:\n flag = False\n\nif flag:\n print(\"yes\")\nelse:\n print(\"no\")\n", "code2": "s = list(input())\ns.sort()\nflag = True\nfor i in range(len(s) - 1):\n if s[i] == s[i + 1]:\n flag = False\n\nif flag:\n print(\"yes\")\nelse:\n print(\"no\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1551569309", "date2": "1551569364", "bleu_score": "0.9843489635453336", "code1_test_status": [0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0], "code1_test_score": 36, "total_score": 103, "input": "gmfidfqju\n", "actual_output": "yes\n", "expected_output": "no\n\n", "anno_code": ["s = list(input()) # (0): s=['g', 'm', 'f', 'i', 'd', 'f', 'q', 'j', 'u']\ns.sort() # (1): s=['d', 'f', 'f', 'g', 'i', 'j', 'm', 'q', 'u']\nflag = True # (2): flag=True\nfor i in range(len(s) - 1): # (3): i=0 (5): i=1 ... (19): NO CHANGE\n if s[i] == [i + 1]: # (4): NO CHANGE (6): NO CHANGE ... (18): NO CHANGE\n flag = False\n\nif flag: # (20): NO CHANGE\n print(\"yes\")\nelse:\n print(\"no\")\n"], "anno_status": [true], "diff_content": " s = list(input())\n s.sort()\n flag = True\n for i in range(len(s) - 1):\n- if s[i] == [i + 1]:\n+ if s[i] == s[i + 1]:\n flag = False\n \n if flag:\n print(\"yes\")\n else:\n print(\"no\")\n \n", "FL_content": "\n s = list(input())\n s.sort()\n flag = True\n for i in range(len(s) - 1):\n- if s[i] == [i + 1]:\n flag = False\n \n if flag:\n print(\"yes\")\n else:\n print(\"no\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u459798349", "problem_id": "p02537", "submission1_id": "s318530079-FL", "submission2_id": "s311580522", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\ndef segfunc(x, y):\n return max(x,y)\n\n\n\nide_ele = 0\n\n\n\n\nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n\n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n\n def query(self, l, r):\n \n res = self.ide_ele\n\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\n\n\nn,k=map(int,input().split())\nA=[int(input()) for i in range(n)]\n\nT=[0 for i in range(300000+1)]\nT=SegTree(T,segfunc,ide_ele)\n\nfor num in A:\n now=T.query(max(0,num-k),min(num+k+1,n))\n \n T.update(num,now+1)\n\nprint(T.query(0,n+1))\n\n", "code2": "\n\ndef segfunc(x, y):\n return max(x,y)\n\n\n\nide_ele = 0\n\n\n\n\nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n\n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n\n def query(self, l, r):\n \n res = self.ide_ele\n\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\n\n\nn,k=map(int,input().split())\nA=[int(input()) for i in range(n)]\n\nT=[0 for i in range(300000+1)]\nT=SegTree(T,segfunc,ide_ele)\n\nfor num in A:\n now=T.query(max(0,num-k),min(num+k+1,300002))\n \n T.update(num,now+1)\n\nprint(T.query(0,300001))\n\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601176685", "date2": "1601176908", "bleu_score": "0.9896841759230526", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 91, "total_score": 101, "input": "10 3\n0\n5\n4\n3\n8\n11\n9\n7\n6\n2\n", "actual_output": "5\n", "expected_output": "6\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n \n def segfunc(x, y):\n return max(x,y)\n \n \n \n ide_ele = 0\n \n \n \n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n \n \n n,k=map(int,input().split())\n A=[int(input()) for i in range(n)]\n \n T=[0 for i in range(300000+1)]\n T=SegTree(T,segfunc,ide_ele)\n \n for num in A:\n- now=T.query(max(0,num-k),min(num+k+1,n))\n+ now=T.query(max(0,num-k),min(num+k+1,300002))\n \n T.update(num,now+1)\n \n-print(T.query(0,n+1))\n+print(T.query(0,300001))\n \n \n", "FL_content": "\n \n \n def segfunc(x, y):\n return max(x,y)\n \n \n \n ide_ele = 0\n \n \n \n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n \n \n n,k=map(int,input().split())\n A=[int(input()) for i in range(n)]\n \n T=[0 for i in range(300000+1)]\n T=SegTree(T,segfunc,ide_ele)\n \n for num in A:\n now=T.query(max(0,num-k),min(num+k+1,n))\n \n T.update(num,now+1)\n \n-print(T.query(0,n+1))\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 68 }, { "user_id": "u887207211", "problem_id": "p03712", "submission1_id": "s215868105-FL", "submission2_id": "s805083979", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, W = map(int,input().split())\nA = [input() for _ in range(H)]\n\nresult = []\nfor a in A:\n result.append('*' + a +'*')\nwaku = '*' * (W+2)\nresult.insert(0,waku)\nresult.insert(len(A)+1,waku)\nfor r in result:\n print(r)", "code2": "H, W = map(int,input().split())\nA = [input() for _ in range(H)]\n\nresult = []\nfor a in A:\n result.append('\nwaku = '\nresult.insert(0,waku)\nresult.insert(len(A)+1,waku)\nfor r in result:\n print(r)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1545366567", "date2": "1545366681", "bleu_score": "0.8808053425582472", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "1 2\nx\n", "actual_output": "****\n*x*\n****\n", "expected_output": "####\n#x#\n####\n\n", "anno_code": ["H, W = map(int,input().split()) # (0): H=1, W=2\nA = [input() for _ in range(H)] # (1): A=['x']\n\nresult = [] # (2): result=[]\nfor a in A: # (3): a=x (5): NO CHANGE\n result.append('*' + a +'*') # (4): result=['*x*']\nwaku = '*' * (W+2) # (6): waku=****\nresult.insert(0,waku) # (7): result=['****', '*x*']\nresult.insert(len(A)+1,waku) # (8): result=['****', '*x*', '****']\nfor r in result: # (9): r=**** (11): r=*x* (13): r=****\n print(r) # (10): NO CHANGE (12): NO CHANGE (14): NO CHANGE\n"], "anno_status": [true], "diff_content": " H, W = map(int,input().split())\n A = [input() for _ in range(H)]\n \n result = []\n for a in A:\n- result.append('*' + a +'*')\n-waku = '*' * (W+2)\n+ result.append('\n+waku = '\n result.insert(0,waku)\n result.insert(len(A)+1,waku)\n for r in result:\n print(r)\n+\n+\n", "FL_content": "\n H, W = map(int,input().split())\n A = [input() for _ in range(H)]\n \n result = []\n for a in A:\n result.append('*' + a +'*')\n waku = '*' * (W+2)\n result.insert(0,waku)\n result.insert(len(A)+1,waku)\n for r in result:\n print(r)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u073852194", "problem_id": "p04000", "submission1_id": "s652555474-FL", "submission2_id": "s904933082", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\n\nH,W,N = map(int,input().split())\nD = defaultdict(bool)\nB = []\n\nfor _ in range(N):\n a,b = map(lambda x: int(x)-1,input().split())\n D[(a,b)] = True\n B.append((a,b))\n\nans = [0 for _ in range(10)]\n\nfor a,b in B:\n for i in range(9):\n ix,iy = divmod(i,3)\n if a-ix<0 or b-iy<0:\n continue\n black_count = 0\n for j in range(9):\n jx,jy = divmod(j,3)\n if H<=a-ix+jx or W<=b-iy+jy:\n break\n if D[(a-ix+jx,b-iy+jy)]:\n if -ix+jx<0 or (-ix+jx==0 and -iy+jy<0):\n print(a,b,ix,iy,jx,jy,-ix+jx,-iy+jy)\n break\n black_count += 1\n else:\n ans[black_count] += 1\n\nans[0] = (H-2)*(W-2)-sum(ans)\nprint(*ans,sep='\\n')", "code2": "from collections import defaultdict\nimport sys\ninput = sys.stdin.readline\n\nH,W,N = map(int,input().split())\nD = defaultdict(bool)\nB = []\n\nfor _ in range(N):\n a,b = map(lambda x: int(x)-1,input().split())\n D[(a,b)] = True\n B.append((a,b))\n\nans = [0 for _ in range(10)]\n\nfor a,b in B:\n for i in range(9):\n ix,iy = divmod(i,3)\n if a-ix<0 or b-iy<0:\n continue\n black_count = 0\n for j in range(9):\n jx,jy = divmod(j,3)\n if H<=a-ix+jx or W<=b-iy+jy:\n break\n if (a-ix+jx,b-iy+jy) in D:\n if -iy+jy<0 or (-iy+jy==0 and -ix+jx<0):\n break\n black_count += 1\n else:\n ans[black_count] += 1\n\nans[0] = (H-2)*(W-2)-sum(ans)\nprint(*ans,sep='\\n')", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1579059095", "date2": "1579060945", "bleu_score": "0.9245423766643245", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 14, "total_score": 103, "input": "10 10 20\n0 1\n1 4\n1 9\n2 5\n3 6\n4 1\n1 7\n5 9\n6 4\n6 6\n6 7\n2 2\n7 3\n7 8\n16 1\n8 5\n8 10\n9 4\n17 4\n4 9\n", "actual_output": "0 8 0 2 0 0 0 -2\n1 4 1 0 0 2 -1 2\n1 4 1 1 0 0 -1 -1\n1 4 1 2 0 1 -1 -1\n2 5 1 1 0 0 -1 -1\n2 5 1 2 0 1 -1 -1\n2 5 2 0 0 1 -2 1\n2 5 2 1 0 2 -2 1\n2 5 2 2 0 0 -2 -2\n3 0 2 0 0 1 -2 1\n4 8 1 0 0 0 -1 0\n4 8 1 1 0 1 -1 0\n4 8 1 2 0 2 -1 0\n4 8 2 1 1 1 -1 0\n4 8 2 2 1 2 -1 0\n5 5 0 2 0 0 0 -2\n5 5 1 2 1 0 0 -2\n5 5 2 2 2 0 0 -2\n5 6 0 1 0 0 0 -1\n5 6 0 2 0 1 0 -1\n5 6 1 0 0 2 -1 2\n5 6 1 1 1 0 0 -1\n5 6 1 2 1 1 0 -1\n5 6 2 0 0 2 -2 2\n5 6 2 1 2 0 0 -1\n5 6 2 2 2 1 0 -1\n1 1 1 0 0 2 -1 2\n6 2 1 0 0 1 -1 1\n6 2 1 1 0 2 -1 1\n6 2 2 0 1 1 -1 1\n6 2 2 1 1 2 -1 1\n6 7 1 1 0 0 -1 -1\n6 7 1 2 0 0 -1 -2\n6 7 2 0 0 1 -2 1\n6 7 2 1 0 2 -2 1\n6 7 2 2 1 0 -1 -2\n7 4 1 2 0 0 -1 -2\n7 4 2 0 0 1 -2 1\n7 4 2 1 0 0 -2 -1\n7 4 2 2 0 1 -2 -1\n7 9 1 2 0 0 -1 -2\n7 9 2 2 1 0 -1 -2\n8 3 1 0 0 1 -1 1\n8 3 1 1 0 2 -1 1\n8 3 2 0 1 1 -1 1\n8 3 2 1 0 0 -2 -1\n8 3 2 2 0 1 -2 -1\n5\n23\n26\n10\n0\n0\n0\n0\n0\n0\n", "expected_output": "5\n23\n26\n10\n0\n0\n0\n0\n0\n0\n\n", "anno_code": ["from collections import defaultdict\n\nH,W,N = map(int,input().split()) # (0): H=10, W=10, N=20\nD = defaultdict(bool) # (1): D=defaultdict(, {})\nB = [] # (2): B=[]\n\nfor _ in range(N): # (3): _=0 (7): _=1 ... (83): NO CHANGE\n a,b = map(lambda x: int(x)-1,input().split()) # (4): a=-1, b=0 (8): a=0, b=3 ... (80): a=3, b=8\n D[(a,b)] = True # (5): D=defaultdict(, {(-1, 0): True}) (9): D=defaultdict(, {(-1, 0): True, (0, 3): True}) ... (81): D=defaultdict(, {(-1, 0): True, (0, 3): True, (0, 8): True, (1, 4): True, (2, 5): True, (3, 0): True, (0, 6): True, (4, 8): True, (5, 3): True, (5, 5): True, (5, 6): True, (1, 1): True, (6, 2): True, (6, 7): True, (15, 0): True, (7, 4): True, (7, 9): True, (8, 3): True, (16, 3): True, (3, 8): True})\n B.append((a,b)) # (6): B=[(-1, 0)] (10): B=[(-1, 0), (0, 3)] ... (82): B=[(-1, 0), (0, 3), (0, 8), (1, 4), (2, 5), (3, 0), (0, 6), (4, 8), (5, 3), (5, 5), (5, 6), (1, 1), (6, 2), (6, 7), (15, 0), (7, 4), (7, 9), (8, 3), (16, 3), (3, 8)]\n\nans = [0 for _ in range(10)] # (84): ans=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\nfor a,b in B: # (85): a=-1, b=0 (123): a=0, b=3 ... (4254): NO CHANGE\n for i in range(9): # (86): i=0 (90): i=1 ... (4253): NO CHANGE\n ix,iy = divmod(i,3) # (87): ix=0, iy=0 (91): iy=1 ... (4210): iy=2\n if a-ix<0 or b-iy<0: # (88): NO CHANGE (92): NO CHANGE ... (4211): NO CHANGE\n continue # (89): NO CHANGE (93): NO CHANGE ... (3169): NO CHANGE\n black_count = 0 # (127): black_count=0 (175): black_count=0 ... (4212): black_count=0\n for j in range(9): # (128): j=0 (134): j=1 ... (4251): NO CHANGE\n jx,jy = divmod(j,3) # (129): jx=0, jy=0 (135): jy=1 ... (4246): jy=2\n if H<=a-ix+jx or W<=b-iy+jy: # (130): NO CHANGE (136): NO CHANGE ... (4247): NO CHANGE\n break # (307): NO CHANGE (1145): NO CHANGE ... (4164): NO CHANGE\n if D[(a-ix+jx,b-iy+jy)]: # (131): NO CHANGE (137): D=defaultdict(, {(-1, 0): True, (0, 3): True, (0, 8): True, (1, 4): True, (2, 5): True, (3, 0): True, (0, 6): True, (4, 8): True, (5, 3): True, (5, 5): True, (5, 6): True, (1, 1): True, (6, 2): True, (6, 7): True, (15, 0): True, (7, 4): True, (7, 9): True, (8, 3): True, (16, 3): True, (3, 8): True, (0, 4): False}) ... (4248): NO CHANGE\n if -ix+jx<0 or (-ix+jx==0 and -iy+jy<0): # (132): NO CHANGE (150): NO CHANGE ... (4249): NO CHANGE\n print(a,b,ix,iy,jx,jy,-ix+jx,-iy+jy) # (361): NO CHANGE (542): NO CHANGE ... (3851): NO CHANGE\n break # (362): NO CHANGE (543): NO CHANGE ... (3852): NO CHANGE\n black_count += 1 # (133): black_count=1 (151): black_count=2 ... (4250): black_count=1\n else:\n ans[black_count] += 1 # (171): ans=[0, 0, 0, 1, 0, 0, 0, 0, 0, 0] (217): ans=[0, 0, 1, 1, 0, 0, 0, 0, 0, 0] ... (4252): ans=[0, 23, 26, 10, 0, 0, 0, 0, 0, 0]\n\nans[0] = (H-2)*(W-2)-sum(ans) # (4255): ans=[5, 23, 26, 10, 0, 0, 0, 0, 0, 0]\nprint(*ans,sep='\\n')"], "anno_status": [false], "diff_content": " from collections import defaultdict\n+import sys\n+input = sys.stdin.readline\n \n H,W,N = map(int,input().split())\n D = defaultdict(bool)\n B = []\n \n for _ in range(N):\n a,b = map(lambda x: int(x)-1,input().split())\n D[(a,b)] = True\n B.append((a,b))\n \n ans = [0 for _ in range(10)]\n \n for a,b in B:\n for i in range(9):\n ix,iy = divmod(i,3)\n if a-ix<0 or b-iy<0:\n continue\n black_count = 0\n for j in range(9):\n jx,jy = divmod(j,3)\n if H<=a-ix+jx or W<=b-iy+jy:\n break\n- if D[(a-ix+jx,b-iy+jy)]:\n- if -ix+jx<0 or (-ix+jx==0 and -iy+jy<0):\n- print(a,b,ix,iy,jx,jy,-ix+jx,-iy+jy)\n+ if (a-ix+jx,b-iy+jy) in D:\n+ if -iy+jy<0 or (-iy+jy==0 and -ix+jx<0):\n break\n black_count += 1\n else:\n ans[black_count] += 1\n \n ans[0] = (H-2)*(W-2)-sum(ans)\n print(*ans,sep='\\n')\n", "FL_content": "\n from collections import defaultdict\n \n H,W,N = map(int,input().split())\n D = defaultdict(bool)\n B = []\n \n for _ in range(N):\n a,b = map(lambda x: int(x)-1,input().split())\n D[(a,b)] = True\n B.append((a,b))\n \n ans = [0 for _ in range(10)]\n \n for a,b in B:\n for i in range(9):\n ix,iy = divmod(i,3)\n if a-ix<0 or b-iy<0:\n continue\n black_count = 0\n for j in range(9):\n jx,jy = divmod(j,3)\n if H<=a-ix+jx or W<=b-iy+jy:\n break\n if D[(a-ix+jx,b-iy+jy)]:\n if -ix+jx<0 or (-ix+jx==0 and -iy+jy<0):\n- print(a,b,ix,iy,jx,jy,-ix+jx,-iy+jy)\n break\n black_count += 1\n else:\n ans[black_count] += 1\n \n ans[0] = (H-2)*(W-2)-sum(ans)\n print(*ans,sep='\\n')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 33 }, { "user_id": "u652150585", "problem_id": "p03291", "submission1_id": "s333767120-FL", "submission2_id": "s245567337", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\ntable=[[0 for _ in range(4)] for _ in range(len(s)+1)]\nabc='ABC'\nfor i in range(len(s)):\n table[i][0]=1\n for j in range(3):\n if s[i]=='?':\n table[i+1][j+1]=3*table[i][j+1]+table[i][j]\n elif s[i]==abc[j]:\n table[i+1][j+1]=table[i][j+1]+table[i][j]\n else:\n table[i+1][j+1]=table[i][j+1]\n\nprint(table[i+1][j+1]%(10*9+7))", "code2": "s=input()\ntable=[[0 for _ in range(4)] for _ in range(len(s)+1)]\ntable[0][0]=1\nabc='ABC'\nfor i in range(len(s)):\n for j in range(4):\n if s[i]=='?' and j!=0:\n table[i+1][j]=(3*table[i][j]+table[i][j-1])%(10**9+7)\n elif s[i]=='?':\n table[i+1][0]=3*table[i][0]%(10**9+7)\n elif s[i]==abc[j-1] and j!=0:\n table[i+1][j]=(table[i][j]+table[i][j-1])%(10**9+7)\n else:\n table[i+1][j]=table[i][j]%(10**9+7)\n\nprint(table[i+1][j]%(10**9+7))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1545022507", "date2": "1545023947", "bleu_score": "0.7069121726979721", "code1_test_status": [1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 7, "total_score": 103, "input": "?9>=>B=>@B??=>B=>@B??> k) & 1 == 0:\n continue\n for x,y in evidence[k]:\n if (j >> x) & 1 != y:\n consistent = False\n break\n if not consistent:\n break\n else:\n result = max(result, bin(i)[2:].count(\"1\"))\nprint(result)", "code2": "N = int(input())\nevidence = [[] for _ in range(N)]\nfor i in range(N):\n A = int(input())\n for _ in range(A):\n x,y = map(int,input().split())\n evidence[i].append((x-1,y))\nresult = 0\nfor j in range(1,2**N):\n consistent = True\n for k in range(N):\n if (j >> k) & 1 == 0:\n continue\n for x,y in evidence[k]:\n if (j >> x) & 1 != y:\n consistent = False\n break\n if not consistent:\n break\n if consistent:\n result = max(result, bin(j)[2:].count(\"1\"))\nprint(result)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592775163", "date2": "1592775279", "bleu_score": "0.9676239038820383", "code1_test_status": [1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 61, "total_score": 103, "input": "3\n1\n3 1\n1\n2 1\n0\n1 0\n", "actual_output": "1\n", "expected_output": "3\n\n", "anno_code": ["N = int(input()) # (0): N=3\nevidence = [[] for _ in range(N)] # (1): evidence\nfor i in range(N): # (2): i=0 (8): evidence, i=1 ... (17): evidence\n A = int(input()) # (3): A=1 (9): evidence (15): evidence, A=0\n for _ in range(A): # (4): _=0 (7): evidence ... (16): evidence\n x,y = map(int,input().split()) # (5): x=3, y=1 (11): evidence, x=2\n evidence[i].append((x-1,y)) # (6): evidence (12): evidence\nresult = 0 # (18): evidence, result=0\nfor j in range(1,2**N): # (19): evidence, j=1 (29): evidence, j=2 ... (123): evidence\n consistent = True # (20): evidence, consistent=True (30): evidence, consistent=True ... (104): evidence\n for k in range(N): # (21): evidence, k=0 (31): evidence ... (121): evidence\n if (j >> k) & 1 == 0: # (22): evidence (32): evidence ... (118): evidence\n continue # (33): evidence (42): evidence ... (90): evidence\n for x,y in evidence[k]: # (23): evidence (36): evidence, x=1 ... (119): evidence\n if (j >> x) & 1 != y: # (24): evidence (37): evidence ... (114): evidence\n consistent = False # (25): evidence, consistent=False (51): evidence, consistent=False\n break # (26): evidence (52): evidence\n if not consistent: # (27): evidence (39): evidence ... (120): evidence\n break # (28): evidence (54): evidence\n else:\n result = max(result, bin(i)[2:].count(\"1\")) # (44): evidence, result=1 (68): evidence ... (122): evidence\nprint(result)"], "anno_status": [true], "diff_content": " N = int(input())\n evidence = [[] for _ in range(N)]\n for i in range(N):\n A = int(input())\n for _ in range(A):\n x,y = map(int,input().split())\n evidence[i].append((x-1,y))\n result = 0\n for j in range(1,2**N):\n consistent = True\n for k in range(N):\n if (j >> k) & 1 == 0:\n continue\n for x,y in evidence[k]:\n if (j >> x) & 1 != y:\n consistent = False\n break\n if not consistent:\n break\n- else:\n- result = max(result, bin(i)[2:].count(\"1\"))\n+ if consistent:\n+ result = max(result, bin(j)[2:].count(\"1\"))\n print(result)\n", "FL_content": "\n N = int(input())\n evidence = [[] for _ in range(N)]\n for i in range(N):\n A = int(input())\n for _ in range(A):\n x,y = map(int,input().split())\n evidence[i].append((x-1,y))\n result = 0\n for j in range(1,2**N):\n consistent = True\n for k in range(N):\n if (j >> k) & 1 == 0:\n continue\n for x,y in evidence[k]:\n if (j >> x) & 1 != y:\n consistent = False\n break\n if not consistent:\n break\n else:\n result = max(result, bin(i)[2:].count(\"1\"))\n print(result)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u090972687", "problem_id": "p02720", "submission1_id": "s013146411-FL", "submission2_id": "s168151011", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\n\nk = int(input())\n\nque = deque([1,2,3,4,5,6,7,8,9])\n\nfor n in range(0, k):\n x = que.popleft()\n if x % 10 != 0:\n que.append(x * 10 + x % 10 - 1)\n que.append(10*x)\n if x % 10 != 9:\n que.append(x * 10 + x % 10 + 1)\n\nprint(x)", "code2": "from collections import deque\n\nk = int(input())\n\nque = deque([1,2,3,4,5,6,7,8,9])\n\nfor n in range(0, k):\n x = que.popleft()\n if x % 10 != 0:\n que.append(x * 10 + x % 10 - 1)\n que.append(x * 10 + x % 10)\n if x % 10 != 9:\n que.append(x * 10 + x % 10 + 1)\n\nprint(x)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586055443", "date2": "1586055630", "bleu_score": "0.943528708919775", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "333\n", "actual_output": "21201\n", "expected_output": "10100\n\n", "anno_code": ["from collections import deque\n\nk = int(input()) # (0): k=333\n\nque = deque([1,2,3,4,5,6,7,8,9]) # (1): que=deque([21232, 21230, 21234, 20000, 20001, 20010, 20010, 20012, 20100, 20101, 20100, 20101, 20121, 20120, 20123, 23210, 23210, 23212, 23200, 23201, 23232, 23230, 23234, 23000, 23001, 23010, 23010, 23012, 23432, 23430, 23434, 23400, 23401, 23454, 23450, 23456, 32100, 32101, 32100, 32101, 32121, 32120, 32123, 32000, 32001, 32010, 32010, 32012, 32321, 32320, 32323, 32300, 32301, 32343, 32340, 32345, 30000, 30001, 30010, 30010, 30012, 30100, 30101, 30100, 30101, 30121, 30120, 30123, 34321, 34320, 34323, 34300, 34301, 34343, 34340, 34345, 34000, 34001, 34010, 34010, 34012, 34543, 34540, 34545, 34500, 34501, 34565, 34560, 34567, 43210, 43210, 43212, 43200, 43201, 43232, 43230, 43234, 43000, 43001, 43010, 43010, 43012, 43432, 43430, 43434, 43400, 43401, 43454, 43450, 43456, 40000, 40001, 40010, 40010, 40012, 40100, 40101, 40100, 40101, 40121, 40120, 40123, 45432, 45430, 45434, 45400, 45401, 45454, 45450, 45456, 45000, 45001, 45010, 45010, 45012, 45654, 45650, 45656, 45600, 45601, 45676, 45670, 45678, 54321, 54320, 54323, 54300, 54301, 54343, 54340, 54345, 54000, 54001, 54010, 54010, 54012, 54543, 54540, 54545, 54500, 54501, 54565, 54560, 54567, 50000, 50001, 50010, 50010, 50012, 50100, 50101, 50100, 50101, 50121, 50120, 50123, 56543, 56540, 56545, 56500, 56501, 56565, 56560, 56567, 56000, 56001, 56010, 56010, 56012, 56765, 56760, 56767, 56700, 56701, 56787, 56780, 56789, 65432, 65430, 65434, 65400, 65401, 65454, 65450, 65456, 65000, 65001, 65010, 65010, 65012, 65654, 65650, 65656, 65600, 65601, 65676, 65670, 65678, 60000, 60001, 60010, 60010, 60012, 60100, 60101, 60100, 60101, 60121, 60120, 60123, 67654, 67650, 67656, 67600, 67601, 67676, 67670, 67678, 67000, 67001, 67010, 67010, 67012, 67876, 67870, 67878, 67800, 67801, 67898, 67890, 76543, 76540, 76545, 76500, 76501, 76565, 76560, 76567, 76000, 76001, 76010, 76010, 76012, 76765, 76760, 76767, 76700, 76701, 76787, 76780, 76789, 70000, 70001, 70010, 70010, 70012, 70100, 70101, 70100, 70101, 70121, 70120, 70123, 78765, 78760, 78767, 78700, 78701, 78787, 78780, 78789, 78000, 78001, 78010, 78010, 78012, 78987, 78980, 78989, 78900, 78901, 87654, 87650, 87656, 87600, 87601, 87676, 87670, 87678, 87000, 87001, 87010, 87010, 87012, 87876, 87870, 87878, 87800, 87801, 87898, 87890, 80000, 80001, 80010, 80010, 80012, 80100, 80101, 80100, 80101, 80121, 80120, 80123, 89876, 89870, 89878, 89800, 89801, 89898, 89890, 89000, 89001, 89010, 89010, 89012, 98765, 98760, 98767, 98700, 98701, 98787, 98780, 98789, 98000, 98001, 98010, 98010, 98012, 98987, 98980, 98989, 98900, 98901, 90000, 90001, 90010, 90010, 90012, 90100, 90101, 90100, 90101, 90121, 90120, 90123, 100000, 100001, 100010, 100010, 100012, 100100, 100101, 100100, 100101, 100121, 100120, 100123, 101000, 101001, 101010, 101010, 101012, 101000, 101001, 101010, 101010, 101012, 101210, 101210, 101212, 101200, 101201, 101232, 101230, 101234, 100000, 100001, 100010, 100010, 100012, 100100, 100101, 100100, 100101, 100121, 100120, 100123, 101000, 101001, 101010, 101010, 101012, 101000, 101001, 101010, 101010, 101012, 101210, 101210, 101212, 101200, 101201, 101232, 101230, 101234, 121000, 121001, 121010, 121010, 121012, 121000, 121001, 121010, 121010, 121012, 121210, 121210, 121212, 121200, 121201, 121232, 121230, 121234, 120000, 120001, 120010, 120010, 120012, 120100, 120101, 120100, 120101, 120121, 120120, 120123, 123210, 123210, 123212, 123200, 123201, 123232, 123230, 123234, 123000, 123001, 123010, 123010, 123012, 123432, 123430, 123434, 123400, 123401, 123454, 123450, 123456, 210000, 210001, 210010, 210010, 210012, 210100, 210101, 210100, 210101, 210121, 210120, 210123, 210000, 210001, 210010, 210010, 210012, 210100, 210101, 210100, 210101, 210121, 210120, 210123, 212100, 212101, 212100, 212101, 212121, 212120, 212123, 212000, 212001, 212010, 212010, 212012])\n\nfor n in range(0, k): # (2): n=0 (9): n=1 ... (2180): NO CHANGE\n x = que.popleft() # (3): x=1 (10): x=2 ... (2174): x=21201\n if x % 10 != 0: # (4): NO CHANGE (11): NO CHANGE ... (2175): NO CHANGE\n que.append(x * 10 + x % 10 - 1) # (5): NO CHANGE (12): NO CHANGE ... (2176): NO CHANGE\n que.append(10*x) # (6): NO CHANGE (13): NO CHANGE ... (2177): NO CHANGE\n if x % 10 != 9: # (7): NO CHANGE (14): NO CHANGE ... (2178): NO CHANGE\n que.append(x * 10 + x % 10 + 1) # (8): NO CHANGE (15): NO CHANGE ... (2179): NO CHANGE\n\nprint(x)"], "anno_status": [false], "diff_content": " from collections import deque\n \n k = int(input())\n \n que = deque([1,2,3,4,5,6,7,8,9])\n \n for n in range(0, k):\n x = que.popleft()\n if x % 10 != 0:\n que.append(x * 10 + x % 10 - 1)\n- que.append(10*x)\n+ que.append(x * 10 + x % 10)\n if x % 10 != 9:\n que.append(x * 10 + x % 10 + 1)\n \n print(x)\n", "FL_content": "\n from collections import deque\n \n k = int(input())\n \n que = deque([1,2,3,4,5,6,7,8,9])\n \n for n in range(0, k):\n x = que.popleft()\n if x % 10 != 0:\n que.append(x * 10 + x % 10 - 1)\n que.append(10*x)\n if x % 10 != 9:\n que.append(x * 10 + x % 10 + 1)\n \n-print(x)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u093500767", "problem_id": "p04044", "submission1_id": "s913879993-FL", "submission2_id": "s807884239", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, l = map(int, input().split())\n\nlist = []\nfor _ in range(n):\n list.append(input())\n\nlist.sort()\nstr = \"\"\nfor s in list:\n str += s\n\nprint(s)", "code2": "n, l = map(int, input().split())\n\nlist = []\nfor _ in range(n):\n list.append(input())\n\nlist.sort()\nstr = \"\"\nfor s in list:\n str += s\n\nprint(str)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1562258607", "date2": "1562258975", "bleu_score": "0.9813330443416244", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0], "code1_test_score": 6, "total_score": 101, "input": "3 3\nxdx\naxw\nxxd\n", "actual_output": "xxd\n", "expected_output": "axwxdxxxd\n\n", "anno_code": ["n, l = map(int, input().split()) # (0): n=3, l=3\n\nlist = [] # (1): list=[]\nfor _ in range(n): # (2): _=0 (4): _=1 ... (8): NO CHANGE\n list.append(input()) # (3): list=['xdx'] (5): list=['xdx', 'axw'] (7): list=['xdx', 'axw', 'xxd']\n\nlist.sort() # (9): list=['axw', 'xdx', 'xxd']\nstr = \"\" # (10): str=\nfor s in list: # (11): s=axw (13): s=xdx ... (17): NO CHANGE\n str += s # (12): str=axw (14): str=axwxdx (16): str=axwxdxxxd\n\nprint(s)"], "anno_status": [true], "diff_content": " n, l = map(int, input().split())\n \n list = []\n for _ in range(n):\n list.append(input())\n \n list.sort()\n str = \"\"\n for s in list:\n str += s\n \n-print(s)\n+print(str)\n", "FL_content": "\n n, l = map(int, input().split())\n \n list = []\n for _ in range(n):\n list.append(input())\n \n list.sort()\n str = \"\"\n for s in list:\n str += s\n \n-print(s)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u942687220", "problem_id": "p02909", "submission1_id": "s233385372-FL", "submission2_id": "s289732525", "status1": "Wrong Answer", "status2": "Accepted", "code1": "t = input()\npred ={'Sunny':'Cloudy','Cloudy':'Rainy','Rainy':'Cloudy'}\nprint(pred[t])", "code2": "t = input()\npred ={'Sunny':'Cloudy','Cloudy':'Rainy','Rainy':'Sunny'}\nprint(pred[t])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568604047", "date2": "1568604128", "bleu_score": "0.9248514857225908", "code1_test_status": [0, 1], "code1_test_score": 1, "total_score": 2, "input": "Rainy\n", "actual_output": "Cloudy\n", "expected_output": "Sunny\n", "anno_code": ["t = input() # (0): t=Rainy\npred ={'Sunny':'Cloudy','Cloudy':'Rainy','Rainy':'Cloudy'} # (1): pred={'Sunny': 'Cloudy', 'Cloudy': 'Rainy', 'Rainy': 'Cloudy'}\nprint(pred[t])"], "anno_status": [true], "diff_content": " t = input()\n-pred ={'Sunny':'Cloudy','Cloudy':'Rainy','Rainy':'Cloudy'}\n+pred ={'Sunny':'Cloudy','Cloudy':'Rainy','Rainy':'Sunny'}\n print(pred[t])\n", "FL_content": "\n t = input()\n-pred ={'Sunny':'Cloudy','Cloudy':'Rainy','Rainy':'Cloudy'}\n print(pred[t])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 3 }, { "user_id": "u648868410", "problem_id": "p02537", "submission1_id": "s130286446-FL", "submission2_id": "s628284885", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class SegTree:\n\t\n\tdef __init__(self,size,func,init_val,undef):\n\t\tself.specSize = size\n\t\tself.datSize = 1\n\t\tself.compareFunc = func\t\t\n\t\tself.INIT_VAL = init_val\t\n\t\tself.UNDEFINED_VAL = undef\t\n\t\t\n\t\tself.datSize = 2**size.bit_length()\n\n\t\t\n\t\t\n\t\tself.datTree = [self.INIT_VAL for _ in range(2*self.datSize+1)]\n\n\tdef update(self, i, val ):\n\t\t\n\t\t\n\t\t\n\t\ti += self.datSize\n\t\tself.datTree[i] = val\n\t\twhile 1 < i:\n\t\t\ti >>= 1\n\t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n\n\tdef query(self,a,b):\n\t\treturn self.query_(a,b,1,0,self.datSize)\n\n\tdef query_(self,a,b,i,l,r):\n\t\t\n\t\tret = self.UNDEFINED_VAL\n\n\t\ta += self.datSize\n\t\tb += self.datSize\n\t\twhile a < b:\n\t\t\tif b & 1:\n\t\t\t\tb -= 1\n\t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n\n\t\t\tif a & 1:\n\t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n\t\t\t\ta += 1\n\n\t\t\ta >>= 1; b >>= 1\n\n\t\treturn ret\n\n\tdef printTree(self):\n\t\tprint(self.datTree)\n\n\ndef LongestSeaquence(A,K):\n\tN = len(A)\n\tlis = 0\n\n\t\n\tMAX_A = max(A)\n\ttree = SegTree(MAX_A+1,max,0,-1e18)\n\t\n\n\tfor n in range(N):\n\t\tx = A[n]\n\t\tl = max(1,x-K)\n\t\tr = min(MAX_A,x+K)\n\t\ttree.update( x, tree.query(l,r+1)+1 )\n\n\t\n\tlis = tree.query(1,MAX_A)\n\n\treturn lis\n\ndef main():\n\tN,K = map(int,input().split())\n\tA = [ int(input()) for _ in range(N)]\n\n\tprint(LongestSeaquence(A,K))\n\n\n\nif __name__ == \"__main__\":\n\tmain()", "code2": "class SegTree:\n\t\n\tdef __init__(self,size,func,init_val,undef):\n\t\tself.specSize = size\n\t\tself.datSize = 1\n\t\tself.compareFunc = func\t\t\n\t\tself.INIT_VAL = init_val\t\n\t\tself.UNDEFINED_VAL = undef\t\n\t\t\n\t\tself.datSize = 2**size.bit_length()\n\n\t\t\n\t\t\n\t\tself.datTree = [self.INIT_VAL for _ in range(2*self.datSize+1)]\n\n\tdef update(self, i, val ):\n\t\t\n\t\t\n\t\t\n\t\ti += self.datSize\n\t\tself.datTree[i] = val\n\t\twhile 1 < i:\n\t\t\ti >>= 1\n\t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n\n\tdef query(self,a,b):\n\t\treturn self.query_(a,b,0,0,self.datSize)\n\n\tdef query_(self,a,b,i,l,r):\n\t\t\n\t\tret = self.UNDEFINED_VAL\n\n\t\ta += self.datSize\n\t\tb += self.datSize\n\t\twhile a < b:\n\t\t\tif b & 1:\n\t\t\t\tb -= 1\n\t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n\n\t\t\tif a & 1:\n\t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n\t\t\t\ta += 1\n\n\t\t\ta >>= 1; b >>= 1\n\n\t\treturn ret\n\n\tdef printTree(self):\n\t\tprint(self.datTree)\n\n\ndef LongestSeaquence(A,K):\n\tN = len(A)\n\tlis = 0\n\n\t\n\tMAX_A = max(A)\n\ttree = SegTree(MAX_A+1,max,0,-1e18)\n\t\n\n\tfor n in range(N):\n\t\tx = A[n]\n\t\tl = max(0,x-K)\n\t\tr = min(MAX_A,x+K)\n\t\ttmp = tree.query(l,r+1)+1\n\t\ttree.update( x, tmp )\n\t\tlis = max(lis, tmp)\n\n\treturn lis\n\ndef main():\n\tN,K = map(int,input().split())\n\tA = [ int(input()) for _ in range(N)]\n\n\tprint(LongestSeaquence(A,K))\n\n\n\nif __name__ == \"__main__\":\n\tmain()", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601183376", "date2": "1601183918", "bleu_score": "0.9757652811571731", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 81, "total_score": 101, "input": "10 3\n0\n1\n4\n3\n6\n6\n9\n7\n4\n4\n", "actual_output": "9\n", "expected_output": "10\n\n", "anno_code": ["class SegTree: # (0): SegTree=\n\t\n\tdef __init__(self,size,func,init_val,undef):\n\t\tself.specSize = size\n\t\tself.datSize = 1\n\t\tself.compareFunc = func\t\t\n\t\tself.INIT_VAL = init_val\t\n\t\tself.UNDEFINED_VAL = undef\t\n\t\t\n\t\tself.datSize = 2**size.bit_length()\n\n\t\t\n\t\t\n\t\tself.datTree = [self.INIT_VAL for _ in range(2*self.datSize+1)]\n\n\tdef update(self, i, val ):\n\t\t\n\t\t\n\t\t\n\t\ti += self.datSize\n\t\tself.datTree[i] = val\n\t\twhile 1 < i:\n\t\t\ti >>= 1\n\t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n\n\tdef query(self,a,b):\n\t\treturn self.query_(a,b,1,0,self.datSize)\n\n\tdef query_(self,a,b,i,l,r):\n\t\t\n\t\tret = self.UNDEFINED_VAL\n\n\t\ta += self.datSize\n\t\tb += self.datSize\n\t\twhile a < b:\n\t\t\tif b & 1:\n\t\t\t\tb -= 1\n\t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n\n\t\t\tif a & 1:\n\t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n\t\t\t\ta += 1\n\n\t\t\ta >>= 1; b >>= 1\n\n\t\treturn ret\n\n\tdef printTree(self):\n\t\tprint(self.datTree)\n\n\ndef LongestSeaquence(A,K): # (1): LongestSeaquence=\n\tN = len(A)\n\tlis = 0\n\n\t\n\tMAX_A = max(A)\n\ttree = SegTree(MAX_A+1,max,0,-1e18)\n\t\n\n\tfor n in range(N):\n\t\tx = A[n]\n\t\tl = max(1,x-K)\n\t\tr = min(MAX_A,x+K)\n\t\ttree.update( x, tree.query(l,r+1)+1 )\n\n\t\n\tlis = tree.query(1,MAX_A)\n\n\treturn lis\n\ndef main(): # (2): main=\n\tN,K = map(int,input().split())\n\tA = [ int(input()) for _ in range(N)]\n\n\tprint(LongestSeaquence(A,K))\n\n\n\nif __name__ == \"__main__\":\n\tmain()"], "anno_status": [false], "diff_content": " class SegTree:\n \t\n \tdef __init__(self,size,func,init_val,undef):\n \t\tself.specSize = size\n \t\tself.datSize = 1\n \t\tself.compareFunc = func\t\t\n \t\tself.INIT_VAL = init_val\t\n \t\tself.UNDEFINED_VAL = undef\t\n \t\t\n \t\tself.datSize = 2**size.bit_length()\n \n \t\t\n \t\t\n \t\tself.datTree = [self.INIT_VAL for _ in range(2*self.datSize+1)]\n \n \tdef update(self, i, val ):\n \t\t\n \t\t\n \t\t\n \t\ti += self.datSize\n \t\tself.datTree[i] = val\n \t\twhile 1 < i:\n \t\t\ti >>= 1\n \t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n \n \tdef query(self,a,b):\n-\t\treturn self.query_(a,b,1,0,self.datSize)\n+\t\treturn self.query_(a,b,0,0,self.datSize)\n \n \tdef query_(self,a,b,i,l,r):\n \t\t\n \t\tret = self.UNDEFINED_VAL\n \n \t\ta += self.datSize\n \t\tb += self.datSize\n \t\twhile a < b:\n \t\t\tif b & 1:\n \t\t\t\tb -= 1\n \t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n \n \t\t\tif a & 1:\n \t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n \t\t\t\ta += 1\n \n \t\t\ta >>= 1; b >>= 1\n \n \t\treturn ret\n \n \tdef printTree(self):\n \t\tprint(self.datTree)\n \n \n def LongestSeaquence(A,K):\n \tN = len(A)\n \tlis = 0\n \n \t\n \tMAX_A = max(A)\n \ttree = SegTree(MAX_A+1,max,0,-1e18)\n \t\n \n \tfor n in range(N):\n \t\tx = A[n]\n-\t\tl = max(1,x-K)\n+\t\tl = max(0,x-K)\n \t\tr = min(MAX_A,x+K)\n-\t\ttree.update( x, tree.query(l,r+1)+1 )\n-\n-\t\n-\tlis = tree.query(1,MAX_A)\n+\t\ttmp = tree.query(l,r+1)+1\n+\t\ttree.update( x, tmp )\n+\t\tlis = max(lis, tmp)\n \n \treturn lis\n \n def main():\n \tN,K = map(int,input().split())\n \tA = [ int(input()) for _ in range(N)]\n \n \tprint(LongestSeaquence(A,K))\n \n \n \n if __name__ == \"__main__\":\n \tmain()\n", "FL_content": "\n class SegTree:\n \t\n \tdef __init__(self,size,func,init_val,undef):\n \t\tself.specSize = size\n \t\tself.datSize = 1\n \t\tself.compareFunc = func\t\t\n \t\tself.INIT_VAL = init_val\t\n \t\tself.UNDEFINED_VAL = undef\t\n \t\t\n \t\tself.datSize = 2**size.bit_length()\n \n \t\t\n \t\t\n \t\tself.datTree = [self.INIT_VAL for _ in range(2*self.datSize+1)]\n \n \tdef update(self, i, val ):\n \t\t\n \t\t\n \t\t\n \t\ti += self.datSize\n \t\tself.datTree[i] = val\n \t\twhile 1 < i:\n \t\t\ti >>= 1\n \t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n \n \tdef query(self,a,b):\n \t\treturn self.query_(a,b,1,0,self.datSize)\n \n \tdef query_(self,a,b,i,l,r):\n \t\t\n \t\tret = self.UNDEFINED_VAL\n \n \t\ta += self.datSize\n \t\tb += self.datSize\n \t\twhile a < b:\n \t\t\tif b & 1:\n \t\t\t\tb -= 1\n \t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n \n \t\t\tif a & 1:\n \t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n \t\t\t\ta += 1\n \n \t\t\ta >>= 1; b >>= 1\n \n \t\treturn ret\n \n \tdef printTree(self):\n \t\tprint(self.datTree)\n \n \n def LongestSeaquence(A,K):\n \tN = len(A)\n \tlis = 0\n \n \n \tMAX_A = max(A)\n \ttree = SegTree(MAX_A+1,max,0,-1e18)\n \t\n \n \tfor n in range(N):\n \t\tx = A[n]\n \t\tl = max(1,x-K)\n \t\tr = min(MAX_A,x+K)\n \t\ttree.update( x, tree.query(l,r+1)+1 )\n \n \t\n \tlis = tree.query(1,MAX_A)\n \n \treturn lis\n \n def main():\n \tN,K = map(int,input().split())\n \tA = [ int(input()) for _ in range(N)]\n \n \tprint(LongestSeaquence(A,K))\n \n \n \n if __name__ == \"__main__\":\n \tmain()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 81 }, { "user_id": "u754022296", "problem_id": "p03880", "submission1_id": "s307942724-FL", "submission2_id": "s230585668", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nA = [int(input()) for _ in range(n)]\nm = 30\nC = [False]*m\nx = 0\nfor a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\ntotal = 0\nans = 0\nfor i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\nelse:\n print(ans)", "code2": "n = int(input())\nA = [int(input()) for _ in range(n)]\nm = 30\nC = [False]*m\nx = 0\nfor a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\n break\ntotal = 0\nans = 0\nfor i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\nelse:\n print(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1583188133", "date2": "1583188454", "bleu_score": "0.9626534327422193", "code1_test_status": [0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1], "code1_test_score": 60, "total_score": 89, "input": "3\n3\n3\n4\n", "actual_output": "2\n", "expected_output": "-1\n\n", "anno_code": ["n = int(input()) # (0): n=3\nA = [int(input()) for _ in range(n)] # (1): A=[3, 3, 4]\nm = 30 # (2): m=30\nC = [False]*m # (3): C=[False, False, ..., False, False]\nx = 0 # (4): x=0\nfor a in A: # (5): a=3 (70): NO CHANGE ... (199): NO CHANGE\n x ^= a # (6): x=3 (71): x=0 (136): x=4\n for i in range(m): # (7): i=0 (10): i=1 ... (198): NO CHANGE\n if a>>i & 1: # (8): NO CHANGE (11): NO CHANGE ... (197): NO CHANGE\n C[i] = True # (9): C=[True, False, ..., False, False] (12): C=[True, True, ..., False, False] ... (143): C=[True, True, ..., False, False]\ntotal = 0 # (200): total=0\nans = 0 # (201): ans=0\nfor i in range(m-1, -1, -1): # (202): NO CHANGE (204): i=28 ... (268): NO CHANGE\n if (x>>i & 1) ^ total: # (203): NO CHANGE (205): NO CHANGE ... (267): NO CHANGE\n if C[i]: # (258): NO CHANGE (263): NO CHANGE\n ans += 1 # (259): ans=1 (264): ans=2\n total ^= 1 # (260): total=1 (265): total=0\n else:\n print(-1)\n break\nelse:\n print(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n A = [int(input()) for _ in range(n)]\n m = 30\n C = [False]*m\n x = 0\n for a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\n+ break\n total = 0\n ans = 0\n for i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\n else:\n print(ans)\n", "FL_content": "\n n = int(input())\n A = [int(input()) for _ in range(n)]\n-m = 30\n-C = [False]*m\n x = 0\n for a in A:\n x ^= a\n- for i in range(m):\n- if a>>i & 1:\n- C[i] = True\n total = 0\n ans = 0\n for i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n- if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\n else:\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u184749404", "problem_id": "p02415", "submission1_id": "s279153729-FL", "submission2_id": "s739815940", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nS.capitalize()\nprint(S.capitalize())\n\n", "code2": "S = input()\nS.swapcase()\nprint(S.swapcase())\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1545909864", "date2": "1545909936", "bleu_score": "0.6142302087272563", "code1_test_status": [1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 13, "total_score": 101, "input": "R@gH, K@FSQ, ALKAYOISOCBN BK.UWPD\n", "actual_output": "R@gh, k@fsq, alkayoisocbn bk.uwpd\n", "expected_output": "r@Gh, k@fsq, alkayoisocbn bk.uwpd\n\n", "anno_code": ["S = input() # (0): S=R@gH, K@FSQ, ALKAYOISOCBN BK.UWPD\nS.capitalize() # (1): NO CHANGE\nprint(S.capitalize())\n\n"], "anno_status": [true], "diff_content": " S = input()\n-S.capitalize()\n-print(S.capitalize())\n+S.swapcase()\n+print(S.swapcase())\n \n \n", "FL_content": "\n S = input()\n-S.capitalize()\n-print(S.capitalize())\n-\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u080685822", "problem_id": "p02595", "submission1_id": "s096302527-FL", "submission2_id": "s699463047", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nn, d = map(int, input().split())\nt = 0\nfor i in range(0,n-1):\n alis = list(map(int, input().split()))\n sss = math.sqrt(alis[0] ** 2 + alis[1] ** 2)\n if d >= sss:\n t += 1\n \nprint(t)\n", "code2": "import math\nn, d = map(int, input().split())\nt = 0\nfor i in range(0,n):\n alis = list(map(int, input().split()))\n sss = math.sqrt(alis[0] ** 2 + alis[1] ** 2)\n if d >= sss:\n t += 1\n \nprint(t)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596420483", "date2": "1596420575", "bleu_score": "0.9825206341379196", "code1_test_status": [1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 88, "total_score": 103, "input": "4 5\n0 5\n-2 4\n3 4\n4 -2\n", "actual_output": "3\n", "expected_output": "4\n\n", "anno_code": ["import math\nn, d = map(int, input().split()) # (0): n=4, d=5\nt = 0 # (1): t=0\nfor i in range(0,n-1): # (2): i=0 (7): i=1 ... (17): NO CHANGE\n alis = list(map(int, input().split())) # (3): alis=[0, 5] (8): alis=[-2, 4] (13): alis=[3, 4]\n sss = math.sqrt(alis[0] ** 2 + alis[1] ** 2) # (4): sss=5.0 (9): sss=4.472136 (14): sss=5.0\n if d >= sss: # (5): NO CHANGE (10): NO CHANGE (15): NO CHANGE\n t += 1 # (6): t=1 (11): t=2 (16): t=3\n \nprint(t)\n"], "anno_status": [true], "diff_content": " import math\n n, d = map(int, input().split())\n t = 0\n-for i in range(0,n-1):\n+for i in range(0,n):\n alis = list(map(int, input().split()))\n sss = math.sqrt(alis[0] ** 2 + alis[1] ** 2)\n if d >= sss:\n t += 1\n \n print(t)\n \n", "FL_content": "\n import math\n n, d = map(int, input().split())\n t = 0\n-for i in range(0,n-1):\n alis = list(map(int, input().split()))\n sss = math.sqrt(alis[0] ** 2 + alis[1] ** 2)\n if d >= sss:\n t += 1\n \n print(t)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u733738237", "problem_id": "p03254", "submission1_id": "s526637426-FL", "submission2_id": "s785652437", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,x=[int(i) for i in input().split()]\na = [int(x) for x in input().split()]\na.sort()\ncnt=0\nfor k in range(N):\n\tif x-a[k] >= 0:\n\t\tx -= a[k]\n\t\tcnt += 1\n\telse:\n\t\tbreak\nprint(cnt)", "code2": "N,x=[int(i) for i in input().split()]\na = [int(x) for x in input().split()]\na.sort()\ncnt=0\nfor k in a:\n\tx -= k\n\tif x < 0:\n\t\tbreak\n\tcnt +=1\nif x >0:\n\tcnt -=1\nprint(cnt)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567544723", "date2": "1567546446", "bleu_score": "0.7975869927235959", "code1_test_status": [0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0], "code1_test_score": 70, "total_score": 104, "input": "3 70\n4 17 5\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["N,x=[int(i) for i in input().split()] # (0): N=3, x=70\na = [int(x) for x in input().split()] # (1): a=[4, 17, 5]\na.sort() # (2): a=[4, 5, 17]\ncnt=0 # (3): cnt=0\nfor k in range(N): # (4): k=0 (8): k=1 ... (16): NO CHANGE\n\tif x-a[k] >= 0: # (5): NO CHANGE (9): NO CHANGE (13): NO CHANGE\n\t\tx -= a[k] # (6): x=66 (10): x=61 (14): x=44\n\t\tcnt += 1 # (7): cnt=1 (11): cnt=2 (15): cnt=3\n\telse:\n\t\tbreak\nprint(cnt)"], "anno_status": [true], "diff_content": " N,x=[int(i) for i in input().split()]\n a = [int(x) for x in input().split()]\n a.sort()\n cnt=0\n-for k in range(N):\n-\tif x-a[k] >= 0:\n-\t\tx -= a[k]\n-\t\tcnt += 1\n-\telse:\n+for k in a:\n+\tx -= k\n+\tif x < 0:\n \t\tbreak\n+\tcnt +=1\n+if x >0:\n+\tcnt -=1\n print(cnt)\n", "FL_content": "\n N,x=[int(i) for i in input().split()]\n a = [int(x) for x in input().split()]\n a.sort()\n cnt=0\n for k in range(N):\n \tif x-a[k] >= 0:\n \t\tx -= a[k]\n \t\tcnt += 1\n \telse:\n \t\tbreak\n print(cnt)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u392319141", "problem_id": "p03880", "submission1_id": "s029173787-FL", "submission2_id": "s714782629", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = [int(input()) for _ in range(N)]\n\nA.sort(reverse=True, key=lambda a: (a & -a))\nD = A[0].bit_length()\n\nxor = 0\nfor a in A:\n xor ^= a\n\nleft = 0\nans = 0\n\nfor digit in range(1, xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n mask = ((1 << (D + 1)) - 1) ^ ((1 << digit) - 1)\n while left < N and (A[left] & mask) != A[left]:\n left += 1\n\n if left >= N:\n print(-1)\n exit()\n\n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n\nif xor:\n for a in A:\n if a % 2 == 1:\n ans += 1\n break\n else:\n print(-1)\n exit()\n\nprint(ans)", "code2": "N = int(input())\nA = [int(input()) for _ in range(N)]\n\nA.sort(reverse=True, key=lambda a: (a & -a))\n\nxor = 0\nfor a in A:\n xor ^= a\n\nleft = 0\nans = 0\n\nfor digit in range(xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n while left < N and ((A[left] & -A[left]).bit_length() - 1) > digit:\n left += 1\n\n if left >= N or ((A[left] & -A[left]).bit_length() - 1) != digit:\n print(-1)\n exit()\n\n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1570894362", "date2": "1570896477", "bleu_score": "0.6903448535849083", "code1_test_status": [0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 81, "total_score": 89, "input": "3\n8\n1\n2\n", "actual_output": "3\n", "expected_output": "-1\n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = [int(input()) for _ in range(N)] # (1): A=[8, 1, 2]\n\nA.sort(reverse=True, key=lambda a: (a & -a)) # (2): A=[8, 2, 1]\nD = A[0].bit_length() # (3): D=4\n\nxor = 0 # (4): xor=0\nfor a in A: # (5): a=8 (7): a=2 ... (11): NO CHANGE\n xor ^= a # (6): xor=8 (8): xor=10 (10): xor=11\n\nleft = 0 # (12): left=0\nans = 0 # (13): ans=0\n\nfor digit in range(1, xor.bit_length() + 1)[:: -1]: # (14): digit=4 (16): digit=3 ... (37): NO CHANGE\n if (xor & (1 << digit)) > 0: # (15): NO CHANGE (17): NO CHANGE ... (31): NO CHANGE\n mask = ((1 << (D + 1)) - 1) ^ ((1 << digit) - 1) # (18): mask=24 (25): mask=28 (32): mask=30\n while left < N and (A[left] & mask) != A[left]: # (19): NO CHANGE (26): NO CHANGE (33): NO CHANGE\n left += 1\n\n if left >= N: # (20): NO CHANGE (27): NO CHANGE (34): NO CHANGE\n print(-1)\n exit()\n\n ans += 1 # (21): ans=1 (28): ans=2 (35): ans=3\n xor ^= ((1 << (digit + 1)) - 1) # (22): xor=4 (29): xor=3 (36): xor=0\n\nif xor: # (38): NO CHANGE\n for a in A:\n if a % 2 == 1:\n ans += 1\n break\n else:\n print(-1)\n exit()\n\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n A = [int(input()) for _ in range(N)]\n \n A.sort(reverse=True, key=lambda a: (a & -a))\n-D = A[0].bit_length()\n \n xor = 0\n for a in A:\n xor ^= a\n \n left = 0\n ans = 0\n \n-for digit in range(1, xor.bit_length() + 1)[:: -1]:\n+for digit in range(xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n- mask = ((1 << (D + 1)) - 1) ^ ((1 << digit) - 1)\n- while left < N and (A[left] & mask) != A[left]:\n+ while left < N and ((A[left] & -A[left]).bit_length() - 1) > digit:\n left += 1\n \n- if left >= N:\n+ if left >= N or ((A[left] & -A[left]).bit_length() - 1) != digit:\n print(-1)\n exit()\n \n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n \n-if xor:\n- for a in A:\n- if a % 2 == 1:\n- ans += 1\n- break\n- else:\n- print(-1)\n- exit()\n-\n print(ans)\n", "FL_content": "\n N = int(input())\n A = [int(input()) for _ in range(N)]\n \n A.sort(reverse=True, key=lambda a: (a & -a))\n D = A[0].bit_length()\n \n xor = 0\n for a in A:\n xor ^= a\n \n left = 0\n ans = 0\n \n for digit in range(1, xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n mask = ((1 << (D + 1)) - 1) ^ ((1 << digit) - 1)\n while left < N and (A[left] & mask) != A[left]:\n left += 1\n \n if left >= N:\n print(-1)\n exit()\n \n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n \n if xor:\n for a in A:\n if a % 2 == 1:\n ans += 1\n break\n else:\n print(-1)\n exit()\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 36 }, { "user_id": "u577504524", "problem_id": "p04044", "submission1_id": "s269136561-FL", "submission2_id": "s812948162", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nn,l = map(int,input().split())\nword_list=[]\nfor i in range(n):\n word = str(input())\n word_list.append(word)\nx = sorted(word_list)\nprint(''.join(word_list))", "code2": "\nn,l = map(int,input().split())\nword_list=[]\nfor i in range(n):\n word = str(input())\n word_list.append(word)\nx = sorted(word_list)\nprint(''.join(x))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593353689", "date2": "1593353887", "bleu_score": "0.9353198825437469", "code1_test_status": [0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0], "code1_test_score": 16, "total_score": 101, "input": "3 3\ncwx\naxx\ndxy\n", "actual_output": "cwxaxxdxy\n", "expected_output": "axxcwxdxy\n\n", "anno_code": ["\nn,l = map(int,input().split()) # (0): n=3, l=3\nword_list=[] # (1): word_list=[]\nfor i in range(n): # (2): i=0 (5): i=1 ... (11): NO CHANGE\n word = str(input()) # (3): word=cwx (6): word=axx (9): word=dxy\n word_list.append(word) # (4): word_list=['cwx'] (7): word_list=['cwx', 'axx'] (10): word_list=['cwx', 'axx', 'dxy']\nx = sorted(word_list) # (12): x=['axx', 'cwx', 'dxy']\nprint(''.join(word_list))"], "anno_status": [true], "diff_content": " \n n,l = map(int,input().split())\n word_list=[]\n for i in range(n):\n word = str(input())\n word_list.append(word)\n x = sorted(word_list)\n-print(''.join(word_list))\n+print(''.join(x))\n", "FL_content": "\n \n n,l = map(int,input().split())\n word_list=[]\n for i in range(n):\n word = str(input())\n word_list.append(word)\n x = sorted(word_list)\n-print(''.join(word_list))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u728774856", "problem_id": "p03448", "submission1_id": "s932376171-FL", "submission2_id": "s855503938", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A = int(input())\nB = int(input())\nC = int(input())\nX = int(input())\n\ncount = 0\nfor i in range(A+1):\n for j in range(B+1):\n for k in range(C+1):\n if 500*i + 100*j + 50*k == X:\n count += 1\n", "code2": "A = int(input())\nB = int(input())\nC = int(input())\nX = int(input())\n\ncount = 0\nfor i in range(A+1):\n for j in range(B+1):\n for k in range(C+1):\n if 500*i + 100*j + 50*k == X:\n count += 1\n \nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588474429", "date2": "1588475106", "bleu_score": "0.9056154701523061", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "2\n-6\n-1\n001\n", "actual_output": "no output\n", "expected_output": "0\n\n", "anno_code": ["A = int(input()) # (0): A=2\nB = int(input()) # (1): B=-6\nC = int(input()) # (2): C=-1\nX = int(input()) # (3): X=1\n\ncount = 0 # (4): count=0\nfor i in range(A+1): # (5): i=0 (7): i=1 (9): i=2\n for j in range(B+1): # (6): NO CHANGE (8): NO CHANGE (10): NO CHANGE\n for k in range(C+1):\n if 500*i + 100*j + 50*k == X:\n count += 1\n"], "anno_status": [true], "diff_content": " A = int(input())\n B = int(input())\n C = int(input())\n X = int(input())\n \n count = 0\n for i in range(A+1):\n for j in range(B+1):\n for k in range(C+1):\n if 500*i + 100*j + 50*k == X:\n count += 1\n-\n+ \n+print(count)\n", "FL_content": "\n A = int(input())\n B = int(input())\n C = int(input())\n X = int(input())\n \n count = 0\n for i in range(A+1):\n for j in range(B+1):\n for k in range(C+1):\n if 500*i + 100*j + 50*k == X:\n count += 1\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u008992227", "problem_id": "p02555", "submission1_id": "s933378712-FL", "submission2_id": "s957547756", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import trunc\nimport sys\nimport copy\nfrom collections import deque\nimport collections\nimport itertools\nstdin = sys.stdin\nimport math\n\nmod = 10**9+7\n\nni = lambda: int(ns())\nna = lambda: list(map(int, stdin.readline().split()))\nns = lambda: stdin.readline().rstrip() \n\nn = ni()\n\nmax_div = n\n\nif n < 3:\n print(0)\n exit(0)\nelif n < 6:\n print(1)\n exit(0)\nelif n < 9:\n print(n-4)\n exit(0)\n \n\ns123 = [i for i in range(1, n-7)]\n\nans = n-4\nfor i in range(0, max_div-2):\n tmp = sum(s123[0:len(s123)-i*3])\n ans += tmp\n ans %= mod\n\nprint(ans)\n\n", "code2": "from math import trunc\nimport sys\nimport copy\nfrom collections import deque\nimport collections\nimport itertools\nstdin = sys.stdin\nimport math\n\nmod = 10**9+7\n\nni = lambda: int(ns())\nna = lambda: list(map(int, stdin.readline().split()))\nns = lambda: stdin.readline().rstrip() \n\nn = ni()\n\ns = [0 for _ in range(2001)]\ns[0] = 1\ns[3] = 1\ns[4] = 1\ns[5] = 1\n\nif n < 6:\n print(s[n])\n exit(0)\n\nfor i in range(6, 2001):\n s[i] = s[i-3] + s[i-1]\n s[i] %= mod\n if i==n:\n break\n\nprint(s[n])\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600029608", "date2": "1600031888", "bleu_score": "0.7059585764539151", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "1729\n", "actual_output": "567853324\n", "expected_output": "294867501\n", "anno_code": ["from math import trunc\nimport sys\nimport copy\nfrom collections import deque\nimport collections\nimport itertools\nstdin = sys.stdin # (0): stdin=<_io.TextIOWrapper name='../../test/autoComment2\\\\Dev\\\\p02555\\\\input_s933378712.txt' mode='r' encoding='utf-8'>, math=\nimport math\n\nmod = 10**9+7 # (1): mod=1000000007\n\nni = lambda: int(ns()) # (2): ni= at 0x000002187CAC9BD0>\nna = lambda: list(map(int, stdin.readline().split())) # (3): na= at 0x000002187CAC9B40>\nns = lambda: stdin.readline().rstrip() # (4): ns= at 0x000002187CAC9C60>\n\nn = ni() # (5): n=1729\n\nmax_div = n # (6): max_div=1729\n\nif n < 3: # (7): NO CHANGE\n print(0)\n exit(0)\nelif n < 6: # (8): NO CHANGE\n print(1)\n exit(0)\nelif n < 9: # (9): NO CHANGE\n print(n-4)\n exit(0)\n \n\ns123 = [i for i in range(1, n-7)] # (10): s123=[1, 2, ..., 1720, 1721]\n\nans = n-4 # (11): ans=1725\nfor i in range(0, max_div-2): # (12): i=0 (16): i=1 ... (6920): NO CHANGE\n tmp = sum(s123[0:len(s123)-i*3]) # (13): tmp=1481781 (17): tmp=1476621 ... (6917): NO CHANGE\n ans += tmp # (14): ans=1483506 (18): ans=2960127 ... (6918): NO CHANGE\n ans %= mod # (15): NO CHANGE (19): NO CHANGE ... (6919): NO CHANGE\n\nprint(ans)\n\n"], "anno_status": [true], "diff_content": " from math import trunc\n import sys\n import copy\n from collections import deque\n import collections\n import itertools\n stdin = sys.stdin\n import math\n \n mod = 10**9+7\n \n ni = lambda: int(ns())\n na = lambda: list(map(int, stdin.readline().split()))\n ns = lambda: stdin.readline().rstrip() \n \n n = ni()\n \n-max_div = n\n-\n-if n < 3:\n- print(0)\n- exit(0)\n-elif n < 6:\n- print(1)\n- exit(0)\n-elif n < 9:\n- print(n-4)\n+s = [0 for _ in range(2001)]\n+s[0] = 1\n+s[3] = 1\n+s[4] = 1\n+s[5] = 1\n+\n+if n < 6:\n+ print(s[n])\n exit(0)\n- \n-\n-s123 = [i for i in range(1, n-7)]\n-\n-ans = n-4\n-for i in range(0, max_div-2):\n- tmp = sum(s123[0:len(s123)-i*3])\n- ans += tmp\n- ans %= mod\n \n-print(ans)\n+for i in range(6, 2001):\n+ s[i] = s[i-3] + s[i-1]\n+ s[i] %= mod\n+ if i==n:\n+ break\n \n+print(s[n])\n \n", "FL_content": "\n from math import trunc\n import sys\n import copy\n from collections import deque\n import collections\n import itertools\n stdin = sys.stdin\n import math\n \n mod = 10**9+7\n \n ni = lambda: int(ns())\n na = lambda: list(map(int, stdin.readline().split()))\n ns = lambda: stdin.readline().rstrip() \n \n n = ni()\n \n max_div = n\n \n if n < 3:\n print(0)\n exit(0)\n elif n < 6:\n print(1)\n exit(0)\n elif n < 9:\n print(n-4)\n exit(0)\n \n \n-s123 = [i for i in range(1, n-7)]\n \n ans = n-4\n for i in range(0, max_div-2):\n tmp = sum(s123[0:len(s123)-i*3])\n ans += tmp\n ans %= mod\n \n print(ans)\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 41 }, { "user_id": "u653005308", "problem_id": "p03291", "submission1_id": "s941710316-FL", "submission2_id": "s548535215", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nabc=\"ABCD\"\nn=len(s)\nmod=10**9+7\ndp=[[0]*4 for i in range(n+1)]\ndp[n][3]=1\nfor i in range(n-1,-1,-1):\n for j in range(4):\n if s[i]=='?' :\n if j==3:\n dp[i][j]=3*dp[i+1][j]\n else :\n dp[i][j]=3*dp[i+1][j]+dp[i+1][j+1]\n elif s[i]==abc[j]:\n if j!=3:\n dp[i][j]=dp[i+1][j]+dp[i+1][j+1]\n else :\n dp[i][j]=dp[i+1][j]\n else :\n dp[i][j]=dp[i+1][j]\n dp[i][j]%=mod\nprint(dp[0][0])", "code2": "s=input()\nabc=\"ABCD\"\nn=len(s)\nmod=10**9+7\ndp=[[0]*4 for i in range(n+1)]\ndp[n][3]=1\nfor i in range(n-1,-1,-1):\n for j in range(4):\n if s[i]=='?' :\n if j==3:\n dp[i][j]=3*dp[i+1][j]\n else :\n dp[i][j]=3*dp[i+1][j]+dp[i+1][j+1]\n elif s[i]==abc[j]:\n if j!=3:\n dp[i][j]=dp[i+1][j]+dp[i+1][j+1]\n else :\n dp[i][j]=dp[i+1][j]\n else :\n dp[i][j]=dp[i+1][j]\n dp[i][j]%=mod\nprint(dp[0][0])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1535614792", "date2": "1535615025", "bleu_score": "0.9923150460572129", "code1_test_status": [1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 87, "total_score": 103, "input": ">???=??>??@??????A@???@?B\n", "actual_output": "3338512362\n", "expected_output": "338512341\n\n", "anno_code": ["s=input() # (0): s=>???=??>??@??????A@???@?B\nabc=\"ABCD\" # (1): abc=ABCD\nn=len(s) # (2): n=25\nmod=10**9+7 # (3): mod=1000000007\ndp=[[0]*4 for i in range(n+1)] # (4): dp\ndp[n][3]=1 # (5): dp\nfor i in range(n-1,-1,-1): # (6): i=24 (26): i=23 ... (483): NO CHANGE\n for j in range(4): # (7): j=0 (11): j=1 ... (481): NO CHANGE\n if s[i]=='?' : # (8): NO CHANGE (12): NO CHANGE ... (478): NO CHANGE\n if j==3: # (29): NO CHANGE (33): NO CHANGE ... (460): NO CHANGE\n dp[i][j]=3*dp[i+1][j] # (42): dp (80): dp ... (461): dp\n else :\n dp[i][j]=3*dp[i+1][j]+dp[i+1][j+1] # (30): NO CHANGE (34): NO CHANGE ... (457): dp\n elif s[i]==abc[j]: # (9): NO CHANGE (13): NO CHANGE ... (479): NO CHANGE\n if j!=3: # (14): NO CHANGE (144): NO CHANGE\n dp[i][j]=dp[i+1][j]+dp[i+1][j+1] # (15): NO CHANGE (145): dp\n else :\n dp[i][j]=dp[i+1][j]\n else :\n dp[i][j]=dp[i+1][j] # (10): NO CHANGE (19): NO CHANGE ... (480): dp\n dp[i][j]%=mod # (25): NO CHANGE (44): NO CHANGE ... (482): NO CHANGE\nprint(dp[0][0])"], "anno_status": [true], "diff_content": " s=input()\n abc=\"ABCD\"\n n=len(s)\n mod=10**9+7\n dp=[[0]*4 for i in range(n+1)]\n dp[n][3]=1\n for i in range(n-1,-1,-1):\n for j in range(4):\n if s[i]=='?' :\n if j==3:\n dp[i][j]=3*dp[i+1][j]\n else :\n dp[i][j]=3*dp[i+1][j]+dp[i+1][j+1]\n elif s[i]==abc[j]:\n if j!=3:\n dp[i][j]=dp[i+1][j]+dp[i+1][j+1]\n else :\n dp[i][j]=dp[i+1][j]\n else :\n dp[i][j]=dp[i+1][j]\n- dp[i][j]%=mod\n+ dp[i][j]%=mod\n print(dp[0][0])\n", "FL_content": "\n s=input()\n abc=\"ABCD\"\n n=len(s)\n mod=10**9+7\n dp=[[0]*4 for i in range(n+1)]\n dp[n][3]=1\n for i in range(n-1,-1,-1):\n for j in range(4):\n if s[i]=='?' :\n if j==3:\n dp[i][j]=3*dp[i+1][j]\n else :\n dp[i][j]=3*dp[i+1][j]+dp[i+1][j+1]\n elif s[i]==abc[j]:\n if j!=3:\n dp[i][j]=dp[i+1][j]+dp[i+1][j+1]\n else :\n dp[i][j]=dp[i+1][j]\n else :\n dp[i][j]=dp[i+1][j]\n dp[i][j]%=mod\n print(dp[0][0])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u662822413", "problem_id": "p02413", "submission1_id": "s806947045-FL", "submission2_id": "s745798785", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H,W = map(int,input().split())\ntable = [[0]*(W+1) for i in range(H+1)]\n\nfor row in range(H):\n work = list(map(int,input().split()))\n for col in range(W):\n table[row][col] = work[col]\n\nfor row in range(H):\n for col in range(W):\n table[row][W] += table[row][col]\n\nfor col in range(W):\n for row in range(H):\n table[H][col] += table[row][col]\n\nfor row in range(H+1):\n print(\"%d\"%(table[row][0]),end=\"\")\n for col in range(1,W+1):\n print(\" %d\"%(table[row][col]),end=\"\")\n print()\n \n\n", "code2": "H,W = map(int,input().split())\ntable = [[0]*(W+1) for i in range(H+1)]\n\nfor row in range(H):\n work = list(map(int,input().split()))\n for col in range(W):\n table[row][col] = work[col]\n\nfor row in range(H):\n for col in range(W):\n table[row][W] += table[row][col]\n\nfor col in range(W+1):\n for row in range(H):\n table[H][col] += table[row][col]\n\nfor row in range(H+1):\n print(\"%d\"%(table[row][0]),end=\"\")\n for col in range(1,W+1):\n print(\" %d\"%(table[row][col]),end=\"\")\n print()\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556539658", "date2": "1556540581", "bleu_score": "0.9866936654847834", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 101, "input": "4 5\n1 1 3 4 8\n2 2 2 4 5\n3 3 0 1 2\n2 6 0 8 6\n", "actual_output": "1 1 3 4 8 17\n2 2 2 4 5 15\n3 3 0 1 2 9\n2 6 0 8 6 22\n8 12 5 17 21 0\n", "expected_output": "1 1 3 4 8 17\n2 2 2 4 5 15\n3 3 0 1 2 9\n2 6 0 8 6 22\n8 12 5 17 21 63\n\n", "anno_code": ["H,W = map(int,input().split()) # (0): H=4, W=5\ntable = [[0]*(W+1) for i in range(H+1)] # (1): table\n\nfor row in range(H): # (2): row=0 (15): row=1 ... (54): NO CHANGE\n work = list(map(int,input().split())) # (3): work=[1, 1, 3, 4, 8] (16): work=[2, 2, 2, 4, 5] ... (42): work=[2, 6, 0, 8, 6]\n for col in range(W): # (4): col=0 (6): col=1 ... (53): NO CHANGE\n table[row][col] = work[col] # (5): table (7): table ... (52): table\n\nfor row in range(H): # (55): row=0 (67): row=1 ... (103): NO CHANGE\n for col in range(W): # (56): col=0 (58): col=1 ... (102): NO CHANGE\n table[row][W] += table[row][col] # (57): table (59): table ... (101): table\n\nfor col in range(W): # (104): col=0 (114): col=1 ... (154): NO CHANGE\n for row in range(H): # (105): row=0 (107): row=1 ... (153): NO CHANGE\n table[H][col] += table[row][col] # (106): table (108): table ... (152): table\n\nfor row in range(H+1): # (155): row=0 (169): row=1 ... (211): row=4\n print(\"%d\"%(table[row][0]),end=\"\") # (156): NO CHANGE (170): NO CHANGE ... (212): NO CHANGE\n for col in range(1,W+1): # (157): col=1 (159): col=2 ... (223): NO CHANGE\n print(\" %d\"%(table[row][col]),end=\"\") # (158): NO CHANGE (160): NO CHANGE ... (222): NO CHANGE\n print() # (168): NO CHANGE (182): NO CHANGE ... (224): NO CHANGE\n \n\n"], "anno_status": [true], "diff_content": " H,W = map(int,input().split())\n table = [[0]*(W+1) for i in range(H+1)]\n \n for row in range(H):\n work = list(map(int,input().split()))\n for col in range(W):\n table[row][col] = work[col]\n \n for row in range(H):\n for col in range(W):\n table[row][W] += table[row][col]\n \n-for col in range(W):\n+for col in range(W+1):\n for row in range(H):\n table[H][col] += table[row][col]\n \n for row in range(H+1):\n print(\"%d\"%(table[row][0]),end=\"\")\n for col in range(1,W+1):\n print(\" %d\"%(table[row][col]),end=\"\")\n print()\n- \n \n \n", "FL_content": "\n H,W = map(int,input().split())\n table = [[0]*(W+1) for i in range(H+1)]\n \n for row in range(H):\n work = list(map(int,input().split()))\n for col in range(W):\n table[row][col] = work[col]\n \n for row in range(H):\n for col in range(W):\n table[row][W] += table[row][col]\n \n for col in range(W):\n for row in range(H):\n table[H][col] += table[row][col]\n \n for row in range(H+1):\n print(\"%d\"%(table[row][0]),end=\"\")\n for col in range(1,W+1):\n print(\" %d\"%(table[row][col]),end=\"\")\n print()\n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u190405389", "problem_id": "p02720", "submission1_id": "s214368008-FL", "submission2_id": "s843363482", "status1": "Wrong Answer", "status2": "Accepted", "code1": "k = int(input())\n\ndp = [[[] for j in range(11)] for i in range(11)]\n\n\nfor i in range(10):\n dp[1][i].append(i)\n dp[0][i].append(0)\n\n\nif k<=9:\n print(k)\n exit()\n\nk-=9\n\nfor i in range(2, 11):\n for j in range(1, 10):\n if j==1:\n for z in range(i):\n for x in dp[i-z-1][j]:\n dp[i][j].append(j*10**(i-1)+x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j + 1]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n else:\n for x in dp[i-1][j-1]:\n dp[i][j].append(j*10**(i-1)+x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j + 1]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n\n\n", "code2": "k = int(input())\n\ndp = [[[] for j in range(11)] for i in range(11)]\n\n\nfor i in range(10):\n dp[1][i].append(i)\n dp[0][i].append(0)\n\n\nif k<=9:\n print(k)\n exit()\n\nk-=9\n\nfor i in range(2, 11):\n for j in range(1, 10):\n if j==1:\n for z in range(i):\n for x in dp[z][j]:\n dp[i][j].append(j*10**(i-1)+x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j + 1]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n else:\n for x in dp[i-1][j-1]:\n dp[i][j].append(j*10**(i-1)+x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j + 1]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586051274", "date2": "1586051351", "bleu_score": "0.9952462237859762", "code1_test_status": [0, 1], "code1_test_score": 1, "total_score": 2, "input": "333\n", "actual_output": "11121\n", "expected_output": "10100\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " k = int(input())\n \n dp = [[[] for j in range(11)] for i in range(11)]\n \n \n for i in range(10):\n dp[1][i].append(i)\n dp[0][i].append(0)\n \n \n if k<=9:\n print(k)\n exit()\n \n k-=9\n \n for i in range(2, 11):\n for j in range(1, 10):\n if j==1:\n for z in range(i):\n- for x in dp[i-z-1][j]:\n+ for x in dp[z][j]:\n dp[i][j].append(j*10**(i-1)+x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j + 1]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n else:\n for x in dp[i-1][j-1]:\n dp[i][j].append(j*10**(i-1)+x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j + 1]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n \n \n \n", "FL_content": "\n k = int(input())\n \n dp = [[[] for j in range(11)] for i in range(11)]\n \n \n for i in range(10):\n dp[1][i].append(i)\n dp[0][i].append(0)\n \n \n if k<=9:\n print(k)\n exit()\n \n k-=9\n \n for i in range(2, 11):\n for j in range(1, 10):\n if j==1:\n for z in range(i):\n for x in dp[i-z-1][j]:\n dp[i][j].append(j*10**(i-1)+x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j + 1]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n else:\n for x in dp[i-1][j-1]:\n dp[i][j].append(j*10**(i-1)+x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n for x in dp[i - 1][j + 1]:\n dp[i][j].append(j * 10 ** (i-1) + x)\n k-=1\n if k==0:\n print(dp[i][j][-1])\n exit()\n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 54 }, { "user_id": "u364509382", "problem_id": "p00015", "submission1_id": "s401243549-FL", "submission2_id": "s567307563", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nfor i in range(n):\n\ts = int(input())+int(input())\n\tif len(str(s))>=10**80:\n\t\tprint(\"overflow\")\n\telse:\n\t\tprint(s)", "code2": "n = int(input())\nfor i in range(n):\n\ts = int(input())+int(input())\n\tif len(str(s))>80:\n\t\tprint(\"overflow\")\n\telse:\n\t\tprint(s)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1472282136", "date2": "1472282245", "bleu_score": "0.9485960647060905", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "6\n1000\n800\n9999999999999999999999999999999999999999\n2\n101324030029434858112167499308639520871934406912468763412863813360414081674525193\n1\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n0\n101000000000000000000000000000000000000000000000000000000000000000000000000000000\n1\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n", "actual_output": "1800\n10000000000000000000000000000000000000001\n101324030029434858112167499308639520871934406912468763412863813360414081674525194\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n101000000000000000000000000000000000000000000000000000000000000000000000000000001\n200000000000000000000000000000000000000000000000000000000000000000000000000000000\n", "expected_output": "1800\n10000000000000000000000000000000000000001\noverflow\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\noverflow\noverflow\n\n", "anno_code": ["n = int(input()) # (0): n=6\nfor i in range(n): # (1): i=0 (5): i=1 ... (21): i=5\n\ts = int(input())+int(input()) # (2): s=1800 (6): s=10000000000000000000000000000000000000001 ... (22): s=200000000000000000000000000000000000000000000000000000000000000000000000000000000\n\tif len(str(s))>=10**80: # (3): NO CHANGE (7): NO CHANGE ... (23): NO CHANGE\n\t\tprint(\"overflow\")\n\telse:\n\t\tprint(s) # (4): NO CHANGE (8): NO CHANGE ... (24): NO CHANGE\n"], "anno_status": [false], "diff_content": " n = int(input())\n for i in range(n):\n \ts = int(input())+int(input())\n-\tif len(str(s))>=10**80:\n+\tif len(str(s))>80:\n \t\tprint(\"overflow\")\n \telse:\n \t\tprint(s)\n", "FL_content": "\n n = int(input())\n for i in range(n):\n \ts = int(input())+int(input())\n-\tif len(str(s))>=10**80:\n \t\tprint(\"overflow\")\n \telse:\n \t\tprint(s)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u008079810", "problem_id": "p02722", "submission1_id": "s595278750-FL", "submission2_id": "s152359831", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nN=int(input())\ncand=[]\n\ndef check(N0,K0):\n if N0%K0==0:\n return check(int(N0/K0),K0)\n elif N0%K0==1:\n return 1\n else:\n return 0\n\ndef check0(N0,K0):\n while N0%K0==0:\n N0=int(N0/K0)\n if N0%K0==1:\n return 1\n else:\n return 0\n\n\nfor i in range(2,int((N-1)**0.5)+1):\n if (N-1)%i==0:\n cand.append(i)\n if i!=int((N-1)/i):\n cand.append(int((N-1)/i))\nif N>2:\n cand.append(N-1)\n\n\nfor i in range(2,int(N**0.5)+1):\n if N%i==0:\n cand.append(i)\n if i!=int(N/i):\n cand.append(int(N/i))\ncand.append(N)\n\nprint(cand)\ncount=0\nfor i in range(len(cand)):\n if check(N,cand[i]):\n count+=1\n\nprint(count)", "code2": "\n\nN=int(input())\ncand=[]\n\ndef check(N0,K0):\n if N0%K0==0:\n return check(int(N0/K0),K0)\n elif N0%K0==1:\n return 1\n else:\n return 0\n\ndef check0(N0,K0):\n while N0%K0==0:\n N0=int(N0/K0)\n if N0%K0==1:\n return 1\n else:\n return 0\n\n\nfor i in range(2,int((N-1)**0.5)+1):\n if (N-1)%i==0:\n cand.append(i)\n if i!=int((N-1)/i):\n cand.append(int((N-1)/i))\nif N>2:\n cand.append(N-1)\n\n\nfor i in range(2,int(N**0.5)+1):\n if N%i==0:\n cand.append(i)\n if i!=int(N/i):\n cand.append(int(N/i))\ncand.append(N)\n\n\ncount=0\nfor i in range(len(cand)):\n if check(N,cand[i]):\n count+=1\n\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586399936", "date2": "1586399990", "bleu_score": "0.9822151784280698", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 81, "input": "6082577109\n", "actual_output": "[2, 3041288554, 4, 1520644277, 113, 53828116, 226, 26914058, 452, 13457029, 6082577108, 3, 2027525703, 7, 868939587, 9, 675841901, 21, 289646529, 63, 96548843, 6082577109]\n12\n", "expected_output": "12\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n \n N=int(input())\n cand=[]\n \n def check(N0,K0):\n if N0%K0==0:\n return check(int(N0/K0),K0)\n elif N0%K0==1:\n return 1\n else:\n return 0\n \n def check0(N0,K0):\n while N0%K0==0:\n N0=int(N0/K0)\n if N0%K0==1:\n return 1\n else:\n return 0\n \n \n for i in range(2,int((N-1)**0.5)+1):\n if (N-1)%i==0:\n cand.append(i)\n if i!=int((N-1)/i):\n cand.append(int((N-1)/i))\n if N>2:\n cand.append(N-1)\n \n \n for i in range(2,int(N**0.5)+1):\n if N%i==0:\n cand.append(i)\n if i!=int(N/i):\n cand.append(int(N/i))\n cand.append(N)\n \n-print(cand)\n+\n count=0\n for i in range(len(cand)):\n if check(N,cand[i]):\n count+=1\n \n print(count)\n", "FL_content": "\n \n \n N=int(input())\n cand=[]\n \n def check(N0,K0):\n if N0%K0==0:\n return check(int(N0/K0),K0)\n elif N0%K0==1:\n return 1\n else:\n return 0\n \n def check0(N0,K0):\n while N0%K0==0:\n N0=int(N0/K0)\n if N0%K0==1:\n return 1\n else:\n return 0\n \n \n for i in range(2,int((N-1)**0.5)+1):\n if (N-1)%i==0:\n cand.append(i)\n if i!=int((N-1)/i):\n cand.append(int((N-1)/i))\n if N>2:\n cand.append(N-1)\n \n \n for i in range(2,int(N**0.5)+1):\n if N%i==0:\n cand.append(i)\n if i!=int(N/i):\n cand.append(int(N/i))\n cand.append(N)\n \n-print(cand)\n count=0\n for i in range(len(cand)):\n if check(N,cand[i]):\n count+=1\n \n print(count)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 45 }, { "user_id": "u802963389", "problem_id": "p03838", "submission1_id": "s438289152-FL", "submission2_id": "s283997769", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y = map(int, input().split())\ndist = abs(abs(x) - abs(y))\nif x <= y:\n x, y = y, x\nif x + dist == y:\n ans = dist\nelif - x + dist == y:\n ans = dist + 1\nelif - x + dist == -y:\n ans = dist + 2\nelif x + dist == -y:\n ans = dist + 1\nprint(ans)", "code2": "x, y = map(int, input().split())\ndist = abs(abs(x) - abs(y))\n\nif x + dist == y:\n ans = dist\nelif - x + dist == y:\n ans = dist + 1\nelif x + dist == -y:\n ans = dist + 1\nelif - x + dist == -y:\n ans = dist + 2\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571420207", "date2": "1571420563", "bleu_score": "0.8856120148309723", "code1_test_status": [0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 76, "total_score": 90, "input": "0 -32\n", "actual_output": "34\n", "expected_output": "33\n\n", "anno_code": ["x, y = map(int, input().split()) # (0): x=0, y=-32\ndist = abs(abs(x) - abs(y)) # (1): dist=32\nif x <= y: # (2): NO CHANGE\n x, y = y, x\nif x + dist == y: # (3): NO CHANGE\n ans = dist\nelif - x + dist == y: # (4): NO CHANGE\n ans = dist + 1\nelif - x + dist == -y: # (5): NO CHANGE\n ans = dist + 2 # (6): ans=34\nelif x + dist == -y:\n ans = dist + 1\nprint(ans)"], "anno_status": [true], "diff_content": " x, y = map(int, input().split())\n dist = abs(abs(x) - abs(y))\n-if x <= y:\n- x, y = y, x\n+\n if x + dist == y:\n ans = dist\n elif - x + dist == y:\n ans = dist + 1\n-elif - x + dist == -y:\n- ans = dist + 2\n elif x + dist == -y:\n ans = dist + 1\n+elif - x + dist == -y:\n+ ans = dist + 2\n+\n print(ans)\n", "FL_content": "\n x, y = map(int, input().split())\n dist = abs(abs(x) - abs(y))\n if x <= y:\n x, y = y, x\n if x + dist == y:\n ans = dist\n elif - x + dist == y:\n ans = dist + 1\n-elif - x + dist == -y:\n ans = dist + 2\n elif x + dist == -y:\n ans = dist + 1\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u011062360", "problem_id": "p03353", "submission1_id": "s098410623-FL", "submission2_id": "s898154594", "status1": "Wrong Answer", "status2": "Accepted", "code1": "list_S = list(input())\nk = int(input())\nset_ANS = set()\nlist_Alph = list(set(list_S))\nlist_Alph.sort()\ncnt = 0\n\nfor c in list_Alph:\n q = [i for i, x in enumerate(list_S) if x == c]\n for j in range(1, len(list_S)+1):\n for i in q:\n if i + j <= len(list_S):\n l = \"\".join(list_S[i:i+j])\n if l not in set_ANS:\n set_ANS.add(l)\n cnt += 1\n if cnt >= k:\n list_ANS = list(set_ANS)\n list_ANS.sort()\n print(list_ANS[k-1])\n exit()", "code2": "list_S = list(input())\nk = int(input())\nset_ANS = set()\nlist_Alph = list(set(list_S))\ncnt = 0\nlist_Alph.sort()\n\nfor c in list_Alph:\n q = [i for i, x in enumerate(list_S) if x == c]\n list_M = []\n for i in q:\n l = \"\".join(list_S[i:])\n list_M.append(l)\n list_M.sort()\n for s in list_M:\n m = list(s)\n for j in range(1,len(m)+1):\n b = \"\".join(m[:j])\n if b not in set_ANS:\n set_ANS.add(b)\n cnt += 1\n if cnt == k:\n print(b)\n exit()\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586031104", "date2": "1586033396", "bleu_score": "0.8654060346004614", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 83, "total_score": 103, "input": "rtcefeobmdatdaddor\n4\n", "actual_output": "at\n", "expected_output": "addo\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " list_S = list(input())\n k = int(input())\n set_ANS = set()\n list_Alph = list(set(list_S))\n-list_Alph.sort()\n cnt = 0\n+list_Alph.sort()\n \n for c in list_Alph:\n q = [i for i, x in enumerate(list_S) if x == c]\n- for j in range(1, len(list_S)+1):\n- for i in q:\n- if i + j <= len(list_S):\n- l = \"\".join(list_S[i:i+j])\n- if l not in set_ANS:\n- set_ANS.add(l)\n- cnt += 1\n- if cnt >= k:\n- list_ANS = list(set_ANS)\n- list_ANS.sort()\n- print(list_ANS[k-1])\n- exit()\n+ list_M = []\n+ for i in q:\n+ l = \"\".join(list_S[i:])\n+ list_M.append(l)\n+ list_M.sort()\n+ for s in list_M:\n+ m = list(s)\n+ for j in range(1,len(m)+1):\n+ b = \"\".join(m[:j])\n+ if b not in set_ANS:\n+ set_ANS.add(b)\n+ cnt += 1\n+ if cnt == k:\n+ print(b)\n+ exit()\n+\n+\n", "FL_content": "\n list_S = list(input())\n k = int(input())\n set_ANS = set()\n list_Alph = list(set(list_S))\n list_Alph.sort()\n cnt = 0\n \n for c in list_Alph:\n q = [i for i, x in enumerate(list_S) if x == c]\n for j in range(1, len(list_S)+1):\n for i in q:\n if i + j <= len(list_S):\n l = \"\".join(list_S[i:i+j])\n if l not in set_ANS:\n set_ANS.add(l)\n cnt += 1\n if cnt >= k:\n- list_ANS = list(set_ANS)\n- list_ANS.sort()\n- print(list_ANS[k-1])\n- exit()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 21 }, { "user_id": "u527848444", "problem_id": "p02413", "submission1_id": "s229031665-FL", "submission2_id": "s350105792", "status1": "Wrong Answer", "status2": "Accepted", "code1": "(r,c) = [int(i) for i in input().split()]\n\ntable = []\nfor rc in range(r):\n table.append([int(i) for i in input().split()])\n\ntable.append([0 for _ in range(c)])\n\nfor rc in range(r):\n row_total = 0\n for cc in range(c):\n table[r][cc] += table[rc][cc]\n row_total += table[rc][cc]\n\n table[rc].append(row_total)\n\nfor row in table:\n for column in row:\n print(column,end=' ')\n\n print()", "code2": "(r,c) = [int(i) for i in input().split()]\n\ntable = []\nfor rc in range(r):\n table.append([int(i) for i in input().split()])\n\ntable.append([0 for _ in range(c + 1)])\n\nfor rc in range(r):\n row_total = 0\n for cc in range(c):\n table[r][cc] += table[rc][cc]\n row_total += table[rc][cc]\n\n table[rc].append(row_total)\n table[r][c] += row_total\n\nfor row in table:\n print(' '.join([str(column) for column in row]))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1424659755", "date2": "1424660293", "bleu_score": "0.888709167182624", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "4 5\n1 1 3 4 8\n2 2 2 4 5\n3 3 0 1 2\n2 6 4 8 6\n", "actual_output": "1 1 3 4 8 17 \n2 2 2 4 5 15 \n3 3 0 1 2 9 \n2 6 4 8 6 26 \n8 12 9 17 21 \n", "expected_output": "1 1 3 4 8 17\n2 2 2 4 5 15\n3 3 0 1 2 9\n2 6 4 8 6 26\n8 12 9 17 21 67\n\n", "anno_code": ["(r,c) = [int(i) for i in input().split()] # (0): r=4, c=5\n\ntable = [] # (1): table=[]\nfor rc in range(r): # (2): rc=0 (4): rc=1 ... (10): NO CHANGE\n table.append([int(i) for i in input().split()]) # (3): table (5): table ... (9): table\n\ntable.append([0 for _ in range(c)]) # (11): table\n\nfor rc in range(r): # (12): rc=0 (31): table, rc=1 ... (88): table\n row_total = 0 # (13): row_total=0 (32): table=[[1, 1, 3, 4, 8, 17], [2, 2, 2, 4, 5], [3, 3, 0, 1, 2], [2, 6, 4, 8, 6], [1, 1, 3, 4, 8]], row_total=0 ... (70): table, row_total=0\n for cc in range(c): # (14): cc=0 (17): cc=1 ... (86): table\n table[r][cc] += table[rc][cc] # (15): table (18): table ... (84): table\n row_total += table[rc][cc] # (16): row_total=1 (19): row_total=2 ... (85): table, row_total=26\n\n table[rc].append(row_total) # (30): table (49): table ... (87): table\n\nfor row in table: # (89): table, row=[1, 1, 3, 4, 8, 17] (104): table, row=[2, 2, 2, 4, 5, 15] ... (149): table, row=[8, 12, 9, 17, 21]\n for column in row: # (90): table, column=1 (92): table ... (160): table\n print(column,end=' ') # (91): table (93): table ... (159): table\n\n print() # (103): table (118): table ... (161): table\n"], "anno_status": [true], "diff_content": " (r,c) = [int(i) for i in input().split()]\n \n table = []\n for rc in range(r):\n table.append([int(i) for i in input().split()])\n \n-table.append([0 for _ in range(c)])\n+table.append([0 for _ in range(c + 1)])\n \n for rc in range(r):\n row_total = 0\n for cc in range(c):\n table[r][cc] += table[rc][cc]\n row_total += table[rc][cc]\n \n table[rc].append(row_total)\n+ table[r][c] += row_total\n \n for row in table:\n- for column in row:\n- print(column,end=' ')\n-\n- print()\n+ print(' '.join([str(column) for column in row]))\n", "FL_content": "\n (r,c) = [int(i) for i in input().split()]\n \n table = []\n for rc in range(r):\n table.append([int(i) for i in input().split()])\n \n table.append([0 for _ in range(c)])\n \n for rc in range(r):\n row_total = 0\n for cc in range(c):\n table[r][cc] += table[rc][cc]\n row_total += table[rc][cc]\n \n table[rc].append(row_total)\n \n for row in table:\n for column in row:\n print(column,end=' ')\n \n- print()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 21 }, { "user_id": "u569742427", "problem_id": "p03129", "submission1_id": "s136866082-FL", "submission2_id": "s446386867", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K=map(int,input().split())\n\nans='NO'\n\nif N%2==0 and K<=(N/2):\n ans=''\nif N%2==1 and K<=((N/2)+1) :\n ans='YES'\n\nprint(ans)\n", "code2": "N,K=map(int,input().split())\n\nans='NO'\n\nif N%2==0 and K<=(N/2):\n ans='YES'\nif N%2==1 and K<=((N+1)/2) :\n ans='YES'\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549765053", "date2": "1549765249", "bleu_score": "0.9364384969226234", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1], "code1_test_score": 52, "total_score": 60, "input": "70 10\n", "actual_output": "\n", "expected_output": "YES\n\n", "anno_code": ["N,K=map(int,input().split()) # (0): N=70, K=10\n\nans='NO' # (1): ans=NO\n\nif N%2==0 and K<=(N/2): # (2): NO CHANGE\n ans='' # (3): ans=\nif N%2==1 and K<=((N/2)+1) : # (4): NO CHANGE\n ans='YES'\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " N,K=map(int,input().split())\n \n ans='NO'\n \n if N%2==0 and K<=(N/2):\n- ans=''\n-if N%2==1 and K<=((N/2)+1) :\n+ ans='YES'\n+if N%2==1 and K<=((N+1)/2) :\n ans='YES'\n \n print(ans)\n \n", "FL_content": "\n N,K=map(int,input().split())\n \n ans='NO'\n \n-if N%2==0 and K<=(N/2):\n- ans=''\n-if N%2==1 and K<=((N/2)+1) :\n ans='YES'\n \n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u511854420", "problem_id": "p02933", "submission1_id": "s338220890-FL", "submission2_id": "s598332749", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\ns = input()\nif a < 3200:\n print(s)\nelse:\n print(\"red\")", "code2": "a = int(input())\ns = input()\nif a >= 3200:\n print(s)\nelse:\n print(\"red\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566349905", "date2": "1566349970", "bleu_score": "0.9513372234174611", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 1, "total_score": 103, "input": "4049\nqdd\n", "actual_output": "red\n", "expected_output": "qdd\n\n", "anno_code": ["a = int(input()) # (0): a=4049\ns = input() # (1): s=qdd\nif a < 3200: # (2): NO CHANGE\n print(s)\nelse:\n print(\"red\")"], "anno_status": [true], "diff_content": " a = int(input())\n s = input()\n-if a < 3200:\n+if a >= 3200:\n print(s)\n else:\n print(\"red\")\n", "FL_content": "\n a = int(input())\n s = input()\n-if a < 3200:\n print(s)\n else:\n print(\"red\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u333917945", "problem_id": "p04014", "submission1_id": "s812042386-FL", "submission2_id": "s431036494", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math, sys\n\nn = int(input())\ns = int(input())\n\ndef f(b, n):\n if n < b:\n return n\n else:\n return f(b, math.floor(n/b)) + n % b\n\nif s == n:\n print(n+1)\n sys.exit()\n\n\nfor b in range(2, math.ceil(math.sqrt(n))):\n \n if(f(b, n) == s):\n print(b)\n sys.exit()\n\n\nfor p in range(1, math.ceil(math.sqrt(n))):\n \n b = int((n-s)/p) + 1\n if(b >= 2 and f(b, n) == s):\n print(b)\n sys.exit()\n\nprint(\"-1\")\n", "code2": "import math, sys\n\nn = int(input())\ns = int(input())\n\ndef f(b, n):\n if n < b:\n return n\n else:\n return f(b, math.floor(n/b)) + n % b\n\nif s == n:\n print(n+1)\n sys.exit()\n\n\nfor b in range(2, math.floor(math.sqrt(n))+1):\n \n if(f(b, n) == s):\n print(b)\n sys.exit()\n\n\nfor p in range(1, math.floor(math.sqrt(n))+1):\n \n _p = math.floor(math.sqrt(n))+1-p\n b = int((n-s)/_p) + 1\n if(b >= 2 and f(b, n) == s):\n print(b)\n sys.exit()\n\nprint(\"-1\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1480882997", "date2": "1480884795", "bleu_score": "0.8816920548157158", "code1_test_status": [1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 54, "total_score": 105, "input": "31415926535\n7\n", "actual_output": "31415926529\n", "expected_output": "4487989505\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import math, sys\n \n n = int(input())\n s = int(input())\n \n def f(b, n):\n if n < b:\n return n\n else:\n return f(b, math.floor(n/b)) + n % b\n \n if s == n:\n print(n+1)\n sys.exit()\n \n \n-for b in range(2, math.ceil(math.sqrt(n))):\n+for b in range(2, math.floor(math.sqrt(n))+1):\n \n if(f(b, n) == s):\n print(b)\n sys.exit()\n \n \n-for p in range(1, math.ceil(math.sqrt(n))):\n+for p in range(1, math.floor(math.sqrt(n))+1):\n \n- b = int((n-s)/p) + 1\n+ _p = math.floor(math.sqrt(n))+1-p\n+ b = int((n-s)/_p) + 1\n if(b >= 2 and f(b, n) == s):\n print(b)\n sys.exit()\n \n print(\"-1\")\n-\n", "FL_content": "\n import math, sys\n \n n = int(input())\n s = int(input())\n \n def f(b, n):\n if n < b:\n return n\n else:\n return f(b, math.floor(n/b)) + n % b\n \n if s == n:\n- print(n+1)\n sys.exit()\n \n \n for b in range(2, math.ceil(math.sqrt(n))):\n \n if(f(b, n) == s):\n print(b)\n sys.exit()\n \n \n for p in range(1, math.ceil(math.sqrt(n))):\n \n- b = int((n-s)/p) + 1\n if(b >= 2 and f(b, n) == s):\n print(b)\n sys.exit()\n \n print(\"-1\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 32 }, { "user_id": "u146803137", "problem_id": "p03698", "submission1_id": "s878868192-FL", "submission2_id": "s221453062", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\ndef py():\n print(\"Yes\")\ndef pn():\n print(\"No\")\ndef iin():\n x = int(input())\n return x\n\nneko = 0\nnya = 0\nnuko = 0\n\ns = input()\nfor a in range(len(s)-1):\n for b in range(a+1,len(s)):\n if s[a] == s[b]:\n neko = 1\nif neko:\n pn()\nelse:\n py()", "code2": "import math\ndef py():\n print(\"yes\")\ndef pn():\n print(\"no\")\ndef iin():\n x = int(input())\n return x\n\nneko = 0\nnya = 0\nnuko = 0\n\ns = input()\nfor a in range(len(s)-1):\n for b in range(a+1,len(s)):\n if s[a] == s[b]:\n neko = 1\nif neko:\n pn()\nelse:\n py()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1589422911", "date2": "1589423062", "bleu_score": "0.9823621484436937", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "elcashfiqxcopnu\n", "actual_output": "No\n", "expected_output": "no\n\n", "anno_code": ["import math\ndef py(): # (0): py=\n print(\"Yes\")\ndef pn(): # (1): pn=\n print(\"No\")\ndef iin(): # (2): iin=\n x = int(input())\n return x\n\nneko = 0 # (3): neko=0\nnya = 0 # (4): nya=0\nnuko = 0 # (5): nuko=0\n\ns = input() # (6): s=elcashfiqxcopnu\nfor a in range(len(s)-1): # (7): a=0 (37): a=1 ... (246): NO CHANGE\n for b in range(a+1,len(s)): # (8): b=1 (10): b=2 ... (245): NO CHANGE\n if s[a] == s[b]: # (9): NO CHANGE (11): NO CHANGE ... (244): NO CHANGE\n neko = 1 # (82): neko=1\nif neko: # (247): NO CHANGE\n pn() # (248): NO CHANGE\nelse:\n py()"], "anno_status": [true], "diff_content": " import math\n def py():\n- print(\"Yes\")\n+ print(\"yes\")\n def pn():\n- print(\"No\")\n+ print(\"no\")\n def iin():\n x = int(input())\n return x\n \n neko = 0\n nya = 0\n nuko = 0\n \n s = input()\n for a in range(len(s)-1):\n for b in range(a+1,len(s)):\n if s[a] == s[b]:\n neko = 1\n if neko:\n pn()\n else:\n py()\n", "FL_content": "\n import math\n def py():\n- print(\"Yes\")\n def pn():\n- print(\"No\")\n def iin():\n x = int(input())\n return x\n \n neko = 0\n nya = 0\n nuko = 0\n \n s = input()\n for a in range(len(s)-1):\n for b in range(a+1,len(s)):\n if s[a] == s[b]:\n neko = 1\n if neko:\n pn()\n else:\n py()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u788137651", "problem_id": "p03558", "submission1_id": "s549678201-FL", "submission2_id": "s810790393", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\n\n\n\n\n\n\nimport sys\ninput=sys.stdin.readline\ninf=float('inf')\nmod = 10**9+7\ndef INT_(n): return int(n)-1\ndef MI(): return map(int,input().split())\ndef MF(): return map(float, input().split())\ndef MI_(): return map(INT_,input().split())\ndef LI(): return list(MI())\ndef LI_(): return [int(x) - 1 for x in input().split()]\ndef LF(): return list(MF())\ndef LIN(n:int): return [input() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\ndef LLIN_(n: int): return [LI_() for _ in range(n)]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef I(): return int(input())\ndef F(): return float(input())\ndef ST(): return input().replace('\\n', '')\ndef main():\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n zero_one_deque = deque([1])\n node = [inf] * K\n node[1]=1\n for i in range(K+1):\n tmp = deque()\n while zero_one_deque:\n from_ = zero_one_deque.popleft()\n for i, to in enumerate(edge[from_]):\n if node[to] != inf:\n continue\n node[to] = node[from_]\n if i == 0:\n tmp.appendleft(to)\n else: \n node[to] += 1\n tmp.append(to)\n zero_one_deque = tmp\n print(node[0])\n \n\n \n \nif __name__ == '__main__':\n main()", "code2": "\n\n\n\n\n\n\n\n\n\n\nimport sys\ninput=sys.stdin.readline\ninf=float('inf')\nmod = 10**9+7\ndef INT_(n): return int(n)-1\ndef MI(): return map(int,input().split())\ndef MF(): return map(float, input().split())\ndef MI_(): return map(INT_,input().split())\ndef LI(): return list(MI())\ndef LI_(): return [int(x) - 1 for x in input().split()]\ndef LF(): return list(MF())\ndef LIN(n:int): return [input() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\ndef LLIN_(n: int): return [LI_() for _ in range(n)]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef I(): return int(input())\ndef F(): return float(input())\ndef ST(): return input().replace('\\n', '')\ndef main():\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n zero_one_deque = deque([(1, 1)])\n node = [inf] * K\n \n node[1] = 1\n searched = set()\n while zero_one_deque:\n from_ , digit_sum = zero_one_deque.popleft()\n if from_ in searched:\n continue\n else:\n searched.add(from_)\n node[from_] = digit_sum\n \n for i, to in enumerate(edge[from_]):\n if i == 0:\n zero_one_deque.appendleft((to,node[from_]))\n else: \n zero_one_deque.append((to, node[from_] + 1))\n print(node[0])\n \n\nif __name__ == '__main__':\n main()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1559592470", "date2": "1559594990", "bleu_score": "0.9081561411408977", "code1_test_status": [0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 8, "total_score": 22, "input": "1246\n", "actual_output": "6\n", "expected_output": "3\n\n", "anno_code": ["\n\n\n\n\n\n\n\n\n\n\nimport sys\ninput=sys.stdin.readline # (0): input=\ninf=float('inf') # (1): inf=inf\nmod = 10**9+7 # (2): mod=1000000007, INT_=, MI=, MF=, MI_=, LI=, LI_=, LF=, LIN=, LLIN=, LLIN_=, LLI=, I=, F=, ST=\ndef INT_(n): return int(n)-1\ndef MI(): return map(int,input().split())\ndef MF(): return map(float, input().split())\ndef MI_(): return map(INT_,input().split())\ndef LI(): return list(MI())\ndef LI_(): return [int(x) - 1 for x in input().split()]\ndef LF(): return list(MF())\ndef LIN(n:int): return [input() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\ndef LLIN_(n: int): return [LI_() for _ in range(n)]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef I(): return int(input())\ndef F(): return float(input())\ndef ST(): return input().replace('\\n', '')\ndef main(): # (3): main=\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n zero_one_deque = deque([1])\n node = [inf] * K\n node[1]=1\n for i in range(K+1):\n tmp = deque()\n while zero_one_deque:\n from_ = zero_one_deque.popleft()\n for i, to in enumerate(edge[from_]):\n if node[to] != inf:\n continue\n node[to] = node[from_]\n if i == 0:\n tmp.appendleft(to)\n else: \n node[to] += 1\n tmp.append(to)\n zero_one_deque = tmp\n print(node[0])\n \n\n \n \nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " \n \n \n \n \n \n \n \n \n \n \n import sys\n input=sys.stdin.readline\n inf=float('inf')\n mod = 10**9+7\n def INT_(n): return int(n)-1\n def MI(): return map(int,input().split())\n def MF(): return map(float, input().split())\n def MI_(): return map(INT_,input().split())\n def LI(): return list(MI())\n def LI_(): return [int(x) - 1 for x in input().split()]\n def LF(): return list(MF())\n def LIN(n:int): return [input() for _ in range(n)]\n def LLIN(n: int): return [LI() for _ in range(n)]\n def LLIN_(n: int): return [LI_() for _ in range(n)]\n def LLI(): return [list(map(int, l.split() )) for l in input()]\n def I(): return int(input())\n def F(): return float(input())\n def ST(): return input().replace('\\n', '')\n def main():\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n- zero_one_deque = deque([1])\n+ zero_one_deque = deque([(1, 1)])\n node = [inf] * K\n- node[1]=1\n- for i in range(K+1):\n- tmp = deque()\n- while zero_one_deque:\n- from_ = zero_one_deque.popleft()\n- for i, to in enumerate(edge[from_]):\n- if node[to] != inf:\n- continue\n- node[to] = node[from_]\n- if i == 0:\n- tmp.appendleft(to)\n- else: \n- node[to] += 1\n- tmp.append(to)\n- zero_one_deque = tmp\n+ \n+ node[1] = 1\n+ searched = set()\n+ while zero_one_deque:\n+ from_ , digit_sum = zero_one_deque.popleft()\n+ if from_ in searched:\n+ continue\n+ else:\n+ searched.add(from_)\n+ node[from_] = digit_sum\n+ \n+ for i, to in enumerate(edge[from_]):\n+ if i == 0:\n+ zero_one_deque.appendleft((to,node[from_]))\n+ else: \n+ zero_one_deque.append((to, node[from_] + 1))\n print(node[0])\n \n \n- \n- \n if __name__ == '__main__':\n main()\n", "FL_content": "\n \n \n \n \n \n \n \n \n \n \n \n import sys\n input=sys.stdin.readline\n inf=float('inf')\n mod = 10**9+7\n def INT_(n): return int(n)-1\n def MI(): return map(int,input().split())\n def MF(): return map(float, input().split())\n def MI_(): return map(INT_,input().split())\n def LI(): return list(MI())\n def LI_(): return [int(x) - 1 for x in input().split()]\n def LF(): return list(MF())\n def LIN(n:int): return [input() for _ in range(n)]\n def LLIN(n: int): return [LI() for _ in range(n)]\n def LLIN_(n: int): return [LI_() for _ in range(n)]\n def LLI(): return [list(map(int, l.split() )) for l in input()]\n def I(): return int(input())\n def F(): return float(input())\n def ST(): return input().replace('\\n', '')\n def main():\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n zero_one_deque = deque([1])\n node = [inf] * K\n node[1]=1\n for i in range(K+1):\n tmp = deque()\n while zero_one_deque:\n from_ = zero_one_deque.popleft()\n for i, to in enumerate(edge[from_]):\n if node[to] != inf:\n continue\n node[to] = node[from_]\n if i == 0:\n tmp.appendleft(to)\n else: \n node[to] += 1\n tmp.append(to)\n zero_one_deque = tmp\n print(node[0])\n \n \n \n \n if __name__ == '__main__':\n main()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 61 }, { "user_id": "u401949008", "problem_id": "p03377", "submission1_id": "s760550309-FL", "submission2_id": "s745043058", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,x=map(int,input().split())\nif b>=x-a:\n print(\"YES\")\nelse:\n print(\"NO\")", "code2": "a,b,x=map(int,input().split())\nif bx:\n print(\"NO\")\nelse:\n print(\"YES\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1578638088", "date2": "1578638693", "bleu_score": "0.8685878540900916", "code1_test_status": [1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0], "code1_test_score": 63, "total_score": 87, "input": "5 1 1\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["a,b,x=map(int,input().split()) # (0): a=5, b=1, x=1\nif b>=x-a: # (1): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")"], "anno_status": [true], "diff_content": " a,b,x=map(int,input().split())\n-if b>=x-a:\n- print(\"YES\")\n-else:\n+if bx:\n print(\"NO\")\n+else:\n+ print(\"YES\")\n", "FL_content": "\n a,b,x=map(int,input().split())\n-if b>=x-a:\n print(\"YES\")\n else:\n print(\"NO\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u144072139", "problem_id": "p03545", "submission1_id": "s359533475-FL", "submission2_id": "s348703086", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\na,b,c,d=list(input())\ns=\"+-\"\n\nfor i in range(2):\n for j in range(2):\n for k in range(2):\n if eval(a+s[i]+b+s[j]+c+s[k]+d)==7:\n print(eval(a+s[i]+b+s[j]+c+s[k]+d))", "code2": "\na,b,c,d=list(input())\ns=\"+-\"\n\nfor i in range(2):\n for j in range(2):\n for k in range(2):\n if eval(a+s[i]+b+s[j]+c+s[k]+d)==7:\n print(str(a+s[i]+b+s[j]+c+s[k]+d)+\"=7\")\n exit()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588973481", "date2": "1588973882", "bleu_score": "0.8529159340447985", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 99, "input": "3242\n", "actual_output": "7\n7\n", "expected_output": "3+2+4-2=7\n", "anno_code": [" # (6): NO CHANGE (9): NO CHANGE ... (39): NO CHANGE\na,b,c,d=list(input()) # (0): a=3, b=2, c=4, d=2\ns=\"+-\" # (1): s=+-\n\nfor i in range(2): # (2): i=0 (22): i=1\n for j in range(2): # (3): j=0 (13): j=1 ... (41): NO CHANGE\n for k in range(2): # (4): k=0 (7): k=1 ... (40): NO CHANGE\n if eval(a+s[i]+b+s[j]+c+s[k]+d)==7: # (5): NO CHANGE (8): NO CHANGE ... (38): NO CHANGE\n print(eval(a+s[i]+b+s[j]+c+s[k]+d)) # (10): NO CHANGE (27): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n a,b,c,d=list(input())\n s=\"+-\"\n \n for i in range(2):\n for j in range(2):\n for k in range(2):\n if eval(a+s[i]+b+s[j]+c+s[k]+d)==7:\n- print(eval(a+s[i]+b+s[j]+c+s[k]+d))\n+ print(str(a+s[i]+b+s[j]+c+s[k]+d)+\"=7\")\n+ exit()\n", "FL_content": "\n \n a,b,c,d=list(input())\n s=\"+-\"\n \n for i in range(2):\n for j in range(2):\n for k in range(2):\n if eval(a+s[i]+b+s[j]+c+s[k]+d)==7:\n- print(eval(a+s[i]+b+s[j]+c+s[k]+d))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u954774382", "problem_id": "p03419", "submission1_id": "s479663331-FL", "submission2_id": "s082272209", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop, heappush\nfrom math import *\nfrom collections import defaultdict as dd, deque, Counter as C\nfrom itertools import combinations as comb, permutations as perm\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nfrom time import perf_counter\nfrom fractions import Fraction\n\n\n\nmod = int(pow(10, 9) + 7)\nmod2 = 998244353\ndef data(): return sys.stdin.readline().strip()\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\ndef l(): return list(sp())\ndef sl(): return list(ssp())\ndef sp(): return map(int, data().split())\ndef ssp(): return map(str, data().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n\n\n\n\n\n\n\n\n\nn,m=l()\nif(n<=2 and m<=2):\n print(0)\n exit()\nif(n==2):\n print((m-2)*2)\n exit()\nif(m==2):\n print((n-2)*2)\n exit()\nprint(max(1,n-2)*max(1,m-2))\n\n", "code2": "import sys\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop, heappush\nfrom math import *\nfrom collections import defaultdict as dd, deque, Counter as C\nfrom itertools import combinations as comb, permutations as perm\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nfrom time import perf_counter\nfrom fractions import Fraction\n\n\n\nmod = int(pow(10, 9) + 7)\nmod2 = 998244353\ndef data(): return sys.stdin.readline().strip()\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\ndef l(): return list(sp())\ndef sl(): return list(ssp())\ndef sp(): return map(int, data().split())\ndef ssp(): return map(str, data().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n\n\n\n\n\n\n\n\n\nn,m=l()\nif(n>m):\n n,m=m,n\nif(n==1 and m==1):\n print(1)\n exit()\nif(n==1 and m!=1):\n print(m-2)\n exit()\nprint((n-2)*(m-2))\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591043307", "date2": "1591043724", "bleu_score": "0.940555934577418", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 69, "total_score": 78, "input": "124 0\n", "actual_output": "122\n", "expected_output": "-244\n\n", "anno_code": ["import sys\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop, heappush\nfrom math import *\nfrom collections import defaultdict as dd, deque, Counter as C\nfrom itertools import combinations as comb, permutations as perm\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nfrom time import perf_counter\nfrom fractions import Fraction\n\n\n\nmod = int(pow(10, 9) + 7) # (0): nan=nan, mod=1000000007\nmod2 = 998244353 # (1): nan=nan, mod2=998244353, data=\ndef data(): return sys.stdin.readline().strip()\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end) # (2): nan=nan, out=, l=, sl=, sp=, ssp=, l1d=, l2d=\ndef l(): return list(sp())\ndef sl(): return list(ssp())\ndef sp(): return map(int, data().split())\ndef ssp(): return map(str, data().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n\n\n\n\n\n\n\n\n\nn,m=l() # (3): nan=nan, n=124, m=0\nif(n<=2 and m<=2): # (4): nan=nan\n print(0)\n exit()\nif(n==2): # (5): nan=nan\n print((m-2)*2)\n exit()\nif(m==2): # (6): nan=nan\n print((n-2)*2)\n exit()\nprint(max(1,n-2)*max(1,m-2))\n\n"], "anno_status": [true], "diff_content": " import sys\n from functools import lru_cache, cmp_to_key\n from heapq import merge, heapify, heappop, heappush\n from math import *\n from collections import defaultdict as dd, deque, Counter as C\n from itertools import combinations as comb, permutations as perm\n from bisect import bisect_left as bl, bisect_right as br, bisect\n from time import perf_counter\n from fractions import Fraction\n \n \n \n mod = int(pow(10, 9) + 7)\n mod2 = 998244353\n def data(): return sys.stdin.readline().strip()\n def out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\n def l(): return list(sp())\n def sl(): return list(ssp())\n def sp(): return map(int, data().split())\n def ssp(): return map(str, data().split())\n def l1d(n, val=0): return [val for i in range(n)]\n def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n \n \n \n \n \n \n \n \n \n n,m=l()\n-if(n<=2 and m<=2):\n- print(0)\n+if(n>m):\n+ n,m=m,n\n+if(n==1 and m==1):\n+ print(1)\n exit()\n-if(n==2):\n- print((m-2)*2)\n+if(n==1 and m!=1):\n+ print(m-2)\n exit()\n-if(m==2):\n- print((n-2)*2)\n- exit()\n-print(max(1,n-2)*max(1,m-2))\n+print((n-2)*(m-2))\n \n \n", "FL_content": "\n import sys\n from functools import lru_cache, cmp_to_key\n from heapq import merge, heapify, heappop, heappush\n from math import *\n from collections import defaultdict as dd, deque, Counter as C\n from itertools import combinations as comb, permutations as perm\n from bisect import bisect_left as bl, bisect_right as br, bisect\n from time import perf_counter\n from fractions import Fraction\n \n \n \n mod = int(pow(10, 9) + 7)\n mod2 = 998244353\n def data(): return sys.stdin.readline().strip()\n def out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\n def l(): return list(sp())\n def sl(): return list(ssp())\n def sp(): return map(int, data().split())\n def ssp(): return map(str, data().split())\n def l1d(n, val=0): return [val for i in range(n)]\n def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n \n \n \n \n \n \n \n \n \n n,m=l()\n if(n<=2 and m<=2):\n print(0)\n exit()\n if(n==2):\n print((m-2)*2)\n exit()\n if(m==2):\n print((n-2)*2)\n exit()\n-print(max(1,n-2)*max(1,m-2))\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 44 }, { "user_id": "u459798349", "problem_id": "p02616", "submission1_id": "s880935502-FL", "submission2_id": "s714057408", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k=map(int,input().split())\nA=[int(i) for i in input().split()]\nA.sort(key=lambda x:-abs(x))\nmod=10**9+7\n\n\nans=1\nflg=1\nflgcnt=0\nsave=1\n\nif k==1:\n print(max(A)%mod)\nelif max(A)<0:\n ans=1\n for i in range(k):\n ans=ans*A[n-1-i]%mod\n print(ans)\nelse:\n \n for i in range(k-2):\n now=A[i]\n if now <0:\n flg*=-1\n flgcnt+=1\n ans=ans*now%mod\n if i==k-3:\n save=ans\n \n pl=[]\n mi=[]\n for i in range(k-2,n):\n now=A[i]\n if now<0:\n if len(mi)<2:\n mi.append(now)\n else:\n if len(pl)<2:\n pl.append(now)\n if len(pl)==2 and len(mi)==2:\n break\n \n ck=pl+mi\n can=[]\n for i in range(len(ck)-1):\n for q in range(i+1,len(ck)):\n can.append(ck[i]*ck[q])\n can.sort()\n \n if flg>0:\n print(save*can[-1]%mod)\n else:\n print(save*can[0]%mod)\n \n \n \n", "code2": "n,k=map(int,input().split())\nA=[int(i) for i in input().split()]\nA.sort(key=lambda x:-abs(x))\nmod=10**9+7\n\nans=1\nif (max(A)<=0 and k%2==1) or n==k:\n for i in range(k):\n ans=ans*A[n-1-i]%mod\nelse:\n mi=0\n pl=0\n flg=1\n for i in range(k):\n ans=ans*A[i]%mod\n if A[i]>0:\n pl=A[i]\n if A[i]<0:\n mi=A[i]\n flg*=-1\n if ans==0:\n pass\n elif flg==-1:\n mi2=None\n pl2=None\n for i in range(k,n):\n if A[i]>=0:\n pl2=A[i]\n break\n for i in range(k,n):\n if A[i]<=0:\n mi2=A[i]\n break\n can=0\n if mi!=0 and pl2 is not None and pl!=0 and mi2 is not None:\n if pl2*pl > mi2*mi:\n can = pow(mi,-1,mod)*pl2%mod\n else:\n can = pow(pl,-1,mod)*mi2%mod\n elif mi!=0 and pl2 is not None:\n can = pow(mi,-1,mod)*pl2%mod\n elif pl!=0 and mi2 is not None:\n can = pow(pl,-1,mod)*mi2%mod \n ans=ans*can%mod\n\nprint(ans)\n \n \n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593981463", "date2": "1594457756", "bleu_score": "0.6556566575218353", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 101, "total_score": 104, "input": "4 2\n-1 -2 -2 -4\n", "actual_output": "2\n", "expected_output": "8\n\n", "anno_code": ["n,k=map(int,input().split()) # (0): n=4, k=2\nA=[int(i) for i in input().split()] # (1): A=[-1, -2, -2, -4]\nA.sort(key=lambda x:-abs(x)) # (2): A=[-4, -2, -2, -1]\nmod=10**9+7 # (3): mod=1000000007\n\n\nans=1 # (4): ans=1\nflg=1 # (5): flg=1\nflgcnt=0 # (6): flgcnt=0\nsave=1 # (7): save=1\n\nif k==1: # (8): NO CHANGE\n print(max(A)%mod)\nelif max(A)<0: # (9): NO CHANGE\n ans=1 # (10): NO CHANGE\n for i in range(k): # (11): i=0 (13): i=1 (15): NO CHANGE\n ans=ans*A[n-1-i]%mod # (12): ans=1000000006 (14): ans=2\n print(ans)\nelse:\n \n for i in range(k-2):\n now=A[i]\n if now <0:\n flg*=-1\n flgcnt+=1\n ans=ans*now%mod\n if i==k-3:\n save=ans\n \n pl=[]\n mi=[]\n for i in range(k-2,n):\n now=A[i]\n if now<0:\n if len(mi)<2:\n mi.append(now)\n else:\n if len(pl)<2:\n pl.append(now)\n if len(pl)==2 and len(mi)==2:\n break\n \n ck=pl+mi\n can=[]\n for i in range(len(ck)-1):\n for q in range(i+1,len(ck)):\n can.append(ck[i]*ck[q])\n can.sort()\n \n if flg>0:\n print(save*can[-1]%mod)\n else:\n print(save*can[0]%mod)\n \n \n \n"], "anno_status": [false], "diff_content": " n,k=map(int,input().split())\n A=[int(i) for i in input().split()]\n A.sort(key=lambda x:-abs(x))\n mod=10**9+7\n \n-\n ans=1\n-flg=1\n-flgcnt=0\n-save=1\n-\n-if k==1:\n- print(max(A)%mod)\n-elif max(A)<0:\n- ans=1\n+if (max(A)<=0 and k%2==1) or n==k:\n for i in range(k):\n ans=ans*A[n-1-i]%mod\n- print(ans)\n else:\n- \n- for i in range(k-2):\n- now=A[i]\n- if now <0:\n+ mi=0\n+ pl=0\n+ flg=1\n+ for i in range(k):\n+ ans=ans*A[i]%mod\n+ if A[i]>0:\n+ pl=A[i]\n+ if A[i]<0:\n+ mi=A[i]\n flg*=-1\n- flgcnt+=1\n- ans=ans*now%mod\n- if i==k-3:\n- save=ans\n- \n- pl=[]\n- mi=[]\n- for i in range(k-2,n):\n- now=A[i]\n- if now<0:\n- if len(mi)<2:\n- mi.append(now)\n- else:\n- if len(pl)<2:\n- pl.append(now)\n- if len(pl)==2 and len(mi)==2:\n- break\n- \n- ck=pl+mi\n- can=[]\n- for i in range(len(ck)-1):\n- for q in range(i+1,len(ck)):\n- can.append(ck[i]*ck[q])\n- can.sort()\n- \n- if flg>0:\n- print(save*can[-1]%mod)\n- else:\n- print(save*can[0]%mod)\n- \n- \n+ if ans==0:\n+ pass\n+ elif flg==-1:\n+ mi2=None\n+ pl2=None\n+ for i in range(k,n):\n+ if A[i]>=0:\n+ pl2=A[i]\n+ break\n+ for i in range(k,n):\n+ if A[i]<=0:\n+ mi2=A[i]\n+ break\n+ can=0\n+ if mi!=0 and pl2 is not None and pl!=0 and mi2 is not None:\n+ if pl2*pl > mi2*mi:\n+ can = pow(mi,-1,mod)*pl2%mod\n+ else:\n+ can = pow(pl,-1,mod)*mi2%mod\n+ elif mi!=0 and pl2 is not None:\n+ can = pow(mi,-1,mod)*pl2%mod\n+ elif pl!=0 and mi2 is not None:\n+ can = pow(pl,-1,mod)*mi2%mod \n+ ans=ans*can%mod\n+\n+print(ans)\n+ \n \n \n", "FL_content": "\n n,k=map(int,input().split())\n A=[int(i) for i in input().split()]\n A.sort(key=lambda x:-abs(x))\n mod=10**9+7\n \n \n ans=1\n flg=1\n flgcnt=0\n save=1\n \n if k==1:\n print(max(A)%mod)\n elif max(A)<0:\n ans=1\n for i in range(k):\n ans=ans*A[n-1-i]%mod\n print(ans)\n else:\n \n for i in range(k-2):\n now=A[i]\n if now <0:\n flg*=-1\n flgcnt+=1\n ans=ans*now%mod\n if i==k-3:\n save=ans\n \n pl=[]\n mi=[]\n for i in range(k-2,n):\n now=A[i]\n if now<0:\n if len(mi)<2:\n mi.append(now)\n else:\n if len(pl)<2:\n pl.append(now)\n if len(pl)==2 and len(mi)==2:\n break\n \n ck=pl+mi\n can=[]\n for i in range(len(ck)-1):\n for q in range(i+1,len(ck)):\n can.append(ck[i]*ck[q])\n can.sort()\n \n if flg>0:\n print(save*can[-1]%mod)\n else:\n print(save*can[0]%mod)\n \n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 57 }, { "user_id": "u732491892", "problem_id": "p03719", "submission1_id": "s390509534-FL", "submission2_id": "s977337334", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = map(int, input().split(' '))\nprint(\"YES\") if c >= a and c <= b else print(\"NO\")\n", "code2": "a, b, c = map(int, input().split(' '))\nprint(\"Yes\") if c >= a and c <= b else print(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1494723773", "date2": "1494723892", "bleu_score": "0.9315065860605276", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 21, "input": "-2 2 -3\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["a, b, c = map(int, input().split(' ')) # (0): a=-2, b=2, c=-3\nprint(\"YES\") if c >= a and c <= b else print(\"NO\")\n"], "anno_status": [true], "diff_content": " a, b, c = map(int, input().split(' '))\n-print(\"YES\") if c >= a and c <= b else print(\"NO\")\n+print(\"Yes\") if c >= a and c <= b else print(\"No\")\n \n", "FL_content": "\n a, b, c = map(int, input().split(' '))\n-print(\"YES\") if c >= a and c <= b else print(\"NO\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 3 }, { "user_id": "u740284863", "problem_id": "p02843", "submission1_id": "s822548585-FL", "submission2_id": "s380782817", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import itertools\nn = input()\nif len(n) <= 2:\n print(0)\n exit()\nn = int(str(n)[0:3])\n\nk = int(str(n)[0])\nl = int(str(n)[1:3])\n\nif l < 5*k:\n print(1)\nelse:\n print(0)\n", "code2": "import itertools\nn = input()\nif len(n) <= 2:\n print(0)\n exit()\n\n\nk = int(n[:len(n)-2])\nl = int(n[len(n)-2:])\n\nif l <= 5*k:\n print(1)\nelse:\n print(0)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575252928", "date2": "1575253302", "bleu_score": "0.7758834040567911", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 25, "total_score": 26, "input": "420\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["import itertools\nn = input() # (0): n=420\nif len(n) <= 2: # (1): NO CHANGE\n print(0)\n exit()\nn = int(str(n)[0:3]) # (2): n=420\n\nk = int(str(n)[0]) # (3): k=4\nl = int(str(n)[1:3]) # (4): l=20\n\nif l < 5*k: # (5): NO CHANGE\n print(1)\nelse:\n print(0)\n"], "anno_status": [true], "diff_content": " import itertools\n n = input()\n if len(n) <= 2:\n print(0)\n exit()\n-n = int(str(n)[0:3])\n \n-k = int(str(n)[0])\n-l = int(str(n)[1:3])\n \n-if l < 5*k:\n+k = int(n[:len(n)-2])\n+l = int(n[len(n)-2:])\n+\n+if l <= 5*k:\n print(1)\n else:\n print(0)\n \n", "FL_content": "\n import itertools\n n = input()\n if len(n) <= 2:\n print(0)\n exit()\n n = int(str(n)[0:3])\n \n k = int(str(n)[0])\n l = int(str(n)[1:3])\n \n-if l < 5*k:\n print(1)\n else:\n print(0)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u691018832", "problem_id": "p03838", "submission1_id": "s065902461-FL", "submission2_id": "s575262987", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\nx, y = map(int, readline().split())\nif x <= y:\n if (x > 0 and y > 0) or (x <= 0 and y <= 0):\n ans = y - x\n else:\n ans = y + x + 1\nelse:\n if (x >= 0 and y >= 0) or (x < 0 and y < 0):\n ans = min(abs(x) + abs(y) + 1, abs(y) - abs(x) + 2)\n else:\n ans = - x - y + 1\nprint(ans)\n", "code2": "import sys\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\nx, y = map(int, readline().split())\nif x <= y:\n if (x >= 0 and y >= 0) or (x <= 0 and y <= 0):\n ans = y - x\n else:\n ans = abs(abs(x) - y) + 1\nelse:\n if (x > 0 and y > 0) or (x < 0 and y < 0):\n ans = min(abs(x) + abs(y) + 1, abs(abs(y) - abs(x)) + 2)\n elif y == 0:\n ans = abs(x) + 1\n elif x == 0:\n ans = abs(y) + 1\n else:\n ans = abs(x - abs(y)) + 1\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585939122", "date2": "1585939669", "bleu_score": "0.7870639086841366", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1], "code1_test_score": 29, "total_score": 90, "input": "370 -1\n", "actual_output": "-368\n", "expected_output": "370\n\n", "anno_code": ["import sys\nread = sys.stdin.buffer.read # (0): read=\nreadline = sys.stdin.buffer.readline # (1): readline=\nreadlines = sys.stdin.buffer.readlines # (2): readlines=\n\nx, y = map(int, readline().split()) # (3): x=370, y=-1\nif x <= y: # (4): NO CHANGE\n if (x > 0 and y > 0) or (x <= 0 and y <= 0):\n ans = y - x\n else:\n ans = y + x + 1\nelse:\n if (x >= 0 and y >= 0) or (x < 0 and y < 0): # (5): NO CHANGE\n ans = min(abs(x) + abs(y) + 1, abs(y) - abs(x) + 2)\n else:\n ans = - x - y + 1 # (6): ans=-368\nprint(ans)\n"], "anno_status": [true], "diff_content": " import sys\n read = sys.stdin.buffer.read\n readline = sys.stdin.buffer.readline\n readlines = sys.stdin.buffer.readlines\n \n x, y = map(int, readline().split())\n if x <= y:\n- if (x > 0 and y > 0) or (x <= 0 and y <= 0):\n+ if (x >= 0 and y >= 0) or (x <= 0 and y <= 0):\n ans = y - x\n else:\n- ans = y + x + 1\n+ ans = abs(abs(x) - y) + 1\n else:\n- if (x >= 0 and y >= 0) or (x < 0 and y < 0):\n- ans = min(abs(x) + abs(y) + 1, abs(y) - abs(x) + 2)\n+ if (x > 0 and y > 0) or (x < 0 and y < 0):\n+ ans = min(abs(x) + abs(y) + 1, abs(abs(y) - abs(x)) + 2)\n+ elif y == 0:\n+ ans = abs(x) + 1\n+ elif x == 0:\n+ ans = abs(y) + 1\n else:\n- ans = - x - y + 1\n+ ans = abs(x - abs(y)) + 1\n print(ans)\n \n", "FL_content": "\n import sys\n read = sys.stdin.buffer.read\n readline = sys.stdin.buffer.readline\n readlines = sys.stdin.buffer.readlines\n \n x, y = map(int, readline().split())\n if x <= y:\n if (x > 0 and y > 0) or (x <= 0 and y <= 0):\n ans = y - x\n else:\n ans = y + x + 1\n else:\n if (x >= 0 and y >= 0) or (x < 0 and y < 0):\n- ans = min(abs(x) + abs(y) + 1, abs(y) - abs(x) + 2)\n else:\n ans = - x - y + 1\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u539753516", "problem_id": "p02413", "submission1_id": "s956520173-FL", "submission2_id": "s050160440", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r,c=map(int, input().split())\nfor i in range(r):\n a=list(map(int, input().split()))\n a.append(sum(a))\n print(*a)\n", "code2": "r,c=map(int, input().split())\ntotal=[0]*(c+1)\nfor i in range(r):\n a=list(map(int, input().split()))\n a.append(sum(a))\n print(*a)\n for j in range(c+1):\n total[j]+=a[j]\nprint(*total)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1531242738", "date2": "1531271809", "bleu_score": "0.605757069751726", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "4 5\n2 1 3 5 1\n4 3 1 6 10\n3 4 0 1 2\n2 6 4 21 5\n", "actual_output": "2 1 3 5 1 12\n4 3 1 6 10 24\n3 4 0 1 2 10\n2 6 4 21 5 38\n", "expected_output": "2 1 3 5 1 12\n4 3 1 6 10 24\n3 4 0 1 2 10\n2 6 4 21 5 38\n11 14 8 33 18 84\n\n", "anno_code": ["r,c=map(int, input().split()) # (0): r=4, c=5\nfor i in range(r): # (1): i=0 (5): i=1 ... (13): i=3\n a=list(map(int, input().split())) # (2): a=[2, 1, 3, 5, 1] (6): a=[4, 3, 1, 6, 10] ... (14): a=[2, 6, 4, 21, 5]\n a.append(sum(a)) # (3): a=[2, 1, 3, 5, 1, 12] (7): a=[4, 3, 1, 6, 10, 24] ... (15): a=[2, 6, 4, 21, 5, 38]\n print(*a) # (4): NO CHANGE (8): NO CHANGE ... (16): NO CHANGE\n"], "anno_status": [true], "diff_content": " r,c=map(int, input().split())\n+total=[0]*(c+1)\n for i in range(r):\n a=list(map(int, input().split()))\n a.append(sum(a))\n print(*a)\n+ for j in range(c+1):\n+ total[j]+=a[j]\n+print(*total)\n \n", "FL_content": "\n r,c=map(int, input().split())\n for i in range(r):\n a=list(map(int, input().split()))\n a.append(sum(a))\n print(*a)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u141610915", "problem_id": "p03689", "submission1_id": "s140299713-FL", "submission2_id": "s176219646", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nH, W, h, w = map(int, input().split())\nres = [[1] * W for _ in range(H)]\nfor i in range(h - 1, H, h):\n for j in range(w - 1, W, w): res[i][j] = -h * w\nif sum([sum(r) for r in res]) > 0:\n print(\"Yes\")\n for r in res: print(*r)\nelse: print(\"No\")", "code2": "import sys\ninput = sys.stdin.readline\nH, W, h, w = map(int, input().split())\nunit = 10 ** 9 - 1\nc = H * W\nfor i in range(h - 1, H, h):\n for j in range(w - 1, W, w): c -= 1\nif c == 0:\n print(\"No\")\n exit(0)\nres = [[unit \nfor i in range(h - 1, H, h):\n for j in range(w - 1, W, w): res[i][j] = -(unit \nif sum([sum(r) for r in res]) > 0:\n print(\"Yes\")\n for r in res: print(*r)\nelse: print(\"No\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1588950685", "date2": "1588951831", "bleu_score": "0.6748557187300024", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 3, "total_score": 96, "input": "2 11 2 2\n", "actual_output": "No\n", "expected_output": "Yes\n1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000\n1000 -3001 1000 -3001 1000 -3001 1000 -3001 1000 -3001 1000\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\nH, W, h, w = map(int, input().split()) # (1): H=2, W=11, h=2, w=2\nres = [[1] * W for _ in range(H)] # (2): res\nfor i in range(h - 1, H, h): # (3): i=1 (10): NO CHANGE\n for j in range(w - 1, W, w): res[i][j] = -h * w # (4): res=[[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, -4, 1, 1, 1, 1, 1, 1, 1, 1, 1]], j=1 (5): res, j=3 ... (9): NO CHANGE\nif sum([sum(r) for r in res]) > 0: # (11): NO CHANGE\n print(\"Yes\")\n for r in res: print(*r)\nelse: print(\"No\")"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n H, W, h, w = map(int, input().split())\n-res = [[1] * W for _ in range(H)]\n+unit = 10 ** 9 - 1\n+c = H * W\n for i in range(h - 1, H, h):\n- for j in range(w - 1, W, w): res[i][j] = -h * w\n+ for j in range(w - 1, W, w): c -= 1\n+if c == 0:\n+ print(\"No\")\n+ exit(0)\n+res = [[unit \n+for i in range(h - 1, H, h):\n+ for j in range(w - 1, W, w): res[i][j] = -(unit \n if sum([sum(r) for r in res]) > 0:\n print(\"Yes\")\n for r in res: print(*r)\n else: print(\"No\")\n", "FL_content": "\n import sys\n input = sys.stdin.readline\n H, W, h, w = map(int, input().split())\n res = [[1] * W for _ in range(H)]\n-for i in range(h - 1, H, h):\n- for j in range(w - 1, W, w): res[i][j] = -h * w\n if sum([sum(r) for r in res]) > 0:\n print(\"Yes\")\n for r in res: print(*r)\n else: print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u099918199", "problem_id": "p03363", "submission1_id": "s086379236-FL", "submission2_id": "s011506512", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nlist_a = list((map(int, input().split())))\nmemo = 0\nmemo_dict = {0:1}\nfor i in range(0,n):\n memo += list_a[i]\n if memo in memo_dict:\n memo_dict[memo] += 1\n else:\n memo_dict[memo] = 1\nprint(memo_dict)\nans = 0\nfor number in memo_dict.values():\n ans += number * (number-1) / 2\nprint(int(ans))\n", "code2": "n = int(input())\nlist_a = list((map(int, input().split())))\nmemo = 0\nmemo_dict = {0:1}\nfor i in range(0,n):\n memo += list_a[i]\n if memo in memo_dict:\n memo_dict[memo] += 1\n else:\n memo_dict[memo] = 1\nans = 0\nfor number in memo_dict.values():\n ans += number * (number-1) / 2\nprint(int(ans))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1537939908", "date2": "1537940032", "bleu_score": "0.945352422842051", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "6\n1 3 -2 2 2 -4\n", "actual_output": "{0: 1, 1: 1, 4: 2, 2: 2, 6: 1}\n2\n", "expected_output": "2\n\n", "anno_code": ["n = int(input()) # (0): n=6\nlist_a = list((map(int, input().split()))) # (1): list_a=[1, 3, -2, 2, 2, -4]\nmemo = 0 # (2): memo=0\nmemo_dict = {0:1} # (3): memo_dict={0: 1}\nfor i in range(0,n): # (4): i=0 (8): i=1 ... (28): NO CHANGE\n memo += list_a[i] # (5): memo=1 (9): memo=4 ... (25): memo=2\n if memo in memo_dict: # (6): NO CHANGE (10): NO CHANGE ... (26): NO CHANGE\n memo_dict[memo] += 1 # (19): memo_dict={0: 1, 1: 1, 4: 2, 2: 1} (27): memo_dict={0: 1, 1: 1, 4: 2, 2: 2, 6: 1}\n else:\n memo_dict[memo] = 1 # (7): memo_dict={0: 1, 1: 1} (11): memo_dict={0: 1, 1: 1, 4: 1} ... (23): memo_dict={0: 1, 1: 1, 4: 2, 2: 1, 6: 1}\nprint(memo_dict) # (29): NO CHANGE\nans = 0 # (30): ans=0\nfor number in memo_dict.values(): # (31): number=1 (33): NO CHANGE ... (41): NO CHANGE\n ans += number * (number-1) / 2 # (32): NO CHANGE (34): NO CHANGE ... (40): NO CHANGE\nprint(int(ans))\n"], "anno_status": [true], "diff_content": " n = int(input())\n list_a = list((map(int, input().split())))\n memo = 0\n memo_dict = {0:1}\n for i in range(0,n):\n memo += list_a[i]\n if memo in memo_dict:\n memo_dict[memo] += 1\n else:\n memo_dict[memo] = 1\n-print(memo_dict)\n ans = 0\n for number in memo_dict.values():\n ans += number * (number-1) / 2\n print(int(ans))\n \n", "FL_content": "\n n = int(input())\n list_a = list((map(int, input().split())))\n memo = 0\n memo_dict = {0:1}\n for i in range(0,n):\n memo += list_a[i]\n if memo in memo_dict:\n memo_dict[memo] += 1\n else:\n memo_dict[memo] = 1\n-print(memo_dict)\n ans = 0\n for number in memo_dict.values():\n ans += number * (number-1) / 2\n print(int(ans))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u655048024", "problem_id": "p03419", "submission1_id": "s521317565-FL", "submission2_id": "s126834767", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m = map(int,input().split())\nif(n==2)or(m==2):\n print(0)\nelif(n==1)or(m==1):\n if(n==1)and(m==1):\n print(1)\n else:\n print(max(0,max(n,m)-2))\nelse:\n print((n-2)*(m-1))", "code2": "n,m = map(int,input().split())\nif(n==2)or(m==2):\n print(0)\nelif(n==1)or(m==1):\n if(n==1)and(m==1):\n print(1)\n else:\n print(max(0,max(n,m)-2))\nelse:\n print((n-2)*(m-2))\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599222136", "date2": "1599222257", "bleu_score": "0.981545919767359", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 78, "input": "527 374\n", "actual_output": "195825\n", "expected_output": "195300\n\n", "anno_code": ["n,m = map(int,input().split()) # (0): n=527, m=374\nif(n==2)or(m==2): # (1): NO CHANGE\n print(0)\nelif(n==1)or(m==1): # (2): NO CHANGE\n if(n==1)and(m==1):\n print(1)\n else:\n print(max(0,max(n,m)-2))\nelse:\n print((n-2)*(m-1))"], "anno_status": [true], "diff_content": " n,m = map(int,input().split())\n if(n==2)or(m==2):\n print(0)\n elif(n==1)or(m==1):\n if(n==1)and(m==1):\n print(1)\n else:\n print(max(0,max(n,m)-2))\n else:\n- print((n-2)*(m-1))\n+ print((n-2)*(m-2))\n+\n", "FL_content": "\n n,m = map(int,input().split())\n-if(n==2)or(m==2):\n print(0)\n-elif(n==1)or(m==1):\n- if(n==1)and(m==1):\n- print(1)\n- else:\n- print(max(0,max(n,m)-2))\n-else:\n- print((n-2)*(m-1))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u306033313", "problem_id": "p02555", "submission1_id": "s753545340-FL", "submission2_id": "s081808320", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = int(input())\n\ntable = [1, 0, 0]\nfor i in range(s):\n table.append(table[i]+table[i+2])\nprint(table[s])", "code2": "s = int(input())\nmod = 10**9+7\ntable = [1, 0, 0]\nfor i in range(s):\n table.append((table[i]+table[i+2])%mod)\nprint(table[s])", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600030705", "date2": "1600030778", "bleu_score": "0.821303075905733", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "1729\n", "actual_output": "20623129494060967456366223709273865563628093762746947890246341055212602771464188569813325316144677694087201739670918472849917544924566330064252812731523016425621144482930837956507880328589243453432111379713861047677638988102574174614354113225747243223940031366884262872309431202186642723\n", "expected_output": "294867501\n", "anno_code": ["s = int(input()) # (0): s=1729\n\ntable = [1, 0, 0] # (1): table=[1, 0, 0]\nfor i in range(s): # (2): i=0 (4): i=1 ... (3460): NO CHANGE\n table.append(table[i]+table[i+2]) # (3): table=[1, 0, 0, 1] (5): table=[1, 0, 0, 1, 1] ... (3459): table=[1, 0, ..., 30224665297765039814071651529294462452793653337596892457982477637171710485383846517629403730764295636737347632055091798655949032796115823857085541275559685577862198670350104381365668379732088814037584830338290786198341055922374357763259701560260902874027969790102344412578234382460300720, 44296399953508511098554639096449937117554579571539729292285129929520296930954554211876262939544448605779249970807983243176012087225003797184772736655568126685831784932343000648044937709928622094187856034378070372539935323865389973396807931418475519679791421540866912521126968788410382398]\nprint(table[s])"], "anno_status": [true], "diff_content": " s = int(input())\n-\n+mod = 10**9+7\n table = [1, 0, 0]\n for i in range(s):\n- table.append(table[i]+table[i+2])\n+ table.append((table[i]+table[i+2])%mod)\n print(table[s])\n", "FL_content": "\n s = int(input())\n \n table = [1, 0, 0]\n-for i in range(s):\n table.append(table[i]+table[i+2])\n print(table[s])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u773865844", "problem_id": "p02702", "submission1_id": "s554412245-FL", "submission2_id": "s137397724", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = str(input())\n\n\nA = []\np =1\nfor i in range(len(S)):\n A.append(p)\n p = p*10%2019\n\n\nX = []\na = 0\nfor i in range(len(S)):\n a = (a + int(S[len(S)-i-1])*A[i]) %2019\n X.append(a)\nX.sort()\nflag =1\nn = 0\n\n\nfor i in range(len(X)-1):\n if X[i]==0:\n n +=1\n if X[i]==X[i+1]:\n flag += 1\n else:\n n += flag*(flag-1)\n flag = 1\nprint(n)", "code2": "S = str(input())\n\n\nA = []\np =1\nfor i in range(len(S)):\n A.append(p)\n p = p*10%2019\n\n\nX = []\na = 0\nfor i in range(len(S)):\n a = (a + int(S[len(S)-i-1])*A[i]) %2019\n X.append(a)\nX.sort()\nflag =1\nn = 0\n\n\nfor i in range(len(X)-1):\n if X[i]==0:\n n +=1\n if X[i]==X[i+1]:\n flag += 1\n else:\n n += int(flag*(flag-1)/2)\n flag = 1\nn += int(flag*(flag-1)/2)\nif X[len(X)-1]==0:\n n +=1\nprint(n)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1588197504", "date2": "1588199806", "bleu_score": "0.8410116689019727", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1], "code1_test_score": 31, "total_score": 74, "input": "5256140109\n", "actual_output": "4\n", "expected_output": "2\n\n", "anno_code": ["S = str(input()) # (0): S=5256140109\n\n\nA = [] # (1): A=[]\np =1 # (2): p=1\nfor i in range(len(S)): # (3): i=0 (6): i=1 ... (33): NO CHANGE\n A.append(p) # (4): A=[1] (7): A=[1, 10] ... (31): A=[1, 10, 100, 1000, 1924, 1069, 595, 1912, 949, 1414]\n p = p*10%2019 # (5): p=10 (8): p=100 ... (32): p=7\n\n\nX = [] # (34): X=[]\na = 0 # (35): a=0\nfor i in range(len(S)): # (36): i=0 (39): i=1 ... (66): NO CHANGE\n a = (a + int(S[len(S)-i-1])*A[i]) %2019 # (37): a=9 (40): NO CHANGE ... (64): a=687\n X.append(a) # (38): X=[9] (41): X=[9, 9] ... (65): X=[9, 9, 109, 109, 1748, 798, 330, 1814, 1693, 687]\nX.sort() # (67): X=[9, 9, 109, 109, 330, 687, 798, 1693, 1748, 1814]\nflag =1 # (68): flag=1\nn = 0 # (69): n=0\n\n\nfor i in range(len(X)-1): # (70): i=0 (74): i=1 ... (113): NO CHANGE\n if X[i]==0: # (71): NO CHANGE (75): NO CHANGE ... (109): NO CHANGE\n n +=1\n if X[i]==X[i+1]: # (72): NO CHANGE (76): NO CHANGE ... (110): NO CHANGE\n flag += 1 # (73): flag=2 (82): flag=2\n else:\n n += flag*(flag-1) # (77): n=2 (86): n=4 ... (111): NO CHANGE\n flag = 1 # (78): flag=1 (87): flag=1 ... (112): NO CHANGE\nprint(n)"], "anno_status": [true], "diff_content": " S = str(input())\n \n \n A = []\n p =1\n for i in range(len(S)):\n A.append(p)\n p = p*10%2019\n \n \n X = []\n a = 0\n for i in range(len(S)):\n a = (a + int(S[len(S)-i-1])*A[i]) %2019\n X.append(a)\n X.sort()\n flag =1\n n = 0\n \n \n for i in range(len(X)-1):\n if X[i]==0:\n n +=1\n if X[i]==X[i+1]:\n flag += 1\n else:\n- n += flag*(flag-1)\n+ n += int(flag*(flag-1)/2)\n flag = 1\n+n += int(flag*(flag-1)/2)\n+if X[len(X)-1]==0:\n+ n +=1\n print(n)\n+\n", "FL_content": "\n S = str(input())\n \n \n A = []\n p =1\n for i in range(len(S)):\n A.append(p)\n p = p*10%2019\n \n \n X = []\n a = 0\n for i in range(len(S)):\n a = (a + int(S[len(S)-i-1])*A[i]) %2019\n X.append(a)\n X.sort()\n flag =1\n n = 0\n \n \n for i in range(len(X)-1):\n if X[i]==0:\n n +=1\n if X[i]==X[i+1]:\n flag += 1\n else:\n n += flag*(flag-1)\n flag = 1\n print(n)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 29 }, { "user_id": "u712429027", "problem_id": "p03419", "submission1_id": "s309046209-FL", "submission2_id": "s821173372", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nins = lambda: input().rstrip()\nini = lambda: int(input().rstrip())\ninm = lambda: map(int, input().split())\ninl = lambda: list(map(int, input().split()))\nout = lambda x: print('\\n'.join(map(str, x)))\n\nn, m = inm()\nprint(n*m - min(2, m) * n - (0 if n <= 2 else 2*m - 4))", "code2": "import sys\ninput = sys.stdin.readline\nins = lambda: input().rstrip()\nini = lambda: int(input().rstrip())\ninm = lambda: map(int, input().split())\ninl = lambda: list(map(int, input().split()))\nout = lambda x: print('\\n'.join(map(str, x)))\n\nn, m = inm()\nif n == 1 and m == 1:\n print(1)\nelif n == 1:\n print(m-2)\nelif m == 1:\n print(n-2)\nelse:\n print((m-2) * (n-2))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598516433", "date2": "1598516688", "bleu_score": "0.736811954348878", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 69, "total_score": 78, "input": "48 -1\n", "actual_output": "6\n", "expected_output": "-138\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\nins = lambda: input().rstrip() # (1): ins= at 0x0000023B67069BD0>\nini = lambda: int(input().rstrip()) # (2): ini= at 0x0000023B67069B40>\ninm = lambda: map(int, input().split()) # (3): inm= at 0x0000023B67069C60>\ninl = lambda: list(map(int, input().split())) # (4): inl= at 0x0000023B67069CF0>\nout = lambda x: print('\\n'.join(map(str, x))) # (5): out= at 0x0000023B67069D80>\n\nn, m = inm() # (6): n=48, m=-1\nprint(n*m - min(2, m) * n - (0 if n <= 2 else 2*m - 4))"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n ins = lambda: input().rstrip()\n ini = lambda: int(input().rstrip())\n inm = lambda: map(int, input().split())\n inl = lambda: list(map(int, input().split()))\n out = lambda x: print('\\n'.join(map(str, x)))\n \n n, m = inm()\n-print(n*m - min(2, m) * n - (0 if n <= 2 else 2*m - 4))\n+if n == 1 and m == 1:\n+ print(1)\n+elif n == 1:\n+ print(m-2)\n+elif m == 1:\n+ print(n-2)\n+else:\n+ print((m-2) * (n-2))\n", "FL_content": "\n import sys\n input = sys.stdin.readline\n ins = lambda: input().rstrip()\n ini = lambda: int(input().rstrip())\n inm = lambda: map(int, input().split())\n inl = lambda: list(map(int, input().split()))\n out = lambda x: print('\\n'.join(map(str, x)))\n \n n, m = inm()\n-print(n*m - min(2, m) * n - (0 if n <= 2 else 2*m - 4))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u149260203", "problem_id": "p03363", "submission1_id": "s161615627-FL", "submission2_id": "s673866124", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = [int(i) for i in input().split()]\nca = [A[0]] + [0]*(N-1)\n\nfor i in range(1,N):\n ca[i] = ca[i-1] + A[i]\n\ncount = 0\nfor i in list(set(ca)):\n if i == 0:\n count += sum([1 if j == 0 else 0 for j in ca])\n number = sum([1 if j == i else 0 for j in ca])\n count += number * (number-1) /2\n\n\nprint(count)", "code2": "N = int(input())\nA = [int(i) for i in input().split()]\nca = [A[0]] + [0]*(N-1)\n\nfor i in range(1,N):\n ca[i] = ca[i-1] + A[i]\n\ncount = 1\nnumber = 0\nnumber += ca.count(0)\nsca = sorted(ca) + ['hoge']\nfor i in range(1,N+1):\n if sca[i] == sca[i-1]:\n count += 1\n else:\n number += count*(count - 1)/2\n count = 1\n\n\nprint(int(number))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1527117665", "date2": "1527119935", "bleu_score": "0.7013991385640482", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "7\n0 -2 2 -4 0 0 0\n", "actual_output": "9.0\n", "expected_output": "9\n\n", "anno_code": ["N = int(input()) # (0): N=7\nA = [int(i) for i in input().split()] # (1): A=[0, -2, 2, -4, 0, 0, 0]\nca = [A[0]] + [0]*(N-1) # (2): ca=[0, 0, 0, 0, 0, 0, 0]\n\nfor i in range(1,N): # (3): i=1 (5): i=2 ... (15): NO CHANGE\n ca[i] = ca[i-1] + A[i] # (4): ca=[0, -2, 0, 0, 0, 0, 0] (6): NO CHANGE ... (14): ca=[0, -2, 0, -4, -4, -4, -4]\n\ncount = 0 # (16): count=0\nfor i in list(set(ca)): # (17): i=0 (22): i=-4 ... (30): NO CHANGE\n if i == 0: # (18): NO CHANGE (23): NO CHANGE (27): NO CHANGE\n count += sum([1 if j == 0 else 0 for j in ca]) # (19): count=2\n number = sum([1 if j == i else 0 for j in ca]) # (20): number=2 (24): number=4 (28): number=1\n count += number * (number-1) /2 # (21): count=3.0 (25): count=9.0 (29): NO CHANGE\n\n\nprint(count)"], "anno_status": [true], "diff_content": " N = int(input())\n A = [int(i) for i in input().split()]\n ca = [A[0]] + [0]*(N-1)\n \n for i in range(1,N):\n ca[i] = ca[i-1] + A[i]\n \n-count = 0\n-for i in list(set(ca)):\n- if i == 0:\n- count += sum([1 if j == 0 else 0 for j in ca])\n- number = sum([1 if j == i else 0 for j in ca])\n- count += number * (number-1) /2\n+count = 1\n+number = 0\n+number += ca.count(0)\n+sca = sorted(ca) + ['hoge']\n+for i in range(1,N+1):\n+ if sca[i] == sca[i-1]:\n+ count += 1\n+ else:\n+ number += count*(count - 1)/2\n+ count = 1\n \n \n-print(count)\n+print(int(number))\n", "FL_content": "\n N = int(input())\n A = [int(i) for i in input().split()]\n ca = [A[0]] + [0]*(N-1)\n \n for i in range(1,N):\n ca[i] = ca[i-1] + A[i]\n \n count = 0\n for i in list(set(ca)):\n if i == 0:\n- count += sum([1 if j == 0 else 0 for j in ca])\n number = sum([1 if j == i else 0 for j in ca])\n count += number * (number-1) /2\n \n \n print(count)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u557494880", "problem_id": "p03353", "submission1_id": "s981312708-FL", "submission2_id": "s787635497", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nK = int(input())\nn = len(s)\nA =[]\nfor i in range(n):\n for j in range(i+1,n+1):\n sub = s[i:j] \n if sub not in A:\n if len(A) < K:\n A.append(sub)\n else:\n A.append(sub)\n A.sort()\n A.pop(K)\nprint(A[K-1])", "code2": "s = input()\nK = int(input())\nn = len(s)\nA =[]\nimport bisect\nfor i in range(n):\n for j in range(1,K+1):\n sub = s[i:i+j] \n if sub not in A:\n x = bisect.bisect_left(A,sub)\n A.insert(x,sub)\n if len(A) > K:\n A.pop(K)\n\nprint(A[K-1])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573785215", "date2": "1573785779", "bleu_score": "0.7577102389467677", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 103, "input": "eab\n6\n", "actual_output": "b\n", "expected_output": "eab\n\n", "anno_code": ["s = input() # (0): s=eab\nK = int(input()) # (1): K=6\nn = len(s) # (2): n=3\nA =[] # (3): A=[]\nfor i in range(n): # (4): i=0 (21): i=1 ... (40): NO CHANGE\n for j in range(i+1,n+1): # (5): j=1 (10): j=2 ... (39): NO CHANGE\n sub = s[i:j] # (6): sub=e (11): sub=ea ... (35): sub=b\n if sub not in A: # (7): NO CHANGE (12): NO CHANGE ... (36): NO CHANGE\n if len(A) < K: # (8): NO CHANGE (13): NO CHANGE ... (37): NO CHANGE\n A.append(sub) # (9): A=['e'] (14): A=['e', 'ea'] ... (38): A=['e', 'ea', 'eab', 'a', 'ab', 'b']\n else:\n A.append(sub)\n A.sort()\n A.pop(K)\nprint(A[K-1])"], "anno_status": [true], "diff_content": " s = input()\n K = int(input())\n n = len(s)\n A =[]\n+import bisect\n for i in range(n):\n- for j in range(i+1,n+1):\n- sub = s[i:j] \n+ for j in range(1,K+1):\n+ sub = s[i:i+j] \n if sub not in A:\n- if len(A) < K:\n- A.append(sub)\n- else:\n- A.append(sub)\n- A.sort()\n+ x = bisect.bisect_left(A,sub)\n+ A.insert(x,sub)\n+ if len(A) > K:\n A.pop(K)\n+\n print(A[K-1])\n", "FL_content": "\n s = input()\n K = int(input())\n n = len(s)\n A =[]\n for i in range(n):\n for j in range(i+1,n+1):\n sub = s[i:j] \n if sub not in A:\n if len(A) < K:\n A.append(sub)\n else:\n A.append(sub)\n A.sort()\n- A.pop(K)\n print(A[K-1])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u813102292", "problem_id": "p03003", "submission1_id": "s261859106-FL", "submission2_id": "s874521161", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict as dd\nused = dd(int)\n\nN, M = map(int, input().split())\nMOD = 10**9 + 7\ns = list(map(int, input().split()))\nt = list(map(int, input().split()))\n\ndp = [[0 for i in range(M+1)] for j in range(N+1)]\nfor j in range(M):\n dp[1][j + 1] = dp[1][j] + 1 if s[0] == t[j] else dp[1][j]\n\nfor i in range(N):\n dp[i + 1][1] = dp[i][1] + 1 if t[0] == s[i] else dp[i][1]\n\nused[s[0]] = 1\nif N > 1 and M > 1:\n for i in range(1, N):\n used[s[i]] = 1\n for j in range(1, M):\n if used[t[j]] == 1:\n dp[i + 1][j + 1] = dp[i][j + 1] + dp[i + 1][j]\n used[t[j]] = 2\n if s[i] == t[j]:\n dp[i+1][j+1] += 1\n else:\n dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j])\n \nprint((dp[N][M] + 1)%MOD)\n", "code2": "N, M = map(int, input().split())\nMOD = 10**9 + 7\ns = list(map(int, input().split()))\nt = list(map(int, input().split()))\n\ndp = [[0 for i in range(M+1)] for j in range(N+1)]\nfor j in range(M):\n dp[1][j + 1] = dp[1][j] + 1 if s[0] == t[j] else dp[1][j]\n\nfor i in range(N):\n dp[i + 1][1] = dp[i][1] + 1 if t[0] == s[i] else dp[i][1]\n\nfor i in range(1, N):\n for j in range(1, M):\n if s[i] == t[j]:\n dp[i + 1][j + 1] = (dp[i][j + 1] + dp[i + 1][j] + 1)%MOD\n else:\n dp[i + 1][j + 1] = (dp[i][j+1] + dp[i+1][j] - dp[i][j])%MOD\n \nprint((dp[N][M] + 1)%MOD)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1560740837", "date2": "1560743610", "bleu_score": "0.6574738059775687", "code1_test_status": [0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0], "code1_test_score": 7, "total_score": 105, "input": "10 9\n9 6 5 12 5 9 8 5 6 7\n8 2 14 7 5 7 9 9 2\n", "actual_output": "6\n", "expected_output": "23\n\n", "anno_code": ["from collections import defaultdict as dd\nused = dd(int) # (0): used=defaultdict(, {})\n\nN, M = map(int, input().split()) # (1): N=10, M=9\nMOD = 10**9 + 7 # (2): MOD=1000000007\ns = list(map(int, input().split())) # (3): s=[9, 6, 5, 12, 5, 9, 8, 5, 6, 7]\nt = list(map(int, input().split())) # (4): t=[8, 2, 14, 7, 5, 7, 9, 9, 2]\n\ndp = [[0 for i in range(M+1)] for j in range(N+1)] # (5): dp\nfor j in range(M): # (6): j=0 (8): j=1 ... (24): NO CHANGE\n dp[1][j + 1] = dp[1][j] + 1 if s[0] == t[j] else dp[1][j] # (7): NO CHANGE (9): NO CHANGE ... (23): dp\n\nfor i in range(N): # (25): i=0 (27): i=1 ... (45): NO CHANGE\n dp[i + 1][1] = dp[i][1] + 1 if t[0] == s[i] else dp[i][1] # (26): NO CHANGE (28): NO CHANGE ... (44): dp\n\nused[s[0]] = 1 # (46): used=defaultdict(, {9: 1})\nif N > 1 and M > 1: # (47): NO CHANGE\n for i in range(1, N): # (48): i=1 (77): i=2 ... (308): NO CHANGE\n used[s[i]] = 1 # (49): used=defaultdict(, {9: 1, 6: 1}) (78): used=defaultdict(, {9: 2, 6: 1, 2: 0, 14: 0, 7: 0, 5: 1}) ... (279): used=defaultdict(, {9: 2, 6: 1, 2: 0, 14: 0, 7: 1, 5: 2, 12: 1, 8: 1})\n for j in range(1, M): # (50): j=1 (53): j=2 ... (307): NO CHANGE\n if used[t[j]] == 1: # (51): used=defaultdict(, {9: 1, 6: 1, 2: 0}) (54): used=defaultdict(, {9: 1, 6: 1, 2: 0, 14: 0}) ... (305): NO CHANGE\n dp[i + 1][j + 1] = dp[i][j + 1] + dp[i + 1][j] # (67): dp (90): NO CHANGE ... (288): dp\n used[t[j]] = 2 # (68): used=defaultdict(, {9: 2, 6: 1, 2: 0, 14: 0, 7: 0, 5: 0}) (91): used=defaultdict(, {9: 2, 6: 1, 2: 0, 14: 0, 7: 0, 5: 2}) ... (289): used=defaultdict(, {9: 2, 6: 1, 2: 0, 14: 0, 7: 2, 5: 2, 12: 1, 8: 1})\n if s[i] == t[j]: # (69): NO CHANGE (92): NO CHANGE ... (290): NO CHANGE\n dp[i+1][j+1] += 1 # (93): dp (150): dp ... (291): dp\n else:\n dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]) # (52): NO CHANGE (55): NO CHANGE ... (306): dp\n \nprint((dp[N][M] + 1)%MOD)\n"], "anno_status": [false], "diff_content": "-from collections import defaultdict as dd\n-used = dd(int)\n-\n N, M = map(int, input().split())\n MOD = 10**9 + 7\n s = list(map(int, input().split()))\n t = list(map(int, input().split()))\n \n dp = [[0 for i in range(M+1)] for j in range(N+1)]\n for j in range(M):\n dp[1][j + 1] = dp[1][j] + 1 if s[0] == t[j] else dp[1][j]\n \n for i in range(N):\n dp[i + 1][1] = dp[i][1] + 1 if t[0] == s[i] else dp[i][1]\n \n-used[s[0]] = 1\n-if N > 1 and M > 1:\n- for i in range(1, N):\n- used[s[i]] = 1\n- for j in range(1, M):\n- if used[t[j]] == 1:\n- dp[i + 1][j + 1] = dp[i][j + 1] + dp[i + 1][j]\n- used[t[j]] = 2\n- if s[i] == t[j]:\n- dp[i+1][j+1] += 1\n- else:\n- dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j])\n+for i in range(1, N):\n+ for j in range(1, M):\n+ if s[i] == t[j]:\n+ dp[i + 1][j + 1] = (dp[i][j + 1] + dp[i + 1][j] + 1)%MOD\n+ else:\n+ dp[i + 1][j + 1] = (dp[i][j+1] + dp[i+1][j] - dp[i][j])%MOD\n \n print((dp[N][M] + 1)%MOD)\n \n", "FL_content": "\n from collections import defaultdict as dd\n used = dd(int)\n \n N, M = map(int, input().split())\n MOD = 10**9 + 7\n s = list(map(int, input().split()))\n t = list(map(int, input().split()))\n \n dp = [[0 for i in range(M+1)] for j in range(N+1)]\n for j in range(M):\n dp[1][j + 1] = dp[1][j] + 1 if s[0] == t[j] else dp[1][j]\n \n for i in range(N):\n dp[i + 1][1] = dp[i][1] + 1 if t[0] == s[i] else dp[i][1]\n \n used[s[0]] = 1\n if N > 1 and M > 1:\n for i in range(1, N):\n used[s[i]] = 1\n for j in range(1, M):\n if used[t[j]] == 1:\n dp[i + 1][j + 1] = dp[i][j + 1] + dp[i + 1][j]\n used[t[j]] = 2\n if s[i] == t[j]:\n dp[i+1][j+1] += 1\n else:\n dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j])\n \n-print((dp[N][M] + 1)%MOD)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 30 }, { "user_id": "u794173881", "problem_id": "p03313", "submission1_id": "s955219007-FL", "submission2_id": "s817713011", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def max2(a, b, c, d):\n vals = sorted((a, b, c, d), reverse=True)\n return vals[0], vals[1]\n\n\nn = int(input())\na = list(map(int, input().split()))\n\ndp = [[0] * (1 << n) for i in range(n + 1)]\ndq = [[0] * (1 << n) for i in range(n + 1)]\nfor i in range(1 << n):\n dp[0][i] = a[i]\n\nfor i in range(n):\n for bit_state in range(1 << n):\n if (1 << i) & bit_state:\n first, second = max2(dp[i][bit_state], dq[i][bit_state], dp[i][bit_state ^ (1 << i)], dq[i][bit_state ^ (1 << i)])\n else:\n first, second = dp[i][bit_state], dq[i][bit_state]\n dp[i + 1][bit_state], dq[i + 1][bit_state] = first, second\n \nfor i in range((1 << n) - 1):\n dp[-1][i + 1] = max(dp[-1][i + 1], dp[-1][i])\n dq[-1][i + 1] = max(dq[-1][i + 1], dq[-1][i])\n\n\n\nfor i in range(1, 1 << n):\n print(dp[-1][i] + dq[-1][i])", "code2": "def max2(a, b, c, d):\n vals = sorted((a, b, c, d), reverse=True)\n return vals[0], vals[1]\n\n\nn = int(input())\na = list(map(int, input().split()))\n\ndp = [[0] * (1 << n) for i in range(n + 1)]\ndq = [[0] * (1 << n) for i in range(n + 1)]\nfor i in range(1 << n):\n dp[0][i] = a[i]\n\nfor i in range(n):\n for bit_state in range(1 << n):\n if (1 << i) & bit_state:\n first, second = max2(dp[i][bit_state], dq[i][bit_state], dp[i][bit_state ^ (1 << i)], dq[i][bit_state ^ (1 << i)])\n else:\n first, second = dp[i][bit_state], dq[i][bit_state]\n dp[i + 1][bit_state], dq[i + 1][bit_state] = first, second\n\nans = 0\nfor i in range(1, 1 << n):\n ans = max(ans, dp[-1][i] + dq[-1][i])\n print(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589258327", "date2": "1589259073", "bleu_score": "0.84027833397205", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 53, "total_score": 103, "input": "4\n16 7 2 19 82 17 45 53 0 0 41 175 332 60 31 3\n", "actual_output": "23\n23\n35\n98\n99\n127\n135\n135\n135\n135\n228\n414\n414\n414\n507\n", "expected_output": "23\n23\n35\n98\n99\n127\n135\n135\n135\n135\n216\n414\n414\n414\n507\n\n", "anno_code": ["def max2(a, b, c, d): # (0): max2=\n vals = sorted((a, b, c, d), reverse=True) # (46): max2=, n=4, a=[16, 7, 2, 19, 82, 17, 45, 53, 0, 0, 41, 175, 332, 60, 31, 3], dp=[[16, 7, 2, 19, 82, 17, 45, 53, 0, 0, 41, 175, 332, 60, 31, 3], [16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], dq=[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], i=0, bit_state=1, first=16, second=7 (55): max2=, n=4, a=[16, 7, 2, 19, 82, 17, 45, 53, 0, 0, 41, 175, 332, 60, 31, 3], dp=[[16, 7, 2, 19, 82, 17, 45, 53, 0, 0, 41, 175, 332, 60, 31, 3], [16, 16, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], dq=[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 7, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], i=0, bit_state=3, first=19, second=2 ... (331): max2=, n=4, a=[16, 7, 2, 19, 82, 17, 45, 53, 0, 0, 41, 175, 332, 60, 31, 3], dp=[[16, 7, 2, 19, 82, 17, 45, 53, 0, 0, 41, 175, 332, 60, 31, 3], [16, 16, 2, 19, 82, 82, 45, 53, 0, 0, 41, 175, 332, 332, 31, 31], [16, 16, 16, 19, 82, 82, 82, 82, 0, 0, 41, 175, 332, 332, 332, 332], [16, 16, 16, 19, 82, 82, 82, 82, 0, 0, 41, 175, 332, 332, 332, 332], [16, 16, 16, 19, 82, 82, 82, 82, 16, 16, 41, 175, 332, 332, 332, 0]], dq, i=3, bit_state=15, first=332, second=175\n return vals[0], vals[1]\n\n\nn = int(input()) # (1): n=4\na = list(map(int, input().split())) # (2): a=[16, 7, 2, 19, 82, 17, 45, 53, 0, 0, 41, 175, 332, 60, 31, 3]\n\ndp = [[0] * (1 << n) for i in range(n + 1)] # (3): dp\ndq = [[0] * (1 << n) for i in range(n + 1)] # (4): dq\nfor i in range(1 << n): # (5): i=0 (7): i=1 ... (37): NO CHANGE\n dp[0][i] = a[i] # (6): dp (8): dp ... (36): dp\n\nfor i in range(n): # (38): i=0 (112): i=1 ... (334): NO CHANGE\n for bit_state in range(1 << n): # (39): bit_state=0 (43): bit_state=1 ... (333): NO CHANGE\n if (1 << i) & bit_state: # (40): NO CHANGE (44): NO CHANGE ... (329): NO CHANGE\n first, second = max2(dp[i][bit_state], dq[i][bit_state], dp[i][bit_state ^ (1 << i)], dq[i][bit_state ^ (1 << i)]) # (45): a=7, b=0, c=16, d=0 (54): a=19, b=0, c=2, d=0 ... (330): a=332, b=175, c=82, d=53\n else:\n first, second = dp[i][bit_state], dq[i][bit_state] # (41): first=16, second=0 (50): first=2, second=0 ... (291): second=53\n dp[i + 1][bit_state], dq[i + 1][bit_state] = first, second # (42): dp (47): dp, dq ... (332): dp=[[16, 7, 2, 19, 82, 17, 45, 53, 0, 0, 41, 175, 332, 60, 31, 3], [16, 16, 2, 19, 82, 82, 45, 53, 0, 0, 41, 175, 332, 332, 31, 31], [16, 16, 16, 19, 82, 82, 82, 82, 0, 0, 41, 175, 332, 332, 332, 332], [16, 16, 16, 19, 82, 82, 82, 82, 0, 0, 41, 175, 332, 332, 332, 332], [16, 16, 16, 19, 82, 82, 82, 82, 16, 16, 41, 175, 332, 332, 332, 332]], dq\n \nfor i in range((1 << n) - 1): # (335): i=0 (338): i=1 ... (380): NO CHANGE\n dp[-1][i + 1] = max(dp[-1][i + 1], dp[-1][i]) # (336): NO CHANGE (339): NO CHANGE ... (378): NO CHANGE\n dq[-1][i + 1] = max(dq[-1][i + 1], dq[-1][i]) # (337): NO CHANGE (340): dq ... (379): NO CHANGE\n\n\n\nfor i in range(1, 1 << n): # (381): i=1 (383): i=2 ... (409): i=15\n print(dp[-1][i] + dq[-1][i]) # (382): NO CHANGE (384): NO CHANGE ... (410): NO CHANGE\n"], "anno_status": [false], "diff_content": " def max2(a, b, c, d):\n vals = sorted((a, b, c, d), reverse=True)\n return vals[0], vals[1]\n \n \n n = int(input())\n a = list(map(int, input().split()))\n \n dp = [[0] * (1 << n) for i in range(n + 1)]\n dq = [[0] * (1 << n) for i in range(n + 1)]\n for i in range(1 << n):\n dp[0][i] = a[i]\n \n for i in range(n):\n for bit_state in range(1 << n):\n if (1 << i) & bit_state:\n first, second = max2(dp[i][bit_state], dq[i][bit_state], dp[i][bit_state ^ (1 << i)], dq[i][bit_state ^ (1 << i)])\n else:\n first, second = dp[i][bit_state], dq[i][bit_state]\n dp[i + 1][bit_state], dq[i + 1][bit_state] = first, second\n- \n-for i in range((1 << n) - 1):\n- dp[-1][i + 1] = max(dp[-1][i + 1], dp[-1][i])\n- dq[-1][i + 1] = max(dq[-1][i + 1], dq[-1][i])\n-\n-\n \n+ans = 0\n for i in range(1, 1 << n):\n- print(dp[-1][i] + dq[-1][i])\n+ ans = max(ans, dp[-1][i] + dq[-1][i])\n+ print(ans)\n", "FL_content": "\n def max2(a, b, c, d):\n vals = sorted((a, b, c, d), reverse=True)\n return vals[0], vals[1]\n \n \n n = int(input())\n a = list(map(int, input().split()))\n \n dp = [[0] * (1 << n) for i in range(n + 1)]\n dq = [[0] * (1 << n) for i in range(n + 1)]\n for i in range(1 << n):\n dp[0][i] = a[i]\n \n for i in range(n):\n for bit_state in range(1 << n):\n if (1 << i) & bit_state:\n- first, second = max2(dp[i][bit_state], dq[i][bit_state], dp[i][bit_state ^ (1 << i)], dq[i][bit_state ^ (1 << i)])\n else:\n first, second = dp[i][bit_state], dq[i][bit_state]\n dp[i + 1][bit_state], dq[i + 1][bit_state] = first, second\n \n for i in range((1 << n) - 1):\n dp[-1][i + 1] = max(dp[-1][i + 1], dp[-1][i])\n dq[-1][i + 1] = max(dq[-1][i + 1], dq[-1][i])\n \n \n \n for i in range(1, 1 << n):\n print(dp[-1][i] + dq[-1][i])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 29 }, { "user_id": "u068727970", "problem_id": "p03147", "submission1_id": "s455555736-FL", "submission2_id": "s600706209", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nh = list(map(int, input().split()))\ncounter = 0\nfin = [0 for _ in range(N)]\n\nwhile not h == fin:\n for i in range(1, N-1):\n if h[i] == 0 and not h[i-1] == 0:\n counter += 1\n counter += 1\n for i in range(N):\n if not h[i] == 0:\n h[i] -= 1\n\n\nprint(counter)\n", "code2": "N = int(input())\nh = [0] + list(map(int, input().split())) + [0]\ncounter = 0\nfin = [0 for _ in range(N+2)]\n\nwhile not h == fin:\n for i in range(1, N+2):\n if h[i] == 0 and not h[i-1] == 0:\n counter += 1\n for i in range(1, N+1):\n if not h[i] == 0:\n h[i] -= 1\n\n\nprint(counter)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587626184", "date2": "1587627449", "bleu_score": "0.9184526738947268", "code1_test_status": [0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 29, "total_score": 99, "input": "5\n1 1 6 3 1\n", "actual_output": "9\n", "expected_output": "6\n\n", "anno_code": ["N = int(input()) # (0): N=5\nh = list(map(int, input().split())) # (1): h=[1, 1, 6, 3, 1]\ncounter = 0 # (2): counter=0\nfin = [0 for _ in range(N)] # (3): fin=[0, 0, 0, 0, 0]\n\nwhile not h == fin: # (4): NO CHANGE (29): NO CHANGE ... (139): NO CHANGE\n for i in range(1, N-1): # (5): i=1 (7): i=2 ... (125): NO CHANGE\n if h[i] == 0 and not h[i-1] == 0: # (6): NO CHANGE (8): NO CHANGE ... (123): NO CHANGE\n counter += 1 # (80): counter=4 (102): counter=6 (124): counter=8\n counter += 1 # (12): counter=1 (37): counter=2 ... (126): counter=9\n for i in range(N): # (13): i=0 (16): i=1 ... (138): NO CHANGE\n if not h[i] == 0: # (14): NO CHANGE (17): NO CHANGE ... (137): NO CHANGE\n h[i] -= 1 # (15): h=[0, 1, 6, 3, 1] (18): h=[0, 0, 6, 3, 1] ... (133): h=[0, 0, 0, 0, 0]\n\n\nprint(counter)\n"], "anno_status": [true], "diff_content": " N = int(input())\n-h = list(map(int, input().split()))\n+h = [0] + list(map(int, input().split())) + [0]\n counter = 0\n-fin = [0 for _ in range(N)]\n+fin = [0 for _ in range(N+2)]\n \n while not h == fin:\n- for i in range(1, N-1):\n+ for i in range(1, N+2):\n if h[i] == 0 and not h[i-1] == 0:\n counter += 1\n- counter += 1\n- for i in range(N):\n+ for i in range(1, N+1):\n if not h[i] == 0:\n h[i] -= 1\n \n \n print(counter)\n \n", "FL_content": "\n N = int(input())\n h = list(map(int, input().split()))\n counter = 0\n fin = [0 for _ in range(N)]\n \n while not h == fin:\n- for i in range(1, N-1):\n- if h[i] == 0 and not h[i-1] == 0:\n- counter += 1\n- counter += 1\n for i in range(N):\n if not h[i] == 0:\n h[i] -= 1\n \n \n print(counter)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u809822290", "problem_id": "p02234", "submission1_id": "s322076625-FL", "submission2_id": "s685644631", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\np=[0 for i in range (101)]\nm=[[0 for i in range(100)]for i in range(100)]\n\ndef MatrixChain(n) : \n\tfor i in range(1,n+1) : m[i][i] = 0;\n\tfor l in range(2,n+1) :\n\t\tfor i in range(1,n-l+2) : \n\t\t\tj = i + l - 1\n\t\t\tm[i][j] = float('Infinity')\n\t\t\tfor k in range(i,j) :\n\t\t\t\tq = m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j]\n\t\t\t\tm[i][j] = m[i][j] if m[i][j] <= q else q\n\nn = int(input())\nfor i in range(n) :\n\tinput_num = input()\n\tinput_num = input_num.split(' ')\n\tp[i] = int(input_num[0][0])\n\tp[i+1] = int(input_num[1])\n\nMatrixChain(n)\nprint(m[1][n])", "code2": "import sys\n\np=[0 for i in range (101)]\nm=[[0 for i in range(100)]for i in range(100)]\n\ndef MatrixChain(n) : \n\tfor i in range(1,n+1) : m[i][i] = 0;\n\tfor l in range(2,n+1) :\n\t\tfor i in range(1,n-l+2) : \n\t\t\tj = i + l - 1\n\t\t\tm[i][j] = float('Infinity')\n\t\t\tfor k in range(i,j) :\n\t\t\t\tq = m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j]\n\t\t\t\tm[i][j] = m[i][j] if m[i][j] <= q else q\n\nn = int(input())\nfor i in range(n) :\n\tp[i], p[i+1] = map(int, input().split())\n\nMatrixChain(n)\nprint(m[1][n])", "original_language1": "Python3", "original_language2": "Python3", "date1": "1435760801", "date2": "1435762670", "bleu_score": "0.8376244030665717", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 70, "total_score": 101, "input": "6\n30 35\n35 15\n15 5\n5 10\n10 20\n20 25\n", "actual_output": "141\n", "expected_output": "15125\n", "anno_code": ["import sys\n\np=[0 for i in range (101)] # (0): p=[0, 0, ..., 0, 0]\nm=[[0 for i in range(100)]for i in range(100)] # (1): m\n\ndef MatrixChain(n) : # (2): MatrixChain=\n\tfor i in range(1,n+1) : m[i][i] = 0; # (36): i=1 (37): i=2 ... (42): NO CHANGE\n\tfor l in range(2,n+1) : # (43): l=2 (80): l=3 ... (218): sys=, p=[3, 3, 1, 5, 1, 2, 25, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], m, MatrixChain=, i=5, input_num=['20', '25']\n\t\tfor i in range(1,n-l+2) : # (44): i=1 (51): i=2 ... (217): NO CHANGE\n\t\t\tj = i + l - 1 # (45): j=2 (52): j=3 ... (199): NO CHANGE\n\t\t\tm[i][j] = float('Infinity') # (46): NO CHANGE (53): NO CHANGE ... (200): NO CHANGE\n\t\t\tfor k in range(i,j) : # (47): k=1 (50): NO CHANGE ... (216): NO CHANGE\n\t\t\t\tq = m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j] # (48): q=9 (55): q=15 ... (214): q=172\n\t\t\t\tm[i][j] = m[i][j] if m[i][j] <= q else q # (49): NO CHANGE (56): NO CHANGE ... (215): NO CHANGE\n\nn = int(input()) # (3): n=6\nfor i in range(n) : # (4): i=0 (9): i=1 ... (34): NO CHANGE\n\tinput_num = input() # (5): input_num=30 35 (10): input_num=35 15 ... (30): input_num=20 25\n\tinput_num = input_num.split(' ') # (6): input_num=['30', '35'] (11): input_num=['35', '15'] ... (31): input_num=['20', '25']\n\tp[i] = int(input_num[0][0]) # (7): p=[3, 0, ..., 0, 0] (12): p=[3, 3, ..., 0, 0] ... (32): p=[3, 3, ..., 0, 0]\n\tp[i+1] = int(input_num[1]) # (8): p=[3, 35, ..., 0, 0] (13): p=[3, 3, ..., 0, 0] ... (33): p=[3, 3, ..., 0, 0]\n\nMatrixChain(n) # (35): NO CHANGE\nprint(m[1][n])"], "anno_status": [false], "diff_content": " import sys\n \n p=[0 for i in range (101)]\n m=[[0 for i in range(100)]for i in range(100)]\n \n def MatrixChain(n) : \n \tfor i in range(1,n+1) : m[i][i] = 0;\n \tfor l in range(2,n+1) :\n \t\tfor i in range(1,n-l+2) : \n \t\t\tj = i + l - 1\n \t\t\tm[i][j] = float('Infinity')\n \t\t\tfor k in range(i,j) :\n \t\t\t\tq = m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j]\n \t\t\t\tm[i][j] = m[i][j] if m[i][j] <= q else q\n \n n = int(input())\n for i in range(n) :\n-\tinput_num = input()\n-\tinput_num = input_num.split(' ')\n-\tp[i] = int(input_num[0][0])\n-\tp[i+1] = int(input_num[1])\n+\tp[i], p[i+1] = map(int, input().split())\n \n MatrixChain(n)\n print(m[1][n])\n", "FL_content": "\n import sys\n \n p=[0 for i in range (101)]\n m=[[0 for i in range(100)]for i in range(100)]\n \n def MatrixChain(n) : \n \tfor i in range(1,n+1) : m[i][i] = 0;\n \tfor l in range(2,n+1) :\n \t\tfor i in range(1,n-l+2) : \n \t\t\tj = i + l - 1\n \t\t\tm[i][j] = float('Infinity')\n \t\t\tfor k in range(i,j) :\n-\t\t\t\tq = m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j]\n \t\t\t\tm[i][j] = m[i][j] if m[i][j] <= q else q\n \n n = int(input())\n for i in range(n) :\n \tinput_num = input()\n \tinput_num = input_num.split(' ')\n \tp[i] = int(input_num[0][0])\n \tp[i+1] = int(input_num[1])\n \n MatrixChain(n)\n print(m[1][n])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u022407960", "problem_id": "p02300", "submission1_id": "s518188540-FL", "submission2_id": "s230011031", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n lower.reverse()\n lower.sort(key=attrgetter('imag', 'real'))\n\n for m in range(len(lower) - 1):\n if lower[m].imag == lower[m + 1].imag and lower[m].real < lower[m + 1].real:\n lower[m], lower[m + 1] = lower[m + 1], lower[m]\n\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "code2": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.reverse()\n \n lower_min = min(lower, key=attrgetter('imag', 'real'))\n \n min_index = lower.index(lower_min)\n lower_right = lower[min_index:]\n lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n lower_right.append(upper[k])\n return lower_right + lower_left\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1480730925", "date2": "1480734264", "bleu_score": "0.9347884087679083", "code1_test_status": [0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1], "code1_test_score": 21, "total_score": 102, "input": "7\n4 1\n0 0\n1 2\n2 0\n4 2\n1 3\n3 4\n", "actual_output": "6\n2 0\n0 0\n4 1\n4 2\n3 4\n1 3\n", "expected_output": "6\n0 0\n2 0\n4 1\n4 2\n3 4\n1 3\n\n", "anno_code": ["\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9 # (0): EPS=1e-09\n\n\ndef cross(a, b): # (1): cross=\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b): # (2): dot=\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2): # (3): check_ccw=\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon): # (4): convex_check_Andrew=\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n lower.reverse()\n lower.sort(key=attrgetter('imag', 'real'))\n\n for m in range(len(lower) - 1):\n if lower[m].imag == lower[m + 1].imag and lower[m].real < lower[m + 1].real:\n lower[m], lower[m + 1] = lower[m + 1], lower[m]\n\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))"], "anno_status": [false], "diff_content": " \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n+ \n lower.reverse()\n- lower.sort(key=attrgetter('imag', 'real'))\n-\n- for m in range(len(lower) - 1):\n- if lower[m].imag == lower[m + 1].imag and lower[m].real < lower[m + 1].real:\n- lower[m], lower[m + 1] = lower[m + 1], lower[m]\n-\n+ \n+ lower_min = min(lower, key=attrgetter('imag', 'real'))\n+ \n+ min_index = lower.index(lower_min)\n+ lower_right = lower[min_index:]\n+ lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n- lower.append(upper[k])\n-\n- return lower\n+ lower_right.append(upper[k])\n+ return lower_right + lower_left\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "FL_content": "\n \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n- elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n lower.reverse()\n lower.sort(key=attrgetter('imag', 'real'))\n \n for m in range(len(lower) - 1):\n if lower[m].imag == lower[m + 1].imag and lower[m].real < lower[m + 1].real:\n lower[m], lower[m + 1] = lower[m + 1], lower[m]\n \n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n \n return lower\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 83 }, { "user_id": "u391228754", "problem_id": "p02415", "submission1_id": "s527093047-FL", "submission2_id": "s174939479", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = input()\na.swapcase()\nprint(a)", "code2": "print(input().swapcase())", "original_language1": "Python3", "original_language2": "Python3", "date1": "1475572024", "date2": "1475572317", "bleu_score": "0.6002485102728093", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "R?g,H GQKT-@ AKK@YOISOCBN BPWUDK/\n", "actual_output": "R?g,H GQKT-@ AKK@YOISOCBN BPWUDK/\n", "expected_output": "r?G,h gqkt-@ akk@yoisocbn bpwudk/\n\n", "anno_code": ["a = input() # (0): a=R?g,H GQKT-@ AKK@YOISOCBN BPWUDK/\na.swapcase() # (1): NO CHANGE\nprint(a)"], "anno_status": [true], "diff_content": "-a = input()\n-a.swapcase()\n-print(a)\n+print(input().swapcase())\n", "FL_content": "\n a = input()\n-a.swapcase()\n print(a)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 3 }, { "user_id": "u263753244", "problem_id": "p03617", "submission1_id": "s707525454-FL", "submission2_id": "s028435468", "status1": "Wrong Answer", "status2": "Accepted", "code1": "q,h,s,d=map(int,input().split())\nn=int(input())\n\nl=min(q*n*8,h*n*4,s*n*2,d*n)\nif l != d*n:\n print(int(l/2))\nelse:\n m=min(q*4,h*2,s)\n print(int((d*(n-1)/2)+m) if n%2==1 else int(l/2))", "code2": "q,h,s,d=map(int,input().split())\nn=int(input())\nl=min(q*n*4,h*n*2,s*n,d*n\nif l != d*n\n print(l)\nelse:\n m=min(q*4,h*2,s)\n print(int((d*(n-1)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586124603", "date2": "1586143064", "bleu_score": "0.7045773535312374", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 80, "total_score": 104, "input": "11100 0010 111 -2\n-1\n", "actual_output": "-44400\n", "expected_output": "22\n\n", "anno_code": ["q,h,s,d=map(int,input().split()) # (0): q=11100, h=10, s=111, d=-2\nn=int(input()) # (1): n=-1\n\nl=min(q*n*8,h*n*4,s*n*2,d*n) # (2): l=-88800\nif l != d*n: # (3): NO CHANGE\n print(int(l/2))\nelse:\n m=min(q*4,h*2,s)\n print(int((d*(n-1)/2)+m) if n%2==1 else int(l/2))"], "anno_status": [true], "diff_content": " q,h,s,d=map(int,input().split())\n n=int(input())\n-\n-l=min(q*n*8,h*n*4,s*n*2,d*n)\n-if l != d*n:\n- print(int(l/2))\n+l=min(q*n*4,h*n*2,s*n,d*n\n+if l != d*n\n+ print(l)\n else:\n m=min(q*4,h*2,s)\n- print(int((d*(n-1)/2)+m) if n%2==1 else int(l/2))\n+ print(int((d*(n-1)\n", "FL_content": "\n q,h,s,d=map(int,input().split())\n n=int(input())\n \n l=min(q*n*8,h*n*4,s*n*2,d*n)\n if l != d*n:\n print(int(l/2))\n else:\n- m=min(q*4,h*2,s)\n- print(int((d*(n-1)/2)+m) if n%2==1 else int(l/2))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u532966492", "problem_id": "p03880", "submission1_id": "s701456298-FL", "submission2_id": "s441252003", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n n = int(input())\n a = [int(input()) for _ in [0]*n]\n m = max(a)\n xor = 0\n for i in a:\n xor ^= i\n i = 1\n cnt = 0\n while True:\n if xor >= i:\n i *= 2\n cnt += 1\n else:\n break\n ans = 0\n for i in range(cnt-1, -1, -1):\n j = (xor & 2**i) \n if j == 1:\n for k in a:\n if k % (2**i) == 0:\n xor ^= k\n xor ^= k-1\n ans += 1\n a.remove(k)\n break\n else:\n print(-1)\n return 0\n print(ans)\n\n\nmain()", "code2": "def main():\n n = int(input())\n a = [int(input()) for _ in [0]*n]\n xor = 0\n for i in a:\n xor ^= i\n i = 1\n cnt = 0\n while True:\n if xor >= i:\n i *= 2\n cnt += 1\n else:\n break\n ans = 0\n for i in range(cnt-1, -1, -1):\n j = (xor & 2**i) \n if j == 1:\n for k in a:\n if (k & 2**i) \n xor ^= k\n xor ^= k-1\n ans += 1\n a.remove(k)\n break\n else:\n print(-1)\n return 0\n print(ans)\n\n\nmain()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576893133", "date2": "1576896212", "bleu_score": "0.9588969878118355", "code1_test_status": [0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0], "code1_test_score": 21, "total_score": 89, "input": "3\n3\n3\n3\n", "actual_output": "1\n", "expected_output": "-1\n\n", "anno_code": ["def main(): # (0): main=\n n = int(input()) # (2): n=3\n a = [int(input()) for _ in [0]*n] # (3): a=[3, 3, 3]\n m = max(a) # (4): m=3\n xor = 0 # (5): xor=0\n for i in a: # (6): i=3 (8): NO CHANGE ... (12): NO CHANGE\n xor ^= i # (7): xor=3 (9): xor=0 (11): xor=3\n i = 1 # (13): i=1\n cnt = 0 # (14): cnt=0\n while True: # (15): NO CHANGE (19): NO CHANGE (23): NO CHANGE\n if xor >= i: # (16): NO CHANGE (20): NO CHANGE (24): NO CHANGE\n i *= 2 # (17): i=2 (21): i=4\n cnt += 1 # (18): cnt=1 (22): cnt=2\n else:\n break # (25): NO CHANGE\n ans = 0 # (26): ans=0\n for i in range(cnt-1, -1, -1): # (27): i=1 (30): i=0 (40): NO CHANGE\n j = (xor & 2**i) # (28): j=2 (31): j=1\n if j == 1: # (29): NO CHANGE (32): NO CHANGE\n for k in a: # (33): k=3\n if k % (2**i) == 0: # (34): NO CHANGE\n xor ^= k # (35): xor=0\n xor ^= k-1 # (36): xor=2\n ans += 1 # (37): ans=1\n a.remove(k) # (38): a=[3, 3]\n break # (39): NO CHANGE\n else:\n print(-1)\n return 0\n print(ans)\n\n\nmain() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " def main():\n n = int(input())\n a = [int(input()) for _ in [0]*n]\n- m = max(a)\n xor = 0\n for i in a:\n xor ^= i\n i = 1\n cnt = 0\n while True:\n if xor >= i:\n i *= 2\n cnt += 1\n else:\n break\n ans = 0\n for i in range(cnt-1, -1, -1):\n j = (xor & 2**i) \n if j == 1:\n for k in a:\n- if k % (2**i) == 0:\n+ if (k & 2**i) \n xor ^= k\n xor ^= k-1\n ans += 1\n a.remove(k)\n break\n else:\n print(-1)\n return 0\n print(ans)\n \n \n main()\n", "FL_content": "\n def main():\n n = int(input())\n a = [int(input()) for _ in [0]*n]\n m = max(a)\n xor = 0\n for i in a:\n xor ^= i\n i = 1\n cnt = 0\n while True:\n if xor >= i:\n i *= 2\n cnt += 1\n else:\n break\n ans = 0\n for i in range(cnt-1, -1, -1):\n j = (xor & 2**i) \n if j == 1:\n for k in a:\n if k % (2**i) == 0:\n xor ^= k\n xor ^= k-1\n ans += 1\n a.remove(k)\n break\n else:\n print(-1)\n return 0\n print(ans)\n \n \n main()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 33 }, { "user_id": "u319612498", "problem_id": "p03353", "submission1_id": "s967239549-FL", "submission2_id": "s183272479", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nt=list(s)\nu=sorted(list(set(t)))\nans=[]\nfor i in range(len(u)):\n ans.append(u[i])\nk=int(input())\nfor j in range(1,min(5,len(t))):\n for i in range(len(t)-j):\n ans.append(s[i:i+j+1])\nans=sorted(ans)\nprint(ans[k-1])", "code2": "s=input()\nt=list(s)\nu=sorted(list(set(t)))\nans=[]\nfor i in range(len(u)):\n ans.append(u[i])\nk=int(input())\nfor j in range(1,min(10,len(t))):\n for i in range(len(t)-j):\n ans.append(s[i:i+j+1])\nans=sorted(list(set(ans)))\nprint(ans[k-1])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1526176568", "date2": "1526176841", "bleu_score": "0.9285913010712552", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 100, "total_score": 103, "input": "roddadtadmboefectr\n4\n", "actual_output": "adm\n", "expected_output": "admb\n\n", "anno_code": ["s=input() # (0): s=roddadtadmboefectr\nt=list(s) # (1): t=['r', 'o', 'd', 'd', 'a', 'd', 't', 'a', 'd', 'm', 'b', 'o', 'e', 'f', 'e', 'c', 't', 'r']\nu=sorted(list(set(t))) # (2): u=['a', 'b', 'c', 'd', 'e', 'f', 'm', 'o', 'r', 't']\nans=[] # (3): ans=[]\nfor i in range(len(u)): # (4): i=0 (6): i=1 ... (24): NO CHANGE\n ans.append(u[i]) # (5): ans=['a'] (7): ans=['a', 'b'] ... (23): ans=['a', 'b', 'c', 'd', 'e', 'f', 'm', 'o', 'r', 't']\nk=int(input()) # (25): k=4\nfor j in range(1,min(5,len(t))): # (26): j=1 (62): j=2 ... (158): NO CHANGE\n for i in range(len(t)-j): # (27): i=0 (29): i=1 ... (157): NO CHANGE\n ans.append(s[i:i+j+1]) # (28): ans=['a', 'b', 'c', 'd', 'e', 'f', 'm', 'o', 'r', 't', 'ro'] (30): ans=['a', 'b', 'c', 'd', 'e', 'f', 'm', 'o', 'r', 't', 'ro', 'od'] ... (156): ans=[a, b, ..., efect, fectr]\nans=sorted(ans) # (159): ans=[a, ad, ..., tadmb, tr]\nprint(ans[k-1])"], "anno_status": [true], "diff_content": " s=input()\n t=list(s)\n u=sorted(list(set(t)))\n ans=[]\n for i in range(len(u)):\n ans.append(u[i])\n k=int(input())\n-for j in range(1,min(5,len(t))):\n+for j in range(1,min(10,len(t))):\n for i in range(len(t)-j):\n ans.append(s[i:i+j+1])\n-ans=sorted(ans)\n+ans=sorted(list(set(ans)))\n print(ans[k-1])\n+\n", "FL_content": "\n s=input()\n t=list(s)\n u=sorted(list(set(t)))\n ans=[]\n for i in range(len(u)):\n ans.append(u[i])\n k=int(input())\n-for j in range(1,min(5,len(t))):\n for i in range(len(t)-j):\n ans.append(s[i:i+j+1])\n ans=sorted(ans)\n print(ans[k-1])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u539953365", "problem_id": "p02555", "submission1_id": "s111268184-FL", "submission2_id": "s241210603", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import comb\nmod = 10**9 + 7\ns = 1729\nans = 0\nn = 1\nwhile s - 2*n - 1 >= 0:\n ans += comb(s-2*n-1, n-1)\n ans %= mod\n n += 1\nprint(ans)", "code2": "from math import comb\nmod = 10**9 + 7\ns = int(input())\nans = 0\nn = 1\nwhile s - 2*n - 1 >= 0:\n ans += comb(s-2*n-1, n-1)\n ans %= mod\n n += 1\nprint(ans)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600028600", "date2": "1600028706", "bleu_score": "0.9084304021611308", "code1_test_status": [0, 1], "code1_test_score": 1, "total_score": 2, "input": "1175\n", "actual_output": "294867501\n", "expected_output": "531468532\n\n", "anno_code": ["from math import comb\nmod = 10**9 + 7 # (0): mod=1000000007\ns = 1729 # (1): s=1729\nans = 0 # (2): ans=0\nn = 1 # (3): n=1\nwhile s - 2*n - 1 >= 0: # (4): NO CHANGE (8): NO CHANGE ... (3460): NO CHANGE\n ans += comb(s-2*n-1, n-1) # (5): ans=1 (9): ans=1725 ... (3457): NO CHANGE\n ans %= mod # (6): NO CHANGE (10): NO CHANGE ... (3458): NO CHANGE\n n += 1 # (7): n=2 (11): n=3 ... (3459): n=865\nprint(ans)"], "anno_status": [true], "diff_content": " from math import comb\n mod = 10**9 + 7\n-s = 1729\n+s = int(input())\n ans = 0\n n = 1\n while s - 2*n - 1 >= 0:\n ans += comb(s-2*n-1, n-1)\n ans %= mod\n n += 1\n print(ans)\n+\n", "FL_content": "\n from math import comb\n mod = 10**9 + 7\n-s = 1729\n ans = 0\n n = 1\n while s - 2*n - 1 >= 0:\n ans += comb(s-2*n-1, n-1)\n ans %= mod\n n += 1\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u961683878", "problem_id": "p03297", "submission1_id": "s681510378-FL", "submission2_id": "s423997668", "status1": "Wrong Answer", "status2": "Accepted", "code1": "T = int(input())\na = []\nfor i in range(T):\n a.append(list(map(int, input().split())))\nfor r in a:\n s, b, c, d = r[0], r[1], r[2], r[3]\n s_list = []\n while True:\n if (s < b) or (b>d):\n print('No')\n break\n if (c>s):\n print('Yes')\n s = s%b\n s_list.append(s)\n if c < s < b:\n print('No')\n break\n\n s = s+d\n if s in s_list:\n print('Yes')\n break\n s_list.append(s)\n", "code2": "def gcd(a, b):\n\twhile b:\n\t\ta, b = b, a % b\n\treturn a\n\n\nT = int(input())\na = []\nfor i in range(T):\n a.append(list(map(int, input().split())))\nfor r in a:\n s, b, c, d = r[0], r[1], r[2], r[3]\n mod_list = []\n if (s < b) or (b>d):\n print('No')\n continue\n if (c>b):\n print('Yes')\n continue\n\n g = gcd(b,d)\n\n if b- g + s%g > c:\n print('No')\n else:\n print('Yes')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531625397", "date2": "1531627608", "bleu_score": "0.6478049716582922", "code1_test_status": [0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1], "code1_test_score": 37, "total_score": 102, "input": "14\n7 7 5 9\n9 7 4 9\n14 3 7 12\n14 10 15 12\n14 10 9 12\n3 11 7 9\n14 10 8 11\n14 10 9 11\n10 10 3 10\n10 13 6 10\n11 10 5 10\n16 10 5 10\n1000010000100000000 17 5 1378844900267354047\n1000000000000000000 16 15 1358327919252224189\n", "actual_output": "No\nNo\nYes\nYes\nYes\nYes\nYes\nYes\nNo\nNo\nYes\nYes\nNo\nYes\nNo\nNo\nYes\n", "expected_output": "No\nNo\nYes\nYes\nYes\nNo\nNo\nYes\nYes\nNo\nYes\nNo\nNo\nYes\n\n", "anno_code": ["T = int(input()) # (0): T=14\na = [] # (1): a=[]\nfor i in range(T): # (2): i=0 (4): i=1 ... (30): NO CHANGE\n a.append(list(map(int, input().split()))) # (3): a (5): a ... (29): a\nfor r in a: # (31): r=[7, 7, 5, 9] (69): r=[9, 7, 4, 9] ... (478): r=[1000000000000000000, 16, 15, 1358327919252224189]\n s, b, c, d = r[0], r[1], r[2], r[3] # (32): s=7, b=7, c=5, d=9 (70): s=9, c=4 ... (479): s=1000000000000000000, b=16, c=15, d=1358327919252224189\n s_list = [] # (33): s_list=[] (71): s_list=[] ... (480): s_list=[]\n while True: # (34): NO CHANGE (43): NO CHANGE ... (625): NO CHANGE\n if (s < b) or (b>d): # (35): NO CHANGE (44): NO CHANGE ... (626): NO CHANGE\n print('No') # (244): NO CHANGE (432): NO CHANGE\n break # (245): NO CHANGE (433): NO CHANGE\n if (c>s): # (36): NO CHANGE (45): NO CHANGE ... (627): NO CHANGE\n print('Yes') # (126): NO CHANGE (163): NO CHANGE (173): NO CHANGE\n s = s%b # (37): s=0 (46): s=2 ... (628): s=0\n s_list.append(s) # (38): s_list=[0] (47): s_list=[0, 9, 2] ... (629): s_list=[0, 1358327919252224189, ..., 1358327919252224192, 0]\n if c < s < b: # (39): NO CHANGE (48): NO CHANGE ... (630): NO CHANGE\n print('No') # (67): NO CHANGE (96): NO CHANGE ... (476): NO CHANGE\n break # (68): NO CHANGE (97): NO CHANGE ... (477): NO CHANGE\n\n s = s+d # (40): s=9 (49): s=11 ... (631): s=1358327919252224189\n if s in s_list: # (41): NO CHANGE (50): NO CHANGE ... (632): NO CHANGE\n print('Yes') # (118): NO CHANGE (179): NO CHANGE ... (633): NO CHANGE\n break # (119): NO CHANGE (180): NO CHANGE ... (634): NO CHANGE\n s_list.append(s) # (42): s_list=[0, 9] (51): s_list=[0, 9, 2, 11] ... (624): s_list=[0, 1358327919252224189, ..., 3, 1358327919252224192]\n"], "anno_status": [false], "diff_content": "+def gcd(a, b):\n+\twhile b:\n+\t\ta, b = b, a % b\n+\treturn a\n+\n+\n T = int(input())\n a = []\n for i in range(T):\n a.append(list(map(int, input().split())))\n for r in a:\n s, b, c, d = r[0], r[1], r[2], r[3]\n- s_list = []\n- while True:\n- if (s < b) or (b>d):\n- print('No')\n- break\n- if (c>s):\n- print('Yes')\n- s = s%b\n- s_list.append(s)\n- if c < s < b:\n- print('No')\n- break\n+ mod_list = []\n+ if (s < b) or (b>d):\n+ print('No')\n+ continue\n+ if (c>b):\n+ print('Yes')\n+ continue\n \n- s = s+d\n- if s in s_list:\n- print('Yes')\n- break\n- s_list.append(s)\n+ g = gcd(b,d)\n \n+ if b- g + s%g > c:\n+ print('No')\n+ else:\n+ print('Yes')\n", "FL_content": "\n T = int(input())\n a = []\n for i in range(T):\n a.append(list(map(int, input().split())))\n for r in a:\n s, b, c, d = r[0], r[1], r[2], r[3]\n s_list = []\n while True:\n if (s < b) or (b>d):\n print('No')\n break\n- if (c>s):\n print('Yes')\n s = s%b\n s_list.append(s)\n if c < s < b:\n print('No')\n break\n \n s = s+d\n if s in s_list:\n print('Yes')\n break\n s_list.append(s)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 25 }, { "user_id": "u651803486", "problem_id": "p02975", "submission1_id": "s414188731-FL", "submission2_id": "s441361297", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\n\nN = int(input())\nA = list(map(int, input().split()))\n\ndic = defaultdict(int)\n\n\n\nif N % 3 == 0:\n \n for a in A:\n dic[a] += 1\n\n n_kind = len(dic.keys())\n values = list(dic.keys())\n cnts = list(dic.values())\n \n \n if n_kind == 3:\n \n is_xor = False\n for i in range(n_kind-2):\n for j in range(i+1, n_kind-1):\n for k in range(j+1, n_kind):\n if values[i] ^ values[j] ^ values[k] == 0:\n is_xor = True\n\n \n \n is_n_valid = True\n for cnt in cnts:\n if cnt != N/3:\n is_n_valid = False\n\n \n if is_xor and is_n_valid:\n print('Yes')\n else:\n print('No')\n \n elif n_kind == 2:\n \n \n is_in_zero = True\n if 0 in values:\n is_in_zero = False\n\n is_n_valid = True\n if is_in_zero:\n for k, v in dic.items():\n if k == 0:\n if v != N/3:\n is_n_valid = False\n else:\n if v != N * (2/3):\n is_n_valid = False\n\n if is_n_valid:\n print('Yes')\n else:\n print('No')\n\n\n elif n_kind == 1:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n\n if all_zero:\n print('Yes')\n else:\n print('No') \n\n else:\n print('No')\n\nelse:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n\n if all_zero:\n print('Yes')\n else:\n print('No')\n ", "code2": "from collections import defaultdict\n\nN = int(input())\nA = list(map(int, input().split()))\n\ndic = defaultdict(int)\n\n\n\nif N % 3 == 0:\n \n for a in A:\n dic[a] += 1\n\n n_kind = len(dic.keys())\n values = list(dic.keys())\n cnts = list(dic.values())\n \n \n if n_kind == 3:\n is_xor = False \n \n for i in range(n_kind-2):\n for j in range(i+1, n_kind-1):\n for k in range(j+1, n_kind):\n if values[i] ^ values[j] ^ values[k] == 0:\n is_xor = True\n\n \n \n is_n_valid = True\n for cnt in cnts:\n if cnt != N/3:\n is_n_valid = False\n\n \n if is_xor and is_n_valid:\n print('Yes')\n else:\n print('No')\n \n elif n_kind == 2:\n \n \n is_n_valid = True\n if 0 in values:\n for k, v in dic.items():\n if k == 0:\n if v != N/3:\n is_n_valid = False\n else:\n if v != N * (2/3):\n is_n_valid = False\n else:\n is_n_valid = False\n\n if is_n_valid:\n print('Yes')\n else:\n print('No')\n\n\n elif n_kind == 1:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n\n if all_zero:\n print('Yes')\n else:\n print('No') \n\n else:\n print('No')\n\n\nelse:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n\n if all_zero:\n print('Yes')\n else:\n print('No')\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563494122", "date2": "1563494529", "bleu_score": "0.9748123962286582", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 57, "total_score": 58, "input": "3\n0 25 0\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["from collections import defaultdict\n\nN = int(input()) # (0): N=3\nA = list(map(int, input().split())) # (1): A=[0, 25, 0]\n\ndic = defaultdict(int) # (2): dic=defaultdict(, {})\n\n\n\nif N % 3 == 0: # (3): NO CHANGE\n \n for a in A: # (4): a=0 (6): a=25 ... (10): NO CHANGE\n dic[a] += 1 # (5): dic=defaultdict(, {0: 1}) (7): dic=defaultdict(, {0: 1, 25: 1}) (9): dic=defaultdict(, {0: 2, 25: 1})\n\n n_kind = len(dic.keys()) # (11): n_kind=2\n values = list(dic.keys()) # (12): values=[0, 25]\n cnts = list(dic.values()) # (13): cnts=[2, 1]\n \n \n if n_kind == 3: # (14): NO CHANGE\n \n is_xor = False\n for i in range(n_kind-2):\n for j in range(i+1, n_kind-1):\n for k in range(j+1, n_kind):\n if values[i] ^ values[j] ^ values[k] == 0:\n is_xor = True\n\n \n \n is_n_valid = True\n for cnt in cnts:\n if cnt != N/3:\n is_n_valid = False\n\n \n if is_xor and is_n_valid:\n print('Yes')\n else:\n print('No')\n \n elif n_kind == 2: # (15): NO CHANGE\n \n \n is_in_zero = True # (16): is_in_zero=True\n if 0 in values: # (17): NO CHANGE\n is_in_zero = False # (18): is_in_zero=False\n\n is_n_valid = True # (19): is_n_valid=True\n if is_in_zero: # (20): NO CHANGE\n for k, v in dic.items():\n if k == 0:\n if v != N/3:\n is_n_valid = False\n else:\n if v != N * (2/3):\n is_n_valid = False\n\n if is_n_valid: # (21): NO CHANGE\n print('Yes')\n else:\n print('No')\n\n\n elif n_kind == 1:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n\n if all_zero:\n print('Yes')\n else:\n print('No') \n\n else:\n print('No')\n\nelse:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n\n if all_zero:\n print('Yes')\n else:\n print('No')\n "], "anno_status": [false], "diff_content": " from collections import defaultdict\n \n N = int(input())\n A = list(map(int, input().split()))\n \n dic = defaultdict(int)\n \n \n \n if N % 3 == 0:\n \n for a in A:\n dic[a] += 1\n \n n_kind = len(dic.keys())\n values = list(dic.keys())\n cnts = list(dic.values())\n- \n+ \n \n if n_kind == 3:\n+ is_xor = False \n \n- is_xor = False\n for i in range(n_kind-2):\n for j in range(i+1, n_kind-1):\n for k in range(j+1, n_kind):\n if values[i] ^ values[j] ^ values[k] == 0:\n is_xor = True\n \n \n \n is_n_valid = True\n for cnt in cnts:\n if cnt != N/3:\n is_n_valid = False\n \n \n if is_xor and is_n_valid:\n print('Yes')\n else:\n print('No')\n \n elif n_kind == 2:\n \n \n- is_in_zero = True\n- if 0 in values:\n- is_in_zero = False\n-\n is_n_valid = True\n- if is_in_zero:\n+ if 0 in values:\n for k, v in dic.items():\n if k == 0:\n if v != N/3:\n is_n_valid = False\n else:\n if v != N * (2/3):\n is_n_valid = False\n+ else:\n+ is_n_valid = False\n \n if is_n_valid:\n print('Yes')\n else:\n print('No')\n \n \n elif n_kind == 1:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n \n if all_zero:\n print('Yes')\n else:\n print('No') \n \n else:\n print('No')\n \n+\n else:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n \n if all_zero:\n print('Yes')\n else:\n print('No')\n \n", "FL_content": "\n from collections import defaultdict\n \n N = int(input())\n A = list(map(int, input().split()))\n \n dic = defaultdict(int)\n \n \n \n if N % 3 == 0:\n \n for a in A:\n dic[a] += 1\n \n n_kind = len(dic.keys())\n values = list(dic.keys())\n cnts = list(dic.values())\n \n \n if n_kind == 3:\n \n is_xor = False\n for i in range(n_kind-2):\n for j in range(i+1, n_kind-1):\n for k in range(j+1, n_kind):\n if values[i] ^ values[j] ^ values[k] == 0:\n is_xor = True\n \n \n \n is_n_valid = True\n for cnt in cnts:\n if cnt != N/3:\n is_n_valid = False\n \n \n if is_xor and is_n_valid:\n print('Yes')\n else:\n print('No')\n \n elif n_kind == 2:\n \n \n is_in_zero = True\n if 0 in values:\n is_in_zero = False\n \n is_n_valid = True\n if is_in_zero:\n for k, v in dic.items():\n if k == 0:\n if v != N/3:\n is_n_valid = False\n else:\n if v != N * (2/3):\n is_n_valid = False\n \n if is_n_valid:\n print('Yes')\n else:\n print('No')\n \n \n \n elif n_kind == 1:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n \n if all_zero:\n print('Yes')\n else:\n print('No')\n \n \n else:\n print('No')\n \n else:\n all_zero = True\n for a in A:\n if a != 0:\n all_zero = False\n \n if all_zero:\n print('Yes')\n else:\n print('No')\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 89 }, { "user_id": "u426108351", "problem_id": "p03856", "submission1_id": "s351418852-FL", "submission2_id": "s062849386", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(input())\ns.reverse()\ns = ''.join(map(str, s))\ncount = 0\nword = ['maerd', 'remaerd', 'resare', 'esare']\n\nwhile count <= len(s)-8:\n counttemp = count\n for i in range(4):\n w = word[i]\n if s[count:count+len(w)] == w:\n count += len(w)\n if counttemp == count:\n break\nif s[count:] in word:\n print('YES')\nelse:\n print('NO')\n \n", "code2": "s = list(input())\ns.reverse()\ns = ''.join(map(str, s))\ncount = 0\nword = ['maerd', 'remaerd', 'resare', 'esare']\n\nwhile count <= len(s)-8:\n counttemp = count\n for i in range(4):\n w = word[i]\n if s[count:count+len(w)] == w:\n count += len(w)\n if counttemp == count:\n break\n\nif s[count:] in word or s[count:] =='':\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564100331", "date2": "1564100504", "bleu_score": "0.943752597231175", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "NO\n", "expected_output": "YES\n", "anno_code": ["s = list(input()) # (0): s=['e', 'r', 'a', 's', 'e', 'd', 'r', 'e', 'a', 'm']\ns.reverse() # (1): s=['m', 'a', 'e', 'r', 'd', 'e', 's', 'a', 'r', 'e']\ns = ''.join(map(str, s)) # (2): s=maerdesare\ncount = 0 # (3): count=0\nword = ['maerd', 'remaerd', 'resare', 'esare'] # (4): word=['maerd', 'remaerd', 'resare', 'esare']\n\nwhile count <= len(s)-8: # (5): NO CHANGE (23): NO CHANGE\n counttemp = count # (6): counttemp=0\n for i in range(4): # (7): i=0 (11): i=1 ... (21): NO CHANGE\n w = word[i] # (8): w=maerd (12): w=remaerd ... (18): w=esare\n if s[count:count+len(w)] == w: # (9): NO CHANGE (13): NO CHANGE ... (19): NO CHANGE\n count += len(w) # (10): count=5 (20): count=10\n if counttemp == count: # (22): NO CHANGE\n break\nif s[count:] in word: # (24): NO CHANGE\n print('YES')\nelse:\n print('NO')\n \n"], "anno_status": [true], "diff_content": " s = list(input())\n s.reverse()\n s = ''.join(map(str, s))\n count = 0\n word = ['maerd', 'remaerd', 'resare', 'esare']\n \n while count <= len(s)-8:\n counttemp = count\n for i in range(4):\n w = word[i]\n if s[count:count+len(w)] == w:\n count += len(w)\n if counttemp == count:\n break\n-if s[count:] in word:\n+\n+if s[count:] in word or s[count:] =='':\n print('YES')\n else:\n print('NO')\n- \n-\n", "FL_content": "\n s = list(input())\n s.reverse()\n s = ''.join(map(str, s))\n count = 0\n-word = ['maerd', 'remaerd', 'resare', 'esare']\n \n-while count <= len(s)-8:\n counttemp = count\n for i in range(4):\n w = word[i]\n if s[count:count+len(w)] == w:\n count += len(w)\n if counttemp == count:\n break\n if s[count:] in word:\n print('YES')\n else:\n print('NO')\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u165578704", "problem_id": "p02368", "submission1_id": "s324033554-FL", "submission2_id": "s466847525", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\n\nsys.setrecursionlimit(10 ** 9)\ndef input(): return sys.stdin.readline().strip()\ndef INT(): return int(input())\ndef MAP(): return map(int, input().split())\ndef LIST(): return list(map(int, input().split()))\nINF=float('inf')\n\nN,M=MAP()\nnodes1=[[] for i in range(N)]\nnodes2=[[] for i in range(N)]\nfor i in range(M):\n u,v=MAP()\n nodes1[u].append(v)\n nodes2[v].append(u)\n\nT=[]\nvisited=[False]*N\ndef rec1(cur):\n visited[cur]=True\n for nxt in nodes1[cur]:\n if not visited[nxt]:\n rec1(nxt)\n \n T.append(cur)\n\n\nfor u in range(N):\n if not visited[u]:\n rec1(u)\n\nvisited=[False]*N\ngroup=[0]*N\ngrpnum=1\ndef rec2(cur):\n global grpnum\n group[cur]=grpnum\n visited[cur]=True\n for nxt in nodes2[cur]:\n if not visited[nxt]:\n rec2(nxt)\n return\n grpnum+=1\n return\n\n\nfor u in reversed(T):\n if not visited[u]:\n rec2(u)\n\nQ=INT()\nfor _ in range(Q):\n u,v=MAP()\n if group[u]==group[v]:\n print(1)\n else:\n print(0)\n\n", "code2": "\n\nimport sys\n\nsys.setrecursionlimit(10 ** 9)\ndef input(): return sys.stdin.readline().strip()\ndef INT(): return int(input())\ndef MAP(): return map(int, input().split())\ndef LIST(): return list(map(int, input().split()))\nINF=float('inf')\n\nN,M=MAP()\nnodes1=[[] for i in range(N)]\nnodes2=[[] for i in range(N)]\nfor i in range(M):\n u,v=MAP()\n nodes1[u].append(v)\n nodes2[v].append(u)\n\nT=[]\nvisited=[False]*N\ndef rec1(cur):\n visited[cur]=True\n for nxt in nodes1[cur]:\n if not visited[nxt]:\n rec1(nxt)\n \n T.append(cur)\n\n\nfor u in range(N):\n if not visited[u]:\n rec1(u)\n\nvisited=[False]*N\ngroup=[0]*N\ngrpnum=1\ndef rec2(cur):\n global grpnum\n group[cur]=grpnum\n visited[cur]=True\n for nxt in nodes2[cur]:\n if not visited[nxt]:\n rec2(nxt)\n\n\nfor u in reversed(T):\n if not visited[u]:\n rec2(u)\n grpnum+=1\n\nQ=INT()\nfor _ in range(Q):\n u,v=MAP()\n if group[u]==group[v]:\n print(1)\n else:\n print(0)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556904112", "date2": "1556905783", "bleu_score": "0.972947413648121", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 101, "input": "7 6\n0 1\n2 0\n1 3\n3 4\n4 3\n3 2\n4\n0 0\n0 3\n2 3\n3 4\n", "actual_output": "1\n1\n1\n0\n", "expected_output": "1\n1\n1\n1\n\n", "anno_code": ["\n\nimport sys\n\nsys.setrecursionlimit(10 ** 9) # (0): input=, INT=, MAP=, LIST=\ndef input(): return sys.stdin.readline().strip()\ndef INT(): return int(input())\ndef MAP(): return map(int, input().split())\ndef LIST(): return list(map(int, input().split()))\nINF=float('inf') # (1): INF=inf\n\nN,M=MAP() # (2): N=7, M=6\nnodes1=[[] for i in range(N)] # (3): nodes1\nnodes2=[[] for i in range(N)] # (4): nodes2\nfor i in range(M): # (5): i=0 (9): nodes1=[[1], [], [], [], [], [], []], nodes2, i=1 ... (29): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n u,v=MAP() # (6): u=0, v=1 (10): nodes1=[[1], [], [], [], [], [], []], nodes2=[[], [0], [], [], [], [], []], u=2, v=0 ... (26): nodes1=[[1], [3], [0], [4], [3], [], []], nodes2, u=3, v=2\n nodes1[u].append(v) # (7): nodes1 (11): nodes1, nodes2 ... (27): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n nodes2[v].append(u) # (8): nodes1=[[1], [], [], [], [], [], []], nodes2 (12): nodes1, nodes2 ... (28): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n\nT=[] # (30): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, T=[]\nvisited=[False]*N # (31): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, visited=[False, False, False, False, False, False, False]\ndef rec1(cur): # (32): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, rec1=\n visited[cur]=True # (36): NO CHANGE (40): NO CHANGE ... (84): NO CHANGE\n for nxt in nodes1[cur]: # (37): nxt=1 (41): nxt=3 ... (85): NO CHANGE\n if not visited[nxt]: # (38): NO CHANGE (42): NO CHANGE ... (58): NO CHANGE\n rec1(nxt) # (39): cur=1 (43): cur=3 ... (55): cur=2\n \n T.append(cur) # (52): cur=3, nxt=4 (60): cur=3, nxt=2 ... (86): sys=, input=, INT=, MAP=, LIST=, INF=inf, N=7, M=6, nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2=[[2], [0], [3], [1, 4], [3], [], []], i=5, u=6, v=2, T=[4, 2, 3, 1, 0, 5, 6], visited=[True, True, True, True, True, True, True], rec1=\n\n\nfor u in range(N): # (33): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, u=0 (67): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, u=1 ... (87): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n if not visited[u]: # (34): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2 (68): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2 ... (82): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n rec1(u) # (35): cur=0 (77): cur=5 (83): cur=6\n\nvisited=[False]*N # (88): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, visited=[False, False, False, False, False, False, False]\ngroup=[0]*N # (89): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, group=[0, 0, 0, 0, 0, 0, 0]\ngrpnum=1 # (90): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, grpnum=1\ndef rec2(cur): # (91): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, rec2=\n global grpnum\n group[cur]=grpnum # (95): NO CHANGE (103): NO CHANGE ... (145): NO CHANGE\n visited[cur]=True # (96): NO CHANGE (104): NO CHANGE ... (146): NO CHANGE\n for nxt in nodes2[cur]: # (97): NO CHANGE (105): NO CHANGE ... (149): NO CHANGE\n if not visited[nxt]: # (114): NO CHANGE (119): NO CHANGE ... (148): NO CHANGE\n rec2(nxt) # (115): cur=2 (120): cur=3 (125): cur=1\n return # (133): cur=2, nxt=3 (134): cur=0, nxt=2 (135): sys=, input=, INT=, MAP=, LIST=, INF=inf, N=7, M=6, nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2=[[2], [0], [3], [1, 4], [3], [], []], i=5, u=0, v=2, T=[4, 2, 3, 1, 0, 5, 6], visited=[True, True, True, True, False, True, True], rec1=, group=[3, 3, 3, 3, 0, 2, 1], grpnum=4, rec2=\n grpnum+=1 # (98): NO CHANGE (106): NO CHANGE ... (150): NO CHANGE\n return # (99): sys=, input=, INT=, MAP=, LIST=, INF=inf, N=7, M=6, nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2=[[2], [0], [3], [1, 4], [3], [], []], i=5, u=6, v=2, T=[4, 2, 3, 1, 0, 5, 6], visited=[False, False, False, False, False, False, True], rec1=, group=[0, 0, 0, 0, 0, 0, 1], grpnum=2, rec2= (107): sys=, input=, INT=, MAP=, LIST=, INF=inf, N=7, M=6, nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2=[[2], [0], [3], [1, 4], [3], [], []], i=5, u=5, v=2, T=[4, 2, 3, 1, 0, 5, 6], visited=[False, False, False, False, False, True, True], rec1=, group=[0, 0, 0, 0, 0, 2, 1], grpnum=3, rec2= ... (151): sys=, input=, INT=, MAP=, LIST=, INF=inf, N=7, M=6, nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2=[[2], [0], [3], [1, 4], [3], [], []], i=5, u=4, v=2, T=[4, 2, 3, 1, 0, 5, 6], visited=[True, True, True, True, True, True, True], rec1=, group=[3, 3, 3, 3, 4, 2, 1], grpnum=5, rec2=\n\n\nfor u in reversed(T): # (92): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2 (100): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, u=5 ... (152): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n if not visited[u]: # (93): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2 (101): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2 ... (143): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n rec2(u) # (94): cur=6 (102): cur=5 ... (144): cur=4\n\nQ=INT() # (153): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, Q=4\nfor _ in range(Q): # (154): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, _=0 (158): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, _=1 ... (166): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, _=3\n u,v=MAP() # (155): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, u=0, v=0 (159): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, v=3 ... (167): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2, u=3, v=4\n if group[u]==group[v]: # (156): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2 (160): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2 ... (168): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n print(1) # (157): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2 (161): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2 (165): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n else:\n print(0) # (169): nodes1=[[1], [3], [0], [4, 2], [3], [], []], nodes2\n\n"], "anno_status": [false], "diff_content": " \n \n import sys\n \n sys.setrecursionlimit(10 ** 9)\n def input(): return sys.stdin.readline().strip()\n def INT(): return int(input())\n def MAP(): return map(int, input().split())\n def LIST(): return list(map(int, input().split()))\n INF=float('inf')\n \n N,M=MAP()\n nodes1=[[] for i in range(N)]\n nodes2=[[] for i in range(N)]\n for i in range(M):\n u,v=MAP()\n nodes1[u].append(v)\n nodes2[v].append(u)\n \n T=[]\n visited=[False]*N\n def rec1(cur):\n visited[cur]=True\n for nxt in nodes1[cur]:\n if not visited[nxt]:\n rec1(nxt)\n \n T.append(cur)\n \n \n for u in range(N):\n if not visited[u]:\n rec1(u)\n \n visited=[False]*N\n group=[0]*N\n grpnum=1\n def rec2(cur):\n global grpnum\n group[cur]=grpnum\n visited[cur]=True\n for nxt in nodes2[cur]:\n if not visited[nxt]:\n rec2(nxt)\n- return\n- grpnum+=1\n- return\n \n \n for u in reversed(T):\n if not visited[u]:\n rec2(u)\n+ grpnum+=1\n \n Q=INT()\n for _ in range(Q):\n u,v=MAP()\n if group[u]==group[v]:\n print(1)\n else:\n print(0)\n \n \n", "FL_content": "\n \n \n import sys\n \n sys.setrecursionlimit(10 ** 9)\n def input(): return sys.stdin.readline().strip()\n def INT(): return int(input())\n def MAP(): return map(int, input().split())\n def LIST(): return list(map(int, input().split()))\n INF=float('inf')\n \n N,M=MAP()\n nodes1=[[] for i in range(N)]\n nodes2=[[] for i in range(N)]\n for i in range(M):\n u,v=MAP()\n nodes1[u].append(v)\n nodes2[v].append(u)\n \n T=[]\n visited=[False]*N\n def rec1(cur):\n visited[cur]=True\n for nxt in nodes1[cur]:\n if not visited[nxt]:\n rec1(nxt)\n \n T.append(cur)\n \n \n for u in range(N):\n if not visited[u]:\n rec1(u)\n \n visited=[False]*N\n group=[0]*N\n grpnum=1\n def rec2(cur):\n global grpnum\n group[cur]=grpnum\n visited[cur]=True\n for nxt in nodes2[cur]:\n if not visited[nxt]:\n rec2(nxt)\n return\n grpnum+=1\n return\n \n \n for u in reversed(T):\n if not visited[u]:\n rec2(u)\n \n Q=INT()\n for _ in range(Q):\n u,v=MAP()\n if group[u]==group[v]:\n print(1)\n else:\n print(0)\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 62 }, { "user_id": "u088372268", "problem_id": "p02410", "submission1_id": "s307431150-FL", "submission2_id": "s273130919", "status1": "Wrong Answer", "status2": "Accepted", "code1": "data = list(map(int, list(input().split())))\nrow = data[0]\ncolumn = data[1]\nmatrix = [[0 for i in range(column)] for j in range(row)]\nvector = [[0] for k in range(column)]\nvector_multi = [[0] for l in range(row)]\n\nfor i in range(row):\n data_row = list(map(int, list(input().split())))\n print(data_row)\n for j in range(column):\n matrix[i][j] = data_row[j]\n\nfor i in range(column):\n vector[i] = int(input())\n\nfor i in range(row): \n element = 0\n for j in range(column):\n element += matrix[i][j] * vector[j]\n vector_multi[i][0] = element\n\nfor i in vector_multi:\n print(i[0])\n\n", "code2": "data = list(map(int, list(input().split())))\nrow = data[0]\ncolumn = data[1]\nmatrix = [[0 for i in range(column)] for j in range(row)]\nvector = [[0] for k in range(column)]\nvector_multi = [[0] for l in range(row)]\n\nfor i in range(row):\n data_row = list(map(int, list(input().split())))\n for j in range(column):\n matrix[i][j] = data_row[j]\n\nfor i in range(column):\n vector[i] = int(input())\n\nfor i in range(row): \n element = 0\n for j in range(column):\n element += matrix[i][j] * vector[j]\n vector_multi[i][0] = element\n\nfor i in vector_multi:\n print(i[0])\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1514987255", "date2": "1514987942", "bleu_score": "0.9666698050429988", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 4\n-1 4 0 1\n0 0 0 6\n8 0 1 -1\n1\n2\n0\n-1\n", "actual_output": "[-1, 4, 0, 1]\n[0, 0, 0, 6]\n[8, 0, 1, -1]\n6\n-6\n9\n", "expected_output": "6\n-6\n9\n\n", "anno_code": ["data = list(map(int, list(input().split()))) # (0): data=[3, 4]\nrow = data[0] # (1): row=3\ncolumn = data[1] # (2): column=4\nmatrix = [[0 for i in range(column)] for j in range(row)] # (3): matrix\nvector = [[0] for k in range(column)] # (4): vector\nvector_multi = [[0] for l in range(row)] # (5): vector_multi\n\nfor i in range(row): # (6): i=0 (18): i=1 ... (42): NO CHANGE\n data_row = list(map(int, list(input().split()))) # (7): data_row=[-1, 4, 0, 1] (19): data_row=[0, 0, 0, 6] (31): data_row=[8, 0, 1, -1]\n print(data_row) # (8): NO CHANGE (20): NO CHANGE (32): NO CHANGE\n for j in range(column): # (9): j=0 (11): j=1 ... (41): NO CHANGE\n matrix[i][j] = data_row[j] # (10): matrix (12): matrix ... (40): matrix\n\nfor i in range(column): # (43): i=0 (45): vector=[1, [0], [0], [0]], i=1 ... (51): NO CHANGE\n vector[i] = int(input()) # (44): vector=[1, [0], [0], [0]] (46): vector=[1, 2, [0], [0]] ... (50): vector=[1, 2, 0, -1]\n\nfor i in range(row): # (52): i=0 (64): i=1 ... (88): NO CHANGE\n element = 0 # (53): element=0 (65): element=0 (77): element=0\n for j in range(column): # (54): j=0 (56): j=1 ... (86): NO CHANGE\n element += matrix[i][j] * vector[j] # (55): element=-1 (57): element=7 ... (85): element=9\n vector_multi[i][0] = element # (63): vector_multi=[[6], [0], [0]] (75): vector_multi (87): vector_multi\n\nfor i in vector_multi: # (89): i=[6] (91): i=[-6] (93): i=[9]\n print(i[0]) # (90): NO CHANGE (92): NO CHANGE (94): NO CHANGE\n\n"], "anno_status": [true], "diff_content": " data = list(map(int, list(input().split())))\n row = data[0]\n column = data[1]\n matrix = [[0 for i in range(column)] for j in range(row)]\n vector = [[0] for k in range(column)]\n vector_multi = [[0] for l in range(row)]\n \n for i in range(row):\n data_row = list(map(int, list(input().split())))\n- print(data_row)\n for j in range(column):\n matrix[i][j] = data_row[j]\n \n for i in range(column):\n vector[i] = int(input())\n \n for i in range(row): \n element = 0\n for j in range(column):\n element += matrix[i][j] * vector[j]\n vector_multi[i][0] = element\n \n for i in vector_multi:\n print(i[0])\n \n \n", "FL_content": "\n data = list(map(int, list(input().split())))\n row = data[0]\n column = data[1]\n matrix = [[0 for i in range(column)] for j in range(row)]\n vector = [[0] for k in range(column)]\n vector_multi = [[0] for l in range(row)]\n \n for i in range(row):\n data_row = list(map(int, list(input().split())))\n- print(data_row)\n for j in range(column):\n matrix[i][j] = data_row[j]\n \n for i in range(column):\n vector[i] = int(input())\n \n for i in range(row): \n element = 0\n for j in range(column):\n element += matrix[i][j] * vector[j]\n vector_multi[i][0] = element\n \n for i in vector_multi:\n print(i[0])\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 26 }, { "user_id": "u324326379", "problem_id": "p02958", "submission1_id": "s773957750-FL", "submission2_id": "s259265494", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\np=list(map(int,input().split()))\ncount=0\nnum=0\nfor i in p:\n if i!=num+1:\n count+=1\n num+=1\nif count>2:\n print('No')\nelse:\n print('Yes')", "code2": "n=int(input())\np=list(map(int,input().split()))\ncount=0\nnum=0\nfor i in p:\n if i!=num+1:\n count+=1\n num+=1\nif count>2:\n print('NO')\nelse:\n print('YES')", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587073799", "date2": "1587073911", "bleu_score": "0.9655239569539354", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "5\n1 0 -2 -1 2\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["n=int(input()) # (0): n=5\np=list(map(int,input().split())) # (1): p=[1, 0, -2, -1, 2]\ncount=0 # (2): count=0\nnum=0 # (3): num=0\nfor i in p: # (4): i=1 (7): i=0 ... (23): NO CHANGE\n if i!=num+1: # (5): NO CHANGE (8): NO CHANGE ... (20): NO CHANGE\n count+=1 # (9): count=1 (13): count=2 ... (21): count=4\n num+=1 # (6): num=1 (10): num=2 ... (22): num=5\nif count>2: # (24): NO CHANGE\n print('No')\nelse:\n print('Yes')"], "anno_status": [true], "diff_content": " n=int(input())\n p=list(map(int,input().split()))\n count=0\n num=0\n for i in p:\n if i!=num+1:\n count+=1\n num+=1\n if count>2:\n- print('No')\n+ print('NO')\n else:\n- print('Yes')\n+ print('YES')\n", "FL_content": "\n n=int(input())\n p=list(map(int,input().split()))\n count=0\n num=0\n for i in p:\n if i!=num+1:\n count+=1\n num+=1\n-if count>2:\n- print('No')\n else:\n- print('Yes')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u174603263", "problem_id": "p03139", "submission1_id": "s019473303-FL", "submission2_id": "s393575722", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, A, B = (int(x) for x in input().split())\nc=0\nif(A <= B):\n c = A\nelse:\n c = B\nif(A+B > N and A+B == 2*N ):\n print(\"{} {}\".format(c, A+B-N))\nelse:\n print(\"{} {}\".format(c, 0))\n", "code2": "N, A, B = (int(x) for x in input().split())\nc=0\nif(A <= B):\n c = A\nelse:\n c = B\nif(A+B > N):\n print(\"{} {}\".format(c, A+B-N))\nelse:\n print(\"{} {}\".format(c, 0))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1548641996", "date2": "1548642051", "bleu_score": "0.9036296825044923", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 9, "total_score": 81, "input": "101 001 111\n", "actual_output": "1 0\n", "expected_output": "1 11\n\n", "anno_code": ["N, A, B = (int(x) for x in input().split()) # (0): N=101, A=1, B=111\nc=0 # (1): c=0\nif(A <= B): # (2): NO CHANGE\n c = A # (3): c=1\nelse:\n c = B\nif(A+B > N and A+B == 2*N ): # (4): NO CHANGE\n print(\"{} {}\".format(c, A+B-N))\nelse:\n print(\"{} {}\".format(c, 0))\n"], "anno_status": [true], "diff_content": " N, A, B = (int(x) for x in input().split())\n c=0\n if(A <= B):\n c = A\n else:\n c = B\n-if(A+B > N and A+B == 2*N ):\n+if(A+B > N):\n print(\"{} {}\".format(c, A+B-N))\n else:\n print(\"{} {}\".format(c, 0))\n \n", "FL_content": "\n N, A, B = (int(x) for x in input().split())\n c=0\n if(A <= B):\n c = A\n else:\n c = B\n-if(A+B > N and A+B == 2*N ):\n print(\"{} {}\".format(c, A+B-N))\n else:\n print(\"{} {}\".format(c, 0))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u109490423", "problem_id": "p03730", "submission1_id": "s179341163-FL", "submission2_id": "s492645264", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=list(map(int,input().split()))\nflag=0\nfor itr in range(100000):\n if (a*itr)%b==c: \n print('NO')\n flag=1\n break\nif flag==0: print('YES')\n ", "code2": "a,b,c=list(map(int,input().split()))\nflag=0\nfor itr in range(1,100000):\n if (a*itr)%b==c: \n print('YES')\n flag=1\n break\nif flag==0: print('NO')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595558891", "date2": "1595559055", "bleu_score": "0.965830491859015", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 92, "input": "67 77 58\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["a,b,c=list(map(int,input().split())) # (0): a=67, b=77, c=58\nflag=0 # (1): flag=0\nfor itr in range(100000): # (2): itr=0 (4): itr=1 ... (52): itr=25\n if (a*itr)%b==c: # (3): NO CHANGE (5): NO CHANGE ... (53): NO CHANGE\n print('NO') # (54): NO CHANGE\n flag=1 # (55): flag=1\n break # (56): NO CHANGE\nif flag==0: print('YES')\n "], "anno_status": [true], "diff_content": " a,b,c=list(map(int,input().split()))\n flag=0\n-for itr in range(100000):\n+for itr in range(1,100000):\n if (a*itr)%b==c: \n- print('NO')\n+ print('YES')\n flag=1\n break\n-if flag==0: print('YES')\n- \n+if flag==0: print('NO')\n", "FL_content": "\n a,b,c=list(map(int,input().split()))\n flag=0\n for itr in range(100000):\n- if (a*itr)%b==c: \n print('NO')\n flag=1\n break\n if flag==0: print('YES')\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u595716769", "problem_id": "p03945", "submission1_id": "s141223404-FL", "submission2_id": "s299058012", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\ncount = 0\nfor i in range(len(s)):\n now = s[i]\n if now != s[i]:\n count += 1\nprint(count)", "code2": "s = input()\n \ncount = 0\nnow = s[0]\nfor i in range(len(s)):\n if now != s[i]:\n count += 1\n now = s[i]\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572394444", "date2": "1572394528", "bleu_score": "0.8457497961554002", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 1, "total_score": 103, "input": "BCWAWCAVWX\n", "actual_output": "0\n", "expected_output": "9\n\n", "anno_code": ["s = input() # (0): s=BCWAWCAVWX\n\ncount = 0 # (1): count=0\nfor i in range(len(s)): # (2): i=0 (5): i=1 ... (32): NO CHANGE\n now = s[i] # (3): now=B (6): now=C ... (30): now=X\n if now != s[i]: # (4): NO CHANGE (7): NO CHANGE ... (31): NO CHANGE\n count += 1\nprint(count)"], "anno_status": [true], "diff_content": " s = input()\n-\n+ \n count = 0\n+now = s[0]\n for i in range(len(s)):\n- now = s[i]\n if now != s[i]:\n count += 1\n+ now = s[i]\n print(count)\n", "FL_content": "\n s = input()\n \n count = 0\n for i in range(len(s)):\n now = s[i]\n- if now != s[i]:\n count += 1\n print(count)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u126478680", "problem_id": "p02318", "submission1_id": "s143984069-FL", "submission2_id": "s391626446", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def levenshtein(str1, str2):\n if len(str1) == 0 or len(str2) == 0: return max(len(str1), len(str2))\n \n dp = [[None for i in range(len(str2))] for i in range(len(str1))]\n for i in range(len(str1)): dp[i][0] = i\n for j in range(len(str2)): dp[0][j] = j\n\n for i in range(1, len(str1)):\n for j in range(1, len(str2)):\n val = dp[i-1][j-1] if str1[i] == str2[j] else dp[i-1][j-1]+1\n dp[i][j] = min(val, dp[i-1][j]+1, dp[i][j-1]+1)\n return dp[-1][-1]\n\ns1 = input()\ns2 = input()\n\nprint(levenshtein(s1, s2))\n", "code2": "def levenshtein(str1, str2):\n if len(str1) == 0 or len(str2) == 0: return max(len(str1), len(str2))\n \n dp = [[None for i in range(len(str2)+1)] for i in range(len(str1)+1)]\n for i in range(len(str1)+1): dp[i][0] = i\n for j in range(len(str2)+1): dp[0][j] = j\n\n for i in range(1, len(str1)+1):\n for j in range(1, len(str2)+1):\n val = dp[i-1][j-1] if str1[i-1] == str2[j-1] else dp[i-1][j-1]+1\n dp[i][j] = min(val, dp[i-1][j]+1, dp[i][j-1]+1)\n return dp[-1][-1]\n\ns1 = input()\ns2 = input()\n\nprint(levenshtein(s1, s2))\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1527856347", "date2": "1527856518", "bleu_score": "0.9501446264356059", "code1_test_status": [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1], "code1_test_score": 16, "total_score": 102, "input": "ibpc\nccpi\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["def levenshtein(str1, str2): # (0): levenshtein=\n if len(str1) == 0 or len(str2) == 0: return max(len(str1), len(str2))\n \n dp = [[None for i in range(len(str2))] for i in range(len(str1))] # (4): dp\n for i in range(len(str1)): dp[i][0] = i # (5): dp=[[0, None, None, None], [None, None, None, None], [None, None, None, None], [None, None, None, None]], i=0 (6): dp, i=1 ... (9): NO CHANGE\n for j in range(len(str2)): dp[0][j] = j # (10): j=0 (11): dp, j=1 ... (14): NO CHANGE\n\n for i in range(1, len(str1)): # (15): i=1 (26): i=2 (37): i=3\n for j in range(1, len(str2)): # (16): j=1 (19): j=2 ... (47): NO CHANGE\n val = dp[i-1][j-1] if str1[i] == str2[j] else dp[i-1][j-1]+1 # (17): val=1 (20): val=2 ... (45): val=2\n dp[i][j] = min(val, dp[i-1][j]+1, dp[i][j-1]+1) # (18): dp (21): dp ... (46): dp\n return dp[-1][-1]\n\ns1 = input() # (1): s1=ibpc\ns2 = input() # (2): s2=ccpi\n\nprint(levenshtein(s1, s2)) # (3): str1=ibpc, str2=ccpi\n"], "anno_status": [true], "diff_content": " def levenshtein(str1, str2):\n if len(str1) == 0 or len(str2) == 0: return max(len(str1), len(str2))\n \n- dp = [[None for i in range(len(str2))] for i in range(len(str1))]\n- for i in range(len(str1)): dp[i][0] = i\n- for j in range(len(str2)): dp[0][j] = j\n+ dp = [[None for i in range(len(str2)+1)] for i in range(len(str1)+1)]\n+ for i in range(len(str1)+1): dp[i][0] = i\n+ for j in range(len(str2)+1): dp[0][j] = j\n \n- for i in range(1, len(str1)):\n- for j in range(1, len(str2)):\n- val = dp[i-1][j-1] if str1[i] == str2[j] else dp[i-1][j-1]+1\n+ for i in range(1, len(str1)+1):\n+ for j in range(1, len(str2)+1):\n+ val = dp[i-1][j-1] if str1[i-1] == str2[j-1] else dp[i-1][j-1]+1\n dp[i][j] = min(val, dp[i-1][j]+1, dp[i][j-1]+1)\n return dp[-1][-1]\n \n s1 = input()\n s2 = input()\n \n print(levenshtein(s1, s2))\n \n", "FL_content": "\n def levenshtein(str1, str2):\n if len(str1) == 0 or len(str2) == 0: return max(len(str1), len(str2))\n \n dp = [[None for i in range(len(str2))] for i in range(len(str1))]\n for i in range(len(str1)): dp[i][0] = i\n for j in range(len(str2)): dp[0][j] = j\n \n for i in range(1, len(str1)):\n for j in range(1, len(str2)):\n- val = dp[i-1][j-1] if str1[i] == str2[j] else dp[i-1][j-1]+1\n dp[i][j] = min(val, dp[i-1][j]+1, dp[i][j-1]+1)\n return dp[-1][-1]\n \n s1 = input()\n s2 = input()\n \n print(levenshtein(s1, s2))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u564464686", "problem_id": "p01102", "submission1_id": "s627257406-FL", "submission2_id": "s840149698", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def p(A,s):\n i=0\n j=0\n s=[]\n while(len(A)>i):\n if A[i]=='\"':\n list1=A.partition('\"')\n s.append(list1[0])\n A=list1[2]\n i=0\n j+=1\n else:\n i+=1\n if len(A)==i:\n s.append(A)\n return s\nA=input()\ns1=[]\ns2=[]\nO=[]\nwhile 1:\n i=0\n cnt=0\n B=input()\n s1=p(A,s1)\n s2=p(B,s2)\n l1=len(s1)\n l2=len(s2) \n while i\n i=0 # (10): i=0 (106): i=0 ... (1531): i=0\n j=0 # (11): j=0 (107): j=0 ... (1532): j=0\n s=[] # (12): NO CHANGE (108): NO CHANGE ... (1533): s=[]\n while(len(A)>i): # (13): NO CHANGE (17): NO CHANGE ... (1573): p=, A=11\"12\"11, s1=['11', '12', '11'], s2=['13', '3', '111'], O=['CLOSE', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'CLOSE', 'DIFFERENT'], i=0, cnt=0, B=13\"3\"111, l1=4, l2=4\n if A[i]=='\"': # (14): NO CHANGE (18): NO CHANGE ... (1569): NO CHANGE\n list1=A.partition('\"') # (35): list1=('print', '\"', 'hello\";print133') (62): list1=('hello', '\"', ';print133') ... (1555): list1=('3', '\"', '111')\n s.append(list1[0]) # (36): s=['print'] (63): s=['print', 'hello'] ... (1556): s=['13', '3']\n A=list1[2] # (37): A=hello\";print133 (64): A=;print133 ... (1557): A=111\n i=0 # (38): i=0 (65): i=0 ... (1558): i=0\n j+=1 # (39): j=1 (66): j=2 ... (1559): j=2\n else:\n i+=1 # (15): i=1 (19): i=2 ... (1570): i=3\n if len(A)==i: # (16): NO CHANGE (20): NO CHANGE ... (1571): NO CHANGE\n s.append(A) # (103): s=['print', 'hello', ';print133'] (199): s=['print', 'hello', ';qrinu123'] ... (1572): s=['13', '3', '111']\n return s\nA=input() # (1): A=print\"hello\";print133\ns1=[] # (2): s1=[]\ns2=[] # (3): s2=[]\nO=[] # (4): O=[]\nwhile 1: # (5): NO CHANGE (219): NO CHANGE ... (1482): NO CHANGE\n i=0 # (6): i=0 (220): i=0 ... (1483): i=0\n cnt=0 # (7): cnt=0 (221): cnt=0 ... (1484): cnt=0\n B=input() # (8): B=print\"hello\";qrinu123 (222): B=;tuptuo;evlos;\"2B\"daer ... (1485): B=13\"3\"111\n s1=p(A,s1) # (9): s=[] (223): s=['print', 'hello', ';print133'] ... (1486): s=['I', 'S', '', 'CREAM']\n s2=p(B,s2) # (105): A=print\"hello\";qrinu123, s=[] (343): A=;tuptuo;evlos;\"2B\"daer, s=['print', 'hello', ';qrinu123'] ... (1530): A=13\"3\"111, s=['I', 'CE', '', 'BREAM']\n l1=len(s1) # (201): l1=3 (443): NO CHANGE ... (1574): l1=3\n l2=len(s2) # (202): l2=3 (444): NO CHANGE ... (1575): l2=3\n while ii):\n- if A[i]=='\"':\n- list1=A.partition('\"')\n- s.append(list1[0])\n- A=list1[2]\n- i=0\n- j+=1\n- else:\n- i+=1\n- if len(A)==i:\n- s.append(A)\n- return s\n-A=input()\n s1=[]\n s2=[]\n O=[]\n while 1:\n+ A=input().split('\"')\n+ if A==[\".\"]:\n+ break\n i=0\n cnt=0\n- B=input()\n- s1=p(A,s1)\n- s2=p(B,s2)\n- l1=len(s1)\n- l2=len(s2) \n- while ii):\n if A[i]=='\"':\n list1=A.partition('\"')\n s.append(list1[0])\n A=list1[2]\n i=0\n j+=1\n else:\n i+=1\n if len(A)==i:\n s.append(A)\n return s\n A=input()\n s1=[]\n s2=[]\n O=[]\n while 1:\n i=0\n cnt=0\n B=input()\n s1=p(A,s1)\n s2=p(B,s2)\n l1=len(s1)\n l2=len(s2) \n while i 1 and M > 1:\n four = 4\n six = (N - 2) * 2 + (M - 2) * 2\n nine = N * M - four - six\n print(nine)\nelif N == 2 or M == 2:\n print(0)\nelse:\n two = 2\n three = N * M - two\n print(three)", "code2": "import sys\n\nN, M = map(int, sys.stdin.readline().split())\n\nif N == 1 and M == 1:\n print(1)\nelif N == 1 or M == 1:\n two = 2\n three = N * M - two\n print(three)\nelse:\n four = 4\n six = (N - 2) * 2 + (M - 2) * 2\n nine = N * M - four - six\n print(nine)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596519080", "date2": "1596519213", "bleu_score": "0.9447079716046787", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 69, "total_score": 78, "input": "124 0\n", "actual_output": "-2\n", "expected_output": "-244\n\n", "anno_code": ["import sys\n\nN, M = map(int, sys.stdin.readline().split()) # (0): N=124, M=0\n\nif N > 1 and M > 1: # (1): NO CHANGE\n four = 4\n six = (N - 2) * 2 + (M - 2) * 2\n nine = N * M - four - six\n print(nine)\nelif N == 2 or M == 2: # (2): NO CHANGE\n print(0)\nelse:\n two = 2 # (3): two=2\n three = N * M - two # (4): three=-2\n print(three)"], "anno_status": [true], "diff_content": " import sys\n \n N, M = map(int, sys.stdin.readline().split())\n \n-if N > 1 and M > 1:\n+if N == 1 and M == 1:\n+ print(1)\n+elif N == 1 or M == 1:\n+ two = 2\n+ three = N * M - two\n+ print(three)\n+else:\n four = 4\n six = (N - 2) * 2 + (M - 2) * 2\n nine = N * M - four - six\n print(nine)\n-elif N == 2 or M == 2:\n- print(0)\n-else:\n- two = 2\n- three = N * M - two\n- print(three)\n", "FL_content": "\n import sys\n \n N, M = map(int, sys.stdin.readline().split())\n \n if N > 1 and M > 1:\n four = 4\n six = (N - 2) * 2 + (M - 2) * 2\n nine = N * M - four - six\n print(nine)\n elif N == 2 or M == 2:\n print(0)\n else:\n two = 2\n- three = N * M - two\n print(three)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u623659526", "problem_id": "p02948", "submission1_id": "s268584443-FL", "submission2_id": "s842384060", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import logging\n\nlogging.basicConfig(level=logging.INFO, format=\"%(message)s\")\n\n\ndp = [0 for _ in range(100000)]\n\ndef main():\n N, M = map(int, input().split())\n A_B = [list(map(int, input().split()))[::-1] for _ in range(N)]\n logging.info(\"Hello!\")\n\n sorted_A_B = sorted(A_B, reverse=True)\n logging.info(sorted_A_B)\n\n\n total = 0\n for i in range(N):\n if sorted_A_B[i][1] + i <= M:\n total += sorted_A_B[i][0]\n\n\n print(total)\n \nif __name__ == \"__main__\":\n main()\n", "code2": "import logging\nimport heapq\n\nlogging.basicConfig(level=logging.INFO, format=\"%(message)s\")\n\n\n\ndef main():\n N, M = map(int, input().split())\n A_B = [list(map(int, input().split())) for _ in range(N)]\n logging.info(\"Hello!\")\n\n A_B.sort()\n logging.info(A_B)\n\n\n heap_Q = []\n curr = 0\n total = 0\n for i in range(1, M + 1):\n while curr < N and A_B[curr][0] <= i:\n heapq.heappush(heap_Q, A_B[curr][1] * (-1))\n curr += 1\n\n if heap_Q:\n total += (-1) * heapq.heappop(heap_Q)\n\n print(total)\n \nif __name__ == \"__main__\":\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565488993", "date2": "1565587714", "bleu_score": "0.6832810432511643", "code1_test_status": [1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 98, "total_score": 102, "input": "3 5\n4 3\n4 1\n2 2\n", "actual_output": "5\n", "expected_output": "6\n\n", "anno_code": ["import logging\n\nlogging.basicConfig(level=logging.INFO, format=\"%(message)s\") # (0): NO CHANGE\n\n\ndp = [0 for _ in range(100000)] # (1): dp=[0, 0, ..., 0, 0]\n\ndef main(): # (2): main=\n N, M = map(int, input().split())\n A_B = [list(map(int, input().split()))[::-1] for _ in range(N)]\n logging.info(\"Hello!\")\n\n sorted_A_B = sorted(A_B, reverse=True)\n logging.info(sorted_A_B)\n\n\n total = 0\n for i in range(N):\n if sorted_A_B[i][1] + i <= M:\n total += sorted_A_B[i][0]\n\n\n print(total)\n \nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " import logging\n+import heapq\n \n logging.basicConfig(level=logging.INFO, format=\"%(message)s\")\n \n \n-dp = [0 for _ in range(100000)]\n \n def main():\n N, M = map(int, input().split())\n- A_B = [list(map(int, input().split()))[::-1] for _ in range(N)]\n+ A_B = [list(map(int, input().split())) for _ in range(N)]\n logging.info(\"Hello!\")\n \n- sorted_A_B = sorted(A_B, reverse=True)\n- logging.info(sorted_A_B)\n+ A_B.sort()\n+ logging.info(A_B)\n \n \n+ heap_Q = []\n+ curr = 0\n total = 0\n- for i in range(N):\n- if sorted_A_B[i][1] + i <= M:\n- total += sorted_A_B[i][0]\n+ for i in range(1, M + 1):\n+ while curr < N and A_B[curr][0] <= i:\n+ heapq.heappush(heap_Q, A_B[curr][1] * (-1))\n+ curr += 1\n \n+ if heap_Q:\n+ total += (-1) * heapq.heappop(heap_Q)\n \n print(total)\n \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": "\n import logging\n \n logging.basicConfig(level=logging.INFO, format=\"%(message)s\")\n \n \n dp = [0 for _ in range(100000)]\n \n def main():\n N, M = map(int, input().split())\n A_B = [list(map(int, input().split()))[::-1] for _ in range(N)]\n logging.info(\"Hello!\")\n \n sorted_A_B = sorted(A_B, reverse=True)\n logging.info(sorted_A_B)\n \n \n total = 0\n for i in range(N):\n- if sorted_A_B[i][1] + i <= M:\n total += sorted_A_B[i][0]\n \n \n print(total)\n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u460172144", "problem_id": "p02237", "submission1_id": "s992458118-FL", "submission2_id": "s136453659", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nGM = [[0]*n for i in range(n)]\n\nfor i in range(n):\n data = list(map(int,input().split()))\n for i in range(data[1]):\n GM[data[0]-1][data[i+2]-1] = 1\n\n print(*GM[i])", "code2": "n = int(input())\nGM = [[0]*n for i in range(n)]\n\nfor i in range(n):\n data = list(map(int,input().split()))\n for i in range(data[1]):\n GM[data[0]-1][data[i+2]-1] = 1\n\n\nfor i in range(n):\n print(*GM[i])", "original_language1": "Python3", "original_language2": "Python3", "date1": "1477241542", "date2": "1477241642", "bleu_score": "0.9032312247935781", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "4\n1 2 2 1\n2 1 1\n1 -1\n0 1 1\n", "actual_output": "0 0 0 0\n1 1 0 0\n0 0 0 0\n1 1 0 0\n", "expected_output": "1 1 0 0\n1 0 0 0\n0 0 0 0\n1 0 0 0\n\n", "anno_code": ["n = int(input()) # (0): n=4\nGM = [[0]*n for i in range(n)] # (1): GM\n\nfor i in range(n): # (2): i=0 (10): NO CHANGE ... (20): i=3\n data = list(map(int,input().split())) # (3): data=[1, 2, 2, 1] (11): data=[2, 1, 1] ... (21): data=[0, 1, 1]\n for i in range(data[1]): # (4): NO CHANGE (6): i=1 ... (24): NO CHANGE\n GM[data[0]-1][data[i+2]-1] = 1 # (5): GM (7): GM ... (23): GM\n\n print(*GM[i]) # (9): NO CHANGE (15): NO CHANGE ... (25): NO CHANGE\n"], "anno_status": [true], "diff_content": " n = int(input())\n GM = [[0]*n for i in range(n)]\n \n for i in range(n):\n data = list(map(int,input().split()))\n for i in range(data[1]):\n GM[data[0]-1][data[i+2]-1] = 1\n \n+\n+for i in range(n):\n print(*GM[i])\n", "FL_content": "\n n = int(input())\n GM = [[0]*n for i in range(n)]\n \n for i in range(n):\n data = list(map(int,input().split()))\n for i in range(data[1]):\n- GM[data[0]-1][data[i+2]-1] = 1\n \n- print(*GM[i])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u149260203", "problem_id": "p03363", "submission1_id": "s524517994-FL", "submission2_id": "s673866124", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = [int(i) for i in input().split()]\nca = [A[0]] + [0]*(N-1)\n\nfor i in range(1,N):\n ca[i] = ca[i-1] + A[i]\n\ncount = 1\nnumber = 0\nnumber += ca.count(0)\nsca = sorted(ca) + ['hoge']\nprint(sca)\nfor i in range(1,N+1):\n if sca[i] == sca[i-1]:\n count += 1\n else:\n number += count*(count - 1)/2\n count = 1\n\n\nprint(int(number))", "code2": "N = int(input())\nA = [int(i) for i in input().split()]\nca = [A[0]] + [0]*(N-1)\n\nfor i in range(1,N):\n ca[i] = ca[i-1] + A[i]\n\ncount = 1\nnumber = 0\nnumber += ca.count(0)\nsca = sorted(ca) + ['hoge']\nfor i in range(1,N+1):\n if sca[i] == sca[i-1]:\n count += 1\n else:\n number += count*(count - 1)/2\n count = 1\n\n\nprint(int(number))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1527119914", "date2": "1527119935", "bleu_score": "0.9674228091306235", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "6\n-1 1 -3 2 1 -3\n", "actual_output": "[-3, -3, -1, -1, 0, 0, 'hoge']\n5\n", "expected_output": "5\n\n", "anno_code": ["N = int(input()) # (0): N=6\nA = [int(i) for i in input().split()] # (1): A=[-1, 1, -3, 2, 1, -3]\nca = [A[0]] + [0]*(N-1) # (2): ca=[-1, 0, 0, 0, 0, 0]\n\nfor i in range(1,N): # (3): i=1 (5): i=2 ... (13): NO CHANGE\n ca[i] = ca[i-1] + A[i] # (4): NO CHANGE (6): ca=[-1, 0, -3, 0, 0, 0] ... (12): ca=[-1, 0, -3, -1, 0, -3]\n\ncount = 1 # (14): count=1\nnumber = 0 # (15): number=0\nnumber += ca.count(0) # (16): number=2\nsca = sorted(ca) + ['hoge'] # (17): sca=[-3, -3, -1, -1, 0, 0, 'hoge']\nprint(sca) # (18): NO CHANGE\nfor i in range(1,N+1): # (19): i=1 (22): i=2 ... (40): NO CHANGE\n if sca[i] == sca[i-1]: # (20): NO CHANGE (23): NO CHANGE ... (37): NO CHANGE\n count += 1 # (21): count=2 (28): count=2 (35): count=2\n else:\n number += count*(count - 1)/2 # (24): number=3.0 (31): number=4.0 (38): number=5.0\n count = 1 # (25): count=1 (32): count=1 (39): count=1\n\n\nprint(int(number))"], "anno_status": [true], "diff_content": " N = int(input())\n A = [int(i) for i in input().split()]\n ca = [A[0]] + [0]*(N-1)\n \n for i in range(1,N):\n ca[i] = ca[i-1] + A[i]\n \n count = 1\n number = 0\n number += ca.count(0)\n sca = sorted(ca) + ['hoge']\n-print(sca)\n for i in range(1,N+1):\n if sca[i] == sca[i-1]:\n count += 1\n else:\n number += count*(count - 1)/2\n count = 1\n \n \n print(int(number))\n", "FL_content": "\n N = int(input())\n A = [int(i) for i in input().split()]\n ca = [A[0]] + [0]*(N-1)\n \n for i in range(1,N):\n ca[i] = ca[i-1] + A[i]\n \n count = 1\n number = 0\n number += ca.count(0)\n sca = sorted(ca) + ['hoge']\n-print(sca)\n for i in range(1,N+1):\n if sca[i] == sca[i-1]:\n count += 1\n else:\n number += count*(count - 1)/2\n count = 1\n \n \n print(int(number))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 21 }, { "user_id": "u520158330", "problem_id": "p04039", "submission1_id": "s456370910-FL", "submission2_id": "s197779607", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K = map(int,input().split())\nD = input().split()\n\nfor i in range(N,10000):\n match = False\n for s in str(i):\n if s in D:\n match = True\n break\n if not match:\n print(i)\n break", "code2": "N,K = map(int,input().split())\nD = input().split()\n\nfor i in range(N,100000):\n match = False\n for s in str(i):\n if s in D:\n match = True\n break\n if not match:\n print(i)\n break", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1525557893", "date2": "1525558104", "bleu_score": "0.9955653009413392", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 72, "total_score": 94, "input": "31766 1\n3\n", "actual_output": "no output\n", "expected_output": "40000\n\n", "anno_code": ["N,K = map(int,input().split()) # (0): N=31766, K=1\nD = input().split() # (1): D=['3']\n\nfor i in range(N,10000):\n match = False\n for s in str(i):\n if s in D:\n match = True\n break\n if not match:\n print(i)\n break"], "anno_status": [true], "diff_content": " N,K = map(int,input().split())\n D = input().split()\n \n-for i in range(N,10000):\n+for i in range(N,100000):\n match = False\n for s in str(i):\n if s in D:\n match = True\n break\n if not match:\n print(i)\n break\n", "FL_content": "\n N,K = map(int,input().split())\n-D = input().split()\n \n-for i in range(N,10000):\n match = False\n for s in str(i):\n if s in D:\n match = True\n break\n if not match:\n print(i)\n break\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u494058663", "problem_id": "p02899", "submission1_id": "s780195571-FL", "submission2_id": "s257125068", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = [int(i) for i in input().split()]\nNum = [int(i) for i in range(1,N+1)]\n\nList = []\nfor i in range(len(A)):\n List.append([A[i],i+1])\nprint(List)\n\nList.sort()\nans = []\nfor i in range(len(List)):\n ans.append(List[i][1])\nprint(*ans)\n", "code2": "N = int(input())\nA = [int(i) for i in input().split()]\nNum = [int(i) for i in range(1,N+1)]\n\nList = []\nfor i in range(len(A)):\n List.append([A[i],i+1])\n\n\nList.sort()\nans = []\nfor i in range(len(List)):\n ans.append(List[i][1])\nprint(*ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569719410", "date2": "1569719461", "bleu_score": "0.9468618176787261", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 11, "input": "3\n-2 0 -1\n", "actual_output": "[[-2, 1], [0, 2], [-1, 3]]\n1 3 2\n", "expected_output": "1 3 2 \n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = [int(i) for i in input().split()] # (1): A=[-2, 0, -1]\nNum = [int(i) for i in range(1,N+1)] # (2): Num=[1, 2, 3]\n\nList = [] # (3): List=[]\nfor i in range(len(A)): # (4): i=0 (6): i=1 ... (10): NO CHANGE\n List.append([A[i],i+1]) # (5): List=[[-2, 1]] (7): List (9): List\nprint(List) # (11): NO CHANGE\n\nList.sort() # (12): List\nans = [] # (13): ans=[]\nfor i in range(len(List)): # (14): i=0 (16): i=1 ... (20): NO CHANGE\n ans.append(List[i][1]) # (15): ans=[1] (17): ans=[1, 3] (19): ans=[1, 3, 2]\nprint(*ans)\n"], "anno_status": [true], "diff_content": " N = int(input())\n A = [int(i) for i in input().split()]\n Num = [int(i) for i in range(1,N+1)]\n \n List = []\n for i in range(len(A)):\n List.append([A[i],i+1])\n-print(List)\n+\n \n List.sort()\n ans = []\n for i in range(len(List)):\n ans.append(List[i][1])\n print(*ans)\n-\n", "FL_content": "\n N = int(input())\n A = [int(i) for i in input().split()]\n Num = [int(i) for i in range(1,N+1)]\n \n List = []\n for i in range(len(A)):\n List.append([A[i],i+1])\n-print(List)\n \n List.sort()\n ans = []\n for i in range(len(List)):\n ans.append(List[i][1])\n print(*ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u241923784", "problem_id": "p02345", "submission1_id": "s794467276-FL", "submission2_id": "s414431023", "status1": "Wrong Answer", "status2": "Accepted", "code1": "M = 2147483647\na = [M for i in range(100000)]\n\ndef j_min(x,y):\n if x < y:return x\n else: return y\n\ndef find(x,y,i,l,r):\n if r<=x or y<=l:return M\n if x<=l and r<=y: return a[i]\n return min(find(x,y,i*2,l,(l+r)/2),find(x,y,i*2+1,(l+r)/2,r))\n\nif __name__=='__main__':\n n, m = (int(x) for x in input().split())\n t=1\n while t= 2:\n a[int(x/2)]=j_min(a[int(x)],a[int(x)^1])\n x/=2\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556442947", "date2": "1556443722", "bleu_score": "0.9575600309135165", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 81, "total_score": 102, "input": "3 5\n1 0 1\n1 0 1\n0 2 3\n1 0 3\n1 1 4\n", "actual_output": "2147483647\n2147483647\n2147483647\n3\n", "expected_output": "2147483647\n2147483647\n3\n3\n\n", "anno_code": ["M = 2147483647 # (0): M=2147483647\na = [M for i in range(100000)] # (1): a=[2147483647, 2147483647, ..., 2147483647, 2147483647]\n\ndef j_min(x,y): # (2): j_min=\n if x < y:return x\n else: return y\n\ndef find(x,y,i,l,r): # (3): find=\n if r<=x or y<=l:return M\n if x<=l and r<=y: return a[i]\n return min(find(x,y,i*2,l,(l+r)/2),find(x,y,i*2+1,(l+r)/2,r))\n\nif __name__=='__main__':\n n, m = (int(x) for x in input().split())\n t=1\n while t= 2:\n a[int(x/2)]=j_min(a[int(x)],a[int(x)^1])\n x/=2\n \n \n", "FL_content": "\n M = 2147483647\n a = [M for i in range(100000)]\n \n def j_min(x,y):\n if x < y:return x\n else: return y\n \n def find(x,y,i,l,r):\n if r<=x or y<=l:return M\n if x<=l and r<=y: return a[i]\n return min(find(x,y,i*2,l,(l+r)/2),find(x,y,i*2+1,(l+r)/2,r))\n \n if __name__=='__main__':\n n, m = (int(x) for x in input().split())\n t=1\n while t 1:\n print(\"DIFFERENT\")\n break\n\n if not isTmp:\n if i % 2 == 0:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\");\n break\n if i % 2 == 1:\n if s1[i] != s2[i]:\n count += 1\n else:\n if i+1 % 2 == 0:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\");\n break\n if i+1 % 2 == 1:\n if s1[i] != s2[i]:\n count += 1\n\n if count == 1:\n print(\"CLOSE\")\n\n", "code2": "while True:\n s1 = input()\n if s1 == '.':\n break\n s2 = input()\n\n if s1 == s2:\n print(\"IDENTICAL\")\n continue\n\n s2 = s2.split('\"')\n s1 = s1.split('\"')\n \n \n count = 0\n isTmp = False\n if s1[0] == '\"' and s2[0] == '\"':\n isTmp = True\n\n hoge = True\n for i in range(len(s1)):\n if len(s1) != len(s2):\n print(\"DIFFERENT\")\n hoge = False\n break\n if count > 1:\n print(\"DIFFERENT\")\n hoge = False\n break\n\n if not isTmp:\n if i % 2 == 0:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\");\n hoge = False\n break\n if i % 2 == 1:\n if s1[i] != s2[i]:\n count += 1\n else:\n if i+1 % 2 == 0:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\");\n hoge = False\n break\n if i+1 % 2 == 1:\n if s1[i] != s2[i]:\n count += 1\n\n if count == 1 and hoge:\n print(\"CLOSE\")\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1527521338", "date2": "1527521993", "bleu_score": "0.8745028302175275", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1], "code1_test_score": 56, "total_score": 101, "input": "print\"hello\";print133\nprint\"helln\";print123\nread\"B1input\";solve;output;\n;tuptuo;evmos;\"2B\"daer\nread\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"\"\"\"\"\"\"\"\n\"\"\"42\"\"#\"\"\nslow\"program\"\nfast\"code\"\n\"super\"fast\"program\"\n\"super\"faster\"program\"\nX#\"\nY\nI\"S\"\"CREAM\"\nI\"CE\"\"CREAM\"\n11\"22\"11\n1\"33\"111\n.\n", "actual_output": "DIFFERENT\nCLOSE\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\n", "expected_output": "DIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\n\n", "anno_code": ["while True: # (0): NO CHANGE (35): NO CHANGE ... (250): NO CHANGE\n s1 = input() # (1): s1=print\"hello\";print133 (36): s1=read\"B1input\";solve;output; ... (251): s1=.\n if s1 == '.': # (2): NO CHANGE (37): NO CHANGE ... (252): NO CHANGE\n break\n s2 = input() # (3): s2=print\"helln\";print123 (38): s2=;tuptuo;evmos;\"2B\"daer ... (234): s2=1\"33\"111\n\n if s1 == s2: # (4): NO CHANGE (39): NO CHANGE ... (235): NO CHANGE\n print(\"IDENTICAL\")\n continue\n\n s2 = s2.split('\"') # (5): s2=['print', 'helln', ';print123'] (40): s2=[';tuptuo;evmos;', '2B', 'daer'] ... (236): s2=['1', '33', '111']\n s1 = s1.split('\"') # (6): s1=['print', 'hello', ';print133'] (41): s1=['read', 'B1input', ';solve;output;'] ... (237): s1=['11', '22', '11']\n \n \n count = 0 # (7): count=0 (42): count=0 ... (238): count=0\n isTmp = False # (8): isTmp=False (43): NO CHANGE ... (239): NO CHANGE\n if s1[0] == '\"' and s2[0] == '\"': # (9): NO CHANGE (44): NO CHANGE ... (240): NO CHANGE\n isTmp = True\n\n for i in range(len(s1)): # (10): i=0 (17): i=1 ... (241): i=0\n if len(s1) != len(s2): # (11): NO CHANGE (18): NO CHANGE ... (242): NO CHANGE\n print(\"DIFFERENT\") # (112): NO CHANGE (179): NO CHANGE\n break # (113): NO CHANGE (180): NO CHANGE\n if count > 1: # (12): NO CHANGE (19): NO CHANGE ... (243): NO CHANGE\n print(\"DIFFERENT\") # (97): NO CHANGE\n break # (98): NO CHANGE\n\n if not isTmp: # (13): NO CHANGE (20): NO CHANGE ... (244): NO CHANGE\n if i % 2 == 0: # (14): NO CHANGE (21): NO CHANGE ... (245): NO CHANGE\n if s1[i] != s2[i]: # (15): NO CHANGE (30): NO CHANGE ... (246): NO CHANGE\n print(\"DIFFERENT\"); # (31): NO CHANGE (51): NO CHANGE ... (247): NO CHANGE\n break # (32): NO CHANGE (52): NO CHANGE ... (248): NO CHANGE\n if i % 2 == 1: # (16): NO CHANGE (22): NO CHANGE ... (227): NO CHANGE\n if s1[i] != s2[i]: # (23): NO CHANGE (77): NO CHANGE ... (220): NO CHANGE\n count += 1 # (24): count=1 (78): count=1 ... (206): count=1\n else:\n if i+1 % 2 == 0:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\");\n break\n if i+1 % 2 == 1:\n if s1[i] != s2[i]:\n count += 1\n\n if count == 1: # (33): NO CHANGE (53): NO CHANGE ... (249): NO CHANGE\n print(\"CLOSE\") # (34): NO CHANGE (230): NO CHANGE\n\n"], "anno_status": [false], "diff_content": " while True:\n s1 = input()\n if s1 == '.':\n break\n s2 = input()\n \n if s1 == s2:\n print(\"IDENTICAL\")\n continue\n \n s2 = s2.split('\"')\n s1 = s1.split('\"')\n \n \n count = 0\n isTmp = False\n if s1[0] == '\"' and s2[0] == '\"':\n isTmp = True\n \n+ hoge = True\n for i in range(len(s1)):\n if len(s1) != len(s2):\n print(\"DIFFERENT\")\n+ hoge = False\n break\n if count > 1:\n print(\"DIFFERENT\")\n+ hoge = False\n break\n \n if not isTmp:\n if i % 2 == 0:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\");\n+ hoge = False\n break\n if i % 2 == 1:\n if s1[i] != s2[i]:\n count += 1\n else:\n if i+1 % 2 == 0:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\");\n+ hoge = False\n break\n if i+1 % 2 == 1:\n if s1[i] != s2[i]:\n count += 1\n \n- if count == 1:\n+ if count == 1 and hoge:\n print(\"CLOSE\")\n \n \n", "FL_content": "\n while True:\n s1 = input()\n if s1 == '.':\n break\n s2 = input()\n \n if s1 == s2:\n print(\"IDENTICAL\")\n continue\n \n s2 = s2.split('\"')\n s1 = s1.split('\"')\n \n \n count = 0\n isTmp = False\n if s1[0] == '\"' and s2[0] == '\"':\n isTmp = True\n \n for i in range(len(s1)):\n if len(s1) != len(s2):\n print(\"DIFFERENT\")\n break\n if count > 1:\n print(\"DIFFERENT\")\n break\n \n if not isTmp:\n if i % 2 == 0:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\");\n break\n if i % 2 == 1:\n if s1[i] != s2[i]:\n count += 1\n else:\n if i+1 % 2 == 0:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\");\n break\n if i+1 % 2 == 1:\n if s1[i] != s2[i]:\n count += 1\n \n if count == 1:\n print(\"CLOSE\")\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 48 }, { "user_id": "u984529214", "problem_id": "p03523", "submission1_id": "s695871062-FL", "submission2_id": "s867687911", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import re\nakb_re = re.compile(r'A?KIHA?BA?RA?$')\n\ns = input()\nmo = akb_re.match(s)\nif mo == None:\n print('No')\nelse:\n print('Yes')\n", "code2": "import re\nakb_re = re.compile(r'A?KIHA?BA?RA?$')\n\ns = input()\nmo = akb_re.match(s)\nif mo == None:\n print('NO')\nelse:\n print('YES')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591280849", "date2": "1591280892", "bleu_score": "0.9540661273198089", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "IAB@@BHJQ\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["import re\nakb_re = re.compile(r'A?KIHA?BA?RA?$') # (0): akb_re=re.compile('A?KIHA?BA?RA?$')\n\ns = input() # (1): s=IAB@@BHJQ\nmo = akb_re.match(s) # (2): mo=None\nif mo == None: # (3): NO CHANGE\n print('No')\nelse:\n print('Yes')\n"], "anno_status": [true], "diff_content": " import re\n akb_re = re.compile(r'A?KIHA?BA?RA?$')\n \n s = input()\n mo = akb_re.match(s)\n if mo == None:\n- print('No')\n+ print('NO')\n else:\n- print('Yes')\n+ print('YES')\n \n", "FL_content": "\n import re\n-akb_re = re.compile(r'A?KIHA?BA?RA?$')\n \n s = input()\n mo = akb_re.match(s)\n if mo == None:\n- print('No')\n else:\n- print('Yes')\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u925364229", "problem_id": "p03297", "submission1_id": "s404826719-FL", "submission2_id": "s478282408", "status1": "Wrong Answer", "status2": "Accepted", "code1": "T = int(input())\n\ndef gcd (a: int,b: int) -> int:\n if a < b: a,b = b,a\n return a if b == 0 else gcd(b,a%b)\ndef lcm (a: int,b: int) -> int:\n return a \n\n\nfor i in range(T):\n A,B,C,D = map(int,input().split(\" \"))\n g = gcd(B,D)\n if C >= ((B - g) + (A % g)):\n print(\"Yes\")\n else:\n print(\"No\")\n\n\n", "code2": "T = int(input())\n\ndef gcd (a: int,b: int) -> int:\n if a < b: a,b = b,a\n return a if b == 0 else gcd(b,a%b)\ndef lcm (a: int,b: int) -> int:\n return a \n\n\nfor i in range(T):\n A,B,C,D = map(int,input().split(\" \"))\n g = gcd(B,D)\n if A < B or D < B:\n print(\"No\")\n continue\n if C >= ((B - g) + (A % g)):\n print(\"Yes\")\n else:\n print(\"No\")\n\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1552779546", "date2": "1552779725", "bleu_score": "0.8435448311520366", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1], "code1_test_score": 52, "total_score": 102, "input": "14\n9 7 5 9\n9 7 6 9\n14 10 7 12\n14 10 15 3\n14 10 9 12\n22 10 7 11\n14 10 8 11\n14 10 9 11\n9 17 3 10\n10 11 5 10\n11 10 5 10\n16 10 5 10\n1000000000100000000 17 14 999999999999999985\n1000001000000000000 16 15 999999999999999985\n", "actual_output": "No\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nNo\nYes\nNo\nYes\nYes\n", "expected_output": "No\nYes\nNo\nNo\nYes\nNo\nNo\nYes\nNo\nNo\nYes\nNo\nYes\nYes\n\n", "anno_code": ["T = int(input()) # (0): T=14\n\ndef gcd (a: int,b: int) -> int: # (1): gcd=\n if a < b: a,b = b,a # (6): b=2 (7): a=2, b=1 ... (113): T=14, gcd=, lcm=, i=13, A=1000001000000000000, B=16, C=15, D=999999999999999985, g=1\n return a if b == 0 else gcd(b,a%b)\ndef lcm (a: int,b: int) -> int: # (2): lcm=\n return a \n\n\nfor i in range(T): # (3): i=0 (12): i=1 ... (108): i=13\n A,B,C,D = map(int,input().split(\" \")) # (4): A=9, B=7, C=5, D=9 (13): C=6 ... (109): A=1000001000000000000, B=16, C=15\n g = gcd(B,D) # (5): a=7, b=9 (14): a=7, b=9 ... (110): a=16, b=999999999999999985\n if C >= ((B - g) + (A % g)): # (10): NO CHANGE (19): NO CHANGE ... (114): NO CHANGE\n print(\"Yes\") # (20): NO CHANGE (36): NO CHANGE ... (115): NO CHANGE\n else:\n print(\"No\") # (11): NO CHANGE (28): NO CHANGE ... (100): NO CHANGE\n\n\n"], "anno_status": [false], "diff_content": " T = int(input())\n \n def gcd (a: int,b: int) -> int:\n if a < b: a,b = b,a\n return a if b == 0 else gcd(b,a%b)\n def lcm (a: int,b: int) -> int:\n return a \n \n \n for i in range(T):\n A,B,C,D = map(int,input().split(\" \"))\n g = gcd(B,D)\n+ if A < B or D < B:\n+ print(\"No\")\n+ continue\n if C >= ((B - g) + (A % g)):\n print(\"Yes\")\n else:\n print(\"No\")\n \n \n \n", "FL_content": "\n T = int(input())\n \n def gcd (a: int,b: int) -> int:\n if a < b: a,b = b,a\n return a if b == 0 else gcd(b,a%b)\n def lcm (a: int,b: int) -> int:\n return a \n \n \n for i in range(T):\n A,B,C,D = map(int,input().split(\" \"))\n g = gcd(B,D)\n- if C >= ((B - g) + (A % g)):\n print(\"Yes\")\n else:\n print(\"No\")\n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u896741788", "problem_id": "p03556", "submission1_id": "s889689896-FL", "submission2_id": "s943855604", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nfor i in range(1,10**3+2):\n if i**2>n:print((i-1)**2);exit()\n", "code2": "n=int(input())\nfor i in range(1,10**5+2):\n if i**2>n:print((i-1)**2);exit()\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600017318", "date2": "1600017400", "bleu_score": "0.9665395661812441", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0], "code1_test_score": 26, "total_score": 83, "input": "155815094\n", "actual_output": "no output\n", "expected_output": "155800324\n\n", "anno_code": ["n=int(input()) # (0): n=155815094\nfor i in range(1,10**3+2): # (1): i=1 (3): i=2 ... (2001): i=1001\n if i**2>n:print((i-1)**2);exit() # (2): NO CHANGE (4): NO CHANGE ... (2002): NO CHANGE\n"], "anno_status": [true], "diff_content": " n=int(input())\n-for i in range(1,10**3+2):\n+for i in range(1,10**5+2):\n if i**2>n:print((i-1)**2);exit()\n \n", "FL_content": "\n n=int(input())\n-for i in range(1,10**3+2):\n- if i**2>n:print((i-1)**2);exit()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 4 }, { "user_id": "u265506056", "problem_id": "p02555", "submission1_id": "s339144390-FL", "submission2_id": "s067874684", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S=int(input())\nMOD=10**9+7\ndp=[0]*(S+1)\ndp[0]=1\nfor i in range(1,S+1):\n for j in range(0,S-2):\n dp[i]+=dp[j]\n dp[i]%=MOD\nprint(dp[S])", "code2": "S=int(input())\nMOD=10**9+7\ndp=[0]*(S+1)\ndp[0]=1\nfor i in range(1,S+1):\n for j in range(0,i-2):\n dp[i]+=dp[j]\n dp[i]%=MOD\nprint(dp[S])", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600072029", "date2": "1600072256", "bleu_score": "0.9830775224759908", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "1175\n", "actual_output": "245605920\n", "expected_output": "531468532\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " S=int(input())\n MOD=10**9+7\n dp=[0]*(S+1)\n dp[0]=1\n for i in range(1,S+1):\n- for j in range(0,S-2):\n+ for j in range(0,i-2):\n dp[i]+=dp[j]\n dp[i]%=MOD\n print(dp[S])\n", "FL_content": "\n S=int(input())\n MOD=10**9+7\n dp=[0]*(S+1)\n dp[0]=1\n for i in range(1,S+1):\n- for j in range(0,S-2):\n dp[i]+=dp[j]\n dp[i]%=MOD\n print(dp[S])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u405027099", "problem_id": "p02318", "submission1_id": "s542578808-FL", "submission2_id": "s517676136", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n for i in range(len(X)):\n f[i][0]=i\n for j in range(len(Y)):\n f[0][j]=j\n for i in range(len(X)+1):\n for j in range(len(Y)+1):\n if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n\nX=input()\nY=input()\n\nprint(levenshtein(X,Y))\n\n", "code2": "def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n for i in range(len(X)+1):\n f[i][0]=i\n for j in range(len(Y)+1):\n f[0][j]=j\n for i in range(1,len(X)+1):\n for j in range(1,len(Y)+1):\n if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n\nX=input()\nY=input()\n\nprint(levenshtein(X,Y))\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1531820131", "date2": "1531820628", "bleu_score": "0.9720780517361597", "code1_test_status": [1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1], "code1_test_score": 65, "total_score": 102, "input": "cc`b\nncd\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["def levenshtein(X,Y): # (0): levenshtein=\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)] # (4): f\n for i in range(len(X)): # (5): i=0 (7): i=1 ... (13): NO CHANGE\n f[i][0]=i # (6): NO CHANGE (8): f ... (12): f\n for j in range(len(Y)): # (14): j=0 (16): j=1 ... (20): NO CHANGE\n f[0][j]=j # (15): NO CHANGE (17): f (19): f\n for i in range(len(X)+1): # (21): i=0 (35): i=1 ... (77): i=4\n for j in range(len(Y)+1): # (22): j=0 (25): j=1 ... (90): NO CHANGE\n if X[i-1]==Y[j-1]: # (23): NO CHANGE (26): NO CHANGE ... (88): NO CHANGE\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]) # (44): f (58): f\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1) # (24): f (27): NO CHANGE ... (89): f\n return f[len(X)][len(Y)]\n\nX=input() # (1): X=cc`b\nY=input() # (2): Y=ncd\n\nprint(levenshtein(X,Y)) # (3): NO CHANGE\n\n"], "anno_status": [true], "diff_content": " def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n- for i in range(len(X)):\n+ for i in range(len(X)+1):\n f[i][0]=i\n- for j in range(len(Y)):\n+ for j in range(len(Y)+1):\n f[0][j]=j\n- for i in range(len(X)+1):\n- for j in range(len(Y)+1):\n+ for i in range(1,len(X)+1):\n+ for j in range(1,len(Y)+1):\n if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n \n X=input()\n Y=input()\n \n print(levenshtein(X,Y))\n \n \n", "FL_content": "\n def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n for i in range(len(X)):\n f[i][0]=i\n for j in range(len(Y)):\n f[0][j]=j\n for i in range(len(X)+1):\n for j in range(len(Y)+1):\n- if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n \n X=input()\n Y=input()\n \n print(levenshtein(X,Y))\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u983357959", "problem_id": "p02830", "submission1_id": "s317215857-FL", "submission2_id": "s991091361", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ns,t = map(str,input().split())\ns = list(s)\nt = list(t)\nans =[]\nprint(s)\nfor i in range(n):\n ans.append(s[i])\n ans.append(t[i])\n''.join(ans)\n\n\nprint(ans)\n\n", "code2": "n = int(input())\ns,t = map(str,input().split())\ns = list(s)\nt = list(t)\nans =[]\n\nfor i in range(n):\n ans.append(s[i])\n ans.append(t[i])\n\nans2 = ''.join(ans)\n\n\nprint(ans2)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579048130", "date2": "1579048284", "bleu_score": "0.9259028043287267", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "2\nip dc\n", "actual_output": "['i', 'p']\n['i', 'd', 'p', 'c']\n", "expected_output": "idpc\n\n", "anno_code": ["n = int(input()) # (0): n=2\ns,t = map(str,input().split()) # (1): s=ip, t=dc\ns = list(s) # (2): s=['i', 'p']\nt = list(t) # (3): t=['d', 'c']\nans =[] # (4): ans=[]\nprint(s) # (5): NO CHANGE\nfor i in range(n): # (6): i=0 (9): i=1 (12): NO CHANGE\n ans.append(s[i]) # (7): ans=['i'] (10): ans=['i', 'd', 'p']\n ans.append(t[i]) # (8): ans=['i', 'd'] (11): ans=['i', 'd', 'p', 'c']\n''.join(ans) # (13): NO CHANGE\n\n\nprint(ans)\n\n"], "anno_status": [true], "diff_content": " n = int(input())\n s,t = map(str,input().split())\n s = list(s)\n t = list(t)\n ans =[]\n-print(s)\n+\n for i in range(n):\n ans.append(s[i])\n ans.append(t[i])\n-''.join(ans)\n+\n+ans2 = ''.join(ans)\n \n \n-print(ans)\n+print(ans2)\n \n \n", "FL_content": "\n n = int(input())\n s,t = map(str,input().split())\n s = list(s)\n t = list(t)\n ans =[]\n-print(s)\n for i in range(n):\n ans.append(s[i])\n ans.append(t[i])\n ''.join(ans)\n \n \n-print(ans)\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u397953026", "problem_id": "p03147", "submission1_id": "s093805830-FL", "submission2_id": "s648780584", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nh = list(map(int,input().split()))\nans = 0\ntmp = 0\nfor i in range(len(h)):\n print(h[i])\n if tmp < h[i]:\n ans += h[i] - tmp\n tmp = h[i]\nprint(ans)", "code2": "n = int(input())\nh = list(map(int,input().split()))\nans = 0\ntmp = 0\nfor i in range(len(h)):\n if tmp < h[i]:\n ans += h[i] - tmp\n tmp = h[i]\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592966710", "date2": "1592966729", "bleu_score": "0.9059551911095096", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 99, "input": "8\n6 23 15 0 23 1 50 100\n", "actual_output": "6\n23\n15\n0\n23\n1\n50\n100\n145\n", "expected_output": "145\n\n", "anno_code": ["n = int(input()) # (0): n=8\nh = list(map(int,input().split())) # (1): h=[6, 23, 15, 0, 23, 1, 50, 100]\nans = 0 # (2): ans=0\ntmp = 0 # (3): tmp=0\nfor i in range(len(h)): # (4): i=0 (9): i=1 ... (41): NO CHANGE\n print(h[i]) # (5): NO CHANGE (10): NO CHANGE ... (37): NO CHANGE\n if tmp < h[i]: # (6): NO CHANGE (11): NO CHANGE ... (38): NO CHANGE\n ans += h[i] - tmp # (7): ans=6 (12): ans=23 ... (39): ans=145\n tmp = h[i] # (8): tmp=6 (13): tmp=23 ... (40): tmp=100\nprint(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n h = list(map(int,input().split()))\n ans = 0\n tmp = 0\n for i in range(len(h)):\n- print(h[i])\n if tmp < h[i]:\n ans += h[i] - tmp\n tmp = h[i]\n print(ans)\n", "FL_content": "\n n = int(input())\n h = list(map(int,input().split()))\n ans = 0\n tmp = 0\n for i in range(len(h)):\n- print(h[i])\n if tmp < h[i]:\n ans += h[i] - tmp\n tmp = h[i]\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u391875425", "problem_id": "p03433", "submission1_id": "s834733603-FL", "submission2_id": "s491830108", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nA=int(input())\nif(A!=0):\n if(N%A<=A):\n print(\"Yes\")\nelif(N%500==0):\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "N=int(input())\nA=int(input())\nif(A!=0):\n if(N%500<=A):\n print(\"Yes\")\n else:\n print(\"No\")\nelif(N%500==0):\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1519006358", "date2": "1519006750", "bleu_score": "0.8040005618911951", "code1_test_status": [0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 26, "total_score": 103, "input": "2763\n-196\n", "actual_output": "no output\n", "expected_output": "No\n\n", "anno_code": ["N=int(input()) # (0): N=2763\nA=int(input()) # (1): A=-196\nif(A!=0): # (2): NO CHANGE\n if(N%A<=A):\n print(\"Yes\")\nelif(N%500==0):\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " N=int(input())\n A=int(input())\n if(A!=0):\n- if(N%A<=A):\n+ if(N%500<=A):\n print(\"Yes\")\n+ else:\n+ print(\"No\")\n elif(N%500==0):\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": "\n N=int(input())\n A=int(input())\n if(A!=0):\n- if(N%A<=A):\n- print(\"Yes\")\n elif(N%500==0):\n- print(\"Yes\")\n else:\n- print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u356832650", "problem_id": "p03977", "submission1_id": "s858391916-FL", "submission2_id": "s144717245", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from heapq import heappush, heappop\nT = int(input())\n\nfor i in range(T):\n N, D = map(int, input().split())\n ans = D\n h = []\n heappush(h,D)\n for _ in range(N - 1):\n k = heappop(h)\n z = bin(k)[2:].zfill(7)\n t = int(z,2)\n heappush(h,t)\n ans += (127 + t - k)\n print(ans)\n\n", "code2": "from heapq import heappush, heappop\nT = int(input())\nA = []\nfor i in range(T):\n N, D = map(int, input().split())\n ans = D\n h = []\n heappush(h,D)\n for _ in range(N - 1):\n k = heappop(h)\n t = 127 ^ k\n heappush(h,t)\n ans += (127 + t - k)\n A.append(ans)\nfor i in range(len(A)):\n print(A[i])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1505343418", "date2": "1505357275", "bleu_score": "0.8574649645290368", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 6, "total_score": 101, "input": "3\n1 1\n6 25\n1 18\n", "actual_output": "1\n660\n18\n", "expected_output": "1\n737\n18\n\n", "anno_code": ["from heapq import heappush, heappop\nT = int(input()) # (0): T=3\n\nfor i in range(T): # (1): i=0 (8): i=1 (45): i=2\n N, D = map(int, input().split()) # (2): N=1, D=1 (9): N=6, D=25 (46): N=1, D=18\n ans = D # (3): ans=1 (10): ans=25 (47): ans=18\n h = [] # (4): h=[] (11): h=[] (48): h=[]\n heappush(h,D) # (5): h=[1] (12): h=[25] (49): h=[18]\n for _ in range(N - 1): # (6): NO CHANGE (13): _=0 ... (50): NO CHANGE\n k = heappop(h) # (14): h=[], k=25 (20): h=[] ... (38): h=[]\n z = bin(k)[2:].zfill(7) # (15): z=0011001 (21): NO CHANGE ... (39): NO CHANGE\n t = int(z,2) # (16): t=25 (22): NO CHANGE ... (40): NO CHANGE\n heappush(h,t) # (17): h=[25] (23): h=[25] ... (41): h=[25]\n ans += (127 + t - k) # (18): ans=152 (24): ans=279 ... (42): ans=660\n print(ans) # (7): NO CHANGE (44): NO CHANGE (51): NO CHANGE\n\n"], "anno_status": [true], "diff_content": " from heapq import heappush, heappop\n T = int(input())\n-\n+A = []\n for i in range(T):\n N, D = map(int, input().split())\n ans = D\n h = []\n heappush(h,D)\n for _ in range(N - 1):\n k = heappop(h)\n- z = bin(k)[2:].zfill(7)\n- t = int(z,2)\n+ t = 127 ^ k\n heappush(h,t)\n ans += (127 + t - k)\n- print(ans)\n-\n+ A.append(ans)\n+for i in range(len(A)):\n+ print(A[i])\n \n", "FL_content": "\n from heapq import heappush, heappop\n T = int(input())\n \n for i in range(T):\n N, D = map(int, input().split())\n ans = D\n h = []\n heappush(h,D)\n for _ in range(N - 1):\n k = heappop(h)\n- z = bin(k)[2:].zfill(7)\n t = int(z,2)\n heappush(h,t)\n ans += (127 + t - k)\n print(ans)\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u878849567", "problem_id": "p04039", "submission1_id": "s777756045-FL", "submission2_id": "s673262176", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int, input().split())\nd = list(input().split())\nans = 100000\nfor i in range(n, 10001):\n for j in range(k):\n if d[j] in str(i):\n break\n else:\n if ans > i:\n ans = i\nprint(ans)\n", "code2": "n, k = map(int, input().split())\nd = list(input().split())\nans = 100000\nfor i in range(n, 100001):\n for j in range(k):\n if d[j] in str(i):\n break\n else:\n if ans > i:\n ans = i\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586197635", "date2": "1586197924", "bleu_score": "0.9955848811461051", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 72, "total_score": 94, "input": "19727 1\n0\n", "actual_output": "100000\n", "expected_output": "19727\n\n", "anno_code": ["n, k = map(int, input().split()) # (0): n=19727, k=1\nd = list(input().split()) # (1): d=['0']\nans = 100000 # (2): ans=100000\nfor i in range(n, 10001): # (3): NO CHANGE\n for j in range(k):\n if d[j] in str(i):\n break\n else:\n if ans > i:\n ans = i\nprint(ans)\n"], "anno_status": [true], "diff_content": " n, k = map(int, input().split())\n d = list(input().split())\n ans = 100000\n-for i in range(n, 10001):\n+for i in range(n, 100001):\n for j in range(k):\n if d[j] in str(i):\n break\n else:\n if ans > i:\n ans = i\n print(ans)\n \n", "FL_content": "\n n, k = map(int, input().split())\n-d = list(input().split())\n ans = 100000\n-for i in range(n, 10001):\n for j in range(k):\n if d[j] in str(i):\n break\n else:\n if ans > i:\n ans = i\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u150641538", "problem_id": "p02839", "submission1_id": "s141266036-FL", "submission2_id": "s248683558", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ndef input():\n return sys.stdin.readline()[:-1]\nh,w=map(int,input().split())\na=[list(map(int,input().split())) for i in range(h)]\nb=[list(map(int,input().split())) for i in range(h)]\nd=[[0 for i in range(w)] for j in range(h)]\nmaxd=1\nfor i in range(h):\n for j in range(w):\n d[i][j] = abs(a[i][j]-b[i][j])\n maxd=max(maxd,d[i][j])\ndp=[[0 for j in range(w)] for k in range(h)]\nc=20000\ndp[0][0] |= 1 << c+d[0][0]\nfor i in range(h):\n for j in range(w):\n if i+1> d[i+1][j]\n if j+1> d[i][j+1]\nm=1000000\ncnt = 0\nfor x in bin(dp[h-1][w-1])[2:][::-1]:\n m=min(m,abs(cnt-c))\n cnt+=1\nprint(m)", "code2": "import sys\ndef input():\n return sys.stdin.readline()[:-1]\nh,w=map(int,input().split())\na=[list(map(int,input().split())) for i in range(h)]\nb=[list(map(int,input().split())) for i in range(h)]\nd=[[0 for i in range(w)] for j in range(h)]\nmaxd=1\nfor i in range(h):\n for j in range(w):\n d[i][j] = abs(a[i][j]-b[i][j])\n maxd=max(maxd,d[i][j])\ndp=[[0 for j in range(w)] for k in range(h)]\nc=20000\ndp[0][0] |= 1 << c+d[0][0]\nfor i in range(h):\n for j in range(w):\n if i+1> d[i+1][j]\n if j+1> d[i][j+1]\nm=1000000\ncnt = 0\nfor x in bin(dp[h-1][w-1])[2:][::-1]:\n if x=='1':\n m=min(m,abs(cnt-c))\n cnt+=1\nprint(m)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575867402", "date2": "1575867461", "bleu_score": "0.9769836035581076", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 2, "total_score": 102, "input": "1 3\n0 7 1\n80 1 1\n1 2 5\n6 4 6\n", "actual_output": "0\n", "expected_output": "74\n\n", "anno_code": ["源代码执行有误\nTraceback (most recent call last):\n\n File \"G:\\Projects\\Python\\SummerProject\\CodeRepair\\Project\\CodeTest\\AutoComment\\tracer6_2_copy.py\", line 224, in \n\n add_comment_to_new_file(target_script, update_dict, to_file)\n\n File \"G:\\Projects\\Python\\SummerProject\\CodeRepair\\Project\\CodeTest\\AutoComment\\tracer6_2_copy.py\", line 161, in add_comment_to_new_file\n\n formatted_changes = [f\"({step}): {format_vars(change)}\" if change != \"NO CHANGE\" else f\"({step}): NO CHANGE\" for step, change in changes]\n\n File \"G:\\Projects\\Python\\SummerProject\\CodeRepair\\Project\\CodeTest\\AutoComment\\tracer6_2_copy.py\", line 161, in \n\n formatted_changes = [f\"({step}): {format_vars(change)}\" if change != \"NO CHANGE\" else f\"({step}): NO CHANGE\" for step, change in changes]\n\n File \"G:\\Projects\\Python\\SummerProject\\CodeRepair\\Project\\CodeTest\\AutoComment\\tracer6_2_copy.py\", line 126, in format_vars\n\n value_str = str(value).replace('\\n', ' ')\n\nValueError: Exceeds the limit (4300) for integer string conversion; use sys.set_int_max_str_digits() to increase the limit\n\n"], "anno_status": [true], "diff_content": " import sys\n def input():\n return sys.stdin.readline()[:-1]\n h,w=map(int,input().split())\n a=[list(map(int,input().split())) for i in range(h)]\n b=[list(map(int,input().split())) for i in range(h)]\n d=[[0 for i in range(w)] for j in range(h)]\n maxd=1\n for i in range(h):\n for j in range(w):\n d[i][j] = abs(a[i][j]-b[i][j])\n maxd=max(maxd,d[i][j])\n dp=[[0 for j in range(w)] for k in range(h)]\n c=20000\n dp[0][0] |= 1 << c+d[0][0]\n for i in range(h):\n for j in range(w):\n if i+1> d[i+1][j]\n if j+1> d[i][j+1]\n m=1000000\n cnt = 0\n for x in bin(dp[h-1][w-1])[2:][::-1]:\n- m=min(m,abs(cnt-c))\n+ if x=='1':\n+ m=min(m,abs(cnt-c))\n cnt+=1\n print(m)\n", "FL_content": "\n import sys\n def input():\n return sys.stdin.readline()[:-1]\n h,w=map(int,input().split())\n a=[list(map(int,input().split())) for i in range(h)]\n b=[list(map(int,input().split())) for i in range(h)]\n d=[[0 for i in range(w)] for j in range(h)]\n maxd=1\n for i in range(h):\n for j in range(w):\n d[i][j] = abs(a[i][j]-b[i][j])\n maxd=max(maxd,d[i][j])\n dp=[[0 for j in range(w)] for k in range(h)]\n c=20000\n dp[0][0] |= 1 << c+d[0][0]\n for i in range(h):\n for j in range(w):\n if i+1> d[i+1][j]\n if j+1> d[i][j+1]\n m=1000000\n cnt = 0\n for x in bin(dp[h-1][w-1])[2:][::-1]:\n m=min(m,abs(cnt-c))\n cnt+=1\n print(m)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 29 }, { "user_id": "u987164499", "problem_id": "p02958", "submission1_id": "s881415164-FL", "submission2_id": "s436191835", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\n\nn = int(stdin.readline().rstrip())\nli = list(map(int,stdin.readline().rstrip().split()))\nli_re = sorted(li)\n\npoint = 0\n\nwhile point < 2:\n for i in range(len(li)):\n if li_re[i] != li[i]:\n point += 1\n print(\"YES\")\n exit()\nprint(\"NO\")", "code2": "from sys import stdin\n\nn = int(stdin.readline().rstrip())\nli = list(map(int,stdin.readline().rstrip().split()))\nli_re = sorted(li)\n\npoint = 0\n\nfor i in range(len(li)):\n if li_re[i] != li[i]:\n point += 1\n\nif point > 2:\n print(\"NO\")\nelse:\n print(\"YES\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565906931", "date2": "1565907352", "bleu_score": "0.8883870735745846", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 1, "total_score": 100, "input": "5\n3 8 2 1 1\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " from sys import stdin\n \n n = int(stdin.readline().rstrip())\n li = list(map(int,stdin.readline().rstrip().split()))\n li_re = sorted(li)\n \n point = 0\n \n-while point < 2:\n- for i in range(len(li)):\n- if li_re[i] != li[i]:\n- point += 1\n+for i in range(len(li)):\n+ if li_re[i] != li[i]:\n+ point += 1\n+\n+if point > 2:\n+ print(\"NO\")\n+else:\n print(\"YES\")\n- exit()\n-print(\"NO\")\n", "FL_content": "\n from sys import stdin\n \n n = int(stdin.readline().rstrip())\n li = list(map(int,stdin.readline().rstrip().split()))\n li_re = sorted(li)\n \n point = 0\n \n-while point < 2:\n for i in range(len(li)):\n if li_re[i] != li[i]:\n point += 1\n print(\"YES\")\n exit()\n print(\"NO\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u126322807", "problem_id": "p02419", "submission1_id": "s910096975-FL", "submission2_id": "s352871496", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\ncontents = []\ncounter = 0\n\nword = input()\n\nwhile True:\n text = input()\n if text == \"END_OF_TEXT\":\n break\n textWords = text.split()\n contents.append(textWords)\n\nfor x in contents:\n for y in textWords:\n if y == word:\n counter += 1\n\nprint(counter)", "code2": "\n\ncontents = []\ncounter = 0\n\nword = input()\n\nwhile True:\n text = input()\n if text == \"END_OF_TEXT\":\n break\n textWords = text.split()\n contents.append(textWords)\n\nfor x in contents:\n for y in x:\n if y.lower() == word:\n counter += 1\n\nprint(counter)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1494435049", "date2": "1494435954", "bleu_score": "0.9611946054480403", "code1_test_status": [1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 90, "total_score": 101, "input": "computer\nNvrtures retupmoc scientists and highly-skilled computer engineers\nwho will create and tiolpxe \"knowledge\" for the enw .are\nProvides an outstanding computer environment.\nEND_OF_TEXT\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["\n\ncontents = [] # (0): contents=[]\ncounter = 0 # (1): counter=0\n\nword = input() # (2): word=computer\n\nwhile True: # (3): NO CHANGE (8): NO CHANGE ... (18): contents\n text = input() # (4): text=Nvrtures retupmoc scientists and highly-skilled computer engineers (9): text=who will create and tiolpxe \"knowledge\" for the enw .are ... (19): contents, text=END_OF_TEXT\n if text == \"END_OF_TEXT\": # (5): NO CHANGE (10): NO CHANGE ... (20): contents\n break # (21): contents\n textWords = text.split() # (6): textWords=['Nvrtures', 'retupmoc', 'scientists', 'and', 'highly-skilled', 'computer', 'engineers'] (11): textWords=['who', 'will', 'create', 'and', 'tiolpxe', '\"knowledge\"', 'for', 'the', 'enw', '.are'] (16): contents, textWords=['Provides', 'an', 'outstanding', 'computer', 'environment.']\n contents.append(textWords) # (7): contents=[['Nvrtures', 'retupmoc', 'scientists', 'and', 'highly-skilled', 'computer', 'engineers']] (12): contents (17): contents\n\nfor x in contents: # (22): contents, x=['Nvrtures', 'retupmoc', 'scientists', 'and', 'highly-skilled', 'computer', 'engineers'] (35): contents, x=['who', 'will', 'create', 'and', 'tiolpxe', '\"knowledge\"', 'for', 'the', 'enw', '.are'] ... (61): contents\n for y in textWords: # (23): contents, y=Provides (25): contents, y=an ... (60): contents\n if y == word: # (24): contents (26): contents ... (59): contents\n counter += 1 # (31): contents, counter=1 (44): contents, counter=2 (57): contents, counter=3\n\nprint(counter)"], "anno_status": [true], "diff_content": " \n \n contents = []\n counter = 0\n \n word = input()\n \n while True:\n text = input()\n if text == \"END_OF_TEXT\":\n break\n textWords = text.split()\n contents.append(textWords)\n \n for x in contents:\n- for y in textWords:\n- if y == word:\n+ for y in x:\n+ if y.lower() == word:\n counter += 1\n \n print(counter)\n", "FL_content": "\n \n \n contents = []\n counter = 0\n \n word = input()\n \n while True:\n text = input()\n if text == \"END_OF_TEXT\":\n break\n textWords = text.split()\n contents.append(textWords)\n \n for x in contents:\n- for y in textWords:\n- if y == word:\n- counter += 1\n \n print(counter)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u698348858", "problem_id": "p03448", "submission1_id": "s728029278-FL", "submission2_id": "s213251245", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n \na = int(input())\nb = int(input())\nc = int(input())\nx = int(input())\n \ncnt = 0\nfor i in range(a):\n for j in range(b):\n for k in range(c):\n p = i * 500 + j * 100 + k * 50\n if p == x:\n cnt += 1\nprint(cnt)", "code2": "\n \na = int(input())\nb = int(input())\nc = int(input())\nx = int(input())\n \ncnt = 0\nfor i in range(a + 1):\n for j in range(b + 1):\n for k in range(c + 1):\n p = i * 500 + j * 100 + k * 50\n if p > x:\n break\n if p == x:\n cnt += 1\nprint(cnt)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576168487", "date2": "1576168810", "bleu_score": "0.8246940430544284", "code1_test_status": [1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0], "code1_test_score": 92, "total_score": 103, "input": "5\n0\n0\n0\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["\n \na = int(input()) # (0): a=5\nb = int(input()) # (1): b=0\nc = int(input()) # (2): c=0\nx = int(input()) # (3): x=0\n \ncnt = 0 # (4): cnt=0\nfor i in range(a): # (5): i=0 (7): i=1 ... (15): NO CHANGE\n for j in range(b): # (6): NO CHANGE (8): NO CHANGE ... (14): NO CHANGE\n for k in range(c):\n p = i * 500 + j * 100 + k * 50\n if p == x:\n cnt += 1\nprint(cnt)"], "anno_status": [true], "diff_content": " \n \n a = int(input())\n b = int(input())\n c = int(input())\n x = int(input())\n \n cnt = 0\n-for i in range(a):\n- for j in range(b):\n- for k in range(c):\n+for i in range(a + 1):\n+ for j in range(b + 1):\n+ for k in range(c + 1):\n p = i * 500 + j * 100 + k * 50\n+ if p > x:\n+ break\n if p == x:\n cnt += 1\n print(cnt)\n", "FL_content": "\n \n \n a = int(input())\n b = int(input())\n c = int(input())\n x = int(input())\n \n cnt = 0\n-for i in range(a):\n- for j in range(b):\n- for k in range(c):\n p = i * 500 + j * 100 + k * 50\n if p == x:\n cnt += 1\n print(cnt)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u695811449", "problem_id": "p02867", "submission1_id": "s893635684-FL", "submission2_id": "s239741982", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nN=int(input())\nA=list(map(int,input().split()))\nB=list(map(int,input().split()))\n\ncompression_dict={a: ind+1 for ind, a in enumerate(sorted(set(A)|set(B)))}\n\nSA=sorted(A)\nSB=sorted(B)\n\nfor i in range(N):\n if SA[i]>SB[i]:\n print(\"No\")\n sys.exit()\n\nfor i in range(N-1):\n if SB[i]>SA[i+1]:\n print(\"Yes\")\n sys.exit()\n\nAB=[(B[i],A[i]) for i in range(N)]\nAB.sort()\n\nDICT={a:ind for ind,a in enumerate(A)}\n\nGroup=[i for i in range(N)]\n\ndef find(x):\n while Group[x] != x:\n x=Group[x]\n return x\n\ndef Union(x,y): \n if find(x) != find(y):\n Group[find(y)]=Group[find(x)]=min(find(y),find(x))\n\nfor i in range(N):\n _,a=AB[i]\n\n Union(DICT[a],i)\n\nif len(set([find(i) for i in range(N)]))==1:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "code2": "import sys\ninput = sys.stdin.readline\n\nN=int(input())\nA=list(map(int,input().split()))\nB=list(map(int,input().split()))\n\ncompression_dict={a: ind+1 for ind, a in enumerate(sorted(set(A)|set(B)))}\n\nSA=sorted(A)\nSB=sorted(B)\n\nfor i in range(N):\n if SA[i]>SB[i]:\n print(\"No\")\n sys.exit()\n\nfor i in range(N-1):\n if SB[i]>=SA[i+1]:\n print(\"Yes\")\n sys.exit()\n\nAB=[(B[i],A[i]) for i in range(N)]\nAB.sort()\n\nDICT={a:ind for ind,a in enumerate(SA)}\n\nGroup=[i for i in range(N)]\n\ndef find(x):\n while Group[x] != x:\n x=Group[x]\n return x\n\ndef Union(x,y): \n if find(x) != find(y):\n Group[find(y)]=Group[find(x)]=min(find(y),find(x))\n\nfor i in range(N):\n _,a=AB[i]\n\n Union(DICT[a],i)\n\nif len(set([find(i) for i in range(N)]))==1:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1573369953", "date2": "1573370675", "bleu_score": "0.9938912164221279", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 100, "total_score": 103, "input": "3\n2 3 2\n5 2 3\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\nN=int(input()) # (1): N=3\nA=list(map(int,input().split())) # (2): A=[2, 3, 2]\nB=list(map(int,input().split())) # (3): B=[5, 2, 3]\n\ncompression_dict={a: ind+1 for ind, a in enumerate(sorted(set(A)|set(B)))} # (4): compression_dict={2: 1, 3: 2, 5: 3}\n\nSA=sorted(A) # (5): SA=[2, 2, 3]\nSB=sorted(B) # (6): SB=[2, 3, 5]\n\nfor i in range(N): # (7): i=0 (9): i=1 ... (13): NO CHANGE\n if SA[i]>SB[i]: # (8): NO CHANGE (10): NO CHANGE (12): NO CHANGE\n print(\"No\")\n sys.exit()\n\nfor i in range(N-1): # (14): i=0 (16): i=1 (18): NO CHANGE\n if SB[i]>SA[i+1]: # (15): NO CHANGE (17): NO CHANGE\n print(\"Yes\")\n sys.exit()\n\nAB=[(B[i],A[i]) for i in range(N)] # (19): AB=[(5, 2), (2, 3), (3, 2)]\nAB.sort() # (20): AB=[(2, 3), (3, 2), (5, 2)]\n\nDICT={a:ind for ind,a in enumerate(A)} # (21): DICT={2: 2, 3: 1}\n\nGroup=[i for i in range(N)] # (22): Group=[0, 1, 2]\n\ndef find(x): # (23): find=\n while Group[x] != x: # (29): x=0 (30): x=1, y=0 ... (71): sys=, input=, N=3, A=[2, 3, 2], B=[5, 2, 3], compression_dict={2: 1, 3: 2, 5: 3}, SA=[2, 2, 3], SB=[2, 3, 5], i=2, AB=[(2, 3), (3, 2), (5, 2)], DICT={2: 2, 3: 1}, Group=[0, 0, 0], find=, Union=, _=5, a=2\n x=Group[x] # (42): x=0 (46): x=0 ... (70): x=0\n return x\n\ndef Union(x,y): # (24): Union=\n if find(x) != find(y): # (28): NO CHANGE (39): NO CHANGE (56): NO CHANGE\n Group[find(y)]=Group[find(x)]=min(find(y),find(x)) # (31): x=0 (44): x=1\n\nfor i in range(N): # (25): i=0 (36): i=1 ... (63): NO CHANGE\n _,a=AB[i] # (26): _=2, a=3 (37): _=3, a=2 (54): _=5\n\n Union(DICT[a],i) # (27): x=1, y=0 (38): x=2, y=1 (55): x=2, y=2\n\nif len(set([find(i) for i in range(N)]))==1: # (64): x=0\n print(\"No\")\nelse:\n print(\"Yes\")\n"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n \n N=int(input())\n A=list(map(int,input().split()))\n B=list(map(int,input().split()))\n \n compression_dict={a: ind+1 for ind, a in enumerate(sorted(set(A)|set(B)))}\n \n SA=sorted(A)\n SB=sorted(B)\n \n for i in range(N):\n if SA[i]>SB[i]:\n print(\"No\")\n sys.exit()\n \n for i in range(N-1):\n- if SB[i]>SA[i+1]:\n+ if SB[i]>=SA[i+1]:\n print(\"Yes\")\n sys.exit()\n \n AB=[(B[i],A[i]) for i in range(N)]\n AB.sort()\n \n-DICT={a:ind for ind,a in enumerate(A)}\n+DICT={a:ind for ind,a in enumerate(SA)}\n \n Group=[i for i in range(N)]\n \n def find(x):\n while Group[x] != x:\n x=Group[x]\n return x\n \n def Union(x,y): \n if find(x) != find(y):\n Group[find(y)]=Group[find(x)]=min(find(y),find(x))\n \n for i in range(N):\n _,a=AB[i]\n \n Union(DICT[a],i)\n \n if len(set([find(i) for i in range(N)]))==1:\n print(\"No\")\n else:\n print(\"Yes\")\n \n", "FL_content": "\n import sys\n input = sys.stdin.readline\n \n N=int(input())\n A=list(map(int,input().split()))\n B=list(map(int,input().split()))\n \n compression_dict={a: ind+1 for ind, a in enumerate(sorted(set(A)|set(B)))}\n \n SA=sorted(A)\n SB=sorted(B)\n \n for i in range(N):\n if SA[i]>SB[i]:\n print(\"No\")\n sys.exit()\n \n for i in range(N-1):\n if SB[i]>SA[i+1]:\n print(\"Yes\")\n sys.exit()\n \n AB=[(B[i],A[i]) for i in range(N)]\n AB.sort()\n \n DICT={a:ind for ind,a in enumerate(A)}\n \n Group=[i for i in range(N)]\n \n def find(x):\n while Group[x] != x:\n x=Group[x]\n return x\n \n def Union(x,y): \n if find(x) != find(y):\n Group[find(y)]=Group[find(x)]=min(find(y),find(x))\n \n for i in range(N):\n _,a=AB[i]\n \n Union(DICT[a],i)\n \n if len(set([find(i) for i in range(N)]))==1:\n print(\"No\")\n else:\n print(\"Yes\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 48 }, { "user_id": "u519227872", "problem_id": "p02300", "submission1_id": "s764615546-FL", "submission2_id": "s319037633", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import sqrt\nfrom collections import deque\n\ndef sub(a, b):\n return [a[0] - b[0],a[1] - b[1]]\n\ndef cross(a, b):\n return a[0] * b[1] - a[1] * b[0]\n\ndef ccw(a, b, c):\n x = sub(b, a)\n y = sub(c, a)\n return cross(x, y) > 0\n\nn = int(input())\nc = [list(map(int, input().split())) for i in range(n)]\nc.sort(key=lambda x: (x[0], x[1]))\nU = deque(c[:2])\n\nfor i in range(2, n):\n j = len(U)\n while j >= 2 and ccw(U[-1],U[-2],c[i]):\n U.pop()\n j -= 1\n U.append(c[i])\n\nc = c[::-1]\nL = deque(c[:2])\n\nfor i in range(2, n):\n j = len(L)\n while j >= 2 and ccw(L[-1], L[-2], c[i]):\n L.pop()\n j -= 1\n L.append(c[i])\n\nans = U\nfor i in range(1,len(L)-1):\n x, y = L[i]\n ans.append([x,y])\n\ni = ans.index(sorted(ans, key=lambda x: (x[1],x[0]))[0])\nans = list(ans)\nfor x,y in ans[:i] + ans[i:]:\n print(x, y)\n", "code2": "from math import sqrt\nfrom collections import deque\n\ndef sub(a, b):\n return [a[0] - b[0],a[1] - b[1]]\n\ndef cross(a, b):\n return a[0] * b[1] - a[1] * b[0]\n\ndef ccw(a, b, c):\n x = sub(b, a)\n y = sub(c, a)\n return cross(x, y) > 0\n\nn = int(input())\nc = [list(map(int, input().split())) for i in range(n)]\nc.sort(key=lambda x: (x[0], x[1]))\nU = deque(c[:2])\n\nfor i in range(2, n):\n j = len(U)\n while j >= 2 and ccw(U[-1],U[-2],c[i]):\n U.pop()\n j -= 1\n U.append(c[i])\n\nc = c[::-1]\nL = deque(c[:2])\n\nfor i in range(2, n):\n j = len(L)\n while j >= 2 and ccw(L[-1], L[-2], c[i]):\n L.pop()\n j -= 1\n L.append(c[i])\n\nans = U\nfor i in range(1,len(L)-1):\n x, y = L[i]\n ans.append([x,y])\n\nprint(len(ans))\ni = ans.index(sorted(ans, key=lambda x: (x[1],x[0]))[0])\nans = list(ans)\nfor x,y in ans[i:] + ans[:i]:\n print(x, y)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1524410313", "date2": "1524410465", "bleu_score": "0.9791232505822159", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "7\n4 1\n0 1\n1 4\n3 0\n4 2\n1 3\n3 3\n", "actual_output": "0 1\n3 0\n4 1\n4 2\n3 3\n1 4\n", "expected_output": "6\n3 0\n4 1\n4 2\n3 3\n1 4\n0 1\n\n", "anno_code": ["from math import sqrt\nfrom collections import deque\n\ndef sub(a, b): # (0): sub=\n return [a[0] - b[0],a[1] - b[1]]\n\ndef cross(a, b): # (1): cross=\n return a[0] * b[1] - a[1] * b[0]\n\ndef ccw(a, b, c): # (2): ccw=\n x = sub(b, a) # (10): x=[-1, -2] (16): x=[0, -1] ... (93): x=[2, -1]\n y = sub(c, a) # (11): sqrt=, deque=, sub=, cross=, ccw=, n=7, c=[[0, 1], [1, 3], [1, 4], [3, 0], [3, 3], [4, 1], [4, 2]], U=deque([[0, 1], [3, 0], [4, 1], [4, 2], [3, 3], [1, 4]]), i=2, j=2 (17): sqrt=, deque=, sub=, cross=, ccw=, n=7, c=[[0, 1], [1, 3], [1, 4], [3, 0], [3, 3], [4, 1], [4, 2]], U=deque([[0, 1], [3, 0], [4, 1], [4, 2], [3, 3], [1, 4]]), i=3, j=3 ... (94): sqrt=, deque=, sub=, cross=, ccw=, n=7, c, U=deque([[0, 1], [3, 0], [4, 1], [4, 2], [3, 3], [1, 4]]), i=6, j=3, L=deque([[4, 2], [3, 3], [1, 4], [0, 1]])\n return cross(x, y) > 0\n\nn = int(input()) # (3): n=7\nc = [list(map(int, input().split())) for i in range(n)] # (4): c\nc.sort(key=lambda x: (x[0], x[1])) # (5): c\nU = deque(c[:2]) # (6): U=deque([[0, 1], [3, 0], [4, 1], [4, 2], [3, 3], [1, 4]])\n\nfor i in range(2, n): # (7): i=2 (13): i=3 ... (50): NO CHANGE\n j = len(U) # (8): j=2 (14): j=3 ... (45): j=3\n while j >= 2 and ccw(U[-1],U[-2],c[i]): # (9): a=[1, 3], b=[0, 1], c=[1, 4] (15): a=[1, 4], b=[1, 3], c=[3, 0] ... (46): a=[4, 1], b=[3, 0], c=[4, 2]\n U.pop() # (18): NO CHANGE (23): NO CHANGE (38): NO CHANGE\n j -= 1 # (19): j=2 (24): j=1 (39): j=2\n U.append(c[i]) # (12): NO CHANGE (26): NO CHANGE ... (49): NO CHANGE\n\nc = c[::-1] # (51): c\nL = deque(c[:2]) # (52): L=deque([[4, 2], [3, 3], [1, 4], [0, 1]])\n\nfor i in range(2, n): # (53): i=2 (62): i=3 ... (96): NO CHANGE\n j = len(L) # (54): j=2 (63): j=2 ... (86): j=4\n while j >= 2 and ccw(L[-1], L[-2], c[i]): # (55): a=[4, 1], b=[4, 2], c=[3, 3] (60): NO CHANGE ... (92): a=[1, 4], b=[3, 3], c=[0, 1]\n L.pop() # (58): NO CHANGE (73): NO CHANGE (90): NO CHANGE\n j -= 1 # (59): j=1 (74): j=2 (91): j=3\n L.append(c[i]) # (61): NO CHANGE (67): NO CHANGE ... (95): NO CHANGE\n\nans = U # (97): ans=deque([[0, 1], [3, 0], [4, 1], [4, 2], [3, 3], [1, 4]])\nfor i in range(1,len(L)-1): # (98): i=1 (101): i=2 (104): NO CHANGE\n x, y = L[i] # (99): x=3, y=3 (102): x=1, y=4\n ans.append([x,y]) # (100): NO CHANGE (103): NO CHANGE\n\ni = ans.index(sorted(ans, key=lambda x: (x[1],x[0]))[0]) # (105): i=1\nans = list(ans) # (106): NO CHANGE\nfor x,y in ans[:i] + ans[i:]: # (107): x=0, y=1 (109): x=3, y=0 ... (117): x=1, y=4\n print(x, y) # (108): NO CHANGE (110): NO CHANGE ... (118): NO CHANGE\n"], "anno_status": [false], "diff_content": " from math import sqrt\n from collections import deque\n \n def sub(a, b):\n return [a[0] - b[0],a[1] - b[1]]\n \n def cross(a, b):\n return a[0] * b[1] - a[1] * b[0]\n \n def ccw(a, b, c):\n x = sub(b, a)\n y = sub(c, a)\n return cross(x, y) > 0\n \n n = int(input())\n c = [list(map(int, input().split())) for i in range(n)]\n c.sort(key=lambda x: (x[0], x[1]))\n U = deque(c[:2])\n \n for i in range(2, n):\n j = len(U)\n while j >= 2 and ccw(U[-1],U[-2],c[i]):\n U.pop()\n j -= 1\n U.append(c[i])\n \n c = c[::-1]\n L = deque(c[:2])\n \n for i in range(2, n):\n j = len(L)\n while j >= 2 and ccw(L[-1], L[-2], c[i]):\n L.pop()\n j -= 1\n L.append(c[i])\n \n ans = U\n for i in range(1,len(L)-1):\n x, y = L[i]\n ans.append([x,y])\n \n+print(len(ans))\n i = ans.index(sorted(ans, key=lambda x: (x[1],x[0]))[0])\n ans = list(ans)\n-for x,y in ans[:i] + ans[i:]:\n+for x,y in ans[i:] + ans[:i]:\n print(x, y)\n \n", "FL_content": "\n from math import sqrt\n from collections import deque\n \n def sub(a, b):\n return [a[0] - b[0],a[1] - b[1]]\n \n def cross(a, b):\n return a[0] * b[1] - a[1] * b[0]\n \n def ccw(a, b, c):\n x = sub(b, a)\n y = sub(c, a)\n return cross(x, y) > 0\n \n n = int(input())\n c = [list(map(int, input().split())) for i in range(n)]\n-c.sort(key=lambda x: (x[0], x[1]))\n U = deque(c[:2])\n \n for i in range(2, n):\n j = len(U)\n while j >= 2 and ccw(U[-1],U[-2],c[i]):\n U.pop()\n j -= 1\n U.append(c[i])\n \n c = c[::-1]\n L = deque(c[:2])\n \n for i in range(2, n):\n j = len(L)\n while j >= 2 and ccw(L[-1], L[-2], c[i]):\n L.pop()\n j -= 1\n L.append(c[i])\n \n ans = U\n for i in range(1,len(L)-1):\n x, y = L[i]\n ans.append([x,y])\n \n i = ans.index(sorted(ans, key=lambda x: (x[1],x[0]))[0])\n ans = list(ans)\n for x,y in ans[:i] + ans[i:]:\n print(x, y)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 46 }, { "user_id": "u356832650", "problem_id": "p03505", "submission1_id": "s291110351-FL", "submission2_id": "s393259520", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport math\nK, A, B = list(map(int, input().split()))\n\nif (A >= K):\n print(1)\n sys.exit()\nelif (A - B) <= 0:\n print(-1)\n sys.exit()\nd = A - B\n\np = K-A\nq = p/d\nif ((p % d) != 0):\n q += 1\nprint(int(2*q + 1))", "code2": "import sys\nimport math\nK, A, B = list(map(int, input().split()))\n \nif (A >= K):\n print('1')\n sys.exit()\nelif (A - B) <= 0:\n print('-1')\n sys.exit()\nd = A-B\np = K-A\nq = int(p\nif ((p % d) != 0):\n q += 1\nprint(str(2*q + 1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512520226", "date2": "1512521288", "bleu_score": "0.9023794462027179", "code1_test_status": [1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 13, "total_score": 103, "input": "0100001110110000011 2 -2\n", "actual_output": "50000555055000008\n", "expected_output": "50000555055000007\n\n", "anno_code": ["import sys\nimport math\nK, A, B = list(map(int, input().split())) # (0): K=100001110110000011, A=2, B=-2\n\nif (A >= K): # (1): NO CHANGE\n print(1)\n sys.exit()\nelif (A - B) <= 0: # (2): NO CHANGE\n print(-1)\n sys.exit()\nd = A - B # (3): d=4\n\np = K-A # (4): p=100001110110000009\nq = p/d # (5): q=25000277527500004\nif ((p % d) != 0): # (6): NO CHANGE\n q += 1 # (7): NO CHANGE\nprint(int(2*q + 1))"], "anno_status": [true], "diff_content": " import sys\n import math\n K, A, B = list(map(int, input().split()))\n-\n+ \n if (A >= K):\n- print(1)\n+ print('1')\n sys.exit()\n elif (A - B) <= 0:\n- print(-1)\n+ print('-1')\n sys.exit()\n-d = A - B\n-\n+d = A-B\n p = K-A\n-q = p/d\n+q = int(p\n if ((p % d) != 0):\n q += 1\n-print(int(2*q + 1))\n+print(str(2*q + 1))\n", "FL_content": "\n import sys\n import math\n K, A, B = list(map(int, input().split()))\n \n if (A >= K):\n print(1)\n sys.exit()\n elif (A - B) <= 0:\n print(-1)\n sys.exit()\n d = A - B\n \n p = K-A\n-q = p/d\n if ((p % d) != 0):\n q += 1\n-print(int(2*q + 1))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u859897687", "problem_id": "p03456", "submission1_id": "s771232409-FL", "submission2_id": "s913507993", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print(\"NYoe s\"[int(input().replace(\" \",\"\"))**0.5%1<1::2])", "code2": "print(\"NYoe s\"[int(input().replace(\" \",\"\"))**0.5%1==0::2])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554096939", "date2": "1554097220", "bleu_score": "0.9196822664155297", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 4, "total_score": 91, "input": "001 101\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["print(\"NYoe s\"[int(input().replace(\" \",\"\"))**0.5%1<1::2])"], "anno_status": [true], "diff_content": "-print(\"NYoe s\"[int(input().replace(\" \",\"\"))**0.5%1<1::2])\n+print(\"NYoe s\"[int(input().replace(\" \",\"\"))**0.5%1==0::2])\n", "FL_content": "\n-print(\"NYoe s\"[int(input().replace(\" \",\"\"))**0.5%1<1::2])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 1 }, { "user_id": "u983918956", "problem_id": "p03003", "submission1_id": "s108480356-FL", "submission2_id": "s728237857", "status1": "Wrong Answer", "status2": "Accepted", "code1": "mod = 10**9 + 7\n\nN,M = map(int,input().split())\nS = \"\".join(input().split())\nT = \"\".join(input().split())\n\ndp = [[0]*(M+1) for _ in range(N+1)]\ndp[0][0] = 1\nfor i in range(1,N+1):\n dp[i][0] = 1\nfor j in range(1,M+1):\n dp[0][j] = 1\nfor i in range(1,N+1):\n for j in range(1,M+1):\n if S[i-1] == T[j-1]:\n dp[i][j] = dp[i][j-1] + dp[i-1][j]\n else:\n dp[i][j] = dp[i][j-1] + dp[i-1][j] - dp[i-1][j-1]\n dp[i][j] %= mod\n\nans = dp[N][M]\nprint(ans)", "code2": "mod = 10**9 + 7\n\nN,M = map(int,input().split())\nS = input().split()\nT = input().split()\n\ndp = [[-1]*(M+1) for _ in range(N+1)]\ndp[0][0] = 1\nfor i in range(1,N+1):\n dp[i][0] = 1\nfor j in range(1,M+1):\n dp[0][j] = 1\n\nfor i in range(1,N+1):\n for j in range(1,M+1):\n if S[i-1] == T[j-1]:\n dp[i][j] = dp[i][j-1] + dp[i-1][j]\n else:\n dp[i][j] = dp[i][j-1] + dp[i-1][j] - dp[i-1][j-1]\n dp[i][j] %= mod\n\nans = dp[N][M]\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1562455611", "date2": "1563063989", "bleu_score": "0.9466458279211082", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 65, "total_score": 105, "input": "10 9\n14 6 5 7 9 9 8 5 6 7\n17 6 8 0 5 7 9 9 7\n", "actual_output": "130\n", "expected_output": "125\n\n", "anno_code": ["mod = 10**9 + 7 # (0): mod=1000000007\n\nN,M = map(int,input().split()) # (1): N=10, M=9\nS = \"\".join(input().split()) # (2): S=14657998567\nT = \"\".join(input().split()) # (3): T=1768057997\n\ndp = [[0]*(M+1) for _ in range(N+1)] # (4): dp\ndp[0][0] = 1 # (5): dp\nfor i in range(1,N+1): # (6): i=1 (8): i=2 ... (26): NO CHANGE\n dp[i][0] = 1 # (7): dp (9): dp ... (25): dp\nfor j in range(1,M+1): # (27): j=1 (29): j=2 ... (45): NO CHANGE\n dp[0][j] = 1 # (28): dp (30): dp ... (44): dp\nfor i in range(1,N+1): # (46): i=1 (84): i=2 ... (426): NO CHANGE\n for j in range(1,M+1): # (47): j=1 (51): j=2 ... (425): NO CHANGE\n if S[i-1] == T[j-1]: # (48): NO CHANGE (52): NO CHANGE ... (422): NO CHANGE\n dp[i][j] = dp[i][j-1] + dp[i-1][j] # (49): dp (133): dp ... (399): dp\n else:\n dp[i][j] = dp[i][j-1] + dp[i-1][j] - dp[i-1][j-1] # (53): dp (57): dp ... (423): dp\n dp[i][j] %= mod # (50): NO CHANGE (54): NO CHANGE ... (424): NO CHANGE\n\nans = dp[N][M] # (427): ans=130\nprint(ans)"], "anno_status": [false], "diff_content": " mod = 10**9 + 7\n \n N,M = map(int,input().split())\n-S = \"\".join(input().split())\n-T = \"\".join(input().split())\n+S = input().split()\n+T = input().split()\n \n-dp = [[0]*(M+1) for _ in range(N+1)]\n+dp = [[-1]*(M+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(1,N+1):\n dp[i][0] = 1\n for j in range(1,M+1):\n dp[0][j] = 1\n+\n for i in range(1,N+1):\n for j in range(1,M+1):\n if S[i-1] == T[j-1]:\n dp[i][j] = dp[i][j-1] + dp[i-1][j]\n else:\n dp[i][j] = dp[i][j-1] + dp[i-1][j] - dp[i-1][j-1]\n dp[i][j] %= mod\n \n ans = dp[N][M]\n print(ans)\n", "FL_content": "\n mod = 10**9 + 7\n \n N,M = map(int,input().split())\n S = \"\".join(input().split())\n T = \"\".join(input().split())\n \n dp = [[0]*(M+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(1,N+1):\n dp[i][0] = 1\n for j in range(1,M+1):\n dp[0][j] = 1\n for i in range(1,N+1):\n for j in range(1,M+1):\n if S[i-1] == T[j-1]:\n dp[i][j] = dp[i][j-1] + dp[i-1][j]\n else:\n- dp[i][j] = dp[i][j-1] + dp[i-1][j] - dp[i-1][j-1]\n dp[i][j] %= mod\n \n ans = dp[N][M]\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u467463073", "problem_id": "p02536", "submission1_id": "s248364858-FL", "submission2_id": "s694658836", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n\n if x == y:\n return\n\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n\n def size(self, x):\n return -self.parents[self.find(x)]\n\n def same(self, x, y):\n return self.find(x) == self.find(y)\n\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n\n def group_count(self):\n return len(self.roots())\n\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n\nN,M = map(int,input().split())\nAB= [list(map(int,input().split())) for _ in range(M)]\n\nuf = UnionFind(N)\nfor ab in AB:\n uf.union(ab[0]-1,ab[1]-1)\nprint(N-uf.group_count())", "code2": "class UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n\n if x == y:\n return\n\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n\n def size(self, x):\n return -self.parents[self.find(x)]\n\n def same(self, x, y):\n return self.find(x) == self.find(y)\n\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n\n def group_count(self):\n return len(self.roots())\n\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n\nN,M = map(int,input().split())\nAB= [list(map(int,input().split())) for _ in range(M)]\n\nuf = UnionFind(N)\nfor ab in AB:\n uf.union(ab[0]-1,ab[1]-1)\nprint(uf.group_count()-1)\n\n\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1601169602", "date2": "1601169998", "bleu_score": "0.994704836681692", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 90, "input": "42 1\n1 6\n", "actual_output": "1\n", "expected_output": "40\n\n", "anno_code": ["class UnionFind(): # (0): UnionFind=\n def __init__(self, n):\n self.n = n # (4): NO CHANGE\n self.parents = [-1] * n # (5): UnionFind=, N=42, M=1, AB\n\n def find(self, x):\n if self.parents[x] < 0: # (9): y=5 (11): x=0, y=5\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n\n def union(self, x, y):\n x = self.find(x) # (8): NO CHANGE\n y = self.find(y) # (10): x=5\n\n if x == y: # (12): NO CHANGE\n return\n\n if self.parents[x] > self.parents[y]: # (13): NO CHANGE\n x, y = y, x\n\n self.parents[x] += self.parents[y] # (14): NO CHANGE\n self.parents[y] = x # (15): UnionFind=, N=42, M=1, AB, ab=[1, 6]\n\n def size(self, x):\n return -self.parents[self.find(x)]\n\n def same(self, x, y):\n return self.find(x) == self.find(y)\n\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n\n def group_count(self):\n return len(self.roots())\n\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n\nN,M = map(int,input().split()) # (1): N=42, M=1\nAB= [list(map(int,input().split())) for _ in range(M)] # (2): AB\n\nuf = UnionFind(N) # (3): self=0: [0, 5] 1: [1] 2: [2] 3: [3] 4: [4] 6: [6] 7: [7] 8: [8] 9: [9] 10: [10] 11: [11] 12: [12] 13: [13] 14: [14] 15: [15] 16: [16] 17: [17] 18: [18] 19: [19] 20: [20] 21: [21] 22: [22] 23: [23] 24: [24] 25: [25] 26: [26] 27: [27] 28: [28] 29: [29] 30: [30] 31: [31] 32: [32] 33: [33] 34: [34] 35: [35] 36: [36] 37: [37] 38: [38] 39: [39] 40: [40] 41: [41], n=42\nfor ab in AB: # (6): ab=[1, 6] (16): NO CHANGE\n uf.union(ab[0]-1,ab[1]-1) # (7): self=0: [0, 5] 1: [1] 2: [2] 3: [3] 4: [4] 6: [6] 7: [7] 8: [8] 9: [9] 10: [10] 11: [11] 12: [12] 13: [13] 14: [14] 15: [15] 16: [16] 17: [17] 18: [18] 19: [19] 20: [20] 21: [21] 22: [22] 23: [23] 24: [24] 25: [25] 26: [26] 27: [27] 28: [28] 29: [29] 30: [30] 31: [31] 32: [32] 33: [33] 34: [34] 35: [35] 36: [36] 37: [37] 38: [38] 39: [39] 40: [40] 41: [41], x=0, y=5\nprint(N-uf.group_count())"], "anno_status": [false], "diff_content": " class UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n \n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n \n if x == y:\n return\n \n if self.parents[x] > self.parents[y]:\n x, y = y, x\n \n self.parents[x] += self.parents[y]\n self.parents[y] = x\n \n def size(self, x):\n return -self.parents[self.find(x)]\n \n def same(self, x, y):\n return self.find(x) == self.find(y)\n \n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n \n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n \n def group_count(self):\n return len(self.roots())\n \n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n \n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n \n N,M = map(int,input().split())\n AB= [list(map(int,input().split())) for _ in range(M)]\n \n uf = UnionFind(N)\n for ab in AB:\n uf.union(ab[0]-1,ab[1]-1)\n-print(N-uf.group_count())\n+print(uf.group_count()-1)\n+\n+\n+\n", "FL_content": "\n class UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n \n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n \n if x == y:\n return\n \n if self.parents[x] > self.parents[y]:\n x, y = y, x\n \n self.parents[x] += self.parents[y]\n self.parents[y] = x\n \n def size(self, x):\n return -self.parents[self.find(x)]\n \n def same(self, x, y):\n return self.find(x) == self.find(y)\n \n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n \n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n \n def group_count(self):\n return len(self.roots())\n \n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n \n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n \n N,M = map(int,input().split())\n AB= [list(map(int,input().split())) for _ in range(M)]\n \n uf = UnionFind(N)\n for ab in AB:\n uf.union(ab[0]-1,ab[1]-1)\n-print(N-uf.group_count())\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 54 }, { "user_id": "u126232616", "problem_id": "p02975", "submission1_id": "s617285756-FL", "submission2_id": "s376108603", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\n\nn = int(input())\nA = list(map(int, input().split()))\nans = \"No\"\nCo = Counter(A)\nif n % 3 != 0 : \n if len(Co.keys()) == 1 and list(Co.keys())[0] == 0:\n ans = \"Yes\" \nelse :\n tr = n \n Va = Co.values()\n print(Va)\n if len(Va) == 3 :\n if Co.most_common()[0][1] == Co.most_common()[1][1] == Co.most_common()[2][1] == tr:\n ans = \"No\"\n elif len(Va) == 2 and Co.most_common()[0][1] == 2 * tr :\n ans = \"Yes\"\n elif len(Va) == 1 and Co.most_common()[0][0] == 1 :\n ans = \"Yes\"\n\nprint(ans)", "code2": "from collections import Counter\n\nn = int(input())\nA = list(map(int, input().split()))\nans = \"No\"\nCo = Counter(A)\nif n % 3 != 0 : \n if len(Co.keys()) == 1 and list(Co.keys())[0] == 0:\n ans = \"Yes\" \nelse :\n tr = n \n Va = Co.values()\n if len(Va) == 3 :\n if Co.most_common()[0][1] == Co.most_common()[1][1] == Co.most_common()[2][1] == tr:\n a,b,c = Co.most_common()[0][0],Co.most_common()[1][0],Co.most_common()[2][0]\n if a^b==c and b^c==a and c^a==b:\n ans = \"Yes\"\n elif len(Va) == 2 and Co.most_common()[0][1] == 2 * tr :\n a, b = Co.most_common()[0][0], Co.most_common()[1][0]\n if a^b==a and a^a==b:\n ans = \"Yes\"\n elif len(Va) == 1 and Co.most_common()[0][0] == 0 :\n ans = \"Yes\"\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563158945", "date2": "1563161388", "bleu_score": "0.6994707966795614", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 41, "total_score": 58, "input": "3\n0 25 2\n", "actual_output": "dict_values([1, 1, 1])\nNo\n", "expected_output": "No\n\n", "anno_code": ["from collections import Counter\n\nn = int(input()) # (0): n=3\nA = list(map(int, input().split())) # (1): A=[0, 25, 2]\nans = \"No\" # (2): ans=No\nCo = Counter(A) # (3): Co=Counter({0: 1, 25: 1, 2: 1})\nif n % 3 != 0 : # (4): NO CHANGE\n if len(Co.keys()) == 1 and list(Co.keys())[0] == 0:\n ans = \"Yes\" \nelse :\n tr = n # (5): tr=3\n Va = Co.values() # (6): Va=dict_values([1, 1, 1])\n print(Va) # (7): NO CHANGE\n if len(Va) == 3 : # (8): NO CHANGE\n if Co.most_common()[0][1] == Co.most_common()[1][1] == Co.most_common()[2][1] == tr: # (9): NO CHANGE\n ans = \"No\"\n elif len(Va) == 2 and Co.most_common()[0][1] == 2 * tr :\n ans = \"Yes\"\n elif len(Va) == 1 and Co.most_common()[0][0] == 1 :\n ans = \"Yes\"\n\nprint(ans)"], "anno_status": [true], "diff_content": " from collections import Counter\n \n n = int(input())\n A = list(map(int, input().split()))\n ans = \"No\"\n Co = Counter(A)\n if n % 3 != 0 : \n if len(Co.keys()) == 1 and list(Co.keys())[0] == 0:\n ans = \"Yes\" \n else :\n tr = n \n Va = Co.values()\n- print(Va)\n if len(Va) == 3 :\n if Co.most_common()[0][1] == Co.most_common()[1][1] == Co.most_common()[2][1] == tr:\n- ans = \"No\"\n+ a,b,c = Co.most_common()[0][0],Co.most_common()[1][0],Co.most_common()[2][0]\n+ if a^b==c and b^c==a and c^a==b:\n+ ans = \"Yes\"\n elif len(Va) == 2 and Co.most_common()[0][1] == 2 * tr :\n+ a, b = Co.most_common()[0][0], Co.most_common()[1][0]\n+ if a^b==a and a^a==b:\n+ ans = \"Yes\"\n+ elif len(Va) == 1 and Co.most_common()[0][0] == 0 :\n ans = \"Yes\"\n- elif len(Va) == 1 and Co.most_common()[0][0] == 1 :\n- ans = \"Yes\"\n-\n print(ans)\n", "FL_content": "\n from collections import Counter\n \n n = int(input())\n A = list(map(int, input().split()))\n ans = \"No\"\n Co = Counter(A)\n if n % 3 != 0 : \n if len(Co.keys()) == 1 and list(Co.keys())[0] == 0:\n ans = \"Yes\" \n else :\n tr = n \n Va = Co.values()\n- print(Va)\n if len(Va) == 3 :\n if Co.most_common()[0][1] == Co.most_common()[1][1] == Co.most_common()[2][1] == tr:\n ans = \"No\"\n elif len(Va) == 2 and Co.most_common()[0][1] == 2 * tr :\n ans = \"Yes\"\n elif len(Va) == 1 and Co.most_common()[0][0] == 1 :\n ans = \"Yes\"\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u137726327", "problem_id": "p03719", "submission1_id": "s288479957-FL", "submission2_id": "s263448868", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nlists=list(map(int,input().split()))\n\n\n\n\n\n\nif lists[0]<=lists[2] and lists[1]>=lists[2]:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "code2": "\n\n\n\n\nlists=list(map(int,input().split()))\n\n\n\n\n\n\nif lists[0]<=lists[2] and lists[1]>=lists[2]:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575385862", "date2": "1575385964", "bleu_score": "0.955431396518499", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 21, "input": "0 2 -7\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["\n\n\n\n\nlists=list(map(int,input().split())) # (0): lists=[0, 2, -7]\n\n\n\n\n\n\nif lists[0]<=lists[2] and lists[1]>=lists[2]: # (1): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")\n"], "anno_status": [true], "diff_content": " \n \n \n \n \n lists=list(map(int,input().split()))\n \n \n \n \n \n \n if lists[0]<=lists[2] and lists[1]>=lists[2]:\n- print(\"YES\")\n+ print(\"Yes\")\n else:\n- print(\"NO\")\n+ print(\"No\")\n \n", "FL_content": "\n \n \n \n \n \n lists=list(map(int,input().split()))\n \n \n \n \n \n \n if lists[0]<=lists[2] and lists[1]>=lists[2]:\n- print(\"YES\")\n else:\n- print(\"NO\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u532966492", "problem_id": "p03363", "submission1_id": "s931944447-FL", "submission2_id": "s425938511", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nL=list(map(int,input().split()))\nN=200000\nL=[i for i in range(N)]\nLeft=[[0,0]]\nRight=[[0,N]]\nfor i in range(N):\n Left.append([Left[i][0]+L[i],i+1])\nfor i in range(N):\n Right.append([Right[i][0]+L[i*(-1)-1],N-i-1])\nRight=list(reversed(Right))\nLeft=sorted(Left, key=lambda x: x[0])\n_sum_=Right[0][0]\nLeft=sorted(Left, key=lambda x: x[0],reverse=True)\nRight=sorted(Right, key=lambda x: x[0])\nLeft.append([0,0])\nRight.append([0,0])\n\nj=0\ns=0\nans=0\nfor i in range(N+1):\n if i != 0:\n if Left[i][0]!=Left[i-1][0]:\n s=0\n while(Left[i][0]+Right[j][0]<_sum_ and j<=N):\n j+=1\n if j>N:\n break\n elif Left[i][0]+Right[j][0]>_sum_:\n continue\n else:\n while(Left[i][0]+Right[j][0]==_sum_ and j<=N):\n if Left[i][1]>=Right[j][1]:\n j+=1\n else:\n s+=1\n ans+=s\n break\nprint(ans)", "code2": "N=int(input())\nL=list(map(int,input().split()))\nLeft=[[0,0]]\nRight=[[0,N]]\nfor i in range(N):\n Left.append([Left[i][0]+L[i],i+1])\nfor i in range(N):\n Right.append([Right[i][0]+L[i*(-1)-1],N-i-1])\nRight=list(reversed(Right))\nLeft=sorted(Left, key=lambda x: x[0])\n_sum_=Right[0][0]\nLeft=sorted(Left, key=lambda x: x[0],reverse=True)\nRight=sorted(Right, key=lambda x: x[0])\nLeft.append([0,0])\nRight.append([0,0])\n \nj=0\ns=0\nans=0\nfor i in range(N+1):\n if i != 0:\n if Left[i][0]!=Left[i-1][0]:\n s=0\n while(Left[i][0]+Right[j][0]<_sum_ and j<=N):\n j+=1\n if j>N:\n break\n elif Left[i][0]+Right[j][0]>_sum_:\n continue\n else:\n while(Left[i][0]+Right[j][0]==_sum_ and j<=N):\n if Left[i][1]>=Right[j][1]:\n j+=1\n else:\n s+=1\n ans+=s\n break\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558319105", "date2": "1558326517", "bleu_score": "0.9612494470143321", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0], "code1_test_score": 16, "total_score": 103, "input": "6\n1 3 -2 2 0 -4\n", "actual_output": "1\n", "expected_output": "4\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N=int(input())\n L=list(map(int,input().split()))\n-N=200000\n-L=[i for i in range(N)]\n Left=[[0,0]]\n Right=[[0,N]]\n for i in range(N):\n Left.append([Left[i][0]+L[i],i+1])\n for i in range(N):\n Right.append([Right[i][0]+L[i*(-1)-1],N-i-1])\n Right=list(reversed(Right))\n Left=sorted(Left, key=lambda x: x[0])\n _sum_=Right[0][0]\n Left=sorted(Left, key=lambda x: x[0],reverse=True)\n Right=sorted(Right, key=lambda x: x[0])\n Left.append([0,0])\n Right.append([0,0])\n-\n+ \n j=0\n s=0\n ans=0\n for i in range(N+1):\n if i != 0:\n if Left[i][0]!=Left[i-1][0]:\n s=0\n while(Left[i][0]+Right[j][0]<_sum_ and j<=N):\n j+=1\n if j>N:\n break\n elif Left[i][0]+Right[j][0]>_sum_:\n continue\n else:\n while(Left[i][0]+Right[j][0]==_sum_ and j<=N):\n if Left[i][1]>=Right[j][1]:\n j+=1\n else:\n s+=1\n ans+=s\n break\n print(ans)\n", "FL_content": "\n N=int(input())\n L=list(map(int,input().split()))\n-N=200000\n-L=[i for i in range(N)]\n-Left=[[0,0]]\n-Right=[[0,N]]\n for i in range(N):\n- Left.append([Left[i][0]+L[i],i+1])\n for i in range(N):\n- Right.append([Right[i][0]+L[i*(-1)-1],N-i-1])\n-Right=list(reversed(Right))\n-Left=sorted(Left, key=lambda x: x[0])\n-_sum_=Right[0][0]\n-Left=sorted(Left, key=lambda x: x[0],reverse=True)\n-Right=sorted(Right, key=lambda x: x[0])\n-Left.append([0,0])\n-Right.append([0,0])\n-\n-j=0\n-s=0\n ans=0\n-for i in range(N+1):\n- if i != 0:\n- if Left[i][0]!=Left[i-1][0]:\n- s=0\n- while(Left[i][0]+Right[j][0]<_sum_ and j<=N):\n- j+=1\n- if j>N:\n- break\n- elif Left[i][0]+Right[j][0]>_sum_:\n- continue\n- else:\n- while(Left[i][0]+Right[j][0]==_sum_ and j<=N):\n- if Left[i][1]>=Right[j][1]:\n- j+=1\n- else:\n- s+=1\n- ans+=s\n- break\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 40 }, { "user_id": "u617225232", "problem_id": "p03957", "submission1_id": "s817367147-FL", "submission2_id": "s543439842", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ns = input()\nif s.find('C') < s.rfind('F'):\n print('Yes')\nelse:\n print('No')\n", "code2": "s = input()\nif -1 < s.find('C') < s.rfind('F'):\n print('Yes')\nelse:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560100599", "date2": "1560100806", "bleu_score": "0.9325565848544776", "code1_test_status": [1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 67, "total_score": 103, "input": "VAOSSAEDLFEH\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["\ns = input() # (0): s=VAOSSAEDLFEH\nif s.find('C') < s.rfind('F'): # (1): NO CHANGE\n print('Yes')\nelse:\n print('No')\n"], "anno_status": [true], "diff_content": "-\n s = input()\n-if s.find('C') < s.rfind('F'):\n+if -1 < s.find('C') < s.rfind('F'):\n print('Yes')\n else:\n print('No')\n \n", "FL_content": "\n \n s = input()\n-if s.find('C') < s.rfind('F'):\n print('Yes')\n else:\n print('No')\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u698567423", "problem_id": "p03502", "submission1_id": "s382296366-FL", "submission2_id": "s357957216", "status1": "Wrong Answer", "status2": "Accepted", "code1": "num = int(input())\n\nfx = 0\nfor i in str(num):\n fx += int(i)\n\nprint(\"YES\" if num % fx == 0 else \"NO\")", "code2": "num = int(input())\n\nfx = 0\nfor i in str(num):\n fx += int(i)\n\nprint(\"Yes\" if num % fx == 0 else \"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512441117", "date2": "1512441148", "bleu_score": "0.9429358793263002", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 23, "input": "1075\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["num = int(input()) # (0): num=1075\n\nfx = 0 # (1): fx=0\nfor i in str(num): # (2): i=1 (4): i=0 ... (10): NO CHANGE\n fx += int(i) # (3): fx=1 (5): NO CHANGE ... (9): fx=13\n\nprint(\"YES\" if num % fx == 0 else \"NO\")"], "anno_status": [true], "diff_content": " num = int(input())\n \n fx = 0\n for i in str(num):\n fx += int(i)\n \n-print(\"YES\" if num % fx == 0 else \"NO\")\n+print(\"Yes\" if num % fx == 0 else \"No\")\n", "FL_content": "\n num = int(input())\n \n fx = 0\n for i in str(num):\n fx += int(i)\n \n-print(\"YES\" if num % fx == 0 else \"NO\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u532637712", "problem_id": "p02899", "submission1_id": "s194023259-FL", "submission2_id": "s475674676", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nN = int(input())\nnum_list = list(map(int, input().split()))\norder_list = sorted(range(len(num_list)), key=lambda k: num_list[k])\norder_list = list(map(lambda x: x+1, order_list))\nprint('{}'.format(order_list))\n", "code2": "\n\nN = int(input())\nnum_list = list(map(int, input().split()))\norder_list = sorted(range(len(num_list)), key=lambda k: num_list[k])\norder_list = list(map(lambda x: x+1, order_list))\n[print(' '.join([str(i) for i in order_list]))]\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569724087", "date2": "1569724456", "bleu_score": "0.8664783677582678", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 11, "input": "3\n2 -2 3\n", "actual_output": "[2, 1, 3]\n", "expected_output": "2 1 3 \n\n", "anno_code": ["\n\nN = int(input()) # (0): N=3\nnum_list = list(map(int, input().split())) # (1): num_list=[2, -2, 3]\norder_list = sorted(range(len(num_list)), key=lambda k: num_list[k]) # (2): order_list=[1, 0, 2]\norder_list = list(map(lambda x: x+1, order_list)) # (3): order_list=[2, 1, 3]\nprint('{}'.format(order_list))\n"], "anno_status": [true], "diff_content": " \n \n N = int(input())\n num_list = list(map(int, input().split()))\n order_list = sorted(range(len(num_list)), key=lambda k: num_list[k])\n order_list = list(map(lambda x: x+1, order_list))\n-print('{}'.format(order_list))\n+[print(' '.join([str(i) for i in order_list]))]\n \n", "FL_content": "\n \n \n N = int(input())\n num_list = list(map(int, input().split()))\n order_list = sorted(range(len(num_list)), key=lambda k: num_list[k])\n order_list = list(map(lambda x: x+1, order_list))\n-print('{}'.format(order_list))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u815878613", "problem_id": "p03838", "submission1_id": "s666302493-FL", "submission2_id": "s679951252", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y = map(int, input().split())\n\nif x >= 0:\n sgnx = 1\nelse:\n sgnx = -1\n\nif y >= 0:\n sgny = 1\nelse:\n sgny = -1\n\nif abs(x) > abs(y):\n if sgnx == 1 and sgny == 1:\n ans = 1 + y + x\n if sgnx == -1 and sgny == -1:\n ans = abs(x) - abs(y)\n elif sgnx == -1 and sgny == 1:\n ans = 1 + abs(x) - abs(y)\n elif sgnx == 1 and sgny == -1:\n ans = 1 + abs(x) - abs(y)\n\nelif abs(x) < abs(y):\n if sgnx == 1 and sgny == 1:\n ans = y - x\n if sgnx == -1 and sgny == -1:\n ans = 2 + abs(y) - abs(x)\n elif sgnx == -1 and sgny == 1:\n ans = 1 + abs(y) - abs(x)\n elif sgnx == 1 and sgny == -1:\n ans = 1 + abs(y) - abs(x)\n\nelse:\n if sgnx == sgny:\n ans = 0\n if sgnx != sgny:\n ans = 1\n\nprint(ans)\n", "code2": "x, y = map(int, input().split())\n\nif x >= 0:\n sgnx = 1\nelse:\n sgnx = -1\n\nif y > 0:\n sgny = 1\nelse:\n sgny = -1\n\nif abs(x) > abs(y):\n if sgnx == 1 and sgny == 1:\n ans = 2 + abs(x) - abs(y)\n if sgnx == -1 and sgny == -1:\n ans = abs(x) - abs(y)\n elif sgnx == -1 and sgny == 1:\n ans = 1 + abs(x) - abs(y)\n elif sgnx == 1 and sgny == -1:\n ans = 1 + abs(x) - abs(y)\n\nelif abs(x) < abs(y):\n if sgnx == 1 and sgny == 1:\n ans = y - x\n if sgnx == -1 and sgny == -1:\n ans = 2 + abs(y) - abs(x)\n elif sgnx == -1 and sgny == 1:\n ans = 1 + abs(y) - abs(x)\n elif sgnx == 1 and sgny == -1:\n ans = 1 + abs(y) - abs(x)\n\nelse:\n if sgnx == sgny:\n ans = 0\n if sgnx != sgny:\n ans = 1\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571689732", "date2": "1571690220", "bleu_score": "0.9750835003770381", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 90, "input": "101 1\n", "actual_output": "103\n", "expected_output": "102\n\n", "anno_code": ["x, y = map(int, input().split()) # (0): x=101, y=1\n\nif x >= 0: # (1): NO CHANGE\n sgnx = 1 # (2): sgnx=1\nelse:\n sgnx = -1\n\nif y >= 0: # (3): NO CHANGE\n sgny = 1 # (4): sgny=1\nelse:\n sgny = -1\n\nif abs(x) > abs(y): # (5): NO CHANGE\n if sgnx == 1 and sgny == 1: # (6): NO CHANGE\n ans = 1 + y + x # (7): ans=103\n if sgnx == -1 and sgny == -1: # (8): NO CHANGE\n ans = abs(x) - abs(y)\n elif sgnx == -1 and sgny == 1: # (9): NO CHANGE\n ans = 1 + abs(x) - abs(y)\n elif sgnx == 1 and sgny == -1: # (10): NO CHANGE\n ans = 1 + abs(x) - abs(y)\n\nelif abs(x) < abs(y):\n if sgnx == 1 and sgny == 1:\n ans = y - x\n if sgnx == -1 and sgny == -1:\n ans = 2 + abs(y) - abs(x)\n elif sgnx == -1 and sgny == 1:\n ans = 1 + abs(y) - abs(x)\n elif sgnx == 1 and sgny == -1:\n ans = 1 + abs(y) - abs(x)\n\nelse:\n if sgnx == sgny:\n ans = 0\n if sgnx != sgny:\n ans = 1\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " x, y = map(int, input().split())\n \n if x >= 0:\n sgnx = 1\n else:\n sgnx = -1\n \n-if y >= 0:\n+if y > 0:\n sgny = 1\n else:\n sgny = -1\n \n if abs(x) > abs(y):\n if sgnx == 1 and sgny == 1:\n- ans = 1 + y + x\n+ ans = 2 + abs(x) - abs(y)\n if sgnx == -1 and sgny == -1:\n ans = abs(x) - abs(y)\n elif sgnx == -1 and sgny == 1:\n ans = 1 + abs(x) - abs(y)\n elif sgnx == 1 and sgny == -1:\n ans = 1 + abs(x) - abs(y)\n \n elif abs(x) < abs(y):\n if sgnx == 1 and sgny == 1:\n ans = y - x\n if sgnx == -1 and sgny == -1:\n ans = 2 + abs(y) - abs(x)\n elif sgnx == -1 and sgny == 1:\n ans = 1 + abs(y) - abs(x)\n elif sgnx == 1 and sgny == -1:\n ans = 1 + abs(y) - abs(x)\n \n else:\n if sgnx == sgny:\n ans = 0\n if sgnx != sgny:\n ans = 1\n \n print(ans)\n \n", "FL_content": "\n x, y = map(int, input().split())\n \n if x >= 0:\n sgnx = 1\n else:\n sgnx = -1\n \n if y >= 0:\n sgny = 1\n else:\n sgny = -1\n \n if abs(x) > abs(y):\n if sgnx == 1 and sgny == 1:\n- ans = 1 + y + x\n if sgnx == -1 and sgny == -1:\n ans = abs(x) - abs(y)\n elif sgnx == -1 and sgny == 1:\n ans = 1 + abs(x) - abs(y)\n elif sgnx == 1 and sgny == -1:\n ans = 1 + abs(x) - abs(y)\n \n elif abs(x) < abs(y):\n if sgnx == 1 and sgny == 1:\n ans = y - x\n if sgnx == -1 and sgny == -1:\n ans = 2 + abs(y) - abs(x)\n elif sgnx == -1 and sgny == 1:\n ans = 1 + abs(y) - abs(x)\n elif sgnx == 1 and sgny == -1:\n ans = 1 + abs(y) - abs(x)\n \n else:\n if sgnx == sgny:\n ans = 0\n if sgnx != sgny:\n ans = 1\n \n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 40 }, { "user_id": "u620084012", "problem_id": "p03739", "submission1_id": "s455710046-FL", "submission2_id": "s550505656", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int,input().split()))\ns = A[0]\nans = 0\n\nfor k in range(1,N):\n if s*(s+A[k])<=-1:\n s += A[k]\n else:\n if s > 0:\n if s + A[k] >= 0:\n ans += s + A[k] + 1\n s = -1\n elif s < 0:\n if s + A[k] <= 0:\n ans += 1 - s - A[k]\n s = 1\nprint(ans)", "code2": "N = int(input())\nA = list(map(int,input().split()))\n\ns = 0\nans1 = 0\nfor k in range(N):\n s += A[k]\n if k%2==0:\n if s <= 0:\n ans1 += -s+1\n s = 1\n else:\n if s >= 0:\n ans1 += s+1\n s = -1\n\ns = 0\nans2 = 0\nfor k in range(N):\n s += A[k]\n if k%2==0:\n if s >= 0:\n ans2 += s+1\n s = -1\n else:\n if s <= 0:\n ans2 += -s+1\n s = 1\n\nprint(min(ans1,ans2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1525421102", "date2": "1525424710", "bleu_score": "0.6538845300484326", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1], "code1_test_score": 62, "total_score": 94, "input": "6\n0 1 2 -1 -2 -1\n", "actual_output": "0\n", "expected_output": "10\n\n", "anno_code": ["N = int(input()) # (0): N=6\nA = list(map(int,input().split())) # (1): A=[0, 1, 2, -1, -2, -1]\ns = A[0] # (2): s=0\nans = 0 # (3): ans=0\n\nfor k in range(1,N): # (4): k=1 (8): k=2 ... (24): NO CHANGE\n if s*(s+A[k])<=-1: # (5): NO CHANGE (9): NO CHANGE ... (21): NO CHANGE\n s += A[k]\n else:\n if s > 0: # (6): NO CHANGE (10): NO CHANGE ... (22): NO CHANGE\n if s + A[k] >= 0:\n ans += s + A[k] + 1\n s = -1\n elif s < 0: # (7): NO CHANGE (11): NO CHANGE ... (23): NO CHANGE\n if s + A[k] <= 0:\n ans += 1 - s - A[k]\n s = 1\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int,input().split()))\n-s = A[0]\n-ans = 0\n \n-for k in range(1,N):\n- if s*(s+A[k])<=-1:\n- s += A[k]\n+s = 0\n+ans1 = 0\n+for k in range(N):\n+ s += A[k]\n+ if k%2==0:\n+ if s <= 0:\n+ ans1 += -s+1\n+ s = 1\n else:\n- if s > 0:\n- if s + A[k] >= 0:\n- ans += s + A[k] + 1\n- s = -1\n- elif s < 0:\n- if s + A[k] <= 0:\n- ans += 1 - s - A[k]\n- s = 1\n-print(ans)\n+ if s >= 0:\n+ ans1 += s+1\n+ s = -1\n+\n+s = 0\n+ans2 = 0\n+for k in range(N):\n+ s += A[k]\n+ if k%2==0:\n+ if s >= 0:\n+ ans2 += s+1\n+ s = -1\n+ else:\n+ if s <= 0:\n+ ans2 += -s+1\n+ s = 1\n+\n+print(min(ans1,ans2))\n", "FL_content": "\n N = int(input())\n A = list(map(int,input().split()))\n s = A[0]\n ans = 0\n \n for k in range(1,N):\n if s*(s+A[k])<=-1:\n s += A[k]\n else:\n if s > 0:\n if s + A[k] >= 0:\n ans += s + A[k] + 1\n s = -1\n elif s < 0:\n if s + A[k] <= 0:\n ans += 1 - s - A[k]\n s = 1\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u695811449", "problem_id": "p03297", "submission1_id": "s761941121-FL", "submission2_id": "s116989003", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def gcd(a, b):\n\twhile b:\n\t\ta, b = b, a % b\n\treturn a\n\nT=int(input())\nJuice=[None]*T\nfor i in range(T):\n Juice[i]=list(map(int,input().split()))\n\n\n\n\n\ndef juicecheck(i):\n A=Juice[i][0]\n B=Juice[i][1]\n C=Juice[i][2]\n D=Juice[i][3]\n\n if AD:\n print(\"No\")\n return\n elif B-1<=C:\n print(\"Yes\")\n return\n else:\n x=A%B\n y=D%B\n \n\n z=gcd(B,D)\n\n if z==1 or (C+1)%z<=x%zB%z and ((C+1)%z<=x%z or x%zD:\n print(\"No\")\n return\n elif B-1<=C:\n print(\"Yes\")\n return\n else:\n x=A%B\n y=D%B\n \n\n z=gcd(B,D)\n\n if z==1 or B-(C+1)>=z or (C+1)%z<=x%z<=(B-1)%z or ( (C+1)%z>B%z and ((C+1)%z<=x%z or x%z\n\twhile b: # (45): NO CHANGE (47): NO CHANGE ... (269): i=13, A=1000000000000000000, B=17, C=15, D=999999999999999985, x=15, y=0, z=17\n\t\ta, b = b, a % b # (46): a=11, b=7 (48): a=7, b=4 ... (268): a=17, b=0\n\treturn a\n\nT=int(input()) # (1): T=14\nJuice=[None]*T # (2): Juice=[None, None, None, None, None, None, None, None, None, None, None, None, None, None]\nfor i in range(T): # (3): i=0 (5): Juice, i=1 ... (31): NO CHANGE\n Juice[i]=list(map(int,input().split())) # (4): Juice (6): Juice ... (30): Juice\n\n\n\n\n\ndef juicecheck(i): # (32): juicecheck=\n A=Juice[i][0] # (35): A=9 (61): A=12 ... (255): A=1000000000000000000\n B=Juice[i][1] # (36): B=7 (62): B=7 ... (256): B=17\n C=Juice[i][2] # (37): C=5 (63): C=12 ... (257): C=15\n D=Juice[i][3] # (38): D=11 (64): D=9 ... (258): D=999999999999999985\n\n if A, T=14, Juice, juicecheck= (186): gcd=, T=14, Juice, juicecheck=\n elif B>D: # (40): NO CHANGE (66): NO CHANGE ... (260): NO CHANGE\n print(\"No\") # (213): NO CHANGE\n return # (214): gcd=, T=14, Juice, juicecheck=\n elif B-1<=C: # (41): NO CHANGE (67): NO CHANGE ... (261): NO CHANGE\n print(\"Yes\") # (68): NO CHANGE (176): NO CHANGE\n return # (69): gcd=, T=14, Juice, juicecheck= (177): gcd=, T=14, Juice, juicecheck=\n else:\n x=A%B # (42): x=2 (79): x=4 ... (262): x=15\n y=D%B # (43): y=4 (80): y=2 ... (263): y=0\n \n\n z=gcd(B,D) # (44): a=7, b=11 (81): a=10, b=12 ... (264): a=17, b=999999999999999985\n\n if z==1 or (C+1)%z<=x%zB%z and ((C+1)%z<=x%z or x%z, T=14, Juice, juicecheck= (144): gcd=, T=14, Juice, juicecheck= ... (232): gcd=, T=14, Juice, juicecheck=\n\n print(\"Yes\") # (90): NO CHANGE (112): NO CHANGE ... (271): NO CHANGE\n return # (91): gcd=, T=14, Juice, juicecheck= (113): gcd=, T=14, Juice, juicecheck= ... (272): gcd=, T=14, Juice, juicecheck=\n \n \n\nfor i in range(T): # (33): i=0 (59): i=1 ... (253): i=13\n juicecheck(i) # (34): NO CHANGE (60): NO CHANGE ... (254): NO CHANGE\n"], "anno_status": [false], "diff_content": " def gcd(a, b):\n \twhile b:\n \t\ta, b = b, a % b\n \treturn a\n \n T=int(input())\n Juice=[None]*T\n for i in range(T):\n Juice[i]=list(map(int,input().split()))\n \n \n \n \n \n def juicecheck(i):\n A=Juice[i][0]\n B=Juice[i][1]\n C=Juice[i][2]\n D=Juice[i][3]\n \n if AD:\n print(\"No\")\n return\n elif B-1<=C:\n print(\"Yes\")\n return\n else:\n x=A%B\n y=D%B\n \n \n z=gcd(B,D)\n \n- if z==1 or (C+1)%z<=x%zB%z and ((C+1)%z<=x%z or x%z=z or (C+1)%z<=x%z<=(B-1)%z or ( (C+1)%z>B%z and ((C+1)%z<=x%z or x%zD:\n print(\"No\")\n return\n- elif B-1<=C:\n print(\"Yes\")\n return\n else:\n x=A%B\n y=D%B\n \n \n z=gcd(B,D)\n \n if z==1 or (C+1)%z<=x%zB%z and ((C+1)%z<=x%z or x%z, defaultdict=\nfrom collections import defaultdict\nN = int(input()) # (1): N=3\nT = [input()[::-1].strip() for i in range(N)] # (2): T=['xyacbx', 'xyc', 'abb']\n\n\n\n\n\n\nclass TrieTree: # (3): TrieTree=\n class Node:\n def __init__(self):\n self.ch = defaultdict(TrieTree.Node) # (6): NO CHANGE (17): NO CHANGE ... (140): NO CHANGE\n self.cnt = 0 # (7): NO CHANGE (18): NO CHANGE ... (141): NO CHANGE\n self.end = False # (8): sys=, input=, defaultdict=, N=3, T=['xyacbx', 'xyc', 'abb'], TrieTree=, tt= (19): self=, word=xyc, node=, w=x ... (142): self=, word=abb, node=, w=b\n\n def __init__(self):\n self.root = self.Node() # (5): self=\n\n def register(self,word):\n node = self.root # (13): node= (58): node= (124): node=\n for w in word: # (14): w=x (20): w=y ... (143): NO CHANGE\n node.cnt += 1 # (15): NO CHANGE (21): NO CHANGE ... (138): NO CHANGE\n node = node.ch[w] # (16): self= (22): self= ... (139): self=\n node.cnt += 1 # (33): NO CHANGE (90): NO CHANGE (144): NO CHANGE\n node.end = True # (34): sys=, input=, defaultdict=, N=3, T=['xyc', 'xyacbx', 'abb'], TrieTree=, tt=, ans=0 (91): sys=, input=, defaultdict=, N=3, T=['xyc', 'xyacbx', 'abb'], TrieTree=, tt=, ans=0, pre=xy, last=c, node=, df=[], c=c, nnode= (145): sys=, input=, defaultdict=, N=3, T=['xyc', 'xyacbx', 'abb'], TrieTree=, tt=, ans=0, pre=xyacb, last=x, node=, df=[], c=x, nnode=\n \n def prefix(self, word):\n node = self.root # (38): node= (95): node= (149): node=\n for w in word: # (39): w=x (42): w=y ... (156): sys=, input=, defaultdict=, N=3, T=['xyc', 'xyacbx', 'abb'], TrieTree=, tt=, ans=0, word=abb, pre=ab, last=b, df=[], c=x, nnode=\n if w not in node.ch: # (40): NO CHANGE (43): NO CHANGE ... (154): NO CHANGE\n return False\n else:\n node = node.ch[w] # (41): node= (44): node= ... (155): node=\n return node\n\ntt = TrieTree() # (4): self=\nT = sorted(T,reverse=True) # (9): T=['xyc', 'xyacbx', 'abb']\nans = 0 # (10): ans=0\nfor word in T: # (11): word=xyc (56): word=xyacbx ... (167): NO CHANGE\n tt.register(word) # (12): self= (57): self= (123): self=\n pre = word[:-1] # (35): pre=xy (92): pre=xyacb (146): pre=ab\n last = word[-1] # (36): last=c (93): last=x (147): last=b\n node = tt.prefix(pre) # (37): self=, word=xy (94): self=, word=xyacb (148): self=, word=ab\n if not node: # (46): NO CHANGE (112): NO CHANGE (157): NO CHANGE\n continue\n df = [node] # (47): df=[] (113): df (158): df\n while df: # (48): df (54): NO CHANGE ... (165): NO CHANGE\n node = df.pop() # (49): df=[] (115): df=[] (160): df=[]\n for c, nnode in node.ch.items(): # (50): c=c, nnode= (53): NO CHANGE ... (164): NO CHANGE\n if c == last: # (51): NO CHANGE (117): NO CHANGE (162): NO CHANGE\n ans += node.ch[last].cnt # (52): ans=1 (118): ans=1 (163): ans=1\n else:\n df.append(nnode)\n ans -= 1 # (55): ans=0 (121): ans=0 (166): ans=0\n \nprint(ans)\n"], "anno_status": [false], "diff_content": " import sys\n+import string\n input = sys.stdin.readline\n from collections import defaultdict\n N = int(input())\n T = [input()[::-1].strip() for i in range(N)]\n \n \n \n \n \n \n+\n class TrieTree:\n class Node:\n def __init__(self):\n+ \n+ self.clue = [0]*26\n self.ch = defaultdict(TrieTree.Node)\n self.cnt = 0\n self.end = False\n \n def __init__(self):\n self.root = self.Node()\n \n def register(self,word):\n node = self.root\n for w in word:\n node.cnt += 1\n node = node.ch[w]\n node.cnt += 1\n node.end = True\n \n def prefix(self, word):\n node = self.root\n for w in word:\n if w not in node.ch:\n return False\n else:\n node = node.ch[w]\n return node\n \n tt = TrieTree()\n-T = sorted(T,reverse=True)\n-ans = 0\n for word in T:\n tt.register(word)\n+\n+route = []\n+\n+st = [tt.root]\n+while st:\n+ node = st.pop()\n+ route.append(node)\n+ st.extend(node.ch.values())\n+\n+f = lambda c : ord(c)-97\n+for node in route[::-1]:\n+ for c,nnode in node.ch.items():\n+ for i,v in enumerate(nnode.clue):\n+ node.clue[i] += v\n+ node.clue[f(c)] += nnode.cnt - nnode.clue[f(c)]\n+\n+ans = 0\n+for word in T:\n pre = word[:-1]\n last = word[-1]\n node = tt.prefix(pre)\n if not node:\n continue\n- df = [node]\n- while df:\n- node = df.pop()\n- for c, nnode in node.ch.items():\n- if c == last:\n- ans += node.ch[last].cnt\n- else:\n- df.append(nnode)\n- ans -= 1\n+ ans += node.clue[f(last)] - 1\n \n print(ans)\n \n", "FL_content": "\n import sys\n input = sys.stdin.readline\n from collections import defaultdict\n N = int(input())\n T = [input()[::-1].strip() for i in range(N)]\n \n \n \n \n \n \n class TrieTree:\n class Node:\n def __init__(self):\n self.ch = defaultdict(TrieTree.Node)\n self.cnt = 0\n self.end = False\n \n def __init__(self):\n self.root = self.Node()\n \n def register(self,word):\n node = self.root\n for w in word:\n node.cnt += 1\n node = node.ch[w]\n node.cnt += 1\n node.end = True\n \n def prefix(self, word):\n node = self.root\n for w in word:\n if w not in node.ch:\n return False\n else:\n node = node.ch[w]\n return node\n \n tt = TrieTree()\n T = sorted(T,reverse=True)\n ans = 0\n for word in T:\n tt.register(word)\n pre = word[:-1]\n last = word[-1]\n node = tt.prefix(pre)\n if not node:\n continue\n df = [node]\n while df:\n node = df.pop()\n for c, nnode in node.ch.items():\n if c == last:\n ans += node.ch[last].cnt\n else:\n df.append(nnode)\n ans -= 1\n \n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 60 }, { "user_id": "u575560095", "problem_id": "p04044", "submission1_id": "s269133514-FL", "submission2_id": "s731220154", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,L = map(int,input().split())\nS = []\nans = \"\"\nfor i in range(N):\n S.append(input())\nsorted(S)\nfor i in range(len(S)):\n ans += S[i]\nprint(ans)\n", "code2": "l=[]\na=''\nN,L=map(int,input().split())\nfor i in range(N):\n\tl.append(input())\n\tl.sort()\nfor i in range(N):\n\ta += l[i]\nprint(a)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568485274", "date2": "1568486447", "bleu_score": "0.6509189654874513", "code1_test_status": [0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0], "code1_test_score": 16, "total_score": 101, "input": "3 3\nxxd\nxxa\nxxd\n", "actual_output": "xxdxxaxxd\n", "expected_output": "xxaxxdxxd\n\n", "anno_code": ["N,L = map(int,input().split()) # (0): N=3, L=3\nS = [] # (1): S=[]\nans = \"\" # (2): ans=\nfor i in range(N): # (3): i=0 (5): i=1 ... (9): NO CHANGE\n S.append(input()) # (4): S=['xxd'] (6): S=['xxd', 'xxa'] (8): S=['xxd', 'xxa', 'xxd']\nsorted(S) # (10): NO CHANGE\nfor i in range(len(S)): # (11): i=0 (13): i=1 ... (17): NO CHANGE\n ans += S[i] # (12): ans=xxd (14): ans=xxdxxa (16): ans=xxdxxaxxd\nprint(ans)\n"], "anno_status": [true], "diff_content": "-N,L = map(int,input().split())\n-S = []\n-ans = \"\"\n+l=[]\n+a=''\n+N,L=map(int,input().split())\n for i in range(N):\n- S.append(input())\n-sorted(S)\n-for i in range(len(S)):\n- ans += S[i]\n-print(ans)\n+\tl.append(input())\n+\tl.sort()\n+for i in range(N):\n+\ta += l[i]\n+print(a)\n \n", "FL_content": "\n N,L = map(int,input().split())\n S = []\n ans = \"\"\n for i in range(N):\n S.append(input())\n-sorted(S)\n for i in range(len(S)):\n ans += S[i]\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u279493135", "problem_id": "p04014", "submission1_id": "s995385208-FL", "submission2_id": "s138406168", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\nimport sys\nsys.setrecursionlimit(10000)\ninput = stdin.readline\n\nn = int(input().rstrip())\ns = int(input().rstrip())\n\ndef f(b, n):\n\tif n < b:\n\t\treturn n\n\telse:\n\t\treturn f(b, int(n/b)) + (n % b)\nif s == n:\n\tprint(n+1)\nelse:\n\tfor i in range(2, int(n**(1/2))+1):\n\t\tif f(i, n) == s:\n\t\t\tprint(i)\n\t\t\tbreak\n\telse:\n\t\tfor p in range(1, int(n**(1/2))+1):\n\t\t\tif (n-s) % p == 0:\n\t\t\t\tb = (n-s)/p + 1\n\t\t\t\tif b >= 2 and f(b, n) == s:\n\t\t\t\t\tprint(int(b))\n\t\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tcontinue\n\t\telse:\n\t\t\tprint(-1)", "code2": "from sys import stdin\nimport sys\nsys.setrecursionlimit(10000)\ninput = stdin.readline\n\nn = int(input().rstrip())\ns = int(input().rstrip())\n\ndef f(b, n):\n\tif n < b:\n\t\treturn n\n\telse:\n\t\treturn f(b, int(n/b)) + (n % b)\nif s == n:\n\tprint(n+1)\nelse:\n\tfor i in range(2, int(n**(1/2))+1):\n\t\tif f(i, n) == s:\n\t\t\tprint(i)\n\t\t\tbreak\n\telse:\n\t\tfor p in range(int(n**(1/2)), 0, -1):\n\t\t\tif (n-s) % p == 0:\n\t\t\t\tb = (n-s)/p + 1\n\t\t\t\tif b >= 2 and f(b, n) == s:\n\t\t\t\t\tprint(int(b))\n\t\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tcontinue\n\t\telse:\n\t\t\tprint(-1)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554423699", "date2": "1554424153", "bleu_score": "0.9819555303097414", "code1_test_status": [1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 54, "total_score": 105, "input": "87654\n438\n", "actual_output": "87217\n", "expected_output": "317\n\n", "anno_code": ["from sys import stdin\nimport sys\nsys.setrecursionlimit(10000) # (0): NO CHANGE\ninput = stdin.readline # (1): input=\n\nn = int(input().rstrip()) # (2): n=87654\ns = int(input().rstrip()) # (3): s=438\n\ndef f(b, n): # (4): f=\n\tif n < b: # (8): n=43827 (9): n=21913 ... (1576): stdin=<_io.TextIOWrapper name='../../test/autoComment2\\\\Dev\\\\p04014\\\\input_s995385208.txt' mode='r' encoding='utf-8'>, sys=, input=, n=87654, s=438, f=, i=296, p=1\n\t\treturn n\n\telse:\n\t\treturn f(b, int(n/b)) + (n % b)\nif s == n: # (5): NO CHANGE\n\tprint(n+1)\nelse:\n\tfor i in range(2, int(n**(1/2))+1): # (6): i=2 (25): i=3 ... (1570): NO CHANGE\n\t\tif f(i, n) == s: # (7): b=2 (26): b=3 ... (1566): b=296\n\t\t\tprint(i)\n\t\t\tbreak\n\telse:\n\t\tfor p in range(1, int(n**(1/2))+1): # (1571): p=1\n\t\t\tif (n-s) % p == 0: # (1572): NO CHANGE\n\t\t\t\tb = (n-s)/p + 1 # (1573): b=87217.0\n\t\t\t\tif b >= 2 and f(b, n) == s: # (1574): NO CHANGE\n\t\t\t\t\tprint(int(b)) # (1577): NO CHANGE\n\t\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tcontinue\n\t\telse:\n\t\t\tprint(-1)"], "anno_status": [true], "diff_content": " from sys import stdin\n import sys\n sys.setrecursionlimit(10000)\n input = stdin.readline\n \n n = int(input().rstrip())\n s = int(input().rstrip())\n \n def f(b, n):\n \tif n < b:\n \t\treturn n\n \telse:\n \t\treturn f(b, int(n/b)) + (n % b)\n if s == n:\n \tprint(n+1)\n else:\n \tfor i in range(2, int(n**(1/2))+1):\n \t\tif f(i, n) == s:\n \t\t\tprint(i)\n \t\t\tbreak\n \telse:\n-\t\tfor p in range(1, int(n**(1/2))+1):\n+\t\tfor p in range(int(n**(1/2)), 0, -1):\n \t\t\tif (n-s) % p == 0:\n \t\t\t\tb = (n-s)/p + 1\n \t\t\t\tif b >= 2 and f(b, n) == s:\n \t\t\t\t\tprint(int(b))\n \t\t\t\t\tbreak\n \t\t\telse:\n \t\t\t\tcontinue\n \t\telse:\n \t\t\tprint(-1)\n+\n", "FL_content": "\n from sys import stdin\n import sys\n sys.setrecursionlimit(10000)\n input = stdin.readline\n \n n = int(input().rstrip())\n s = int(input().rstrip())\n \n def f(b, n):\n \tif n < b:\n \t\treturn n\n \telse:\n-\t\treturn f(b, int(n/b)) + (n % b)\n if s == n:\n \tprint(n+1)\n else:\n \tfor i in range(2, int(n**(1/2))+1):\n \t\tif f(i, n) == s:\n \t\t\tprint(i)\n \t\t\tbreak\n \telse:\n \t\tfor p in range(1, int(n**(1/2))+1):\n \t\t\tif (n-s) % p == 0:\n-\t\t\t\tb = (n-s)/p + 1\n \t\t\t\tif b >= 2 and f(b, n) == s:\n \t\t\t\t\tprint(int(b))\n \t\t\t\t\tbreak\n \t\t\telse:\n \t\t\t\tcontinue\n \t\telse:\n \t\t\tprint(-1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 31 }, { "user_id": "u693716675", "problem_id": "p04008", "submission1_id": "s519353299-FL", "submission2_id": "s728107826", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\nimport sys\nsys.setrecursionlimit(2 * 10 ** 5 + 10)\n\nn,k = [int(i) for i in input().split()]\na = [int(i)-1 for i in input().split()]\n\n\n\ndef dfs(u):\n global cnt\n depth = 0 \n \n for v in edges[u]:\n depth = max(depth, dfs(v)+1) \n \n if depth>=k and u!=0:\n cnt += 1\n depth = 0\n \n return depth\n\n\ncnt = 0\nif a[0]!=0:\n cnt += 1\n\nedges = [[] for _ in range(n)]\nfor i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n\ndfs(0) \nprint(cnt)", "code2": "\n\n\n\nimport sys\nsys.setrecursionlimit(2 * 10 ** 5 + 10)\n\nn,k = [int(i) for i in input().split()]\na = [int(i)-1 for i in input().split()]\n\n\n\ndef dfs(u):\n global cnt\n depth = 0 \n \n for v in edges[u]:\n depth = max(depth, (dfs(v)+1)%k) \n \n \n if depth==k-1 and u!=0 and a[u] != 0:\n cnt += 1\n \n return depth\n\n\ncnt = 0\nif a[0]!=0:\n cnt += 1\n\nedges = [[] for _ in range(n)]\nfor i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n\ndfs(0) \nprint(cnt)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583628540", "date2": "1583629077", "bleu_score": "0.9400062536958428", "code1_test_status": [1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 84, "total_score": 97, "input": "8 2\n4 1 4 5 2 2 5 4\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["\n\n\n\nimport sys\nsys.setrecursionlimit(2 * 10 ** 5 + 10) # (0): NO CHANGE\n\nn,k = [int(i) for i in input().split()] # (1): n=8, k=2\na = [int(i)-1 for i in input().split()] # (2): a=[3, 0, 3, 4, 1, 1, 4, 3]\n\n\n\ndef dfs(u): # (3): dfs=\n global cnt\n depth = 0 # (31): depth=0 (34): depth=0 ... (64): depth=0\n \n for v in edges[u]: # (32): v=1 (35): v=4 ... (69): NO CHANGE\n depth = max(depth, dfs(v)+1) # (33): u=1 (36): u=4 ... (63): u=5\n \n if depth>=k and u!=0: # (45): u=3, depth=1, v=2 (50): u=3, depth=1, v=7 ... (70): sys=, n=8, k=2, a=[3, 0, 3, 4, 1, 1, 4, 3], dfs=, cnt=2, edges, i=7, pa=3\n cnt += 1 # (60): NO CHANGE\n depth = 0 # (61): u=1, depth=1, v=4\n \n return depth\n\n\ncnt = 0 # (4): cnt=0\nif a[0]!=0: # (5): NO CHANGE\n cnt += 1 # (6): cnt=1\n\nedges = [[] for _ in range(n)] # (7): edges\nfor i in range(1,n): # (8): i=1 (11): edges, i=2 ... (29): edges\n pa = a[i] # (9): pa=0 (12): edges=[[1], [], [], [], [], [], [], []], pa=3 ... (27): edges, pa=3\n edges[a[i]].append(i) # (10): edges (13): edges ... (28): edges\n\ndfs(0) # (30): u=0\nprint(cnt)"], "anno_status": [true], "diff_content": " \n \n \n \n import sys\n sys.setrecursionlimit(2 * 10 ** 5 + 10)\n \n n,k = [int(i) for i in input().split()]\n a = [int(i)-1 for i in input().split()]\n \n \n \n def dfs(u):\n global cnt\n depth = 0 \n \n for v in edges[u]:\n- depth = max(depth, dfs(v)+1) \n+ depth = max(depth, (dfs(v)+1)%k) \n+ \n \n- if depth>=k and u!=0:\n+ if depth==k-1 and u!=0 and a[u] != 0:\n cnt += 1\n- depth = 0\n- \n+ \n return depth\n \n \n cnt = 0\n if a[0]!=0:\n cnt += 1\n \n edges = [[] for _ in range(n)]\n for i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n \n dfs(0) \n print(cnt)\n", "FL_content": "\n \n \n \n \n import sys\n sys.setrecursionlimit(2 * 10 ** 5 + 10)\n \n n,k = [int(i) for i in input().split()]\n a = [int(i)-1 for i in input().split()]\n \n \n \n def dfs(u):\n global cnt\n depth = 0 \n \n for v in edges[u]:\n depth = max(depth, dfs(v)+1) \n \n if depth>=k and u!=0:\n cnt += 1\n depth = 0\n \n return depth\n \n \n cnt = 0\n-if a[0]!=0:\n cnt += 1\n \n edges = [[] for _ in range(n)]\n for i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n \n dfs(0) \n print(cnt)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 37 }, { "user_id": "u335664637", "problem_id": "p03129", "submission1_id": "s839223054-FL", "submission2_id": "s626986195", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=input()\nN=int(a.split()[0])\nK=int(a.split()[1])\n\nif(N>(K/2-1)):\n print('YES')\nelse:\n print('NO')", "code2": "a=input()\nN=int(a.split()[0])\nK=int(a.split()[1])\n\nif((N/2+1)>K):\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549764341", "date2": "1549764439", "bleu_score": "0.9197759485877773", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 49, "total_score": 60, "input": "10 19\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["a=input() # (0): a=10 19\nN=int(a.split()[0]) # (1): N=10\nK=int(a.split()[1]) # (2): K=19\n\nif(N>(K/2-1)): # (3): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " a=input()\n N=int(a.split()[0])\n K=int(a.split()[1])\n \n-if(N>(K/2-1)):\n+if((N/2+1)>K):\n print('YES')\n else:\n print('NO')\n", "FL_content": "\n a=input()\n N=int(a.split()[0])\n K=int(a.split()[1])\n \n-if(N>(K/2-1)):\n print('YES')\n else:\n print('NO')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u094191970", "problem_id": "p03957", "submission1_id": "s569374777-FL", "submission2_id": "s610880873", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nt=0\nfor i in range(len(s)):\n if s[i]=='C':\n t=i\n if s[i]=='F' and i>t:\n print('Yes')\n exit()\nprint('No')", "code2": "s=input()\nt=100\nfor i in range(len(s)):\n if s[i]=='C':\n t=i\n if s[i]=='F' and i>t:\n print('Yes')\n exit()\nprint('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574309463", "date2": "1574309592", "bleu_score": "0.9751674118441185", "code1_test_status": [1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1], "code1_test_score": 67, "total_score": 103, "input": "DF\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " s=input()\n-t=0\n+t=100\n for i in range(len(s)):\n if s[i]=='C':\n t=i\n if s[i]=='F' and i>t:\n print('Yes')\n exit()\n print('No')\n", "FL_content": "\n s=input()\n-t=0\n for i in range(len(s)):\n if s[i]=='C':\n- t=i\n- if s[i]=='F' and i>t:\n print('Yes')\n exit()\n print('No')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u005977014", "problem_id": "p03957", "submission1_id": "s953605030-FL", "submission2_id": "s069997183", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=list(map(str,input()))\nif 'C' in s and 'F' in s:\n if s.index('C')= 0 and x <= y:\n print(y-x)\nelif x >= 0 and x > y:\n if x <= (-y): \n print(abs(x-(-y))+1)\n else: \n print(abs(y-(-x))+1)\nelif x < 0 and x > y: \n print(min(abs(x-y)+2, -y -x+1))\nelif x < 0 and x < y: \n if (-x) < y: \n print(min(abs(y-x),abs(y-(-x))+1))\n else:\n print(abs(y - x))\n\n", "code2": "x,y = map(int, input().split())\nif x == y :\n print(0)\nelif (-x) == y:\n print(1)\nelif x >= 0 and x < y: \n print(y-x)\nelif x >= 0 and x > y: \n if x <= (-y): \n print(abs(x-(-y))+1)\n else: \n print(min(abs(y-(-x))+1,abs(x-y)+2))\nelif x < 0 and x > y: \n print(min(abs(x-y)+2, -y -x+1))\nelif x < 0 and x < y: \n if y > 0: \n print(min(abs(y-x),abs((-y)-x)+1))\n else:\n print(abs(y - x))\n\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600146477", "date2": "1600147153", "bleu_score": "0.9249062786876675", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 90, "input": "101 1\n", "actual_output": "103\n", "expected_output": "102\n\n", "anno_code": ["x,y = map(int, input().split()) # (0): x=101, y=1\nif x == y : # (1): NO CHANGE\n print(0)\nelif (-x) == y: # (2): NO CHANGE\n print(1)\nelif x >= 0 and x <= y: # (3): NO CHANGE\n print(y-x)\nelif x >= 0 and x > y: # (4): NO CHANGE\n if x <= (-y): # (5): NO CHANGE\n print(abs(x-(-y))+1)\n else: \n print(abs(y-(-x))+1)\nelif x < 0 and x > y: \n print(min(abs(x-y)+2, -y -x+1))\nelif x < 0 and x < y: \n if (-x) < y: \n print(min(abs(y-x),abs(y-(-x))+1))\n else:\n print(abs(y - x))\n\n"], "anno_status": [true], "diff_content": " x,y = map(int, input().split())\n if x == y :\n print(0)\n elif (-x) == y:\n print(1)\n-elif x >= 0 and x <= y:\n+elif x >= 0 and x < y: \n print(y-x)\n-elif x >= 0 and x > y:\n+elif x >= 0 and x > y: \n if x <= (-y): \n print(abs(x-(-y))+1)\n else: \n- print(abs(y-(-x))+1)\n+ print(min(abs(y-(-x))+1,abs(x-y)+2))\n elif x < 0 and x > y: \n print(min(abs(x-y)+2, -y -x+1))\n elif x < 0 and x < y: \n- if (-x) < y: \n- print(min(abs(y-x),abs(y-(-x))+1))\n+ if y > 0: \n+ print(min(abs(y-x),abs((-y)-x)+1))\n else:\n print(abs(y - x))\n \n \n", "FL_content": "\n x,y = map(int, input().split())\n if x == y :\n print(0)\n elif (-x) == y:\n print(1)\n elif x >= 0 and x <= y:\n print(y-x)\n elif x >= 0 and x > y:\n if x <= (-y): \n print(abs(x-(-y))+1)\n else: \n print(abs(y-(-x))+1)\n elif x < 0 and x > y: \n print(min(abs(x-y)+2, -y -x+1))\n elif x < 0 and x < y: \n if (-x) < y: \n print(min(abs(y-x),abs(y-(-x))+1))\n else:\n print(abs(y - x))\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 21 }, { "user_id": "u141610915", "problem_id": "p03313", "submission1_id": "s575987890-FL", "submission2_id": "s431962847", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nN = int(input())\na = list(map(int, input().split()))\nzeta = a[: ]\nzeta2 = [0] * (1 << N)\nfor i in range(N):\n for j in range(1 << N):\n if (1 << i) & j:\n if zeta[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = zeta[j]\n zeta[j] = zeta[(1 << i) ^ j]\n elif zeta2[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = zeta[(1 << i) ^ j]\n\nfor i in range((1 << N) - 1):\n zeta[i + 1] = max(zeta[i + 1], zeta[i])\n zeta2[i + 1] = max(zeta2[i + 1], zeta2[i])\n\nfor i in range(1, 1 << N): print(zeta[i] + zeta2[i])", "code2": "import sys\ninput = sys.stdin.readline\nN = int(input())\na = list(map(int, input().split()))\nzeta = a[: ]\nzeta2 = [0] * (1 << N)\nfor i in range(N):\n for j in range(1 << N):\n if (1 << i) & j:\n if zeta[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = max(zeta[j], zeta2[(1 << i) ^ j])\n zeta[j] = zeta[(1 << i) ^ j]\n elif zeta2[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = zeta[(1 << i) ^ j]\n\nres = 0\nfor i in range(1, 1 << N):\n res = max(res, zeta[i] + zeta2[i])\n print(res)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1588799883", "date2": "1588800345", "bleu_score": "0.8326776171286672", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 53, "total_score": 103, "input": "4\n16 9 4 19 82 17 90 42 0 1 41 188 332 80 31 3\n", "actual_output": "25\n25\n35\n98\n99\n172\n172\n172\n172\n172\n270\n414\n414\n422\n520\n", "expected_output": "25\n25\n35\n98\n99\n172\n172\n172\n172\n172\n229\n414\n414\n422\n520\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\nN = int(input()) # (1): N=4\na = list(map(int, input().split())) # (2): a=[16, 9, 4, 19, 82, 17, 90, 42, 0, 1, 41, 188, 332, 80, 31, 3]\nzeta = a[: ] # (3): zeta=[16, 9, 4, 19, 82, 17, 90, 42, 0, 1, 41, 188, 332, 80, 31, 3]\nzeta2 = [0] * (1 << N) # (4): zeta2=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(N): # (5): i=0 (62): i=1 ... (227): NO CHANGE\n for j in range(1 << N): # (6): j=0 (8): j=1 ... (226): NO CHANGE\n if (1 << i) & j: # (7): NO CHANGE (9): NO CHANGE ... (223): NO CHANGE\n if zeta[j] < zeta[(1 << i) ^ j]: # (10): NO CHANGE (17): NO CHANGE ... (224): NO CHANGE\n zeta2[j] = zeta[j] # (11): zeta2=[0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (25): zeta2=[0, 9, 0, 4, 0, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (196): zeta2=[0, 9, 4, 16, 16, 17, 82, 82, 0, 1, 0, 41, 0, 80, 41, 188]\n zeta[j] = zeta[(1 << i) ^ j] # (12): zeta=[16, 16, 4, 19, 82, 17, 90, 42, 0, 1, 41, 188, 332, 80, 31, 3] (26): zeta=[16, 16, 4, 19, 82, 82, 90, 42, 0, 1, 41, 188, 332, 80, 31, 3] ... (197): zeta=[16, 16, 16, 19, 82, 82, 90, 90, 16, 16, 41, 188, 332, 332, 332, 332]\n elif zeta2[j] < zeta[(1 << i) ^ j]: # (18): NO CHANGE (39): NO CHANGE ... (225): NO CHANGE\n zeta2[j] = zeta[(1 << i) ^ j] # (19): zeta2=[0, 9, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (46): zeta2=[0, 9, 0, 4, 0, 17, 0, 42, 0, 0, 0, 41, 0, 0, 0, 0] ... (221): zeta2=[0, 9, 4, 16, 16, 17, 82, 82, 0, 1, 16, 41, 82, 82, 90, 188]\n\nfor i in range((1 << N) - 1): # (228): i=0 (231): i=1 ... (273): NO CHANGE\n zeta[i + 1] = max(zeta[i + 1], zeta[i]) # (229): NO CHANGE (232): NO CHANGE ... (271): NO CHANGE\n zeta2[i + 1] = max(zeta2[i + 1], zeta2[i]) # (230): NO CHANGE (233): zeta2=[0, 9, 9, 16, 16, 17, 82, 82, 0, 1, 16, 41, 82, 82, 90, 188] ... (272): NO CHANGE\n\nfor i in range(1, 1 << N): print(zeta[i] + zeta2[i]) # (274): i=1 (275): i=2 ... (288): i=15\n"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n N = int(input())\n a = list(map(int, input().split()))\n zeta = a[: ]\n zeta2 = [0] * (1 << N)\n for i in range(N):\n for j in range(1 << N):\n if (1 << i) & j:\n if zeta[j] < zeta[(1 << i) ^ j]:\n- zeta2[j] = zeta[j]\n+ zeta2[j] = max(zeta[j], zeta2[(1 << i) ^ j])\n zeta[j] = zeta[(1 << i) ^ j]\n elif zeta2[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = zeta[(1 << i) ^ j]\n \n-for i in range((1 << N) - 1):\n- zeta[i + 1] = max(zeta[i + 1], zeta[i])\n- zeta2[i + 1] = max(zeta2[i + 1], zeta2[i])\n-\n-for i in range(1, 1 << N): print(zeta[i] + zeta2[i])\n+res = 0\n+for i in range(1, 1 << N):\n+ res = max(res, zeta[i] + zeta2[i])\n+ print(res)\n", "FL_content": "\n import sys\n input = sys.stdin.readline\n N = int(input())\n a = list(map(int, input().split()))\n-zeta = a[: ]\n-zeta2 = [0] * (1 << N)\n-for i in range(N):\n- for j in range(1 << N):\n- if (1 << i) & j:\n- if zeta[j] < zeta[(1 << i) ^ j]:\n- zeta2[j] = zeta[j]\n- zeta[j] = zeta[(1 << i) ^ j]\n- elif zeta2[j] < zeta[(1 << i) ^ j]:\n- zeta2[j] = zeta[(1 << i) ^ j]\n \n-for i in range((1 << N) - 1):\n- zeta[i + 1] = max(zeta[i + 1], zeta[i])\n- zeta2[i + 1] = max(zeta2[i + 1], zeta2[i])\n \n-for i in range(1, 1 << N): print(zeta[i] + zeta2[i])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u618373524", "problem_id": "p03556", "submission1_id": "s374883143-FL", "submission2_id": "s774532985", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nprint(int(n**0.5))", "code2": "n = int(input())\nm = int(n**0.5)\nprint(int(m**2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565808543", "date2": "1565808794", "bleu_score": "0.6884640967977812", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 83, "input": "312115444\n", "actual_output": "17666\n", "expected_output": "312087556\n\n", "anno_code": ["n = int(input()) # (0): n=312115444\nprint(int(n**0.5))"], "anno_status": [true], "diff_content": " n = int(input())\n-print(int(n**0.5))\n+m = int(n**0.5)\n+print(int(m**2))\n", "FL_content": "\n n = int(input())\n-print(int(n**0.5))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 2 }, { "user_id": "u867848444", "problem_id": "p03380", "submission1_id": "s610634971-FL", "submission2_id": "s376258686", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int,input().split()))\na = sorted(a, reverse = True)\n\nai = a[0] \naj = 0\ncomb = 10 ** 10\nfor i in range(n):\n temp = abs(a[i] - ai)\n if comb >= temp:\n comb = temp\n aj = a[i]\nprint(a[0], aj)", "code2": "n = int(input())\na = list(map(int,input().split()))\na = sorted(a, reverse = True)\n\nai = a[0] / 2\naj = 0\ncomb = 10 ** 10\nfor i in range(n):\n temp = abs(a[i] - ai)\n if comb >= temp:\n comb = temp\n aj = a[i]\nprint(a[0], aj)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588382645", "date2": "1588382751", "bleu_score": "0.9810183220324818", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "5\n2 0 0 4 1\n", "actual_output": "4 4\n", "expected_output": "4 2\n\n", "anno_code": ["n = int(input()) # (0): n=5\na = list(map(int,input().split())) # (1): a=[2, 0, 0, 4, 1]\na = sorted(a, reverse = True) # (2): a=[4, 2, 1, 0, 0]\n\nai = a[0] # (3): ai=4\naj = 0 # (4): aj=0\ncomb = 10 ** 10 # (5): comb=10000000000\nfor i in range(n): # (6): i=0 (11): i=1 ... (23): NO CHANGE\n temp = abs(a[i] - ai) # (7): temp=0 (12): temp=2 ... (21): NO CHANGE\n if comb >= temp: # (8): NO CHANGE (13): NO CHANGE ... (22): NO CHANGE\n comb = temp # (9): comb=0\n aj = a[i] # (10): aj=4\nprint(a[0], aj)"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int,input().split()))\n a = sorted(a, reverse = True)\n \n-ai = a[0] \n+ai = a[0] / 2\n aj = 0\n comb = 10 ** 10\n for i in range(n):\n temp = abs(a[i] - ai)\n if comb >= temp:\n comb = temp\n aj = a[i]\n print(a[0], aj)\n", "FL_content": "\n n = int(input())\n a = list(map(int,input().split()))\n a = sorted(a, reverse = True)\n \n ai = a[0] \n-aj = 0\n comb = 10 ** 10\n for i in range(n):\n temp = abs(a[i] - ai)\n if comb >= temp:\n comb = temp\n aj = a[i]\n-print(a[0], aj)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u707500405", "problem_id": "p03558", "submission1_id": "s940392819-FL", "submission2_id": "s226148919", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\nK = int(input())\nE = [[((i + 1) % K, 1)] for i in range(K)]\nfor i in range(1, K):\n\tE[i].append((i * 10 % K, 0))\nQ = deque([(1, 1)])\nreached = set([1])\nwhile 1:\n\ttmp_node, tmp_cost = Q.popleft()\n\tif tmp_node == 0:\n\t\tans = tmp_cost\n\t\tbreak\n\tfor nxt, dist in E[tmp_node]:\n\t\tif nxt in reached:\n\t\t\tcontinue\n\t\treached.add(nxt)\n\t\tif dist == 0:\n\t\t\tQ.appendleft((nxt, tmp_cost))\n\t\telse:\n\t\t\tQ.append((nxt, tmp_cost + 1))\nprint(ans)\n", "code2": "from collections import deque\nK = int(input())\nE = [[((i + 1) % K, 1)] for i in range(K)]\nfor i in range(1, K):\n\tE[i].append((i * 10 % K, 0))\nQ = deque([(1, 1)])\nreached = set()\nwhile 1:\n\ttmp_node, tmp_cost = Q.popleft()\n\tif tmp_node == 0:\n\t\tans = tmp_cost\n\t\tbreak\n\tif tmp_node in reached:\n\t\tcontinue\n\treached.add(tmp_node)\n\tfor nxt, dist in E[tmp_node]:\n\t\tif dist == 0:\n\t\t\tQ.appendleft((nxt, tmp_cost))\n\t\telse:\n\t\t\tQ.append((nxt, tmp_cost + 1))\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1513040611", "date2": "1513041252", "bleu_score": "0.9525329724155279", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 18, "total_score": 22, "input": "3197\n", "actual_output": "4\n", "expected_output": "2\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " from collections import deque\n K = int(input())\n E = [[((i + 1) % K, 1)] for i in range(K)]\n for i in range(1, K):\n \tE[i].append((i * 10 % K, 0))\n Q = deque([(1, 1)])\n-reached = set([1])\n+reached = set()\n while 1:\n \ttmp_node, tmp_cost = Q.popleft()\n \tif tmp_node == 0:\n \t\tans = tmp_cost\n \t\tbreak\n+\tif tmp_node in reached:\n+\t\tcontinue\n+\treached.add(tmp_node)\n \tfor nxt, dist in E[tmp_node]:\n-\t\tif nxt in reached:\n-\t\t\tcontinue\n-\t\treached.add(nxt)\n \t\tif dist == 0:\n \t\t\tQ.appendleft((nxt, tmp_cost))\n \t\telse:\n \t\t\tQ.append((nxt, tmp_cost + 1))\n print(ans)\n \n", "FL_content": "\n from collections import deque\n K = int(input())\n E = [[((i + 1) % K, 1)] for i in range(K)]\n for i in range(1, K):\n \tE[i].append((i * 10 % K, 0))\n Q = deque([(1, 1)])\n reached = set([1])\n while 1:\n \ttmp_node, tmp_cost = Q.popleft()\n \tif tmp_node == 0:\n \t\tans = tmp_cost\n \t\tbreak\n \tfor nxt, dist in E[tmp_node]:\n \t\tif nxt in reached:\n \t\t\tcontinue\n \t\treached.add(nxt)\n \t\tif dist == 0:\n \t\t\tQ.appendleft((nxt, tmp_cost))\n \t\telse:\n \t\t\tQ.append((nxt, tmp_cost + 1))\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u196653484", "problem_id": "p02318", "submission1_id": "s322177114-FL", "submission2_id": "s066226375", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def search(a,b):\n na=len(a)\n nb=len(b)\n array = [[0]*(nb+1) for _ in range(na+1)]\n for i in range(na):\n array[i][0]=i\n for j in range(nb):\n array[0][j]=j\n for i,x in enumerate(a,1):\n prerow=array[i-1]\n row=array[i]\n for j,y in enumerate(b,1):\n if x == y:\n row[j]=prerow[j-1]\n else:\n row[j]=min(prerow[j], prerow[j-1], row[j-1])+1\n \n return array[-1][-1]\n\na=input()\nb=input()\nprint(search(a,b))\n\n\n", "code2": "def search(a,b):\n na=len(a)\n nb=len(b)\n array = [[0]*(nb+1) for _ in range(na+1)]\n for i in range(na+1):\n array[i][0]=i\n for j in range(nb+1):\n array[0][j]=j\n for i,x in enumerate(a,1):\n prerow=array[i-1]\n row=array[i]\n for j,y in enumerate(b,1):\n if x == y:\n row[j]=prerow[j-1]\n else:\n row[j]=min(prerow[j], prerow[j-1], row[j-1])+1\n \n return array[-1][-1]\n\na=input()\nb=input()\nprint(search(a,b))\n\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1531899783", "date2": "1531899909", "bleu_score": "0.9862414435809479", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 102, "input": "cb`a\nmcc\n", "actual_output": "3\n", "expected_output": "4\n\n", "anno_code": ["def search(a,b): # (0): search=\n na=len(a) # (4): na=4\n nb=len(b) # (5): nb=3\n array = [[0]*(nb+1) for _ in range(na+1)] # (6): array\n for i in range(na): # (7): i=0 (9): i=1 ... (15): NO CHANGE\n array[i][0]=i # (8): NO CHANGE (10): array ... (14): array\n for j in range(nb): # (16): j=0 (18): j=1 ... (22): NO CHANGE\n array[0][j]=j # (17): NO CHANGE (19): array (21): array\n for i,x in enumerate(a,1): # (23): i=1, x=c (36): i=2, x=b ... (62): i=4, x=a\n prerow=array[i-1] # (24): prerow=[0, 1, 2, 0] (37): prerow=[1, 1, 1, 2] ... (63): prerow=[3, 3, 3, 3]\n row=array[i] # (25): row=[1, 0, 0, 0] (38): row=[2, 0, 0, 0] ... (64): row=[0, 0, 0, 0]\n for j,y in enumerate(b,1): # (26): j=1, y=m (29): j=2, y=c ... (74): NO CHANGE\n if x == y: # (27): NO CHANGE (30): NO CHANGE ... (72): NO CHANGE\n row[j]=prerow[j-1] # (31): array=[[0, 1, 2, 0], [1, 1, 1, 0], [2, 0, 0, 0], [3, 0, 0, 0], [0, 0, 0, 0]], row=[1, 1, 1, 0] (34): array, row=[1, 1, 1, 2]\n else:\n row[j]=min(prerow[j], prerow[j-1], row[j-1])+1 # (28): array=[[0, 1, 2, 0], [1, 1, 0, 0], [2, 0, 0, 0], [3, 0, 0, 0], [0, 0, 0, 0]], row=[1, 1, 0, 0] (41): array=[[0, 1, 2, 0], [1, 1, 1, 2], [2, 2, 0, 0], [3, 0, 0, 0], [0, 0, 0, 0]], row=[2, 2, 0, 0] ... (73): array, row=[0, 1, 2, 3]\n \n return array[-1][-1]\n\na=input() # (1): a=cb`a\nb=input() # (2): b=mcc\nprint(search(a,b)) # (3): NO CHANGE\n\n\n"], "anno_status": [true], "diff_content": " def search(a,b):\n na=len(a)\n nb=len(b)\n array = [[0]*(nb+1) for _ in range(na+1)]\n- for i in range(na):\n+ for i in range(na+1):\n array[i][0]=i\n- for j in range(nb):\n+ for j in range(nb+1):\n array[0][j]=j\n for i,x in enumerate(a,1):\n prerow=array[i-1]\n row=array[i]\n for j,y in enumerate(b,1):\n if x == y:\n row[j]=prerow[j-1]\n else:\n row[j]=min(prerow[j], prerow[j-1], row[j-1])+1\n \n return array[-1][-1]\n \n a=input()\n b=input()\n print(search(a,b))\n \n \n \n", "FL_content": "\n def search(a,b):\n na=len(a)\n nb=len(b)\n array = [[0]*(nb+1) for _ in range(na+1)]\n for i in range(na):\n array[i][0]=i\n for j in range(nb):\n array[0][j]=j\n for i,x in enumerate(a,1):\n prerow=array[i-1]\n row=array[i]\n for j,y in enumerate(b,1):\n if x == y:\n row[j]=prerow[j-1]\n else:\n- row[j]=min(prerow[j], prerow[j-1], row[j-1])+1\n \n return array[-1][-1]\n \n a=input()\n b=input()\n print(search(a,b))\n \n \n-\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 25 }, { "user_id": "u174181999", "problem_id": "p03031", "submission1_id": "s423770345-FL", "submission2_id": "s323989400", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\nl = []\nfor _ in range(M):\n l.append(list(map(int, input().split())))\np = list(map(int, input().split()))\n\nm = [0] * M \ncnt1 = 0 \ncnt2 = 0 \n\nfor i in range(2 ** N):\n for j in range(M):\n for k in range(l[j][0]):\n if (i >> (l[j][k+1] - 1) & 1):\n cnt1 += 1\n if cnt1 % 2 == p[j-1]:\n m[j-1] = 1\n cnt1 = 0\n if m == [1] * M:\n cnt2 += 1\n m = [0] * M\nprint(cnt2)", "code2": "N, M = map(int, input().split())\nl = []\nfor _ in range(M):\n l.append(list(map(int, input().split())))\np = list(map(int, input().split()))\n\nm = [0] * M \ncnt1 = 0 \ncnt2 = 0 \n\nfor i in range(2 ** N):\n for j in range(M):\n for k in range(l[j][0]):\n if (i >> (l[j][k+1] - 1) & 1):\n cnt1 += 1\n if cnt1 % 2 == p[j]:\n m[j] = 1\n cnt1 = 0\n if m == [1] * M:\n cnt2 += 1\n m = [0] * M\nprint(cnt2)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590021553", "date2": "1590022510", "bleu_score": "0.9831525222035907", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "2 3\n2 1 2\n1 1\n0 2\n0 0 1\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=2, M=3\nl = [] # (1): l=[]\nfor _ in range(M): # (2): _=0 (4): _=1 ... (8): l\n l.append(list(map(int, input().split()))) # (3): l=[[2, 1, 2]] (5): l (7): l\np = list(map(int, input().split())) # (9): l, p=[0, 0, 1]\n\nm = [0] * M # (10): l, m=[0, 0, 0]\ncnt1 = 0 # (11): l, cnt1=0\ncnt2 = 0 # (12): l, cnt2=0\n\nfor i in range(2 ** N): # (13): l, i=0 (37): l, i=1 ... (116): l\n for j in range(M): # (14): l, j=0 (22): l, j=1 ... (113): l\n for k in range(l[j][0]): # (15): l, k=0 (17): l, k=1 ... (109): l\n if (i >> (l[j][k+1] - 1) & 1): # (16): l (18): l ... (103): l\n cnt1 += 1 # (41): l, cnt1=1 (51): l, cnt1=1 ... (104): l, cnt1=1\n if cnt1 % 2 == p[j-1]: # (20): l (26): l ... (110): l\n m[j-1] = 1 # (27): l, m=[1, 0, 0] (32): l, m=[1, 1, 0] ... (111): l, m=[0, 1, 0]\n cnt1 = 0 # (21): l (28): l ... (112): l\n if m == [1] * M: # (35): l (61): l ... (114): l\n cnt2 += 1 # (88): l, cnt2=1\n m = [0] * M # (36): l, m=[0, 0, 0] (62): l, m=[0, 0, 0] ... (115): l, m=[0, 0, 0]\nprint(cnt2)"], "anno_status": [true], "diff_content": " N, M = map(int, input().split())\n l = []\n for _ in range(M):\n l.append(list(map(int, input().split())))\n p = list(map(int, input().split()))\n \n m = [0] * M \n cnt1 = 0 \n cnt2 = 0 \n \n for i in range(2 ** N):\n for j in range(M):\n for k in range(l[j][0]):\n if (i >> (l[j][k+1] - 1) & 1):\n cnt1 += 1\n- if cnt1 % 2 == p[j-1]:\n- m[j-1] = 1\n+ if cnt1 % 2 == p[j]:\n+ m[j] = 1\n cnt1 = 0\n if m == [1] * M:\n cnt2 += 1\n m = [0] * M\n print(cnt2)\n", "FL_content": "\n N, M = map(int, input().split())\n l = []\n for _ in range(M):\n l.append(list(map(int, input().split())))\n p = list(map(int, input().split()))\n \n m = [0] * M \n cnt1 = 0 \n cnt2 = 0 \n \n for i in range(2 ** N):\n for j in range(M):\n for k in range(l[j][0]):\n if (i >> (l[j][k+1] - 1) & 1):\n cnt1 += 1\n if cnt1 % 2 == p[j-1]:\n m[j-1] = 1\n cnt1 = 0\n if m == [1] * M:\n cnt2 += 1\n m = [0] * M\n print(cnt2)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u343150957", "problem_id": "p03448", "submission1_id": "s600658140-FL", "submission2_id": "s112193544", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A = int(input())\nB = int(input())\nC = int(input())\nX = int(input())\n\nans = 0\nfor i in range(A):\n\tfor j in range(B):\n\t\tfor k in range(C):\n\t\t\tif i*500 + j*100 + k*50 == X:\n\t\t\t\tans +=1\n\nprint(ans)", "code2": "\nA = int(input())\nB = int(input())\nC = int(input())\nX = int(input())\n\nans = 0\nfor i in range(A+1):\n\tfor j in range(B+1):\n\t\tfor k in range(C+1):\n\t\t\tif i*500 + j*100 + k*50 == X:\n\t\t\t\tans +=1\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569290348", "date2": "1569290396", "bleu_score": "0.941810942436174", "code1_test_status": [1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0], "code1_test_score": 92, "total_score": 103, "input": "2\n0\n1\n000\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["A = int(input()) # (0): A=2\nB = int(input()) # (1): B=0\nC = int(input()) # (2): C=1\nX = int(input()) # (3): X=0\n\nans = 0 # (4): ans=0\nfor i in range(A): # (5): i=0 (7): i=1 (9): NO CHANGE\n\tfor j in range(B): # (6): NO CHANGE (8): NO CHANGE\n\t\tfor k in range(C):\n\t\t\tif i*500 + j*100 + k*50 == X:\n\t\t\t\tans +=1\n\nprint(ans)"], "anno_status": [true], "diff_content": "+\n A = int(input())\n B = int(input())\n C = int(input())\n X = int(input())\n \n ans = 0\n-for i in range(A):\n-\tfor j in range(B):\n-\t\tfor k in range(C):\n+for i in range(A+1):\n+\tfor j in range(B+1):\n+\t\tfor k in range(C+1):\n \t\t\tif i*500 + j*100 + k*50 == X:\n \t\t\t\tans +=1\n \n print(ans)\n", "FL_content": "\n A = int(input())\n B = int(input())\n C = int(input())\n X = int(input())\n \n ans = 0\n-for i in range(A):\n-\tfor j in range(B):\n-\t\tfor k in range(C):\n \t\t\tif i*500 + j*100 + k*50 == X:\n \t\t\t\tans +=1\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u871841829", "problem_id": "p03945", "submission1_id": "s791517280-FL", "submission2_id": "s741750062", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\ns = input()\n\nbefore = s[0]\nans = 0\nfor cx in range(1, len(s)):\n if before != s[cx]:\n ans += 1\n before = s[cx]\n\nprint(abs)\n", "code2": "import sys\n\ns = input()\n\nbefore = s[0]\nans = 0\nfor cx in range(1, len(s)):\n if before != s[cx]:\n ans += 1\n before = s[cx]\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591456228", "date2": "1591456277", "bleu_score": "0.9831913138216002", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "BBBWW\n", "actual_output": "\n", "expected_output": "1\n", "anno_code": ["import sys\n\ns = input() # (0): s=BBBWW\n\nbefore = s[0] # (1): before=B\nans = 0 # (2): ans=0\nfor cx in range(1, len(s)): # (3): cx=1 (5): cx=2 ... (13): NO CHANGE\n if before != s[cx]: # (4): NO CHANGE (6): NO CHANGE ... (12): NO CHANGE\n ans += 1 # (9): ans=1\n before = s[cx] # (10): before=W\n\nprint(abs)\n"], "anno_status": [true], "diff_content": " import sys\n \n s = input()\n \n before = s[0]\n ans = 0\n for cx in range(1, len(s)):\n if before != s[cx]:\n ans += 1\n before = s[cx]\n \n-print(abs)\n+print(ans)\n \n", "FL_content": "\n import sys\n \n s = input()\n \n before = s[0]\n ans = 0\n for cx in range(1, len(s)):\n if before != s[cx]:\n ans += 1\n before = s[cx]\n \n-print(abs)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u902576227", "problem_id": "p03523", "submission1_id": "s030736452-FL", "submission2_id": "s342713726", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ns = input()\ntf = [True, False]\nf = False\nfor i in range(2):\n for j in range(2):\n for k in range(2):\n for l in range(2):\n for m in range(2):\n tmp = \"\"\n if tf[i]:\n tmp+=\"A\"\n tmp+=\"KI\"\n if tf[j]:\n tmp += \"A\"\n tmp += \"H\"\n if tf[k]:\n tmp += \"A\"\n tmp += \"B\"\n if tf[l]:\n tmp += \"A\"\n tmp += \"R\"\n if tf[m]:\n tmp += \"A\"\n if tmp == s:\n f = True\nprint(\"Yes\" if f else \"No\")", "code2": "\ns = input()\ntf = [True, False]\nf = False\nfor i in range(2):\n for j in range(2):\n for k in range(2):\n for l in range(2):\n for m in range(2):\n tmp = \"\"\n if tf[i]:\n tmp += \"A\"\n tmp += \"KIH\"\n if tf[k]:\n tmp += \"A\"\n tmp += \"B\"\n if tf[l]:\n tmp += \"A\"\n tmp += \"R\"\n if tf[m]:\n tmp += \"A\"\n if tmp == s:\n f = True\nprint(\"YES\" if f else \"NO\")\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1577803799", "date2": "1577803910", "bleu_score": "0.8599196805022437", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "PKIAG\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["\ns = input() # (0): s=PKIAG\ntf = [True, False] # (1): tf=[True, False]\nf = False # (2): f=False\nfor i in range(2): # (3): i=0 (273): i=1 (527): NO CHANGE\n for j in range(2): # (4): j=0 (142): j=1 ... (526): NO CHANGE\n for k in range(2): # (5): k=0 (75): k=1 ... (525): NO CHANGE\n for l in range(2): # (6): l=0 (41): l=1 ... (524): NO CHANGE\n for m in range(2): # (7): m=0 (24): m=1 ... (523): NO CHANGE\n tmp = \"\" # (8): tmp= (25): tmp= ... (512): tmp=\n if tf[i]: # (9): NO CHANGE (26): NO CHANGE ... (513): NO CHANGE\n tmp+=\"A\" # (10): tmp=A (27): tmp=A ... (259): tmp=A\n tmp+=\"KI\" # (11): tmp=AKI (28): tmp=AKI ... (514): tmp=KI\n if tf[j]: # (12): NO CHANGE (29): NO CHANGE ... (515): NO CHANGE\n tmp += \"A\" # (13): tmp=AKIA (30): tmp=AKIA ... (393): tmp=KIA\n tmp += \"H\" # (14): tmp=AKIAH (31): tmp=AKIAH ... (516): tmp=KIH\n if tf[k]: # (15): NO CHANGE (32): NO CHANGE ... (517): NO CHANGE\n tmp += \"A\" # (16): tmp=AKIAHA (33): tmp=AKIAHA ... (459): tmp=KIHA\n tmp += \"B\" # (17): tmp=AKIAHAB (34): tmp=AKIAHAB ... (518): tmp=KIHB\n if tf[l]: # (18): NO CHANGE (35): NO CHANGE ... (519): NO CHANGE\n tmp += \"A\" # (19): tmp=AKIAHABA (36): tmp=AKIAHABA ... (492): tmp=KIHBA\n tmp += \"R\" # (20): tmp=AKIAHABAR (37): tmp=AKIAHABAR ... (520): tmp=KIHBR\n if tf[m]: # (21): NO CHANGE (38): NO CHANGE ... (521): NO CHANGE\n tmp += \"A\" # (22): tmp=AKIAHABARA (56): tmp=AKIAHABRA ... (509): tmp=KIHBRA\n if tmp == s: # (23): NO CHANGE (39): NO CHANGE ... (522): NO CHANGE\n f = True\nprint(\"Yes\" if f else \"No\")"], "anno_status": [true], "diff_content": " \n s = input()\n tf = [True, False]\n f = False\n for i in range(2):\n for j in range(2):\n for k in range(2):\n for l in range(2):\n for m in range(2):\n tmp = \"\"\n if tf[i]:\n- tmp+=\"A\"\n- tmp+=\"KI\"\n- if tf[j]:\n tmp += \"A\"\n- tmp += \"H\"\n+ tmp += \"KIH\"\n if tf[k]:\n tmp += \"A\"\n tmp += \"B\"\n if tf[l]:\n tmp += \"A\"\n tmp += \"R\"\n if tf[m]:\n tmp += \"A\"\n if tmp == s:\n f = True\n-print(\"Yes\" if f else \"No\")\n+print(\"YES\" if f else \"NO\")\n+\n", "FL_content": "\n \n s = input()\n tf = [True, False]\n f = False\n for i in range(2):\n for j in range(2):\n for k in range(2):\n for l in range(2):\n for m in range(2):\n tmp = \"\"\n if tf[i]:\n tmp+=\"A\"\n tmp+=\"KI\"\n if tf[j]:\n tmp += \"A\"\n tmp += \"H\"\n if tf[k]:\n tmp += \"A\"\n tmp += \"B\"\n if tf[l]:\n tmp += \"A\"\n tmp += \"R\"\n if tf[m]:\n tmp += \"A\"\n if tmp == s:\n f = True\n-print(\"Yes\" if f else \"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u196653484", "problem_id": "p01102", "submission1_id": "s744231992-FL", "submission2_id": "s622750504", "status1": "Wrong Answer", "status2": "Accepted", "code1": "results=[]\nwhile True:\n a=input().split(\"\\\"\")\n if a[0]==\".\":\n break\n b=input().split(\"\\\"\")\n count1=0\n count2=0\n if len(a) != len(b):\n results.append(2)\n else:\n for i in range(len(a)):\n if(i%2==1):\n if len(a[i]) == 0 and len(b[i]) != 0:\n count1+=1\n elif len(a[i]) != 0 and len(b[i]) == 0:\n count1+=1 \n else:\n for k,l in zip(a[i],b[i]):\n if(k!=l):\n count1+=1\n else:\n if len(a[i]) == 0 and len(b[i]) != 0:\n count2+=1\n elif len(a[i]) != 0 and len(b[i]) == 0:\n count2+=1 \n else:\n for k,l in zip(a[i],b[i]):\n if(k!=l):\n count2+=1 \n if count1==0 and count2==0:\n results.append(0)\n elif count1==1 and count2==0:\n results.append(1)\n else:\n results.append(2)\nfor i in results:\n if i==0:\n print(\"IDENTICAL\")\n if i==1:\n print(\"CLOSE\")\n if i==2:\n print(\"DIFFERENT\")\n", "code2": "results=[]\nwhile True:\n a=input().split(\"\\\"\")\n if a[0]==\".\":\n break\n b=input().split(\"\\\"\")\n count1=0\n count2=0\n if len(a) != len(b):\n results.append(2)\n else:\n for i in range(len(a)):\n if(i%2==1):\n if len(a[i]) != len(b[i]):\n count1+=1\n else:\n for k,l in zip(a[i],b[i]):\n if(k!=l):\n count1+=1\n else:\n if len(a[i]) != len(b[i]):\n count2+=1\n else:\n for k,l in zip(a[i],b[i]):\n if(k!=l):\n count2+=1 \n if count1==0 and count2==0:\n results.append(0)\n elif count1==1 and count2==0:\n results.append(1)\n else:\n results.append(2)\nfor i in results:\n if i==0:\n print(\"IDENTICAL\")\n if i==1:\n print(\"CLOSE\")\n if i==2:\n print(\"DIFFERENT\")\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526536537", "date2": "1526536882", "bleu_score": "0.8213637646457067", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 28, "total_score": 101, "input": "print\"hello\";print133\nprint\"hello\";qrinu123\nread\"B1input\";somve;output;\n;tuptuo;evlos;\"2B\"daer\nread\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"\"\"\"\"\"\"\"\n\"\"\"52\"!#\"\"\nslow\"program\"\nfast\"code\"\n\"super\"fast\"program\"\n\"super\"faster\"prohram\"\nX\"\"\nY\nI\"S\"\"CREAM\"\nI\"CE\"\"BREAM\"\n11\"12\"11\n13\"3\"111\n.\n", "actual_output": "DIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\nDIFFERENT\nDIFFERENT\n", "expected_output": "DIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\n\n", "anno_code": ["results=[] # (0): results=[]\nwhile True: # (1): NO CHANGE (68): NO CHANGE ... (437): NO CHANGE\n a=input().split(\"\\\"\") # (2): a=['print', 'hello', ';print133'] (69): a=['read', 'B1input', ';somve;output;'] ... (438): a=['.']\n if a[0]==\".\": # (3): NO CHANGE (70): NO CHANGE ... (439): NO CHANGE\n break # (440): NO CHANGE\n b=input().split(\"\\\"\") # (4): b=['print', 'hello', ';qrinu123'] (71): b=[';tuptuo;evlos;', '2B', 'daer'] ... (402): b=['13', '3', '111']\n count1=0 # (5): count1=0 (72): NO CHANGE ... (403): count1=0\n count2=0 # (6): count2=0 (73): count2=0 ... (404): NO CHANGE\n if len(a) != len(b): # (7): NO CHANGE (74): NO CHANGE ... (405): NO CHANGE\n results.append(2) # (219): results=[2, 2, 2, 2] (346): results=[2, 2, 2, 2, 2, 1, 2]\n else:\n for i in range(len(a)): # (8): i=0 (23): i=1 ... (433): NO CHANGE\n if(i%2==1): # (9): NO CHANGE (24): NO CHANGE ... (425): NO CHANGE\n if len(a[i]) == 0 and len(b[i]) != 0: # (25): NO CHANGE (94): NO CHANGE ... (418): NO CHANGE\n count1+=1\n elif len(a[i]) != 0 and len(b[i]) == 0: # (26): NO CHANGE (95): NO CHANGE ... (419): NO CHANGE\n count1+=1 \n else:\n for k,l in zip(a[i],b[i]): # (27): k=h, l=h (29): k=e, l=e ... (423): NO CHANGE\n if(k!=l): # (28): NO CHANGE (30): NO CHANGE ... (421): NO CHANGE\n count1+=1 # (98): count1=1 (101): count1=2 ... (422): count1=1\n else:\n if len(a[i]) == 0 and len(b[i]) != 0: # (10): NO CHANGE (40): NO CHANGE ... (426): NO CHANGE\n count2+=1\n elif len(a[i]) != 0 and len(b[i]) == 0: # (11): NO CHANGE (41): NO CHANGE ... (427): NO CHANGE\n count2+=1 \n else:\n for k,l in zip(a[i],b[i]): # (12): k=p, l=p (14): k=r, l=r ... (432): NO CHANGE\n if(k!=l): # (13): NO CHANGE (15): NO CHANGE ... (431): NO CHANGE\n count2+=1 # (46): count2=1 (55): count2=2 ... (414): count2=1\n if count1==0 and count2==0: # (65): NO CHANGE (121): NO CHANGE ... (434): NO CHANGE\n results.append(0)\n elif count1==1 and count2==0: # (66): NO CHANGE (122): NO CHANGE ... (435): NO CHANGE\n results.append(1) # (338): results=[2, 2, 2, 2, 2, 1]\n else:\n results.append(2) # (67): results=[2] (123): results=[2, 2] ... (436): results=[2, 2, 2, 2, 2, 1, 2, 2, 2]\nfor i in results: # (441): NO CHANGE (446): NO CHANGE ... (481): NO CHANGE\n if i==0: # (442): NO CHANGE (447): NO CHANGE ... (482): NO CHANGE\n print(\"IDENTICAL\")\n if i==1: # (443): NO CHANGE (448): NO CHANGE ... (483): NO CHANGE\n print(\"CLOSE\") # (469): NO CHANGE\n if i==2: # (444): NO CHANGE (449): NO CHANGE ... (484): NO CHANGE\n print(\"DIFFERENT\") # (445): NO CHANGE (450): NO CHANGE ... (485): NO CHANGE\n"], "anno_status": [false], "diff_content": " results=[]\n while True:\n a=input().split(\"\\\"\")\n if a[0]==\".\":\n break\n b=input().split(\"\\\"\")\n count1=0\n count2=0\n if len(a) != len(b):\n results.append(2)\n else:\n for i in range(len(a)):\n if(i%2==1):\n- if len(a[i]) == 0 and len(b[i]) != 0:\n+ if len(a[i]) != len(b[i]):\n count1+=1\n- elif len(a[i]) != 0 and len(b[i]) == 0:\n- count1+=1 \n else:\n for k,l in zip(a[i],b[i]):\n if(k!=l):\n count1+=1\n else:\n- if len(a[i]) == 0 and len(b[i]) != 0:\n+ if len(a[i]) != len(b[i]):\n count2+=1\n- elif len(a[i]) != 0 and len(b[i]) == 0:\n- count2+=1 \n else:\n for k,l in zip(a[i],b[i]):\n if(k!=l):\n count2+=1 \n if count1==0 and count2==0:\n results.append(0)\n elif count1==1 and count2==0:\n results.append(1)\n else:\n results.append(2)\n for i in results:\n if i==0:\n print(\"IDENTICAL\")\n if i==1:\n print(\"CLOSE\")\n if i==2:\n print(\"DIFFERENT\")\n \n", "FL_content": "\n results=[]\n while True:\n a=input().split(\"\\\"\")\n if a[0]==\".\":\n break\n b=input().split(\"\\\"\")\n count1=0\n count2=0\n if len(a) != len(b):\n results.append(2)\n else:\n for i in range(len(a)):\n if(i%2==1):\n if len(a[i]) == 0 and len(b[i]) != 0:\n count1+=1\n elif len(a[i]) != 0 and len(b[i]) == 0:\n count1+=1 \n else:\n for k,l in zip(a[i],b[i]):\n if(k!=l):\n count1+=1\n else:\n if len(a[i]) == 0 and len(b[i]) != 0:\n count2+=1\n elif len(a[i]) != 0 and len(b[i]) == 0:\n count2+=1 \n else:\n for k,l in zip(a[i],b[i]):\n if(k!=l):\n count2+=1 \n if count1==0 and count2==0:\n results.append(0)\n elif count1==1 and count2==0:\n results.append(1)\n else:\n results.append(2)\n for i in results:\n if i==0:\n print(\"IDENTICAL\")\n if i==1:\n print(\"CLOSE\")\n if i==2:\n print(\"DIFFERENT\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 44 }, { "user_id": "u363836311", "problem_id": "p03556", "submission1_id": "s240698421-FL", "submission2_id": "s321796506", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nt=1\nwhile t*t??@>????@?>B@A@?@=???\n", "actual_output": "6397029\n", "expected_output": "6751269\n\n", "anno_code": ["\nimport sys\nimport itertools\nimport collections\nimport functools\nimport math\nfrom queue import Queue\nINF = float(\"inf\") # (0): INF=inf\n\nMOD = 1000000007 # (1): MOD=1000000007\n\nd = {} # (2): d={}\n\n\ndef thpow(q): # (3): thpow=\n if q < 0:\n return 0\n if q == 0:\n return 1\n if q in d:\n return d[q]\n else:\n d[q] = (3*thpow(q-1)) % MOD\n return d[q]\n\n\ndef solve(S: str): # (4): solve=\n dp = [0, 0, 0]\n q = 0\n for ch in S:\n \n a, b, c = dp\n if ch == \"A\":\n dp = [a+1, b, c]\n elif ch == \"B\":\n dp = [a, b+a, c]\n elif ch == \"C\":\n dp = [a, b, c+b]\n elif ch == \"?\":\n dp = [((a*3 % MOD)+thpow(q)) % MOD,\n ((b*3) % MOD+a) % MOD,\n ((c*3) % MOD+b) % MOD]\n q += 1\n \n print(dp[-1])\n return\n\n\ndef main(): # (5): main=\n\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n S = next(tokens) \n solve(S)\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [false], "diff_content": " \n import sys\n import itertools\n import collections\n import functools\n import math\n from queue import Queue\n INF = float(\"inf\")\n \n MOD = 1000000007 \n \n d = {}\n \n \n def thpow(q):\n if q < 0:\n return 0\n if q == 0:\n return 1\n if q in d:\n return d[q]\n else:\n d[q] = (3*thpow(q-1)) % MOD\n return d[q]\n \n \n def solve(S: str):\n dp = [0, 0, 0]\n q = 0\n for ch in S:\n- \n a, b, c = dp\n if ch == \"A\":\n- dp = [a+1, b, c]\n+ dp = [(a+thpow(q)) % MOD, b, c]\n elif ch == \"B\":\n- dp = [a, b+a, c]\n+ dp = [a, (b+a) % MOD, c]\n elif ch == \"C\":\n- dp = [a, b, c+b]\n+ dp = [a, b, (c+b) % MOD]\n elif ch == \"?\":\n dp = [((a*3 % MOD)+thpow(q)) % MOD,\n ((b*3) % MOD+a) % MOD,\n- ((c*3) % MOD+b) % MOD]\n+ ((c*3)+b) % MOD]\n q += 1\n+ \n+ \n+\n \n- print(dp[-1])\n+ print(dp[2])\n return\n \n \n def main():\n \n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n S = next(tokens) \n solve(S)\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": "\n \n import sys\n import itertools\n import collections\n import functools\n import math\n from queue import Queue\n INF = float(\"inf\")\n \n MOD = 1000000007 \n \n d = {}\n \n \n def thpow(q):\n if q < 0:\n return 0\n if q == 0:\n return 1\n if q in d:\n return d[q]\n else:\n d[q] = (3*thpow(q-1)) % MOD\n return d[q]\n \n \n def solve(S: str):\n dp = [0, 0, 0]\n q = 0\n for ch in S:\n \n a, b, c = dp\n if ch == \"A\":\n dp = [a+1, b, c]\n elif ch == \"B\":\n dp = [a, b+a, c]\n elif ch == \"C\":\n dp = [a, b, c+b]\n elif ch == \"?\":\n- dp = [((a*3 % MOD)+thpow(q)) % MOD,\n- ((b*3) % MOD+a) % MOD,\n- ((c*3) % MOD+b) % MOD]\n q += 1\n \n print(dp[-1])\n return\n \n \n def main():\n \n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n S = next(tokens) \n solve(S)\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 62 }, { "user_id": "u423585790", "problem_id": "p04008", "submission1_id": "s320622554-FL", "submission2_id": "s321934376", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(10**6)\nn,k = map(int,input().split())\na = [int(i)-1 for i in input().split()]\nedg = [[] for i in range(n)]\nfor i in range(1,n):\n edg[a[i]].append(i)\nans = [0] * n\nans[0] = a[0] != 0\ndef dfs(now):\n res = 0\n for e in edg[now]:\n res = max(res, dfs(e))\n if res == k - 1 and a[now] != 0 and now != 0:\n ans[now] = 1\n res = 0\n return res + 1\n \ndfs(0)\nprint(sum(ans))\n", "code2": "import sys\nsys.setrecursionlimit(10**6)\nn,k = map(int,input().split())\na = [int(i)-1 for i in input().split()]\nedg = [[] for i in range(n)]\nfor i in range(1,n):\n edg[a[i]].append(i)\nans = [0] * n\nans[0] = a[0] != 0\ndef dfs(now):\n res = 0\n for e in edg[now]:\n res = max(res, dfs(e)+1)\n if res == k - 1 and a[now] != 0:\n ans[now] = 1\n res = -1\n return res\n \ndfs(0)\nprint(sum(ans))\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1590165459", "date2": "1590166300", "bleu_score": "0.9477139321830219", "code1_test_status": [1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 85, "total_score": 97, "input": "8 1\n-1 1 4 5 1 1 5 4\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["import sys\nsys.setrecursionlimit(10**6) # (0): NO CHANGE\nn,k = map(int,input().split()) # (1): n=8, k=1\na = [int(i)-1 for i in input().split()] # (2): a=[-2, 0, 3, 4, 0, 0, 4, 3]\nedg = [[] for i in range(n)] # (3): edg\nfor i in range(1,n): # (4): i=1 (6): edg, i=2 ... (18): edg\n edg[a[i]].append(i) # (5): edg (7): edg ... (17): edg\nans = [0] * n # (19): edg, ans=[0, 0, 0, 0, 0, 0, 0, 0]\nans[0] = a[0] != 0 # (20): edg, ans=[True, 0, 0, 0, 0, 0, 0, 0]\ndef dfs(now): # (21): edg, dfs=\n res = 0 # (23): res=0 (26): res=0 ... (62): res=0\n for e in edg[now]: # (24): e=1 (27): NO CHANGE ... (65): NO CHANGE\n res = max(res, dfs(e)) # (25): now=1 (30): now=4 ... (61): now=5\n if res == k - 1 and a[now] != 0 and now != 0: # (28): now=0, res=1, e=1 (39): NO CHANGE ... (66): sys=, n=8, k=1, a=[-2, 0, 3, 4, 0, 0, 4, 3], edg=[[1, 4, 5], [], [], [2, 7], [3, 6], [], [], []], i=7, ans=[True, 0, 1, 0, 0, 0, 1, 1], dfs=\n ans[now] = 1 # (40): NO CHANGE (47): NO CHANGE (56): NO CHANGE\n res = 0 # (41): now=3, res=1, e=2 (48): now=3, res=1, e=7 (57): now=4, res=2, e=6\n return res + 1\n \ndfs(0) # (22): now=0\nprint(sum(ans))\n"], "anno_status": [true], "diff_content": " import sys\n sys.setrecursionlimit(10**6)\n n,k = map(int,input().split())\n a = [int(i)-1 for i in input().split()]\n edg = [[] for i in range(n)]\n for i in range(1,n):\n edg[a[i]].append(i)\n ans = [0] * n\n ans[0] = a[0] != 0\n def dfs(now):\n res = 0\n for e in edg[now]:\n- res = max(res, dfs(e))\n- if res == k - 1 and a[now] != 0 and now != 0:\n+ res = max(res, dfs(e)+1)\n+ if res == k - 1 and a[now] != 0:\n ans[now] = 1\n- res = 0\n- return res + 1\n+ res = -1\n+ return res\n \n dfs(0)\n print(sum(ans))\n \n", "FL_content": "\n import sys\n sys.setrecursionlimit(10**6)\n n,k = map(int,input().split())\n a = [int(i)-1 for i in input().split()]\n edg = [[] for i in range(n)]\n for i in range(1,n):\n edg[a[i]].append(i)\n ans = [0] * n\n-ans[0] = a[0] != 0\n def dfs(now):\n res = 0\n for e in edg[now]:\n res = max(res, dfs(e))\n if res == k - 1 and a[now] != 0 and now != 0:\n ans[now] = 1\n res = 0\n return res + 1\n \n dfs(0)\n print(sum(ans))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 21 }, { "user_id": "u962309487", "problem_id": "p03545", "submission1_id": "s953466940-FL", "submission2_id": "s294367658", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c,d = list(input())\nsign = '+-'\nfor i in range(2):\n for j in range(2):\n for k in range(2):\n if eval(a+sign[i]+b+sign[j]+c+sign[k]+d) == 7:\n print(a+sign[i]+b+sign[j]+c+sign[k]+d + '==7')", "code2": "a,b,c,d = list(input())\nsign = '+-'\nfor i in range(2):\n for j in range(2):\n for k in range(2):\n if eval(a+sign[i]+b+sign[j]+c+sign[k]+d) == 7:\n print(str(a+sign[i]+b+sign[j]+c+sign[k]+d) + '=7')\n exit()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583947864", "date2": "1583948235", "bleu_score": "0.8731429745770463", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 99, "input": "3611\n", "actual_output": "3+6-1-1==7\n", "expected_output": "3+6-1-1=7\n\n", "anno_code": ["a,b,c,d = list(input()) # (0): a=3, b=6, c=1, d=1 (6): NO CHANGE ... (36): NO CHANGE\nsign = '+-' # (1): sign=+-\nfor i in range(2): # (2): i=0 (21): i=1\n for j in range(2): # (3): j=0 (11): j=1 ... (38): NO CHANGE\n for k in range(2): # (4): k=0 (7): k=1 ... (37): NO CHANGE\n if eval(a+sign[i]+b+sign[j]+c+sign[k]+d) == 7: # (5): NO CHANGE (8): NO CHANGE ... (35): NO CHANGE\n print(a+sign[i]+b+sign[j]+c+sign[k]+d + '==7') # (18): NO CHANGE\n"], "anno_status": [true], "diff_content": " a,b,c,d = list(input())\n sign = '+-'\n for i in range(2):\n for j in range(2):\n for k in range(2):\n if eval(a+sign[i]+b+sign[j]+c+sign[k]+d) == 7:\n- print(a+sign[i]+b+sign[j]+c+sign[k]+d + '==7')\n+ print(str(a+sign[i]+b+sign[j]+c+sign[k]+d) + '=7')\n+ exit()\n+\n", "FL_content": "\n a,b,c,d = list(input())\n sign = '+-'\n for i in range(2):\n for j in range(2):\n for k in range(2):\n if eval(a+sign[i]+b+sign[j]+c+sign[k]+d) == 7:\n- print(a+sign[i]+b+sign[j]+c+sign[k]+d + '==7')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u980205854", "problem_id": "p03456", "submission1_id": "s015622076-FL", "submission2_id": "s326278392", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\na,b = map(int,input().split())\nx = a*len(str(b))+b\nans = 'No'\nfor y in range(1000):\n if x==y*y:\n ans = 'Yes'\n break\nprint(ans)", "code2": "\na,b = map(int,input().split())\nx = a*(10**len(str(b)))+b\nans = 'No'\nfor y in range(1000):\n if x==y*y:\n ans = 'Yes'\n break\nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1599354566", "date2": "1599354601", "bleu_score": "0.9527633389981477", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 84, "total_score": 91, "input": "001 000\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["\na,b = map(int,input().split()) # (0): a=1, b=0\nx = a*len(str(b))+b # (1): x=1\nans = 'No' # (2): ans=No\nfor y in range(1000): # (3): y=0 (5): y=1\n if x==y*y: # (4): NO CHANGE (6): NO CHANGE\n ans = 'Yes' # (7): ans=Yes\n break # (8): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " \n a,b = map(int,input().split())\n-x = a*len(str(b))+b\n+x = a*(10**len(str(b)))+b\n ans = 'No'\n for y in range(1000):\n if x==y*y:\n ans = 'Yes'\n break\n print(ans)\n", "FL_content": "\n \n a,b = map(int,input().split())\n-x = a*len(str(b))+b\n ans = 'No'\n for y in range(1000):\n if x==y*y:\n ans = 'Yes'\n break\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u663910047", "problem_id": "p02413", "submission1_id": "s377563832-FL", "submission2_id": "s349191573", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m = map(int,(input().split()))\na = []\nfor i in range(n):\n k = [int(i) for i in input().split()]\n k.append(sum(k))\n a.append(k)\n\nfor j in a:\n print(' '.join(map(str, j)))", "code2": "n,m = map(int,(input().split()))\na = []\ns = []\nfor i in range(m):\n s.append(0)\n\nfor i in range(n):\n k = [int(i) for i in input().split()]\n k.append(sum(k))\n a.append(k)\n for j in range(m):\n s[j] += k[j]\n\ns.append(sum(s))\na.append(s)\n\nfor j in a:\n print(' '.join(map(str, j)))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1500195852", "date2": "1500196870", "bleu_score": "0.607186674424615", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "4 5\n1 0 1 5 8\n2 2 2 4 5\n3 3 0 1 1\n2 3 4 4 0\n", "actual_output": "1 0 1 5 8 15\n2 2 2 4 5 15\n3 3 0 1 1 8\n2 3 4 4 0 13\n", "expected_output": "1 0 1 5 8 15\n2 2 2 4 5 15\n3 3 0 1 1 8\n2 3 4 4 0 13\n8 8 7 14 14 51\n\n", "anno_code": ["n,m = map(int,(input().split())) # (0): n=4, m=5\na = [] # (1): a=[]\nfor i in range(n): # (2): i=0 (6): i=1 ... (18): NO CHANGE\n k = [int(i) for i in input().split()] # (3): k=[1, 0, 1, 5, 8] (7): k=[2, 2, 2, 4, 5] ... (15): k=[2, 3, 4, 4, 0]\n k.append(sum(k)) # (4): k=[1, 0, 1, 5, 8, 15] (8): k=[2, 2, 2, 4, 5, 15] ... (16): k=[2, 3, 4, 4, 0, 13]\n a.append(k) # (5): a (9): a ... (17): a\n\nfor j in a: # (19): j=[1, 0, 1, 5, 8, 15] (21): j=[2, 2, 2, 4, 5, 15] ... (25): j=[2, 3, 4, 4, 0, 13]\n print(' '.join(map(str, j))) # (20): NO CHANGE (22): NO CHANGE ... (26): NO CHANGE\n"], "anno_status": [true], "diff_content": " n,m = map(int,(input().split()))\n a = []\n+s = []\n+for i in range(m):\n+ s.append(0)\n+\n for i in range(n):\n k = [int(i) for i in input().split()]\n k.append(sum(k))\n a.append(k)\n+ for j in range(m):\n+ s[j] += k[j]\n+\n+s.append(sum(s))\n+a.append(s)\n \n for j in a:\n print(' '.join(map(str, j)))\n", "FL_content": "\n n,m = map(int,(input().split()))\n a = []\n for i in range(n):\n k = [int(i) for i in input().split()]\n k.append(sum(k))\n a.append(k)\n \n for j in a:\n print(' '.join(map(str, j)))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u271752821", "problem_id": "p03147", "submission1_id": "s491864737-FL", "submission2_id": "s268341511", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nhs = [int(i) for i in input().split()]\nflag = -1\ncount = 0\n\nwhile max(hs) > 0:\n for i in range(n):\n if hs[i] > 0:\n if flag == 1:\n if i == n - 1:\n flag *= -1\n hs[i] -= 1\n else:\n count += 1\n flag *= -1\n hs[i] -= 1\n else:\n if flag == 1: \n flag *= -1\nprint(count)", "code2": "n = int(input())\nhs = [int(i) for i in input().split()]\nflag = -1\ncount = 0\n\nwhile max(hs) > 0:\n flag = -1\n for i in range(n):\n if hs[i] > 0:\n if flag == 1:\n hs[i] -= 1\n else:\n count += 1\n flag = 1\n hs[i] -= 1\n else:\n if flag == 1: \n flag = -1\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583880764", "date2": "1583882199", "bleu_score": "0.8635213137846783", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1], "code1_test_score": 93, "total_score": 99, "input": "8\n4 65 110 2 5 88 0 101\n", "actual_output": "294\n", "expected_output": "297\n\n", "anno_code": ["n = int(input()) # (0): n=8\nhs = [int(i) for i in input().split()] # (1): hs=[4, 65, 110, 2, 5, 88, 0, 101]\nflag = -1 # (2): flag=-1\ncount = 0 # (3): count=0\n\nwhile max(hs) > 0: # (4): NO CHANGE (47): NO CHANGE ... (4202): NO CHANGE\n for i in range(n): # (5): i=0 (11): i=1 ... (4201): NO CHANGE\n if hs[i] > 0: # (6): NO CHANGE (12): NO CHANGE ... (4199): NO CHANGE\n if flag == 1: # (7): NO CHANGE (13): NO CHANGE ... (4181): NO CHANGE\n if i == n - 1: # (14): NO CHANGE (19): NO CHANGE ... (2589): NO CHANGE\n flag *= -1\n hs[i] -= 1 # (15): hs=[3, 64, 110, 2, 5, 88, 0, 101] (20): hs=[3, 64, 109, 2, 5, 88, 0, 101] ... (2590): hs=[0, 0, 45, 0, 0, 24, 0, 37]\n else:\n count += 1 # (8): count=1 (43): count=2 ... (4182): count=294\n flag *= -1 # (9): flag=1 (44): flag=1 ... (4183): flag=1\n hs[i] -= 1 # (10): hs=[3, 65, 110, 2, 5, 88, 0, 101] (45): hs=[3, 64, 109, 1, 4, 87, 0, 100] ... (4184): hs=[0, 0, 0, 0, 0, 0, 0, 0]\n else:\n if flag == 1: # (38): NO CHANGE (80): NO CHANGE ... (4200): NO CHANGE\n flag *= -1 # (39): flag=-1 (81): flag=-1 ... (4188): flag=-1\nprint(count)"], "anno_status": [true], "diff_content": " n = int(input())\n hs = [int(i) for i in input().split()]\n flag = -1\n count = 0\n \n while max(hs) > 0:\n+ flag = -1\n for i in range(n):\n if hs[i] > 0:\n if flag == 1:\n- if i == n - 1:\n- flag *= -1\n hs[i] -= 1\n else:\n count += 1\n- flag *= -1\n+ flag = 1\n hs[i] -= 1\n else:\n if flag == 1: \n- flag *= -1\n+ flag = -1\n print(count)\n", "FL_content": "\n n = int(input())\n hs = [int(i) for i in input().split()]\n flag = -1\n count = 0\n \n while max(hs) > 0:\n for i in range(n):\n if hs[i] > 0:\n if flag == 1:\n- if i == n - 1:\n- flag *= -1\n hs[i] -= 1\n else:\n count += 1\n flag *= -1\n hs[i] -= 1\n else:\n if flag == 1: \n flag *= -1\n print(count)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u460229551", "problem_id": "p02921", "submission1_id": "s101099324-FL", "submission2_id": "s425433100", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S=input()\nT=input()\ncount=0\nfor i in range(0,2):\n if S[i]==T[i]:\n count+=1\nprint(count)", "code2": "S=input()\nT=input()\ncount=0\nfor i in range(0,3):\n if S[i]==T[i]:\n count+=1\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567365462", "date2": "1567365639", "bleu_score": "0.9736071380988617", "code1_test_status": [1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 80, "total_score": 103, "input": "VSS\nTRS\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["S=input() # (0): S=VSS\nT=input() # (1): T=TRS\ncount=0 # (2): count=0\nfor i in range(0,2): # (3): i=0 (5): i=1 (7): NO CHANGE\n if S[i]==T[i]: # (4): NO CHANGE (6): NO CHANGE\n count+=1\nprint(count)"], "anno_status": [true], "diff_content": " S=input()\n T=input()\n count=0\n-for i in range(0,2):\n+for i in range(0,3):\n if S[i]==T[i]:\n count+=1\n print(count)\n", "FL_content": "\n S=input()\n T=input()\n count=0\n-for i in range(0,2):\n if S[i]==T[i]:\n count+=1\n print(count)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u756829954", "problem_id": "p02948", "submission1_id": "s398926151-FL", "submission2_id": "s610647320", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def p_d():\n n, m = map(int, input().split())\n a = []\n b = []\n ans = 0\n\n for _ in range(n):\n s = list(map(int, input().split()))\n a.append(s[0])\n b.append(s[1])\n\n lv = [a[i] * b[i] for i in range(len(a))]\n li = sorted(zip(lv, a, b), reverse=True)\n\n for i in range(m):\n for j in range(len(li)):\n if li[j][1] <= m - i:\n ans += li.pop(j)[2]\n break\n\n print(ans)\n\n\nif __name__ == '__main__':\n p_d()\n", "code2": "from heapq import heappop, heappush\n\n\ndef p_d():\n n, m = map(int, input().split())\n ab = [tuple(map(int, input().split())) for _ in range(n)]\n\n ab.sort()\n ans = 0\n j = 0\n H = []\n\n for i in range(1, m + 1):\n while j < n and ab[j][0] <= i:\n heappush(H, -ab[j][1])\n j += 1\n\n if H:\n ans -= heappop(H)\n\n print(ans)\n\n\nif __name__ == '__main__':\n p_d()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565489931", "date2": "1565497334", "bleu_score": "0.6190288595937959", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 101, "total_score": 102, "input": "3 4\n4 3\n3 1\n2 4\n", "actual_output": "7\n", "expected_output": "8\n\n", "anno_code": ["def p_d(): # (0): p_d=\n n, m = map(int, input().split())\n a = []\n b = []\n ans = 0\n\n for _ in range(n):\n s = list(map(int, input().split()))\n a.append(s[0])\n b.append(s[1])\n\n lv = [a[i] * b[i] for i in range(len(a))]\n li = sorted(zip(lv, a, b), reverse=True)\n\n for i in range(m):\n for j in range(len(li)):\n if li[j][1] <= m - i:\n ans += li.pop(j)[2]\n break\n\n print(ans)\n\n\nif __name__ == '__main__':\n p_d()\n"], "anno_status": [true], "diff_content": "+from heapq import heappop, heappush\n+\n+\n def p_d():\n n, m = map(int, input().split())\n- a = []\n- b = []\n- ans = 0\n+ ab = [tuple(map(int, input().split())) for _ in range(n)]\n \n- for _ in range(n):\n- s = list(map(int, input().split()))\n- a.append(s[0])\n- b.append(s[1])\n+ ab.sort()\n+ ans = 0\n+ j = 0\n+ H = []\n \n- lv = [a[i] * b[i] for i in range(len(a))]\n- li = sorted(zip(lv, a, b), reverse=True)\n+ for i in range(1, m + 1):\n+ while j < n and ab[j][0] <= i:\n+ heappush(H, -ab[j][1])\n+ j += 1\n \n- for i in range(m):\n- for j in range(len(li)):\n- if li[j][1] <= m - i:\n- ans += li.pop(j)[2]\n- break\n+ if H:\n+ ans -= heappop(H)\n \n print(ans)\n \n \n if __name__ == '__main__':\n p_d()\n \n", "FL_content": "\n def p_d():\n n, m = map(int, input().split())\n a = []\n b = []\n ans = 0\n \n for _ in range(n):\n s = list(map(int, input().split()))\n a.append(s[0])\n b.append(s[1])\n \n lv = [a[i] * b[i] for i in range(len(a))]\n li = sorted(zip(lv, a, b), reverse=True)\n \n for i in range(m):\n for j in range(len(li)):\n- if li[j][1] <= m - i:\n ans += li.pop(j)[2]\n break\n \n print(ans)\n \n \n if __name__ == '__main__':\n p_d()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 26 }, { "user_id": "u144913062", "problem_id": "p02589", "submission1_id": "s190924986-FL", "submission2_id": "s639607482", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nbase = 1999849216943526259\nmod = (1 << 61) - 1\n\nN = int(input())\nS = [input().rstrip()[::-1] for _ in range(N)]\nS.sort(key=lambda s: -len(s))\ncnt = {}\nans = 0\none = [0] * 26\nfor s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n hashes[0] = ord(s[0]) - ord('a')\n for i in range(1, n - 1):\n hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\nprint(ans)\n", "code2": "import sys\ninput = sys.stdin.readline\n\nbase = 1999849216943526259\nmod = (1 << 61) - 1\n\nN = int(input())\nS = [input().rstrip()[::-1] for _ in range(N)]\nS.sort(key=lambda s: -len(s))\ncnt = {}\nans = 0\none = [0] * 26\nfor s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n hashes[0] = ord(s[0])\n for i in range(1, n - 1):\n hashes[i] = (hashes[i-1] * base + ord(s[i])) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597042459", "date2": "1597042563", "bleu_score": "0.9745539499791754", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 102, "input": "3\ndxyayb\nycw\naba\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\nbase = 1999849216943526259 # (1): base=1999849216943526259\nmod = (1 << 61) - 1 # (2): mod=2305843009213693951\n\nN = int(input()) # (3): N=3\nS = [input().rstrip()[::-1] for _ in range(N)] # (4): S=['byayxd', 'wcy', 'aba']\nS.sort(key=lambda s: -len(s)) # (5): NO CHANGE\ncnt = {} # (6): cnt={}\nans = 0 # (7): ans=0\none = [0] * 26 # (8): one=[0, 0, ..., 0, 0]\nfor s in S: # (9): s=byayxd (309): s=wcy ... (556): NO CHANGE\n n = len(s) # (10): n=6 (310): n=3 (433): NO CHANGE\n if n == 1: # (11): NO CHANGE (311): NO CHANGE (434): NO CHANGE\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1) # (12): hashes=[0, 0, 0, 0, 0] (312): hashes=[0, 0] (435): hashes=[0, 0]\n hashes[0] = ord(s[0]) - ord('a') # (13): hashes=[1, 0, 0, 0, 0] (313): hashes=[22, 0] (436): NO CHANGE\n for i in range(1, n - 1): # (14): i=1 (16): i=2 ... (439): NO CHANGE\n hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod # (15): hashes=[1, 1999849216943526283, 0, 0, 0] (17): hashes=[1, 1999849216943526283, 189721428698830257, 0, 0] ... (438): hashes=[0, 1]\n if hashes[-1] in cnt: # (23): NO CHANGE (317): NO CHANGE (440): NO CHANGE\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')] # (441): ans=1\n found = [0] * 26 # (24): found=[0, 0, ..., 0, 0] (318): found=[0, 0, ..., 0, 0] (442): found=[0, 0, ..., 0, 0]\n found[ord(s[-1]) - ord('a')] = 1 # (25): found=[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (319): found=[0, 0, ..., 1, 0] (443): found=[1, 0, ..., 0, 0]\n for i in range(n - 2, 0, -1): # (26): NO CHANGE (83): i=3 ... (501): NO CHANGE\n found[ord(s[i]) - ord('a')] = 1 # (27): found=[0, 0, ..., 0, 0] (84): found=[0, 0, ..., 1, 0] ... (445): found=[1, 1, ..., 0, 0]\n if hashes[i-1] not in cnt: # (28): NO CHANGE (85): NO CHANGE ... (446): NO CHANGE\n cnt[hashes[i-1]] = [0] * 26 # (29): cnt={1466238970679698543: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (86): cnt={1466238970679698543: [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], 189721428698830257: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} ... (447): cnt={1466238970679698543: [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], 189721428698830257: [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 1999849216943526283: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 1: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 22: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 0: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\n for c in range(26): # (30): c=0 (32): c=1 ... (500): NO CHANGE\n cnt[hashes[i-1]][c] += found[c] # (31): NO CHANGE (33): NO CHANGE ... (499): NO CHANGE\n found[ord(s[0]) - ord('a')] = 1 # (255): found=[1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0] (378): found=[0, 0, ..., 1, 0] (502): NO CHANGE\n for c in range(26): # (256): c=0 (258): c=1 ... (555): NO CHANGE\n one[c] += found[c] # (257): one=[1, 0, ..., 0, 0] (259): one=[1, 1, ..., 0, 0] ... (554): NO CHANGE\nprint(ans)\n"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n \n base = 1999849216943526259\n mod = (1 << 61) - 1\n \n N = int(input())\n S = [input().rstrip()[::-1] for _ in range(N)]\n S.sort(key=lambda s: -len(s))\n cnt = {}\n ans = 0\n one = [0] * 26\n for s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n- hashes[0] = ord(s[0]) - ord('a')\n+ hashes[0] = ord(s[0])\n for i in range(1, n - 1):\n- hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod\n+ hashes[i] = (hashes[i-1] * base + ord(s[i])) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\n print(ans)\n \n", "FL_content": "\n import sys\n input = sys.stdin.readline\n \n base = 1999849216943526259\n mod = (1 << 61) - 1\n \n N = int(input())\n S = [input().rstrip()[::-1] for _ in range(N)]\n S.sort(key=lambda s: -len(s))\n cnt = {}\n ans = 0\n one = [0] * 26\n for s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n hashes[0] = ord(s[0]) - ord('a')\n for i in range(1, n - 1):\n hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 36 }, { "user_id": "u321613164", "problem_id": "p02933", "submission1_id": "s424657122-FL", "submission2_id": "s256675745", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\ns = input()\nif a >= 3200:\n print(s)\nelse:\n print(\"Red\")", "code2": "a = int(input())\ns = input()\nif a >= 3200:\n print(s)\nelse:\n print(\"red\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566697788", "date2": "1566697913", "bleu_score": "0.9651391201669045", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 101, "total_score": 103, "input": "3199\npink\n", "actual_output": "Red\n", "expected_output": "red\n", "anno_code": ["a = int(input()) # (0): a=3199\ns = input() # (1): s=pink\nif a >= 3200: # (2): NO CHANGE\n print(s)\nelse:\n print(\"Red\")"], "anno_status": [true], "diff_content": " a = int(input())\n s = input()\n if a >= 3200:\n print(s)\n else:\n- print(\"Red\")\n+ print(\"red\")\n", "FL_content": "\n a = int(input())\n s = input()\n if a >= 3200:\n print(s)\n else:\n- print(\"Red\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u754022296", "problem_id": "p03880", "submission1_id": "s619249835-FL", "submission2_id": "s230585668", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nA = [int(input()) for _ in range(n)]\nm = 32\nC = [False]*m\nx = 0\nfor a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\ntotal = 0\nans = 0\nfor i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\nelse:\n print(ans)", "code2": "n = int(input())\nA = [int(input()) for _ in range(n)]\nm = 30\nC = [False]*m\nx = 0\nfor a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\n break\ntotal = 0\nans = 0\nfor i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\nelse:\n print(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1583188360", "date2": "1583188454", "bleu_score": "0.9553079095396975", "code1_test_status": [0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1], "code1_test_score": 60, "total_score": 89, "input": "3\n2\n5\n1\n", "actual_output": "2\n", "expected_output": "-1\n\n", "anno_code": ["n = int(input()) # (0): n=3\nA = [int(input()) for _ in range(n)] # (1): A=[2, 5, 1]\nm = 32 # (2): m=32\nC = [False]*m # (3): C=[False, False, ..., False, False]\nx = 0 # (4): x=0\nfor a in A: # (5): a=2 (73): a=5 ... (210): NO CHANGE\n x ^= a # (6): x=2 (74): x=7 (143): x=6\n for i in range(m): # (7): i=0 (9): i=1 ... (209): NO CHANGE\n if a>>i & 1: # (8): NO CHANGE (10): NO CHANGE ... (208): NO CHANGE\n C[i] = True # (11): C=[False, True, ..., False, False] (77): C=[True, True, ..., False, False] ... (146): NO CHANGE\ntotal = 0 # (211): total=0\nans = 0 # (212): ans=0\nfor i in range(m-1, -1, -1): # (213): NO CHANGE (215): i=30 ... (283): NO CHANGE\n if (x>>i & 1) ^ total: # (214): NO CHANGE (216): NO CHANGE ... (279): NO CHANGE\n if C[i]: # (273): NO CHANGE (280): NO CHANGE\n ans += 1 # (274): ans=1 (281): ans=2\n total ^= 1 # (275): total=1 (282): total=0\n else:\n print(-1)\n break\nelse:\n print(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n A = [int(input()) for _ in range(n)]\n-m = 32\n+m = 30\n C = [False]*m\n x = 0\n for a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\n+ break\n total = 0\n ans = 0\n for i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\n else:\n print(ans)\n", "FL_content": "\n n = int(input())\n A = [int(input()) for _ in range(n)]\n m = 32\n C = [False]*m\n x = 0\n for a in A:\n x ^= a\n for i in range(m):\n if a>>i & 1:\n C[i] = True\n total = 0\n ans = 0\n for i in range(m-1, -1, -1):\n if (x>>i & 1) ^ total:\n if C[i]:\n ans += 1\n total ^= 1\n else:\n print(-1)\n break\n else:\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u476225888", "problem_id": "p03172", "submission1_id": "s288974961-FL", "submission2_id": "s506888160", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n\n from bisect import bisect_left as bl, bisect_right as br, insort\n import sys\n import heapq\n \n from collections import defaultdict as dd, deque\n def data(): return sys.stdin.readline().strip()\n def mdata(): return list(map(int, data().split()))\n out = sys.stdout.write\n \n INF = int(1e9)\n mod = int(1e9)+7\n\n n,k=mdata()\n A=mdata()\n dp=[1 if A[0]>=i else 0 for i in range(k+1)]\n for i in range(1,n):\n for j in range(1,k+1):\n dp[j]=(dp[j]+dp[j-1])%mod\n for j in range(k+1):\n if A[i]\n\n from bisect import bisect_left as bl, bisect_right as br, insort\n import sys\n import heapq\n \n from collections import defaultdict as dd, deque\n def data(): return sys.stdin.readline().strip()\n def mdata(): return list(map(int, data().split()))\n out = sys.stdout.write\n \n INF = int(1e9)\n mod = int(1e9)+7\n\n n,k=mdata()\n A=mdata()\n dp=[1 if A[0]>=i else 0 for i in range(k+1)]\n for i in range(1,n):\n for j in range(1,k+1):\n dp[j]=(dp[j]+dp[j-1])%mod\n for j in range(k+1):\n if A[i]=i else 0 for i in range(k+1)]\n- for i in range(1,n):\n- for j in range(1,k+1):\n- dp[j]=(dp[j]+dp[j-1])%mod\n- for j in range(k+1):\n- if A[i]=i else 0 for i in range(k+1)]\n for i in range(1,n):\n for j in range(1,k+1):\n dp[j]=(dp[j]+dp[j-1])%mod\n for j in range(k+1):\n if A[i]0:\n h[i]-=1\n flag=1\n else:\n if flag==1:\n ans+=1\n flag=0\n if i==n-2:\n if h[n-1]>0:\n h[n-1]-=1\n ans+=1\n break\n else:\n if h[i]>0:\n ans+=1\n break\nprint(ans)\n", "code2": "n=int(input())\nh=list(map(int,input().split()))\nans=0\nif n==1:\n print(h[0])\n exit()\nwhile any(h)==True:\n flag=0\n for i in range(n-1):\n if h[i]>0:\n h[i]-=1\n flag=1\n else:\n if flag==1:\n ans+=1\n flag=0\n if i==n-2:\n if h[n-1]>0:\n h[n-1]-=1\n ans+=1\n else:\n if flag==1:\n ans+=1\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553718380", "date2": "1553719700", "bleu_score": "0.9036593522606018", "code1_test_status": [0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1], "code1_test_score": 67, "total_score": 99, "input": "5\n3 1 2 3 1\n", "actual_output": "4\n", "expected_output": "5\n", "anno_code": ["n=int(input()) # (0): n=5\nh=list(map(int,input().split())) # (1): h=[3, 1, 2, 3, 1]\nans=0 # (2): ans=0\nwhile any(h)==True: # (3): NO CHANGE (29): NO CHANGE ... (81): NO CHANGE\n flag=0 # (4): flag=0 (30): flag=0 (57): flag=0\n for i in range(n): # (5): i=0 (10): i=1 ... (73): i=3\n if h[i]>0: # (6): NO CHANGE (11): NO CHANGE ... (74): NO CHANGE\n h[i]-=1 # (7): h=[2, 1, 2, 3, 1] (12): h=[2, 0, 2, 3, 1] ... (75): h=[0, 0, 0, 0, 0]\n flag=1 # (8): flag=1 (13): NO CHANGE ... (76): flag=1\n else:\n if flag==1: # (38): NO CHANGE (65): NO CHANGE (71): NO CHANGE\n ans+=1 # (39): ans=2 (66): ans=4\n flag=0 # (40): flag=0 (67): flag=0\n if i==n-2: # (9): NO CHANGE (14): NO CHANGE ... (77): NO CHANGE\n if h[n-1]>0: # (25): NO CHANGE (52): NO CHANGE (78): NO CHANGE\n h[n-1]-=1 # (26): h=[2, 0, 1, 2, 0]\n ans+=1 # (27): ans=1\n break # (28): NO CHANGE\n else:\n if h[i]>0: # (53): NO CHANGE (79): NO CHANGE\n ans+=1 # (54): ans=3\n break # (55): NO CHANGE (80): NO CHANGE\nprint(ans)\n"], "anno_status": [true], "diff_content": " n=int(input())\n h=list(map(int,input().split()))\n ans=0\n+if n==1:\n+ print(h[0])\n+ exit()\n while any(h)==True:\n flag=0\n- for i in range(n):\n+ for i in range(n-1):\n if h[i]>0:\n h[i]-=1\n flag=1\n else:\n if flag==1:\n ans+=1\n flag=0\n if i==n-2:\n if h[n-1]>0:\n h[n-1]-=1\n ans+=1\n- break\n else:\n- if h[i]>0:\n+ if flag==1:\n ans+=1\n- break\n print(ans)\n \n", "FL_content": "\n n=int(input())\n h=list(map(int,input().split()))\n ans=0\n while any(h)==True:\n flag=0\n for i in range(n):\n if h[i]>0:\n h[i]-=1\n flag=1\n else:\n if flag==1:\n ans+=1\n flag=0\n- if i==n-2:\n- if h[n-1]>0:\n- h[n-1]-=1\n- ans+=1\n- break\n- else:\n- if h[i]>0:\n- ans+=1\n- break\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u423585790", "problem_id": "p03617", "submission1_id": "s626871032-FL", "submission2_id": "s961171707", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nfrom collections import defaultdict,deque\nfrom heapq import heappush, heappop\nfrom bisect import bisect_left, bisect_right\nimport sys, random, itertools, math\nsys.setrecursionlimit(10**5)\ninput = sys.stdin.readline\nsqrt = math.sqrt\ndef LI(): return list(map(int, input().split()))\ndef LF(): return list(map(float, input().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, input().split()))\ndef II(): return int(input())\ndef IF(): return float(input())\ndef LS(): return list(map(list, input().split()))\ndef S(): return list(input().rstrip())\ndef IR(n): return [II() for _ in range(n)]\ndef LIR(n): return [LI() for _ in range(n)]\ndef FR(n): return [IF() for _ in range(n)]\ndef LFR(n): return [LI() for _ in range(n)]\ndef LIR_(n): return [LI_() for _ in range(n)]\ndef SR(n): return [S() for _ in range(n)]\ndef LSR(n): return [LS() for _ in range(n)]\nmod = 1000000007\ninf = 1e10\n\n\ndef solve():\n q, h, s, d = LI()\n n = II()\n q4 = q * 4\n h2 = h * 2\n l1 = min(q4, h2, s)\n l2 = min(l1 * 2, d)\n print((n >> 1) * l2 + (n & 1 * l1))\n \n return\n\n\n\nif __name__ == '__main__':\n solve()\n", "code2": "\nfrom collections import defaultdict,deque\nfrom heapq import heappush, heappop\nfrom bisect import bisect_left, bisect_right\nimport sys, random, itertools, math\nsys.setrecursionlimit(10**5)\ninput = sys.stdin.readline\nsqrt = math.sqrt\ndef LI(): return list(map(int, input().split()))\ndef LF(): return list(map(float, input().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, input().split()))\ndef II(): return int(input())\ndef IF(): return float(input())\ndef LS(): return list(map(list, input().split()))\ndef S(): return list(input().rstrip())\ndef IR(n): return [II() for _ in range(n)]\ndef LIR(n): return [LI() for _ in range(n)]\ndef FR(n): return [IF() for _ in range(n)]\ndef LFR(n): return [LI() for _ in range(n)]\ndef LIR_(n): return [LI_() for _ in range(n)]\ndef SR(n): return [S() for _ in range(n)]\ndef LSR(n): return [LS() for _ in range(n)]\nmod = 1000000007\ninf = 1e10\n\n\ndef solve():\n q, h, s, d = LI()\n n = II()\n q4 = q * 4\n h2 = h * 2\n l1 = min(q4, h2, s)\n l2 = min(l1 * 2, d)\n print((n >> 1) * l2 + (n & 1) * l1)\n \n return\n\n\n\nif __name__ == '__main__':\n solve()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1578090843", "date2": "1578090915", "bleu_score": "0.997287106071775", "code1_test_status": [0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 26, "total_score": 104, "input": "41015 95070 23088 46307626\n30432\n", "actual_output": "702635040\n", "expected_output": "702614016\n\n", "anno_code": ["\nfrom collections import defaultdict,deque\nfrom heapq import heappush, heappop\nfrom bisect import bisect_left, bisect_right\nimport sys, random, itertools, math\nsys.setrecursionlimit(10**5) # (0): NO CHANGE\ninput = sys.stdin.readline # (1): input=\nsqrt = math.sqrt # (2): sqrt=, LI=, LF=, LI_=, II=, IF=, LS=, S=, IR=, LIR=, FR=, LFR=, LIR_=, SR=, LSR=\ndef LI(): return list(map(int, input().split()))\ndef LF(): return list(map(float, input().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, input().split()))\ndef II(): return int(input())\ndef IF(): return float(input())\ndef LS(): return list(map(list, input().split()))\ndef S(): return list(input().rstrip())\ndef IR(n): return [II() for _ in range(n)]\ndef LIR(n): return [LI() for _ in range(n)]\ndef FR(n): return [IF() for _ in range(n)]\ndef LFR(n): return [LI() for _ in range(n)]\ndef LIR_(n): return [LI_() for _ in range(n)]\ndef SR(n): return [S() for _ in range(n)]\ndef LSR(n): return [LS() for _ in range(n)]\nmod = 1000000007 # (3): mod=1000000007\ninf = 1e10 # (4): inf=10000000000.0\n\n\ndef solve(): # (5): solve=\n q, h, s, d = LI()\n n = II()\n q4 = q * 4\n h2 = h * 2\n l1 = min(q4, h2, s)\n l2 = min(l1 * 2, d)\n print((n >> 1) * l2 + (n & 1 * l1))\n \n return\n\n\n\nif __name__ == '__main__':\n solve()\n"], "anno_status": [false], "diff_content": " \n from collections import defaultdict,deque\n from heapq import heappush, heappop\n from bisect import bisect_left, bisect_right\n import sys, random, itertools, math\n sys.setrecursionlimit(10**5)\n input = sys.stdin.readline\n sqrt = math.sqrt\n def LI(): return list(map(int, input().split()))\n def LF(): return list(map(float, input().split()))\n def LI_(): return list(map(lambda x: int(x)-1, input().split()))\n def II(): return int(input())\n def IF(): return float(input())\n def LS(): return list(map(list, input().split()))\n def S(): return list(input().rstrip())\n def IR(n): return [II() for _ in range(n)]\n def LIR(n): return [LI() for _ in range(n)]\n def FR(n): return [IF() for _ in range(n)]\n def LFR(n): return [LI() for _ in range(n)]\n def LIR_(n): return [LI_() for _ in range(n)]\n def SR(n): return [S() for _ in range(n)]\n def LSR(n): return [LS() for _ in range(n)]\n mod = 1000000007\n inf = 1e10\n \n \n def solve():\n q, h, s, d = LI()\n n = II()\n q4 = q * 4\n h2 = h * 2\n l1 = min(q4, h2, s)\n l2 = min(l1 * 2, d)\n- print((n >> 1) * l2 + (n & 1 * l1))\n+ print((n >> 1) * l2 + (n & 1) * l1)\n \n return\n \n \n \n if __name__ == '__main__':\n solve()\n \n", "FL_content": "\n \n from collections import defaultdict,deque\n from heapq import heappush, heappop\n from bisect import bisect_left, bisect_right\n import sys, random, itertools, math\n sys.setrecursionlimit(10**5)\n input = sys.stdin.readline\n sqrt = math.sqrt\n def LI(): return list(map(int, input().split()))\n def LF(): return list(map(float, input().split()))\n def LI_(): return list(map(lambda x: int(x)-1, input().split()))\n def II(): return int(input())\n def IF(): return float(input())\n def LS(): return list(map(list, input().split()))\n def S(): return list(input().rstrip())\n def IR(n): return [II() for _ in range(n)]\n def LIR(n): return [LI() for _ in range(n)]\n def FR(n): return [IF() for _ in range(n)]\n def LFR(n): return [LI() for _ in range(n)]\n def LIR_(n): return [LI_() for _ in range(n)]\n def SR(n): return [S() for _ in range(n)]\n def LSR(n): return [LS() for _ in range(n)]\n mod = 1000000007\n inf = 1e10\n \n \n def solve():\n q, h, s, d = LI()\n n = II()\n q4 = q * 4\n h2 = h * 2\n l1 = min(q4, h2, s)\n l2 = min(l1 * 2, d)\n- print((n >> 1) * l2 + (n & 1 * l1))\n \n return\n \n \n \n if __name__ == '__main__':\n solve()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 42 }, { "user_id": "u476604182", "problem_id": "p02929", "submission1_id": "s773674056-FL", "submission2_id": "s432086902", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,S = open(0).read().split()\nN = int(N)\nT = []\nMOD = 10**9+7\nfor i,c in enumerate(S):\n if i%2==0:\n if c=='B':\n T.append('W')\n else:\n T.append('B')\n else:\n T.append(c)\n\npre = 0\nans = 1\nfor c in T:\n if c=='B':\n ans *= pre\n ans %= MOD\n pre -= 1\n else:\n pre += 1\ncoef = 1\nfor i in range(1,N+1):\n coef *= i\n coef %= MOD\nprint(ans*coef%MOD)", "code2": "\n\nN,S = open(0).read().split()\nN = int(N)\nT = []\nMOD = 10**9+7\nfor i,c in enumerate(S):\n if i%2==0:\n if c=='B':\n T.append('W')\n else:\n T.append('B')\n else:\n T.append(c)\n\npre = 0\nans = 1\nfor c in T:\n if c=='B':\n ans *= pre\n ans %= MOD\n pre -= 1\n flag = False\n else:\n pre += 1\nif T.count('B')!=T.count('W'):\n ans = 0\ncoef = 1\nfor i in range(1,N+1):\n coef *= i\n coef %= MOD\nprint(ans*coef%MOD)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585344255", "date2": "1585345039", "bleu_score": "0.8585477169906904", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "4\nBWBBWCWW\n", "actual_output": "288\n", "expected_output": "0\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": "+\n+\n N,S = open(0).read().split()\n N = int(N)\n T = []\n MOD = 10**9+7\n for i,c in enumerate(S):\n if i%2==0:\n if c=='B':\n T.append('W')\n else:\n T.append('B')\n else:\n T.append(c)\n \n pre = 0\n ans = 1\n for c in T:\n if c=='B':\n ans *= pre\n ans %= MOD\n pre -= 1\n+ flag = False\n else:\n pre += 1\n+if T.count('B')!=T.count('W'):\n+ ans = 0\n coef = 1\n for i in range(1,N+1):\n coef *= i\n coef %= MOD\n print(ans*coef%MOD)\n", "FL_content": "\n N,S = open(0).read().split()\n N = int(N)\n T = []\n MOD = 10**9+7\n for i,c in enumerate(S):\n if i%2==0:\n if c=='B':\n T.append('W')\n else:\n T.append('B')\n else:\n T.append(c)\n \n pre = 0\n ans = 1\n for c in T:\n if c=='B':\n ans *= pre\n ans %= MOD\n pre -= 1\n else:\n pre += 1\n coef = 1\n for i in range(1,N+1):\n coef *= i\n coef %= MOD\n print(ans*coef%MOD)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u909643606", "problem_id": "p03254", "submission1_id": "s980129722-FL", "submission2_id": "s935450553", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,x=[int(i) for i in input().split()]\na=[int(i) for i in input().split()]\na.sort()\ncount=0\nfor i in range(n):\n x-=a[i]\n if x>=0:\n count+=1\n \nprint(count)", "code2": "n,x=[int(i) for i in input().split()]\na=[int(i) for i in input().split()]\na.sort()\ncount=0\nfor i in range(n):\n x-=a[i]\n if x>=0 and i=0: # (6): NO CHANGE (10): NO CHANGE (14): NO CHANGE\n count+=1 # (7): count=1 (11): count=2 (15): count=3\n \nprint(count)"], "anno_status": [true], "diff_content": " n,x=[int(i) for i in input().split()]\n a=[int(i) for i in input().split()]\n a.sort()\n count=0\n for i in range(n):\n x-=a[i]\n- if x>=0:\n+ if x>=0 and i=0:\n count+=1\n \n print(count)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u540761833", "problem_id": "p03838", "submission1_id": "s009951454-FL", "submission2_id": "s676730689", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y = map(int,input().split())\nsuma = abs(abs(x)-abs(y))\nif abs(x) == abs(y):\n if x*y < 0:\n suma += 1\nelif abs(x) < abs(y):\n if x < 0:\n suma += 1\n if y < 0:\n suma += 1\n else:\n if y < 0:\n suma += 1\nelse:\n if x < 0:\n if y < 0:\n suma += 2\n else:\n suma += 1\n else:\n if y < 0:\n suma += 1\n else:\n suma += 2\nprint(suma)", "code2": "x,y = map(int,input().split())\nsuma = abs(abs(x)-abs(y))\nif x == 0:\n if y < 0:\n suma += 1\nelif y == 0:\n if x > 0:\n suma += 1\nelif abs(x) == abs(y):\n if x*y < 0:\n suma += 1\nelif abs(x) < abs(y):\n if x < 0:\n suma += 1\n if y < 0:\n suma += 1\n else:\n if y < 0:\n suma += 1\nelse:\n if x < 0:\n if y < 0:\n pass\n else:\n suma += 1\n else:\n if y < 0:\n suma += 1\n else:\n suma = min(x+y,(x-y)+2)\nprint(suma)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577124799", "date2": "1577125272", "bleu_score": "0.8101289716129928", "code1_test_status": [1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 65, "total_score": 90, "input": "40 0\n", "actual_output": "42\n", "expected_output": "41\n\n", "anno_code": ["x,y = map(int,input().split()) # (0): x=40, y=0\nsuma = abs(abs(x)-abs(y)) # (1): suma=40\nif abs(x) == abs(y): # (2): NO CHANGE\n if x*y < 0:\n suma += 1\nelif abs(x) < abs(y): # (3): NO CHANGE\n if x < 0:\n suma += 1\n if y < 0:\n suma += 1\n else:\n if y < 0:\n suma += 1\nelse:\n if x < 0: # (4): NO CHANGE\n if y < 0:\n suma += 2\n else:\n suma += 1\n else:\n if y < 0: # (5): NO CHANGE\n suma += 1\n else:\n suma += 2 # (6): suma=42\nprint(suma)"], "anno_status": [true], "diff_content": " x,y = map(int,input().split())\n suma = abs(abs(x)-abs(y))\n-if abs(x) == abs(y):\n+if x == 0:\n+ if y < 0:\n+ suma += 1\n+elif y == 0:\n+ if x > 0:\n+ suma += 1\n+elif abs(x) == abs(y):\n if x*y < 0:\n suma += 1\n elif abs(x) < abs(y):\n if x < 0:\n suma += 1\n if y < 0:\n suma += 1\n else:\n if y < 0:\n suma += 1\n else:\n if x < 0:\n if y < 0:\n- suma += 2\n+ pass\n else:\n suma += 1\n else:\n if y < 0:\n suma += 1\n else:\n- suma += 2\n+ suma = min(x+y,(x-y)+2)\n print(suma)\n", "FL_content": "\n x,y = map(int,input().split())\n-suma = abs(abs(x)-abs(y))\n if abs(x) == abs(y):\n if x*y < 0:\n suma += 1\n elif abs(x) < abs(y):\n if x < 0:\n suma += 1\n if y < 0:\n suma += 1\n else:\n if y < 0:\n suma += 1\n else:\n if x < 0:\n if y < 0:\n suma += 2\n else:\n suma += 1\n else:\n if y < 0:\n suma += 1\n else:\n suma += 2\n print(suma)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 25 }, { "user_id": "u814986259", "problem_id": "p03139", "submission1_id": "s266600972-FL", "submission2_id": "s617706794", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,A,B=map(int,input().split())\nprint(max(0,min(A,B) -(N-max(A,B))),min(A,B))", "code2": "N,A,B=map(int,input().split())\nprint(min(A,B),max(0,min(A,B) -(N-max(A,B))))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573336323", "date2": "1573336369", "bleu_score": "0.9616606573639723", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 3, "total_score": 81, "input": "000 110 100\n", "actual_output": "210 100\n", "expected_output": "100 210\n\n", "anno_code": ["N,A,B=map(int,input().split()) # (0): N=0, A=110, B=100\nprint(max(0,min(A,B) -(N-max(A,B))),min(A,B))"], "anno_status": [true], "diff_content": " N,A,B=map(int,input().split())\n-print(max(0,min(A,B) -(N-max(A,B))),min(A,B))\n+print(min(A,B),max(0,min(A,B) -(N-max(A,B))))\n", "FL_content": "\n N,A,B=map(int,input().split())\n-print(max(0,min(A,B) -(N-max(A,B))),min(A,B))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 2 }, { "user_id": "u955691979", "problem_id": "p04044", "submission1_id": "s551675368-FL", "submission2_id": "s848079205", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = input().split()\n\ns = [input() for i in range(int(a[0]))]\nb = ''\n\ns.sort()\nprint(s)\n\nfor i in range(int(a[0]),0):\n b = s[i] + b\n \nprint(b)", "code2": "a = input().split()\n\ns = [input() for i in range(int(a[0]))]\nb = ''\n\ns.sort()\n\nb = ''.join(s)\n\nprint(b)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582171774", "date2": "1582171927", "bleu_score": "0.6069071885568635", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 3\ncwy\nxxa\nyxd\n", "actual_output": "['cwy', 'xxa', 'yxd']\n\n", "expected_output": "cwyxxayxd\n\n", "anno_code": ["a = input().split() # (0): a=['3', '3']\n\ns = [input() for i in range(int(a[0]))] # (1): s=['cwy', 'xxa', 'yxd']\nb = '' # (2): b=\n\ns.sort() # (3): NO CHANGE\nprint(s) # (4): NO CHANGE\n\nfor i in range(int(a[0]),0): # (5): NO CHANGE\n b = s[i] + b\n \nprint(b)"], "anno_status": [true], "diff_content": " a = input().split()\n \n s = [input() for i in range(int(a[0]))]\n b = ''\n \n s.sort()\n-print(s)\n \n-for i in range(int(a[0]),0):\n- b = s[i] + b\n- \n+b = ''.join(s)\n+\n print(b)\n", "FL_content": "\n a = input().split()\n \n s = [input() for i in range(int(a[0]))]\n b = ''\n \n s.sort()\n-print(s)\n \n-for i in range(int(a[0]),0):\n b = s[i] + b\n \n print(b)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u837507786", "problem_id": "p02601", "submission1_id": "s340011823-FL", "submission2_id": "s045689487", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A,B,C = map(int, input().split())\nK = int(input())\ncount = 0\na = 0\nwhile K > 0:\n\n if (A < B * 2 ** K) and (B * 2 ** K < C * 2 ** a):\n count +=1\n K -=1\n a +=1\n\nif count == 1:\n print(\"Yes\")\nelse: print(\"No\")", "code2": "A,B,C = map(int, input().split())\nK = int(input())\ncount = 0\na = 0\nwhile K >= 0:\n\n if (A < B * 2 ** K) and (B * 2 ** K < C * 2 ** a):\n count +=1\n K -=1\n a +=1\n\nif count >= 1:\n print(\"Yes\")\nelse: print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595730086", "date2": "1595730212", "bleu_score": "0.9786197091746561", "code1_test_status": [1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1], "code1_test_score": 48, "total_score": 102, "input": "12 4 2\n9\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["A,B,C = map(int, input().split()) # (0): A=12, B=4, C=2\nK = int(input()) # (1): K=9\ncount = 0 # (2): count=0\na = 0 # (3): a=0\nwhile K > 0: # (4): NO CHANGE (8): NO CHANGE ... (42): NO CHANGE\n\n if (A < B * 2 ** K) and (B * 2 ** K < C * 2 ** a): # (5): NO CHANGE (9): NO CHANGE ... (39): NO CHANGE\n count +=1 # (30): count=1 (35): count=2\n K -=1 # (6): K=8 (10): K=7 ... (40): K=0\n a +=1 # (7): a=1 (11): a=2 ... (41): a=9\n\nif count == 1: # (43): NO CHANGE\n print(\"Yes\")\nelse: print(\"No\")"], "anno_status": [true], "diff_content": " A,B,C = map(int, input().split())\n K = int(input())\n count = 0\n a = 0\n-while K > 0:\n+while K >= 0:\n \n if (A < B * 2 ** K) and (B * 2 ** K < C * 2 ** a):\n count +=1\n K -=1\n a +=1\n \n-if count == 1:\n+if count >= 1:\n print(\"Yes\")\n else: print(\"No\")\n", "FL_content": "\n A,B,C = map(int, input().split())\n K = int(input())\n count = 0\n a = 0\n while K > 0:\n \n- if (A < B * 2 ** K) and (B * 2 ** K < C * 2 ** a):\n count +=1\n K -=1\n a +=1\n \n if count == 1:\n print(\"Yes\")\n else: print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u252745826", "problem_id": "p04000", "submission1_id": "s254684998-FL", "submission2_id": "s890120030", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\n\nh, w, n = list(map(int, input().split()))\nans = [0 for i in range(10)]\n\nif n != 0:\n board = defaultdict(int)\n for i in range(n):\n a, b = list(map(int, input().split()))\n a = a - 1\n b = b - 1\n for dx in range(b-1, b+2):\n if dx < 0 or dx >= w:\n continue\n for dy in range(a-1, a+2):\n if dy < 0 or dy >= h:\n continue\n board[(dx, dy)] += 1\n\n for x in range(1, w-1):\n for y in range(1, h-1):\n num = board[(x, y)]\n ans[num] += 1\n\nfor i in range(10):\n print(ans[i])\n", "code2": "from collections import defaultdict\n\nh, w, n = list(map(int, input().split()))\nans = [0 for i in range(10)]\n\nboard = defaultdict(int)\nfor i in range(n):\n a, b = list(map(int, input().split()))\n a = a - 1\n b = b - 1\n for dx in range(b-1, b+2):\n if dx <= 0 or dx >= w - 1:\n continue\n for dy in range(a-1, a+2):\n if dy <= 0 or dy >= h - 1:\n continue\n board[(dx, dy)] += 1\n\nfor v in board.values():\n ans[v] += 1\nans[0] = (h - 2) * (w - 2) - sum(ans)\n\nfor i in range(10):\n print(ans[i])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1508332757", "date2": "1508333198", "bleu_score": "0.7585254508618349", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 91, "total_score": 103, "input": "1000100000 1001001010 0\n", "actual_output": "0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n", "expected_output": "1001101106098797984\n0\n0\n0\n0\n0\n0\n0\n0\n0\n\n", "anno_code": ["from collections import defaultdict\n\nh, w, n = list(map(int, input().split())) # (0): h=1000100000, w=1001001010, n=0\nans = [0 for i in range(10)] # (1): ans=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\nif n != 0: # (2): NO CHANGE\n board = defaultdict(int)\n for i in range(n):\n a, b = list(map(int, input().split()))\n a = a - 1\n b = b - 1\n for dx in range(b-1, b+2):\n if dx < 0 or dx >= w:\n continue\n for dy in range(a-1, a+2):\n if dy < 0 or dy >= h:\n continue\n board[(dx, dy)] += 1\n\n for x in range(1, w-1):\n for y in range(1, h-1):\n num = board[(x, y)]\n ans[num] += 1\n\nfor i in range(10): # (3): i=0 (5): i=1 ... (21): i=9\n print(ans[i]) # (4): NO CHANGE (6): NO CHANGE ... (22): NO CHANGE\n"], "anno_status": [true], "diff_content": " from collections import defaultdict\n \n h, w, n = list(map(int, input().split()))\n ans = [0 for i in range(10)]\n \n-if n != 0:\n- board = defaultdict(int)\n- for i in range(n):\n- a, b = list(map(int, input().split()))\n- a = a - 1\n- b = b - 1\n- for dx in range(b-1, b+2):\n- if dx < 0 or dx >= w:\n+board = defaultdict(int)\n+for i in range(n):\n+ a, b = list(map(int, input().split()))\n+ a = a - 1\n+ b = b - 1\n+ for dx in range(b-1, b+2):\n+ if dx <= 0 or dx >= w - 1:\n+ continue\n+ for dy in range(a-1, a+2):\n+ if dy <= 0 or dy >= h - 1:\n continue\n- for dy in range(a-1, a+2):\n- if dy < 0 or dy >= h:\n- continue\n- board[(dx, dy)] += 1\n+ board[(dx, dy)] += 1\n \n- for x in range(1, w-1):\n- for y in range(1, h-1):\n- num = board[(x, y)]\n- ans[num] += 1\n+for v in board.values():\n+ ans[v] += 1\n+ans[0] = (h - 2) * (w - 2) - sum(ans)\n \n for i in range(10):\n print(ans[i])\n \n", "FL_content": "\n from collections import defaultdict\n \n h, w, n = list(map(int, input().split()))\n ans = [0 for i in range(10)]\n \n if n != 0:\n board = defaultdict(int)\n for i in range(n):\n a, b = list(map(int, input().split()))\n a = a - 1\n b = b - 1\n for dx in range(b-1, b+2):\n if dx < 0 or dx >= w:\n continue\n for dy in range(a-1, a+2):\n if dy < 0 or dy >= h:\n continue\n board[(dx, dy)] += 1\n \n- for x in range(1, w-1):\n- for y in range(1, h-1):\n num = board[(x, y)]\n ans[num] += 1\n \n for i in range(10):\n print(ans[i])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u643081547", "problem_id": "p03502", "submission1_id": "s089729165-FL", "submission2_id": "s130503007", "status1": "Wrong Answer", "status2": "Accepted", "code1": "num=input()\ns=0\nfor it in num:\n s+=int(it)\nprint(s)\nnum=int(num)\nprint(\"Yes\" if num%s==0 else \"No\")\n\n", "code2": "num=input()\ns=0\nfor it in num:\n s+=int(it)\nnum=int(num)\nprint(\"Yes\" if num%s==0 else \"No\")\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574100878", "date2": "1574100923", "bleu_score": "0.907130362617298", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 23, "input": "128\n", "actual_output": "11\nNo\n", "expected_output": "No\n\n", "anno_code": ["num=input() # (0): num=128\ns=0 # (1): s=0\nfor it in num: # (2): it=1 (4): it=2 ... (8): NO CHANGE\n s+=int(it) # (3): s=1 (5): s=3 (7): s=11\nprint(s) # (9): NO CHANGE\nnum=int(num) # (10): num=128\nprint(\"Yes\" if num%s==0 else \"No\")\n\n"], "anno_status": [true], "diff_content": " num=input()\n s=0\n for it in num:\n s+=int(it)\n-print(s)\n num=int(num)\n print(\"Yes\" if num%s==0 else \"No\")\n \n \n", "FL_content": "\n num=input()\n s=0\n for it in num:\n s+=int(it)\n-print(s)\n num=int(num)\n print(\"Yes\" if num%s==0 else \"No\")\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u331464808", "problem_id": "p03957", "submission1_id": "s724820104-FL", "submission2_id": "s083825566", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s= input()\na=0\nb=0\nfor i in range(len(s)):\n if s[i]=='C':\n a += i\n elif s[i]=='F':\n b += i\nif a=0and a=0and a\nx = -1 # (2): x=-1\nfor i in range(1,10): # (3): i=1 (5): i=2 ... (21): NO CHANGE\n q.put(i) # (4): NO CHANGE (6): NO CHANGE ... (20): NO CHANGE\nfor i in range(1,k+1): # (22): i=1 (29): i=2 ... (1243): NO CHANGE\n x = q.get() # (23): x=1 (30): x=2 ... (1237): x=3445\n if x % 10 != 0: # (24): NO CHANGE (31): NO CHANGE ... (1238): NO CHANGE\n q.put(10 * x + (x % 10) - 1) # (25): NO CHANGE (32): NO CHANGE ... (1239): NO CHANGE\n q.put(10 * x + (x % 10)) # (26): NO CHANGE (33): NO CHANGE ... (1240): NO CHANGE\n if x % 9 != 0: # (27): NO CHANGE (34): NO CHANGE ... (1241): NO CHANGE\n q.put(10 * x + (x % 10) + 1) # (28): NO CHANGE (35): NO CHANGE ... (1242): NO CHANGE\nprint(x)"], "anno_status": [true], "diff_content": " import queue\n \n k = int(input())\n q = queue.Queue()\n x = -1\n for i in range(1,10):\n q.put(i)\n for i in range(1,k+1):\n x = q.get()\n if x % 10 != 0:\n q.put(10 * x + (x % 10) - 1)\n q.put(10 * x + (x % 10))\n- if x % 9 != 0:\n+ if x % 10 != 9:\n q.put(10 * x + (x % 10) + 1)\n print(x)\n", "FL_content": "\n import queue\n \n k = int(input())\n q = queue.Queue()\n x = -1\n-for i in range(1,10):\n q.put(i)\n for i in range(1,k+1):\n x = q.get()\n if x % 10 != 0:\n q.put(10 * x + (x % 10) - 1)\n q.put(10 * x + (x % 10))\n if x % 9 != 0:\n q.put(10 * x + (x % 10) + 1)\n print(x)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u433250944", "problem_id": "p02408", "submission1_id": "s978583321-FL", "submission2_id": "s301906640", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ncards = {} \nfor i in range(n):\n card = input()\n cards[card] = 1\n\n\n\nfor c in ['S','H','C ','D']:\n for n in range(1,14):\n key = c + ' '+ str(n)\n if not key in cards:\n print(key)\n\n", "code2": "n = int(input())\ncards = {} \nfor i in range(n):\n card = input()\n cards[card] = 1\n \n\n \nfor c in ['S', 'H', 'C', 'D']:\n for n in range(1,14):\n key = c + ' ' + str(n)\n if not key in cards:\n print(key)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1559539044", "date2": "1559539135", "bleu_score": "0.9172186379350822", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "47\nS 10\nS 11\nS 12\nS 13\nH 1\nH 2\nS 6\nS 7\nS 8\nS 9\nH 6\nH 8\nH 9\nH 10\nH 11\nH 3\nH 7\nS 2\nS 3\nS 1\nS 5\nH 12\nH 13\nC 1\nC 2\nD 1\nD 2\nD 3\nD 4\nD 5\nD 6\nD 7\nC 3\nC 4\nC 5\nC 6\nC 7\nC 8\nC 9\nC 10\nC 11\nC 13\nD 9\nD 10\nD 11\nD 12\nD 13\n", "actual_output": "S 4\nH 4\nH 5\nC 1\nC 2\nC 3\nC 4\nC 5\nC 6\nC 7\nC 8\nC 9\nC 10\nC 11\nC 12\nC 13\nD 8\n", "expected_output": "S 4\nH 4\nH 5\nC 12\nD 8\n\n", "anno_code": ["n = int(input()) # (0): n=47\ncards = {} # (1): cards={}\nfor i in range(n): # (2): i=0 (5): i=1 ... (143): NO CHANGE\n card = input() # (3): card=S 10 (6): card=S 11 ... (141): card=D 13\n cards[card] = 1 # (4): cards={'S 10': 1} (7): cards={'S 10': 1, 'S 11': 1} ... (142): cards={'S 10': 1, 'S 11': 1, 'S 12': 1, 'S 13': 1, 'H 1': 1, 'H 2': 1, 'S 6': 1, 'S 7': 1, 'S 8': 1, 'S 9': 1, 'H 6': 1, 'H 8': 1, 'H 9': 1, 'H 10': 1, 'H 11': 1, 'H 3': 1, 'H 7': 1, 'S 2': 1, 'S 3': 1, 'S 1': 1, 'S 5': 1, 'H 12': 1, 'H 13': 1, 'C 1': 1, 'C 2': 1, 'D 1': 1, 'D 2': 1, 'D 3': 1, 'D 4': 1, 'D 5': 1, 'D 6': 1, 'D 7': 1, 'C 3': 1, 'C 4': 1, 'C 5': 1, 'C 6': 1, 'C 7': 1, 'C 8': 1, 'C 9': 1, 'C 10': 1, 'C 11': 1, 'C 13': 1, 'D 9': 1, 'D 10': 1, 'D 11': 1, 'D 12': 1, 'D 13': 1}\n\n\n\nfor c in ['S','H','C ','D']: # (144): c=S (186): c=H ... (283): c=D\n for n in range(1,14): # (145): n=1 (148): n=2 ... (324): NO CHANGE\n key = c + ' '+ str(n) # (146): key=S 1 (149): key=S 2 ... (322): key=D 13\n if not key in cards: # (147): NO CHANGE (150): NO CHANGE ... (323): NO CHANGE\n print(key) # (157): NO CHANGE (199): NO CHANGE ... (308): NO CHANGE\n\n"], "anno_status": [true], "diff_content": " n = int(input())\n cards = {} \n for i in range(n):\n card = input()\n cards[card] = 1\n+ \n \n-\n-\n-for c in ['S','H','C ','D']:\n+ \n+for c in ['S', 'H', 'C', 'D']:\n for n in range(1,14):\n- key = c + ' '+ str(n)\n+ key = c + ' ' + str(n)\n if not key in cards:\n print(key)\n \n-\n", "FL_content": "\n n = int(input())\n cards = {} \n for i in range(n):\n card = input()\n cards[card] = 1\n \n \n \n-for c in ['S','H','C ','D']:\n- for n in range(1,14):\n key = c + ' '+ str(n)\n if not key in cards:\n print(key)\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u889344512", "problem_id": "p03698", "submission1_id": "s528027618-FL", "submission2_id": "s195834135", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\nans = \"Yes\"\nfor i in range(len(s)):\n if s.count(s[i])>1:\n ans = \"No\"\n\nprint(ans)\n\n", "code2": "s = input()\n\nans = \"yes\"\nfor i in range(len(s)):\n if s.count(s[i])>1:\n ans = \"no\"\n\nprint(ans)\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1565391999", "date2": "1565392034", "bleu_score": "0.9511942021208858", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "lo\n", "actual_output": "Yes\n", "expected_output": "yes\n\n", "anno_code": ["s = input() # (0): s=lo\n\nans = \"Yes\" # (1): ans=Yes\nfor i in range(len(s)): # (2): i=0 (4): i=1 (6): NO CHANGE\n if s.count(s[i])>1: # (3): NO CHANGE (5): NO CHANGE\n ans = \"No\"\n\nprint(ans)\n\n"], "anno_status": [true], "diff_content": " s = input()\n \n-ans = \"Yes\"\n+ans = \"yes\"\n for i in range(len(s)):\n if s.count(s[i])>1:\n- ans = \"No\"\n+ ans = \"no\"\n \n print(ans)\n \n \n", "FL_content": "\n s = input()\n \n-ans = \"Yes\"\n for i in range(len(s)):\n if s.count(s[i])>1:\n- ans = \"No\"\n \n print(ans)\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u945181840", "problem_id": "p03730", "submission1_id": "s531838621-FL", "submission2_id": "s825576532", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = map(int, input().split())\nr = set([])\n\ntemp = A % B\n\nwhile temp not in r:\n r.add(temp)\n temp = temp * A % B\n\nif C in r:\n print('YES')\nelse:\n print('NO')", "code2": "A, B, C = map(int, input().split())\nr = set([])\n\ntemp = A % B\n\nwhile temp not in r:\n r.add(temp)\n temp = (temp + A) % B\n\nif C in r:\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569633877", "date2": "1569633987", "bleu_score": "0.9581785063807154", "code1_test_status": [1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1], "code1_test_score": 48, "total_score": 92, "input": "14 9 0\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["A, B, C = map(int, input().split()) # (0): A=14, B=9, C=0\nr = set([]) # (1): r=set()\n\ntemp = A % B # (2): temp=5\n\nwhile temp not in r: # (3): NO CHANGE (6): NO CHANGE ... (21): NO CHANGE\n r.add(temp) # (4): r={5} (7): r={5, 7} ... (19): r={1, 2, 4, 5, 7, 8}\n temp = temp * A % B # (5): temp=7 (8): temp=8 ... (20): temp=5\n\nif C in r: # (22): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " A, B, C = map(int, input().split())\n r = set([])\n \n temp = A % B\n \n while temp not in r:\n r.add(temp)\n- temp = temp * A % B\n+ temp = (temp + A) % B\n \n if C in r:\n print('YES')\n else:\n print('NO')\n", "FL_content": "\n A, B, C = map(int, input().split())\n r = set([])\n \n temp = A % B\n \n while temp not in r:\n r.add(temp)\n- temp = temp * A % B\n \n if C in r:\n print('YES')\n else:\n print('NO')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u104931506", "problem_id": "p02410", "submission1_id": "s034132855-FL", "submission2_id": "s616395618", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = list(map(int, input().split()))\nA = [[0 for w in range(m)] for h in range(n)]\nB = [0 for h in range(m)]\nfor i in range(n):\n A[i] = list(map(int, input().split()))\nfor i in range(m):\n B[i] = int(input())\n\nfor i in range(n):\n c = 0\n for j in range(m):\n c += A[i][j] * B[j]\nprint(c)", "code2": "n, m = list(map(int, input().split()))\nA = [[0 for w in range(m)] for h in range(n)]\nB = [0 for h in range(m)]\nfor i in range(n):\n A[i] = list(map(int, input().split()))\nfor i in range(m):\n B[i] = int(input())\n\nfor i in range(n):\n c = 0\n for j in range(m):\n c += A[i][j] * B[j]\n print(c)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1464638935", "date2": "1464638944", "bleu_score": "0.9820933910095244", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 4\n1 4 -2 1\n0 3 0 -1\n4 1 0 0\n0\n-2\n3\n0\n", "actual_output": "-2\n", "expected_output": "-14\n-6\n-2\n\n", "anno_code": ["n, m = list(map(int, input().split())) # (0): n=3, m=4\nA = [[0 for w in range(m)] for h in range(n)] # (1): A\nB = [0 for h in range(m)] # (2): B=[0, 0, 0, 0]\nfor i in range(n): # (3): i=0 (5): i=1 ... (9): NO CHANGE\n A[i] = list(map(int, input().split())) # (4): A=[[1, 4, -2, 1], [0, 0, 0, 0], [0, 0, 0, 0]] (6): A (8): A\nfor i in range(m): # (10): i=0 (12): i=1 ... (18): NO CHANGE\n B[i] = int(input()) # (11): NO CHANGE (13): B=[0, -2, 0, 0] ... (17): NO CHANGE\n\nfor i in range(n): # (19): i=0 (30): i=1 ... (52): NO CHANGE\n c = 0 # (20): c=0 (31): c=0 (42): c=0\n for j in range(m): # (21): j=0 (23): j=1 ... (51): NO CHANGE\n c += A[i][j] * B[j] # (22): NO CHANGE (24): c=-8 ... (50): NO CHANGE\nprint(c)"], "anno_status": [true], "diff_content": " n, m = list(map(int, input().split()))\n A = [[0 for w in range(m)] for h in range(n)]\n B = [0 for h in range(m)]\n for i in range(n):\n A[i] = list(map(int, input().split()))\n for i in range(m):\n B[i] = int(input())\n \n for i in range(n):\n c = 0\n for j in range(m):\n c += A[i][j] * B[j]\n-print(c)\n+ print(c)\n", "FL_content": "\n n, m = list(map(int, input().split()))\n A = [[0 for w in range(m)] for h in range(n)]\n B = [0 for h in range(m)]\n for i in range(n):\n A[i] = list(map(int, input().split()))\n for i in range(m):\n B[i] = int(input())\n \n for i in range(n):\n c = 0\n for j in range(m):\n c += A[i][j] * B[j]\n-print(c)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u511457539", "problem_id": "p03730", "submission1_id": "s942489677-FL", "submission2_id": "s701510292", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = map(int, input().split())\n\nfor i in range(1000):\n if A*i%B == C:\n print(\"Yes\")\n exit()\n\nprint(\"No\")\n", "code2": "A, B, C = map(int, input().split())\n\nfor i in range(1000):\n if A*i%B == C:\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590628605", "date2": "1590628674", "bleu_score": "0.9518537708170803", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 92, "input": "153 42 0\n", "actual_output": "Yes\n", "expected_output": "YES\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " A, B, C = map(int, input().split())\n \n for i in range(1000):\n if A*i%B == C:\n- print(\"Yes\")\n+ print(\"YES\")\n exit()\n \n-print(\"No\")\n+print(\"NO\")\n \n", "FL_content": "\n A, B, C = map(int, input().split())\n \n for i in range(1000):\n if A*i%B == C:\n- print(\"Yes\")\n exit()\n \n-print(\"No\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u742590876", "problem_id": "p03031", "submission1_id": "s419143436-FL", "submission2_id": "s836007868", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\nks = [[int(i) for i in input().split()][1:] for _ in range(m)]\np = list(map(int, input().split()))\n\nans = 0\nfor i in range(2 ** n):\n for j in range(m):\n cnt = 0\n for k in range(n):\n if i >> j & 1 and k + 1 in ks[j]:\n cnt += 1\n if cnt % 2 != p[j]:\n break\n else:\n ans += 1\nprint(ans)", "code2": "n, m = map(int, input().split())\nks = [[int(i) for i in input().split()][1:] for _ in range(m)]\np = list(map(int, input().split()))\n\nans = 0\nfor i in range(2 ** n):\n for j in range(m):\n cnt = 0\n for k in range(n):\n if i >> k & 1 and k + 1 in ks[j]:\n cnt += 1\n if cnt % 2 != p[j]:\n break\n else:\n ans += 1\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598943173", "date2": "1598943258", "bleu_score": "0.9934682067285332", "code1_test_status": [0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0], "code1_test_score": 85, "total_score": 103, "input": "2 3\n2 1 2\n1 1\n1 2\n0 1 0\n", "actual_output": "2\n", "expected_output": "0\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=2, m=3\nks = [[int(i) for i in input().split()][1:] for _ in range(m)] # (1): ks\np = list(map(int, input().split())) # (2): ks, p=[0, 1, 0]\n\nans = 0 # (3): ks, ans=0\nfor i in range(2 ** n): # (4): ks, i=0 (22): ks, i=1 ... (100): ks\n for j in range(m): # (5): ks, j=0 (13): ks, j=1 ... (98): ks\n cnt = 0 # (6): ks, cnt=0 (14): ks ... (91): ks, cnt=0\n for k in range(n): # (7): ks, k=0 (9): ks, k=1 ... (96): ks\n if i >> j & 1 and k + 1 in ks[j]: # (8): ks (10): ks ... (95): ks\n cnt += 1 # (27): ks, cnt=1 (30): ks, cnt=2 ... (85): ks, cnt=1\n if cnt % 2 != p[j]: # (12): ks (20): ks ... (97): ks\n break # (21): ks (41): ks\n else:\n ans += 1 # (69): ks, ans=1 (99): ks, ans=2\nprint(ans)"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n ks = [[int(i) for i in input().split()][1:] for _ in range(m)]\n p = list(map(int, input().split()))\n \n ans = 0\n for i in range(2 ** n):\n for j in range(m):\n cnt = 0\n for k in range(n):\n- if i >> j & 1 and k + 1 in ks[j]:\n+ if i >> k & 1 and k + 1 in ks[j]:\n cnt += 1\n if cnt % 2 != p[j]:\n break\n else:\n ans += 1\n print(ans)\n", "FL_content": "\n n, m = map(int, input().split())\n ks = [[int(i) for i in input().split()][1:] for _ in range(m)]\n p = list(map(int, input().split()))\n \n ans = 0\n for i in range(2 ** n):\n for j in range(m):\n cnt = 0\n for k in range(n):\n- if i >> j & 1 and k + 1 in ks[j]:\n cnt += 1\n if cnt % 2 != p[j]:\n break\n else:\n ans += 1\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u886122084", "problem_id": "p00015", "submission1_id": "s480705666-FL", "submission2_id": "s736807739", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\n\nn = int(input())\nans = []\nfor _ in range(n):\n a = int(input())\n b = int(input())\n s = a+b\n if s >= 10**79:\n ans.append(\"overflow\")\n else:\n ans.append(str(s))\nprint(\"\\n\".join(ans))\n\n", "code2": "\nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\n\nn = int(input())\nans = []\nfor _ in range(n):\n a = int(input())\n b = int(input())\n s = a+b\n if s > 10**80-1:\n ans.append(\"overflow\")\n else:\n ans.append(str(s))\nprint(\"\\n\".join(ans))\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1551516046", "date2": "1551516157", "bleu_score": "0.9747988064450065", "code1_test_status": [0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0], "code1_test_score": 34, "total_score": 101, "input": "6\n1000\n800\n9999999999999999999999999999999999999999\n2\n101324030029434858112167499308639520871934406912468763412863813360414081674525193\n1\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n0\n101000000000000000000000000000000000000000000000000000000000000000000000000000000\n1\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n", "actual_output": "1800\n10000000000000000000000000000000000000001\noverflow\noverflow\noverflow\noverflow\n", "expected_output": "1800\n10000000000000000000000000000000000000001\noverflow\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\noverflow\noverflow\n\n", "anno_code": ["\nimport sys\nsys.setrecursionlimit(10**9) # (0): NO CHANGE\ninput = sys.stdin.readline # (1): input=\n\nn = int(input()) # (2): n=6\nans = [] # (3): ans=[]\nfor _ in range(n): # (4): _=0 (10): _=1 ... (40): NO CHANGE\n a = int(input()) # (5): a=1000 (11): a=9999999999999999999999999999999999999999 ... (35): a=100000000000000000000000000000000000000000000000000000000000000000000000000000000\n b = int(input()) # (6): b=800 (12): b=2 ... (36): b=100000000000000000000000000000000000000000000000000000000000000000000000000000000\n s = a+b # (7): s=1800 (13): s=10000000000000000000000000000000000000001 ... (37): s=200000000000000000000000000000000000000000000000000000000000000000000000000000000\n if s >= 10**79: # (8): NO CHANGE (14): NO CHANGE ... (38): NO CHANGE\n ans.append(\"overflow\") # (21): ans=['1800', '10000000000000000000000000000000000000001', 'overflow'] (27): ans=['1800', '10000000000000000000000000000000000000001', 'overflow', 'overflow'] ... (39): ans=['1800', '10000000000000000000000000000000000000001', 'overflow', 'overflow', 'overflow', 'overflow']\n else:\n ans.append(str(s)) # (9): ans=['1800'] (15): ans=['1800', '10000000000000000000000000000000000000001']\nprint(\"\\n\".join(ans))\n\n"], "anno_status": [false], "diff_content": " \n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n \n n = int(input())\n ans = []\n for _ in range(n):\n a = int(input())\n b = int(input())\n s = a+b\n- if s >= 10**79:\n+ if s > 10**80-1:\n ans.append(\"overflow\")\n else:\n ans.append(str(s))\n print(\"\\n\".join(ans))\n \n \n", "FL_content": "\n \n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n \n n = int(input())\n ans = []\n for _ in range(n):\n a = int(input())\n b = int(input())\n s = a+b\n- if s >= 10**79:\n ans.append(\"overflow\")\n else:\n ans.append(str(s))\n print(\"\\n\".join(ans))\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u855967722", "problem_id": "p02601", "submission1_id": "s337941702-FL", "submission2_id": "s755097082", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef main():\n R, G, B = map(int, input().split())\n K = int(input())\n\n for i in range(K):\n if R > G:\n G = G * 2\n else:\n if G > B:\n B = B * 2\n if B > G > R:\n print(\"Yes\")\n exit()\n print(\"No\")\nif __name__ == '__main__':\n main()", "code2": "\ndef main():\n R, G, B = map(int, input().split())\n K = int(input())\n\n for i in range(K):\n if R >= G:\n G = G * 2\n else:\n if G >= B:\n B = B * 2\n if B > G > R:\n print(\"Yes\")\n exit()\n print(\"No\")\nif __name__ == '__main__':\n main()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595729996", "date2": "1595734075", "bleu_score": "0.9843497334798079", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 63, "total_score": 102, "input": "6 3 6\n5\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["\ndef main(): # (0): main=\n R, G, B = map(int, input().split())\n K = int(input())\n\n for i in range(K):\n if R > G:\n G = G * 2\n else:\n if G > B:\n B = B * 2\n if B > G > R:\n print(\"Yes\")\n exit()\n print(\"No\")\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " \n def main():\n R, G, B = map(int, input().split())\n K = int(input())\n \n for i in range(K):\n- if R > G:\n+ if R >= G:\n G = G * 2\n else:\n- if G > B:\n+ if G >= B:\n B = B * 2\n if B > G > R:\n print(\"Yes\")\n exit()\n print(\"No\")\n if __name__ == '__main__':\n main()\n", "FL_content": "\n \n def main():\n R, G, B = map(int, input().split())\n K = int(input())\n \n for i in range(K):\n if R > G:\n G = G * 2\n else:\n if G > B:\n B = B * 2\n- if B > G > R:\n print(\"Yes\")\n exit()\n print(\"No\")\n if __name__ == '__main__':\n main()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u677991935", "problem_id": "p02837", "submission1_id": "s005310999-FL", "submission2_id": "s635187171", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nN=int(input())\nxy =[[]for i in range(N)]\nans=0\n\nfor i in range(N):\n A=int(input())\n for j in range(A):\n x, y = map(int, input().split())\n xy[i].append((x,y))\n\n\nfor i in range(2**N):\n ans_kouho=0\n \n flag=1\n \n TorF=[0]*N\n for j in range(N):\n if (i>>j) & 1:\n TorF[j]=1\n\n for j in range(N):\n for k in range(len(xy[j])):\n \n if TorF[j]==0:\n if TorF[xy[j][k][0]-1]==xy[j][k][1]:\n flag=-1\n break\n else:\n if TorF[xy[j][k][0]-1]!=xy[j][k][1]:\n flag=-1\n break\n \n if flag==1:\n \n ans_kouho=TorF.count(1)\n if(ans>j) & 1:\n TorF[j]=1\n\n for j in range(N):\n for k in range(len(xy[j])):\n \n if TorF[j]==1:\n if TorF[xy[j][k][0]-1]!=xy[j][k][1]:\n flag=-1\n break\n \n if flag==1:\n \n ans_kouho=TorF.count(1)\n if(ans>j) & 1: # (36): NO CHANGE (38): NO CHANGE ... (297): NO CHANGE\n TorF[j]=1 # (74): TorF=[1, 0, 0] (113): TorF=[0, 1, 0] ... (298): TorF=[1, 1, 1]\n\n for j in range(N): # (42): j=0 (48): j=1 ... (321): NO CHANGE\n for k in range(len(xy[j])): # (43): k=0 (49): NO CHANGE ... (316): k=1\n \n if TorF[j]==0: # (44): NO CHANGE (50): NO CHANGE ... (317): NO CHANGE\n if TorF[xy[j][k][0]-1]==xy[j][k][1]: # (45): NO CHANGE (51): NO CHANGE ... (270): NO CHANGE\n flag=-1 # (46): flag=-1 (55): NO CHANGE ... (239): NO CHANGE\n break # (47): NO CHANGE (56): NO CHANGE ... (240): NO CHANGE\n else:\n if TorF[xy[j][k][0]-1]!=xy[j][k][1]: # (83): NO CHANGE (86): NO CHANGE ... (318): NO CHANGE\n flag=-1 # (130): NO CHANGE (159): flag=-1 ... (319): NO CHANGE\n break # (131): NO CHANGE (160): NO CHANGE ... (320): NO CHANGE\n \n if flag==1: # (67): NO CHANGE (104): NO CHANGE ... (322): NO CHANGE\n \n ans_kouho=TorF.count(1)\n if(ans>j) & 1:\n TorF[j]=1\n \n for j in range(N):\n for k in range(len(xy[j])):\n \n- if TorF[j]==0:\n- if TorF[xy[j][k][0]-1]==xy[j][k][1]:\n- flag=-1\n- break\n- else:\n+ if TorF[j]==1:\n if TorF[xy[j][k][0]-1]!=xy[j][k][1]:\n flag=-1\n break\n \n if flag==1:\n \n ans_kouho=TorF.count(1)\n if(ans>j) & 1:\n TorF[j]=1\n \n for j in range(N):\n for k in range(len(xy[j])):\n \n if TorF[j]==0:\n if TorF[xy[j][k][0]-1]==xy[j][k][1]:\n flag=-1\n break\n else:\n if TorF[xy[j][k][0]-1]!=xy[j][k][1]:\n flag=-1\n break\n \n if flag==1:\n \n ans_kouho=TorF.count(1)\n if(ansm):\n n,m=m,n\nif(n==1 and m==1):\n print(1)\n exit()\nif(n==1 and m!=1):\n print(m-2)\n exit()\nprint((n-2)*(m-2))\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591043234", "date2": "1591043724", "bleu_score": "0.9410815515310548", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 69, "total_score": 78, "input": "115 0\n", "actual_output": "113\n", "expected_output": "-226\n\n", "anno_code": ["import sys\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop, heappush\nfrom math import *\nfrom collections import defaultdict as dd, deque, Counter as C\nfrom itertools import combinations as comb, permutations as perm\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nfrom time import perf_counter\nfrom fractions import Fraction\n\n\n\nmod = int(pow(10, 9) + 7) # (0): nan=nan, mod=1000000007\nmod2 = 998244353 # (1): nan=nan, mod2=998244353, data=\ndef data(): return sys.stdin.readline().strip()\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end) # (2): nan=nan, out=, l=, sl=, sp=, ssp=, l1d=, l2d=\ndef l(): return list(sp())\ndef sl(): return list(ssp())\ndef sp(): return map(int, data().split())\ndef ssp(): return map(str, data().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n\n\n\n\n\n\n\n\n\nn,m=l() # (3): nan=nan, n=115, m=0\nif(n<=2 and m<=2): # (4): nan=nan\n print(0)\n exit()\nif(n==2): # (5): nan=nan\n print((m-2)*2)\n exit()\nif(n==2): # (6): nan=nan\n print((m-2)*2)\n exit()\nprint(max(1,n-2)*max(1,m-2))\n\n"], "anno_status": [true], "diff_content": " import sys\n from functools import lru_cache, cmp_to_key\n from heapq import merge, heapify, heappop, heappush\n from math import *\n from collections import defaultdict as dd, deque, Counter as C\n from itertools import combinations as comb, permutations as perm\n from bisect import bisect_left as bl, bisect_right as br, bisect\n from time import perf_counter\n from fractions import Fraction\n \n \n \n mod = int(pow(10, 9) + 7)\n mod2 = 998244353\n def data(): return sys.stdin.readline().strip()\n def out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\n def l(): return list(sp())\n def sl(): return list(ssp())\n def sp(): return map(int, data().split())\n def ssp(): return map(str, data().split())\n def l1d(n, val=0): return [val for i in range(n)]\n def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n \n \n \n \n \n \n \n \n \n n,m=l()\n-if(n<=2 and m<=2):\n- print(0)\n+if(n>m):\n+ n,m=m,n\n+if(n==1 and m==1):\n+ print(1)\n exit()\n-if(n==2):\n- print((m-2)*2)\n+if(n==1 and m!=1):\n+ print(m-2)\n exit()\n-if(n==2):\n- print((m-2)*2)\n- exit()\n-print(max(1,n-2)*max(1,m-2))\n+print((n-2)*(m-2))\n \n \n", "FL_content": "\n import sys\n from functools import lru_cache, cmp_to_key\n from heapq import merge, heapify, heappop, heappush\n from math import *\n from collections import defaultdict as dd, deque, Counter as C\n from itertools import combinations as comb, permutations as perm\n from bisect import bisect_left as bl, bisect_right as br, bisect\n from time import perf_counter\n from fractions import Fraction\n \n \n \n mod = int(pow(10, 9) + 7)\n mod2 = 998244353\n def data(): return sys.stdin.readline().strip()\n def out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\n def l(): return list(sp())\n def sl(): return list(ssp())\n def sp(): return map(int, data().split())\n def ssp(): return map(str, data().split())\n def l1d(n, val=0): return [val for i in range(n)]\n def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n \n \n \n \n \n \n \n \n \n n,m=l()\n if(n<=2 and m<=2):\n print(0)\n exit()\n if(n==2):\n print((m-2)*2)\n exit()\n-if(n==2):\n- print((m-2)*2)\n- exit()\n-print(max(1,n-2)*max(1,m-2))\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 44 }, { "user_id": "u792145349", "problem_id": "p02237", "submission1_id": "s024355364-FL", "submission2_id": "s484239604", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nn = int(input())\ndata = [list(map(int,input().split())) for i in range(n)]\n\n\ngraph_table = [[0]*n for i in range(n)]\n\n\nfor d in data:\n node_id = d[0]\n num_of_e = d[1]\n for e in d[2:]:\n graph_table[node_id-1][e-1] = 1\n\nprint(graph_table)\n\n\nfor g in graph_table:\n print(*g)", "code2": "\nn = int(input())\ndata = [list(map(int,input().split())) for i in range(n)]\n\n\ngraph_table = [[0]*n for i in range(n)]\n\n\nfor d in data:\n node_id = d[0]\n num_of_e = d[1]\n for e in d[2:]:\n graph_table[node_id-1][e-1] = 1\n\n\nfor g in graph_table:\n print(*g)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1507341064", "date2": "1507341117", "bleu_score": "0.9279890753336241", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "4\n1 2 2 3\n2 1 1\n0 0\n4 1 1\n", "actual_output": "[[0, 1, 1, 0], [1, 0, 0, 0], [0, 0, 0, 0], [1, 0, 0, 0]]\n0 1 1 0\n1 0 0 0\n0 0 0 0\n1 0 0 0\n", "expected_output": "0 1 1 0\n1 0 0 0\n0 0 0 0\n1 0 0 0\n\n", "anno_code": ["\nn = int(input()) # (0): n=4\ndata = [list(map(int,input().split())) for i in range(n)] # (1): data\n\n\ngraph_table = [[0]*n for i in range(n)] # (2): data=[[1, 2, 2, 3], [2, 1, 1], [0, 0], [4, 1, 1]], graph_table\n\n\nfor d in data: # (3): data, d=[1, 2, 2, 3] (11): data, d=[2, 1, 1] ... (27): data\n node_id = d[0] # (4): data, node_id=1 (12): data, node_id=2 ... (22): data, node_id=4\n num_of_e = d[1] # (5): data, num_of_e=2 (13): data, num_of_e=1 ... (23): data, num_of_e=1\n for e in d[2:]: # (6): data, e=2 (8): data, e=3 ... (26): data\n graph_table[node_id-1][e-1] = 1 # (7): data, graph_table (9): data, graph_table ... (25): data, graph_table\n\nprint(graph_table) # (28): data\n\n\nfor g in graph_table: # (29): data, g=[0, 1, 1, 0] (31): data, g=[1, 0, 0, 0] ... (35): data, g=[1, 0, 0, 0]\n print(*g) # (30): data (32): data ... (36): data\n"], "anno_status": [true], "diff_content": " \n n = int(input())\n data = [list(map(int,input().split())) for i in range(n)]\n \n \n graph_table = [[0]*n for i in range(n)]\n \n \n for d in data:\n node_id = d[0]\n num_of_e = d[1]\n for e in d[2:]:\n graph_table[node_id-1][e-1] = 1\n \n-print(graph_table)\n-\n \n for g in graph_table:\n print(*g)\n", "FL_content": "\n \n n = int(input())\n data = [list(map(int,input().split())) for i in range(n)]\n \n \n graph_table = [[0]*n for i in range(n)]\n \n \n for d in data:\n node_id = d[0]\n num_of_e = d[1]\n for e in d[2:]:\n graph_table[node_id-1][e-1] = 1\n \n-print(graph_table)\n \n \n for g in graph_table:\n print(*g)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u425351967", "problem_id": "p03643", "submission1_id": "s670667142-FL", "submission2_id": "s559387461", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print(\"ABC\", input())", "code2": "print(\"ABC\"+ input())", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1506522756", "date2": "1506522801", "bleu_score": "0.8656030552541708", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "-75\n", "actual_output": "ABC -75\n", "expected_output": "ABC-75\n\n", "anno_code": ["print(\"ABC\", input())"], "anno_status": [true], "diff_content": "-print(\"ABC\", input())\n+print(\"ABC\"+ input())\n", "FL_content": "\n-print(\"ABC\", input())\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 1 }, { "user_id": "u677523557", "problem_id": "p04008", "submission1_id": "s645427762-FL", "submission2_id": "s829073815", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nimport heapq as hp\n\nN, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nans = 0\ngraph = [[] for _ in range(N)]\nfor i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n graph[a-1].append(i)\n\nstack = [0]\nchildren = [1]*N\nwhile stack:\n p = stack.pop()\n if p >= 0:\n stack.append(~p)\n for np in graph[p]:\n stack.append(np)\n else:\n p = ~p\n for ch in graph[p]:\n children[p] += children[ch]\n\nq = [(-children[0], 0)]\nDepth = [-1]*N\nwhile q:\n _, s = hp.heappop(q)\n if s != 0: ans += 1\n Depth[s] = 0\n que = [s]\n for _ in range(K):\n qq = []\n for p in que:\n for np in graph[p]:\n if Depth[np] == -1:\n Depth[np] = Depth[p] + 1\n qq.append(np)\n if not qq:\n break\n que = qq\n if que:\n for p in que:\n for np in graph[p]:\n hp.heappush(q, (-children[np], np))\n\nprint(ans)", "code2": "import sys\ninput = sys.stdin.readline\n\n\nN, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nans = 0\ngraph = [[] for _ in range(N)]\nPar = [-1]*N\nfor i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n Par[i] = a-1\n graph[a-1].append(i)\n\nqs = []\n\nstack = [0]\nDepth = [-1]*N\nDepth[0] = 0\nwhile stack:\n p = stack.pop()\n for np in graph[p]:\n Depth[np] = Depth[p] + 1\n stack.append(np)\n qs.append((Depth[p], p))\n\nqs.sort(reverse=True)\nchecked = [False]*N\n\nfor d, s in qs:\n if d <= K: break\n if checked[s]: continue\n\n for _ in range(K-1):\n s = Par[s]\n \n que = [s]\n checked[s] = True\n while que:\n qq = []\n for p in que:\n for np in graph[p]:\n if not checked[np]:\n checked[np] = True\n qq.append(np)\n que = qq\n \n ans += 1\n\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1591556804", "date2": "1591571270", "bleu_score": "0.7318512519990166", "code1_test_status": [1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 82, "total_score": 97, "input": "8 1\n3 1 2 2 2 1 2 4\n", "actual_output": "5\n", "expected_output": "6\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=, hp=\nimport heapq as hp\n\nN, K = map(int, input().split()) # (1): N=8, K=1\nA = list(map(int, input().split())) # (2): A=[3, 1, 2, 2, 2, 1, 2, 4]\n\nans = 0 # (3): ans=0\ngraph = [[] for _ in range(N)] # (4): graph\nfor i, a in enumerate(A): # (5): i=0, a=3 (10): i=1, a=1 ... (31): graph\n if i == 0: # (6): NO CHANGE (11): NO CHANGE ... (29): graph\n if a != 1: # (7): NO CHANGE\n ans += 1 # (8): ans=1\n continue # (9): NO CHANGE\n graph[a-1].append(i) # (12): graph (15): graph ... (30): graph\n\nstack = [0] # (32): graph, stack=[0]\nchildren = [1]*N # (33): graph, children=[1, 1, 1, 1, 1, 1, 1, 1]\nwhile stack: # (34): graph (43): graph ... (142): graph\n p = stack.pop() # (35): graph=[[1, 5], [2, 3, 4, 6], [], [7], [], [], [], []], stack=[], p=0 (44): graph=[[1, 5], [2, 3, 4, 6], [], [7], [], [], [], []], stack=[-1, 1], p=5 ... (134): graph=[[1, 5], [2, 3, 4, 6], [], [7], [], [], [], []], stack=[], p=-1\n if p >= 0: # (36): graph (45): graph ... (135): graph\n stack.append(~p) # (37): graph, stack=[-1] (46): graph, stack=[-1, 1, -6] ... (113): graph, stack=[-1, -2, -3]\n for np in graph[p]: # (38): graph, np=1 (40): graph, np=5 ... (114): graph\n stack.append(np) # (39): graph, stack=[-1, 1] (41): graph, stack=[-1, 1, 5] ... (91): graph, stack=[-1, -2, 2, -4, 7]\n else:\n p = ~p # (51): graph, p=5 (74): graph, p=6 ... (136): graph, p=0\n for ch in graph[p]: # (52): graph (75): graph ... (141): graph\n children[p] += children[ch] # (108): graph, children=[1, 1, 1, 2, 1, 1, 1, 1] (125): graph, children=[1, 2, 1, 2, 1, 1, 1, 1] ... (140): graph, children=[8, 6, 1, 2, 1, 1, 1, 1]\n\nq = [(-children[0], 0)] # (143): graph, q=[(-8, 0)]\nDepth = [-1]*N # (144): graph, Depth=[-1, -1, -1, -1, -1, -1, -1, -1]\nwhile q: # (145): graph (180): graph ... (249): graph\n _, s = hp.heappop(q) # (146): graph=[[1, 5], [2, 3, 4, 6], [], [7], [], [], [], []], q=[], _=-8, s=0 (181): graph=[[1, 5], [2, 3, 4, 6], [], [7], [], [], [], []], q=[(-1, 2), (-1, 6), (-1, 4)], _=-2, s=3 ... (234): graph=[[1, 5], [2, 3, 4, 6], [], [7], [], [], [], []], q=[], _=-1, s=6\n if s != 0: ans += 1 # (147): graph (182): ans=2, graph ... (235): ans=5, graph\n Depth[s] = 0 # (148): graph, Depth=[0, -1, -1, -1, -1, -1, -1, -1] (183): graph, Depth=[0, 1, -1, 0, -1, 1, -1, -1] ... (236): graph, Depth=[0, 1, 0, 0, 0, 1, 0, 1]\n que = [s] # (149): graph, que=[0] (184): graph, que=[3] ... (237): graph, que=[6]\n for _ in range(K): # (150): graph, _=0 (165): graph ... (238): graph, _=0\n qq = [] # (151): graph, qq=[] (186): graph, qq=[] ... (239): graph\n for p in que: # (152): graph (162): graph ... (242): graph\n for np in graph[p]: # (153): graph, np=1 (157): graph, np=5 ... (241): graph\n if Depth[np] == -1: # (154): graph (158): graph (189): graph\n Depth[np] = Depth[p] + 1 # (155): graph, Depth=[0, 1, -1, -1, -1, -1, -1, -1] (159): graph, Depth=[0, 1, -1, -1, -1, 1, -1, -1] (190): graph, Depth=[0, 1, -1, 0, -1, 1, -1, 1]\n qq.append(np) # (156): graph, qq=[1] (160): graph, qq=[1, 5] (191): graph, qq=[7]\n if not qq: # (163): graph (194): graph ... (243): graph\n break # (212): graph (228): graph (244): graph\n que = qq # (164): graph, que=[1, 5] (195): graph, que=[7]\n if que: # (166): graph (197): graph ... (245): graph\n for p in que: # (167): graph, p=1 (177): graph, p=5 ... (248): graph\n for np in graph[p]: # (168): graph, np=2 (170): graph, np=3 ... (247): graph\n hp.heappush(q, (-children[np], np)) # (169): graph, q=[(-1, 2)] (171): graph, q=[(-2, 3), (-1, 2)] ... (175): graph, q=[(-2, 3), (-1, 2), (-1, 4), (-1, 6)]\n\nprint(ans)"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n-import heapq as hp\n+\n \n N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n ans = 0\n graph = [[] for _ in range(N)]\n+Par = [-1]*N\n for i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n+ Par[i] = a-1\n graph[a-1].append(i)\n \n+qs = []\n+\n stack = [0]\n-children = [1]*N\n+Depth = [-1]*N\n+Depth[0] = 0\n while stack:\n p = stack.pop()\n- if p >= 0:\n- stack.append(~p)\n- for np in graph[p]:\n- stack.append(np)\n- else:\n- p = ~p\n- for ch in graph[p]:\n- children[p] += children[ch]\n-\n-q = [(-children[0], 0)]\n-Depth = [-1]*N\n-while q:\n- _, s = hp.heappop(q)\n- if s != 0: ans += 1\n- Depth[s] = 0\n+ for np in graph[p]:\n+ Depth[np] = Depth[p] + 1\n+ stack.append(np)\n+ qs.append((Depth[p], p))\n+\n+qs.sort(reverse=True)\n+checked = [False]*N\n+\n+for d, s in qs:\n+ if d <= K: break\n+ if checked[s]: continue\n+\n+ for _ in range(K-1):\n+ s = Par[s]\n+ \n que = [s]\n- for _ in range(K):\n+ checked[s] = True\n+ while que:\n qq = []\n for p in que:\n for np in graph[p]:\n- if Depth[np] == -1:\n- Depth[np] = Depth[p] + 1\n+ if not checked[np]:\n+ checked[np] = True\n qq.append(np)\n- if not qq:\n- break\n que = qq\n- if que:\n- for p in que:\n- for np in graph[p]:\n- hp.heappush(q, (-children[np], np))\n+ \n+ ans += 1\n \n print(ans)\n", "FL_content": "\n import sys\n input = sys.stdin.readline\n import heapq as hp\n \n N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n ans = 0\n graph = [[] for _ in range(N)]\n for i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n graph[a-1].append(i)\n \n stack = [0]\n children = [1]*N\n while stack:\n p = stack.pop()\n if p >= 0:\n stack.append(~p)\n for np in graph[p]:\n stack.append(np)\n else:\n p = ~p\n for ch in graph[p]:\n children[p] = children[ch]\n \n q = [(-children[0], 0)]\n Depth = [-1]*N\n while q:\n _, s = hp.heappop(q)\n if s != 0: ans += 1\n Depth[s] = 0\n que = [s]\n for _ in range(K):\n qq = []\n for p in que:\n for np in graph[p]:\n if Depth[np] == -1:\n Depth[np] = Depth[p] + 1\n qq.append(np)\n if not qq:\n break\n que = qq\n if que:\n for p in que:\n for np in graph[p]:\n hp.heappush(q, (-children[np], np))\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 52 }, { "user_id": "u723792785", "problem_id": "p02616", "submission1_id": "s684704185-FL", "submission2_id": "s910235180", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int,input().split())\na = list(map(int,input().split()))\nmod = 10**9 + 7\n\nplus = []\nminus = []\n\nfor i in a:\n\tif i >= 0:\n\t\tplus.append(i)\n\telse:\n\t\tminus.append(i)\n\nplus.sort()\nminus.sort(key=lambda x:-x)\n\n\n\n\nnumplus = k\nnumminus = 0\n\n\nwhile numplus > len(plus):\n\tnumplus -= 2\n\tnumminus += 2\n\ntmpminus = -1\n\n\n\nwhile numplus-2 >= 0 and numminus+1 < len(minus):\n\tif plus[numplus-1] * plus[numplus-2] <= minus[numminus] * minus[numminus+1]:\n\t\tnumplus -= 2\n\t\tnumminus += 2\n\t\ttmpminus = numminus\n\telse:\n\t\tbreak\n\n\n\nans = 1\nif tmpminus != -1:\n\tfor i in range(numplus):\n\t\tans = ans * plus[i] % mod\n\tfor i in range(numminus):\n\t\tans = ans * minus[i] % mod\nelse:\n\t\n\t\n\ttmp = sorted(a, key=lambda x:-x)\n\tfor i in range(k):\n\t\tans = ans * tmp[i]%mod\n\nprint(ans)", "code2": "n, k = map(int,input().split())\na = list(map(int,input().split()))\nmod = 10**9 + 7\n\nplus = []\nminus = []\n\nfor i in a:\n\tif i >= 0:\n\t\tplus.append(i)\n\telse:\n\t\tminus.append(i)\n\nplus.sort(key = lambda x:-x)\nminus.sort()\n\n\n\n\n\nnumplus = k\nnumminus = 0\n\n\nwhile numplus > len(plus):\n\tnumplus -= 2\n\tnumminus += 2\n\n\n\nwhile numplus-2 >= 0 and numminus+1 < len(minus):\n\tif plus[numplus-1] * plus[numplus-2] <= minus[numminus] * minus[numminus+1]:\n\t\tnumplus -= 2\n\t\tnumminus += 2\n\telse:\n\t\tbreak\n\n\n\nans = 1\n\nif numplus >= 0 and numminus >= 0 and numminus <= len(minus) and numplus <= len(plus):\n\tfor i in range(numplus):\n\t\tans = ans * plus[i] % mod\n\tfor i in range(numminus):\n\t\tans = ans * minus[i] % mod\nelse:\n\t\n\t\n\ttmp = sorted(a, key=lambda x:-x)\n\tfor i in range(k):\n\t\tans = ans * tmp[i]%mod\n\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593988632", "date2": "1593989065", "bleu_score": "0.9140705278839458", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 101, "total_score": 104, "input": "4 2\n-1 -2 -2 -4\n", "actual_output": "2\n", "expected_output": "8\n\n", "anno_code": ["n, k = map(int,input().split()) # (0): n=4, k=2\na = list(map(int,input().split())) # (1): a=[-1, -2, -2, -4]\nmod = 10**9 + 7 # (2): mod=1000000007\n\nplus = [] # (3): plus=[]\nminus = [] # (4): minus=[]\n\nfor i in a: # (5): i=-1 (8): i=-2 ... (17): NO CHANGE\n\tif i >= 0: # (6): NO CHANGE (9): NO CHANGE ... (15): NO CHANGE\n\t\tplus.append(i)\n\telse:\n\t\tminus.append(i) # (7): minus=[-1] (10): minus=[-1, -2] ... (16): minus=[-1, -2, -2, -4]\n\nplus.sort() # (18): NO CHANGE\nminus.sort(key=lambda x:-x) # (19): NO CHANGE\n\n\n\n\nnumplus = k # (20): numplus=2\nnumminus = 0 # (21): numminus=0\n\n\nwhile numplus > len(plus): # (22): NO CHANGE (25): NO CHANGE\n\tnumplus -= 2 # (23): numplus=0\n\tnumminus += 2 # (24): numminus=2\n\ntmpminus = -1 # (26): tmpminus=-1\n\n\n\nwhile numplus-2 >= 0 and numminus+1 < len(minus): # (27): NO CHANGE\n\tif plus[numplus-1] * plus[numplus-2] <= minus[numminus] * minus[numminus+1]:\n\t\tnumplus -= 2\n\t\tnumminus += 2\n\t\ttmpminus = numminus\n\telse:\n\t\tbreak\n\n\n\nans = 1 # (28): ans=1\nif tmpminus != -1: # (29): NO CHANGE\n\tfor i in range(numplus):\n\t\tans = ans * plus[i] % mod\n\tfor i in range(numminus):\n\t\tans = ans * minus[i] % mod\nelse:\n\t\n\t\n\ttmp = sorted(a, key=lambda x:-x) # (30): tmp=[-1, -2, -2, -4]\n\tfor i in range(k): # (31): i=0 (33): i=1 (35): NO CHANGE\n\t\tans = ans * tmp[i]%mod # (32): ans=1000000006 (34): ans=2\n\nprint(ans)"], "anno_status": [true], "diff_content": " n, k = map(int,input().split())\n a = list(map(int,input().split()))\n mod = 10**9 + 7\n \n plus = []\n minus = []\n \n for i in a:\n \tif i >= 0:\n \t\tplus.append(i)\n \telse:\n \t\tminus.append(i)\n \n-plus.sort()\n-minus.sort(key=lambda x:-x)\n+plus.sort(key = lambda x:-x)\n+minus.sort()\n+\n \n \n \n \n numplus = k\n numminus = 0\n \n \n while numplus > len(plus):\n \tnumplus -= 2\n \tnumminus += 2\n \n-tmpminus = -1\n-\n \n \n while numplus-2 >= 0 and numminus+1 < len(minus):\n \tif plus[numplus-1] * plus[numplus-2] <= minus[numminus] * minus[numminus+1]:\n \t\tnumplus -= 2\n \t\tnumminus += 2\n-\t\ttmpminus = numminus\n \telse:\n \t\tbreak\n \n \n \n ans = 1\n-if tmpminus != -1:\n+\n+if numplus >= 0 and numminus >= 0 and numminus <= len(minus) and numplus <= len(plus):\n \tfor i in range(numplus):\n \t\tans = ans * plus[i] % mod\n \tfor i in range(numminus):\n \t\tans = ans * minus[i] % mod\n else:\n \t\n \t\n \ttmp = sorted(a, key=lambda x:-x)\n \tfor i in range(k):\n \t\tans = ans * tmp[i]%mod\n \n print(ans)\n", "FL_content": "\n n, k = map(int,input().split())\n a = list(map(int,input().split()))\n mod = 10**9 + 7\n \n plus = []\n minus = []\n \n for i in a:\n \tif i >= 0:\n \t\tplus.append(i)\n \telse:\n \t\tminus.append(i)\n \n plus.sort()\n minus.sort(key=lambda x:-x)\n \n \n \n \n numplus = k\n numminus = 0\n \n \n while numplus > len(plus):\n \tnumplus -= 2\n \tnumminus += 2\n \n tmpminus = -1\n \n \n \n while numplus-2 >= 0 and numminus+1 < len(minus):\n \tif plus[numplus-1] * plus[numplus-2] <= minus[numminus] * minus[numminus+1]:\n \t\tnumplus -= 2\n \t\tnumminus += 2\n \t\ttmpminus = numminus\n \telse:\n \t\tbreak\n \n \n \n ans = 1\n if tmpminus != -1:\n \tfor i in range(numplus):\n \t\tans = ans * plus[i] % mod\n \tfor i in range(numminus):\n \t\tans = ans * minus[i] % mod\n else:\n \t\n \t\n \ttmp = sorted(a, key=lambda x:-x)\n \tfor i in range(k):\n \t\tans = ans * tmp[i]%mod\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 55 }, { "user_id": "u761320129", "problem_id": "p03977", "submission1_id": "s605085284-FL", "submission2_id": "s923840070", "status1": "Wrong Answer", "status2": "Accepted", "code1": "T = int(input())\nts = [tuple(map(int,input().split())) for i in range(T)]\n\ndef solve(n,d):\n if n%2:\n return d + 127*(n-1)\n else:\n tmp = 0\n for a in range(128):\n tmp = max(tmp, a + a^d)\n return tmp - d + 127*(n-2)\n\nfor n,d in ts:\n print(solve(n,d))", "code2": "T = int(input())\nts = [tuple(map(int,input().split())) for i in range(T)]\n\ndef solve(n,d):\n if n%2:\n return d + 127*(n-1)\n else:\n return 127*n - d\n\nfor n,d in ts:\n print(solve(n,d))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1542050225", "date2": "1542051165", "bleu_score": "0.6265389456892313", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1], "code1_test_score": 64, "total_score": 101, "input": "3\n3 1\n4 37\n1 2\n", "actual_output": "255\n472\n2\n", "expected_output": "255\n471\n2\n\n", "anno_code": ["T = int(input()) # (0): T=3\nts = [tuple(map(int,input().split())) for i in range(T)] # (1): ts=[(3, 1), (4, 37), (1, 2)]\n\ndef solve(n,d): # (2): solve=\n if n%2: # (5): T=3, ts=[(3, 1), (4, 37), (1, 2)], solve= (8): NO CHANGE (269): T=3, ts=[(3, 1), (4, 37), (1, 2)], solve=\n return d + 127*(n-1)\n else:\n tmp = 0 # (9): tmp=0\n for a in range(128): # (10): a=0 (12): a=1 ... (266): T=3, ts=[(3, 1), (4, 37), (1, 2)], solve=\n tmp = max(tmp, a + a^d) # (11): tmp=37 (13): tmp=39 ... (265): NO CHANGE\n return tmp - d + 127*(n-2)\n\nfor n,d in ts: # (3): n=3, d=1 (6): n=4, d=37 (267): n=1, d=2\n print(solve(n,d)) # (4): NO CHANGE (7): NO CHANGE (268): NO CHANGE\n"], "anno_status": [true], "diff_content": " T = int(input())\n ts = [tuple(map(int,input().split())) for i in range(T)]\n \n def solve(n,d):\n if n%2:\n return d + 127*(n-1)\n else:\n- tmp = 0\n- for a in range(128):\n- tmp = max(tmp, a + a^d)\n- return tmp - d + 127*(n-2)\n+ return 127*n - d\n \n for n,d in ts:\n print(solve(n,d))\n", "FL_content": "\n T = int(input())\n ts = [tuple(map(int,input().split())) for i in range(T)]\n \n def solve(n,d):\n if n%2:\n return d + 127*(n-1)\n else:\n tmp = 0\n for a in range(128):\n- tmp = max(tmp, a + a^d)\n return tmp - d + 127*(n-2)\n \n for n,d in ts:\n print(solve(n,d))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u392319141", "problem_id": "p02720", "submission1_id": "s234311500-FL", "submission2_id": "s286651000", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from heapq import heappop, heappush, heapify\nK = int(input())\n\nque = list(range(1, 10))\nV = set()\nheapify(que)\n\nwhile K >= 1:\n top = heappop(que)\n if top in V:\n continue\n V.add(top)\n K -= 1\n\n top = str(top)\n L = int(top[0])\n R = int(top[-1])\n\n for i in (L - 1, L, L + 1):\n if 1 <= i <= 9:\n heappush(que, int(str(i) + top))\n for i in (R - 1, R, R + 1):\n if 0 <= i <= 9:\n heappush(que, int(top + str(i)))\n\nprint(que[0])\n", "code2": "from heapq import heappop, heappush, heapify\nK = int(input())\nM = K\n\nque = list(range(1, 10))\nV = set()\nheapify(que)\n\nwhile M + 100 >= 0:\n top = heappop(que)\n if top in V:\n continue\n V.add(top)\n M -= 1\n\n top = str(top)\n L = int(top[0])\n R = int(top[-1])\n\n for i in (L - 1, L, L + 1):\n if 1 <= i <= 9:\n heappush(que, int(str(i) + top))\n for i in (R - 1, R, R + 1):\n if 0 <= i <= 9:\n heappush(que, int(top + str(i)))\n\nV = [int(d) for d in V]\nV.sort()\nprint(V[K - 1])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586051922", "date2": "1586052304", "bleu_score": "0.8869055666247208", "code1_test_status": [0, 1], "code1_test_score": 1, "total_score": 2, "input": "333\n", "actual_output": "10101\n", "expected_output": "10100\n\n", "anno_code": ["from heapq import heappop, heappush, heapify\nK = int(input()) # (0): K=333\n\nque = list(range(1, 10)) # (1): que=[1, 2, 3, 4, 5, 6, 7, 8, 9]\nV = set() # (2): V=set()\nheapify(que) # (3): NO CHANGE\n\nwhile K >= 1: # (4): NO CHANGE (31): NO CHANGE ... (10470): NO CHANGE\n top = heappop(que) # (5): que=[2, 4, 3, 8, 5, 6, 7, 9], top=1 (32): que=[3, 4, 6, 8, 5, 11, 7, 9, 11, 21, 10, 12], top=2 ... (10445): que=[10101, 10123, ..., 100121, 100122], top=10100\n if top in V: # (6): NO CHANGE (33): NO CHANGE ... (10446): NO CHANGE\n continue # (309): NO CHANGE (340): NO CHANGE ... (10310): NO CHANGE\n V.add(top) # (7): V={1} (34): V={1, 2} ... (10447): V={1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 21, 22, 23, 32, 33, 34, 43, 44, 45, 2100, 2101, 54, 55, 56, 2110, 2111, 2112, 65, 66, 67, 2121, 2122, 2123, 76, 77, 78, 87, 88, 89, 98, 99, 100, 101, 110, 111, 112, 121, 122, 123, 2210, 2211, 2212, 2221, 2222, 2223, 2232, 2233, 2234, 210, 211, 212, 221, 222, 223, 4321, 4322, 4323, 232, 233, 234, 4332, 4333, 4334, 4343, 4344, 4345, 2321, 2322, 2323, 2332, 2333, 2334, 2343, 2344, 2345, 321, 322, 323, 332, 333, 334, 4432, 4433, 4434, 343, 344, 345, 4443, 4444, 4445, 4454, 4455, 4456, 6543, 6544, 6545, 6554, 6555, 6556, 6565, 6566, 6567, 432, 433, 434, 443, 444, 445, 4543, 4544, 4545, 454, 455, 456, 4554, 4555, 4556, 4565, 4566, 4567, 6654, 6655, 6656, 6665, 6666, 6667, 6676, 6677, 6678, 543, 544, 545, 554, 555, 556, 565, 566, 567, 8765, 8766, 8767, 8776, 8777, 8778, 8787, 8788, 8789, 6765, 6766, 6767, 6776, 6777, 6778, 6787, 6788, 6789, 654, 655, 656, 665, 666, 667, 676, 677, 678, 8876, 8877, 8878, 8887, 8888, 8889, 8898, 8899, 765, 766, 767, 776, 777, 778, 787, 788, 789, 8987, 8988, 8989, 8998, 8999, 876, 877, 878, 887, 888, 889, 898, 899, 987, 988, 989, 998, 999, 1000, 1001, 1010, 1011, 1012, 1100, 1101, 1110, 1111, 1112, 1121, 1122, 1123, 3210, 3211, 3212, 3221, 3222, 3223, 3232, 3233, 3234, 1210, 1211, 1212, 1221, 1222, 1223, 1232, 1233, 1234, 3321, 3322, 3323, 3332, 3333, 3334, 3343, 3344, 3345, 5432, 5433, 5434, 5443, 5444, 5445, 5454, 5455, 5456, 3432, 3433, 3434, 3443, 3444, 3445, 3454, 3455, 3456, 5543, 5544, 5545, 5554, 5555, 5556, 5565, 5566, 5567, 7654, 7655, 7656, 7665, 7666, 7667, 7676, 7677, 7678, 5654, 5655, 5656, 5665, 5666, 5667, 5676, 5677, 5678, 7765, 7766, 7767, 7776, 7777, 7778, 7787, 7788, 7789, 9876, 9877, 9878, 9887, 9888, 9889, 9898, 9899, 7876, 7877, 7878, 7887, 7888, 7889, 7898, 7899, 9987, 9988, 9989, 9998, 9999, 10000, 10001, 10010, 10011, 10012, 10100}\n K -= 1 # (8): K=332 (35): K=331 ... (10448): K=0\n\n top = str(top) # (9): top=1 (36): top=2 ... (10449): top=10100\n L = int(top[0]) # (10): L=1 (37): L=2 ... (10450): NO CHANGE\n R = int(top[-1]) # (11): R=1 (38): R=2 ... (10451): R=0\n\n for i in (L - 1, L, L + 1): # (12): i=0 (14): i=1 ... (10460): NO CHANGE\n if 1 <= i <= 9: # (13): NO CHANGE (15): NO CHANGE ... (10458): NO CHANGE\n heappush(que, int(str(i) + top)) # (16): que=[2, 4, 3, 8, 5, 6, 7, 9, 11] (19): que=[2, 4, 3, 8, 5, 6, 7, 9, 11, 21] ... (10459): que=[10101, 10123, ..., 110100, 210100]\n for i in (R - 1, R, R + 1): # (21): i=0 (24): i=1 ... (10469): NO CHANGE\n if 0 <= i <= 9: # (22): NO CHANGE (25): NO CHANGE ... (10467): NO CHANGE\n heappush(que, int(top + str(i))) # (23): que=[2, 4, 3, 8, 5, 6, 7, 9, 11, 21, 10] (26): que=[2, 4, 3, 8, 5, 6, 7, 9, 11, 21, 10, 11] ... (10468): que=[10101, 10123, ..., 101000, 101001]\n\nprint(que[0])\n"], "anno_status": [false], "diff_content": " from heapq import heappop, heappush, heapify\n K = int(input())\n+M = K\n \n que = list(range(1, 10))\n V = set()\n heapify(que)\n \n-while K >= 1:\n+while M + 100 >= 0:\n top = heappop(que)\n if top in V:\n continue\n V.add(top)\n- K -= 1\n+ M -= 1\n \n top = str(top)\n L = int(top[0])\n R = int(top[-1])\n \n for i in (L - 1, L, L + 1):\n if 1 <= i <= 9:\n heappush(que, int(str(i) + top))\n for i in (R - 1, R, R + 1):\n if 0 <= i <= 9:\n heappush(que, int(top + str(i)))\n \n-print(que[0])\n+V = [int(d) for d in V]\n+V.sort()\n+print(V[K - 1])\n \n", "FL_content": "\n from heapq import heappop, heappush, heapify\n K = int(input())\n \n que = list(range(1, 10))\n V = set()\n heapify(que)\n \n while K >= 1:\n top = heappop(que)\n if top in V:\n continue\n V.add(top)\n K -= 1\n \n top = str(top)\n L = int(top[0])\n R = int(top[-1])\n \n for i in (L - 1, L, L + 1):\n if 1 <= i <= 9:\n heappush(que, int(str(i) + top))\n for i in (R - 1, R, R + 1):\n if 0 <= i <= 9:\n heappush(que, int(top + str(i)))\n \n print(que[0])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u533039576", "problem_id": "p02837", "submission1_id": "s713461682-FL", "submission2_id": "s740830325", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ninfo = [[] for i in range(n)]\nfor i in range(n):\n a = int(input())\n info[i] = [tuple(map(int, input().split())) for _ in range(a)]\n\nans = 0\nfor bit in range(1 << n):\n flag = True\n cnt = 0\n for i in range(n):\n if (bit >> i) & 1:\n t = 0\n cnt += 1\n else:\n t = 1\n for x, y in info[i]:\n b = (bit >> (x - 1)) & 1\n if b != abs(t - y):\n flag = False\n break\n if not flag:\n break\n if flag:\n ans = max(ans, cnt)\n\nprint(ans)\n", "code2": "n = int(input())\ninfo = [[] for i in range(n)]\nfor i in range(n):\n a = int(input())\n info[i] = [tuple(map(int, input().split())) for _ in range(a)]\n\nans = 0\nfor bit in range(1 << n):\n flag = True\n cnt = 0\n for i in range(n):\n if (bit >> i) & 1:\n cnt += 1\n else:\n continue\n\n for x, y in info[i]:\n b = (bit >> (x - 1)) & 1\n if b != y:\n flag = False\n break\n if not flag:\n break\n if flag:\n ans = max(ans, cnt)\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575871266", "date2": "1575871425", "bleu_score": "0.9386825306794612", "code1_test_status": [1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1], "code1_test_score": 48, "total_score": 103, "input": "3\n2\n2 0\n3 0\n2\n3 2\n0 0\n2\n1 1\n1 1\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["n = int(input()) # (0): n=3\ninfo = [[] for i in range(n)] # (1): info\nfor i in range(n): # (2): i=0 (5): info, i=1 ... (11): NO CHANGE\n a = int(input()) # (3): a=2 (6): info (9): info\n info[i] = [tuple(map(int, input().split())) for _ in range(a)] # (4): info=[[(2, 0), (3, 0)], [], []] (7): info (10): info\n\nans = 0 # (12): ans=0\nfor bit in range(1 << n): # (13): bit=0 (27): bit=1 ... (158): NO CHANGE\n flag = True # (14): flag=True (28): flag=True ... (144): flag=True\n cnt = 0 # (15): cnt=0 (29): NO CHANGE ... (145): cnt=0\n for i in range(n): # (16): i=0 (30): NO CHANGE ... (146): i=0\n if (bit >> i) & 1: # (17): NO CHANGE (31): NO CHANGE ... (147): NO CHANGE\n t = 0 # (32): t=0 (75): t=0 ... (148): NO CHANGE\n cnt += 1 # (33): cnt=1 (76): cnt=1 ... (149): cnt=1\n else:\n t = 1 # (18): t=1 (44): t=1 ... (122): t=1\n for x, y in info[i]: # (19): x=2, y=0 (34): NO CHANGE ... (150): x=2, y=0\n b = (bit >> (x - 1)) & 1 # (20): b=0 (35): NO CHANGE ... (151): NO CHANGE\n if b != abs(t - y): # (21): NO CHANGE (36): NO CHANGE ... (152): NO CHANGE\n flag = False # (22): flag=False (48): flag=False ... (153): flag=False\n break # (23): NO CHANGE (49): NO CHANGE ... (154): NO CHANGE\n if not flag: # (24): NO CHANGE (41): NO CHANGE ... (155): NO CHANGE\n break # (25): NO CHANGE (51): NO CHANGE ... (156): NO CHANGE\n if flag: # (26): NO CHANGE (52): NO CHANGE ... (157): NO CHANGE\n ans = max(ans, cnt)\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " n = int(input())\n info = [[] for i in range(n)]\n for i in range(n):\n a = int(input())\n info[i] = [tuple(map(int, input().split())) for _ in range(a)]\n \n ans = 0\n for bit in range(1 << n):\n flag = True\n cnt = 0\n for i in range(n):\n if (bit >> i) & 1:\n- t = 0\n cnt += 1\n else:\n- t = 1\n+ continue\n+\n for x, y in info[i]:\n b = (bit >> (x - 1)) & 1\n- if b != abs(t - y):\n+ if b != y:\n flag = False\n break\n if not flag:\n break\n if flag:\n ans = max(ans, cnt)\n \n print(ans)\n \n", "FL_content": "\n n = int(input())\n info = [[] for i in range(n)]\n for i in range(n):\n a = int(input())\n info[i] = [tuple(map(int, input().split())) for _ in range(a)]\n \n ans = 0\n for bit in range(1 << n):\n flag = True\n cnt = 0\n for i in range(n):\n if (bit >> i) & 1:\n- t = 0\n cnt += 1\n else:\n- t = 1\n for x, y in info[i]:\n b = (bit >> (x - 1)) & 1\n if b != abs(t - y):\n flag = False\n break\n if not flag:\n break\n if flag:\n ans = max(ans, cnt)\n \n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 28 }, { "user_id": "u506554532", "problem_id": "p00722", "submission1_id": "s189572657-FL", "submission2_id": "s928588072", "status1": "Wrong Answer", "status2": "Accepted", "code1": "MAXN = 10**6\nsieve = [1 for i in range(MAXN+1)]\nn = 2\nwhile n*n <= MAXN:\n if sieve[n]:\n for i in range(2*n,MAXN+1,n):\n sieve[i] = 0\n n += 1\n\nwhile True:\n a,d,n = map(int,input().split())\n if n == 0: break\n cnt = 0\n for i in range(a,MAXN+1,d):\n if sieve[i]:\n cnt += 1\n if cnt == n:\n print(i)\n break", "code2": "MAXN = 10**6\nsieve = [0]*2 + [1]*MAXN\nn = 2\nwhile n*n <= MAXN:\n if sieve[n]:\n for i in range(2*n,MAXN+1,n):\n sieve[i] = 0\n n += 1\n\nwhile True:\n a,d,n = map(int,input().split())\n if n == 0: break\n cnt = 0\n for i in range(a,MAXN+1,d):\n if sieve[i]:\n cnt += 1\n if cnt == n:\n print(i)\n break", "original_language1": "Python3", "original_language2": "Python3", "date1": "1513068322", "date2": "1513068460", "bleu_score": "0.9427123898830535", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "367 186 151\n179 10 152\n271 37 39\n103 230 1\n27 104 185\n55 87 85\n1 1 1\n9075 337 210\n307 24 79\n331 346 345\n259 170 79\n37 58 102\n0 0 0\n", "actual_output": "92809\n4909\n12037\n103\n93523\n46861\n1\n899429\n5107\n725201\n48029\n24919\n", "expected_output": "92809\n4909\n12037\n103\n93523\n46861\n2\n899429\n5107\n725201\n48029\n24919\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " MAXN = 10**6\n-sieve = [1 for i in range(MAXN+1)]\n+sieve = [0]*2 + [1]*MAXN\n n = 2\n while n*n <= MAXN:\n if sieve[n]:\n for i in range(2*n,MAXN+1,n):\n sieve[i] = 0\n n += 1\n \n while True:\n a,d,n = map(int,input().split())\n if n == 0: break\n cnt = 0\n for i in range(a,MAXN+1,d):\n if sieve[i]:\n cnt += 1\n if cnt == n:\n print(i)\n break\n", "FL_content": "\n MAXN = 10**6\n sieve = [1 for i in range(MAXN+1)]\n n = 2\n while n*n <= MAXN:\n if sieve[n]:\n for i in range(2*n,MAXN+1,n):\n sieve[i] = 0\n n += 1\n \n while True:\n a,d,n = map(int,input().split())\n if n == 0: break\n cnt = 0\n for i in range(a,MAXN+1,d):\n if sieve[i]:\n cnt += 1\n if cnt == n:\n print(i)\n break\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u325227960", "problem_id": "p02697", "submission1_id": "s723856144-FL", "submission2_id": "s680975528", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m = map(int,input().split())\nANS = [[0] * 2 for i in range(m)]\n\na = 0\nb = 1\nfor i in range(m):\n if i*4 == n:\n b = (b+1) % n\n ANS[i] = [a, b]\n a = (a-1) % n\n b = (b+1) % n\n \n\nfor i in range(m):\n print(ANS[i][0]+1, ANS[i][1]+1)", "code2": "n,m = map(int,input().split())\nANS = [[0] * 2 for i in range(m)]\n\na = 0\nb = 1\nc = 0\nf = 1\nfor i in range(m):\n if n%2 == 0 and (c+2) > n\n b = (b+1) % n\n f = 0\n ANS[i] = [a, b]\n c += 2\n a = (a-1) % n\n b = (b+1) % n\n \n\nfor i in range(m):\n print(ANS[i][0]+1, ANS[i][1]+1)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1588470364", "date2": "1588470635", "bleu_score": "0.8085585443030627", "code1_test_status": [0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 6, "input": "19 9\n", "actual_output": "1 2\n19 3\n18 4\n17 5\n16 6\n15 7\n14 8\n13 9\n12 10\n", "expected_output": "1 10\n2 9\n3 8\n4 7\n5 6\n11 19\n12 18\n13 17\n14 16\n\n", "anno_code": ["n,m = map(int,input().split()) # (0): n=19, m=9\nANS = [[0] * 2 for i in range(m)] # (1): ANS\n\na = 0 # (2): a=0\nb = 1 # (3): b=1\nfor i in range(m): # (4): i=0 (9): i=1 ... (49): NO CHANGE\n if i*4 == n: # (5): NO CHANGE (10): NO CHANGE ... (45): NO CHANGE\n b = (b+1) % n\n ANS[i] = [a, b] # (6): ANS (11): ANS ... (46): ANS\n a = (a-1) % n # (7): a=18 (12): a=17 ... (47): a=10\n b = (b+1) % n # (8): b=2 (13): b=3 ... (48): b=10\n \n\nfor i in range(m): # (50): i=0 (52): i=1 ... (66): i=8\n print(ANS[i][0]+1, ANS[i][1]+1) # (51): NO CHANGE (53): NO CHANGE ... (67): NO CHANGE\n"], "anno_status": [true], "diff_content": " n,m = map(int,input().split())\n ANS = [[0] * 2 for i in range(m)]\n \n a = 0\n b = 1\n+c = 0\n+f = 1\n for i in range(m):\n- if i*4 == n:\n+ if n%2 == 0 and (c+2) > n\n b = (b+1) % n\n+ f = 0\n ANS[i] = [a, b]\n+ c += 2\n a = (a-1) % n\n b = (b+1) % n\n \n \n for i in range(m):\n print(ANS[i][0]+1, ANS[i][1]+1)\n", "FL_content": "\n n,m = map(int,input().split())\n ANS = [[0] * 2 for i in range(m)]\n \n a = 0\n b = 1\n for i in range(m):\n- if i*4 == n:\n b = (b+1) % n\n ANS[i] = [a, b]\n a = (a-1) % n\n b = (b+1) % n\n \n \n for i in range(m):\n print(ANS[i][0]+1, ANS[i][1]+1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u845620905", "problem_id": "p03945", "submission1_id": "s071866382-FL", "submission2_id": "s239716592", "status1": "Wrong Answer", "status2": "Accepted", "code1": "b = input()\nd = []\nisWhite = False\ncnt = 0\nfor i in range(len(b)-1):\n if b[i] != b[i+1]:\n d.append(cnt)\n else:\n cnt+=1\n\nprint(len(d)-1)\n \n \n", "code2": "b = input()\nd = []\nisWhite = False\ncnt = 0\nfor i in range(len(b)-1):\n if b[i] != b[i+1]:\n d.append(cnt)\n else:\n cnt+=1\n\nprint(len(d))\n \n \n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560868850", "date2": "1560868957", "bleu_score": "0.9763882187742972", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "XWCADWAXWB\n", "actual_output": "8\n", "expected_output": "9\n\n", "anno_code": ["b = input() # (0): b=XWCADWAXWB\nd = [] # (1): d=[]\nisWhite = False # (2): isWhite=False\ncnt = 0 # (3): cnt=0\nfor i in range(len(b)-1): # (4): i=0 (7): i=1 ... (31): NO CHANGE\n if b[i] != b[i+1]: # (5): NO CHANGE (8): NO CHANGE ... (29): NO CHANGE\n d.append(cnt) # (6): d=[0] (9): d=[0, 0] ... (30): d=[0, 0, 0, 0, 0, 0, 0, 0, 0]\n else:\n cnt+=1\n\nprint(len(d)-1)\n \n \n"], "anno_status": [true], "diff_content": " b = input()\n d = []\n isWhite = False\n cnt = 0\n for i in range(len(b)-1):\n if b[i] != b[i+1]:\n d.append(cnt)\n else:\n cnt+=1\n \n-print(len(d)-1)\n+print(len(d))\n \n \n \n", "FL_content": "\n b = input()\n d = []\n isWhite = False\n cnt = 0\n-for i in range(len(b)-1):\n if b[i] != b[i+1]:\n d.append(cnt)\n else:\n cnt+=1\n \n print(len(d)-1)\n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u481571686", "problem_id": "p01102", "submission1_id": "s565601640-FL", "submission2_id": "s510258139", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A=[]\nwhile True:\t\n\ta=input().split('\"')\n\tif a[0]==\".\":\n\t\tbreak\n\tb=input().split('\"')\n\t\n\tcnt=0\n\n\tif len(a)!=len(b):\n\t\tA.append(-1)\n\telse:\n\t\tfor i in range(len(a)):\n\t\t\tif(a[i]==b[i]):\n\t\t\t\tpass\n\t\t\telse:\n\t\t\t\tcnt+=1\n\t\tprint(cnt)\n\t\tif cnt>=2:\n\t\t\tA.append(-1)\n\t\tif cnt==1:\n\t\t\tA.append(0)\n\t\tif cnt==0:\n\t\t\tA.append(1)\n\nA.reverse()\n\nfor i in range(len(A)):\n\ttmp=A.pop()\n\tif tmp==-1:\n\t\tprint(\"DIFFERENT\")\n\telif tmp==0:\n\t\tprint(\"CLOSE\")\n\telse:\n\t\tprint(\"IDENTICAL\")\n", "code2": "A=[]\nwhile True:\t\n\ta=input().split('\"')\n\tif a[0]==\".\":\n\t\tbreak\n\tb=input().split('\"')\n\t\n\tcnt=0\n\n\tif len(a)!=len(b):\n\t\tA.append(-1)\n\telse:\n\t\tfor i in range(len(a)):\n\t\t\tif(a[i]==b[i]):\n\t\t\t\tpass\n\t\t\telse:\n\t\t\t\tif i%2==1:\n\t\t\t\t\tcnt+=1\n\t\t\t\telse:\n\t\t\t\t\tcnt+=2\n\t\tif cnt>=2:\n\t\t\tA.append(-1)\n\t\tif cnt==1:\n\t\t\tA.append(0)\n\t\tif cnt==0:\n\t\t\tA.append(1)\n\nA.reverse()\n\nfor i in range(len(A)):\n\ttmp=A.pop()\n\tif tmp==-1:\n\t\tprint(\"DIFFERENT\")\n\telif tmp==0:\n\t\tprint(\"CLOSE\")\n\telse:\n\t\tprint(\"IDENTICAL\")\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526956172", "date2": "1527006706", "bleu_score": "0.9270424711733446", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "print\"hello\";print133\n321tnirp;\"olleh\"tnirp\nread\"e1input\";solvB;output;\n;tuptuo;evlos;\"2B\"daer\nreae\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"\"\"\"\"\"\"\"\n\"\"\"52\"\"#\"\"\nslow\"program\"\nfast\"code\"\n\"super\"fast\"program\"\n\"super\"faster\"qrogram\"\nX\"\"\nY\nI\"S\"\"CREAM\"\nI\"CE\"\"BREAM\"\n11\"22\"11\n1\"33\"112\n.\n", "actual_output": "3\n3\n3\n2\n2\n2\n3\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\n", "expected_output": "DIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\n\n", "anno_code": ["A=[] # (0): A=[]\nwhile True:\t # (1): NO CHANGE (22): NO CHANGE ... (180): NO CHANGE\n\ta=input().split('\"') # (2): a=['print', 'hello', ';print133'] (23): a=['read', 'e1input', ';solvB;output;'] ... (181): a=['.']\n\tif a[0]==\".\": # (3): NO CHANGE (24): NO CHANGE ... (182): NO CHANGE\n\t\tbreak # (183): NO CHANGE\n\tb=input().split('\"') # (4): b=['321tnirp;', 'olleh', 'tnirp'] (25): b=[';tuptuo;evlos;', '2B', 'daer'] ... (162): b=['1', '33', '112']\n\t\n\tcnt=0 # (5): cnt=0 (26): cnt=0 ... (163): cnt=0\n\n\tif len(a)!=len(b): # (6): NO CHANGE (27): NO CHANGE ... (164): NO CHANGE\n\t\tA.append(-1) # (76): A=[-1, -1, -1, -1] (131): A=[-1, -1, -1, -1, -1, -1, -1]\n\telse:\n\t\tfor i in range(len(a)): # (7): i=0 (10): i=1 ... (174): NO CHANGE\n\t\t\tif(a[i]==b[i]): # (8): NO CHANGE (11): NO CHANGE ... (172): NO CHANGE\n\t\t\t\tpass # (57): NO CHANGE (63): NO CHANGE ... (152): NO CHANGE\n\t\t\telse:\n\t\t\t\tcnt+=1 # (9): cnt=1 (12): cnt=2 ... (173): cnt=3\n\t\tprint(cnt) # (17): NO CHANGE (38): NO CHANGE ... (175): NO CHANGE\n\t\tif cnt>=2: # (18): NO CHANGE (39): NO CHANGE ... (176): NO CHANGE\n\t\t\tA.append(-1) # (19): A=[-1] (40): A=[-1, -1] ... (177): A=[-1, -1, -1, -1, -1, -1, -1, -1, -1]\n\t\tif cnt==1: # (20): NO CHANGE (41): NO CHANGE ... (178): NO CHANGE\n\t\t\tA.append(0)\n\t\tif cnt==0: # (21): NO CHANGE (42): NO CHANGE ... (179): NO CHANGE\n\t\t\tA.append(1)\n\nA.reverse() # (184): NO CHANGE\n\nfor i in range(len(A)): # (185): i=0 (189): i=1 ... (217): i=8\n\ttmp=A.pop() # (186): A=[-1, -1, -1, -1, -1, -1, -1, -1], tmp=-1 (190): A=[-1, -1, -1, -1, -1, -1, -1] ... (218): A=[]\n\tif tmp==-1: # (187): NO CHANGE (191): NO CHANGE ... (219): NO CHANGE\n\t\tprint(\"DIFFERENT\") # (188): NO CHANGE (192): NO CHANGE ... (220): NO CHANGE\n\telif tmp==0:\n\t\tprint(\"CLOSE\")\n\telse:\n\t\tprint(\"IDENTICAL\")\n"], "anno_status": [false], "diff_content": " A=[]\n while True:\t\n \ta=input().split('\"')\n \tif a[0]==\".\":\n \t\tbreak\n \tb=input().split('\"')\n \t\n \tcnt=0\n \n \tif len(a)!=len(b):\n \t\tA.append(-1)\n \telse:\n \t\tfor i in range(len(a)):\n \t\t\tif(a[i]==b[i]):\n \t\t\t\tpass\n \t\t\telse:\n-\t\t\t\tcnt+=1\n-\t\tprint(cnt)\n+\t\t\t\tif i%2==1:\n+\t\t\t\t\tcnt+=1\n+\t\t\t\telse:\n+\t\t\t\t\tcnt+=2\n \t\tif cnt>=2:\n \t\t\tA.append(-1)\n \t\tif cnt==1:\n \t\t\tA.append(0)\n \t\tif cnt==0:\n \t\t\tA.append(1)\n \n A.reverse()\n \n for i in range(len(A)):\n \ttmp=A.pop()\n \tif tmp==-1:\n \t\tprint(\"DIFFERENT\")\n \telif tmp==0:\n \t\tprint(\"CLOSE\")\n \telse:\n \t\tprint(\"IDENTICAL\")\n \n", "FL_content": "\n A=[]\n while True:\t\n \ta=input().split('\"')\n \tif a[0]==\".\":\n \t\tbreak\n \tb=input().split('\"')\n \t\n \tcnt=0\n \n \tif len(a)!=len(b):\n \t\tA.append(-1)\n \telse:\n \t\tfor i in range(len(a)):\n \t\t\tif(a[i]==b[i]):\n \t\t\t\tpass\n \t\t\telse:\n \t\t\t\tcnt+=1\n-\t\tprint(cnt)\n \t\tif cnt>=2:\n \t\t\tA.append(-1)\n \t\tif cnt==1:\n \t\t\tA.append(0)\n \t\tif cnt==0:\n \t\t\tA.append(1)\n \n A.reverse()\n \n for i in range(len(A)):\n \ttmp=A.pop()\n \tif tmp==-1:\n \t\tprint(\"DIFFERENT\")\n \telif tmp==0:\n \t\tprint(\"CLOSE\")\n \telse:\n \t\tprint(\"IDENTICAL\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 36 }, { "user_id": "u344276999", "problem_id": "p02536", "submission1_id": "s233953844-FL", "submission2_id": "s598323519", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nclass UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n\n if x == y:\n return\n\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n\n def size(self, x):\n return -self.parents[self.find(x)]\n\n def same(self, x, y):\n return self.find(x) == self.find(y)\n\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n\n def group_count(self):\n return len(self.roots())\n\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n\n\ndef main():\n N, M = [int(i) for i in input().split()]\n uf = UnionFind(N)\n for i in range(M):\n A,B = [int(i) for i in input().split()]\n uf.union(A-1,B-1)\n print(N-uf.group_count())\n\nif __name__ == \"__main__\":\n main()", "code2": "\nclass UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n\n if x == y:\n return\n\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n\n def size(self, x):\n return -self.parents[self.find(x)]\n\n def same(self, x, y):\n return self.find(x) == self.find(y)\n\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n\n def group_count(self):\n return len(self.roots())\n\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n\n\ndef main():\n N, M = [int(i) for i in input().split()]\n uf = UnionFind(N)\n for i in range(M):\n A,B = [int(i) for i in input().split()]\n uf.union(A-1,B-1)\n print(uf.group_count()-1)\n\nif __name__ == \"__main__\":\n main()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1601171737", "date2": "1601171872", "bleu_score": "0.9965831936604791", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 90, "input": "18 1\n1 2\n", "actual_output": "1\n", "expected_output": "16\n\n", "anno_code": ["\nclass UnionFind(): # (0): UnionFind=\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n\n if x == y:\n return\n\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n\n def size(self, x):\n return -self.parents[self.find(x)]\n\n def same(self, x, y):\n return self.find(x) == self.find(y)\n\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n\n def group_count(self):\n return len(self.roots())\n\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n\n\ndef main(): # (1): main=\n N, M = [int(i) for i in input().split()]\n uf = UnionFind(N)\n for i in range(M):\n A,B = [int(i) for i in input().split()]\n uf.union(A-1,B-1)\n print(N-uf.group_count())\n\nif __name__ == \"__main__\":\n main()"], "anno_status": [false], "diff_content": " \n class UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n \n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n \n if x == y:\n return\n \n if self.parents[x] > self.parents[y]:\n x, y = y, x\n \n self.parents[x] += self.parents[y]\n self.parents[y] = x\n \n def size(self, x):\n return -self.parents[self.find(x)]\n \n def same(self, x, y):\n return self.find(x) == self.find(y)\n \n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n \n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n \n def group_count(self):\n return len(self.roots())\n \n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n \n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n \n \n def main():\n N, M = [int(i) for i in input().split()]\n uf = UnionFind(N)\n for i in range(M):\n A,B = [int(i) for i in input().split()]\n uf.union(A-1,B-1)\n- print(N-uf.group_count())\n+ print(uf.group_count()-1)\n \n if __name__ == \"__main__\":\n main()\n", "FL_content": "\n \n class UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n \n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n \n if x == y:\n return\n \n if self.parents[x] > self.parents[y]:\n x, y = y, x\n \n self.parents[x] += self.parents[y]\n self.parents[y] = x\n \n def size(self, x):\n return -self.parents[self.find(x)]\n \n def same(self, x, y):\n return self.find(x) == self.find(y)\n \n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n \n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n \n def group_count(self):\n return len(self.roots())\n \n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n \n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n \n \n def main():\n N, M = [int(i) for i in input().split()]\n uf = UnionFind(N)\n for i in range(M):\n A,B = [int(i) for i in input().split()]\n uf.union(A-1,B-1)\n- print(N-uf.group_count())\n \n if __name__ == \"__main__\":\n main()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 59 }, { "user_id": "u408284582", "problem_id": "p02345", "submission1_id": "s887866162-FL", "submission2_id": "s349762068", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(10000)\n\n\ndef initRMQ(n, D):\n n_ = 1\n\n while n_ < n:\n n_ *= 2\n\n for i in range(2*n_ - 1):\n D.append(2147483647)\n\n return n_\n\n\ndef update(k, a):\n k += n_ - 1\n D[k] = a\n while k > 0:\n k = int((k - 1) / 2)\n D[k] = min(D[k*2 + 1], D[k*2 + 2])\n\n\ndef findMin(a, b):\n return query(a, b + 1, 0, 0, n)\n\n\ndef query(a, b, k, l, r):\n \n if r <= a or b <= l:\n return 2147483647\n\n if a <= l and r <= b:\n return D[k]\n\n vl = query(a, b, k*2 + 1, l, int((l + r)/2))\n vr = query(a, b, k*2 + 2, int((l + r)/2), r)\n\n return min(vl, vr)\n\n\nif __name__ == '__main__':\n n, q = map(int, input().split())\n\n D = []\n n_ = initRMQ(n, D)\n\n for _ in range(q):\n \n c, x, y = map(int, input().split())\n\n if c == 0:\n update(x, y)\n\n else :\n print(findMin(x, y))\n\n", "code2": "import sys\nsys.setrecursionlimit(10000)\n\n\ndef initRMQ(n, D):\n n_ = 1\n\n while n_ < n:\n n_ *= 2\n\n for i in range(2*n_ - 1):\n D.append(2147483647)\n\n return n_\n\n\ndef update(k, a):\n k += n_ - 1\n D[k] = a\n while k > 0:\n k = int((k - 1) / 2)\n D[k] = min(D[k*2 + 1], D[k*2 + 2])\n\n\ndef findMin(a, b):\n return query(a, b + 1, 0, 0, n_)\n\n\ndef query(a, b, k, l, r):\n \n if r <= a or b <= l:\n return 2147483647\n\n if a <= l and r <= b:\n return D[k]\n\n vl = query(a, b, k*2 + 1, l, int((l + r)/2))\n vr = query(a, b, k*2 + 2, int((l + r)/2), r)\n\n return min(vl, vr)\n\n\nif __name__ == '__main__':\n n, q = map(int, input().split())\n\n D = []\n n_ = initRMQ(n, D)\n\n for _ in range(q):\n \n c, x, y = map(int, input().split())\n\n if c == 0:\n update(x, y)\n\n else :\n print(findMin(x, y))\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1524716266", "date2": "1524716533", "bleu_score": "0.997230675301244", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 76, "total_score": 102, "input": "5 5\n0 0 0\n1 2 2\n1 0 1\n0 1 9\n1 1 2\n", "actual_output": "2147483647\n0\n2147483647\n", "expected_output": "2147483647\n0\n9\n\n", "anno_code": ["import sys\nsys.setrecursionlimit(10000) # (0): NO CHANGE\n\n\ndef initRMQ(n, D): # (1): initRMQ=\n n_ = 1\n\n while n_ < n:\n n_ *= 2\n\n for i in range(2*n_ - 1):\n D.append(2147483647)\n\n return n_\n\n\ndef update(k, a): # (2): update=\n k += n_ - 1\n D[k] = a\n while k > 0:\n k = int((k - 1) / 2)\n D[k] = min(D[k*2 + 1], D[k*2 + 2])\n\n\ndef findMin(a, b): # (3): findMin=\n return query(a, b + 1, 0, 0, n)\n\n\ndef query(a, b, k, l, r): # (4): query=\n \n if r <= a or b <= l:\n return 2147483647\n\n if a <= l and r <= b:\n return D[k]\n\n vl = query(a, b, k*2 + 1, l, int((l + r)/2))\n vr = query(a, b, k*2 + 2, int((l + r)/2), r)\n\n return min(vl, vr)\n\n\nif __name__ == '__main__':\n n, q = map(int, input().split())\n\n D = []\n n_ = initRMQ(n, D)\n\n for _ in range(q):\n \n c, x, y = map(int, input().split())\n\n if c == 0:\n update(x, y)\n\n else :\n print(findMin(x, y))\n\n"], "anno_status": [true], "diff_content": " import sys\n sys.setrecursionlimit(10000)\n \n \n def initRMQ(n, D):\n n_ = 1\n \n while n_ < n:\n n_ *= 2\n \n for i in range(2*n_ - 1):\n D.append(2147483647)\n \n return n_\n \n \n def update(k, a):\n k += n_ - 1\n D[k] = a\n while k > 0:\n k = int((k - 1) / 2)\n D[k] = min(D[k*2 + 1], D[k*2 + 2])\n \n \n def findMin(a, b):\n- return query(a, b + 1, 0, 0, n)\n+ return query(a, b + 1, 0, 0, n_)\n \n \n def query(a, b, k, l, r):\n \n if r <= a or b <= l:\n return 2147483647\n \n if a <= l and r <= b:\n return D[k]\n \n vl = query(a, b, k*2 + 1, l, int((l + r)/2))\n vr = query(a, b, k*2 + 2, int((l + r)/2), r)\n \n return min(vl, vr)\n \n \n if __name__ == '__main__':\n n, q = map(int, input().split())\n \n D = []\n n_ = initRMQ(n, D)\n \n for _ in range(q):\n \n c, x, y = map(int, input().split())\n \n if c == 0:\n update(x, y)\n \n else :\n print(findMin(x, y))\n \n \n", "FL_content": "\n import sys\n sys.setrecursionlimit(10000)\n \n \n def initRMQ(n, D):\n n_ = 1\n \n while n_ < n:\n n_ *= 2\n \n for i in range(2*n_ - 1):\n D.append(2147483647)\n \n return n_\n \n \n def update(k, a):\n k += n_ - 1\n D[k] = a\n while k > 0:\n k = int((k - 1) / 2)\n D[k] = min(D[k*2 + 1], D[k*2 + 2])\n \n \n def findMin(a, b):\n return query(a, b + 1, 0, 0, n)\n \n \n def query(a, b, k, l, r):\n \n if r <= a or b <= l:\n return 2147483647\n \n if a <= l and r <= b:\n return D[k]\n \n vl = query(a, b, k*2 + 1, l, int((l + r)/2))\n vr = query(a, b, k*2 + 2, int((l + r)/2), r)\n \n return min(vl, vr)\n \n \n if __name__ == '__main__':\n n, q = map(int, input().split())\n \n D = []\n n_ = initRMQ(n, D)\n \n for _ in range(q):\n \n c, x, y = map(int, input().split())\n \n if c == 0:\n update(x, y)\n \n else :\n print(findMin(x, y))\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 59 }, { "user_id": "u844789719", "problem_id": "p02697", "submission1_id": "s454359895-FL", "submission2_id": "s009610821", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = [int(_) for _ in input().split()]\nse = set()\nans = []\nd = 1\nfor i in range(1, N + 1):\n if i in se:\n continue\n j = (i + d) % N\n ans += [i, j]\n se.add(i)\n se.add(j)\n d += 1\nans = ans[:2 * M]\nprint('\\n'.join(f'{i} {j}' for i, j in zip(ans[::2], ans[1::2])))\n", "code2": "N, M = [int(_) for _ in input().split()]\nl = 1\nr = N\nans = []\nfor _ in range(M - M \n ans += [l, r]\n l += 1\n r -= 1\nif (r - l) % 2 == (l + N - r) % 2:\n r -= 1\nfor _ in range(M \n ans += [l, r]\n l += 1\n r -= 1\nans = ans[:2 * M]\nprint('\\n'.join(f'{a} {b}' for a, b in zip(ans[::2], ans[1::2])))\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596075023", "date2": "1596076726", "bleu_score": "0.6267952408909887", "code1_test_status": [0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 6, "input": "15 7\n", "actual_output": "1 2\n3 5\n4 7\n6 10\n8 13\n9 0\n11 3\n", "expected_output": "1 8\n2 7\n3 6\n4 5\n9 15\n10 14\n11 13\n\n", "anno_code": ["N, M = [int(_) for _ in input().split()] # (0): N=15, M=7\nse = set() # (1): se=set()\nans = [] # (2): ans=[]\nd = 1 # (3): d=1\nfor i in range(1, N + 1): # (4): i=1 (11): i=2 ... (89): NO CHANGE\n if i in se: # (5): NO CHANGE (12): NO CHANGE ... (83): NO CHANGE\n continue # (13): NO CHANGE (30): NO CHANGE ... (74): NO CHANGE\n j = (i + d) % N # (6): j=2 (16): j=5 ... (84): j=10\n ans += [i, j] # (7): ans=[1, 2] (17): ans=[1, 2, 3, 5] ... (85): ans=[1, 2, 3, 5, 4, 7, 6, 10, 8, 13, 9, 0, 11, 3, 12, 5, 14, 8, 15, 10]\n se.add(i) # (8): se={1} (18): se={1, 2, 3} ... (86): se={0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}\n se.add(j) # (9): se={1, 2} (19): se={1, 2, 3, 5} ... (87): NO CHANGE\n d += 1 # (10): d=2 (20): d=3 ... (88): d=11\nans = ans[:2 * M] # (90): ans=[1, 2, 3, 5, 4, 7, 6, 10, 8, 13, 9, 0, 11, 3]\nprint('\\n'.join(f'{i} {j}' for i, j in zip(ans[::2], ans[1::2])))\n"], "anno_status": [true], "diff_content": " N, M = [int(_) for _ in input().split()]\n-se = set()\n+l = 1\n+r = N\n ans = []\n-d = 1\n-for i in range(1, N + 1):\n- if i in se:\n- continue\n- j = (i + d) % N\n- ans += [i, j]\n- se.add(i)\n- se.add(j)\n- d += 1\n+for _ in range(M - M \n+ ans += [l, r]\n+ l += 1\n+ r -= 1\n+if (r - l) % 2 == (l + N - r) % 2:\n+ r -= 1\n+for _ in range(M \n+ ans += [l, r]\n+ l += 1\n+ r -= 1\n ans = ans[:2 * M]\n-print('\\n'.join(f'{i} {j}' for i, j in zip(ans[::2], ans[1::2])))\n+print('\\n'.join(f'{a} {b}' for a, b in zip(ans[::2], ans[1::2])))\n \n", "FL_content": "\n N, M = [int(_) for _ in input().split()]\n se = set()\n ans = []\n d = 1\n for i in range(1, N + 1):\n if i in se:\n continue\n j = (i + d) % N\n ans += [i, j]\n se.add(i)\n se.add(j)\n d += 1\n ans = ans[:2 * M]\n print('\\n'.join(f'{i} {j}' for i, j in zip(ans[::2], ans[1::2])))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u312821683", "problem_id": "p03719", "submission1_id": "s734192383-FL", "submission2_id": "s583609420", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A,B,C = input().split()\nif C >= A and C <= B:\n print('YES')\nelse:\n print('NO')", "code2": "A,B,C = map(int, input().split())\n\nif C >= A and C <= B:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600612106", "date2": "1600972714", "bleu_score": "0.7976726452902457", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 21, "input": "0 2 -6\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["A,B,C = input().split() # (0): A=0, B=2, C=-6\nif C >= A and C <= B: # (1): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": "-A,B,C = input().split()\n+A,B,C = map(int, input().split())\n+\n if C >= A and C <= B:\n- print('YES')\n+ print('Yes')\n else:\n- print('NO')\n+ print('No')\n", "FL_content": "\n A,B,C = input().split()\n if C >= A and C <= B:\n- print('YES')\n else:\n- print('NO')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u477837488", "problem_id": "p02601", "submission1_id": "s776199794-FL", "submission2_id": "s314053744", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = map(int, input().split())\nq = int(input())\n\nk = 0\n\nfor i in range(q+1):\n for j in range(0, q-i+1):\n print(i, j)\n B_ = B * (2 ** i)\n C_ = C * (2 ** j)\n if A < B_ and B_ < C_ and A < C_:\n k = 1\nif k != 0:\n print('Yes')\nelse:\n print('No')", "code2": "A, B, C = map(int, input().split())\nq = int(input())\n\nk = 0\n\nfor i in range(q+1):\n for j in range(0, q-i+1):\n B_ = B * (2 ** i)\n C_ = C * (2 ** j)\n if A < B_ and B_ < C_ and A < C_:\n k = 1\nif k != 0:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595726097", "date2": "1595726168", "bleu_score": "0.9293590971428531", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "16 2 4\n9\n", "actual_output": "0 0\n0 1\n0 2\n0 3\n0 4\n0 5\n0 6\n0 7\n0 8\n0 9\n1 0\n1 1\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n2 0\n2 1\n2 2\n2 3\n2 4\n2 5\n2 6\n2 7\n3 0\n3 1\n3 2\n3 3\n3 4\n3 5\n3 6\n4 0\n4 1\n4 2\n4 3\n4 4\n4 5\n5 0\n5 1\n5 2\n5 3\n5 4\n6 0\n6 1\n6 2\n6 3\n7 0\n7 1\n7 2\n8 0\n8 1\n9 0\nYes\n", "expected_output": "Yes\n\n", "anno_code": ["A, B, C = map(int, input().split()) # (0): A=16, B=2, C=4\nq = int(input()) # (1): q=9\n\nk = 0 # (2): k=0\n\nfor i in range(q+1): # (3): i=0 (55): i=1 ... (300): NO CHANGE\n for j in range(0, q-i+1): # (4): j=0 (9): j=1 ... (299): NO CHANGE\n print(i, j) # (5): NO CHANGE (10): NO CHANGE ... (295): NO CHANGE\n B_ = B * (2 ** i) # (6): B_=2 (11): NO CHANGE ... (296): B_=1024\n C_ = C * (2 ** j) # (7): C_=4 (12): C_=8 ... (297): C_=4\n if A < B_ and B_ < C_ and A < C_: # (8): NO CHANGE (13): NO CHANGE ... (298): NO CHANGE\n k = 1 # (207): k=1 (213): NO CHANGE\nif k != 0: # (301): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " A, B, C = map(int, input().split())\n q = int(input())\n \n k = 0\n \n for i in range(q+1):\n for j in range(0, q-i+1):\n- print(i, j)\n B_ = B * (2 ** i)\n C_ = C * (2 ** j)\n if A < B_ and B_ < C_ and A < C_:\n k = 1\n if k != 0:\n print('Yes')\n else:\n print('No')\n", "FL_content": "\n A, B, C = map(int, input().split())\n q = int(input())\n \n k = 0\n \n for i in range(q+1):\n for j in range(0, q-i+1):\n- print(i, j)\n B_ = B * (2 ** i)\n C_ = C * (2 ** j)\n if A < B_ and B_ < C_ and A < C_:\n k = 1\n if k != 0:\n print('Yes')\n else:\n print('No')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u054514819", "problem_id": "p02537", "submission1_id": "s162336590-FL", "submission2_id": "s177084850", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ndef input(): return sys.stdin.readline().strip()\ndef mapint(): return map(int, input().split())\nsys.setrecursionlimit(10**9)\n\nN, K = mapint()\n\ndef segfunc(x, y):\n return max(x, y)\n\nide_ele = 0\n\nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n\n def update(self, k, x):\n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n\n def query(self, l, r):\n res = self.ide_ele\n\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\nsize = 10**5*3+10\nseg = SegTree([0]*size, segfunc, ide_ele)\nfor _ in range(N):\n a = int(input())\n maxi = seg.query(max(0, a-K-1), min(size, a+K))\n seg.update(a-1, maxi+1)\nprint(seg.query(0, size))", "code2": "import sys\ndef input(): return sys.stdin.readline().strip()\ndef mapint(): return map(int, input().split())\nsys.setrecursionlimit(10**9)\n\nN, K = mapint()\n\ndef segfunc(x, y):\n return max(x, y)\n\nide_ele = 0\n\nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n\n def update(self, k, x):\n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n\n def query(self, l, r):\n res = self.ide_ele\n\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\nsize = 10**5*3+10\nseg = SegTree([0]*size, segfunc, ide_ele)\nfor _ in range(N):\n a = int(input())\n maxi = seg.query(max(0, a-K), min(size, a+K+1))\n seg.update(a, maxi+1)\nprint(seg.query(0, size))", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601171615", "date2": "1601172047", "bleu_score": "0.994527005022855", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 81, "total_score": 101, "input": "10 4\n0\n1\n4\n3\n3\n12\n9\n7\n4\n4\n", "actual_output": "7\n", "expected_output": "8\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import sys\n def input(): return sys.stdin.readline().strip()\n def mapint(): return map(int, input().split())\n sys.setrecursionlimit(10**9)\n \n N, K = mapint()\n \n def segfunc(x, y):\n return max(x, y)\n \n ide_ele = 0\n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n size = 10**5*3+10\n seg = SegTree([0]*size, segfunc, ide_ele)\n for _ in range(N):\n a = int(input())\n- maxi = seg.query(max(0, a-K-1), min(size, a+K))\n- seg.update(a-1, maxi+1)\n+ maxi = seg.query(max(0, a-K), min(size, a+K+1))\n+ seg.update(a, maxi+1)\n print(seg.query(0, size))\n", "FL_content": "\n import sys\n def input(): return sys.stdin.readline().strip()\n def mapint(): return map(int, input().split())\n sys.setrecursionlimit(10**9)\n \n N, K = mapint()\n \n def segfunc(x, y):\n return max(x, y)\n \n ide_ele = 0\n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n size = 10**5*3+10\n seg = SegTree([0]*size, segfunc, ide_ele)\n for _ in range(N):\n a = int(input())\n maxi = seg.query(max(0, a-K-1), min(size, a+K))\n seg.update(a-1, maxi+1)\n print(seg.query(0, size))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 54 }, { "user_id": "u742013327", "problem_id": "p02276", "submission1_id": "s652250665-FL", "submission2_id": "s732194928", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\ndef partition(target_list):\n x = target_list[-1]\n i = -1\n\n for j in range(len(target_list))[:-1]:\n if target_list[j] <= x:\n i = i+1\n tmp = target_list[i]\n target_list[i] = target_list[j]\n target_list[j] = tmp\n tmp = target_list[-1]\n target_list[-1] = target_list[i + 1]\n target_list[i + 1] = tmp\n \n return i + 1\n\ndef convert(l):\n return \" \".join([str(n) for n in l])\n\nif __name__ == \"__main__\":\n n_list = int(input())\n target_list = [int(n) for n in input().split()]\n\n center_index = partition(target_list)\n print(convert(target_list[:center_index]) + \" [\"+ str(target_list[center_index]) + \"] \" + convert(target_list[center_index:]))", "code2": "\n\n\ndef partition(target_list):\n x = target_list[-1]\n i = -1\n\n for j in range(len(target_list))[:-1]:\n if target_list[j] <= x:\n i = i+1\n tmp = target_list[i]\n target_list[i] = target_list[j]\n target_list[j] = tmp\n tmp = target_list[-1]\n target_list[-1] = target_list[i + 1]\n target_list[i + 1] = tmp\n \n return i + 1\n\ndef convert(l):\n return \" \".join([str(n) for n in l])\n\nif __name__ == \"__main__\":\n n_list = int(input())\n target_list = [int(n) for n in input().split()]\n\n center_index = partition(target_list)\n print(convert(target_list[:center_index]) + \" [\"+ str(target_list[center_index]) + \"] \" + convert(target_list[center_index + 1:]))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1478601274", "date2": "1478601341", "bleu_score": "0.9924673522795004", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "12\n23 19 9 9 23 8 10 4 13 -1 10 22\n", "actual_output": "19 9 9 8 10 4 13 -1 10 [22] 22 23 23\n", "expected_output": "19 9 9 8 10 4 13 -1 10 [22] 23 23\n\n", "anno_code": ["\n\n\ndef partition(target_list): # (0): partition=\n x = target_list[-1]\n i = -1\n\n for j in range(len(target_list))[:-1]:\n if target_list[j] <= x:\n i = i+1\n tmp = target_list[i]\n target_list[i] = target_list[j]\n target_list[j] = tmp\n tmp = target_list[-1]\n target_list[-1] = target_list[i + 1]\n target_list[i + 1] = tmp\n \n return i + 1\n\ndef convert(l): # (1): convert=\n return \" \".join([str(n) for n in l])\n\nif __name__ == \"__main__\":\n n_list = int(input())\n target_list = [int(n) for n in input().split()]\n\n center_index = partition(target_list)\n print(convert(target_list[:center_index]) + \" [\"+ str(target_list[center_index]) + \"] \" + convert(target_list[center_index:]))"], "anno_status": [true], "diff_content": " \n \n \n def partition(target_list):\n x = target_list[-1]\n i = -1\n \n for j in range(len(target_list))[:-1]:\n if target_list[j] <= x:\n i = i+1\n tmp = target_list[i]\n target_list[i] = target_list[j]\n target_list[j] = tmp\n tmp = target_list[-1]\n target_list[-1] = target_list[i + 1]\n target_list[i + 1] = tmp\n \n return i + 1\n \n def convert(l):\n return \" \".join([str(n) for n in l])\n \n if __name__ == \"__main__\":\n n_list = int(input())\n target_list = [int(n) for n in input().split()]\n \n center_index = partition(target_list)\n- print(convert(target_list[:center_index]) + \" [\"+ str(target_list[center_index]) + \"] \" + convert(target_list[center_index:]))\n+ print(convert(target_list[:center_index]) + \" [\"+ str(target_list[center_index]) + \"] \" + convert(target_list[center_index + 1:]))\n", "FL_content": "\n \n \n \n def partition(target_list):\n x = target_list[-1]\n i = -1\n \n- for j in range(len(target_list))[:-1]:\n if target_list[j] <= x:\n i = i+1\n tmp = target_list[i]\n target_list[i] = target_list[j]\n target_list[j] = tmp\n tmp = target_list[-1]\n target_list[-1] = target_list[i + 1]\n target_list[i + 1] = tmp\n \n return i + 1\n \n def convert(l):\n return \" \".join([str(n) for n in l])\n \n if __name__ == \"__main__\":\n n_list = int(input())\n target_list = [int(n) for n in input().split()]\n \n center_index = partition(target_list)\n print(convert(target_list[:center_index]) + \" [\"+ str(target_list[center_index]) + \"] \" + convert(target_list[center_index:]))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 28 }, { "user_id": "u382692819", "problem_id": "p02396", "submission1_id": "s657333910-FL", "submission2_id": "s081656829", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\ni=1\nwhile True:\n print(\"case {0}: {1}\".format(i,s))\n i += 1\n s = input()\n if s==\"0\":\n break", "code2": "a = []\ni = 0\nwhile True:\n n = input()\n if n == \"0\":\n break\n a.append(n)\n i += 1\n print(\"Case {0}: {1}\".format(i,n))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1491289598", "date2": "1491293221", "bleu_score": "0.7136087717356181", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3\n3\n2\n14\n2\n28\n0\n", "actual_output": "case 1: 3\ncase 2: 3\ncase 3: 2\ncase 4: 14\ncase 5: 2\ncase 6: 28\n", "expected_output": "Case 1: 3\nCase 2: 3\nCase 3: 2\nCase 4: 14\nCase 5: 2\nCase 6: 28\n\n", "anno_code": ["s = input() # (0): s=3\ni=1 # (1): i=1\nwhile True: # (2): NO CHANGE (7): NO CHANGE ... (27): NO CHANGE\n print(\"case {0}: {1}\".format(i,s)) # (3): NO CHANGE (8): NO CHANGE ... (28): NO CHANGE\n i += 1 # (4): i=2 (9): i=3 ... (29): i=7\n s = input() # (5): NO CHANGE (10): s=2 ... (30): s=0\n if s==\"0\": # (6): NO CHANGE (11): NO CHANGE ... (31): NO CHANGE\n break"], "anno_status": [true], "diff_content": "-s = input()\n-i=1\n+a = []\n+i = 0\n while True:\n- print(\"case {0}: {1}\".format(i,s))\n- i += 1\n- s = input()\n- if s==\"0\":\n+ n = input()\n+ if n == \"0\":\n break\n+ a.append(n)\n+ i += 1\n+ print(\"Case {0}: {1}\".format(i,n))\n", "FL_content": "\n s = input()\n i=1\n while True:\n- print(\"case {0}: {1}\".format(i,s))\n i += 1\n s = input()\n if s==\"0\":\n break\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u588081069", "problem_id": "p03712", "submission1_id": "s493113139-FL", "submission2_id": "s563528329", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, W = list(map(int, input().split()))\n\nfor i in range(H + 2):\n if i == 0 or i == (H + 1):\n print(\"*\" * (W + 2))\n else:\n print(\"*{}*\".format(\"\".join(list(map(str, input())))))\n", "code2": "H, W = list(map(int, input().split()))\n\nfor i in range(H + 2):\n if i == 0 or i == (H + 1):\n print(\"\n else:\n print(\"\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553887428", "date2": "1553887460", "bleu_score": "0.6324192823925385", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "-5 10\nw\n", "actual_output": "no output\n", "expected_output": "############\n############\n\n", "anno_code": ["H, W = list(map(int, input().split())) # (0): H=-5, W=10\n\nfor i in range(H + 2):\n if i == 0 or i == (H + 1):\n print(\"*\" * (W + 2))\n else:\n print(\"*{}*\".format(\"\".join(list(map(str, input())))))\n"], "anno_status": [true], "diff_content": " H, W = list(map(int, input().split()))\n \n for i in range(H + 2):\n if i == 0 or i == (H + 1):\n- print(\"*\" * (W + 2))\n+ print(\"\n else:\n- print(\"*{}*\".format(\"\".join(list(map(str, input())))))\n+ print(\"\n \n", "FL_content": "\n H, W = list(map(int, input().split()))\n \n for i in range(H + 2):\n if i == 0 or i == (H + 1):\n print(\"*\" * (W + 2))\n else:\n- print(\"*{}*\".format(\"\".join(list(map(str, input())))))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u283452598", "problem_id": "p02419", "submission1_id": "s770809499-FL", "submission2_id": "s826818615", "status1": "Wrong Answer", "status2": "Accepted", "code1": "y = input().lower()\ncnt = 0\ns=\"\"\nwhile True:\n x = input().lower()\n if x == \"end_of_text\":\n break\n s += x\n for i in x:\n if i == y:\n cnt += 1\nprint(cnt)", "code2": "W = input()\nnum = 0\nwhile True:\n line = input()\n if line == 'END_OF_TEXT':\n break\n for word in line.split():\n if word.lower() == W.lower():\n num += 1\nprint(num)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1503198218", "date2": "1503198738", "bleu_score": "0.643724456431627", "code1_test_status": [0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0], "code1_test_score": 79, "total_score": 101, "input": "computer\nNurtures computer scientists dna highly-skilled comqutes engineers\nwho will create and exqloit \"knowledge\" for the enw era.\nProvides an outstanding computer environment.\nEND_OF_TEXT\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["y = input().lower() # (0): y=computer\ncnt = 0 # (1): cnt=0\ns=\"\" # (2): s=\nwhile True: # (3): NO CHANGE (140): NO CHANGE ... (352): NO CHANGE\n x = input().lower() # (4): x=nurtures computer scientists dna highly-skilled comqutes engineers (141): x=who will create and exqloit \"knowledge\" for the enw era. ... (353): x=end_of_text\n if x == \"end_of_text\": # (5): NO CHANGE (142): NO CHANGE ... (354): NO CHANGE\n break # (355): NO CHANGE\n s += x # (6): s=nurtures computer scientists dna highly-skilled comqutes engineers (143): s=nurtures computer scientists dna highly-skilled comqutes engineerswho will create and exqloit \"knowledge\" for the enw era. (260): s=nurtures computer scientists dna highly-skilled comqutes engineerswho will create and exqloit \"knowledge\" for the enw era.provides an outstanding computer environment.\n for i in x: # (7): i=n (9): i=u ... (351): NO CHANGE\n if i == y: # (8): NO CHANGE (10): NO CHANGE ... (350): NO CHANGE\n cnt += 1\nprint(cnt)"], "anno_status": [true], "diff_content": "-y = input().lower()\n-cnt = 0\n-s=\"\"\n+W = input()\n+num = 0\n while True:\n- x = input().lower()\n- if x == \"end_of_text\":\n+ line = input()\n+ if line == 'END_OF_TEXT':\n break\n- s += x\n- for i in x:\n- if i == y:\n- cnt += 1\n-print(cnt)\n+ for word in line.split():\n+ if word.lower() == W.lower():\n+ num += 1\n+print(num)\n", "FL_content": "\n y = input().lower()\n cnt = 0\n s=\"\"\n while True:\n x = input().lower()\n if x == \"end_of_text\":\n break\n s += x\n- for i in x:\n- if i == y:\n- cnt += 1\n print(cnt)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u791664126", "problem_id": "p03377", "submission1_id": "s510826158-FL", "submission2_id": "s023155850", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=map(int,input().split())\nprint('YNEOS'[bc::2])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1540179227", "date2": "1540180036", "bleu_score": "0.8588553141228454", "code1_test_status": [1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0], "code1_test_score": 63, "total_score": 87, "input": "3 0 2\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["a,b,c=map(int,input().split()) # (0): a=3, b=0, c=2\nprint('YNEOS'[bc::2])\n", "FL_content": "\n a,b,c=map(int,input().split())\n-print('YNEOS'[b= x >= a else \"No\")", "code2": "a,b,x = map(int,input().split())\nprint(\"YES\" if (a+b >= x >= a) else \"NO\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580330599", "date2": "1580330713", "bleu_score": "0.8371896614457404", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 87, "input": "-5 -1 8\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["a,b,x = map(int,input().split()) # (0): a=-5, b=-1, x=8\nprint(\"Yes\" if a+b >= x >= a else \"No\")"], "anno_status": [true], "diff_content": " a,b,x = map(int,input().split())\n-print(\"Yes\" if a+b >= x >= a else \"No\")\n+print(\"YES\" if (a+b >= x >= a) else \"NO\")\n+\n", "FL_content": "\n a,b,x = map(int,input().split())\n-print(\"Yes\" if a+b >= x >= a else \"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 2 }, { "user_id": "u875291233", "problem_id": "p03856", "submission1_id": "s486448055-FL", "submission2_id": "s184292901", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\nread = sys.stdin.read\nreadline = sys.stdin.readline\n\n\n\n\ns = [*input()]\na = [*\"dream\"]\nb = [*\"dreamer\"]\nc = [*\"erase\"]\nd = [*\"eraser\"]\n\n\nwhile True:\n if not s:\n print(\"Yes\")\n break\n elif s[-5:] == a:\n for _ in range(5): s.pop()\n elif s[-5:] == c:\n for _ in range(5): s.pop()\n elif s[-6:] == b:\n for _ in range(6): s.pop()\n elif s[-6:] == d:\n for _ in range(6): s.pop()\n else:\n print(\"No\")\n break\n\n\n\n\n\n", "code2": "\n\nimport sys\nread = sys.stdin.read\nreadline = sys.stdin.readline\n\n\n\n\ns = [*input()]\na = [*\"dream\"]\nb = [*\"dreamer\"]\nc = [*\"erase\"]\nd = [*\"eraser\"]\n\nwhile True:\n if not s:\n print(\"YES\")\n break\n elif s[-5:] == a:\n for _ in range(5): s.pop()\n elif s[-5:] == c:\n for _ in range(5): s.pop()\n elif s[-7:] == b:\n for _ in range(7): s.pop()\n elif s[-6:] == d:\n for _ in range(6): s.pop()\n else:\n print(\"NO\")\n break\n\n\n\n\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593290500", "date2": "1593290797", "bleu_score": "0.972638483673835", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "Yes\n", "expected_output": "YES\n", "anno_code": ["\n\nimport sys\nread = sys.stdin.read # (0): read=\nreadline = sys.stdin.readline # (1): readline=\n\n\n\n\ns = [*input()] # (2): s=['e', 'r', 'a', 's', 'e', 'd', 'r', 'e', 'a', 'm']\na = [*\"dream\"] # (3): a=['d', 'r', 'e', 'a', 'm']\nb = [*\"dreamer\"] # (4): b=['d', 'r', 'e', 'a', 'm', 'e', 'r']\nc = [*\"erase\"] # (5): c=['e', 'r', 'a', 's', 'e']\nd = [*\"eraser\"] # (6): d=['e', 'r', 'a', 's', 'e', 'r']\n\n\nwhile True: # (7): NO CHANGE (16): NO CHANGE (26): NO CHANGE\n if not s: # (8): NO CHANGE (17): NO CHANGE (27): NO CHANGE\n print(\"Yes\") # (28): NO CHANGE\n break\n elif s[-5:] == a: # (9): NO CHANGE (18): NO CHANGE\n for _ in range(5): s.pop() # (10): s=['e', 'r', 'a', 's', 'e', 'd', 'r', 'e', 'a'], _=0 (11): s=['e', 'r', 'a', 's', 'e', 'd', 'r', 'e'], _=1 ... (15): NO CHANGE\n elif s[-5:] == c: # (19): NO CHANGE\n for _ in range(5): s.pop() # (20): s=['e', 'r', 'a', 's'], _=0 (21): s=['e', 'r', 'a'], _=1 ... (25): NO CHANGE\n elif s[-6:] == b:\n for _ in range(6): s.pop()\n elif s[-6:] == d:\n for _ in range(6): s.pop()\n else:\n print(\"No\")\n break\n\n\n\n\n\n"], "anno_status": [true], "diff_content": " \n \n import sys\n read = sys.stdin.read\n readline = sys.stdin.readline\n \n \n \n \n s = [*input()]\n a = [*\"dream\"]\n b = [*\"dreamer\"]\n c = [*\"erase\"]\n d = [*\"eraser\"]\n \n-\n while True:\n if not s:\n- print(\"Yes\")\n+ print(\"YES\")\n break\n elif s[-5:] == a:\n for _ in range(5): s.pop()\n elif s[-5:] == c:\n for _ in range(5): s.pop()\n- elif s[-6:] == b:\n- for _ in range(6): s.pop()\n+ elif s[-7:] == b:\n+ for _ in range(7): s.pop()\n elif s[-6:] == d:\n for _ in range(6): s.pop()\n else:\n- print(\"No\")\n+ print(\"NO\")\n break\n \n \n \n \n \n-\n", "FL_content": "\n \n \n import sys\n read = sys.stdin.read\n readline = sys.stdin.readline\n \n \n \n \n s = [*input()]\n a = [*\"dream\"]\n b = [*\"dreamer\"]\n c = [*\"erase\"]\n d = [*\"eraser\"]\n \n \n while True:\n if not s:\n- print(\"Yes\")\n break\n elif s[-5:] == a:\n for _ in range(5): s.pop()\n elif s[-5:] == c:\n for _ in range(5): s.pop()\n elif s[-6:] == b:\n for _ in range(6): s.pop()\n elif s[-6:] == d:\n for _ in range(6): s.pop()\n else:\n- print(\"No\")\n break\n \n \n \n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 37 }, { "user_id": "u197615397", "problem_id": "p02368", "submission1_id": "s226103980-FL", "submission2_id": "s974543153", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def solve():\n N, M = map(int, input().split())\n edges = [[] for _ in [0]*N]\n r_edges = [[] for _ in [0]*N]\n\n for _ in [0]*M:\n a, b = map(int, input().split())\n edges[a].append(b)\n r_edges[b].append(a)\n c = get_strongly_connected_components(edges, r_edges)\n print(c)\n group = [0]*N\n for i in range(len(c)):\n for v in c[i]:\n group[v] = i\n\n result = []\n append = result.append\n for _ in [0]*int(input()):\n a, b = map(int, input().split())\n append(\"1\" if group[a] == group[b] else \"0\")\n\n print(\"\\n\".join(result))\n\n\ndef get_strongly_connected_components(edges, r_edges):\n import sys\n sys.setrecursionlimit(10**7)\n v_count = len(edges)\n order = [0]*v_count\n k = 1\n\n def get_order(v):\n order[v] = 1\n nonlocal k\n for dest in edges[v]:\n if order[dest] == 0:\n get_order(dest)\n order[v] = k\n k += 1\n\n def get_components(v):\n order[v] = 0\n return [v] + [_v for dest in r_edges[v] if order[dest] > 0 for _v in get_components(dest)]\n\n [None for v in range(v_count) if order[v] == 0 and get_order(v)]\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n\nif __name__ == \"__main__\":\n solve()", "code2": "def solve():\n N, M = map(int, input().split())\n edges = [[] for _ in [0]*N]\n r_edges = [[] for _ in [0]*N]\n\n for _ in [0]*M:\n a, b = map(int, input().split())\n edges[a].append(b)\n r_edges[b].append(a)\n \n c = get_strongly_connected_components(edges, r_edges)\n group = [0]*N\n for i in range(len(c)):\n for v in c[i]:\n group[v] = i\n\n result = []\n append = result.append\n for _ in [0]*int(input()):\n a, b = map(int, input().split())\n append(\"1\" if group[a] == group[b] else \"0\")\n\n print(\"\\n\".join(result))\n\n\ndef get_strongly_connected_components(edges, r_edges):\n import sys\n sys.setrecursionlimit(10**7)\n v_count = len(edges)\n order = [0]*v_count\n k = 1\n\n def get_order(v):\n order[v] = 1\n nonlocal k\n for dest in edges[v]:\n if order[dest] == 0:\n get_order(dest)\n order[v] = k\n k += 1\n\n def get_components(v):\n order[v] = 0\n return [v] + [_v for dest in r_edges[v] if order[dest] > 0 for _v in get_components(dest)]\n\n [None for v in range(v_count) if order[v] == 0 and get_order(v)]\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n\nif __name__ == \"__main__\":\n solve()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1508056066", "date2": "1508056098", "bleu_score": "0.992852260239688", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "8 6\n0 1\n2 0\n1 2\n3 4\n4 1\n3 2\n4\n0 1\n0 3\n2 3\n3 4\n", "actual_output": "[[7], [6], [5], [3], [4], [0, 2, 1]]\n1\n0\n0\n0\n", "expected_output": "1\n0\n0\n0\n\n", "anno_code": ["def solve(): # (0): solve=\n N, M = map(int, input().split())\n edges = [[] for _ in [0]*N]\n r_edges = [[] for _ in [0]*N]\n\n for _ in [0]*M:\n a, b = map(int, input().split())\n edges[a].append(b)\n r_edges[b].append(a)\n c = get_strongly_connected_components(edges, r_edges)\n print(c)\n group = [0]*N\n for i in range(len(c)):\n for v in c[i]:\n group[v] = i\n\n result = []\n append = result.append\n for _ in [0]*int(input()):\n a, b = map(int, input().split())\n append(\"1\" if group[a] == group[b] else \"0\")\n\n print(\"\\n\".join(result))\n\n\ndef get_strongly_connected_components(edges, r_edges): # (1): get_strongly_connected_components=\n import sys\n sys.setrecursionlimit(10**7)\n v_count = len(edges)\n order = [0]*v_count\n k = 1\n\n def get_order(v):\n order[v] = 1\n nonlocal k\n for dest in edges[v]:\n if order[dest] == 0:\n get_order(dest)\n order[v] = k\n k += 1\n\n def get_components(v):\n order[v] = 0\n return [v] + [_v for dest in r_edges[v] if order[dest] > 0 for _v in get_components(dest)]\n\n [None for v in range(v_count) if order[v] == 0 and get_order(v)]\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n\nif __name__ == \"__main__\":\n solve()"], "anno_status": [false], "diff_content": " def solve():\n N, M = map(int, input().split())\n edges = [[] for _ in [0]*N]\n r_edges = [[] for _ in [0]*N]\n \n for _ in [0]*M:\n a, b = map(int, input().split())\n edges[a].append(b)\n r_edges[b].append(a)\n+ \n c = get_strongly_connected_components(edges, r_edges)\n- print(c)\n group = [0]*N\n for i in range(len(c)):\n for v in c[i]:\n group[v] = i\n \n result = []\n append = result.append\n for _ in [0]*int(input()):\n a, b = map(int, input().split())\n append(\"1\" if group[a] == group[b] else \"0\")\n \n print(\"\\n\".join(result))\n \n \n def get_strongly_connected_components(edges, r_edges):\n import sys\n sys.setrecursionlimit(10**7)\n v_count = len(edges)\n order = [0]*v_count\n k = 1\n \n def get_order(v):\n order[v] = 1\n nonlocal k\n for dest in edges[v]:\n if order[dest] == 0:\n get_order(dest)\n order[v] = k\n k += 1\n \n def get_components(v):\n order[v] = 0\n return [v] + [_v for dest in r_edges[v] if order[dest] > 0 for _v in get_components(dest)]\n \n [None for v in range(v_count) if order[v] == 0 and get_order(v)]\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n \n if __name__ == \"__main__\":\n solve()\n", "FL_content": "\n def solve():\n N, M = map(int, input().split())\n edges = [[] for _ in [0]*N]\n r_edges = [[] for _ in [0]*N]\n \n for _ in [0]*M:\n a, b = map(int, input().split())\n edges[a].append(b)\n r_edges[b].append(a)\n c = get_strongly_connected_components(edges, r_edges)\n- print(c)\n group = [0]*N\n for i in range(len(c)):\n for v in c[i]:\n group[v] = i\n \n result = []\n append = result.append\n for _ in [0]*int(input()):\n a, b = map(int, input().split())\n append(\"1\" if group[a] == group[b] else \"0\")\n \n print(\"\\n\".join(result))\n \n \n def get_strongly_connected_components(edges, r_edges):\n import sys\n sys.setrecursionlimit(10**7)\n v_count = len(edges)\n order = [0]*v_count\n k = 1\n \n def get_order(v):\n order[v] = 1\n nonlocal k\n for dest in edges[v]:\n if order[dest] == 0:\n get_order(dest)\n order[v] = k\n k += 1\n \n def get_components(v):\n order[v] = 0\n return [v] + [_v for dest in r_edges[v] if order[dest] > 0 for _v in get_components(dest)]\n \n [None for v in range(v_count) if order[v] == 0 and get_order(v)]\n return [get_components(v) for v, _ in sorted(enumerate(order), key=lambda x: x[1], reverse=True) if order[v] > 0]\n \n if __name__ == \"__main__\":\n solve()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 50 }, { "user_id": "u046776181", "problem_id": "p02958", "submission1_id": "s211714160-FL", "submission2_id": "s352034039", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nP = list(map(int, input().split()))\ncount = sum([index + 1 == num for index, num in enumerate(P)])\nif count <= 2:\n print(\"YES\")\nelse:\n print(\"NO\")", "code2": "N = int(input())\nP = list(map(int, input().split()))\ncount = sum([index + 1 != num for index, num in enumerate(P)])\nif count <= 2:\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564758339", "date2": "1564758486", "bleu_score": "0.9580666538479065", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "5\n0 8 0 1 4\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["N = int(input()) # (0): N=5\nP = list(map(int, input().split())) # (1): P=[0, 8, 0, 1, 4]\ncount = sum([index + 1 == num for index, num in enumerate(P)]) # (2): count=0\nif count <= 2: # (3): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")"], "anno_status": [true], "diff_content": " N = int(input())\n P = list(map(int, input().split()))\n-count = sum([index + 1 == num for index, num in enumerate(P)])\n+count = sum([index + 1 != num for index, num in enumerate(P)])\n if count <= 2:\n- print(\"YES\")\n+ print(\"YES\")\n else:\n- print(\"NO\")\n+ print(\"NO\")\n", "FL_content": "\n N = int(input())\n P = list(map(int, input().split()))\n-count = sum([index + 1 == num for index, num in enumerate(P)])\n-if count <= 2:\n print(\"YES\")\n else:\n print(\"NO\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u539517139", "problem_id": "p03380", "submission1_id": "s246908732-FL", "submission2_id": "s772815837", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=list(map(int,input().split()))\nm=max(a)\nh=m/2\nd=abs(a[0]-h)\nx=0\nfor i in range(1,n):\n if abs(a[i]-h)\n n = len(s)\n max_val = 0\n for i in range(1, n):\n s1 = set(list(s[0:i]))\n s2 = set(list(s[i:]))\n val = len(s1 ^ s2)\n max_val = max(max_val, val)\n return max_val\n\ndef main(): # (1): main=\n n = int(input())\n s = input()\n print(solve(s))\n\nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " import sys\n import math\n import bisect\n \n def solve(s):\n n = len(s)\n max_val = 0\n for i in range(1, n):\n s1 = set(list(s[0:i]))\n s2 = set(list(s[i:]))\n- val = len(s1 ^ s2)\n+ val = len(s1 & s2)\n max_val = max(max_val, val)\n return max_val\n \n def main():\n n = int(input())\n s = input()\n print(solve(s))\n \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": "\n import sys\n import math\n import bisect\n \n def solve(s):\n n = len(s)\n max_val = 0\n for i in range(1, n):\n- s1 = set(list(s[0:i]))\n- s2 = set(list(s[i:]))\n- val = len(s1 ^ s2)\n max_val = max(max_val, val)\n return max_val\n \n def main():\n n = int(input())\n s = input()\n print(solve(s))\n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u626266743", "problem_id": "p02234", "submission1_id": "s853445864-FL", "submission2_id": "s473375567", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nINF = 10**9\nP = [list(map(int, input().split())) for i in range(n)]\nm = [[0]*n for i in range(n)]\n\nfor l in range(2, n + 1):\n for i in range(n - l + 1):\n j = i + l - 1\n m[i][j] = INF\n for k in range(i, j):\n m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + P[i - 1][0] * P[k][1] * P[j][1])\n\nprint(m[0][n - 1])", "code2": "n = int(input())\nINF = 10**9\nP = [list(map(int, input().split())) for i in range(n)]\nm = [[0]*n for i in range(n)]\n\nfor l in range(2, n + 1):\n for i in range(n - l + 1):\n j = i + l - 1\n m[i][j] = INF\n for k in range(i, j):\n m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + P[i][0] * P[k][1] * P[j][1])\n\nprint(m[0][n - 1])", "original_language1": "Python3", "original_language2": "Python3", "date1": "1511273285", "date2": "1511273353", "bleu_score": "0.9845416298122788", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "6\n0 1\n18 0\n18 0\n3 3\n1 8\n4 7\n", "actual_output": "28\n", "expected_output": "0\n\n", "anno_code": ["n = int(input()) # (0): n=6\nINF = 10**9 # (1): INF=1000000000\nP = [list(map(int, input().split())) for i in range(n)] # (2): P\nm = [[0]*n for i in range(n)] # (3): m\n\nfor l in range(2, n + 1): # (4): l=2 (36): l=3 ... (144): NO CHANGE\n for i in range(n - l + 1): # (5): i=0 (11): i=1 ... (143): NO CHANGE\n j = i + l - 1 # (6): j=1 (12): j=2 ... (130): NO CHANGE\n m[i][j] = INF # (7): m (13): m ... (131): m\n for k in range(i, j): # (8): k=0 (10): NO CHANGE ... (142): NO CHANGE\n m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + P[i - 1][0] * P[k][1] * P[j][1]) # (9): m (15): m ... (141): NO CHANGE\n\nprint(m[0][n - 1])"], "anno_status": [true], "diff_content": " n = int(input())\n INF = 10**9\n P = [list(map(int, input().split())) for i in range(n)]\n m = [[0]*n for i in range(n)]\n \n for l in range(2, n + 1):\n for i in range(n - l + 1):\n j = i + l - 1\n m[i][j] = INF\n for k in range(i, j):\n- m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + P[i - 1][0] * P[k][1] * P[j][1])\n+ m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + P[i][0] * P[k][1] * P[j][1])\n \n print(m[0][n - 1])\n", "FL_content": "\n n = int(input())\n INF = 10**9\n-P = [list(map(int, input().split())) for i in range(n)]\n m = [[0]*n for i in range(n)]\n \n for l in range(2, n + 1):\n for i in range(n - l + 1):\n j = i + l - 1\n m[i][j] = INF\n for k in range(i, j):\n- m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + P[i - 1][0] * P[k][1] * P[j][1])\n \n print(m[0][n - 1])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u507116804", "problem_id": "p03643", "submission1_id": "s882501966-FL", "submission2_id": "s699641004", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\n\nprint(\"ABC\"+\"n\")", "code2": "n=input()\n\nprint(\"ABC\"+n)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1557103394", "date2": "1557103494", "bleu_score": "0.6695492145338402", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "542\n", "actual_output": "ABCn\n", "expected_output": "ABC542\n\n", "anno_code": ["n=int(input()) # (0): n=542\n\nprint(\"ABC\"+\"n\")"], "anno_status": [true], "diff_content": "-n=int(input())\n+n=input()\n \n-print(\"ABC\"+\"n\")\n+print(\"ABC\"+n)\n", "FL_content": "\n n=int(input())\n \n-print(\"ABC\"+\"n\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 3 }, { "user_id": "u842689614", "problem_id": "p03944", "submission1_id": "s653507400-FL", "submission2_id": "s694192926", "status1": "Wrong Answer", "status2": "Accepted", "code1": "W,H,N=map(int,input().split())\nxya=[list(map(int,input().split())) for i in range(N)]\n\nboundary=[0,0,W,H]\n\nfor i in range(N):\n a=xya[i][2]\n if a==1:\n boundary[0]=xya[i][0]\n elif a==2:\n boundary[2]=xya[i][0]\n elif a==3:\n boundary[1]=xya[i][1]\n else:\n boundary[3]=xya[i][1]\n\nprint(max(0,(boundary[2]-boundary[0])*(boundary[3]-boundary[1])))", "code2": "W,H,N=map(int,input().split())\nxya=[list(map(int,input().split())) for i in range(N)]\n\nboundary=[0,0,W,H]\n\nfor i in range(N):\n a=xya[i][2]\n if a==1:\n if boundary[0]xya[i][0]:\n boundary[2]=xya[i][0]\n elif a==3:\n if boundary[1]xya[i][1]:\n boundary[3]=xya[i][1]\n if boundary[0]>=boundary[2] or boundary[1]>=boundary[3]:\n break\n\nprint(max(0,(boundary[2]-boundary[0])*(boundary[3]-boundary[1])))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566695680", "date2": "1566696211", "bleu_score": "0.6407729252399404", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 96, "total_score": 103, "input": "5 4 3\n2 1 2\n6 11 2\n1 2 3\n", "actual_output": "12\n", "expected_output": "4\n\n", "anno_code": ["W,H,N=map(int,input().split()) # (0): W=5, H=4, N=3\nxya=[list(map(int,input().split())) for i in range(N)] # (1): xya\n\nboundary=[0,0,W,H] # (2): boundary=[0, 0, 5, 4]\n\nfor i in range(N): # (3): i=0 (8): i=1 ... (19): NO CHANGE\n a=xya[i][2] # (4): a=2 (9): NO CHANGE (14): a=3\n if a==1: # (5): NO CHANGE (10): NO CHANGE (15): NO CHANGE\n boundary[0]=xya[i][0]\n elif a==2: # (6): NO CHANGE (11): NO CHANGE (16): NO CHANGE\n boundary[2]=xya[i][0] # (7): boundary=[0, 0, 2, 4] (12): boundary=[0, 0, 6, 4]\n elif a==3: # (17): NO CHANGE\n boundary[1]=xya[i][1] # (18): boundary=[0, 2, 6, 4]\n else:\n boundary[3]=xya[i][1]\n\nprint(max(0,(boundary[2]-boundary[0])*(boundary[3]-boundary[1])))"], "anno_status": [true], "diff_content": " W,H,N=map(int,input().split())\n xya=[list(map(int,input().split())) for i in range(N)]\n \n boundary=[0,0,W,H]\n \n for i in range(N):\n a=xya[i][2]\n if a==1:\n- boundary[0]=xya[i][0]\n+ if boundary[0]xya[i][0]:\n+ boundary[2]=xya[i][0]\n elif a==3:\n- boundary[1]=xya[i][1]\n+ if boundary[1]xya[i][1]:\n+ boundary[3]=xya[i][1]\n+ if boundary[0]>=boundary[2] or boundary[1]>=boundary[3]:\n+ break\n \n print(max(0,(boundary[2]-boundary[0])*(boundary[3]-boundary[1])))\n", "FL_content": "\n W,H,N=map(int,input().split())\n xya=[list(map(int,input().split())) for i in range(N)]\n \n boundary=[0,0,W,H]\n \n for i in range(N):\n a=xya[i][2]\n if a==1:\n boundary[0]=xya[i][0]\n elif a==2:\n boundary[2]=xya[i][0]\n elif a==3:\n boundary[1]=xya[i][1]\n else:\n boundary[3]=xya[i][1]\n \n-print(max(0,(boundary[2]-boundary[0])*(boundary[3]-boundary[1])))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u398846051", "problem_id": "p03003", "submission1_id": "s381185930-FL", "submission2_id": "s002546735", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\ns = list(map(int, input().split()))\nt = list(map(int, input().split()))\ndp = [[0] * (m+2) for _ in range(n+2)]\ndp[0][0] = 1\nfor i in range(1, n+1):\n for j in range(1, m+1):\n dp[i][j] = dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]\n if s[i-1] == t[j-1]:\n dp[i][j] += 1 + dp[i-1][j-1]\nprint(dp[n][m])\n", "code2": "n, m = map(int, input().split())\ns = list(map(int, input().split()))\nt = list(map(int, input().split()))\ndp = [[0] * (m+2) for _ in range(n+2)]\nmod = 1000000007\n\nfor i in range(n+1):\n dp[i][0] = 1\nfor i in range(m+1):\n dp[0][i] = 1\n\nfor i in range(1, n+1):\n for j in range(1, m+1):\n dp[i][j] = (dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]) % mod\n if s[i-1] == t[j-1]:\n dp[i][j] += dp[i-1][j-1]\n dp[i][j] %= mod\nprint(dp[n][m])\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1560766440", "date2": "1560766940", "bleu_score": "0.7404844821517166", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 105, "input": "10 9\n9 6 5 12 5 9 8 5 6 7\n8 2 14 7 5 7 9 9 2\n", "actual_output": "7\n", "expected_output": "23\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=10, m=9\ns = list(map(int, input().split())) # (1): s=[9, 6, 5, 12, 5, 9, 8, 5, 6, 7]\nt = list(map(int, input().split())) # (2): t=[8, 2, 14, 7, 5, 7, 9, 9, 2]\ndp = [[0] * (m+2) for _ in range(n+2)] # (3): dp\ndp[0][0] = 1 # (4): dp\nfor i in range(1, n+1): # (5): i=1 (36): i=2 ... (305): NO CHANGE\n for j in range(1, m+1): # (6): j=1 (9): j=2 ... (304): NO CHANGE\n dp[i][j] = dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1] # (7): dp (10): dp ... (302): dp\n if s[i-1] == t[j-1]: # (8): NO CHANGE (11): NO CHANGE ... (303): NO CHANGE\n dp[i][j] += 1 + dp[i-1][j-1] # (27): dp (31): dp ... (294): dp\nprint(dp[n][m])\n"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n s = list(map(int, input().split()))\n t = list(map(int, input().split()))\n dp = [[0] * (m+2) for _ in range(n+2)]\n-dp[0][0] = 1\n+mod = 1000000007\n+\n+for i in range(n+1):\n+ dp[i][0] = 1\n+for i in range(m+1):\n+ dp[0][i] = 1\n+\n for i in range(1, n+1):\n for j in range(1, m+1):\n- dp[i][j] = dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]\n+ dp[i][j] = (dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]) % mod\n if s[i-1] == t[j-1]:\n- dp[i][j] += 1 + dp[i-1][j-1]\n+ dp[i][j] += dp[i-1][j-1]\n+ dp[i][j] %= mod\n print(dp[n][m])\n \n", "FL_content": "\n n, m = map(int, input().split())\n s = list(map(int, input().split()))\n t = list(map(int, input().split()))\n-dp = [[0] * (m+2) for _ in range(n+2)]\n-dp[0][0] = 1\n for i in range(1, n+1):\n for j in range(1, m+1):\n- dp[i][j] = dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]\n- if s[i-1] == t[j-1]:\n- dp[i][j] += 1 + dp[i-1][j-1]\n-print(dp[n][m])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u370793182", "problem_id": "p03207", "submission1_id": "s240998566-FL", "submission2_id": "s636268842", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\np = []\nmax = 0\nfor i in range(N):\n p.append(int(input()))\n if(p[i]>max):\n maxi = i\nsum = 0\nfor i in range(N):\n if(i == maxi):\n sum += p[i]/2\n else:\n sum += p[i]\nprint(sum)", "code2": "N = int(input())\np = []\nmax = 0\nfor i in range(N):\n p.append(int(input()))\np.sort()\nsum = 0\nfor i in range(N-1):\n sum += p[i]\nsum += p[N-1]/2\nprint(int(sum))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1544322627", "date2": "1544322999", "bleu_score": "0.65634533413981", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "3\n0\n7984\n100\n", "actual_output": "8034.0\n", "expected_output": "4092\n\n", "anno_code": ["N = int(input()) # (0): N=3\np = [] # (1): p=[]\nmax = 0 # (2): max=0\nfor i in range(N): # (3): i=0 (6): i=1 ... (14): NO CHANGE\n p.append(int(input())) # (4): p=[0] (7): p=[0, 7984] (11): p=[0, 7984, 100]\n if(p[i]>max): # (5): NO CHANGE (8): NO CHANGE (12): NO CHANGE\n maxi = i # (9): maxi=1 (13): maxi=2\nsum = 0 # (15): sum=0\nfor i in range(N): # (16): i=0 (19): i=1 ... (25): NO CHANGE\n if(i == maxi): # (17): NO CHANGE (20): NO CHANGE (23): NO CHANGE\n sum += p[i]/2 # (24): sum=8034.0\n else:\n sum += p[i] # (18): NO CHANGE (21): sum=7984\nprint(sum)"], "anno_status": [true], "diff_content": " N = int(input())\n p = []\n max = 0\n for i in range(N):\n p.append(int(input()))\n- if(p[i]>max):\n- maxi = i\n+p.sort()\n sum = 0\n-for i in range(N):\n- if(i == maxi):\n- sum += p[i]/2\n- else:\n- sum += p[i]\n-print(sum)\n+for i in range(N-1):\n+ sum += p[i]\n+sum += p[N-1]/2\n+print(int(sum))\n+\n", "FL_content": "\n N = int(input())\n p = []\n max = 0\n for i in range(N):\n p.append(int(input()))\n if(p[i]>max):\n maxi = i\n sum = 0\n for i in range(N):\n if(i == maxi):\n sum += p[i]/2\n else:\n sum += p[i]\n-print(sum)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u768496010", "problem_id": "p02921", "submission1_id": "s669973086-FL", "submission2_id": "s457175230", "status1": "Wrong Answer", "status2": "Accepted", "code1": "predict = input('predict')\n\nactual = input('actual')\n\ncount = 0\n\nfor index in range(0, len(predict)):\n if predict[index] == actual[index]:\n count += 1\n \nprint (count)", "code2": "predict = input()\n\nactual = input()\n\ncount = 0\n\nfor index in range(0, len(predict)):\n if predict[index] == actual[index]:\n count += 1\n\nprint (count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567364780", "date2": "1567365204", "bleu_score": "0.8287713708838921", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "RTT\nSUS\n", "actual_output": "predictactual0\n", "expected_output": "0\n\n", "anno_code": ["predict = input('predict') # (0): predict=RTT\n\nactual = input('actual') # (1): actual=SUS\n\ncount = 0 # (2): count=0\n\nfor index in range(0, len(predict)): # (3): index=0 (5): index=1 ... (9): NO CHANGE\n if predict[index] == actual[index]: # (4): NO CHANGE (6): NO CHANGE (8): NO CHANGE\n count += 1\n \nprint (count)"], "anno_status": [true], "diff_content": "-predict = input('predict')\n+predict = input()\n \n-actual = input('actual')\n+actual = input()\n \n count = 0\n \n for index in range(0, len(predict)):\n if predict[index] == actual[index]:\n count += 1\n- \n+\n print (count)\n", "FL_content": "\n-predict = input('predict')\n-\n-actual = input('actual')\n-\n count = 0\n \n for index in range(0, len(predict)):\n if predict[index] == actual[index]:\n count += 1\n \n print (count)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u158628538", "problem_id": "p03207", "submission1_id": "s218362490-FL", "submission2_id": "s007176161", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nm=0\ns=0\nfor i in range(n):\n p=int(input())\n s+=p\n m=max(m,p)\nprint(s-(m/2))", "code2": "n=int(input())\nm=0\ns=0\nfor i in range(n):\n p=int(input())\n s+=p\n m=max(m,p)\nprint(int(s-(m/2)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583029332", "date2": "1583029373", "bleu_score": "0.95121355843059", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "3\n1\n4428\n55\n", "actual_output": "2270.0\n", "expected_output": "2270\n\n", "anno_code": ["n=int(input()) # (0): n=3\nm=0 # (1): m=0\ns=0 # (2): s=0\nfor i in range(n): # (3): i=0 (7): i=1 ... (15): NO CHANGE\n p=int(input()) # (4): p=1 (8): p=4428 (12): p=55\n s+=p # (5): s=1 (9): s=4429 (13): s=4484\n m=max(m,p) # (6): m=1 (10): m=4428 (14): NO CHANGE\nprint(s-(m/2))"], "anno_status": [true], "diff_content": " n=int(input())\n m=0\n s=0\n for i in range(n):\n p=int(input())\n s+=p\n m=max(m,p)\n-print(s-(m/2))\n+print(int(s-(m/2)))\n", "FL_content": "\n n=int(input())\n m=0\n s=0\n for i in range(n):\n p=int(input())\n s+=p\n m=max(m,p)\n-print(s-(m/2))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u325282913", "problem_id": "p02536", "submission1_id": "s572488360-FL", "submission2_id": "s842874791", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nclass UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n def size(self, x):\n return -self.parents[self.find(x)]\n def same(self, x, y):\n return self.find(x) == self.find(y)\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n def group_count(self):\n return len(self.roots())\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n\n\nN, M = map(int, input().split())\nuf = UnionFind(N)\nans = 0\nfor i in range(M):\n A, B = map(int, input().split())\n if not uf.same(A-1,B-1):\n ans += 1\n else:\n uf.union(A-1,B-1)\nprint(ans)", "code2": "class UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n def size(self, x):\n return -self.parents[self.find(x)]\n def same(self, x, y):\n return self.find(x) == self.find(y)\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n def group_count(self):\n return len(self.roots())\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n\n\nN, M = map(int, input().split())\nuf = UnionFind(N)\nans = 0\nfor i in range(M):\n A, B = map(int, input().split())\n uf.union(A-1,B-1)\nprint(uf.group_count()-1)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601168806", "date2": "1601168911", "bleu_score": "0.9541932878845013", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 90, "input": "27 1\n1 1\n", "actual_output": "0\n", "expected_output": "26\n\n", "anno_code": ["\nclass UnionFind(): # (0): UnionFind=\n def __init__(self, n):\n self.n = n # (3): NO CHANGE\n self.parents = [-1] * n # (4): UnionFind=, N=27, M=1, uf=0: [0] 1: [1] 2: [2] 3: [3] 4: [4] 5: [5] 6: [6] 7: [7] 8: [8] 9: [9] 10: [10] 11: [11] 12: [12] 13: [13] 14: [14] 15: [15] 16: [16] 17: [17] 18: [18] 19: [19] 20: [20] 21: [21] 22: [22] 23: [23] 24: [24] 25: [25] 26: [26]\n def find(self, x):\n if self.parents[x] < 0: # (9): NO CHANGE (10): UnionFind=, N=27, M=1, uf=0: [0] 1: [1] 2: [2] 3: [3] 4: [4] 5: [5] 6: [6] 7: [7] 8: [8] 9: [9] 10: [10] 11: [11] 12: [12] 13: [13] 14: [14] 15: [15] 16: [16] 17: [17] 18: [18] 19: [19] 20: [20] 21: [21] 22: [22] 23: [23] 24: [24] 25: [25] 26: [26], ans=0, i=0, A=1, B=1 ... (15): y=0\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n def union(self, x, y):\n x = self.find(x) # (12): NO CHANGE\n y = self.find(y) # (14): NO CHANGE\n if x == y: # (16): NO CHANGE\n return # (17): UnionFind=, N=27, M=1, uf=0: [0] 1: [1] 2: [2] 3: [3] 4: [4] 5: [5] 6: [6] 7: [7] 8: [8] 9: [9] 10: [10] 11: [11] 12: [12] 13: [13] 14: [14] 15: [15] 16: [16] 17: [17] 18: [18] 19: [19] 20: [20] 21: [21] 22: [22] 23: [23] 24: [24] 25: [25] 26: [26], ans=0, i=0, A=1, B=1\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n def size(self, x):\n return -self.parents[self.find(x)]\n def same(self, x, y):\n return self.find(x) == self.find(y)\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n def group_count(self):\n return len(self.roots())\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n\n\nN, M = map(int, input().split()) # (1): N=27, M=1\nuf = UnionFind(N) # (2): self=0: [0] 1: [1] 2: [2] 3: [3] 4: [4] 5: [5] 6: [6] 7: [7] 8: [8] 9: [9] 10: [10] 11: [11] 12: [12] 13: [13] 14: [14] 15: [15] 16: [16] 17: [17] 18: [18] 19: [19] 20: [20] 21: [21] 22: [22] 23: [23] 24: [24] 25: [25] 26: [26], n=27\nans = 0 # (5): ans=0\nfor i in range(M): # (6): i=0 (18): NO CHANGE\n A, B = map(int, input().split()) # (7): A=1, B=1\n if not uf.same(A-1,B-1): # (8): self=0: [0] 1: [1] 2: [2] 3: [3] 4: [4] 5: [5] 6: [6] 7: [7] 8: [8] 9: [9] 10: [10] 11: [11] 12: [12] 13: [13] 14: [14] 15: [15] 16: [16] 17: [17] 18: [18] 19: [19] 20: [20] 21: [21] 22: [22] 23: [23] 24: [24] 25: [25] 26: [26], x=0\n ans += 1\n else:\n uf.union(A-1,B-1) # (11): self=0: [0] 1: [1] 2: [2] 3: [3] 4: [4] 5: [5] 6: [6] 7: [7] 8: [8] 9: [9] 10: [10] 11: [11] 12: [12] 13: [13] 14: [14] 15: [15] 16: [16] 17: [17] 18: [18] 19: [19] 20: [20] 21: [21] 22: [22] 23: [23] 24: [24] 25: [25] 26: [26], x=0, y=0\nprint(ans)"], "anno_status": [false], "diff_content": "-\n class UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n def size(self, x):\n return -self.parents[self.find(x)]\n def same(self, x, y):\n return self.find(x) == self.find(y)\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n def group_count(self):\n return len(self.roots())\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n \n \n N, M = map(int, input().split())\n uf = UnionFind(N)\n ans = 0\n for i in range(M):\n A, B = map(int, input().split())\n- if not uf.same(A-1,B-1):\n- ans += 1\n- else:\n- uf.union(A-1,B-1)\n-print(ans)\n+ uf.union(A-1,B-1)\n+print(uf.group_count()-1)\n", "FL_content": "\n \n class UnionFind():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n if x == y:\n return\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n self.parents[x] += self.parents[y]\n self.parents[y] = x\n def size(self, x):\n return -self.parents[self.find(x)]\n def same(self, x, y):\n return self.find(x) == self.find(y)\n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n def group_count(self):\n return len(self.roots())\n def all_group_members(self):\n return {r: self.members(r) for r in self.roots()}\n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n \n \n N, M = map(int, input().split())\n uf = UnionFind(N)\n ans = 0\n for i in range(M):\n A, B = map(int, input().split())\n if not uf.same(A-1,B-1):\n ans += 1\n else:\n uf.union(A-1,B-1)\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 47 }, { "user_id": "u022407960", "problem_id": "p02300", "submission1_id": "s651634080-FL", "submission2_id": "s230011031", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.reverse()\n lower.sort(key=attrgetter('imag', 'real'))\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "code2": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.reverse()\n \n lower_min = min(lower, key=attrgetter('imag', 'real'))\n \n min_index = lower.index(lower_min)\n lower_right = lower[min_index:]\n lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n lower_right.append(upper[k])\n return lower_right + lower_left\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1480733027", "date2": "1480734264", "bleu_score": "0.9089852826425715", "code1_test_status": [0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1], "code1_test_score": 56, "total_score": 102, "input": "7\n4 1\n0 -1\n1 2\n2 -2\n4 2\n0 3\n2 3\n", "actual_output": "6\n2 -2\n0 -1\n4 1\n4 2\n2 3\n0 3\n", "expected_output": "6\n2 -2\n4 1\n4 2\n2 3\n0 3\n0 -1\n\n", "anno_code": ["\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9 # (0): EPS=1e-09\n\n\ndef cross(a, b): # (1): cross=\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b): # (2): dot=\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2): # (3): check_ccw=\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon): # (4): convex_check_Andrew=\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.reverse()\n lower.sort(key=attrgetter('imag', 'real'))\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))"], "anno_status": [false], "diff_content": " \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n \n lower.reverse()\n- lower.sort(key=attrgetter('imag', 'real'))\n+ \n+ lower_min = min(lower, key=attrgetter('imag', 'real'))\n+ \n+ min_index = lower.index(lower_min)\n+ lower_right = lower[min_index:]\n+ lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n- lower.append(upper[k])\n- return lower\n+ lower_right.append(upper[k])\n+ return lower_right + lower_left\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "FL_content": "\n \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n- elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n \n lower.reverse()\n lower.sort(key=attrgetter('imag', 'real'))\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n return lower\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 78 }, { "user_id": "u223133214", "problem_id": "p03139", "submission1_id": "s315690902-FL", "submission2_id": "s821139381", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n_k = list(map(int, input().split()))\nn,a,b = n_k[0],n_k[1],n_k[2]\nmax,min = 0,0\nif n > a+b:\n min=0\n if a a+b:\n min=0\n if a a+b: # (3): NO CHANGE\n min=0\n if a a+b:\n min=0\n if a a+b:\n min=0\n if a= end:\n start = N / 2 + 1\n end = N - m + 1\n print(start, end)\n", "code2": "N, M = map(int, input().split())\n\nif N % 2 == 1:\n for m in range(1, M + 1):\n print(m, N - m + 1)\n\ncount = 1\nif N % 2 == 0:\n for m in range(1, M + 1):\n\n if m <= (N \n start = m\n end = N \n print(start, end)\n else:\n start = N \n end = N - count + 1\n print(start, end)\n count += 1\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1589688203", "date2": "1589689010", "bleu_score": "0.636206903619659", "code1_test_status": [0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 6, "input": "12 5\n", "actual_output": "1 5.0\n2 4.0\n7.0 10\n7.0 9\n7.0 8\n", "expected_output": "1 6\n2 5\n3 4\n7 11\n8 10\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=12, M=5\n\nfor m in range(1, M + 1): # (1): m=1 (7): m=2 ... (29): m=5\n if N % 2 is 1: # (2): NO CHANGE (8): NO CHANGE ... (30): NO CHANGE\n print(m, N - m + 1)\n else:\n start = m # (3): start=1 (9): start=2 ... (31): start=5\n end = N / 2 - m # (4): end=5.0 (10): end=4.0 ... (32): end=1.0\n if start >= end: # (5): NO CHANGE (11): NO CHANGE ... (33): NO CHANGE\n start = N / 2 + 1 # (18): start=7.0 (26): start=7.0 (34): start=7.0\n end = N - m + 1 # (19): end=10 (27): end=9 (35): end=8\n print(start, end) # (6): NO CHANGE (12): NO CHANGE ... (36): NO CHANGE\n"], "anno_status": [true], "diff_content": " N, M = map(int, input().split())\n \n-for m in range(1, M + 1):\n- if N % 2 is 1:\n+if N % 2 == 1:\n+ for m in range(1, M + 1):\n print(m, N - m + 1)\n- else:\n- start = m\n- end = N / 2 - m\n- if start >= end:\n- start = N / 2 + 1\n- end = N - m + 1\n- print(start, end)\n+\n+count = 1\n+if N % 2 == 0:\n+ for m in range(1, M + 1):\n+\n+ if m <= (N \n+ start = m\n+ end = N \n+ print(start, end)\n+ else:\n+ start = N \n+ end = N - count + 1\n+ print(start, end)\n+ count += 1\n \n", "FL_content": "\n N, M = map(int, input().split())\n \n for m in range(1, M + 1):\n- if N % 2 is 1:\n print(m, N - m + 1)\n else:\n start = m\n- end = N / 2 - m\n if start >= end:\n start = N / 2 + 1\n end = N - m + 1\n print(start, end)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u554503378", "problem_id": "p02276", "submission1_id": "s829896433-FL", "submission2_id": "s860096142", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nlst_n = list(map(int,input().split()))\nx = lst_n[n-1]\nleft = []\nright = []\ni = -1\nfor j in range(0,n-1):\n if lst_n[j] <= x:\n i += 1\n lst_n[i],lst_n[j] = lst_n[j],lst_n[i]\ni += 1\nlst_n[i],lst_n[n-1] = lst_n[n-1],lst_n[i]\n\nans = ['['+str(k)+']' if k == x else str(k) for k in lst_n]\nprint(' '.join(ans))\n", "code2": "n = int(input())\nlst_n = list(map(int,input().split()))\nx = lst_n[n-1]\nleft = []\nright = []\ni = -1\nfor j in range(0,n-1):\n if lst_n[j] <= x:\n i += 1\n lst_n[i],lst_n[j] = lst_n[j],lst_n[i]\ni += 1\nlst_n[i],lst_n[n-1] = lst_n[n-1],lst_n[i]\n\nans = ['['+str(lst_n[k])+']' if k == i else str(lst_n[k])\n for k in range(len(lst_n))]\nprint(' '.join(ans))\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1546085334", "date2": "1546085463", "bleu_score": "0.878644509273134", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 100, "total_score": 101, "input": "12\n40 19 9 1 12 8 8 6 21 0 10 1\n", "actual_output": "[1] 0 [1] 40 12 8 8 6 21 19 10 9\n", "expected_output": "1 0 [1] 40 12 8 8 6 21 19 10 9\n\n", "anno_code": ["n = int(input()) # (0): n=12\nlst_n = list(map(int,input().split())) # (1): lst_n=[40, 19, 9, 1, 12, 8, 8, 6, 21, 0, 10, 1]\nx = lst_n[n-1] # (2): x=1\nleft = [] # (3): left=[]\nright = [] # (4): right=[]\ni = -1 # (5): i=-1\nfor j in range(0,n-1): # (6): j=0 (8): j=1 ... (32): NO CHANGE\n if lst_n[j] <= x: # (7): NO CHANGE (9): NO CHANGE ... (31): NO CHANGE\n i += 1 # (14): i=0 (28): i=1\n lst_n[i],lst_n[j] = lst_n[j],lst_n[i] # (15): lst_n=[1, 19, 9, 40, 12, 8, 8, 6, 21, 0, 10, 1] (29): lst_n=[1, 0, 9, 40, 12, 8, 8, 6, 21, 19, 10, 1]\ni += 1 # (33): i=2\nlst_n[i],lst_n[n-1] = lst_n[n-1],lst_n[i] # (34): lst_n=[1, 0, 1, 40, 12, 8, 8, 6, 21, 19, 10, 9]\n\nans = ['['+str(k)+']' if k == x else str(k) for k in lst_n] # (35): ans=['[1]', '0', '[1]', '40', '12', '8', '8', '6', '21', '19', '10', '9']\nprint(' '.join(ans))\n"], "anno_status": [true], "diff_content": " n = int(input())\n lst_n = list(map(int,input().split()))\n x = lst_n[n-1]\n left = []\n right = []\n i = -1\n for j in range(0,n-1):\n if lst_n[j] <= x:\n i += 1\n lst_n[i],lst_n[j] = lst_n[j],lst_n[i]\n i += 1\n lst_n[i],lst_n[n-1] = lst_n[n-1],lst_n[i]\n \n-ans = ['['+str(k)+']' if k == x else str(k) for k in lst_n]\n+ans = ['['+str(lst_n[k])+']' if k == i else str(lst_n[k])\n+ for k in range(len(lst_n))]\n print(' '.join(ans))\n \n", "FL_content": "\n n = int(input())\n lst_n = list(map(int,input().split()))\n-x = lst_n[n-1]\n-left = []\n-right = []\n-i = -1\n-for j in range(0,n-1):\n- if lst_n[j] <= x:\n- i += 1\n- lst_n[i],lst_n[j] = lst_n[j],lst_n[i]\n-i += 1\n-lst_n[i],lst_n[n-1] = lst_n[n-1],lst_n[i]\n \n-ans = ['['+str(k)+']' if k == x else str(k) for k in lst_n]\n-print(' '.join(ans))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u752898745", "problem_id": "p03719", "submission1_id": "s533451107-FL", "submission2_id": "s081433628", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=input().split()\nprint(\"Yes\" if c>=a and c<=b else \"No\")", "code2": "a,b,c=map(int,input().split())\nprint(\"Yes\" if a<=c and c<=b else \"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587218835", "date2": "1587219055", "bleu_score": "0.7628435877352012", "code1_test_status": [1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0], "code1_test_score": 15, "total_score": 21, "input": "-1 2 -2\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["a,b,c=input().split() # (0): a=-1, b=2, c=-2\nprint(\"Yes\" if c>=a and c<=b else \"No\")"], "anno_status": [true], "diff_content": "-a,b,c=input().split()\n-print(\"Yes\" if c>=a and c<=b else \"No\")\n+a,b,c=map(int,input().split())\n+print(\"Yes\" if a<=c and c<=b else \"No\")\n", "FL_content": "\n a,b,c=input().split()\n-print(\"Yes\" if c>=a and c<=b else \"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 2 }, { "user_id": "u567380442", "problem_id": "p02368", "submission1_id": "s194468131-FL", "submission2_id": "s885336644", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\ndef search(g, v):\n visited = set()\n lowest = [None] * v\n parent = [None] * v\n prenum = [None] * v\n child = defaultdict(list)\n\n for i in range(v):\n if i in visited:\n continue\n root = i\n\n \n stack = [(root, None)]\n while stack:\n u, prev = stack.pop()\n if u not in visited:\n parent[u] = prev\n if prev is not None:\n child[prev].append(u)\n visited |= {u}\n prenum[u] = lowest[u] = len(visited)\n\n stack.extend([(v, u) for v in g[u][::-1] if v not in visited]) \n\n \n from collections import Counter\n leaf = [i for i in range(v) if not child[i]]\n unfinished = Counter()\n for li in leaf:\n while li is not None:\n \n candidate = [prenum[li]] + [prenum[i] for i in g[li]] + [lowest[i] for i in child[li]] \n lowest[li] = min(candidate)\n li = parent[li]\n if li is not None and 1 < len(child[li]):\n unfinished[li] += 1\n if unfinished[li] < len(child[li]):\n break\n return prenum, lowest\n\nfrom sys import stdin\nreadline = stdin.readline\n\n\ndef main():\n v, e = map(int, readline().split())\n from collections import defaultdict\n g = defaultdict(list)\n\n for _ in range(e):\n s, t = map(int, readline().split())\n g[s].append(t)\n \n prenum, lowest = search(g, v)\n q = int(readline())\n for u, v in [map(int, readline().split()) for _ in range(q)]:\n print(1 if lowest[u] == lowest[v] else 0)\nmain()", "code2": "from collections import UserList\nclass Stack(UserList):\n def __init__(self):\n UserList.__init__(self)\n self.contains = set()\n def __contains__(self, x):\n return x in self.contains\n def __and__(self, x):\n return self.contains & x\n def push(self, x):\n if x in self.contains:\n return\n self.data.append(x)\n self.contains |= {x}\n def pop(self):\n x = self.data.pop()\n self.contains -= {x}\n return x\n\ndef search(g, g_dash,v):\n \n visited = set()\n postorder = []\n for root in range(v):\n if root in visited:\n continue\n route = Stack()\n route.push(None)\n dfs_stack = [(root, None)] \n while dfs_stack:\n u, prev = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n dfs_stack.extend((v, u) for v in g[u] - visited)\n while route[-1] != prev:\n postorder.append(route.pop())\n route.push(u)\n while route[-1] is not None:\n postorder.append(route.pop())\n\n \n visited.clear()\n lowest = [None] * v\n for root in postorder[::-1]:\n if root in visited:\n continue\n dfs_stack = [root]\n while dfs_stack:\n u = dfs_stack.pop()\n if u in visited:\n continue\n visited |= {u}\n lowest[u] = root\n dfs_stack.extend(g_dash[u] - visited)\n return lowest\n\nfrom sys import stdin\nfrom collections import defaultdict\nreadline = stdin.readline\n\ndef main():\n v, e = map(int, readline().split())\n g = defaultdict(set)\n g_dash = defaultdict(set)\n\n for _ in range(e):\n s, t = map(int, readline().split())\n g[s] |= {t} \n g_dash[t] |= {s} \n \n lowest = search(g,g_dash, v)\n q = int(readline())\n for u, v in [map(int, readline().split()) for _ in range(q)]:\n print(1 if lowest[u] == lowest[v] else 0)\nmain()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1428196638", "date2": "1428218620", "bleu_score": "0.6236655118321015", "code1_test_status": [1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 69, "total_score": 101, "input": "7 6\n0 1\n2 1\n1 2\n3 4\n4 3\n3 2\n4\n1 1\n0 5\n0 0\n3 4\n", "actual_output": "1\n0\n1\n0\n", "expected_output": "1\n0\n1\n1\n\n", "anno_code": ["from collections import defaultdict\ndef search(g, v): # (0): search=, stdin=<_io.TextIOWrapper name='../../test/autoComment2\\\\Dev\\\\p02368\\\\input_s194468131.txt' mode='r' encoding='utf-8'>\n visited = set() # (26): visited=set()\n lowest = [None] * v # (27): lowest=[None, None, None, None, None, None, None]\n parent = [None] * v # (28): parent=[None, None, None, None, None, None, None]\n prenum = [None] * v # (29): prenum=[None, None, None, None, None, None, None]\n child = defaultdict(list) # (30): child=defaultdict(, {})\n\n for i in range(v): # (31): i=0 (62): i=1 ... (119): Counter=\n if i in visited: # (32): NO CHANGE (63): NO CHANGE ... (107): NO CHANGE\n continue # (64): NO CHANGE (67): NO CHANGE (92): NO CHANGE\n root = i # (33): root=0 (70): root=3 ... (108): root=6\n\n \n stack = [(root, None)] # (34): stack=[(0, None)] (71): stack=[(3, None)] ... (109): stack=[(6, None)]\n while stack: # (35): NO CHANGE (43): NO CHANGE ... (118): NO CHANGE\n u, prev = stack.pop() # (36): stack=[], prev=None, u=0 (44): stack=[], prev=0, u=1 ... (111): stack=[], u=6\n if u not in visited: # (37): NO CHANGE (45): NO CHANGE ... (112): NO CHANGE\n parent[u] = prev # (38): NO CHANGE (46): parent=[None, 0, None, None, None, None, None] ... (113): NO CHANGE\n if prev is not None: # (39): NO CHANGE (47): NO CHANGE ... (114): NO CHANGE\n child[prev].append(u) # (48): child=defaultdict(, {0: [1]}) (57): child=defaultdict(, {0: [1], 1: [2]}) (85): child=defaultdict(, {0: [1], 1: [2], 3: [4]})\n visited |= {u} # (40): visited={0} (49): visited={0, 1} ... (115): visited={0, 1, 2, 3, 4, 5, 6}\n prenum[u] = lowest[u] = len(visited) # (41): lowest=[1, None, None, None, None, None, None], prenum=[1, None, None, None, None, None, None] (50): lowest=[1, 2, None, None, None, None, None], prenum=[1, 2, None, None, None, None, None] ... (116): lowest=[1, 2, 3, 4, 5, 6, 7], prenum=[1, 2, 3, 4, 5, 6, 7]\n\n stack.extend([(v, u) for v in g[u][::-1] if v not in visited]) # (42): stack=[(1, 0)] (51): stack=[(2, 1)] ... (117): g=defaultdict(, {0: [1], 2: [1], 1: [2], 3: [4, 2], 4: [3], 5: [], 6: []})\n\n \n from collections import Counter\n leaf = [i for i in range(v) if not child[i]] # (120): child=defaultdict(, {0: [1], 1: [2], 3: [4], 2: [], 4: [], 5: [], 6: []}), leaf=[2, 4, 5, 6]\n unfinished = Counter() # (121): unfinished=Counter()\n for li in leaf: # (122): li=2 (139): li=4 ... (165): e=6, defaultdict=, _=5, s=3, t=2\n while li is not None: # (123): NO CHANGE (128): NO CHANGE ... (164): NO CHANGE\n \n candidate = [prenum[li]] + [prenum[i] for i in g[li]] + [lowest[i] for i in child[li]] # (124): candidate=[3, 2] (129): candidate=[2, 3, 2] ... (160): candidate=[7]\n lowest[li] = min(candidate) # (125): lowest=[1, 2, 2, 4, 5, 6, 7] (130): NO CHANGE ... (161): NO CHANGE\n li = parent[li] # (126): li=1 (131): li=0 ... (162): li=None\n if li is not None and 1 < len(child[li]): # (127): NO CHANGE (132): NO CHANGE ... (163): NO CHANGE\n unfinished[li] += 1\n if unfinished[li] < len(child[li]):\n break\n return prenum, lowest\n\nfrom sys import stdin\nreadline = stdin.readline # (1): readline=\n\n\ndef main(): # (2): main=\n v, e = map(int, readline().split()) # (4): v=7, e=6, defaultdict=\n from collections import defaultdict\n g = defaultdict(list) # (5): g=defaultdict(, {})\n\n for _ in range(e): # (6): _=0 (9): _=1 ... (24): NO CHANGE\n s, t = map(int, readline().split()) # (7): s=0, t=1 (10): s=2 ... (22): s=3, t=2\n g[s].append(t) # (8): g=defaultdict(, {0: [1]}) (11): g=defaultdict(, {0: [1], 2: [1]}) ... (23): g=defaultdict(, {0: [1], 2: [1], 1: [2], 3: [4, 2], 4: [3]})\n \n prenum, lowest = search(g, v) # (25): NO CHANGE\n q = int(readline()) # (166): q=4\n for u, v in [map(int, readline().split()) for _ in range(q)]: # (167): v=1, u=1 (169): v=5, u=0 ... (173): v=4, u=3\n print(1 if lowest[u] == lowest[v] else 0) # (168): NO CHANGE (170): NO CHANGE ... (174): NO CHANGE\nmain() # (3): NO CHANGE\n"], "anno_status": [false], "diff_content": "-from collections import defaultdict\n-def search(g, v):\n- visited = set()\n- lowest = [None] * v\n- parent = [None] * v\n- prenum = [None] * v\n- child = defaultdict(list)\n+from collections import UserList\n+class Stack(UserList):\n+ def __init__(self):\n+ UserList.__init__(self)\n+ self.contains = set()\n+ def __contains__(self, x):\n+ return x in self.contains\n+ def __and__(self, x):\n+ return self.contains & x\n+ def push(self, x):\n+ if x in self.contains:\n+ return\n+ self.data.append(x)\n+ self.contains |= {x}\n+ def pop(self):\n+ x = self.data.pop()\n+ self.contains -= {x}\n+ return x\n \n- for i in range(v):\n- if i in visited:\n+def search(g, g_dash,v):\n+ \n+ visited = set()\n+ postorder = []\n+ for root in range(v):\n+ if root in visited:\n continue\n- root = i\n-\n- \n- stack = [(root, None)]\n- while stack:\n- u, prev = stack.pop()\n- if u not in visited:\n- parent[u] = prev\n- if prev is not None:\n- child[prev].append(u)\n- visited |= {u}\n- prenum[u] = lowest[u] = len(visited)\n-\n- stack.extend([(v, u) for v in g[u][::-1] if v not in visited]) \n+ route = Stack()\n+ route.push(None)\n+ dfs_stack = [(root, None)] \n+ while dfs_stack:\n+ u, prev = dfs_stack.pop()\n+ if u in visited:\n+ continue\n+ visited |= {u}\n+ dfs_stack.extend((v, u) for v in g[u] - visited)\n+ while route[-1] != prev:\n+ postorder.append(route.pop())\n+ route.push(u)\n+ while route[-1] is not None:\n+ postorder.append(route.pop())\n \n \n- from collections import Counter\n- leaf = [i for i in range(v) if not child[i]]\n- unfinished = Counter()\n- for li in leaf:\n- while li is not None:\n- \n- candidate = [prenum[li]] + [prenum[i] for i in g[li]] + [lowest[i] for i in child[li]] \n- lowest[li] = min(candidate)\n- li = parent[li]\n- if li is not None and 1 < len(child[li]):\n- unfinished[li] += 1\n- if unfinished[li] < len(child[li]):\n- break\n- return prenum, lowest\n+ visited.clear()\n+ lowest = [None] * v\n+ for root in postorder[::-1]:\n+ if root in visited:\n+ continue\n+ dfs_stack = [root]\n+ while dfs_stack:\n+ u = dfs_stack.pop()\n+ if u in visited:\n+ continue\n+ visited |= {u}\n+ lowest[u] = root\n+ dfs_stack.extend(g_dash[u] - visited)\n+ return lowest\n \n from sys import stdin\n+from collections import defaultdict\n readline = stdin.readline\n \n-\n def main():\n v, e = map(int, readline().split())\n- from collections import defaultdict\n- g = defaultdict(list)\n+ g = defaultdict(set)\n+ g_dash = defaultdict(set)\n \n for _ in range(e):\n s, t = map(int, readline().split())\n- g[s].append(t)\n+ g[s] |= {t} \n+ g_dash[t] |= {s} \n \n- prenum, lowest = search(g, v)\n+ lowest = search(g,g_dash, v)\n q = int(readline())\n for u, v in [map(int, readline().split()) for _ in range(q)]:\n print(1 if lowest[u] == lowest[v] else 0)\n main()\n", "FL_content": "\n from collections import defaultdict\n def search(g, v):\n visited = set()\n lowest = [None] * v\n parent = [None] * v\n prenum = [None] * v\n child = defaultdict(list)\n \n for i in range(v):\n if i in visited:\n continue\n root = i\n \n \n stack = [(root, None)]\n while stack:\n u, prev = stack.pop()\n if u not in visited:\n parent[u] = prev\n if prev is not None:\n child[prev].append(u)\n visited |= {u}\n prenum[u] = lowest[u] = len(visited)\n \n stack.extend([(v, u) for v in g[u][::-1] if v not in visited]) \n \n \n from collections import Counter\n leaf = [i for i in range(v) if not child[i]]\n unfinished = Counter()\n for li in leaf:\n while li is not None:\n \n candidate = [prenum[li]] + [prenum[i] for i in g[li]] + [lowest[i] for i in child[li]] \n lowest[li] = min(candidate)\n li = parent[li]\n if li is not None and 1 < len(child[li]):\n unfinished[li] += 1\n if unfinished[li] < len(child[li]):\n break\n- return prenum, lowest\n \n from sys import stdin\n readline = stdin.readline\n \n \n def main():\n v, e = map(int, readline().split())\n from collections import defaultdict\n g = defaultdict(list)\n \n for _ in range(e):\n s, t = map(int, readline().split())\n g[s].append(t)\n \n prenum, lowest = search(g, v)\n q = int(readline())\n for u, v in [map(int, readline().split()) for _ in range(q)]:\n print(1 if lowest[u] == lowest[v] else 0)\n main()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 60 }, { "user_id": "u498487134", "problem_id": "p03183", "submission1_id": "s481726690-FL", "submission2_id": "s109651631", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef I(): return int(input())\ndef MI(): return map(int, input().split())\ndef LI(): return list(map(int, input().split()))\n\ndef main():\n mod=10**9+7\n \n \n N=I()\n wsv=[]\n for i in range(N):\n w,s,v=MI()\n wsv.append([w,s,v])\n \n wsv.sort(key=lambda x:(x[0]+x[1]))\n \n N2=2*(10**4) +1\n dp=[[-1]*N2 for _ in range(N+1)]\n \n for i in range(N):\n w,s,v=wsv[i]\n for j in range(N2):\n dp[i+1][j]=max(dp[i][j],dp[i+1][j])\n if s>=j and j+w<=(10**4):\n dp[i+1][j+w]=max(dp[i+1][j+w],dp[i][j]+v)\n \n print(max(dp[-1]))\n \n \n\nmain()\n", "code2": "\ndef I(): return int(input())\ndef MI(): return map(int, input().split())\ndef LI(): return list(map(int, input().split()))\n\ndef main():\n mod=10**9+7\n \n \n N=I()\n wsv=[]\n for i in range(N):\n w,s,v=MI()\n wsv.append([w,s,v])\n \n wsv.sort(key=lambda x:(x[0]+x[1]))\n \n N2=2*(10**4) +1\n dp=[[0]*N2 for _ in range(N+1)]\n \n for i in range(N):\n w,s,v=wsv[i]\n for j in range(N2):\n dp[i+1][j]=max(dp[i][j],dp[i+1][j])\n if s>=j and j+w<=(N2-1):\n dp[i+1][j+w]=max(dp[i+1][j+w],dp[i][j]+v)\n \n print(max(dp[-1]))\n \n \n\nmain()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589510549", "date2": "1589510692", "bleu_score": "0.9861653580814093", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 104, "input": "4\n1 2 5\n3 3 7\n2 4 3\n2 8 2\n", "actual_output": "16\n", "expected_output": "17\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n def I(): return int(input())\n def MI(): return map(int, input().split())\n def LI(): return list(map(int, input().split()))\n \n def main():\n mod=10**9+7\n \n \n N=I()\n wsv=[]\n for i in range(N):\n w,s,v=MI()\n wsv.append([w,s,v])\n \n wsv.sort(key=lambda x:(x[0]+x[1]))\n \n N2=2*(10**4) +1\n- dp=[[-1]*N2 for _ in range(N+1)]\n+ dp=[[0]*N2 for _ in range(N+1)]\n \n for i in range(N):\n w,s,v=wsv[i]\n for j in range(N2):\n dp[i+1][j]=max(dp[i][j],dp[i+1][j])\n- if s>=j and j+w<=(10**4):\n+ if s>=j and j+w<=(N2-1):\n dp[i+1][j+w]=max(dp[i+1][j+w],dp[i][j]+v)\n \n print(max(dp[-1]))\n \n \n \n main()\n \n", "FL_content": "\n \n def I(): return int(input())\n def MI(): return map(int, input().split())\n def LI(): return list(map(int, input().split()))\n \n def main():\n mod=10**9+7\n \n \n N=I()\n wsv=[]\n for i in range(N):\n w,s,v=MI()\n wsv.append([w,s,v])\n \n wsv.sort(key=lambda x:(x[0]+x[1]))\n \n N2=2*(10**4) +1\n dp=[[-1]*N2 for _ in range(N+1)]\n \n for i in range(N):\n w,s,v=wsv[i]\n for j in range(N2):\n dp[i+1][j]=max(dp[i][j],dp[i+1][j])\n- if s>=j and j+w<=(10**4):\n dp[i+1][j+w]=max(dp[i+1][j+w],dp[i][j]+v)\n \n print(max(dp[-1]))\n \n \n \n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 33 }, { "user_id": "u567380442", "problem_id": "p00015", "submission1_id": "s386357163-FL", "submission2_id": "s559262615", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nf = sys.stdin\nn = int(f.readline())\nfor _ in range(n):\n a = f.readline().strip()\n b = f.readline().strip()\n c = int(a) + int(b)\n c = '{}'.format(c)\n print(c if len(c) else 'overflow')", "code2": "import sys\nf = sys.stdin\nn = int(f.readline())\nfor _ in range(n):\n a = f.readline().strip()\n b = f.readline().strip()\n c = int(a) + int(b)\n c = '{}'.format(c)\n print(c if len(c) <= 80 else 'overflow')", "original_language1": "Python3", "original_language2": "Python3", "date1": "1422615985", "date2": "1422616122", "bleu_score": "0.9683555094436175", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "6\n1101\n510\n11150581741799452420768643548247021706207\n8\n940241109576576259861480672250431087579815558778668516145336988025960960181876147\n-1\n30649081726584987569566544405667724154727609853023356866994194873421704913983049\n1\n101000000000100000000000000000000000000000000000000000000001000000000000000001000\n1\n100000000001000000000000000000000000000000000001000000000001000000000000000000000\n100000010000000000000000000000001000000001000100000000000000000000000000000010000\n", "actual_output": "1611\n11150581741799452420768643548247021706215\n940241109576576259861480672250431087579815558778668516145336988025960960181876146\n30649081726584987569566544405667724154727609853023356866994194873421704913983050\n101000000000100000000000000000000000000000000000000000000001000000000000000001001\n200000010001000000000000000000001000000001000101000000000001000000000000000010000\n", "expected_output": "1611\n11150581741799452420768643548247021706215\noverflow\n30649081726584987569566544405667724154727609853023356866994194873421704913983050\noverflow\noverflow\n\n", "anno_code": ["import sys\nf = sys.stdin # (0): f=<_io.TextIOWrapper name='../../test/autoComment2\\\\Dev\\\\p00015\\\\input_s386357163.txt' mode='r' encoding='utf-8'>\nn = int(f.readline()) # (1): n=6\nfor _ in range(n): # (2): _=0 (8): _=1 ... (32): _=5\n a = f.readline().strip() # (3): a=1101 (9): a=11150581741799452420768643548247021706207 ... (33): a=100000000001000000000000000000000000000000000001000000000001000000000000000000000\n b = f.readline().strip() # (4): b=510 (10): b=8 ... (34): b=100000010000000000000000000000001000000001000100000000000000000000000000000010000\n c = int(a) + int(b) # (5): c=1611 (11): c=11150581741799452420768643548247021706215 ... (35): c=200000010001000000000000000000001000000001000101000000000001000000000000000010000\n c = '{}'.format(c) # (6): c=1611 (12): c=11150581741799452420768643548247021706215 ... (36): c=200000010001000000000000000000001000000001000101000000000001000000000000000010000\n print(c if len(c) else 'overflow') # (7): NO CHANGE (13): NO CHANGE ... (37): NO CHANGE\n"], "anno_status": [false], "diff_content": " import sys\n f = sys.stdin\n n = int(f.readline())\n for _ in range(n):\n a = f.readline().strip()\n b = f.readline().strip()\n c = int(a) + int(b)\n c = '{}'.format(c)\n- print(c if len(c) else 'overflow')\n+ print(c if len(c) <= 80 else 'overflow')\n", "FL_content": "\n import sys\n f = sys.stdin\n-n = int(f.readline())\n-for _ in range(n):\n- a = f.readline().strip()\n- b = f.readline().strip()\n- c = int(a) + int(b)\n- c = '{}'.format(c)\n- print(c if len(c) else 'overflow')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u925051897", "problem_id": "p04039", "submission1_id": "s071854284-FL", "submission2_id": "s910679923", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import re\n\n\n\ninput_1st=input()\ninput_2nd=input()\n\nN, K = input_1st.split(\" \")\nD = input_2nd.split(\" \")\n\npattern = re.compile(\"|\".join(D))\n\n\nfor ans in range(int(N), 10000):\n result = re.findall(pattern, str(ans))\n if not result:\n print(ans)\n break\n", "code2": "input_1st=input()\ninput_2nd=input()\n\nN, K = input_1st.split(\" \")\nD = input_2nd.split(\" \")\n\nfor ans in range(int(N), 100000):\n flg = True\n for i in range(len(str(ans))):\n if str(ans)[i] in D:\n flg = False\n break\n\n if flg:\n print(ans)\n break\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589210862", "date2": "1589224541", "bleu_score": "0.6664305937084326", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 72, "total_score": 94, "input": "34782 1\n1\n", "actual_output": "no output\n", "expected_output": "34782\n\n", "anno_code": ["import re\n\n\n\ninput_1st=input() # (0): input_1st=34782 1\ninput_2nd=input() # (1): input_2nd=1\n\nN, K = input_1st.split(\" \") # (2): N=34782, K=1\nD = input_2nd.split(\" \") # (3): D=['1']\n\npattern = re.compile(\"|\".join(D)) # (4): pattern=re.compile('1')\n\n\nfor ans in range(int(N), 10000):\n result = re.findall(pattern, str(ans))\n if not result:\n print(ans)\n break\n"], "anno_status": [true], "diff_content": "-import re\n-\n-\n-\n input_1st=input()\n input_2nd=input()\n \n N, K = input_1st.split(\" \")\n D = input_2nd.split(\" \")\n \n-pattern = re.compile(\"|\".join(D))\n-\n+for ans in range(int(N), 100000):\n+ flg = True\n+ for i in range(len(str(ans))):\n+ if str(ans)[i] in D:\n+ flg = False\n+ break\n \n-for ans in range(int(N), 10000):\n- result = re.findall(pattern, str(ans))\n- if not result:\n+ if flg:\n print(ans)\n break\n \n", "FL_content": "\n import re\n \n \n \n input_1st=input()\n input_2nd=input()\n \n N, K = input_1st.split(\" \")\n-D = input_2nd.split(\" \")\n \n pattern = re.compile(\"|\".join(D))\n \n \n-for ans in range(int(N), 10000):\n result = re.findall(pattern, str(ans))\n if not result:\n print(ans)\n break\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u562935282", "problem_id": "p03617", "submission1_id": "s647054128-FL", "submission2_id": "s309844241", "status1": "Wrong Answer", "status2": "Accepted", "code1": "q, h, s, d = map(int, input().split())\nn = int(input())\n\nhalf = min(2 * q, h)\none = min(2 * half, s)\ntwo = min(2 * one, d)\n\nl = zip([2, 1, 0.5, 0.25], [two, one, half, q])\n\nans = 0\nrest = n\nfor vol, cost in l:\n ans += rest \n rest %= vol\nprint(int(ans))", "code2": "q, h, s, d = map(int, input().split())\nn = int(input())\n\nhalf = min(2 * q, h)\none = min(2 * half, s)\ntwo = min(2 * one, d)\n\nl = zip([2, 1, 0.5, 0.25], [two, one, half, q])\n\nans = 0\nrest = n\nfor vol, cost in l:\n ans += (rest \n rest %= vol\n if rest == 0:\n print(ans)\n break", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1536014054", "date2": "1536015098", "bleu_score": "0.8545946411651143", "code1_test_status": [0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 2, "total_score": 104, "input": "10000 1011 110 14\n-2\n", "actual_output": "-2\n", "expected_output": "-14\n\n", "anno_code": ["q, h, s, d = map(int, input().split()) # (0): q=10000, h=1011, s=110, d=14\nn = int(input()) # (1): n=-2\n\nhalf = min(2 * q, h) # (2): half=1011\none = min(2 * half, s) # (3): one=110\ntwo = min(2 * one, d) # (4): two=14\n\nl = zip([2, 1, 0.5, 0.25], [two, one, half, q]) # (5): l=\n\nans = 0 # (6): ans=0\nrest = n # (7): rest=-2\nfor vol, cost in l: # (8): vol=2, cost=14 (11): vol=1, cost=110 ... (20): NO CHANGE\n ans += rest # (9): ans=-2 (12): NO CHANGE ... (18): NO CHANGE\n rest %= vol # (10): rest=0 (13): NO CHANGE ... (19): NO CHANGE\nprint(int(ans))"], "anno_status": [true], "diff_content": " q, h, s, d = map(int, input().split())\n n = int(input())\n \n half = min(2 * q, h)\n one = min(2 * half, s)\n two = min(2 * one, d)\n \n l = zip([2, 1, 0.5, 0.25], [two, one, half, q])\n \n ans = 0\n rest = n\n for vol, cost in l:\n- ans += rest \n+ ans += (rest \n rest %= vol\n-print(int(ans))\n+ if rest == 0:\n+ print(ans)\n+ break\n", "FL_content": "\n q, h, s, d = map(int, input().split())\n n = int(input())\n \n half = min(2 * q, h)\n one = min(2 * half, s)\n two = min(2 * one, d)\n \n-l = zip([2, 1, 0.5, 0.25], [two, one, half, q])\n \n ans = 0\n rest = n\n for vol, cost in l:\n ans += rest \n rest %= vol\n print(int(ans))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u554572515", "problem_id": "p02318", "submission1_id": "s522011358-FL", "submission2_id": "s618536475", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef ED():\n X = \" \" + input()\n Y = \" \" + input()\n ed = [[0]*(len(X)) for _ in range(len(Y))]\n for j in range(len(X)):\n for i in range(len(Y)):\n if (i == j == 0):\n continue\n if (X[j] == Y[i]):\n ed[i][j] = ed[i-1][j-1]\n else:\n if(j > i):\n ed[i][j] = ed[i][j-1] + 1\n elif(j < i):\n ed[i][j] = ed[i-1][j] + 1\n elif(j == i):\n ed[i][j] = ed[i-1][j-1] + 1\n return ed[len(Y)-1][len(X)-1]\n\nif __name__ == '__main__':\n print(ED())", "code2": "\ndef ED():\n X = \" \" + input()\n Y = \" \" + input()\n ed = [[float(\"inf\")]*(len(X)) for _ in range(len(Y))]\n \n for j in range(len(X)):\n ed[0][j] = j\n for i in range(len(Y)):\n ed[i][0] = i\n \n for j in range(1, len(X)):\n for i in range(1, len(Y)):\n if (X[j] == Y[i]):\n ed[i][j] = ed[i-1][j-1]\n else:\n ed[i][j] = min(ed[i-1][j-1], ed[i][j-1], ed[i-1][j]) + 1\n \n return ed[len(Y)-1][len(X)-1]\n\nif __name__ == '__main__':\n print(ED())", "original_language1": "Python3", "original_language2": "Python3", "date1": "1491639391", "date2": "1491643654", "bleu_score": "0.7554884287574655", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1], "code1_test_score": 91, "total_score": 102, "input": "bd`c\ndcn\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["\ndef ED(): # (0): ED=\n X = \" \" + input()\n Y = \" \" + input()\n ed = [[0]*(len(X)) for _ in range(len(Y))]\n for j in range(len(X)):\n for i in range(len(Y)):\n if (i == j == 0):\n continue\n if (X[j] == Y[i]):\n ed[i][j] = ed[i-1][j-1]\n else:\n if(j > i):\n ed[i][j] = ed[i][j-1] + 1\n elif(j < i):\n ed[i][j] = ed[i-1][j] + 1\n elif(j == i):\n ed[i][j] = ed[i-1][j-1] + 1\n return ed[len(Y)-1][len(X)-1]\n\nif __name__ == '__main__':\n print(ED())"], "anno_status": [true], "diff_content": " \n def ED():\n X = \" \" + input()\n Y = \" \" + input()\n- ed = [[0]*(len(X)) for _ in range(len(Y))]\n+ ed = [[float(\"inf\")]*(len(X)) for _ in range(len(Y))]\n+ \n for j in range(len(X)):\n- for i in range(len(Y)):\n- if (i == j == 0):\n- continue\n+ ed[0][j] = j\n+ for i in range(len(Y)):\n+ ed[i][0] = i\n+ \n+ for j in range(1, len(X)):\n+ for i in range(1, len(Y)):\n if (X[j] == Y[i]):\n ed[i][j] = ed[i-1][j-1]\n else:\n- if(j > i):\n- ed[i][j] = ed[i][j-1] + 1\n- elif(j < i):\n- ed[i][j] = ed[i-1][j] + 1\n- elif(j == i):\n- ed[i][j] = ed[i-1][j-1] + 1\n+ ed[i][j] = min(ed[i-1][j-1], ed[i][j-1], ed[i-1][j]) + 1\n+ \n return ed[len(Y)-1][len(X)-1]\n \n if __name__ == '__main__':\n print(ED())\n", "FL_content": "\n \n def ED():\n X = \" \" + input()\n Y = \" \" + input()\n ed = [[0]*(len(X)) for _ in range(len(Y))]\n for j in range(len(X)):\n for i in range(len(Y)):\n if (i == j == 0):\n continue\n if (X[j] == Y[i]):\n ed[i][j] = ed[i-1][j-1]\n else:\n if(j > i):\n ed[i][j] = ed[i][j-1] + 1\n elif(j < i):\n- ed[i][j] = ed[i-1][j] + 1\n elif(j == i):\n ed[i][j] = ed[i-1][j-1] + 1\n return ed[len(Y)-1][len(X)-1]\n \n if __name__ == '__main__':\n print(ED())\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u029169777", "problem_id": "p03297", "submission1_id": "s362528833-FL", "submission2_id": "s069315762", "status1": "Wrong Answer", "status2": "Accepted", "code1": "T=int(input())\n\nQuery=[]\nfor i in range(T):\n Query.append(list(map(int,input().split())))\n\nfor i in range(T):\n count=0\n while(True):\n if Query[i][0]%Query[i][1]>Query[i][2]:\n print('No')\n break;\n Query[i][0]=Query[i][0]%Query[i][1] \n if Query[i][0]<=Query[i][2]: \n Query[i][0]+=Query[i][3]\n count+=1\n if count==300:\n print('Yes')\n break;", "code2": "def gcd(a,b):\n while b:\n a,b=b,a%b\n return a\nT=int(input())\n \nQuery=[]\nfor i in range(T):\n Query.append(list(map(int,input().split())))\n \nfor i in range(T):\n while(True):\n if Query[i][0]%Query[i][1]>Query[i][2] or Query[i][0]Query[i][3]:\n print('No')\n break;\n G=gcd(Query[i][1],Query[i][3]) \n \n if Query[i][1]-G+Query[i][0]%G>Query[i][2]:\n print('No')\n break;\n else:\n print('Yes')\n break;", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531620993", "date2": "1531698281", "bleu_score": "0.7039144520752629", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1], "code1_test_score": 52, "total_score": 102, "input": "14\n7 7 5 9\n15 7 1 9\n14 5 7 12\n14 10 1 12\n14 14 14 11\n14 11 5 11\n14 9 12 11\n14 10 11 11\n0 10 3 11\n0 13 9 6\n11 18 9 10\n16 10 5 10\n1000010000100000000 17 5 999999999999999985\n1000000000000000000 16 15 2424336645253281229\n", "actual_output": "No\nNo\nYes\nNo\nYes\nYes\nYes\nYes\nNo\nNo\nNo\nNo\nNo\nYes\n", "expected_output": "No\nNo\nYes\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\nNo\nNo\nYes\n\n", "anno_code": ["T=int(input()) # (0): T=14\n\nQuery=[] # (1): Query=[]\nfor i in range(T): # (2): i=0 (4): i=1 ... (30): NO CHANGE\n Query.append(list(map(int,input().split()))) # (3): Query (5): Query ... (29): Query\n\nfor i in range(T): # (31): i=0 (58): i=1 ... (10669): i=13\n count=0 # (32): count=0 (59): count=0 ... (10670): NO CHANGE\n while(True): # (33): NO CHANGE (40): NO CHANGE ... (12764): NO CHANGE\n if Query[i][0]%Query[i][1]>Query[i][2]: # (34): NO CHANGE (41): NO CHANGE ... (12765): NO CHANGE\n print('No') # (56): NO CHANGE (69): NO CHANGE ... (10667): NO CHANGE\n break; # (57): NO CHANGE (70): NO CHANGE ... (10668): NO CHANGE\n Query[i][0]=Query[i][0]%Query[i][1] # (35): Query (42): Query ... (12766): Query\n if Query[i][0]<=Query[i][2]: # (36): NO CHANGE (43): NO CHANGE ... (12767): NO CHANGE\n Query[i][0]+=Query[i][3] # (37): Query (44): Query ... (12768): Query\n count+=1 # (38): count=1 (45): count=2 ... (12769): count=300\n if count==300: # (39): NO CHANGE (46): NO CHANGE ... (12770): NO CHANGE\n print('Yes') # (2173): NO CHANGE (4283): NO CHANGE ... (12771): NO CHANGE\n break; # (2174): NO CHANGE (4284): NO CHANGE ... (12772): NO CHANGE\n"], "anno_status": [false], "diff_content": "+def gcd(a,b):\n+ while b:\n+ a,b=b,a%b\n+ return a\n T=int(input())\n-\n+ \n Query=[]\n for i in range(T):\n Query.append(list(map(int,input().split())))\n-\n+ \n for i in range(T):\n- count=0\n while(True):\n- if Query[i][0]%Query[i][1]>Query[i][2]:\n+ if Query[i][0]%Query[i][1]>Query[i][2] or Query[i][0]Query[i][3]:\n print('No')\n break;\n- Query[i][0]=Query[i][0]%Query[i][1] \n- if Query[i][0]<=Query[i][2]: \n- Query[i][0]+=Query[i][3]\n- count+=1\n- if count==300:\n+ G=gcd(Query[i][1],Query[i][3]) \n+ \n+ if Query[i][1]-G+Query[i][0]%G>Query[i][2]:\n+ print('No')\n+ break;\n+ else:\n print('Yes')\n break;\n", "FL_content": "\n T=int(input())\n \n Query=[]\n for i in range(T):\n Query.append(list(map(int,input().split())))\n \n for i in range(T):\n- count=0\n- while(True):\n- if Query[i][0]%Query[i][1]>Query[i][2]:\n- print('No')\n- break;\n- Query[i][0]=Query[i][0]%Query[i][1] \n- if Query[i][0]<=Query[i][2]: \n- Query[i][0]+=Query[i][3]\n- count+=1\n- if count==300:\n- print('Yes')\n- break;\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u535659144", "problem_id": "p03944", "submission1_id": "s130968968-FL", "submission2_id": "s067788045", "status1": "Wrong Answer", "status2": "Accepted", "code1": "inp = list(map(int,input().split()))\nleft_max=0\nright_min=inp[0]\nupper_min=inp[1]\nlower_max=0\n\nfor i in range(inp[2]):\n inin = list(map(int,input().split()))\n if inin[2] == 1 and inin[0]>left_max:\n left_max=inin[0]\n if inin[2] == 2 and inin[0]lower_max:\n lower_max=inin[1]\nleft_max=min(left_max,right_min)\nupper_min=min(upper_min,lower_max)\nprint((right_min-left_max)*(upper_min-lower_max))\n \n", "code2": "inp = list(map(int,input().split()))\nleft_max=0\nright_min=inp[0]\nupper_min=inp[1]\nlower_max=0\n\nfor i in range(inp[2]):\n inin = list(map(int,input().split()))\n if inin[2] == 1 and inin[0]>left_max:\n left_max=inin[0]\n if inin[2] == 2 and inin[0]lower_max:\n lower_max=inin[1]\nleft_max=min(left_max,right_min)\nupper_min=max(upper_min,lower_max)\nprint((right_min-left_max)*(upper_min-lower_max))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1585707347", "date2": "1585707461", "bleu_score": "0.9829247320091734", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0], "code1_test_score": 25, "total_score": 103, "input": "5 2 3\n2 0 3\n3 11 2\n2 0 2\n", "actual_output": "0\n", "expected_output": "4\n\n", "anno_code": ["inp = list(map(int,input().split())) # (0): inp=[5, 2, 3]\nleft_max=0 # (1): left_max=0\nright_min=inp[0] # (2): right_min=5\nupper_min=inp[1] # (3): upper_min=2\nlower_max=0 # (4): lower_max=0\n\nfor i in range(inp[2]): # (5): i=0 (11): i=1 ... (25): NO CHANGE\n inin = list(map(int,input().split())) # (6): inin=[2, 0, 3] (12): inin=[3, 11, 2] (19): inin=[2, 0, 2]\n if inin[2] == 1 and inin[0]>left_max: # (7): NO CHANGE (13): NO CHANGE (20): NO CHANGE\n left_max=inin[0]\n if inin[2] == 2 and inin[0]lower_max: # (10): NO CHANGE (17): NO CHANGE (24): NO CHANGE\n lower_max=inin[1]\nleft_max=min(left_max,right_min) # (26): NO CHANGE\nupper_min=min(upper_min,lower_max) # (27): upper_min=0\nprint((right_min-left_max)*(upper_min-lower_max))\n \n"], "anno_status": [true], "diff_content": " inp = list(map(int,input().split()))\n left_max=0\n right_min=inp[0]\n upper_min=inp[1]\n lower_max=0\n \n for i in range(inp[2]):\n inin = list(map(int,input().split()))\n if inin[2] == 1 and inin[0]>left_max:\n left_max=inin[0]\n if inin[2] == 2 and inin[0]lower_max:\n lower_max=inin[1]\n left_max=min(left_max,right_min)\n-upper_min=min(upper_min,lower_max)\n+upper_min=max(upper_min,lower_max)\n print((right_min-left_max)*(upper_min-lower_max))\n- \n \n", "FL_content": "\n inp = list(map(int,input().split()))\n left_max=0\n right_min=inp[0]\n upper_min=inp[1]\n lower_max=0\n \n for i in range(inp[2]):\n inin = list(map(int,input().split()))\n if inin[2] == 1 and inin[0]>left_max:\n left_max=inin[0]\n if inin[2] == 2 and inin[0]lower_max:\n lower_max=inin[1]\n left_max=min(left_max,right_min)\n upper_min=min(upper_min,lower_max)\n print((right_min-left_max)*(upper_min-lower_max))\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 21 }, { "user_id": "u651803486", "problem_id": "p03031", "submission1_id": "s664866393-FL", "submission2_id": "s493907743", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\n\nn_switches = []\nswitches = []\nfor i in range(M):\n ipt = list(map(int, input().split()))\n n_switches.append(int(ipt[0]))\n switches.append(ipt[1:])\n\n\np = list(map(int, input().split()))\n\nans = 0\n\n\nfor i in range(N**2):\n ptn = bin(i)[2:].rjust(N, '0')\n\n allLight = True \n\n \n for j in range(M):\n\n n_light = 0\n \n for k in range(n_switches[j]):\n \n if ptn[switches[j][k] - 1] == '1':\n n_light += 1\n\n if n_light % 2 != p[j]:\n allLight = False\n break\n\n if allLight:\n ans += 1\n\nprint(ans)\n\n ", "code2": "N, M = map(int, input().split())\n\nn_switches = []\nswitches = []\nfor i in range(M):\n ipt = list(map(int, input().split()))\n n_switches.append(int(ipt[0]))\n switches.append(ipt[1:])\n\n\np = list(map(int, input().split()))\n\nans = 0\n\n\n\n\n\n\nfor i in range(2 ** N):\n ptn = bin(i)[2:].rjust(N, '0')\n\n allLight = True \n\n \n for j in range(M):\n\n n_light = 0\n \n for k in range(n_switches[j]):\n \n if ptn[switches[j][k] - 1] == '1':\n n_light += 1\n\n if n_light % 2 != p[j]:\n allLight = False\n break\n\n if allLight:\n ans += 1\n\nprint(ans)\n\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559780484", "date2": "1559795029", "bleu_score": "0.9840058335554991", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0], "code1_test_score": 62, "total_score": 103, "input": "1 0\n-1 1 5\n2 1\n0 0\n0 0 -2\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=1, M=0\n\nn_switches = [] # (1): n_switches=[]\nswitches = [] # (2): switches=[]\nfor i in range(M): # (3): NO CHANGE\n ipt = list(map(int, input().split()))\n n_switches.append(int(ipt[0]))\n switches.append(ipt[1:])\n\n\np = list(map(int, input().split())) # (4): p=[-1, 1, 5]\n\nans = 0 # (5): ans=0\n\n\nfor i in range(N**2): # (6): i=0 (12): NO CHANGE\n ptn = bin(i)[2:].rjust(N, '0') # (7): ptn=0\n\n allLight = True # (8): allLight=True\n\n \n for j in range(M): # (9): NO CHANGE\n\n n_light = 0\n \n for k in range(n_switches[j]):\n \n if ptn[switches[j][k] - 1] == '1':\n n_light += 1\n\n if n_light % 2 != p[j]:\n allLight = False\n break\n\n if allLight: # (10): NO CHANGE\n ans += 1 # (11): ans=1\n\nprint(ans)\n\n "], "anno_status": [true], "diff_content": " N, M = map(int, input().split())\n \n n_switches = []\n switches = []\n for i in range(M):\n ipt = list(map(int, input().split()))\n n_switches.append(int(ipt[0]))\n switches.append(ipt[1:])\n \n \n p = list(map(int, input().split()))\n \n ans = 0\n \n \n-for i in range(N**2):\n+\n+\n+\n+\n+for i in range(2 ** N):\n ptn = bin(i)[2:].rjust(N, '0')\n \n allLight = True \n \n \n for j in range(M):\n \n n_light = 0\n \n for k in range(n_switches[j]):\n \n if ptn[switches[j][k] - 1] == '1':\n n_light += 1\n \n if n_light % 2 != p[j]:\n allLight = False\n break\n \n if allLight:\n ans += 1\n \n print(ans)\n \n \n", "FL_content": "\n N, M = map(int, input().split())\n \n n_switches = []\n switches = []\n for i in range(M):\n ipt = list(map(int, input().split()))\n n_switches.append(int(ipt[0]))\n switches.append(ipt[1:])\n \n \n p = list(map(int, input().split()))\n \n ans = 0\n \n \n-for i in range(N**2):\n ptn = bin(i)[2:].rjust(N, '0')\n \n allLight = True \n \n \n for j in range(M):\n \n n_light = 0\n \n for k in range(n_switches[j]):\n \n if ptn[switches[j][k] - 1] == '1':\n n_light += 1\n \n if n_light % 2 != p[j]:\n allLight = False\n break\n \n if allLight:\n ans += 1\n \n print(ans)\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 40 }, { "user_id": "u316386814", "problem_id": "p03291", "submission1_id": "s735148333-FL", "submission2_id": "s927090554", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nN = len(S)\nMOD = 10 ** 9 + 7\n\ndp = [0, 0, 0, 0]\ndp[0] = 1\n\nfor s in S:\n factor = 3 if s == '?' else 1\n for j, c in zip([2, 1, 0], 'CBA'):\n dp[j + 1] = dp[j + 1] * factor % MOD\n if s == c or s == '?':\n dp[j + 1] += dp[j]\n if s == '?':\n dp[0] = dp[0] % MOD\n\nans = dp[-1] % MOD\n\nprint(ans)", "code2": "S = input()\nN = len(S)\nMOD = 10 ** 9 + 7\n\ndp = [0, 0, 0, 0]\ndp[0] = 1\n\nfor s in S:\n factor = 3 if s == '?' else 1\n for j, c in zip([2, 1, 0], 'CBA'):\n dp[j + 1] = dp[j + 1] * factor % MOD\n if s == c or s == '?':\n dp[j + 1] += dp[j]\n if s == '?':\n dp[0] = (dp[0] * 3) % MOD\n\nans = dp[-1] % MOD\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552195897", "date2": "1552195944", "bleu_score": "0.9759477653238131", "code1_test_status": [1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 7, "total_score": 103, "input": "?D@@=?A?<>?B;?@B@>=A>=>9?\n", "actual_output": "830\n", "expected_output": "2808\n\n", "anno_code": ["S = input() # (0): S=?D@@=?A?<>?B;?@B@>=A>=>9?\nN = len(S) # (1): N=25\nMOD = 10 ** 9 + 7 # (2): MOD=1000000007\n\ndp = [0, 0, 0, 0] # (3): dp=[0, 0, 0, 0]\ndp[0] = 1 # (4): dp=[1, 0, 0, 0]\n\nfor s in S: # (5): s=? (22): s=D ... (358): NO CHANGE\n factor = 3 if s == '?' else 1 # (6): factor=3 (23): factor=1 ... (342): factor=3\n for j, c in zip([2, 1, 0], 'CBA'): # (7): j=2, c=C (11): j=1, c=B ... (355): NO CHANGE\n dp[j + 1] = dp[j + 1] * factor % MOD # (8): NO CHANGE (12): NO CHANGE ... (352): dp=[1, 447, 1541, 830]\n if s == c or s == '?': # (9): NO CHANGE (13): NO CHANGE ... (353): NO CHANGE\n dp[j + 1] += dp[j] # (10): NO CHANGE (14): NO CHANGE ... (354): dp=[1, 448, 1541, 830]\n if s == '?': # (20): NO CHANGE (34): NO CHANGE ... (356): NO CHANGE\n dp[0] = dp[0] % MOD # (21): NO CHANGE (90): NO CHANGE ... (357): NO CHANGE\n\nans = dp[-1] % MOD # (359): ans=830\n\nprint(ans)"], "anno_status": [true], "diff_content": " S = input()\n N = len(S)\n MOD = 10 ** 9 + 7\n \n dp = [0, 0, 0, 0]\n dp[0] = 1\n \n for s in S:\n factor = 3 if s == '?' else 1\n for j, c in zip([2, 1, 0], 'CBA'):\n dp[j + 1] = dp[j + 1] * factor % MOD\n if s == c or s == '?':\n dp[j + 1] += dp[j]\n if s == '?':\n- dp[0] = dp[0] % MOD\n+ dp[0] = (dp[0] * 3) % MOD\n \n ans = dp[-1] % MOD\n \n print(ans)\n", "FL_content": "\n S = input()\n N = len(S)\n MOD = 10 ** 9 + 7\n \n dp = [0, 0, 0, 0]\n dp[0] = 1\n \n for s in S:\n factor = 3 if s == '?' else 1\n for j, c in zip([2, 1, 0], 'CBA'):\n dp[j + 1] = dp[j + 1] * factor % MOD\n if s == c or s == '?':\n dp[j + 1] += dp[j]\n if s == '?':\n- dp[0] = dp[0] % MOD\n \n ans = dp[-1] % MOD\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u055244973", "problem_id": "p02639", "submission1_id": "s005950643-FL", "submission2_id": "s472282425", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C, D, E = map(int, input().split())\n\nresult = 15 - (A+B+C+D+E)", "code2": "A, B, C, D, E = map(int, input().split())\n\nresult = 15 - (A+B+C+D+E)\nprint(result)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592183562", "date2": "1592183637", "bleu_score": "0.8159123638897062", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "", "expected_output": "1\n", "anno_code": ["A, B, C, D, E = map(int, input().split()) # (0): A=0, B=2, C=3, D=4, E=5\n\nresult = 15 - (A+B+C+D+E)"], "anno_status": [true], "diff_content": " A, B, C, D, E = map(int, input().split())\n \n result = 15 - (A+B+C+D+E)\n+print(result)\n+\n", "FL_content": "\n A, B, C, D, E = map(int, input().split())\n \n-result = 15 - (A+B+C+D+E)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 3 }, { "user_id": "u556589653", "problem_id": "p03945", "submission1_id": "s391825246-FL", "submission2_id": "s405643511", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nans = 0\nfor i in range(1,len(S)):\n if S[i-1] != S[i]:\n ans += 1", "code2": "S = input()\nans = 0\nfor i in range(1,len(S)):\n if S[i-1] != S[i]:\n ans += 1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589376282", "date2": "1589376293", "bleu_score": "0.8756849639041266", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "WVWWWZ\n", "actual_output": "", "expected_output": "3\n\n", "anno_code": ["S = input() # (0): S=WVWWWZ\nans = 0 # (1): ans=0\nfor i in range(1,len(S)): # (2): i=1 (5): i=2 ... (12): i=5\n if S[i-1] != S[i]: # (3): NO CHANGE (6): NO CHANGE ... (13): NO CHANGE\n ans += 1 # (4): ans=1 (7): ans=2 (14): ans=3\n"], "anno_status": [true], "diff_content": " S = input()\n ans = 0\n for i in range(1,len(S)):\n if S[i-1] != S[i]:\n ans += 1\n+print(ans)\n", "FL_content": "\n S = input()\n ans = 0\n for i in range(1,len(S)):\n if S[i-1] != S[i]:\n ans += 1\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u597136378", "problem_id": "p03719", "submission1_id": "s893228611-FL", "submission2_id": "s540039019", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c = (int(i) for i in input().split())\nif(a<=c and c<=b):\n print('YES')\nelse:\n print('No')\n ", "code2": "a,b,c = (int(i) for i in input().split())\nif(a<=c and c<=b):\n print('Yes')\nelse:\n print('No')\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564339393", "date2": "1564339521", "bleu_score": "0.9649773185979726", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0], "code1_test_score": 16, "total_score": 21, "input": "-4 2 -3\n", "actual_output": "YES\n", "expected_output": "Yes\n\n", "anno_code": ["a,b,c = (int(i) for i in input().split()) # (0): a=-4, b=2, c=-3\nif(a<=c and c<=b): # (1): NO CHANGE\n print('YES')\nelse:\n print('No')\n "], "anno_status": [true], "diff_content": " a,b,c = (int(i) for i in input().split())\n if(a<=c and c<=b):\n- print('YES')\n+ print('Yes')\n else:\n print('No')\n \n", "FL_content": "\n a,b,c = (int(i) for i in input().split())\n if(a<=c and c<=b):\n- print('YES')\n else:\n print('No')\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u456353530", "problem_id": "p02975", "submission1_id": "s813121419-FL", "submission2_id": "s757379446", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\na = list(map(int, input().split()))\n\nR = {}\nfor i in a:\n if i in R:\n R[i] += 1\n else:\n R[i] = 1\n\nans = [\"Yes\", \"No\"]\nif 0 in R:\n if len(R) == 1:\n print(ans[0])\n elif len(R) == 2:\n for i in R.keys():\n if i != 0:\n x = R[i]\n else:\n z = R[i]\n if x == z * 2:\n print(ans[0])\n else:\n print(ans[1])\n else:\n print(ans[1])\nelse:\n if len(R) != 3:\n print(ans[0])\n else:\n t = -1\n for i in R.values():\n if t == -1:\n t = i\n else:\n if i != t:\n print(ans[1])\n break\n else:\n print(ans[0])", "code2": "N = int(input())\na = list(map(int, input().split()))\n\nR = {}\nfor i in a:\n if i in R:\n R[i] += 1\n else:\n R[i] = 1\n\nans = [\"Yes\", \"No\"]\nif 0 in R:\n if len(R) == 1:\n print(ans[0])\n elif len(R) == 2:\n for i in R.keys():\n if i != 0:\n x = R[i]\n else:\n z = R[i]\n if x == z * 2:\n print(ans[0])\n else:\n print(ans[1])\n else:\n print(ans[1])\nelse:\n if len(R) != 3:\n print(ans[1])\n else:\n t = -1\n for i in R.values():\n if t == -1:\n t = i\n else:\n if i != t:\n print(ans[1])\n break\n else:\n a = b = c = -1\n for i in R.keys():\n if a == -1:\n a = i\n elif b == -1:\n b = i\n else:\n c = i\n if a ^ b == c:\n print(ans[0])\n else:\n print(ans[1])", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1563155173", "date2": "1563155528", "bleu_score": "0.7427750720851666", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 43, "total_score": 58, "input": "3\n-1 49 -1\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["N = int(input()) # (0): N=3\na = list(map(int, input().split())) # (1): a=[-1, 49, -1]\n\nR = {} # (2): R={}\nfor i in a: # (3): i=-1 (6): i=49 ... (12): NO CHANGE\n if i in R: # (4): NO CHANGE (7): NO CHANGE (10): NO CHANGE\n R[i] += 1 # (11): R={-1: 2, 49: 1}\n else:\n R[i] = 1 # (5): R={-1: 1} (8): R={-1: 1, 49: 1}\n\nans = [\"Yes\", \"No\"] # (13): ans=['Yes', 'No']\nif 0 in R: # (14): NO CHANGE\n if len(R) == 1:\n print(ans[0])\n elif len(R) == 2:\n for i in R.keys():\n if i != 0:\n x = R[i]\n else:\n z = R[i]\n if x == z * 2:\n print(ans[0])\n else:\n print(ans[1])\n else:\n print(ans[1])\nelse:\n if len(R) != 3: # (15): NO CHANGE\n print(ans[0])\n else:\n t = -1\n for i in R.values():\n if t == -1:\n t = i\n else:\n if i != t:\n print(ans[1])\n break\n else:\n print(ans[0])"], "anno_status": [true], "diff_content": " N = int(input())\n a = list(map(int, input().split()))\n \n R = {}\n for i in a:\n if i in R:\n R[i] += 1\n else:\n R[i] = 1\n \n ans = [\"Yes\", \"No\"]\n if 0 in R:\n if len(R) == 1:\n print(ans[0])\n elif len(R) == 2:\n for i in R.keys():\n if i != 0:\n x = R[i]\n else:\n z = R[i]\n if x == z * 2:\n print(ans[0])\n else:\n print(ans[1])\n else:\n print(ans[1])\n else:\n if len(R) != 3:\n- print(ans[0])\n+ print(ans[1])\n else:\n t = -1\n for i in R.values():\n if t == -1:\n t = i\n else:\n if i != t:\n print(ans[1])\n break\n else:\n- print(ans[0])\n+ a = b = c = -1\n+ for i in R.keys():\n+ if a == -1:\n+ a = i\n+ elif b == -1:\n+ b = i\n+ else:\n+ c = i\n+ if a ^ b == c:\n+ print(ans[0])\n+ else:\n+ print(ans[1])\n", "FL_content": "\n N = int(input())\n a = list(map(int, input().split()))\n \n R = {}\n for i in a:\n if i in R:\n R[i] += 1\n else:\n R[i] = 1\n \n ans = [\"Yes\", \"No\"]\n if 0 in R:\n if len(R) == 1:\n print(ans[0])\n elif len(R) == 2:\n for i in R.keys():\n if i != 0:\n x = R[i]\n else:\n z = R[i]\n if x == z * 2:\n print(ans[0])\n else:\n print(ans[1])\n else:\n print(ans[1])\n else:\n if len(R) != 3:\n print(ans[0])\n else:\n t = -1\n for i in R.values():\n if t == -1:\n t = i\n else:\n if i != t:\n print(ans[1])\n break\n else:\n print(ans[0])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 40 }, { "user_id": "u745554846", "problem_id": "p03207", "submission1_id": "s191514781-FL", "submission2_id": "s785778946", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\nb = []\nfor i in range(a):\n b.append(int(input()))\n \nb.sort()\n \nb[-1] = b[-1] / 2\n \nprint(sum(b))", "code2": "a = int(input())\nb = []\nfor i in range(a):\n b.append(int(input()))\n\nb.sort()\n\nb[-1] = b[-1] / 2\n\nprint(int(sum(b)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555700684", "date2": "1555700735", "bleu_score": "0.9022470187855975", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "3\n0\n4428\n52\n", "actual_output": "2266.0\n", "expected_output": "2266\n\n", "anno_code": ["a = int(input()) # (0): a=3\nb = [] # (1): b=[]\nfor i in range(a): # (2): i=0 (4): i=1 ... (8): NO CHANGE\n b.append(int(input())) # (3): b=[0] (5): b=[0, 4428] (7): b=[0, 4428, 52]\n \nb.sort() # (9): b=[0, 52, 4428]\n \nb[-1] = b[-1] / 2 # (10): b=[0, 52, 2214.0]\n \nprint(sum(b))"], "anno_status": [true], "diff_content": " a = int(input())\n b = []\n for i in range(a):\n- b.append(int(input()))\n- \n+ b.append(int(input()))\n+\n b.sort()\n- \n+\n b[-1] = b[-1] / 2\n- \n-print(sum(b))\n+\n+print(int(sum(b)))\n", "FL_content": "\n a = int(input())\n b = []\n for i in range(a):\n b.append(int(input()))\n \n b.sort()\n \n-b[-1] = b[-1] / 2\n \n print(sum(b))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u948911484", "problem_id": "p02975", "submission1_id": "s696169263-FL", "submission2_id": "s367656456", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\nn = int(input())\na = list(map(int,input().split()))\nc = Counter(a)\nif len(c) == 3:\n l = list(c.keys())\n v = list(c.values())\n if l[0]^l[1]^l[2] == 0 and v[0]==v[1]==v[2]:\n print(\"Yes\")\nelif len(c) == 1:\n if list(c.keys())[0] == 0:\n print(\"Yes\")\nelif len(c) == 2:\n if (0 not in a):\n print(\"No\")\n else:\n v = c[0]\n if len(a) == c[0]*3/2 or len(a) == c[0]*3:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "from collections import Counter\nn = int(input())\na = list(map(int,input().split()))\nc = Counter(a)\nif len(c) == 3:\n l = list(c.keys())\n v = list(c.values())\n if l[0]^l[1]^l[2] == 0 and v[0]==v[1]==v[2]:\n print(\"Yes\")\n else:\n print(\"No\")\nelif len(c) == 1:\n if list(c.keys())[0] == 0:\n print(\"Yes\")\n else:\n print(\"No\")\nelif len(c) == 2:\n if (0 not in a):\n print(\"No\")\n else:\n v = c[0]\n if len(a) == c[0]*3:\n print(\"Yes\")\n else:\n print(\"No\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589850968", "date2": "1589851154", "bleu_score": "0.8300029242330463", "code1_test_status": [1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0], "code1_test_score": 20, "total_score": 58, "input": "3\n-1 25 0\n", "actual_output": "no output\n", "expected_output": "No\n\n", "anno_code": ["from collections import Counter\nn = int(input()) # (0): n=3\na = list(map(int,input().split())) # (1): a=[-1, 25, 0]\nc = Counter(a) # (2): c=Counter({-1: 1, 25: 1, 0: 1})\nif len(c) == 3: # (3): NO CHANGE\n l = list(c.keys()) # (4): l=[-1, 25, 0]\n v = list(c.values()) # (5): v=[1, 1, 1]\n if l[0]^l[1]^l[2] == 0 and v[0]==v[1]==v[2]:\n print(\"Yes\")\nelif len(c) == 1:\n if list(c.keys())[0] == 0:\n print(\"Yes\")\nelif len(c) == 2:\n if (0 not in a):\n print(\"No\")\n else:\n v = c[0]\n if len(a) == c[0]*3/2 or len(a) == c[0]*3:\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " from collections import Counter\n n = int(input())\n a = list(map(int,input().split()))\n c = Counter(a)\n if len(c) == 3:\n l = list(c.keys())\n v = list(c.values())\n if l[0]^l[1]^l[2] == 0 and v[0]==v[1]==v[2]:\n print(\"Yes\")\n+ else:\n+ print(\"No\")\n elif len(c) == 1:\n if list(c.keys())[0] == 0:\n print(\"Yes\")\n+ else:\n+ print(\"No\")\n elif len(c) == 2:\n if (0 not in a):\n print(\"No\")\n else:\n v = c[0]\n- if len(a) == c[0]*3/2 or len(a) == c[0]*3:\n+ if len(a) == c[0]*3:\n print(\"Yes\")\n+ else:\n+ print(\"No\")\n else:\n print(\"No\")\n", "FL_content": "\n from collections import Counter\n n = int(input())\n a = list(map(int,input().split()))\n c = Counter(a)\n if len(c) == 3:\n l = list(c.keys())\n v = list(c.values())\n if l[0]^l[1]^l[2] == 0 and v[0]==v[1]==v[2]:\n print(\"Yes\")\n elif len(c) == 1:\n if list(c.keys())[0] == 0:\n print(\"Yes\")\n elif len(c) == 2:\n if (0 not in a):\n print(\"No\")\n else:\n v = c[0]\n if len(a) == c[0]*3/2 or len(a) == c[0]*3:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 21 }, { "user_id": "u072723535", "problem_id": "p03207", "submission1_id": "s150048697-FL", "submission2_id": "s918916373", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\np = [int(input()) for i in range(N)]\nprint(sum(p) - max(p)/2)\n", "code2": "N = int(input())\np = [int(input()) for i in range(N)]\nprint(sum(p) - max(p) ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569129798", "date2": "1569129905", "bleu_score": "0.948389032066652", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "3\n4\n4428\n173\n", "actual_output": "2391.0\n", "expected_output": "2391\n\n", "anno_code": ["N = int(input()) # (0): N=3\np = [int(input()) for i in range(N)] # (1): p=[4, 4428, 173]\nprint(sum(p) - max(p)/2)\n"], "anno_status": [true], "diff_content": " N = int(input())\n p = [int(input()) for i in range(N)]\n-print(sum(p) - max(p)/2)\n-\n+print(sum(p) - max(p) \n", "FL_content": "\n N = int(input())\n p = [int(input()) for i in range(N)]\n-print(sum(p) - max(p)/2)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 4 }, { "user_id": "u165578704", "problem_id": "p02368", "submission1_id": "s080629172-FL", "submission2_id": "s466847525", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\n\nsys.setrecursionlimit(10 ** 9)\ndef input(): return sys.stdin.readline().strip()\ndef INT(): return int(input())\ndef MAP(): return map(int, input().split())\ndef LIST(): return list(map(int, input().split()))\nINF=float('inf')\n\nN,M=MAP()\nnodes1=[[] for i in range(N)]\nnodes2=[[] for i in range(N)]\nfor i in range(M):\n u,v=MAP()\n nodes1[u].append(v)\n nodes2[v].append(u)\n\nT=[]\nvisited=[False]*N\ndef rec1(cur):\n visited[cur]=True\n for nxt in nodes1[cur]:\n if not visited[nxt]:\n rec1(nxt)\n \n T.append(cur)\n\nrec1(0)\n\nvisited=[False]*N\ngroup=[0]*N\ngrpnum=1\ndef rec2(cur):\n global grpnum\n group[cur]=grpnum\n visited[cur]=True\n for nxt in nodes2[cur]:\n if not visited[nxt]:\n rec2(nxt)\n return\n grpnum+=1\n return\n\n\nfor u in reversed(T):\n if not visited[u]:\n rec2(u)\n\nQ=INT()\nfor _ in range(Q):\n u,v=MAP()\n if group[u]==group[v]:\n print(1)\n else:\n print(0)\n\n", "code2": "\n\nimport sys\n\nsys.setrecursionlimit(10 ** 9)\ndef input(): return sys.stdin.readline().strip()\ndef INT(): return int(input())\ndef MAP(): return map(int, input().split())\ndef LIST(): return list(map(int, input().split()))\nINF=float('inf')\n\nN,M=MAP()\nnodes1=[[] for i in range(N)]\nnodes2=[[] for i in range(N)]\nfor i in range(M):\n u,v=MAP()\n nodes1[u].append(v)\n nodes2[v].append(u)\n\nT=[]\nvisited=[False]*N\ndef rec1(cur):\n visited[cur]=True\n for nxt in nodes1[cur]:\n if not visited[nxt]:\n rec1(nxt)\n \n T.append(cur)\n\n\nfor u in range(N):\n if not visited[u]:\n rec1(u)\n\nvisited=[False]*N\ngroup=[0]*N\ngrpnum=1\ndef rec2(cur):\n global grpnum\n group[cur]=grpnum\n visited[cur]=True\n for nxt in nodes2[cur]:\n if not visited[nxt]:\n rec2(nxt)\n\n\nfor u in reversed(T):\n if not visited[u]:\n rec2(u)\n grpnum+=1\n\nQ=INT()\nfor _ in range(Q):\n u,v=MAP()\n if group[u]==group[v]:\n print(1)\n else:\n print(0)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556903683", "date2": "1556905783", "bleu_score": "0.958761963900891", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1], "code1_test_score": 64, "total_score": 101, "input": "5 6\n0 0\n1 0\n1 2\n2 4\n4 0\n0 2\n4\n0 1\n0 3\n2 0\n3 4\n", "actual_output": "1\n0\n0\n0\n", "expected_output": "0\n0\n1\n0\n\n", "anno_code": ["\n\nimport sys\n\nsys.setrecursionlimit(10 ** 9) # (0): input=, INT=, MAP=, LIST=\ndef input(): return sys.stdin.readline().strip()\ndef INT(): return int(input())\ndef MAP(): return map(int, input().split())\ndef LIST(): return list(map(int, input().split()))\nINF=float('inf') # (1): INF=inf\n\nN,M=MAP() # (2): N=5, M=6\nnodes1=[[] for i in range(N)] # (3): nodes1\nnodes2=[[] for i in range(N)] # (4): nodes2\nfor i in range(M): # (5): i=0 (9): nodes1=[[0], [], [], [], []], nodes2, i=1 ... (29): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2\n u,v=MAP() # (6): u=0, v=0 (10): nodes1=[[0], [], [], [], []], nodes2=[[0], [], [], [], []], u=1 ... (26): nodes1=[[0], [0, 2], [4], [], [0]], nodes2, u=0, v=2\n nodes1[u].append(v) # (7): nodes1 (11): nodes1, nodes2 ... (27): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2\n nodes2[v].append(u) # (8): nodes1=[[0], [], [], [], []], nodes2 (12): nodes1, nodes2 ... (28): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2\n\nT=[] # (30): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, T=[]\nvisited=[False]*N # (31): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, visited=[False, False, False, False, False]\ndef rec1(cur): # (32): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, rec1=\n visited[cur]=True # (34): NO CHANGE (40): NO CHANGE (44): NO CHANGE\n for nxt in nodes1[cur]: # (35): nxt=0 (37): nxt=2 ... (51): NO CHANGE\n if not visited[nxt]: # (36): NO CHANGE (38): NO CHANGE ... (46): NO CHANGE\n rec1(nxt) # (39): cur=2 (43): cur=4\n \n T.append(cur) # (48): cur=2, nxt=4 (50): cur=0, nxt=2 (52): sys=, input=, INT=, MAP=, LIST=, INF=inf, N=5, M=6, nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2=[[0, 1, 4], [], [1, 0], [], [2]], i=5, u=0, v=2, T=[4, 2, 0], visited=[True, False, True, False, True], rec1=\n\nrec1(0) # (33): cur=0\n\nvisited=[False]*N # (53): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, visited=[False, False, False, False, False]\ngroup=[0]*N # (54): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, group=[0, 0, 0, 0, 0]\ngrpnum=1 # (55): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, grpnum=1\ndef rec2(cur): # (56): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, rec2=\n global grpnum\n group[cur]=grpnum # (60): NO CHANGE (67): NO CHANGE ... (88): NO CHANGE\n visited[cur]=True # (61): NO CHANGE (68): NO CHANGE ... (89): NO CHANGE\n for nxt in nodes2[cur]: # (62): nxt=0 (64): nxt=1 ... (92): NO CHANGE\n if not visited[nxt]: # (63): NO CHANGE (65): NO CHANGE ... (91): NO CHANGE\n rec2(nxt) # (66): cur=1\n return # (72): sys=, input=, INT=, MAP=, LIST=, INF=inf, N=5, M=6, nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2=[[0, 1, 4], [], [1, 0], [], [2]], i=5, u=0, v=2, T=[4, 2, 0], visited=[True, True, False, False, False], rec1=, group=[1, 1, 0, 0, 0], grpnum=2, rec2=\n grpnum+=1 # (70): NO CHANGE (83): NO CHANGE (93): NO CHANGE\n return # (71): cur=0, nxt=1 (84): sys=, input=, INT=, MAP=, LIST=, INF=inf, N=5, M=6, nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2=[[0, 1, 4], [], [1, 0], [], [2]], i=5, u=2, v=2, T=[4, 2, 0], visited=[True, True, True, False, False], rec1=, group=[1, 1, 2, 0, 0], grpnum=3, rec2= (94): sys=, input=, INT=, MAP=, LIST=, INF=inf, N=5, M=6, nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2=[[0, 1, 4], [], [1, 0], [], [2]], i=5, u=4, v=2, T=[4, 2, 0], visited=[True, True, True, False, True], rec1=, group=[1, 1, 2, 0, 3], grpnum=4, rec2=\n\n\nfor u in reversed(T): # (57): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2 (73): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, u=2 ... (95): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2\n if not visited[u]: # (58): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2 (74): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2 (86): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2\n rec2(u) # (59): cur=0 (75): cur=2 (87): cur=4\n\nQ=INT() # (96): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, Q=4\nfor _ in range(Q): # (97): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, _=0 (101): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, _=1 ... (109): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, _=3\n u,v=MAP() # (98): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, u=0, v=1 (102): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, v=3 ... (110): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2, u=3, v=4\n if group[u]==group[v]: # (99): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2 (103): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2 ... (111): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2\n print(1) # (100): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2\n else:\n print(0) # (104): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2 (108): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2 (112): nodes1=[[0, 2], [0, 2], [4], [], [0]], nodes2\n\n"], "anno_status": [false], "diff_content": " \n \n import sys\n \n sys.setrecursionlimit(10 ** 9)\n def input(): return sys.stdin.readline().strip()\n def INT(): return int(input())\n def MAP(): return map(int, input().split())\n def LIST(): return list(map(int, input().split()))\n INF=float('inf')\n \n N,M=MAP()\n nodes1=[[] for i in range(N)]\n nodes2=[[] for i in range(N)]\n for i in range(M):\n u,v=MAP()\n nodes1[u].append(v)\n nodes2[v].append(u)\n \n T=[]\n visited=[False]*N\n def rec1(cur):\n visited[cur]=True\n for nxt in nodes1[cur]:\n if not visited[nxt]:\n rec1(nxt)\n \n T.append(cur)\n \n-rec1(0)\n+\n+for u in range(N):\n+ if not visited[u]:\n+ rec1(u)\n \n visited=[False]*N\n group=[0]*N\n grpnum=1\n def rec2(cur):\n global grpnum\n group[cur]=grpnum\n visited[cur]=True\n for nxt in nodes2[cur]:\n if not visited[nxt]:\n rec2(nxt)\n- return\n- grpnum+=1\n- return\n \n \n for u in reversed(T):\n if not visited[u]:\n rec2(u)\n+ grpnum+=1\n \n Q=INT()\n for _ in range(Q):\n u,v=MAP()\n if group[u]==group[v]:\n print(1)\n else:\n print(0)\n \n \n", "FL_content": "\n \n \n import sys\n \n sys.setrecursionlimit(10 ** 9)\n def input(): return sys.stdin.readline().strip()\n def INT(): return int(input())\n def MAP(): return map(int, input().split())\n def LIST(): return list(map(int, input().split()))\n INF=float('inf')\n \n N,M=MAP()\n nodes1=[[] for i in range(N)]\n nodes2=[[] for i in range(N)]\n for i in range(M):\n u,v=MAP()\n nodes1[u].append(v)\n nodes2[v].append(u)\n \n T=[]\n visited=[False]*N\n def rec1(cur):\n visited[cur]=True\n for nxt in nodes1[cur]:\n if not visited[nxt]:\n rec1(nxt)\n \n T.append(cur)\n \n rec1(0)\n \n visited=[False]*N\n group=[0]*N\n grpnum=1\n def rec2(cur):\n global grpnum\n group[cur]=grpnum\n visited[cur]=True\n for nxt in nodes2[cur]:\n if not visited[nxt]:\n rec2(nxt)\n return\n grpnum+=1\n return\n \n \n for u in reversed(T):\n if not visited[u]:\n rec2(u)\n \n Q=INT()\n for _ in range(Q):\n u,v=MAP()\n if group[u]==group[v]:\n print(1)\n else:\n print(0)\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 59 }, { "user_id": "u779483561", "problem_id": "p04044", "submission1_id": "s707354049-FL", "submission2_id": "s509352717", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, L = list(map(int,input().split()))\nS = [input() for _ in range(N)]\nprint(sorted(S))\n", "code2": "N, L = list(map(int,input().split()))\nS = [input() for i in range(N)]\nS.sort()\nfor str in S:\n print(str, end=\"\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1556780845", "date2": "1556781282", "bleu_score": "0.659056830267723", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 3\ndxx\nxxa\nxxd\n", "actual_output": "['dxx', 'xxa', 'xxd']\n", "expected_output": "dxxxxaxxd\n\n", "anno_code": ["N, L = list(map(int,input().split())) # (0): N=3, L=3\nS = [input() for _ in range(N)] # (1): S=['dxx', 'xxa', 'xxd']\nprint(sorted(S))\n"], "anno_status": [true], "diff_content": " N, L = list(map(int,input().split()))\n-S = [input() for _ in range(N)]\n-print(sorted(S))\n+S = [input() for i in range(N)]\n+S.sort()\n+for str in S:\n+ print(str, end=\"\")\n \n", "FL_content": "\n N, L = list(map(int,input().split()))\n S = [input() for _ in range(N)]\n-print(sorted(S))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 4 }, { "user_id": "u592365052", "problem_id": "p02408", "submission1_id": "s607964362-FL", "submission2_id": "s139163880", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef check(mlist, s):\n if len(mlist) == 13:\n return 0\n else:\n lack = []\n p = 1\n for i in mlist:\n for j in range(p, 14):\n if i == j:\n p = j + 1\n break\n else:\n lack.append(j) \n \n \n for j in lack:\n print(\"{} {}\".format(s, j))\n return 0\n\n\nn = int(input())\nSlist = []\nHlist = []\nClist = []\nDlist = []\n\nfor i in range(n):\n mark, num = input().split()\n num = int(num)\n\n if mark == 'S':\n Slist.append(num)\n elif mark == 'H':\n Hlist.append(num)\n elif mark == 'C':\n Clist.append(num)\n else:\n Dlist.append(num)\n \nSlist.sort()\nHlist.sort()\nClist.sort()\nDlist.sort()\n \ncheck(Slist, 'S')\ncheck(Hlist, 'H')\ncheck(Clist, 'C')\ncheck(Dlist, 'D')\n", "code2": "\ndef check(mlist, s):\n if len(mlist) == 13:\n return 0\n else:\n lack = []\n for i in range(1, 14):\n if not i in mlist:\n lack.append(i)\n \n \n for j in lack:\n print(\"{} {}\".format(s, j))\n return 0\n\n\nn = int(input())\nSlist = []\nHlist = []\nClist = []\nDlist = []\n\nfor i in range(n):\n mark, num = input().split()\n num = int(num)\n\n if mark == 'S':\n Slist.append(num)\n elif mark == 'H':\n Hlist.append(num)\n elif mark == 'C':\n Clist.append(num)\n else:\n Dlist.append(num)\n \nSlist.sort()\nHlist.sort()\nClist.sort()\nDlist.sort()\n \ncheck(Slist, 'S')\ncheck(Hlist, 'H')\ncheck(Clist, 'C')\ncheck(Dlist, 'D')\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556850701", "date2": "1556851243", "bleu_score": "0.8348867816437734", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1], "code1_test_score": 87, "total_score": 98, "input": "47\nS 10\nS 11\nS 12\nS 13\nH 1\nH 2\nS 6\nS 7\nS 8\nS 9\nH 6\nH 8\nH 9\nH 7\nH 11\nH 4\nH 5\nS 2\nS 3\nS 1\nS 5\nH 12\nH 13\nC 1\nC 2\nD 1\nD 2\nD 3\nD 4\nD 5\nD 6\nD 7\nC 3\nC 4\nC 5\nC 6\nC 7\nD 8\nC 9\nC 10\nC 11\nC 12\nD 9\nD 10\nD 11\nD 12\nD 13\n", "actual_output": "S 4\nH 3\nH 10\nC 8\n", "expected_output": "S 4\nH 3\nH 10\nC 8\nC 13\n\n", "anno_code": ["\ndef check(mlist, s): # (0): check=\n if len(mlist) == 13: # (306): NO CHANGE (377): NO CHANGE (448): NO CHANGE\n return 0\n else:\n lack = [] # (307): lack=[] (378): lack=[] (449): lack=[]\n p = 1 # (308): p=1 (379): p=1 (450): p=1\n for i in mlist: # (309): i=1 (314): i=2 ... (509): NO CHANGE\n for j in range(p, 14): # (310): j=1 (315): j=2 ... (505): j=12\n if i == j: # (311): NO CHANGE (316): NO CHANGE ... (506): NO CHANGE\n p = j + 1 # (312): p=2 (317): p=3 ... (507): p=13\n break # (313): NO CHANGE (318): NO CHANGE ... (508): NO CHANGE\n else:\n lack.append(j) # (327): lack=[4] (393): lack=[3] ... (489): lack=[8]\n \n \n for j in lack: # (373): j=4 (375): check=, n=47, Slist=[1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13], Hlist=[1, 2, 4, 5, 6, 7, 8, 9, 11, 12, 13], Clist=[1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12], Dlist=[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13], i=46, mark=D, num=13 ... (512): check=, n=47, Slist=[1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13], Hlist=[1, 2, 4, 5, 6, 7, 8, 9, 11, 12, 13], Clist=[1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12], Dlist=[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13], i=46, mark=D, num=13\n print(\"{} {}\".format(s, j)) # (374): NO CHANGE (443): NO CHANGE ... (511): NO CHANGE\n return 0\n\n\nn = int(input()) # (1): n=47\nSlist = [] # (2): Slist=[]\nHlist = [] # (3): Hlist=[]\nClist = [] # (4): Clist=[]\nDlist = [] # (5): Dlist=[]\n\nfor i in range(n): # (6): i=0 (11): i=1 ... (300): NO CHANGE\n mark, num = input().split() # (7): mark=S, num=10 (12): num=11 ... (294): num=13\n num = int(num) # (8): num=10 (13): num=11 ... (295): num=13\n\n if mark == 'S': # (9): NO CHANGE (14): NO CHANGE ... (296): NO CHANGE\n Slist.append(num) # (10): Slist=[10] (15): Slist=[10, 11] ... (119): Slist=[10, 11, 12, 13, 6, 7, 8, 9, 2, 3, 1, 5]\n elif mark == 'H': # (30): NO CHANGE (36): NO CHANGE ... (297): NO CHANGE\n Hlist.append(num) # (31): Hlist=[1] (37): Hlist=[1, 2] ... (131): Hlist=[1, 2, 6, 8, 9, 7, 11, 4, 5, 12, 13]\n elif mark == 'C': # (137): NO CHANGE (144): NO CHANGE ... (298): NO CHANGE\n Clist.append(num) # (138): Clist=[1] (145): Clist=[1, 2] ... (264): Clist=[1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12]\n else:\n Dlist.append(num) # (152): Dlist=[1] (159): Dlist=[1, 2] ... (299): Dlist=[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]\n \nSlist.sort() # (301): Slist=[1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13]\nHlist.sort() # (302): Hlist=[1, 2, 4, 5, 6, 7, 8, 9, 11, 12, 13]\nClist.sort() # (303): NO CHANGE\nDlist.sort() # (304): NO CHANGE\n \ncheck(Slist, 'S') # (305): mlist=[1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13], s=S\ncheck(Hlist, 'H') # (376): mlist=[1, 2, 4, 5, 6, 7, 8, 9, 11, 12, 13], s=H\ncheck(Clist, 'C') # (447): mlist=[1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12], s=C\ncheck(Dlist, 'D') # (513): mlist=[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13], s=D\n"], "anno_status": [false], "diff_content": " \n def check(mlist, s):\n if len(mlist) == 13:\n return 0\n else:\n lack = []\n- p = 1\n- for i in mlist:\n- for j in range(p, 14):\n- if i == j:\n- p = j + 1\n- break\n- else:\n- lack.append(j) \n+ for i in range(1, 14):\n+ if not i in mlist:\n+ lack.append(i)\n \n \n for j in lack:\n print(\"{} {}\".format(s, j))\n return 0\n \n \n n = int(input())\n Slist = []\n Hlist = []\n Clist = []\n Dlist = []\n \n for i in range(n):\n mark, num = input().split()\n num = int(num)\n \n if mark == 'S':\n Slist.append(num)\n elif mark == 'H':\n Hlist.append(num)\n elif mark == 'C':\n Clist.append(num)\n else:\n Dlist.append(num)\n \n Slist.sort()\n Hlist.sort()\n Clist.sort()\n Dlist.sort()\n \n check(Slist, 'S')\n check(Hlist, 'H')\n check(Clist, 'C')\n check(Dlist, 'D')\n \n", "FL_content": "\n \n def check(mlist, s):\n if len(mlist) == 13:\n return 0\n else:\n lack = []\n p = 1\n for i in mlist:\n for j in range(p, 14):\n if i == j:\n p = j + 1\n break\n else:\n lack.append(j) \n \n \n for j in lack:\n print(\"{} {}\".format(s, j))\n return 0\n \n \n n = int(input())\n Slist = []\n Hlist = []\n Clist = []\n Dlist = []\n \n for i in range(n):\n mark, num = input().split()\n num = int(num)\n \n if mark == 'S':\n Slist.append(num)\n elif mark == 'H':\n Hlist.append(num)\n elif mark == 'C':\n Clist.append(num)\n else:\n Dlist.append(num)\n \n Slist.sort()\n Hlist.sort()\n Clist.sort()\n Dlist.sort()\n \n check(Slist, 'S')\n check(Hlist, 'H')\n check(Clist, 'C')\n check(Dlist, 'D')\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 50 }, { "user_id": "u572142121", "problem_id": "p02616", "submission1_id": "s347843726-FL", "submission2_id": "s706224064", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K=map(int, input().split())\nA=list(map(int, input().split()))\nD=[]\nzcnt,scnt,fcnt=0,0,0\nfor i in A:\n if i==0:\n zcnt+=1\n D.append((i,0))\n elif i>0:\n D.append((i,0))\n scnt+=1\n else:\n D.append((-i,1))\n fcnt+=1\nD=D[::-1]\nmod=10**9+7\nans=1\nseihu=0\nf,s,z=fcnt,scnt,zcnt\nX,Y,Z=[],[],[]\nfor i in range(K):\n ans*=D[i][0]\n ans%=mod\n seihu+=D[i][1]\n if D[i][0]!=0 and D[i][1]==1:\n fcnt-=1\n Y.append(-D[i][0])\n elif D[i][0]!=0 and D[i][1]==0:\n scnt-=1\n X.append(D[i][0])\n else:\n zcnt-=1\nF=D[K:]\nif seihu%2==0:\n print(ans)\nelse:\n C=[]\n if len(X)>0 and fcnt>0:\n \n for a,b in F:\n if b==1:\n g=-a\n break\n h=(ans*(pow(X[-1],mod-2,mod))*g)%mod\n C.append(h)\n if len(Y)>0 and scnt>0:\n \n for a,b in F:\n if b==0:\n g=a\n break\n h=(ans*(pow(Y[-1],mod-2,mod))*g)%mod\n C.append(h)\n if zcnt>0:\n C.append(0)\n if len(C)==0:\n ans=1\n D=D[::-1]\n for i in range(K):\n ans*=(-D[i][0])\n ans%=mod\n print(ans)\n else:\n print(max(C))", "code2": "N,K=map(int, input().split())\nA=list(map(int, input().split()))\nD,E=[],[]\nzcnt,scnt,fcnt=0,0,0\nfor i in A:\n if i==0:\n zcnt+=1\n D.append(0)\n elif i>0:\n D.append(i)\n scnt+=1\n else:\n E.append(i)\n fcnt+=1\nmod=10**9+7\nans=1\n\nif K==N:\n for i in A:\n ans*=i\n ans%=mod\n print(ans)\n exit()\n\nif K%2==1 and max(A)<0:\n A=sorted(A)[::-1]\n for i in range(K):\n ans*=A[i]\n ans%=mod\n print(ans)\n exit()\n\nif K>scnt+fcnt:\n print(0)\n exit()\nD,E=sorted(D)[::-1],sorted(E)\n\nans=1\ncnt=0\na,b=0,0\nwhile K-cnt>1:\n if a+1<=len(D)-1 and b+1<=len(E)-1:\n d,e=D[a]*D[a+1],E[b]*E[b+1]\n if d>e:\n ans*=D[a]\n a+=1\n cnt+=1\n ans%=mod\n else:\n ans*=e\n b+=2 \n ans%=mod\n cnt+=2\n elif a+1<=len(D)-1:\n d=D[a]*D[a+1]\n ans*=D[a]\n a+=1\n cnt+=1\n ans%=mod\n elif b+1<=len(E)-1:\n e=E[b]*E[b+1]\n ans*=e\n b+=2\n cnt+=2\n ans%=mod\n\nif K-cnt==1:\n Z=[]\n if a!=scnt:\n Z.append(D[a])\n if b!=fcnt:\n Z.append(E[-1])\n if 0 in A:\n Z.append(0)\n ans*=max(Z)\n ans%=mod\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594025802", "date2": "1596186960", "bleu_score": "0.639212226579333", "code1_test_status": [0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1], "code1_test_score": 25, "total_score": 104, "input": "10 2\n1000000000 100001000 10000000 1000000 100000 10000 1000 100 10 1\n", "actual_output": "10\n", "expected_output": "299993007\n\n", "anno_code": ["N,K=map(int, input().split()) # (0): N=10, K=2\nA=list(map(int, input().split())) # (1): A=[1000000000, 100001000, 10000000, 1000000, 100000, 10000, 1000, 100, 10, 1]\nD=[] # (2): D=[]\nzcnt,scnt,fcnt=0,0,0 # (3): zcnt=0, scnt=0, fcnt=0\nfor i in A: # (4): i=1000000000 (9): i=100001000 ... (54): NO CHANGE\n if i==0: # (5): NO CHANGE (10): NO CHANGE ... (50): NO CHANGE\n zcnt+=1\n D.append((i,0))\n elif i>0: # (6): NO CHANGE (11): NO CHANGE ... (51): NO CHANGE\n D.append((i,0)) # (7): D=[(1000000000, 0)] (12): D=[(1000000000, 0), (100001000, 0)] ... (52): D=[(1000000000, 0), (100001000, 0), (10000000, 0), (1000000, 0), (100000, 0), (10000, 0), (1000, 0), (100, 0), (10, 0), (1, 0)]\n scnt+=1 # (8): scnt=1 (13): scnt=2 ... (53): scnt=10\n else:\n D.append((-i,1))\n fcnt+=1\nD=D[::-1] # (55): D=[(1, 0), (10, 0), (100, 0), (1000, 0), (10000, 0), (100000, 0), (1000000, 0), (10000000, 0), (100001000, 0), (1000000000, 0)]\nmod=10**9+7 # (56): mod=1000000007\nans=1 # (57): ans=1\nseihu=0 # (58): seihu=0\nf,s,z=fcnt,scnt,zcnt # (59): f=0, s=10, z=0\nX,Y,Z=[],[],[] # (60): X=[], Y=[], Z=[]\nfor i in range(K): # (61): i=0 (69): i=1 (77): NO CHANGE\n ans*=D[i][0] # (62): NO CHANGE (70): ans=10\n ans%=mod # (63): NO CHANGE (71): NO CHANGE\n seihu+=D[i][1] # (64): NO CHANGE (72): NO CHANGE\n if D[i][0]!=0 and D[i][1]==1: # (65): NO CHANGE (73): NO CHANGE\n fcnt-=1\n Y.append(-D[i][0])\n elif D[i][0]!=0 and D[i][1]==0: # (66): NO CHANGE (74): NO CHANGE\n scnt-=1 # (67): scnt=9 (75): scnt=8\n X.append(D[i][0]) # (68): X=[1] (76): X=[1, 10]\n else:\n zcnt-=1\nF=D[K:] # (78): F=[(100, 0), (1000, 0), (10000, 0), (100000, 0), (1000000, 0), (10000000, 0), (100001000, 0), (1000000000, 0)]\nif seihu%2==0: # (79): NO CHANGE\n print(ans)\nelse:\n C=[]\n if len(X)>0 and fcnt>0:\n \n for a,b in F:\n if b==1:\n g=-a\n break\n h=(ans*(pow(X[-1],mod-2,mod))*g)%mod\n C.append(h)\n if len(Y)>0 and scnt>0:\n \n for a,b in F:\n if b==0:\n g=a\n break\n h=(ans*(pow(Y[-1],mod-2,mod))*g)%mod\n C.append(h)\n if zcnt>0:\n C.append(0)\n if len(C)==0:\n ans=1\n D=D[::-1]\n for i in range(K):\n ans*=(-D[i][0])\n ans%=mod\n print(ans)\n else:\n print(max(C))"], "anno_status": [false], "diff_content": " N,K=map(int, input().split())\n A=list(map(int, input().split()))\n-D=[]\n+D,E=[],[]\n zcnt,scnt,fcnt=0,0,0\n for i in A:\n if i==0:\n zcnt+=1\n- D.append((i,0))\n+ D.append(0)\n elif i>0:\n- D.append((i,0))\n+ D.append(i)\n scnt+=1\n else:\n- D.append((-i,1))\n+ E.append(i)\n fcnt+=1\n-D=D[::-1]\n mod=10**9+7\n ans=1\n-seihu=0\n-f,s,z=fcnt,scnt,zcnt\n-X,Y,Z=[],[],[]\n-for i in range(K):\n- ans*=D[i][0]\n- ans%=mod\n- seihu+=D[i][1]\n- if D[i][0]!=0 and D[i][1]==1:\n- fcnt-=1\n- Y.append(-D[i][0])\n- elif D[i][0]!=0 and D[i][1]==0:\n- scnt-=1\n- X.append(D[i][0])\n- else:\n- zcnt-=1\n-F=D[K:]\n-if seihu%2==0:\n+\n+if K==N:\n+ for i in A:\n+ ans*=i\n+ ans%=mod\n print(ans)\n-else:\n- C=[]\n- if len(X)>0 and fcnt>0:\n- \n- for a,b in F:\n- if b==1:\n- g=-a\n- break\n- h=(ans*(pow(X[-1],mod-2,mod))*g)%mod\n- C.append(h)\n- if len(Y)>0 and scnt>0:\n- \n- for a,b in F:\n- if b==0:\n- g=a\n- break\n- h=(ans*(pow(Y[-1],mod-2,mod))*g)%mod\n- C.append(h)\n- if zcnt>0:\n- C.append(0)\n- if len(C)==0:\n- ans=1\n- D=D[::-1]\n- for i in range(K):\n- ans*=(-D[i][0])\n+ exit()\n+\n+if K%2==1 and max(A)<0:\n+ A=sorted(A)[::-1]\n+ for i in range(K):\n+ ans*=A[i]\n+ ans%=mod\n+ print(ans)\n+ exit()\n+\n+if K>scnt+fcnt:\n+ print(0)\n+ exit()\n+D,E=sorted(D)[::-1],sorted(E)\n+\n+ans=1\n+cnt=0\n+a,b=0,0\n+while K-cnt>1:\n+ if a+1<=len(D)-1 and b+1<=len(E)-1:\n+ d,e=D[a]*D[a+1],E[b]*E[b+1]\n+ if d>e:\n+ ans*=D[a]\n+ a+=1\n+ cnt+=1\n ans%=mod\n- print(ans)\n- else:\n- print(max(C))\n+ else:\n+ ans*=e\n+ b+=2 \n+ ans%=mod\n+ cnt+=2\n+ elif a+1<=len(D)-1:\n+ d=D[a]*D[a+1]\n+ ans*=D[a]\n+ a+=1\n+ cnt+=1\n+ ans%=mod\n+ elif b+1<=len(E)-1:\n+ e=E[b]*E[b+1]\n+ ans*=e\n+ b+=2\n+ cnt+=2\n+ ans%=mod\n+\n+if K-cnt==1:\n+ Z=[]\n+ if a!=scnt:\n+ Z.append(D[a])\n+ if b!=fcnt:\n+ Z.append(E[-1])\n+ if 0 in A:\n+ Z.append(0)\n+ ans*=max(Z)\n+ ans%=mod\n+print(ans)\n", "FL_content": "\n N,K=map(int, input().split())\n A=list(map(int, input().split()))\n D=[]\n zcnt,scnt,fcnt=0,0,0\n for i in A:\n if i==0:\n zcnt+=1\n D.append((i,0))\n elif i>0:\n D.append((i,0))\n scnt+=1\n else:\n D.append((-i,1))\n fcnt+=1\n D=D[::-1]\n mod=10**9+7\n ans=1\n seihu=0\n f,s,z=fcnt,scnt,zcnt\n X,Y,Z=[],[],[]\n for i in range(K):\n ans*=D[i][0]\n ans%=mod\n seihu+=D[i][1]\n if D[i][0]!=0 and D[i][1]==1:\n fcnt-=1\n Y.append(-D[i][0])\n elif D[i][0]!=0 and D[i][1]==0:\n scnt-=1\n X.append(D[i][0])\n else:\n zcnt-=1\n F=D[K:]\n if seihu%2==0:\n print(ans)\n else:\n C=[]\n if len(X)>0 and fcnt>0:\n \n for a,b in F:\n if b==1:\n g=-a\n break\n h=(ans*(pow(X[-1],mod-2,mod))*g)%mod\n C.append(h)\n if len(Y)>0 and scnt>0:\n \n for a,b in F:\n if b==0:\n g=a\n break\n h=(ans*(pow(Y[-1],mod-2,mod))*g)%mod\n C.append(h)\n if zcnt>0:\n C.append(0)\n if len(C)==0:\n ans=1\n D=D[::-1]\n for i in range(K):\n ans*=(-D[i][0])\n ans%=mod\n print(ans)\n else:\n print(max(C))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 64 }, { "user_id": "u796563423", "problem_id": "p03712", "submission1_id": "s954662102-FL", "submission2_id": "s312032080", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b=map(int,input().split())\ns=[]\nfor i in range(a):\n s.append(input())\nprint(\"*\"*(b+2))\nfor i in range(a):\n print(\"*\",end=\"\")\n print(s[i],end=\"\")\n print(\"*\")\nprint(\"*\"*(b+2))", "code2": "a,b=map(int,input().split())\ns=[]\nfor i in range(a):\n s.append(input())\nprint(\"\nfor i in range(a):\n print(\"\n print(s[i],end=\"\")\n print(\"\nprint(\"", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599801312", "date2": "1599801349", "bleu_score": "0.7955708789074227", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "1 3\nw\n", "actual_output": "*****\n*w*\n*****\n", "expected_output": "#####\n#w#\n#####\n\n", "anno_code": ["a,b=map(int,input().split()) # (0): a=1, b=3\ns=[] # (1): s=[]\nfor i in range(a): # (2): i=0 (4): NO CHANGE\n s.append(input()) # (3): s=['w']\nprint(\"*\"*(b+2)) # (5): NO CHANGE\nfor i in range(a): # (6): NO CHANGE (10): NO CHANGE\n print(\"*\",end=\"\") # (7): NO CHANGE\n print(s[i],end=\"\") # (8): NO CHANGE\n print(\"*\") # (9): NO CHANGE\nprint(\"*\"*(b+2))"], "anno_status": [true], "diff_content": " a,b=map(int,input().split())\n s=[]\n for i in range(a):\n s.append(input())\n-print(\"*\"*(b+2))\n+print(\"\n for i in range(a):\n- print(\"*\",end=\"\")\n+ print(\"\n print(s[i],end=\"\")\n- print(\"*\")\n-print(\"*\"*(b+2))\n+ print(\"\n+print(\"\n", "FL_content": "\n a,b=map(int,input().split())\n s=[]\n for i in range(a):\n s.append(input())\n print(\"*\"*(b+2))\n for i in range(a):\n print(\"*\",end=\"\")\n- print(s[i],end=\"\")\n print(\"*\")\n print(\"*\"*(b+2))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u284102701", "problem_id": "p03617", "submission1_id": "s608965143-FL", "submission2_id": "s692880439", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = input().split(\" \")\nb = list(map(int, a))\nc = int(input())\nans = 0\nr = min([b[0] * 4, b[1] * 2, b[2]])\nr2 = min([b[0]*8,b[1]*4,b[2]*2, b[3]])\n\n\n\n\nif c%2==1:\n\tans=r+((c-1)/2)*r2\nelse :\n\tans=c\nprint(int(ans))\n", "code2": "b=list(map(int,input().split()))\nc = int(input())\nans = 0\nr = min([b[0]*4, b[1]*2, b[2]])\nr2 = min([b[0]*8,b[1]*4,b[2]*2, b[3]])\n\n\n\n\n\n\nif c%2==1:\n\tprint(((c-1)\nelse :\n\tprint((c\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1518711253", "date2": "1518711463", "bleu_score": "0.7289024888043498", "code1_test_status": [1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 64, "total_score": 104, "input": "3065533 854010 10742875 54687163\n27604\n", "actual_output": "27604\n", "expected_output": "47148184080\n\n", "anno_code": ["a = input().split(\" \") # (0): a=['3065533', '854010', '10742875', '54687163']\nb = list(map(int, a)) # (1): b=[3065533, 854010, 10742875, 54687163]\nc = int(input()) # (2): c=27604\nans = 0 # (3): ans=0\nr = min([b[0] * 4, b[1] * 2, b[2]]) # (4): r=1708020\nr2 = min([b[0]*8,b[1]*4,b[2]*2, b[3]]) # (5): r2=3416040\n\n\n\n\nif c%2==1: # (6): NO CHANGE\n\tans=r+((c-1)/2)*r2\nelse :\n\tans=c # (7): ans=27604\nprint(int(ans))\n"], "anno_status": [true], "diff_content": "-a = input().split(\" \")\n-b = list(map(int, a))\n+b=list(map(int,input().split()))\n c = int(input())\n ans = 0\n-r = min([b[0] * 4, b[1] * 2, b[2]])\n+r = min([b[0]*4, b[1]*2, b[2]])\n r2 = min([b[0]*8,b[1]*4,b[2]*2, b[3]])\n \n \n \n \n+\n+\n if c%2==1:\n-\tans=r+((c-1)/2)*r2\n+\tprint(((c-1)\n else :\n-\tans=c\n-print(int(ans))\n+\tprint((c\n \n", "FL_content": "\n a = input().split(\" \")\n b = list(map(int, a))\n c = int(input())\n ans = 0\n r = min([b[0] * 4, b[1] * 2, b[2]])\n r2 = min([b[0]*8,b[1]*4,b[2]*2, b[3]])\n \n \n \n \n-if c%2==1:\n-\tans=r+((c-1)/2)*r2\n-else :\n-\tans=c\n print(int(ans))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u052332717", "problem_id": "p03945", "submission1_id": "s678622806-FL", "submission2_id": "s578629302", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\ns = S[0:1]\nans = 0\n\nfor i in range(1,len(S)):\n if s != S[i:i+1]:\n ans += 1\n s = S[i:i+1]\n print(s)\n\nprint(ans)\n ", "code2": "S = input()\ns = S[0:1]\nans = 0\n\nfor i in range(1,len(S)):\n if s != S[i:i+1]:\n ans += 1\n s = S[i:i+1]\n\nprint(ans)\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1546285404", "date2": "1546285428", "bleu_score": "0.8758039178272607", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 1, "total_score": 103, "input": "ZVXXBDABWB\n", "actual_output": "V\nX\nB\nD\nA\nB\nW\nB\n8\n", "expected_output": "8\n\n", "anno_code": ["S = input() # (0): S=ZVXXBDABWB\ns = S[0:1] # (1): s=Z\nans = 0 # (2): ans=0\n\nfor i in range(1,len(S)): # (3): i=1 (8): i=2 ... (45): NO CHANGE\n if s != S[i:i+1]: # (4): NO CHANGE (9): NO CHANGE ... (41): NO CHANGE\n ans += 1 # (5): ans=1 (10): ans=2 ... (42): ans=8\n s = S[i:i+1] # (6): s=V (11): s=X ... (43): s=B\n print(s) # (7): NO CHANGE (12): NO CHANGE ... (44): NO CHANGE\n\nprint(ans)\n "], "anno_status": [true], "diff_content": " S = input()\n s = S[0:1]\n ans = 0\n \n for i in range(1,len(S)):\n if s != S[i:i+1]:\n ans += 1\n s = S[i:i+1]\n- print(s)\n \n print(ans)\n \n", "FL_content": "\n S = input()\n s = S[0:1]\n ans = 0\n \n for i in range(1,len(S)):\n if s != S[i:i+1]:\n ans += 1\n s = S[i:i+1]\n- print(s)\n \n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u634461820", "problem_id": "p02549", "submission1_id": "s252920839-FL", "submission2_id": "s047746430", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nMAX_INT = int(10e12)\nMIN_INT = -MAX_INT\nmod = 998244353\nsys.setrecursionlimit(1000000)\ndef IL(): return list(map(int,input().split()))\ndef SL(): return input().split()\ndef I(): return int(sys.stdin.readline())\ndef S(): return input()\n\nN,K = IL()\nlr = [IL() for i in range(K)]\nlr.sort()\n\ndp = [0]*(N+1)\ndp[1] = 1\ndata = [0]*(N+1)\ndata[1] = 1\n\nfor i in range(2,N+1):\n tmp = 0\n for l,r in lr:\n if tmp >= r:\n continue\n elif l <= tmp < r:\n l = tmp+1\n if 1 <= i-l:\n dp[i] += data[i-l] - data[max(i-r-1, 0)]\n data[i] = (data[i-1] + dp[i]) %mod\nprint(dp[N])", "code2": "import sys\nMAX_INT = int(10e12)\nMIN_INT = -MAX_INT\nmod = 998244353\nsys.setrecursionlimit(1000000)\ndef IL(): return list(map(int,input().split()))\ndef SL(): return input().split()\ndef I(): return int(sys.stdin.readline())\ndef S(): return input()\n\nN,K = IL()\nlr = [IL() for i in range(K)]\nlr.sort()\n\ndp = [0]*(N+1)\ndp[1] = 1\ndata = [0]*(N+1)\ndata[1] = 1\n\nfor i in range(2,N+1):\n tmp = 0\n for l,r in lr:\n if tmp >= r:\n continue\n elif l <= tmp < r:\n l = tmp+1\n if 1 <= i-l:\n dp[i] += data[i-l] - data[max(i-r-1, 0)]\n data[i] = (data[i-1] + dp[i]) %mod\nprint(dp[N] %mod)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600546408", "date2": "1600546482", "bleu_score": "0.9902610991104045", "code1_test_status": [1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 81, "total_score": 102, "input": "60 3\n5 4\n2 6\n3 15\n", "actual_output": "-243878976\n", "expected_output": "754365377\n\n", "anno_code": ["import sys\nMAX_INT = int(10e12) # (0): MAX_INT=10000000000000\nMIN_INT = -MAX_INT # (1): MIN_INT=-10000000000000\nmod = 998244353 # (2): mod=998244353\nsys.setrecursionlimit(1000000) # (3): IL=, SL=, I=, S=\ndef IL(): return list(map(int,input().split()))\ndef SL(): return input().split()\ndef I(): return int(sys.stdin.readline())\ndef S(): return input()\n\nN,K = IL() # (4): N=60, K=3\nlr = [IL() for i in range(K)] # (5): lr\nlr.sort() # (6): lr\n\ndp = [0]*(N+1) # (7): dp=[0, 0, ..., 0, 0]\ndp[1] = 1 # (8): dp=[0, 1, ..., 0, 0]\ndata = [0]*(N+1) # (9): data=[0, 0, ..., 0, 0]\ndata[1] = 1 # (10): data=[0, 1, ..., 0, 0]\n\nfor i in range(2,N+1): # (11): i=2 (27): i=3 ... (1125): NO CHANGE\n tmp = 0 # (12): tmp=0 (28): NO CHANGE ... (1107): NO CHANGE\n for l,r in lr: # (13): l=2, r=6 (17): l=3, r=15 ... (1123): NO CHANGE\n if tmp >= r: # (14): NO CHANGE (18): NO CHANGE ... (1119): NO CHANGE\n continue\n elif l <= tmp < r: # (15): NO CHANGE (19): NO CHANGE ... (1120): NO CHANGE\n l = tmp+1\n if 1 <= i-l: # (16): NO CHANGE (20): NO CHANGE ... (1121): NO CHANGE\n dp[i] += data[i-l] - data[max(i-r-1, 0)] # (33): dp=[0, 1, ..., 0, 0] (50): dp=[0, 1, ..., 0, 0] ... (1122): NO CHANGE\n data[i] = (data[i-1] + dp[i]) %mod # (26): data=[0, 1, ..., 0, 0] (43): data=[0, 1, ..., 0, 0] ... (1124): data=[0, 1, ..., 862962990, 619084014]\nprint(dp[N])"], "anno_status": [false], "diff_content": " import sys\n MAX_INT = int(10e12)\n MIN_INT = -MAX_INT\n mod = 998244353\n sys.setrecursionlimit(1000000)\n def IL(): return list(map(int,input().split()))\n def SL(): return input().split()\n def I(): return int(sys.stdin.readline())\n def S(): return input()\n \n N,K = IL()\n lr = [IL() for i in range(K)]\n lr.sort()\n \n dp = [0]*(N+1)\n dp[1] = 1\n data = [0]*(N+1)\n data[1] = 1\n \n for i in range(2,N+1):\n tmp = 0\n for l,r in lr:\n if tmp >= r:\n continue\n elif l <= tmp < r:\n l = tmp+1\n if 1 <= i-l:\n dp[i] += data[i-l] - data[max(i-r-1, 0)]\n data[i] = (data[i-1] + dp[i]) %mod\n-print(dp[N])\n+print(dp[N] %mod)\n", "FL_content": "\n import sys\n MAX_INT = int(10e12)\n MIN_INT = -MAX_INT\n mod = 998244353\n sys.setrecursionlimit(1000000)\n def IL(): return list(map(int,input().split()))\n def SL(): return input().split()\n def I(): return int(sys.stdin.readline())\n def S(): return input()\n \n N,K = IL()\n lr = [IL() for i in range(K)]\n lr.sort()\n \n dp = [0]*(N+1)\n dp[1] = 1\n data = [0]*(N+1)\n data[1] = 1\n \n for i in range(2,N+1):\n tmp = 0\n for l,r in lr:\n if tmp >= r:\n continue\n elif l <= tmp < r:\n- l = tmp+1\n if 1 <= i-l:\n dp[i] += data[i-l] - data[max(i-r-1, 0)]\n data[i] = (data[i-1] + dp[i]) %mod\n print(dp[N])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 30 }, { "user_id": "u851125702", "problem_id": "p02549", "submission1_id": "s795327876-FL", "submission2_id": "s309685160", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K=map(int,input().split())\nx=998244353\nS=[]\nfor i in range(K):\n l,r=map(int,input().split())\n S.append(l)\n S.append(r)\nS=list(set(S))\ndp=[0 for i in range(N)]\nprint(S)\nfor i in range(N):\n for j in range(len(S)):\n if(i-S[j]>0):\n dp[i]+=dp[i-S[j]]\n dp[i]=dp[i]%x\n elif(i-S[j]==0):\n dp[i]+=1\n dp[i]=dp[i]%x\nprint(dp)", "code2": "N,K=map(int,input().split())\nx=998244353\ndp=[0 for i in range(N)]\nsdp=[0 for i in range(N)]\nL=[]\nR=[]\ndp[0]=1\nsdp[0]=1\nfor i in range(K):\n l,r=map(int,input().split())\n L.append(l)\n R.append(r) \nfor i in range(1,N):\n for j in range(K):\n dp[i]+=(sdp[max(i-L[j],-1)]-sdp[max(i-R[j]-1,-1)])\n dp[i]%=x\n sdp[i]=(sdp[i-1]+dp[i])%x\nprint(dp[-1]%x)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600580151", "date2": "1600630368", "bleu_score": "0.6685329123310874", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "10 2\n1 2\n5 4\n", "actual_output": "[1, 2, 4, 5]\n[0, 1, 2, 3, 6, 11, 20, 36, 65, 118]\n", "expected_output": "55\n\n", "anno_code": ["N,K=map(int,input().split()) # (0): N=10, K=2\nx=998244353 # (1): x=998244353\nS=[] # (2): S=[]\nfor i in range(K): # (3): i=0 (7): i=1 (11): NO CHANGE\n l,r=map(int,input().split()) # (4): l=1, r=2 (8): l=5, r=4\n S.append(l) # (5): S=[1] (9): S=[1, 2, 5]\n S.append(r) # (6): S=[1, 2] (10): S=[1, 2, 5, 4]\nS=list(set(S)) # (12): S=[1, 2, 4, 5]\ndp=[0 for i in range(N)] # (13): dp=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nprint(S) # (14): NO CHANGE\nfor i in range(N): # (15): i=0 (29): i=1 ... (187): NO CHANGE\n for j in range(len(S)): # (16): j=0 (19): j=1 ... (186): NO CHANGE\n if(i-S[j]>0): # (17): NO CHANGE (20): NO CHANGE ... (183): NO CHANGE\n dp[i]+=dp[i-S[j]] # (48): dp=[0, 1, 1, 0, 0, 0, 0, 0, 0, 0] (65): dp=[0, 1, 2, 2, 0, 0, 0, 0, 0, 0] ... (184): dp=[0, 1, 2, 3, 6, 11, 20, 36, 65, 118]\n dp[i]=dp[i]%x # (49): NO CHANGE (66): NO CHANGE ... (185): NO CHANGE\n elif(i-S[j]==0): # (18): NO CHANGE (21): NO CHANGE ... (111): NO CHANGE\n dp[i]+=1 # (33): dp=[0, 1, 0, 0, 0, 0, 0, 0, 0, 0] (53): dp=[0, 1, 2, 0, 0, 0, 0, 0, 0, 0] ... (112): dp=[0, 1, 2, 3, 6, 11, 0, 0, 0, 0]\n dp[i]=dp[i]%x # (34): NO CHANGE (54): NO CHANGE ... (113): NO CHANGE\nprint(dp)"], "anno_status": [true], "diff_content": " N,K=map(int,input().split())\n x=998244353\n-S=[]\n+dp=[0 for i in range(N)]\n+sdp=[0 for i in range(N)]\n+L=[]\n+R=[]\n+dp[0]=1\n+sdp[0]=1\n for i in range(K):\n l,r=map(int,input().split())\n- S.append(l)\n- S.append(r)\n-S=list(set(S))\n-dp=[0 for i in range(N)]\n-print(S)\n-for i in range(N):\n- for j in range(len(S)):\n- if(i-S[j]>0):\n- dp[i]+=dp[i-S[j]]\n- dp[i]=dp[i]%x\n- elif(i-S[j]==0):\n- dp[i]+=1\n- dp[i]=dp[i]%x\n-print(dp)\n+ L.append(l)\n+ R.append(r) \n+for i in range(1,N):\n+ for j in range(K):\n+ dp[i]+=(sdp[max(i-L[j],-1)]-sdp[max(i-R[j]-1,-1)])\n+ dp[i]%=x\n+ sdp[i]=(sdp[i-1]+dp[i])%x\n+print(dp[-1]%x)\n", "FL_content": "\n N,K=map(int,input().split())\n x=998244353\n S=[]\n for i in range(K):\n l,r=map(int,input().split())\n S.append(l)\n S.append(r)\n S=list(set(S))\n dp=[0 for i in range(N)]\n-print(S)\n for i in range(N):\n for j in range(len(S)):\n if(i-S[j]>0):\n dp[i]+=dp[i-S[j]]\n dp[i]=dp[i]%x\n elif(i-S[j]==0):\n dp[i]+=1\n dp[i]=dp[i]%x\n-print(dp)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u207056619", "problem_id": "p03769", "submission1_id": "s722743929-FL", "submission2_id": "s978255874", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nn = int(input())\nx = []\ny = []\nk = 1\nfor c in bin(n)[2 :][1 :]:\n x += [ k ]\n y += [ k ]\n k += 1\n if int(c):\n x = [ k ] + x\n y += [ k ]\n k += 1\nif not (x + y):\n x = [ 100 ]\nprint(len(x + y))\nprint(*(x + y))\n", "code2": "\nn = int(input())\nx = []\ny = []\nk = 1\nfor c in bin(n + 1)[2 :][1 :]:\n x += [ k ]\n y += [ k ]\n k += 1\n if int(c):\n x = [ k ] + x\n y += [ k ]\n k += 1\nprint(len(x + y))\nprint(*(x + y))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1501697741", "date2": "1501697820", "bleu_score": "0.8602188802096368", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 18, "input": "462\n", "actual_output": "26\n12 10 8 4 2 1 3 5 6 7 9 11 13 1 2 3 4 5 6 7 8 9 10 11 12 13\n", "expected_output": "28\n14 12 10 8 4 2 1 3 5 6 7 9 11 13 1 2 3 4 5 6 7 8 9 10 11 12 13 14\n\n", "anno_code": ["\nn = int(input()) # (0): n=462\nx = [] # (1): x=[]\ny = [] # (2): y=[]\nk = 1 # (3): k=1\nfor c in bin(n)[2 :][1 :]: # (4): c=1 (12): NO CHANGE ... (59): NO CHANGE\n x += [ k ] # (5): x=[1] (13): x=[2, 1, 3] ... (55): x=[12, 10, 8, 4, 2, 1, 3, 5, 6, 7, 9, 11, 13]\n y += [ k ] # (6): y=[1] (14): y=[1, 2, 3] ... (56): y=[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]\n k += 1 # (7): k=2 (15): k=4 ... (57): k=14\n if int(c): # (8): NO CHANGE (16): NO CHANGE ... (58): NO CHANGE\n x = [ k ] + x # (9): x=[2, 1] (17): x=[4, 2, 1, 3] ... (51): x=[12, 10, 8, 4, 2, 1, 3, 5, 6, 7, 9, 11]\n y += [ k ] # (10): y=[1, 2] (18): y=[1, 2, 3, 4] ... (52): y=[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]\n k += 1 # (11): k=3 (19): k=5 ... (53): k=13\nif not (x + y): # (60): NO CHANGE\n x = [ 100 ]\nprint(len(x + y)) # (61): NO CHANGE\nprint(*(x + y))\n"], "anno_status": [true], "diff_content": " \n n = int(input())\n x = []\n y = []\n k = 1\n-for c in bin(n)[2 :][1 :]:\n+for c in bin(n + 1)[2 :][1 :]:\n x += [ k ]\n y += [ k ]\n k += 1\n if int(c):\n x = [ k ] + x\n y += [ k ]\n k += 1\n-if not (x + y):\n- x = [ 100 ]\n print(len(x + y))\n print(*(x + y))\n \n", "FL_content": "\n \n n = int(input())\n x = []\n y = []\n k = 1\n for c in bin(n)[2 :][1 :]:\n x += [ k ]\n y += [ k ]\n k += 1\n if int(c):\n x = [ k ] + x\n y += [ k ]\n k += 1\n-if not (x + y):\n- x = [ 100 ]\n print(len(x + y))\n print(*(x + y))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u221886916", "problem_id": "p03172", "submission1_id": "s498801175-FL", "submission2_id": "s298693518", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nMOD = int(1e9)+7\n\n\ndef main():\n n, K = map(int, input().split())\n a = list(map(int, input().split()))\n\n \n dp = [[0]*(K+1) for i in range(n+1)]\n prefix = [[0]*(K+1) for i in range(n+1)]\n prefix[0] = [1]*(K+1)\n for i in range(1, n+1):\n for j in range(K+1):\n start = j - min(a[i-1], j)-1\n end = j\n dp[i][j] = prefix[i-1][end] - \\\n (prefix[i-1][start] if start >= 0 else 0)\n prefix[i][j] = (prefix[i][j-1] + dp[i][j]) % MOD\n\n print(dp[n][K])\n\n\nif __name__ == \"__main__\":\n main()\n", "code2": "\nMOD = int(1e9)+7\n\n\ndef main():\n n, K = map(int, input().split())\n a = list(map(int, input().split()))\n\n \n dp = [[0]*(K+1) for i in range(n+1)]\n prefix = [[0]*(K+1) for i in range(n+1)]\n prefix[0] = [1]*(K+1)\n for i in range(1, n+1):\n for j in range(K+1):\n start = j - min(a[i-1], j)-1\n end = j\n dp[i][j] = (prefix[i-1][end] - \\\n (prefix[i-1][start] if start >= 0 else 0))%MOD\n prefix[i][j] = (prefix[i][j-1] + dp[i][j]) % MOD\n\n print(dp[n][K]%MOD)\n\n\nif __name__ == \"__main__\":\n main()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589185040", "date2": "1589185119", "bleu_score": "0.974862844018034", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1], "code1_test_score": 88, "total_score": 103, "input": "4 101000\n101000 101100 101001 100000\n", "actual_output": "-133850588\n", "expected_output": "866149419\n\n", "anno_code": ["\nMOD = int(1e9)+7 # (0): MOD=1000000007\n\n\ndef main(): # (1): main=\n n, K = map(int, input().split())\n a = list(map(int, input().split()))\n\n \n dp = [[0]*(K+1) for i in range(n+1)]\n prefix = [[0]*(K+1) for i in range(n+1)]\n prefix[0] = [1]*(K+1)\n for i in range(1, n+1):\n for j in range(K+1):\n start = j - min(a[i-1], j)-1\n end = j\n dp[i][j] = prefix[i-1][end] - \\\n (prefix[i-1][start] if start >= 0 else 0)\n prefix[i][j] = (prefix[i][j-1] + dp[i][j]) % MOD\n\n print(dp[n][K])\n\n\nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " \n MOD = int(1e9)+7\n \n \n def main():\n n, K = map(int, input().split())\n a = list(map(int, input().split()))\n \n \n dp = [[0]*(K+1) for i in range(n+1)]\n prefix = [[0]*(K+1) for i in range(n+1)]\n prefix[0] = [1]*(K+1)\n for i in range(1, n+1):\n for j in range(K+1):\n start = j - min(a[i-1], j)-1\n end = j\n- dp[i][j] = prefix[i-1][end] - \\\n- (prefix[i-1][start] if start >= 0 else 0)\n+ dp[i][j] = (prefix[i-1][end] - \\\n+ (prefix[i-1][start] if start >= 0 else 0))%MOD\n prefix[i][j] = (prefix[i][j-1] + dp[i][j]) % MOD\n \n- print(dp[n][K])\n+ print(dp[n][K]%MOD)\n \n \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": "\n \n MOD = int(1e9)+7\n \n \n def main():\n n, K = map(int, input().split())\n a = list(map(int, input().split()))\n \n \n dp = [[0]*(K+1) for i in range(n+1)]\n prefix = [[0]*(K+1) for i in range(n+1)]\n prefix[0] = [1]*(K+1)\n for i in range(1, n+1):\n for j in range(K+1):\n start = j - min(a[i-1], j)-1\n end = j\n dp[i][j] = prefix[i-1][end] - \\\n (prefix[i-1][start] if start >= 0 else 0)\n prefix[i][j] = (prefix[i][j-1] + dp[i][j]) % MOD\n \n print(dp[n][K])\n \n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 26 }, { "user_id": "u765590009", "problem_id": "p03719", "submission1_id": "s845737433-FL", "submission2_id": "s506191230", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\na, b, c = map(int, input().split())\n\n\nif (c >= a) and (c <= b) :\n print(\"YES\")\nelse :\n print(\"NO\")", "code2": "\n\na, b, c = map(int, input().split())\n\n\nif (c >= a) and (c <= b) :\n print(\"Yes\")\nelse :\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558479315", "date2": "1558479353", "bleu_score": "0.9445864447947969", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 21, "input": "-1 4 -1\n", "actual_output": "YES\n", "expected_output": "Yes\n\n", "anno_code": ["\n\na, b, c = map(int, input().split()) # (0): a=-1, b=4, c=-1\n\n\nif (c >= a) and (c <= b) : # (1): NO CHANGE\n print(\"YES\")\nelse :\n print(\"NO\")"], "anno_status": [true], "diff_content": " \n \n a, b, c = map(int, input().split())\n \n \n if (c >= a) and (c <= b) :\n- print(\"YES\")\n+ print(\"Yes\")\n else :\n- print(\"NO\")\n+ print(\"No\")\n", "FL_content": "\n \n \n a, b, c = map(int, input().split())\n \n \n if (c >= a) and (c <= b) :\n- print(\"YES\")\n else :\n- print(\"NO\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u556589653", "problem_id": "p03437", "submission1_id": "s900241938-FL", "submission2_id": "s717122642", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X,Y = map(int,input().split())\nif Y%X == 0:\n print(-1)\nelse:\n print(X)\n", "code2": "X,Y=map(int,input().split())\nif X%Y!=0:\n print(X)\nelse:\n print(-1)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571772404", "date2": "1583076112", "bleu_score": "0.8326821565758437", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 24, "total_score": 25, "input": "-6 12\n", "actual_output": "-1\n", "expected_output": "-6\n\n", "anno_code": ["X,Y = map(int,input().split()) # (0): X=-6, Y=12\nif Y%X == 0: # (1): NO CHANGE\n print(-1)\nelse:\n print(X)\n"], "anno_status": [true], "diff_content": "-X,Y = map(int,input().split())\n-if Y%X == 0:\n- print(-1)\n+X,Y=map(int,input().split())\n+if X%Y!=0:\n+ print(X)\n else:\n- print(X)\n+ print(-1)\n \n", "FL_content": "\n X,Y = map(int,input().split())\n-if Y%X == 0:\n print(-1)\n else:\n print(X)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u724742135", "problem_id": "p03643", "submission1_id": "s117886838-FL", "submission2_id": "s062019291", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\nn = stdin.readline().rstrip()\nprint('A'+n)", "code2": "from sys import stdin\nn = stdin.readline().rstrip()\nprint('ABC'+n)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1551838877", "date2": "1551838904", "bleu_score": "0.9452425713908253", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "789\n", "actual_output": "A789\n", "expected_output": "ABC789\n\n", "anno_code": ["from sys import stdin\nn = stdin.readline().rstrip() # (0): n=789\nprint('A'+n)"], "anno_status": [true], "diff_content": " from sys import stdin\n n = stdin.readline().rstrip()\n-print('A'+n)\n+print('ABC'+n)\n", "FL_content": "\n from sys import stdin\n n = stdin.readline().rstrip()\n-print('A'+n)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 3 }, { "user_id": "u491462774", "problem_id": "p02916", "submission1_id": "s670450263-FL", "submission2_id": "s534131457", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\nc = list(map(int,input().split()))\nsum_satisfaction = sum(b)\n\nfor i in range(1,n):\n if(i < n-1 and a[i] == a[i-1] + 1 ):\n sum_satisfaction = sum_satisfaction + c[i]\nprint(sum_satisfaction)", "code2": "n = int(input())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\nc = list(map(int,input().split()))\nsum_satisfaction = sum(b)\n\nfor i in range(0,n-1):\n if(a[i+1] - a[i] == 1 ):\n sum_satisfaction = sum_satisfaction + c[a[i]-1]\n \nprint(sum_satisfaction)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591320700", "date2": "1591322081", "bleu_score": "0.9207782553072054", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1], "code1_test_score": 77, "total_score": 103, "input": "3\n3 1 2\n0 5 3\n3 6\n", "actual_output": "8\n", "expected_output": "11\n\n", "anno_code": ["n = int(input()) # (0): n=3\na = list(map(int,input().split())) # (1): a=[3, 1, 2]\nb = list(map(int,input().split())) # (2): b=[0, 5, 3]\nc = list(map(int,input().split())) # (3): c=[3, 6]\nsum_satisfaction = sum(b) # (4): sum_satisfaction=8\n\nfor i in range(1,n): # (5): i=1 (7): i=2 (9): NO CHANGE\n if(i < n-1 and a[i] == a[i-1] + 1 ): # (6): NO CHANGE (8): NO CHANGE\n sum_satisfaction = sum_satisfaction + c[i]\nprint(sum_satisfaction)"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int,input().split()))\n b = list(map(int,input().split()))\n c = list(map(int,input().split()))\n sum_satisfaction = sum(b)\n \n-for i in range(1,n):\n- if(i < n-1 and a[i] == a[i-1] + 1 ):\n- sum_satisfaction = sum_satisfaction + c[i]\n+for i in range(0,n-1):\n+ if(a[i+1] - a[i] == 1 ):\n+ sum_satisfaction = sum_satisfaction + c[a[i]-1]\n+ \n print(sum_satisfaction)\n", "FL_content": "\n n = int(input())\n a = list(map(int,input().split()))\n b = list(map(int,input().split()))\n c = list(map(int,input().split()))\n sum_satisfaction = sum(b)\n \n-for i in range(1,n):\n- if(i < n-1 and a[i] == a[i-1] + 1 ):\n sum_satisfaction = sum_satisfaction + c[i]\n print(sum_satisfaction)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u662822413", "problem_id": "p02415", "submission1_id": "s932284872-FL", "submission2_id": "s522132452", "status1": "Wrong Answer", "status2": "Accepted", "code1": "Target=input()\nTarget.swapcase()\nprint(Target)\n\n", "code2": "target=input()\nAns=target.swapcase()\nprint(Ans)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556546099", "date2": "1556546462", "bleu_score": "0.7488301054553232", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "R,g@H G-IQTA AKK@YPISODBN B/WUDKP\n", "actual_output": "R,g@H G-IQTA AKK@YPISODBN B/WUDKP\n", "expected_output": "r,G@h g-iqta akk@ypisodbn b/wudkp\n\n", "anno_code": ["Target=input() # (0): Target=R,g@H G-IQTA AKK@YPISODBN B/WUDKP\nTarget.swapcase() # (1): NO CHANGE\nprint(Target)\n\n"], "anno_status": [true], "diff_content": "-Target=input()\n-Target.swapcase()\n-print(Target)\n+target=input()\n+Ans=target.swapcase()\n+print(Ans)\n \n \n", "FL_content": "\n Target=input()\n-Target.swapcase()\n print(Target)\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u743391186", "problem_id": "p03164", "submission1_id": "s904827753-FL", "submission2_id": "s718043377", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,W = map(int,input().split())\nweight = []\nvalue = []\nfor i in range(N):\n w,v = map(int,input().split())\n weight.append(w)\n value.append(v)\nmaxValue = N*1000\ndp = [[0 for i in range(maxValue+1)] for j in range(N+1)]\nfor i in range(maxValue+1):\n dp[0][i] = float(\"inf\")\ndp[0][0] = 0\ndp[0][value[0]] = weight[0]\nfor i in range(1,N+1):\n op2 = float(\"inf\")\n for v in range(maxValue+1):\n dp[i][v] = dp[i-1][v]\n if value[i-1] > v: continue;\n dp[i][v] = min(dp[i][v],weight[i-1] + dp[i-1][v-value[i-1]])\nans = 0\nfor x in range(maxValue+1):\n if dp[N][x] <= W:\n ans = x\nprint(ans)", "code2": "N,W = map(int,input().split())\nweight = [0]\nvalue = [0]\nfor i in range(N):\n w,v = map(int,input().split())\n weight.append(w)\n value.append(v)\n \nmaxValue = sum(value)\nINF = 10**10\ndp = [[INF for i in range(maxValue+1)] for j in range(N+1)]\nfor i in range(N+1):\n dp[i][0] = 0\nfor i in range(1,N+1):\n for v in range(1,maxValue+1):\n if value[i] <= v:\n dp[i][v] = min(dp[i-1][v],weight[i] + dp[i-1][v-value[i]])\n else:\n dp[i][v] = dp[i-1][v]\nans = 0\nfor x in range(maxValue+1):\n if dp[N][x] <= W:\n ans = x\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1588722987", "date2": "1588728257", "bleu_score": "0.825531349372796", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1], "code1_test_score": 63, "total_score": 103, "input": "3 23\n2 9\n1 46\n1 145\n", "actual_output": "209\n", "expected_output": "200\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N,W = map(int,input().split())\n-weight = []\n-value = []\n+weight = [0]\n+value = [0]\n for i in range(N):\n w,v = map(int,input().split())\n weight.append(w)\n value.append(v)\n-maxValue = N*1000\n-dp = [[0 for i in range(maxValue+1)] for j in range(N+1)]\n-for i in range(maxValue+1):\n- dp[0][i] = float(\"inf\")\n-dp[0][0] = 0\n-dp[0][value[0]] = weight[0]\n+ \n+maxValue = sum(value)\n+INF = 10**10\n+dp = [[INF for i in range(maxValue+1)] for j in range(N+1)]\n+for i in range(N+1):\n+ dp[i][0] = 0\n for i in range(1,N+1):\n- op2 = float(\"inf\")\n- for v in range(maxValue+1):\n- dp[i][v] = dp[i-1][v]\n- if value[i-1] > v: continue;\n- dp[i][v] = min(dp[i][v],weight[i-1] + dp[i-1][v-value[i-1]])\n+ for v in range(1,maxValue+1):\n+ if value[i] <= v:\n+ dp[i][v] = min(dp[i-1][v],weight[i] + dp[i-1][v-value[i]])\n+ else:\n+ dp[i][v] = dp[i-1][v]\n ans = 0\n for x in range(maxValue+1):\n if dp[N][x] <= W:\n ans = x\n print(ans)\n", "FL_content": "\n N,W = map(int,input().split())\n weight = []\n value = []\n for i in range(N):\n w,v = map(int,input().split())\n weight.append(w)\n value.append(v)\n-maxValue = N*1000\n dp = [[0 for i in range(maxValue+1)] for j in range(N+1)]\n for i in range(maxValue+1):\n dp[0][i] = float(\"inf\")\n dp[0][0] = 0\n-dp[0][value[0]] = weight[0]\n for i in range(1,N+1):\n op2 = float(\"inf\")\n for v in range(maxValue+1):\n dp[i][v] = dp[i-1][v]\n if value[i-1] > v: continue;\n dp[i][v] = min(dp[i][v],weight[i-1] + dp[i-1][v-value[i-1]])\n ans = 0\n for x in range(maxValue+1):\n if dp[N][x] <= W:\n ans = x\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u101350975", "problem_id": "p03545", "submission1_id": "s174705513-FL", "submission2_id": "s964339503", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\nl = list(stdin.readline().rstrip())\ns = [int(i) for i in l]\ndef dfs(i, f, sum):\n if i == 3:\n if sum == 7:\n print(f)\n exit()\n else:\n dfs(i+1, f + '+' + str(s[i]), sum + s[i])\n dfs(i+1, f + '-' + str(s[i]), sum - s[i])\ndfs(0, str(s[0]), s[0])\n", "code2": "from sys import stdin\nl = list(stdin.readline().rstrip())\ns = [int(i) for i in l]\ndef dfs(i, f, sum):\n if i == 3:\n if sum == 7:\n print(f + '=7')\n exit()\n else:\n dfs(i+1, f + '+' + str(s[i+1]), sum + s[i+1])\n dfs(i+1, f + '-' + str(s[i+1]), sum - s[i+1])\ndfs(0, str(s[0]), s[0])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591899047", "date2": "1591899566", "bleu_score": "0.9306528688079402", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 99, "input": "2533\n", "actual_output": "no output\n", "expected_output": "2+5+3-3=7\n\n", "anno_code": ["from sys import stdin\nl = list(stdin.readline().rstrip()) # (0): l=['2', '5', '3', '3']\ns = [int(i) for i in l] # (1): s=[2, 5, 3, 3]\ndef dfs(i, f, sum): # (2): dfs=\n if i == 3: # (4): NO CHANGE (6): NO CHANGE ... (39): NO CHANGE\n if sum == 7: # (11): i=2, f=2+2+5, sum=9 (14): i=1, f=2+2, sum=4 ... (37): i=2, f=2-2-5, sum=-5\n print(f)\n exit()\n else:\n dfs(i+1, f + '+' + str(s[i]), sum + s[i]) # (5): i=1, f=2+2, sum=4 (7): i=2, f=2+2+5, sum=9 ... (35): i=3, f=2-2-5+3, sum=-2\n dfs(i+1, f + '-' + str(s[i]), sum - s[i]) # (12): i=3, f=2+2+5-3, sum=6 (15): i=2, f=2+2-5, sum=-1 ... (38): i=3, f=2-2-5-3, sum=-8\ndfs(0, str(s[0]), s[0]) # (3): i=0, f=2, sum=2\n"], "anno_status": [true], "diff_content": " from sys import stdin\n l = list(stdin.readline().rstrip())\n s = [int(i) for i in l]\n def dfs(i, f, sum):\n if i == 3:\n if sum == 7:\n- print(f)\n+ print(f + '=7')\n exit()\n else:\n- dfs(i+1, f + '+' + str(s[i]), sum + s[i])\n- dfs(i+1, f + '-' + str(s[i]), sum - s[i])\n+ dfs(i+1, f + '+' + str(s[i+1]), sum + s[i+1])\n+ dfs(i+1, f + '-' + str(s[i+1]), sum - s[i+1])\n dfs(0, str(s[0]), s[0])\n \n", "FL_content": "\n from sys import stdin\n l = list(stdin.readline().rstrip())\n s = [int(i) for i in l]\n def dfs(i, f, sum):\n if i == 3:\n if sum == 7:\n print(f)\n exit()\n else:\n dfs(i+1, f + '+' + str(s[i]), sum + s[i])\n dfs(i+1, f + '-' + str(s[i]), sum - s[i])\n-dfs(0, str(s[0]), s[0])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u883048396", "problem_id": "p03164", "submission1_id": "s605144360-FL", "submission2_id": "s255412338", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ndef 解():\n input = sys.stdin.readline\n\n N,W=[int(_) for _ in input().split()]\n dp={0:0}\n for i in range(N):\n w,v=[int(_) for _ in input().split()]\n for j in dp.copy():\n if dp[j]+w <= W:\n if j+v in dp:\n dp[j+v] = min(dp[j+v],dp[j]+w)\n else:\n dp[j+v] = dp[j]+w\n\n print(max(dp.keys()))\n解()\n", "code2": "import sys\ndef 解():\n input = sys.stdin.readline\n\n N,W=[int(_) for _ in input().split()]\n dp={0:0}\n for _ in range(N):\n w,v=[int(_) for _ in input().split()]\n \n for j in sorted(dp.keys(),reverse=True):\n nw = dp[j]+w\n nv = j+v\n if nw <= W :\n if nv in dp:\n if nw < dp[nv]:\n dp[nv] = nw\n else:\n dp[nv] = nw\n\n print(max(dp.keys()))\n解()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1546814278", "date2": "1546834497", "bleu_score": "0.7351273822323413", "code1_test_status": [1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 95, "total_score": 103, "input": "6 15\n6 3\n9 6\n0 4\n4 20\n3 10\n1 4\n", "actual_output": "44\n", "expected_output": "41\n\n", "anno_code": ["import sys\ndef 解(): # (0): 解=\n input = sys.stdin.readline # (2): input=\n\n N,W=[int(_) for _ in input().split()] # (3): N=6, W=15\n dp={0:0} # (4): dp={0: 0}\n for i in range(N): # (5): i=0 (12): i=1 ... (213): NO CHANGE\n w,v=[int(_) for _ in input().split()] # (6): w=6, v=3 (13): w=9, v=6 ... (129): w=1, v=4\n for j in dp.copy(): # (7): j=0 (11): NO CHANGE ... (212): NO CHANGE\n if dp[j]+w <= W: # (8): NO CHANGE (15): NO CHANGE ... (209): NO CHANGE\n if j+v in dp: # (9): NO CHANGE (16): NO CHANGE ... (210): NO CHANGE\n dp[j+v] = min(dp[j+v],dp[j]+w) # (78): dp={0: 0, 3: 6, 6: 9, 9: 15, 4: 0, 7: 6, 10: 3, 13: 15, 20: 4, 23: 10, 26: 13, 24: 4, 27: 10, 30: 13} (82): dp={0: 0, 3: 6, 6: 9, 9: 15, 4: 0, 7: 6, 10: 3, 13: 9, 20: 4, 23: 10, 26: 13, 24: 4, 27: 10, 30: 13} ... (199): NO CHANGE\n else:\n dp[j+v] = dp[j]+w # (10): dp={0: 0, 3: 6} (17): dp={0: 0, 3: 6, 6: 9} ... (211): dp={0: 0, 3: 6, 6: 9, 9: 15, 4: 0, 7: 6, 10: 3, 13: 9, 20: 4, 23: 10, 26: 13, 24: 4, 27: 10, 30: 7, 16: 12, 14: 3, 17: 9, 33: 13, 34: 7, 37: 13, 40: 10, 8: 1, 11: 7, 28: 5, 31: 11, 18: 4, 21: 10, 38: 8, 41: 14, 44: 11}\n\n print(max(dp.keys()))\n解() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " import sys\n def 解():\n input = sys.stdin.readline\n \n N,W=[int(_) for _ in input().split()]\n dp={0:0}\n- for i in range(N):\n+ for _ in range(N):\n w,v=[int(_) for _ in input().split()]\n- for j in dp.copy():\n- if dp[j]+w <= W:\n- if j+v in dp:\n- dp[j+v] = min(dp[j+v],dp[j]+w)\n+ \n+ for j in sorted(dp.keys(),reverse=True):\n+ nw = dp[j]+w\n+ nv = j+v\n+ if nw <= W :\n+ if nv in dp:\n+ if nw < dp[nv]:\n+ dp[nv] = nw\n else:\n- dp[j+v] = dp[j]+w\n+ dp[nv] = nw\n \n print(max(dp.keys()))\n 解()\n \n", "FL_content": "\n import sys\n def 解():\n input = sys.stdin.readline\n \n N,W=[int(_) for _ in input().split()]\n dp={0:0}\n for i in range(N):\n w,v=[int(_) for _ in input().split()]\n for j in dp.copy():\n if dp[j]+w <= W:\n if j+v in dp:\n- dp[j+v] = min(dp[j+v],dp[j]+w)\n else:\n- dp[j+v] = dp[j]+w\n \n print(max(dp.keys()))\n 解()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u030726788", "problem_id": "p03617", "submission1_id": "s302143005-FL", "submission2_id": "s057118139", "status1": "Wrong Answer", "status2": "Accepted", "code1": "q,h,s,d=map(int,input().split())\nn=int(input())\ncospa=[[q/0.25,0.25,q],[h/0.5,0.5,h],[s,1.0,s],[d/2,2.0,d]]\ncospa.sort()\nmoney=0\nfor i in range(4):\n if(n>=cospa[i][1]):\n x=n\n money+=x*cospa[i][2]\n n%=cospa[i][1]\nprint(int(money))", "code2": "q,h,s,d=map(int,input().split())\nn=int(input())\ncospa=[[q/0.25,0.25,q],[h/0.5,0.5,h],[s,1.0,s],[d/2,2.0,d]]\ncospa.sort()\nmoney=0\nfor i in range(4):\n if(n>=cospa[i][1]):\n x=int(n\n money+=int(x*cospa[i][2])\n n%=cospa[i][1]\nprint(int(money))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1522883028", "date2": "1522883724", "bleu_score": "0.9450688388497887", "code1_test_status": [0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0], "code1_test_score": 29, "total_score": 104, "input": "3065533 854010 10742875 54687163\n69254\n", "actual_output": "59143608540\n", "expected_output": "118287217080\n\n", "anno_code": ["q,h,s,d=map(int,input().split()) # (0): q=3065533, h=854010, s=10742875, d=54687163\nn=int(input()) # (1): n=69254\ncospa=[[q/0.25,0.25,q],[h/0.5,0.5,h],[s,1.0,s],[d/2,2.0,d]] # (2): cospa\ncospa.sort() # (3): cospa\nmoney=0 # (4): money=0\nfor i in range(4): # (5): i=0 (10): i=1 ... (16): NO CHANGE\n if(n>=cospa[i][1]): # (6): NO CHANGE (11): NO CHANGE ... (15): NO CHANGE\n x=n # (7): x=69254\n money+=x*cospa[i][2] # (8): money=59143608540\n n%=cospa[i][1] # (9): n=0.0\nprint(int(money))"], "anno_status": [true], "diff_content": " q,h,s,d=map(int,input().split())\n n=int(input())\n cospa=[[q/0.25,0.25,q],[h/0.5,0.5,h],[s,1.0,s],[d/2,2.0,d]]\n cospa.sort()\n money=0\n for i in range(4):\n if(n>=cospa[i][1]):\n- x=n\n- money+=x*cospa[i][2]\n+ x=int(n\n+ money+=int(x*cospa[i][2])\n n%=cospa[i][1]\n print(int(money))\n", "FL_content": "\n q,h,s,d=map(int,input().split())\n n=int(input())\n cospa=[[q/0.25,0.25,q],[h/0.5,0.5,h],[s,1.0,s],[d/2,2.0,d]]\n cospa.sort()\n money=0\n for i in range(4):\n if(n>=cospa[i][1]):\n x=n\n money+=x*cospa[i][2]\n n%=cospa[i][1]\n print(int(money))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u060936992", "problem_id": "p04044", "submission1_id": "s957507107-FL", "submission2_id": "s933487447", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nn,l=map(int,input().split())\ns=[0 for i in range(n)]\nfor i in range(n):\n s[i]=input()\n\nprint(s)\ns.sort()\nprint(s)\nans=\"\"\nfor i in range(n):\n ans+=s[i]\n\nprint(ans)", "code2": "\n\nn,l=map(int,input().split())\ns=[0 for i in range(n)]\nfor i in range(n):\n s[i]=input()\n\ns.sort()\nans=\"\"\nfor i in range(n):\n ans+=s[i]\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1545177538", "date2": "1545177580", "bleu_score": "0.8823396373580439", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 2\nexx\naxw\ncwx\n", "actual_output": "['exx', 'axw', 'cwx']\n['axw', 'cwx', 'exx']\naxwcwxexx\n", "expected_output": "axwcwxexx\n\n", "anno_code": ["\n\nn,l=map(int,input().split()) # (0): n=3, l=2\ns=[0 for i in range(n)] # (1): s=[0, 0, 0]\nfor i in range(n): # (2): i=0 (4): i=1 ... (8): NO CHANGE\n s[i]=input() # (3): s=['exx', 0, 0] (5): s=['exx', 'axw', 0] (7): s=['exx', 'axw', 'cwx']\n\nprint(s) # (9): NO CHANGE\ns.sort() # (10): s=['axw', 'cwx', 'exx']\nprint(s) # (11): NO CHANGE\nans=\"\" # (12): ans=\nfor i in range(n): # (13): i=0 (15): i=1 ... (19): NO CHANGE\n ans+=s[i] # (14): ans=axw (16): ans=axwcwx (18): ans=axwcwxexx\n\nprint(ans)"], "anno_status": [true], "diff_content": " \n \n n,l=map(int,input().split())\n s=[0 for i in range(n)]\n for i in range(n):\n s[i]=input()\n \n-print(s)\n s.sort()\n-print(s)\n ans=\"\"\n for i in range(n):\n ans+=s[i]\n \n print(ans)\n", "FL_content": "\n \n \n n,l=map(int,input().split())\n s=[0 for i in range(n)]\n for i in range(n):\n s[i]=input()\n \n-print(s)\n s.sort()\n-print(s)\n ans=\"\"\n for i in range(n):\n ans+=s[i]\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u648595404", "problem_id": "p02237", "submission1_id": "s111968184-FL", "submission2_id": "s552062559", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nfor i in range(n):\n node = list(map(int,input().split()))\n node_list = node[2:]\n matrix = [0] * n\n for j in node_list:\n matrix[j -1] = 1\n print(\"\".join(str(matrix)))", "code2": "n = int(input())\nfor i in range(n):\n node = list(map(int,input().split()))\n node_list = node[2:]\n matrix = [\"0\"]* n\n\n for j in node_list:\n matrix[j -1] = \"1\"\n print(\" \".join(matrix))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1458608979", "date2": "1458830971", "bleu_score": "0.9301637122366813", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "4\n1 2 1 2\n2 1 1\n0 -2\n4 1 2\n", "actual_output": "[1, 1, 0, 0]\n[1, 0, 0, 0]\n[0, 0, 0, 0]\n[0, 1, 0, 0]\n", "expected_output": "1 1 0 0\n1 0 0 0\n0 0 0 0\n0 1 0 0\n\n", "anno_code": ["n = int(input()) # (0): n=4\nfor i in range(n): # (1): i=0 (11): i=1 ... (25): i=3\n node = list(map(int,input().split())) # (2): node=[1, 2, 1, 2] (12): node=[2, 1, 1] ... (26): node=[4, 1, 2]\n node_list = node[2:] # (3): node_list=[1, 2] (13): node_list=[1] ... (27): node_list=[2]\n matrix = [0] * n # (4): matrix=[0, 0, 0, 0] (14): matrix=[0, 0, 0, 0] ... (28): NO CHANGE\n for j in node_list: # (5): j=1 (7): j=2 ... (31): NO CHANGE\n matrix[j -1] = 1 # (6): matrix=[1, 0, 0, 0] (8): matrix=[1, 1, 0, 0] ... (30): matrix=[0, 1, 0, 0]\n print(\"\".join(str(matrix))) # (10): NO CHANGE (18): NO CHANGE ... (32): NO CHANGE\n"], "anno_status": [true], "diff_content": " n = int(input())\n for i in range(n):\n node = list(map(int,input().split()))\n node_list = node[2:]\n- matrix = [0] * n\n+ matrix = [\"0\"]* n\n+\n for j in node_list:\n- matrix[j -1] = 1\n- print(\"\".join(str(matrix)))\n+ matrix[j -1] = \"1\"\n+ print(\" \".join(matrix))\n", "FL_content": "\n n = int(input())\n for i in range(n):\n node = list(map(int,input().split()))\n node_list = node[2:]\n matrix = [0] * n\n for j in node_list:\n matrix[j -1] = 1\n- print(\"\".join(str(matrix)))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u756468156", "problem_id": "p02410", "submission1_id": "s371777798-FL", "submission2_id": "s503588176", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\nA = [list(map(int, input().split())) for _ in range(n)]\nb= [int(input()) for _ in range(m)]\nc = []\n\nfor i in range(n):\n bi = b[i]\n for y in A[i]:\n bi += y\n c.append(bi)\n\nprint(*[ci for ci in c], sep = \"\\n\")", "code2": "n, m = map(int, input().split())\nA = [list(map(int, input().split())) for _ in range(n)]\nb= [int(input()) for _ in range(m)]\nc = []\n\nfor x in range(n):\n ci = 0\n for y in range(m):\n ci += A[x][y] * b[y]\n c.append(ci)\n\nprint(*[ci for ci in c], sep = \"\\n\")", "original_language1": "Python3", "original_language2": "Python3", "date1": "1467101859", "date2": "1467102241", "bleu_score": "0.8737742023820458", "code1_test_status": [0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 3, "total_score": 101, "input": "3 4\n1 4 0 1\n0 3 0 1\n4 1 1 0\n1\n3\n3\n0\n", "actual_output": "7\n7\n9\n", "expected_output": "13\n9\n10\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=3, m=4\nA = [list(map(int, input().split())) for _ in range(n)] # (1): A\nb= [int(input()) for _ in range(m)] # (2): b=[1, 3, 3, 0]\nc = [] # (3): c=[]\n\nfor i in range(n): # (4): i=0 (16): i=1 ... (40): NO CHANGE\n bi = b[i] # (5): bi=1 (17): bi=3 (29): bi=3\n for y in A[i]: # (6): y=1 (8): y=4 ... (38): NO CHANGE\n bi += y # (7): bi=2 (9): bi=6 ... (37): NO CHANGE\n c.append(bi) # (15): c=[7] (27): c=[7, 7] (39): c=[7, 7, 9]\n\nprint(*[ci for ci in c], sep = \"\\n\")"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n A = [list(map(int, input().split())) for _ in range(n)]\n b= [int(input()) for _ in range(m)]\n c = []\n \n-for i in range(n):\n- bi = b[i]\n- for y in A[i]:\n- bi += y\n- c.append(bi)\n+for x in range(n):\n+ ci = 0\n+ for y in range(m):\n+ ci += A[x][y] * b[y]\n+ c.append(ci)\n \n print(*[ci for ci in c], sep = \"\\n\")\n", "FL_content": "\n n, m = map(int, input().split())\n A = [list(map(int, input().split())) for _ in range(n)]\n b= [int(input()) for _ in range(m)]\n c = []\n \n for i in range(n):\n bi = b[i]\n for y in A[i]:\n- bi += y\n c.append(bi)\n \n print(*[ci for ci in c], sep = \"\\n\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u155024797", "problem_id": "p02839", "submission1_id": "s692354686-FL", "submission2_id": "s974960017", "status1": "Wrong Answer", "status2": "Accepted", "code1": "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 dp = [[set() for _ in range(W+1)] for _ in range(2)]\n dp[0][1].add(abs(A[0][0] - B[0][0]))\n for i in range(H):\n dp[(i+1) & 1] = [set() for _ in range(W+1)]\n for j in range(W):\n diff = abs(A[i][j] - B[i][j])\n dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x + diff), dp[i & 1][j+1]))\n dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x - diff), dp[i & 1][j+1]))\n dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x + diff), dp[(i+1) & 1][j]))\n dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x - diff), dp[(i+1) & 1][j]))\n print(min(dp[H & 1][W]))\n\n\nif __name__ == \"__main__\":\n main()\n", "code2": "def main():\n H, W = map(int, input().split())\n N = 80 * (H+W) \n A = [list(map(int, input().split())) for _ in range(H)]\n B = [list(map(int, input().split())) for _ in range(H)]\n dp = [[set() for _ in range(W+1)] for _ in range(2)]\n dp[0][1].add(0)\n def ltN(x): return x <= N\n for i in range(H):\n dp[(i+1) & 1] = [set() for _ in range(W+1)]\n for j in range(W):\n diff = abs(A[i][j] - B[i][j])\n tmp = set()\n for x in dp[i & 1][j + 1]:\n tmp.add(abs(x + diff))\n tmp.add(abs(x - diff))\n for x in dp[(i+1) & 1][j]:\n tmp.add(abs(x + diff))\n tmp.add(abs(x - diff))\n dp[(i+1) & 1][j+1] = tmp\n print(min(dp[H & 1][W]))\n\n\nif __name__ == \"__main__\":\n main()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1579924171", "date2": "1579927179", "bleu_score": "0.7679588919899263", "code1_test_status": [1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 6, "total_score": 102, "input": "1 3\n4 10 90\n80 14 1\n1 2 3\n4 2 6\n", "actual_output": "59\n", "expected_output": "9\n\n", "anno_code": ["def main(): # (0): 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 dp = [[set() for _ in range(W+1)] for _ in range(2)]\n dp[0][1].add(abs(A[0][0] - B[0][0]))\n for i in range(H):\n dp[(i+1) & 1] = [set() for _ in range(W+1)]\n for j in range(W):\n diff = abs(A[i][j] - B[i][j])\n dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x + diff), dp[i & 1][j+1]))\n dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x - diff), dp[i & 1][j+1]))\n dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x + diff), dp[(i+1) & 1][j]))\n dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x - diff), dp[(i+1) & 1][j]))\n print(min(dp[H & 1][W]))\n\n\nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " def main():\n H, W = map(int, input().split())\n+ N = 80 * (H+W) \n A = [list(map(int, input().split())) for _ in range(H)]\n B = [list(map(int, input().split())) for _ in range(H)]\n dp = [[set() for _ in range(W+1)] for _ in range(2)]\n- dp[0][1].add(abs(A[0][0] - B[0][0]))\n+ dp[0][1].add(0)\n+ def ltN(x): return x <= N\n for i in range(H):\n dp[(i+1) & 1] = [set() for _ in range(W+1)]\n for j in range(W):\n diff = abs(A[i][j] - B[i][j])\n- dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x + diff), dp[i & 1][j+1]))\n- dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x - diff), dp[i & 1][j+1]))\n- dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x + diff), dp[(i+1) & 1][j]))\n- dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x - diff), dp[(i+1) & 1][j]))\n+ tmp = set()\n+ for x in dp[i & 1][j + 1]:\n+ tmp.add(abs(x + diff))\n+ tmp.add(abs(x - diff))\n+ for x in dp[(i+1) & 1][j]:\n+ tmp.add(abs(x + diff))\n+ tmp.add(abs(x - diff))\n+ dp[(i+1) & 1][j+1] = tmp\n print(min(dp[H & 1][W]))\n \n \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": "\n 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 dp = [[set() for _ in range(W+1)] for _ in range(2)]\n dp[0][1].add(abs(A[0][0] - B[0][0]))\n for i in range(H):\n dp[(i+1) & 1] = [set() for _ in range(W+1)]\n for j in range(W):\n diff = abs(A[i][j] - B[i][j])\n- dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x + diff), dp[i & 1][j+1]))\n- dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x - diff), dp[i & 1][j+1]))\n- dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x + diff), dp[(i+1) & 1][j]))\n- dp[(i+1) & 1][j+1] |= set(map(lambda x: abs(x - diff), dp[(i+1) & 1][j]))\n print(min(dp[H & 1][W]))\n \n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u708618797", "problem_id": "p02839", "submission1_id": "s865677868-FL", "submission2_id": "s276845746", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nsys.setrecursionlimit(2147483647)\nINF=float(\"inf\")\nMOD=10**9+7\ninput=lambda:sys.stdin.readline().rstrip()\ndef resolve():\n ofs=6400\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 dp=[[0]*w for _ in range(h)]\n x=abs(A[0][0]-B[0][0])\n dp[0][0]|=((1<<(ofs+x))|(1<<(ofs-x)))\n\n from itertools import product\n for i,j in product(range(h),range(w)):\n x=abs(A[i][j]-B[i][j])\n t=0\n if(i-1>=0):\n t|=dp[i-1][j]\n if(j-1>=0):\n t|=dp[i][j-1]\n dp[i][j]=((t<>x))\n\n for i,s in enumerate(bin(dp[-1][-1])[-ofs-1:]):\n if(s=='1'):\n print(i)\n return\n \nresolve()\n", "code2": "\nimport sys\nsys.setrecursionlimit(2147483647)\nINF=float(\"inf\")\nMOD=10**9+7\ninput=lambda:sys.stdin.readline().rstrip()\ndef resolve():\n ofs=6400\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 dp=[[0]*w for _ in range(h)]\n x=abs(A[0][0]-B[0][0])\n dp[0][0]|=((1<<(ofs+x))|(1<<(ofs-x)))\n\n from itertools import product\n for i,j in product(range(h),range(w)):\n x=abs(A[i][j]-B[i][j])\n t=0\n if(i-1>=0):\n t|=dp[i-1][j]\n if(j-1>=0):\n t|=dp[i][j-1]\n dp[i][j]|=((t<>x))\n\n for i,s in enumerate(bin(dp[-1][-1])[-ofs-1:]):\n if(s=='1'):\n print(i)\n return\n \nresolve()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575874688", "date2": "1575874859", "bleu_score": "0.9968101940083974", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "1 3\n1 0 25\n83 2 2\n1 3 3\n7 2 6\n", "actual_output": "no output\n", "expected_output": "57\n\n", "anno_code": ["\nimport sys\nsys.setrecursionlimit(2147483647) # (0): NO CHANGE\nINF=float(\"inf\") # (1): INF=inf\nMOD=10**9+7 # (2): MOD=1000000007\ninput=lambda:sys.stdin.readline().rstrip() # (3): input= at 0x00000293FFAA9BD0>\ndef resolve(): # (4): resolve=\n ofs=6400 # (6): ofs=6400\n h,w=map(int,input().split()) # (7): h=1, w=3\n A=[list(map(int,input().split())) for _ in range(h)] # (8): A\n B=[list(map(int,input().split())) for _ in range(h)] # (9): B\n dp=[[0]*w for _ in range(h)] # (10): dp\n x=abs(A[0][0]-B[0][0]) # (11): x=82\n dp[0][0]|=((1<<(ofs+x))|(1<<(ofs-x))) # (12): dp, product=\n\n from itertools import product\n for i,j in product(range(h),range(w)): # (13): i=0, j=0 (19): j=1 ... (33): NO CHANGE\n x=abs(A[i][j]-B[i][j]) # (14): NO CHANGE (20): x=2 (27): x=23\n t=0 # (15): t=0 (21): NO CHANGE (28): NO CHANGE\n if(i-1>=0): # (16): NO CHANGE (22): NO CHANGE (29): NO CHANGE\n t|=dp[i-1][j]\n if(j-1>=0): # (17): NO CHANGE (23): NO CHANGE (30): NO CHANGE\n t|=dp[i][j-1] # (24): NO CHANGE (31): NO CHANGE\n dp[i][j]=((t<>x)) # (18): dp (25): NO CHANGE (32): NO CHANGE\n\n for i,s in enumerate(bin(dp[-1][-1])[-ofs-1:]): # (34): s=0 (36): i=1, s=b (38): i=2, s=0\n if(s=='1'): # (35): NO CHANGE (37): NO CHANGE (39): NO CHANGE\n print(i)\n return\n \nresolve() # (5): NO CHANGE\n"], "anno_status": [false], "diff_content": " \n import sys\n sys.setrecursionlimit(2147483647)\n INF=float(\"inf\")\n MOD=10**9+7\n input=lambda:sys.stdin.readline().rstrip()\n def resolve():\n ofs=6400\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 dp=[[0]*w for _ in range(h)]\n x=abs(A[0][0]-B[0][0])\n dp[0][0]|=((1<<(ofs+x))|(1<<(ofs-x)))\n \n from itertools import product\n for i,j in product(range(h),range(w)):\n x=abs(A[i][j]-B[i][j])\n t=0\n if(i-1>=0):\n t|=dp[i-1][j]\n if(j-1>=0):\n t|=dp[i][j-1]\n- dp[i][j]=((t<>x))\n+ dp[i][j]|=((t<>x))\n \n for i,s in enumerate(bin(dp[-1][-1])[-ofs-1:]):\n if(s=='1'):\n print(i)\n return\n \n resolve()\n \n", "FL_content": "\n \n import sys\n sys.setrecursionlimit(2147483647)\n INF=float(\"inf\")\n MOD=10**9+7\n input=lambda:sys.stdin.readline().rstrip()\n def resolve():\n- ofs=6400\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 dp=[[0]*w for _ in range(h)]\n x=abs(A[0][0]-B[0][0])\n- dp[0][0]|=((1<<(ofs+x))|(1<<(ofs-x)))\n \n from itertools import product\n for i,j in product(range(h),range(w)):\n x=abs(A[i][j]-B[i][j])\n t=0\n if(i-1>=0):\n t|=dp[i-1][j]\n if(j-1>=0):\n t|=dp[i][j-1]\n dp[i][j]=((t<>x))\n \n- for i,s in enumerate(bin(dp[-1][-1])[-ofs-1:]):\n- if(s=='1'):\n- print(i)\n- return\n- \n resolve()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 32 }, { "user_id": "u529518602", "problem_id": "p03712", "submission1_id": "s814044929-FL", "submission2_id": "s113170128", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h, m = map(int, input().split())\nC = [input() for i in range(h)]\n\nhana = '*' * (m + 2)\nprint(hana)\nfor i in range(h):\n print('*' + C[i] + '*')\nprint(hana)\n", "code2": "h, m = map(int, input().split())\nC = [input() for i in range(h)]\n\nhana = '\nprint(hana)\nfor i in range(h):\n print('\nprint(hana)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1548541510", "date2": "1548541580", "bleu_score": "0.7871572393471534", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "2 0\nfba\nbrc\n", "actual_output": "**\n*fba*\n*brc*\n**\n", "expected_output": "##\n#fba#\n#brc#\n##\n\n", "anno_code": ["h, m = map(int, input().split()) # (0): h=2, m=0\nC = [input() for i in range(h)] # (1): C=['fba', 'brc']\n\nhana = '*' * (m + 2) # (2): hana=**\nprint(hana) # (3): NO CHANGE\nfor i in range(h): # (4): i=0 (6): i=1 (8): NO CHANGE\n print('*' + C[i] + '*') # (5): NO CHANGE (7): NO CHANGE\nprint(hana)\n"], "anno_status": [true], "diff_content": " h, m = map(int, input().split())\n C = [input() for i in range(h)]\n \n-hana = '*' * (m + 2)\n+hana = '\n print(hana)\n for i in range(h):\n- print('*' + C[i] + '*')\n+ print('\n print(hana)\n \n", "FL_content": "\n h, m = map(int, input().split())\n C = [input() for i in range(h)]\n \n hana = '*' * (m + 2)\n-print(hana)\n for i in range(h):\n print('*' + C[i] + '*')\n print(hana)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u280978334", "problem_id": "p03945", "submission1_id": "s820531248-FL", "submission2_id": "s977609533", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\ncount = 0\ntemp = S[-1]\nfor s in S[-2::-1]:\n if s != temp:\n count += 1\n temp = s\nprint(0 if count == 0 else count-1)", "code2": "S = input()\ncount = 0\ntemp = S[-1]\nfor s in S[-2::-1]:\n if s != temp:\n count += 1\n temp = s\nprint(0 if count == 0 else count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559774453", "date2": "1559774504", "bleu_score": "0.980171193731487", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 1, "total_score": 103, "input": "BABAXWWDVZ\n", "actual_output": "7\n", "expected_output": "8\n\n", "anno_code": ["S = input() # (0): S=BABAXWWDVZ\ncount = 0 # (1): count=0\ntemp = S[-1] # (2): temp=Z\nfor s in S[-2::-1]: # (3): s=V (7): s=D ... (38): NO CHANGE\n if s != temp: # (4): NO CHANGE (8): NO CHANGE ... (35): NO CHANGE\n count += 1 # (5): count=1 (9): count=2 ... (36): count=8\n temp = s # (6): temp=V (10): temp=D ... (37): temp=B\nprint(0 if count == 0 else count-1)"], "anno_status": [true], "diff_content": " S = input()\n count = 0\n temp = S[-1]\n for s in S[-2::-1]:\n if s != temp:\n count += 1\n temp = s\n-print(0 if count == 0 else count-1)\n+print(0 if count == 0 else count)\n", "FL_content": "\n S = input()\n count = 0\n temp = S[-1]\n for s in S[-2::-1]:\n if s != temp:\n count += 1\n temp = s\n-print(0 if count == 0 else count-1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u369313788", "problem_id": "p02401", "submission1_id": "s637432820-FL", "submission2_id": "s452831712", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n a, op, b = input().split()\n a = int(a)\n b = int(b)\n if op == '?':\n break\n if op == '+':\n print(a+b)\n if op == '-':\n print(a-b)\n if op == '*':\n print(a*b)\n if op == '/':\n print(a/b)", "code2": "while True:\n a, op, b = input().split()\n a = int(a)\n b = int(b)\n if op == '?':\n break\n if op == '+':\n print(a+b)\n if op == '-':\n print(a-b)\n if op == '*':\n print(a*b)\n if op == '/':\n print(a", "original_language1": "Python3", "original_language2": "Python3", "date1": "1469601093", "date2": "1469601152", "bleu_score": "0.9880240960954589", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "1 + 2\n56 - 18\n13 * 2\n100 / 10\n27 , 81\n-1 ? 0\n", "actual_output": "3\n38\n26\n10.0\n", "expected_output": "3\n38\n26\n10\n(27, 81)\n\n", "anno_code": ["while True: # (0): NO CHANGE (10): NO CHANGE ... (49): NO CHANGE\n a, op, b = input().split() # (1): a=1, op=+, b=2 (11): a=56, op=-, b=18 ... (50): a=-1, op=?, b=0\n a = int(a) # (2): a=1 (12): a=56 ... (51): a=-1\n b = int(b) # (3): b=2 (13): b=18 ... (52): b=0\n if op == '?': # (4): NO CHANGE (14): NO CHANGE ... (53): NO CHANGE\n break\n if op == '+': # (5): NO CHANGE (15): NO CHANGE ... (45): NO CHANGE\n print(a+b) # (6): NO CHANGE\n if op == '-': # (7): NO CHANGE (16): NO CHANGE ... (46): NO CHANGE\n print(a-b) # (17): NO CHANGE\n if op == '*': # (8): NO CHANGE (18): NO CHANGE ... (47): NO CHANGE\n print(a*b) # (28): NO CHANGE\n if op == '/': # (9): NO CHANGE (19): NO CHANGE ... (48): NO CHANGE\n print(a/b) # (39): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n a, op, b = input().split()\n a = int(a)\n b = int(b)\n if op == '?':\n break\n if op == '+':\n print(a+b)\n if op == '-':\n print(a-b)\n if op == '*':\n print(a*b)\n if op == '/':\n- print(a/b)\n+ print(a\n", "FL_content": "\n while True:\n a, op, b = input().split()\n a = int(a)\n b = int(b)\n if op == '?':\n break\n if op == '+':\n print(a+b)\n if op == '-':\n print(a-b)\n if op == '*':\n print(a*b)\n- if op == '/':\n- print(a/b)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u244493040", "problem_id": "p02401", "submission1_id": "s728019363-FL", "submission2_id": "s340905709", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while 1:\n a,o,b = input().split()\n if o=='?': break\n a,b = map(int,(a,b))\n print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a/b)\n", "code2": "while 1:\n a,o,b = input().split()\n if o=='?': break\n a,b = map(int,(a,b))\n print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1523639534", "date2": "1523639695", "bleu_score": "0.9742046492478209", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "1 + 2\n56 - 18\n13 * 0\n100 / 10\n27 , 81\n-1 ? 0\n", "actual_output": "3\n38\n0\n10.0\n0.3333333333333333\n", "expected_output": "3\n38\n0\n10\n(27, 81)\n\n", "anno_code": ["while 1: # (0): NO CHANGE (5): NO CHANGE ... (25): NO CHANGE\n a,o,b = input().split() # (1): a=1, o=+, b=2 (6): a=56, o=-, b=18 ... (26): a=-1, o=?, b=0\n if o=='?': break # (2): NO CHANGE (7): NO CHANGE ... (22): NO CHANGE\n a,b = map(int,(a,b)) # (3): a=1, b=2 (8): a=56, b=18 ... (23): a=27, b=81\n print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a/b) # (4): NO CHANGE (9): NO CHANGE ... (24): NO CHANGE\n"], "anno_status": [true], "diff_content": " while 1:\n a,o,b = input().split()\n if o=='?': break\n a,b = map(int,(a,b))\n- print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a/b)\n+ print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a\n \n", "FL_content": "\n while 1:\n a,o,b = input().split()\n if o=='?': break\n a,b = map(int,(a,b))\n- print(a+b if o=='+' else a-b if o=='-' else a*b if o=='*' else a/b)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u941284252", "problem_id": "p03129", "submission1_id": "s240151979-FL", "submission2_id": "s222321070", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,K = (int(x) for x in input().split())\nif(K==0):\n print(\"YES\")\n exit()\nif(N-2 >= 10):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\n", "code2": "N,K = (int(x) for x in input().split())\nif((N+1)/2 >= K):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1550001495", "date2": "1550001943", "bleu_score": "0.6428433888354146", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 48, "total_score": 60, "input": "151 97\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["N,K = (int(x) for x in input().split()) # (0): N=151, K=97\nif(K==0): # (1): NO CHANGE\n print(\"YES\")\n exit()\nif(N-2 >= 10): # (2): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\n"], "anno_status": [true], "diff_content": " N,K = (int(x) for x in input().split())\n-if(K==0):\n- print(\"YES\")\n- exit()\n-if(N-2 >= 10):\n+if((N+1)/2 >= K):\n print(\"YES\")\n else:\n print(\"NO\")\n \n \n \n \n", "FL_content": "\n N,K = (int(x) for x in input().split())\n-if(K==0):\n- print(\"YES\")\n- exit()\n-if(N-2 >= 10):\n print(\"YES\")\n else:\n print(\"NO\")\n \n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u858748695", "problem_id": "p03187", "submission1_id": "s354571369-FL", "submission2_id": "s094567222", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nfrom itertools import accumulate\nL, N = map(int, input().split())\nX = [int(input()) for _ in range(N)]\nY = [L - x for x in X][::-1]\n\nsx = [0] + list(accumulate(X))\nsy = [0] + list(accumulate(Y))\n\nans = 0\nfor i in range(N):\n j = N - i - 1\n mn = min(i, j)\n\n now = X[i]\n now += 2 * (sx[i] - sx[i - mn]) + 2 * (sy[j] - sy[j - mn - (i < j)])\n print(i - mn)\n ans = max(ans, now)\n\n now = Y[j]\n now += 2 * (sx[i] - sx[i - mn - (i > j)]) + 2 * (sy[j] - sy[j - mn])\n ans = max(ans, now)\n\nprint(ans)\n", "code2": "\nfrom itertools import accumulate\nL, N = map(int, input().split())\nX = [int(input()) for _ in range(N)]\nY = [L - x for x in X][::-1]\n\nsx = [0] + list(accumulate(X))\nsy = [0] + list(accumulate(Y))\n\nans = 0\nfor i in range(N):\n j = N - i - 1\n mn = min(i, j)\n\n now = X[i]\n now += 2 * (sx[i] - sx[i - mn]) + 2 * (sy[j] - sy[j - mn - (i < j)])\n ans = max(ans, now)\n\n now = Y[j]\n now += 2 * (sx[i] - sx[i - mn - (i > j)]) + 2 * (sy[j] - sy[j - mn])\n ans = max(ans, now)\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1546298640", "date2": "1546298684", "bleu_score": "0.9645707027057355", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "67 3\n0\n22\n29\n", "actual_output": "0\n0\n2\n121\n", "expected_output": "121\n\n", "anno_code": ["\nfrom itertools import accumulate\nL, N = map(int, input().split()) # (0): L=67, N=3\nX = [int(input()) for _ in range(N)] # (1): X=[0, 22, 29]\nY = [L - x for x in X][::-1] # (2): Y=[38, 45, 67]\n\nsx = [0] + list(accumulate(X)) # (3): sx=[0, 0, 22, 51]\nsy = [0] + list(accumulate(Y)) # (4): sy=[0, 38, 83, 150]\n\nans = 0 # (5): ans=0\nfor i in range(N): # (6): i=0 (16): i=1 ... (36): NO CHANGE\n j = N - i - 1 # (7): j=2 (17): j=1 (27): j=0\n mn = min(i, j) # (8): mn=0 (18): mn=1 (28): mn=0\n\n now = X[i] # (9): now=0 (19): now=22 (29): now=29\n now += 2 * (sx[i] - sx[i - mn]) + 2 * (sy[j] - sy[j - mn - (i < j)]) # (10): now=90 (20): now=98 (30): NO CHANGE\n print(i - mn) # (11): NO CHANGE (21): NO CHANGE (31): NO CHANGE\n ans = max(ans, now) # (12): ans=90 (22): ans=98 (32): NO CHANGE\n\n now = Y[j] # (13): now=67 (23): now=45 (33): now=38\n now += 2 * (sx[i] - sx[i - mn - (i > j)]) + 2 * (sy[j] - sy[j - mn]) # (14): NO CHANGE (24): now=121 (34): now=82\n ans = max(ans, now) # (15): NO CHANGE (25): ans=121 (35): NO CHANGE\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " \n from itertools import accumulate\n L, N = map(int, input().split())\n X = [int(input()) for _ in range(N)]\n Y = [L - x for x in X][::-1]\n \n sx = [0] + list(accumulate(X))\n sy = [0] + list(accumulate(Y))\n \n ans = 0\n for i in range(N):\n j = N - i - 1\n mn = min(i, j)\n \n now = X[i]\n now += 2 * (sx[i] - sx[i - mn]) + 2 * (sy[j] - sy[j - mn - (i < j)])\n- print(i - mn)\n ans = max(ans, now)\n \n now = Y[j]\n now += 2 * (sx[i] - sx[i - mn - (i > j)]) + 2 * (sy[j] - sy[j - mn])\n ans = max(ans, now)\n \n print(ans)\n \n", "FL_content": "\n \n from itertools import accumulate\n L, N = map(int, input().split())\n X = [int(input()) for _ in range(N)]\n Y = [L - x for x in X][::-1]\n \n sx = [0] + list(accumulate(X))\n sy = [0] + list(accumulate(Y))\n \n ans = 0\n for i in range(N):\n j = N - i - 1\n mn = min(i, j)\n \n now = X[i]\n now += 2 * (sx[i] - sx[i - mn]) + 2 * (sy[j] - sy[j - mn - (i < j)])\n- print(i - mn)\n ans = max(ans, now)\n \n now = Y[j]\n now += 2 * (sx[i] - sx[i - mn - (i > j)]) + 2 * (sy[j] - sy[j - mn])\n ans = max(ans, now)\n \n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 25 }, { "user_id": "u357230322", "problem_id": "p02865", "submission1_id": "s294286329-FL", "submission2_id": "s306644077", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nif n%2==0:\n print((n/2)-1)\nelse:\n print((n-1)/2)", "code2": "n=int(input())\nif n%2==0:\n print(int((n/2)-1))\nelse:\n print(int((n-1)/2))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573355968", "date2": "1573356812", "bleu_score": "0.8419798704006486", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 46, "input": "11230\n", "actual_output": "5614.0\n", "expected_output": "5614\n\n", "anno_code": ["n=int(input()) # (0): n=11230\nif n%2==0: # (1): NO CHANGE\n print((n/2)-1)\nelse:\n print((n-1)/2)"], "anno_status": [true], "diff_content": " n=int(input())\n if n%2==0:\n- print((n/2)-1)\n+ print(int((n/2)-1))\n else:\n- print((n-1)/2)\n+ print(int((n-1)/2))\n+\n", "FL_content": "\n n=int(input())\n if n%2==0:\n- print((n/2)-1)\n else:\n- print((n-1)/2)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u022407960", "problem_id": "p02300", "submission1_id": "s832682983-FL", "submission2_id": "s230011031", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) != -1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) != -1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.sort(key=attrgetter('imag', 'real'))\n \n\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "code2": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.reverse()\n \n lower_min = min(lower, key=attrgetter('imag', 'real'))\n \n min_index = lower.index(lower_min)\n lower_right = lower[min_index:]\n lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n lower_right.append(upper[k])\n return lower_right + lower_left\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1480727340", "date2": "1480734264", "bleu_score": "0.8965942243483909", "code1_test_status": [0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0], "code1_test_score": 32, "total_score": 102, "input": "7\n2 1\n0 0\n1 2\n2 2\n4 2\n1 3\n3 3\n", "actual_output": "4\n0 0\n4 2\n3 3\n1 3\n", "expected_output": "5\n0 0\n2 1\n4 2\n3 3\n1 3\n", "anno_code": ["\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9 # (0): EPS=1e-09\n\n\ndef cross(a, b): # (1): cross=\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b): # (2): dot=\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2): # (3): check_ccw=\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon): # (4): convex_check_Andrew=\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) != -1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) != -1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.sort(key=attrgetter('imag', 'real'))\n \n\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))"], "anno_status": [false], "diff_content": " \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n- while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) != -1:\n+ while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n- while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) != -1:\n+ while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n \n- lower.sort(key=attrgetter('imag', 'real'))\n+ lower.reverse()\n \n-\n+ lower_min = min(lower, key=attrgetter('imag', 'real'))\n+ \n+ min_index = lower.index(lower_min)\n+ lower_right = lower[min_index:]\n+ lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n- lower.append(upper[k])\n-\n- return lower\n+ lower_right.append(upper[k])\n+ return lower_right + lower_left\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "FL_content": "\n \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n- elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) != -1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) != -1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n \n lower.sort(key=attrgetter('imag', 'real'))\n \n \n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n \n return lower\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 80 }, { "user_id": "u626468554", "problem_id": "p03945", "submission1_id": "s308087183-FL", "submission2_id": "s987346339", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\ns = list(input())\n\ncnt = 0\n\nfor i in range(len(s)):\n if s[i-1] != s[i]:\n cnt += 1\n\nprint(cnt)\n\n", "code2": "\n\n\n\n\ns = list(input())\n\ncnt = 0\n\nfor i in range(1,len(s)):\n if s[i-1] != s[i]:\n cnt += 1\n\nprint(cnt)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575933488", "date2": "1575933596", "bleu_score": "0.9681638556984854", "code1_test_status": [1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0], "code1_test_score": 25, "total_score": 103, "input": "DVBYB\n", "actual_output": "5\n", "expected_output": "4\n\n", "anno_code": ["\n\n\n\n\ns = list(input()) # (0): s=['D', 'V', 'B', 'Y', 'B']\n\ncnt = 0 # (1): cnt=0\n\nfor i in range(len(s)): # (2): i=0 (5): i=1 ... (17): NO CHANGE\n if s[i-1] != s[i]: # (3): NO CHANGE (6): NO CHANGE ... (15): NO CHANGE\n cnt += 1 # (4): cnt=1 (7): cnt=2 ... (16): cnt=5\n\nprint(cnt)\n\n"], "anno_status": [true], "diff_content": " \n \n \n \n \n s = list(input())\n \n cnt = 0\n \n-for i in range(len(s)):\n+for i in range(1,len(s)):\n if s[i-1] != s[i]:\n cnt += 1\n \n print(cnt)\n \n \n", "FL_content": "\n \n \n \n \n \n s = list(input())\n \n cnt = 0\n \n for i in range(len(s)):\n- if s[i-1] != s[i]:\n cnt += 1\n \n print(cnt)\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u687599294", "problem_id": "p02921", "submission1_id": "s217298216-FL", "submission2_id": "s715105273", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ns,t = input(), input()\n\nc = 1\nfor i in range(len(s)):\n\tif s[i] == t[i]:c+=1\n\t\nprint(c)", "code2": "\ns,t = input(), input()\n\nc = 0\nfor i in range(len(s)):\n\tif s[i] == t[i]:c+=1\n\t\nprint(c)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1567623157", "date2": "1567623197", "bleu_score": "0.9704907832745403", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "TSR\nTTR\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["\ns,t = input(), input() # (0): s=TSR, t=TTR\n\nc = 1 # (1): c=1\nfor i in range(len(s)): # (2): i=0 (4): i=1 ... (8): NO CHANGE\n\tif s[i] == t[i]:c+=1 # (3): c=2 (5): NO CHANGE (7): c=3\n\t\nprint(c)"], "anno_status": [true], "diff_content": " \n s,t = input(), input()\n \n-c = 1\n+c = 0\n for i in range(len(s)):\n \tif s[i] == t[i]:c+=1\n \t\n print(c)\n", "FL_content": "\n \n s,t = input(), input()\n \n-c = 1\n for i in range(len(s)):\n \tif s[i] == t[i]:c+=1\n \t\n print(c)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u687053495", "problem_id": "p02916", "submission1_id": "s137574413-FL", "submission2_id": "s467639503", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nans = 0\nfor i in range(n):\n ai = a[i]\n ans += b[ai - 1]\n if ai < len(c) and i != n - 1:\n ans += c[ai - 1]\n\nprint(ans)", "code2": "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nans = sum(b)\nfor i in range(1, n):\n if a[i] == a[i - 1] + 1:\n ans += c[a[i - 1] - 1]\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568254470", "date2": "1568255048", "bleu_score": "0.806191413778694", "code1_test_status": [1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0], "code1_test_score": 37, "total_score": 103, "input": "4\n2 3 4 1\n7 1 2 48\n45 9 16\n", "actual_output": "67\n", "expected_output": "83\n\n", "anno_code": ["n = int(input()) # (0): n=4\na = list(map(int, input().split())) # (1): a=[2, 3, 4, 1]\nb = list(map(int, input().split())) # (2): b=[7, 1, 2, 48]\nc = list(map(int, input().split())) # (3): c=[45, 9, 16]\n\nans = 0 # (4): ans=0\nfor i in range(n): # (5): i=0 (10): i=1 ... (22): NO CHANGE\n ai = a[i] # (6): ai=2 (11): ai=3 ... (19): ai=1\n ans += b[ai - 1] # (7): ans=1 (12): ans=12 ... (20): ans=67\n if ai < len(c) and i != n - 1: # (8): NO CHANGE (13): NO CHANGE ... (21): NO CHANGE\n ans += c[ai - 1] # (9): ans=10\n\nprint(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n c = list(map(int, input().split()))\n \n-ans = 0\n-for i in range(n):\n- ai = a[i]\n- ans += b[ai - 1]\n- if ai < len(c) and i != n - 1:\n- ans += c[ai - 1]\n+ans = sum(b)\n+for i in range(1, n):\n+ if a[i] == a[i - 1] + 1:\n+ ans += c[a[i - 1] - 1]\n \n print(ans)\n", "FL_content": "\n n = int(input())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n c = list(map(int, input().split()))\n \n ans = 0\n for i in range(n):\n ai = a[i]\n ans += b[ai - 1]\n- if ai < len(c) and i != n - 1:\n ans += c[ai - 1]\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u896240461", "problem_id": "p01102", "submission1_id": "s085644897-FL", "submission2_id": "s590517088", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while 1:\n s1 = input().split('\\\"')\n l1 = len(s1)\n if s1[0] == \".\": break\n s2 = input().split('\\\"')\n l2 = len(s2)\n if l1 != l2:\n print(\"DIFFERENT\")\n continue\n i = 0\n cnt = 0\n while 1:\n if i > l1-2:\n if cnt == 1:\n print(\"CLOSE\")\n break\n else:\n print(\"IDENTICAL\")\n break\n if s1[i] != s2[i]:\n print(\"DIFFERENT\")\n break\n if s1[i+1] != s2[i+1]:\n if cnt == 1:\n print(\"DIFFERENT\")\n break\n else: cnt = 1\n i += 2\n\n", "code2": "while 1:\n s1 = input().split('\"')\n l1 = len(s1)\n if s1[0] == \".\": break\n s2 = input().split('\"')\n l2 = len(s2)\n if l1 != l2:\n print(\"DIFFERENT\")\n continue\n i = 0\n cnt = 0\n\n while 1:\n if s1[i] != s2[i]:\n print(\"DIFFERENT\")\n break\n if i > l1-2:\n if cnt == 1:\n print(\"CLOSE\")\n break\n else:\n print(\"IDENTICAL\")\n break\n if s1[i+1] != s2[i+1]:\n if cnt == 1:\n print(\"DIFFERENT\")\n break\n else: cnt = 1\n i += 2\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526464940", "date2": "1526465981", "bleu_score": "0.9900167540144057", "code1_test_status": [1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1], "code1_test_score": 39, "total_score": 101, "input": "print\"hello\";print133\nprint\"hello\";print123\nread\"B1input\";somve;output;\n;tuptuo;evlos;\"2B\"daer\nread\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"!\"\"\"\"\"\"\n\"\"\"52\"\"#\"\"\nslow\"program\"\nfast\"code\"\n\"super\"fast\"program\"\n\"super\"faster\"prohram\"\nX\"\"\nY\nI\"S\"\"CREAM\"\nI\"CE\"\"BREAM\"\n11\"22\"11\n13\"3\"111\n.\n", "actual_output": "IDENTICAL\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\n", "expected_output": "DIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\n\n", "anno_code": ["while 1: # (0): NO CHANGE (19): NO CHANGE ... (158): NO CHANGE\n s1 = input().split('\\\"') # (1): s1=['print', 'hello', ';print133'] (20): s1=['read', 'B1input', ';somve;output;'] ... (159): s1=['.']\n l1 = len(s1) # (2): l1=3 (21): NO CHANGE ... (160): l1=1\n if s1[0] == \".\": break # (3): NO CHANGE (22): NO CHANGE ... (147): NO CHANGE\n s2 = input().split('\\\"') # (4): s2=['print', 'hello', ';print123'] (23): s2=[';tuptuo;evlos;', '2B', 'daer'] ... (148): s2=['13', '3', '111']\n l2 = len(s2) # (5): l2=3 (24): NO CHANGE ... (149): l2=3\n if l1 != l2: # (6): NO CHANGE (25): NO CHANGE ... (150): NO CHANGE\n print(\"DIFFERENT\") # (119): NO CHANGE\n continue # (120): NO CHANGE\n i = 0 # (7): i=0 (26): i=0 ... (151): i=0\n cnt = 0 # (8): cnt=0 (27): NO CHANGE ... (152): cnt=0\n while 1: # (9): NO CHANGE (14): NO CHANGE ... (153): NO CHANGE\n if i > l1-2: # (10): NO CHANGE (15): NO CHANGE ... (154): NO CHANGE\n if cnt == 1: # (16): NO CHANGE\n print(\"CLOSE\")\n break\n else:\n print(\"IDENTICAL\") # (17): NO CHANGE\n break # (18): NO CHANGE\n if s1[i] != s2[i]: # (11): NO CHANGE (30): NO CHANGE ... (155): NO CHANGE\n print(\"DIFFERENT\") # (31): NO CHANGE (91): NO CHANGE ... (156): NO CHANGE\n break # (32): NO CHANGE (92): NO CHANGE ... (157): NO CHANGE\n if s1[i+1] != s2[i+1]: # (12): NO CHANGE (45): NO CHANGE ... (140): NO CHANGE\n if cnt == 1: # (46): NO CHANGE (53): NO CHANGE ... (141): NO CHANGE\n print(\"DIFFERENT\") # (54): NO CHANGE (77): NO CHANGE (142): NO CHANGE\n break # (55): NO CHANGE (78): NO CHANGE (143): NO CHANGE\n else: cnt = 1 # (47): cnt=1 (70): cnt=1 (135): cnt=1\n i += 2 # (13): i=2 (48): i=2 ... (136): i=2\n\n"], "anno_status": [false], "diff_content": " while 1:\n- s1 = input().split('\\\"')\n+ s1 = input().split('\"')\n l1 = len(s1)\n if s1[0] == \".\": break\n- s2 = input().split('\\\"')\n+ s2 = input().split('\"')\n l2 = len(s2)\n if l1 != l2:\n print(\"DIFFERENT\")\n continue\n i = 0\n cnt = 0\n+\n while 1:\n+ if s1[i] != s2[i]:\n+ print(\"DIFFERENT\")\n+ break\n if i > l1-2:\n if cnt == 1:\n print(\"CLOSE\")\n break\n else:\n print(\"IDENTICAL\")\n break\n- if s1[i] != s2[i]:\n- print(\"DIFFERENT\")\n- break\n if s1[i+1] != s2[i+1]:\n if cnt == 1:\n print(\"DIFFERENT\")\n break\n else: cnt = 1\n i += 2\n \n-\n", "FL_content": "\n while 1:\n s1 = input().split('\\\"')\n l1 = len(s1)\n if s1[0] == \".\": break\n s2 = input().split('\\\"')\n l2 = len(s2)\n if l1 != l2:\n print(\"DIFFERENT\")\n continue\n i = 0\n cnt = 0\n while 1:\n if i > l1-2:\n if cnt == 1:\n print(\"CLOSE\")\n break\n else:\n print(\"IDENTICAL\")\n break\n if s1[i] != s2[i]:\n print(\"DIFFERENT\")\n break\n if s1[i+1] != s2[i+1]:\n if cnt == 1:\n print(\"DIFFERENT\")\n break\n else: cnt = 1\n i += 2\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 30 }, { "user_id": "u762471013", "problem_id": "p03377", "submission1_id": "s042682769-FL", "submission2_id": "s051782709", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A,B,X=map(int,input().split())\nif A<=X<=B:\n print(\"YES\")\nelse:\n print(\"NO\")", "code2": "A,B,X=map(int,input().split())\nif A<=X<=A+B:\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1523754769", "date2": "1523754997", "bleu_score": "0.9567517979328872", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 83, "total_score": 87, "input": "3 0 3\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["A,B,X=map(int,input().split()) # (0): A=3, B=0, X=3\nif A<=X<=B: # (1): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")"], "anno_status": [true], "diff_content": " A,B,X=map(int,input().split())\n-if A<=X<=B:\n+if A<=X<=A+B:\n print(\"YES\")\n else:\n print(\"NO\")\n", "FL_content": "\n A,B,X=map(int,input().split())\n-if A<=X<=B:\n print(\"YES\")\n else:\n print(\"NO\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u346812984", "problem_id": "p03437", "submission1_id": "s234444159-FL", "submission2_id": "s512892767", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X, Y = map(int, input().split())\nif Y % X == 0:\n print(-1)\nelse:\n print(X)\n", "code2": "X, Y = map(int, input().split())\nif X % Y == 0:\n print(-1)\nelse:\n print(X)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587948649", "date2": "1587948855", "bleu_score": "0.9607478081901534", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 24, "total_score": 25, "input": "-6 12\n", "actual_output": "-1\n", "expected_output": "-6\n\n", "anno_code": ["X, Y = map(int, input().split()) # (0): X=-6, Y=12\nif Y % X == 0: # (1): NO CHANGE\n print(-1)\nelse:\n print(X)\n"], "anno_status": [true], "diff_content": " X, Y = map(int, input().split())\n-if Y % X == 0:\n+if X % Y == 0:\n print(-1)\n else:\n print(X)\n \n", "FL_content": "\n X, Y = map(int, input().split())\n-if Y % X == 0:\n print(-1)\n else:\n print(X)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u677523557", "problem_id": "p04008", "submission1_id": "s268594505-FL", "submission2_id": "s829073815", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\n\nN, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nans = 0\ngraph = [[] for _ in range(N)]\nPar = [-1]*N\nfor i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n Par[i] = a-1\n graph[a-1].append(i)\n\nqs = []\n\nstack = [0]\nDepth = [-1]*N\nDepth[0] = 0\nwhile stack:\n p = stack.pop()\n for np in graph[p]:\n Depth[np] = Depth[p] + 1\n stack.append(np)\n qs.append((Depth[p], p))\n\nqs.sort(reverse=True)\nchecked = [False]*N\n\nfor d, s in qs:\n if d <= K: break\n if checked[s]: continue\n\n for _ in range(K-1):\n s = Par[s]\n \n que = [s]\n while que:\n qq = []\n for p in que:\n for np in graph[p]:\n if not checked[np]:\n checked[np] = True\n qq.append(np)\n que = qq\n \n ans += 1\n\nprint(ans)", "code2": "import sys\ninput = sys.stdin.readline\n\n\nN, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nans = 0\ngraph = [[] for _ in range(N)]\nPar = [-1]*N\nfor i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n Par[i] = a-1\n graph[a-1].append(i)\n\nqs = []\n\nstack = [0]\nDepth = [-1]*N\nDepth[0] = 0\nwhile stack:\n p = stack.pop()\n for np in graph[p]:\n Depth[np] = Depth[p] + 1\n stack.append(np)\n qs.append((Depth[p], p))\n\nqs.sort(reverse=True)\nchecked = [False]*N\n\nfor d, s in qs:\n if d <= K: break\n if checked[s]: continue\n\n for _ in range(K-1):\n s = Par[s]\n \n que = [s]\n checked[s] = True\n while que:\n qq = []\n for p in que:\n for np in graph[p]:\n if not checked[np]:\n checked[np] = True\n qq.append(np)\n que = qq\n \n ans += 1\n\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1591570852", "date2": "1591571270", "bleu_score": "0.9763313262875812", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 90, "total_score": 97, "input": "8 2\n4 1 2 3 1 2 4 7\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\n\nN, K = map(int, input().split()) # (1): N=8, K=2\nA = list(map(int, input().split())) # (2): A=[4, 1, 2, 3, 1, 2, 4, 7]\n\nans = 0 # (3): ans=0\ngraph = [[] for _ in range(N)] # (4): graph\nPar = [-1]*N # (5): Par=[-1, -1, -1, -1, -1, -1, -1, -1]\nfor i, a in enumerate(A): # (6): i=0, a=4 (11): i=1, a=1 ... (39): graph\n if i == 0: # (7): NO CHANGE (12): NO CHANGE ... (36): graph\n if a != 1: # (8): NO CHANGE\n ans += 1 # (9): ans=1\n continue # (10): NO CHANGE\n Par[i] = a-1 # (13): Par=[-1, 0, -1, -1, -1, -1, -1, -1] (17): graph=[[1], [], [], [], [], [], [], []], Par=[-1, 0, 1, -1, -1, -1, -1, -1] ... (37): graph, Par=[-1, 0, 1, 2, 0, 1, 3, 6]\n graph[a-1].append(i) # (14): graph (18): graph ... (38): graph\n\nqs = [] # (40): graph, qs=[]\n\nstack = [0] # (41): graph, stack=[0]\nDepth = [-1]*N # (42): graph, Depth=[-1, -1, -1, -1, -1, -1, -1, -1]\nDepth[0] = 0 # (43): graph, Depth=[0, -1, -1, -1, -1, -1, -1, -1]\nwhile stack: # (44): graph (54): graph ... (97): graph\n p = stack.pop() # (45): graph=[[1, 4], [2, 5], [3], [6], [], [], [7], []], stack=[], p=0 (55): graph=[[1, 4], [2, 5], [3], [6], [], [], [7], []], stack=[1], p=4 ... (94): graph=[[1, 4], [2, 5], [3], [6], [], [], [7], []], stack=[], p=7\n for np in graph[p]: # (46): graph, np=1 (49): graph, np=4 ... (95): graph\n Depth[np] = Depth[p] + 1 # (47): graph, Depth=[0, 1, -1, -1, -1, -1, -1, -1] (50): graph, Depth=[0, 1, -1, -1, 1, -1, -1, -1] ... (89): graph, Depth=[0, 1, 2, 3, 1, 2, 4, 5]\n stack.append(np) # (48): graph, stack=[1] (51): graph, stack=[1, 4] ... (90): graph, stack=[7]\n qs.append((Depth[p], p)) # (53): graph, qs=[(0, 0)] (57): graph, qs=[(0, 0), (1, 4)] ... (96): graph, qs=[(0, 0), (1, 4), (1, 1), (2, 5), (2, 2), (3, 3), (4, 6), (5, 7)]\n\nqs.sort(reverse=True) # (98): graph, qs=[(5, 7), (4, 6), (3, 3), (2, 5), (2, 2), (1, 4), (1, 1), (0, 0)]\nchecked = [False]*N # (99): graph, checked=[False, False, False, False, False, False, False, False]\n\nfor d, s in qs: # (100): graph, d=5, s=7 (125): graph, d=4 ... (179): graph, d=2, s=5\n if d <= K: break # (101): graph (126): graph ... (180): graph\n if checked[s]: continue # (102): graph (127): graph (154): graph\n\n for _ in range(K-1): # (103): graph, _=0 (105): graph ... (157): graph\n s = Par[s] # (104): graph, s=6 (129): graph, s=3 (156): graph, s=2\n \n que = [s] # (106): graph, que=[6] (131): graph, que=[3] (158): graph, que=[2]\n while que: # (107): graph (117): graph ... (177): graph\n qq = [] # (108): graph, qq=[] (118): graph, qq=[] ... (170): graph, qq=[]\n for p in que: # (109): graph, p=6 (115): graph ... (175): graph\n for np in graph[p]: # (110): graph (114): graph ... (174): graph\n if not checked[np]: # (111): graph (136): graph ... (173): graph\n checked[np] = True # (112): graph, checked=[False, False, False, False, False, False, False, True] (137): graph, checked=[False, False, False, False, False, False, True, True] (164): graph, checked=[False, False, False, True, False, False, True, True]\n qq.append(np) # (113): graph, qq=[7] (138): graph, qq=[6] (165): graph, qq=[3]\n que = qq # (116): graph, que=[7] (122): graph, que=[] ... (176): graph, que=[]\n \n ans += 1 # (124): ans=2, graph (151): ans=3, graph (178): ans=4, graph\n\nprint(ans)"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n \n \n N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n ans = 0\n graph = [[] for _ in range(N)]\n Par = [-1]*N\n for i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n Par[i] = a-1\n graph[a-1].append(i)\n \n qs = []\n \n stack = [0]\n Depth = [-1]*N\n Depth[0] = 0\n while stack:\n p = stack.pop()\n for np in graph[p]:\n Depth[np] = Depth[p] + 1\n stack.append(np)\n qs.append((Depth[p], p))\n \n qs.sort(reverse=True)\n checked = [False]*N\n \n for d, s in qs:\n if d <= K: break\n if checked[s]: continue\n \n for _ in range(K-1):\n s = Par[s]\n \n que = [s]\n+ checked[s] = True\n while que:\n qq = []\n for p in que:\n for np in graph[p]:\n if not checked[np]:\n checked[np] = True\n qq.append(np)\n que = qq\n \n ans += 1\n \n print(ans)\n", "FL_content": "\n import sys\n input = sys.stdin.readline\n \n \n N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n ans = 0\n graph = [[] for _ in range(N)]\n Par = [-1]*N\n for i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n Par[i] = a-1\n graph[a-1].append(i)\n \n qs = []\n \n stack = [0]\n Depth = [-1]*N\n Depth[0] = 0\n while stack:\n p = stack.pop()\n for np in graph[p]:\n Depth[np] = Depth[p] + 1\n stack.append(np)\n qs.append((Depth[p], p))\n \n qs.sort(reverse=True)\n checked = [False]*N\n \n for d, s in qs:\n if d <= K: break\n if checked[s]: continue\n \n for _ in range(K-1):\n s = Par[s]\n \n que = [s]\n while que:\n qq = []\n for p in que:\n for np in graph[p]:\n if not checked[np]:\n checked[np] = True\n qq.append(np)\n que = qq\n \n ans += 1\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 53 }, { "user_id": "u329058683", "problem_id": "p03338", "submission1_id": "s859177970-FL", "submission2_id": "s143604135", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nL=list(input())\nans=[]\nfor i in range(N):\n a=set(L[:i+1])\n b=set(L[i+1:])\n ans.append(a & b)\nprint(len(max(ans)))", "code2": "N=int(input())\nL=list(input())\nans=[]\nfor i in range(N):\n a=set(L[:i+1])\n b=set(L[i+1:])\n ans.append(len(a & b))\nprint(max(ans))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559649814", "date2": "1559650002", "bleu_score": "0.9722819910077517", "code1_test_status": [1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0], "code1_test_score": 58, "total_score": 103, "input": "10\na_a``bccbb\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["N=int(input()) # (0): N=10\nL=list(input()) # (1): L=['a', '_', 'a', '`', '`', 'b', 'c', 'c', 'b', 'b']\nans=[] # (2): ans=[]\nfor i in range(N): # (3): i=0 (7): i=1 ... (43): NO CHANGE\n a=set(L[:i+1]) # (4): a={'a'} (8): a={'a', '_'} ... (40): NO CHANGE\n b=set(L[i+1:]) # (5): b={'_', 'a', 'c', 'b', '`'} (9): b={'a', 'b', '`', 'c'} ... (41): b=set()\n ans.append(a & b) # (6): ans=[{'a'}] (10): ans=[{'a'}, {'a'}] ... (42): ans=[{'a'}, {'a'}, set(), {'`'}, set(), {'b'}, {'b', 'c'}, {'b'}, {'b'}, set()]\nprint(len(max(ans)))"], "anno_status": [true], "diff_content": " N=int(input())\n L=list(input())\n ans=[]\n for i in range(N):\n a=set(L[:i+1])\n b=set(L[i+1:])\n- ans.append(a & b)\n-print(len(max(ans)))\n+ ans.append(len(a & b))\n+print(max(ans))\n", "FL_content": "\n N=int(input())\n L=list(input())\n ans=[]\n for i in range(N):\n- a=set(L[:i+1])\n- b=set(L[i+1:])\n ans.append(a & b)\n print(len(max(ans)))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u777181309", "problem_id": "p02396", "submission1_id": "s034311973-FL", "submission2_id": "s109252967", "status1": "Wrong Answer", "status2": "Accepted", "code1": "i = 0\n\nwhile True:\n num = int(input())\n if num == 0:\n break\n print('Case {}: {}'.format(i, num))\n i = i+1\n", "code2": "i = 1\n\nwhile True:\n num = int(input())\n if num == 0:\n break\n print('Case {}: {}'.format(i, num))\n i+=1\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556768662", "date2": "1556768850", "bleu_score": "0.9368111280637691", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3\n14\n4\n12\n0\n28\n0\n", "actual_output": "Case 0: 3\nCase 1: 14\nCase 2: 4\nCase 3: 12\n", "expected_output": "Case 1: 3\nCase 2: 14\nCase 3: 4\nCase 4: 12\n\n", "anno_code": ["i = 0 # (0): i=0\n\nwhile True: # (1): NO CHANGE (6): NO CHANGE ... (21): NO CHANGE\n num = int(input()) # (2): num=3 (7): num=14 ... (22): num=0\n if num == 0: # (3): NO CHANGE (8): NO CHANGE ... (23): NO CHANGE\n break\n print('Case {}: {}'.format(i, num)) # (4): NO CHANGE (9): NO CHANGE ... (19): NO CHANGE\n i = i+1 # (5): i=1 (10): i=2 ... (20): i=4\n"], "anno_status": [true], "diff_content": "-i = 0\n+i = 1\n \n while True:\n num = int(input())\n if num == 0:\n break\n print('Case {}: {}'.format(i, num))\n- i = i+1\n+ i+=1\n \n", "FL_content": "\n i = 0\n \n while True:\n num = int(input())\n if num == 0:\n break\n- print('Case {}: {}'.format(i, num))\n i = i+1\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u344890307", "problem_id": "p02401", "submission1_id": "s441015998-FL", "submission2_id": "s901705488", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n a,op,b=input().split()\n a=int(a)\n b=int(b)\n if op == \"+\":\n print(a+b)\n elif op ==\"-\":\n print(a-b)\n elif op ==\"*\":\n print(a*b)\n elif op ==\"/\":\n print(a/float(b))\n elif a==\"?\" or b==\"?\" or op==\"?\":\n break\n", "code2": "while True:\n a,op,b = input().split()\n a=int(a)\n op=str(op)\n b=int(b)\n \n if op=='?':\n break\n elif op=='+':\n print(\"{:d}\".format(a+b))\n elif op=='-':\n print(\"{:d}\".format(a-b))\n elif op=='/':\n print(\"{:d}\".format(a\n elif op==\"*\":\n print(\"{:d}\".format(a*b))\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556520050", "date2": "1556677828", "bleu_score": "0.6402887031953736", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "1 + 2\n56 - 18\n21 * 3\n100 / 10\n31 , 81\n-1 ? -1\n", "actual_output": "3\n38\n63\n10.0\n", "expected_output": "3\n38\n63\n10\n(31, 81)\n\n", "anno_code": ["while True: # (0): NO CHANGE (6): NO CHANGE ... (39): NO CHANGE\n a,op,b=input().split() # (1): a=1, op=+, b=2 (7): a=56, op=-, b=18 ... (40): a=-1, op=?, b=-1\n a=int(a) # (2): a=1 (8): a=56 ... (41): a=-1\n b=int(b) # (3): b=2 (9): b=18 ... (42): b=-1\n if op == \"+\": # (4): NO CHANGE (10): NO CHANGE ... (43): NO CHANGE\n print(a+b) # (5): NO CHANGE\n elif op ==\"-\": # (11): NO CHANGE (18): NO CHANGE ... (44): NO CHANGE\n print(a-b) # (12): NO CHANGE\n elif op ==\"*\": # (19): NO CHANGE (27): NO CHANGE ... (45): NO CHANGE\n print(a*b) # (20): NO CHANGE\n elif op ==\"/\": # (28): NO CHANGE (37): NO CHANGE (46): NO CHANGE\n print(a/float(b)) # (29): NO CHANGE\n elif a==\"?\" or b==\"?\" or op==\"?\": # (38): NO CHANGE (47): NO CHANGE\n break\n"], "anno_status": [true], "diff_content": " while True:\n- a,op,b=input().split()\n- a=int(a)\n- b=int(b)\n- if op == \"+\":\n- print(a+b)\n- elif op ==\"-\":\n- print(a-b)\n- elif op ==\"*\":\n- print(a*b)\n- elif op ==\"/\":\n- print(a/float(b))\n- elif a==\"?\" or b==\"?\" or op==\"?\":\n- break\n+ a,op,b = input().split()\n+ a=int(a)\n+ op=str(op)\n+ b=int(b)\n+ \n+ if op=='?':\n+ break\n+ elif op=='+':\n+ print(\"{:d}\".format(a+b))\n+ elif op=='-':\n+ print(\"{:d}\".format(a-b))\n+ elif op=='/':\n+ print(\"{:d}\".format(a\n+ elif op==\"*\":\n+ print(\"{:d}\".format(a*b))\n \n", "FL_content": "\n while True:\n a,op,b=input().split()\n a=int(a)\n b=int(b)\n if op == \"+\":\n print(a+b)\n elif op ==\"-\":\n print(a-b)\n elif op ==\"*\":\n print(a*b)\n elif op ==\"/\":\n- print(a/float(b))\n elif a==\"?\" or b==\"?\" or op==\"?\":\n break\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u699089116", "problem_id": "p03523", "submission1_id": "s716449822-FL", "submission2_id": "s116972158", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import re\ns = input()\n\npattern = r\"A?KIHA?BA?RA?\"\n\nprint(\"Yes\" if re.search(pattern, s) else \"No\")", "code2": "import re\ns = input()\n\npattern = r\"^A?KIHA?BA?RA?$\"\n\nprint(\"YES\" if re.search(pattern, s) else \"NO\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1584419512", "date2": "1584419732", "bleu_score": "0.8893224662479466", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "PBHIJ\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["import re\ns = input() # (0): s=PBHIJ\n\npattern = r\"A?KIHA?BA?RA?\" # (1): pattern=A?KIHA?BA?RA?\n\nprint(\"Yes\" if re.search(pattern, s) else \"No\")"], "anno_status": [true], "diff_content": " import re\n s = input()\n \n-pattern = r\"A?KIHA?BA?RA?\"\n+pattern = r\"^A?KIHA?BA?RA?$\"\n \n-print(\"Yes\" if re.search(pattern, s) else \"No\")\n+print(\"YES\" if re.search(pattern, s) else \"NO\")\n", "FL_content": "\n import re\n s = input()\n \n pattern = r\"A?KIHA?BA?RA?\"\n \n-print(\"Yes\" if re.search(pattern, s) else \"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u884012707", "problem_id": "p02419", "submission1_id": "s849583306-FL", "submission2_id": "s668358065", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\nW=input().lower()\ncount=0\nwhile True:\n line=input().split()\n if line==[\"END_OF_TEXT\"]:\n break\n print(line)\n count+=Counter(map(lambda x:x.lower(),line))[W]\nprint(count)", "code2": "from collections import Counter\nW=input().lower()\ncount=0\nwhile True:\n line=input().split()\n if line==[\"END_OF_TEXT\"]:\n break\n count+=Counter(map(lambda x:x.lower(),line))[W]\nprint(count)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1496737502", "date2": "1496737525", "bleu_score": "0.9242083608647104", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "comquter\nserutruN computer scitntisfs apd highlx-skilled computer engineers\nwho lliw create and siolpxe \"knowledge\" for the enw era.\nProvides an sutotanding ctmpuoer envjronment.\nEND_OF_TEXT\n", "actual_output": "['serutruN', 'computer', 'scitntisfs', 'apd', 'highlx-skilled', 'computer', 'engineers']\n['who', 'lliw', 'create', 'and', 'siolpxe', '\"knowledge\"', 'for', 'the', 'enw', 'era.']\n['Provides', 'an', 'sutotanding', 'ctmpuoer', 'envjronment.']\n0\n", "expected_output": "0\n\n", "anno_code": ["from collections import Counter\nW=input().lower() # (0): W=comquter\ncount=0 # (1): count=0\nwhile True: # (2): NO CHANGE (7): NO CHANGE ... (17): NO CHANGE\n line=input().split() # (3): line=['serutruN', 'computer', 'scitntisfs', 'apd', 'highlx-skilled', 'computer', 'engineers'] (8): line=['who', 'lliw', 'create', 'and', 'siolpxe', '\"knowledge\"', 'for', 'the', 'enw', 'era.'] ... (18): line=['END_OF_TEXT']\n if line==[\"END_OF_TEXT\"]: # (4): NO CHANGE (9): NO CHANGE ... (19): NO CHANGE\n break # (20): NO CHANGE\n print(line) # (5): NO CHANGE (10): NO CHANGE (15): NO CHANGE\n count+=Counter(map(lambda x:x.lower(),line))[W] # (6): NO CHANGE (11): NO CHANGE (16): NO CHANGE\nprint(count)"], "anno_status": [true], "diff_content": " from collections import Counter\n W=input().lower()\n count=0\n while True:\n line=input().split()\n if line==[\"END_OF_TEXT\"]:\n break\n- print(line)\n count+=Counter(map(lambda x:x.lower(),line))[W]\n print(count)\n", "FL_content": "\n from collections import Counter\n W=input().lower()\n count=0\n while True:\n line=input().split()\n if line==[\"END_OF_TEXT\"]:\n break\n- print(line)\n count+=Counter(map(lambda x:x.lower(),line))[W]\n print(count)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u114366889", "problem_id": "p02933", "submission1_id": "s931000513-FL", "submission2_id": "s942892890", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\ns = str(input())\nif a > 3200:\n\tprint(s)\nelse:\n\tprint('red')", "code2": "a = int(input())\ns = str(input())\nif a >= 3200:\n\tprint(s)\nelse:\n\tprint('red')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566177028", "date2": "1566177123", "bleu_score": "0.9665395661812441", "code1_test_status": [1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1], "code1_test_score": 53, "total_score": 103, "input": "3200\nnhoo\n", "actual_output": "red\n", "expected_output": "nhoo\n\n", "anno_code": ["a = int(input()) # (0): a=3200\ns = str(input()) # (1): s=nhoo\nif a > 3200: # (2): NO CHANGE\n\tprint(s)\nelse:\n\tprint('red')"], "anno_status": [true], "diff_content": " a = int(input())\n s = str(input())\n-if a > 3200:\n+if a >= 3200:\n \tprint(s)\n else:\n \tprint('red')\n", "FL_content": "\n a = int(input())\n s = str(input())\n-if a > 3200:\n \tprint(s)\n else:\n \tprint('red')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u067975558", "problem_id": "p02420", "submission1_id": "s466443071-FL", "submission2_id": "s462606582", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = []\nn = []\nwhile True:\n hoge = input()\n if len(hoge) == 1:\n if hoge == '-':\n break\n s[0] = s[0].replace(s[0],s[0][int(hoge):]+s[0][:int(hoge)])\n else:\n s += [hoge]\nfor i in s: print(i)", "code2": "s = []\nwhile True:\n hoge = input()\n if hoge == '-':\n break\n num = int(input())\n for i in range(num):\n h = int(input())\n hoge = hoge.replace(hoge,hoge[h:] + hoge[:h])\n s += [hoge]\nfor i in s: print(i)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1423192587", "date2": "1423198398", "bleu_score": "0.6903926189370615", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "caaa\n3\n1\n-2\n2\nwwxyz\n2\n3\n4\n-\n", "actual_output": "acaa\n-2\nwwxyz\n", "expected_output": "aaac\nxyzww\n\n", "anno_code": ["s = [] # (0): s=[]\nn = [] # (1): n=[]\nwhile True: # (2): NO CHANGE (6): NO CHANGE ... (44): NO CHANGE\n hoge = input() # (3): hoge=caaa (7): hoge=3 ... (45): hoge=-\n if len(hoge) == 1: # (4): NO CHANGE (8): NO CHANGE ... (46): NO CHANGE\n if hoge == '-': # (9): NO CHANGE (14): NO CHANGE ... (47): NO CHANGE\n break # (48): NO CHANGE\n s[0] = s[0].replace(s[0],s[0][int(hoge):]+s[0][:int(hoge)]) # (10): s=['acaa'] (15): s=['caaa'] ... (43): NO CHANGE\n else:\n s += [hoge] # (5): s=['caaa'] (19): s=['caaa', '-2'] (28): s=['aaca', '-2', 'wwxyz']\nfor i in s: print(i) # (49): i=acaa (50): i=-2 (51): i=wwxyz\n"], "anno_status": [true], "diff_content": " s = []\n-n = []\n while True:\n hoge = input()\n- if len(hoge) == 1:\n- if hoge == '-':\n- break\n- s[0] = s[0].replace(s[0],s[0][int(hoge):]+s[0][:int(hoge)])\n- else:\n- s += [hoge]\n+ if hoge == '-':\n+ break\n+ num = int(input())\n+ for i in range(num):\n+ h = int(input())\n+ hoge = hoge.replace(hoge,hoge[h:] + hoge[:h])\n+ s += [hoge]\n for i in s: print(i)\n", "FL_content": "\n s = []\n n = []\n while True:\n hoge = input()\n if len(hoge) == 1:\n if hoge == '-':\n break\n- s[0] = s[0].replace(s[0],s[0][int(hoge):]+s[0][:int(hoge)])\n else:\n s += [hoge]\n for i in s: print(i)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u256901785", "problem_id": "p02595", "submission1_id": "s021670748-FL", "submission2_id": "s139275102", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nn,d = map(int,input().split(' '))\nx,y = [0]*n,[0]*n\nfor i in range(n):\n x[i],y[i] = map(int,input().split(' '))\n \nans = 0 \n \nfor i in range(n):\n distane = math.sqrt(x[i]*x[i] + y[i]*y[i])\n if distane >= d:\n ans += 1\nprint(ans)", "code2": "import math\n\nn,d = map(int,input().split(' '))\nx,y = [0]*n,[0]*n\nfor i in range(n):\n x[i],y[i] = map(int,input().split(' '))\n \nans = 0 \n \nfor i in range(n):\n distane = math.sqrt(x[i]*x[i] + y[i]*y[i])\n if distane <= d:\n ans += 1\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597502713", "date2": "1597502957", "bleu_score": "0.989908759189579", "code1_test_status": [0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0], "code1_test_score": 12, "total_score": 103, "input": "12 2\n0 1\n2 2\n1 1\n1 2\n0 2\n0 3\n2 1\n2 2\n2 3\n3 1\n3 2\n10 3\n", "actual_output": "10\n", "expected_output": "3\n\n", "anno_code": ["import math\n\nn,d = map(int,input().split(' ')) # (0): n=12, d=2\nx,y = [0]*n,[0]*n # (1): x=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], y=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(n): # (2): i=0 (4): i=1 ... (26): NO CHANGE\n x[i],y[i] = map(int,input().split(' ')) # (3): y=[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (5): x=[0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], y=[1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (25): x=[0, 2, 1, 1, 0, 0, 2, 2, 2, 3, 3, 10], y=[1, 2, 1, 2, 2, 3, 1, 2, 3, 1, 2, 3]\n \nans = 0 # (27): ans=0\n \nfor i in range(n): # (28): i=0 (31): i=1 ... (74): NO CHANGE\n distane = math.sqrt(x[i]*x[i] + y[i]*y[i]) # (29): distane=1.0 (32): distane=2.828427 ... (71): distane=10.440307\n if distane >= d: # (30): NO CHANGE (33): NO CHANGE ... (72): NO CHANGE\n ans += 1 # (34): ans=1 (41): ans=2 ... (73): ans=10\nprint(ans)"], "anno_status": [true], "diff_content": " import math\n \n n,d = map(int,input().split(' '))\n x,y = [0]*n,[0]*n\n for i in range(n):\n x[i],y[i] = map(int,input().split(' '))\n \n ans = 0 \n \n for i in range(n):\n distane = math.sqrt(x[i]*x[i] + y[i]*y[i])\n- if distane >= d:\n+ if distane <= d:\n ans += 1\n print(ans)\n", "FL_content": "\n import math\n \n n,d = map(int,input().split(' '))\n x,y = [0]*n,[0]*n\n for i in range(n):\n x[i],y[i] = map(int,input().split(' '))\n \n ans = 0 \n \n for i in range(n):\n- distane = math.sqrt(x[i]*x[i] + y[i]*y[i])\n- if distane >= d:\n ans += 1\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u485673106", "problem_id": "p02909", "submission1_id": "s843612829-FL", "submission2_id": "s670420787", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nif S == \"Sunny\":\n\tprint(\"Cloudy\")\nelif S == \"Cloudy\":\n\tprint(\"Rainy\")\nelse:\n\tprint(\"Rainy\")", "code2": "S = input()\nif S == \"Sunny\":\n\tprint(\"Cloudy\")\nelif S == \"Cloudy\":\n\tprint(\"Rainy\")\nelse:\n\tprint(\"Sunny\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568762424", "date2": "1568762489", "bleu_score": "0.9554689933959511", "code1_test_status": [0, 1], "code1_test_score": 1, "total_score": 2, "input": "Rainy\n", "actual_output": "Rainy\n", "expected_output": "Sunny\n", "anno_code": ["S = input() # (0): S=Rainy\nif S == \"Sunny\": # (1): NO CHANGE\n\tprint(\"Cloudy\")\nelif S == \"Cloudy\": # (2): NO CHANGE\n\tprint(\"Rainy\")\nelse:\n\tprint(\"Rainy\")"], "anno_status": [true], "diff_content": " S = input()\n if S == \"Sunny\":\n \tprint(\"Cloudy\")\n elif S == \"Cloudy\":\n \tprint(\"Rainy\")\n else:\n-\tprint(\"Rainy\")\n+\tprint(\"Sunny\")\n", "FL_content": "\n S = input()\n if S == \"Sunny\":\n \tprint(\"Cloudy\")\n elif S == \"Cloudy\":\n \tprint(\"Rainy\")\n else:\n-\tprint(\"Rainy\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u300095814", "problem_id": "p02276", "submission1_id": "s531089197-FL", "submission2_id": "s160994108", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nA = list(map(int, input().split()))\n\ndef partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x :\n i += 1\n A[i], A[j] = A[j], A[i]\n\n A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n\nb = partition(A, 0, n-1)\nA[b] = '[{0}]'.format(b)\nprint(' '.join(map(str, A)))\n", "code2": "n = int(input())\nA = list(map(int, input().split()))\n\ndef partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x :\n i += 1\n A[i], A[j] = A[j], A[i]\n\n A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n\nb = partition(A, 0, n-1)\nA[b] = '[{0}]'.format(A[b])\nprint(' '.join(map(str, A)))\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1530596872", "date2": "1530596935", "bleu_score": "0.9847371323849777", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 101, "input": "12\n40 19 9 1 12 8 8 6 21 0 10 22\n", "actual_output": "19 9 1 12 8 8 6 21 0 10 [10] 40\n", "expected_output": "19 9 1 12 8 8 6 21 0 10 [22] 40\n\n", "anno_code": ["n = int(input()) # (0): n=12\nA = list(map(int, input().split())) # (1): A=[40, 19, 9, 1, 12, 8, 8, 6, 21, 0, 10, 22]\n\ndef partition(A, p, r): # (2): partition=\n x = A[r] # (4): x=22\n i = p - 1 # (5): i=-1\n for j in range(p, r): # (6): j=0 (8): j=1 ... (48): NO CHANGE\n if A[j] <= x : # (7): NO CHANGE (9): NO CHANGE ... (45): NO CHANGE\n i += 1 # (10): i=0 (14): i=1 ... (46): i=9\n A[i], A[j] = A[j], A[i] # (11): A=[19, 40, 9, 1, 12, 8, 8, 6, 21, 0, 10, 22] (15): A=[19, 9, 40, 1, 12, 8, 8, 6, 21, 0, 10, 22] ... (47): A=[19, 9, 1, 12, 8, 8, 6, 21, 0, 10, 40, 22]\n\n A[i + 1], A[r] = A[r], A[i + 1] # (49): n=12, A=[19, 9, 1, 12, 8, 8, 6, 21, 0, 10, 22, 40], partition=, b=10\n return i + 1\n\nb = partition(A, 0, n-1) # (3): p=0, r=11\nA[b] = '[{0}]'.format(b) # (50): A=[19, 9, 1, 12, 8, 8, 6, 21, 0, 10, '[10]', 40]\nprint(' '.join(map(str, A)))\n"], "anno_status": [true], "diff_content": " n = int(input())\n A = list(map(int, input().split()))\n \n def partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x :\n i += 1\n A[i], A[j] = A[j], A[i]\n \n A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n \n b = partition(A, 0, n-1)\n-A[b] = '[{0}]'.format(b)\n+A[b] = '[{0}]'.format(A[b])\n print(' '.join(map(str, A)))\n \n", "FL_content": "\n n = int(input())\n A = list(map(int, input().split()))\n \n def partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x :\n i += 1\n A[i], A[j] = A[j], A[i]\n \n A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n \n-b = partition(A, 0, n-1)\n-A[b] = '[{0}]'.format(b)\n print(' '.join(map(str, A)))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u022407960", "problem_id": "p02300", "submission1_id": "s768462614-FL", "submission2_id": "s230011031", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n lower.reverse()\n\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n ans.sort(key=attrgetter('imag', 'real'))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "code2": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.reverse()\n \n lower_min = min(lower, key=attrgetter('imag', 'real'))\n \n min_index = lower.index(lower_min)\n lower_right = lower[min_index:]\n lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n lower_right.append(upper[k])\n return lower_right + lower_left\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1480731369", "date2": "1480734264", "bleu_score": "0.8928917419292481", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "4\n1 1\n3 0\n0 2\n0 1\n", "actual_output": "3 0\n0 1\n0 2\n", "expected_output": "3\n3 0\n0 2\n0 1\n\n", "anno_code": ["\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9 # (0): EPS=1e-09\n\n\ndef cross(a, b): # (1): cross=\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b): # (2): dot=\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2): # (3): check_ccw=\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon): # (4): convex_check_Andrew=\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n lower.reverse()\n\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n ans.sort(key=attrgetter('imag', 'real'))\n for ele in ans:\n print(int(ele.real), int(ele.imag))"], "anno_status": [false], "diff_content": " \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n+ \n lower.reverse()\n-\n+ \n+ lower_min = min(lower, key=attrgetter('imag', 'real'))\n+ \n+ min_index = lower.index(lower_min)\n+ lower_right = lower[min_index:]\n+ lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n- lower.append(upper[k])\n-\n- return lower\n+ lower_right.append(upper[k])\n+ return lower_right + lower_left\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n- ans.sort(key=attrgetter('imag', 'real'))\n+ print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "FL_content": "\n \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n- elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n lower.reverse()\n \n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n \n return lower\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n ans.sort(key=attrgetter('imag', 'real'))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 78 }, { "user_id": "u874741582", "problem_id": "p03712", "submission1_id": "s888979543-FL", "submission2_id": "s559420197", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w = map(int,input().split())\nl=[str(input()) for i in range(h)]\np=\"*\"\nprint(p*(w+2))\nfor j in l:\n print(p+j+p)\nprint(p*(w+2))", "code2": "h,w = map(int,input().split())\nl=[str(input()) for i in range(h)]\np=\"\nprint(p*(w+2))\nfor j in l:\n print(p+j+p)\nprint(p*(w+2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565657700", "date2": "1565657869", "bleu_score": "0.9785832780534472", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "2 0\nfba\nbrc\n", "actual_output": "**\n*fba*\n*brc*\n**\n", "expected_output": "##\n#fba#\n#brc#\n##\n\n", "anno_code": ["h,w = map(int,input().split()) # (0): h=2, w=0\nl=[str(input()) for i in range(h)] # (1): l=['fba', 'brc']\np=\"*\" # (2): p=*\nprint(p*(w+2)) # (3): NO CHANGE\nfor j in l: # (4): j=fba (6): j=brc (8): NO CHANGE\n print(p+j+p) # (5): NO CHANGE (7): NO CHANGE\nprint(p*(w+2))"], "anno_status": [true], "diff_content": " h,w = map(int,input().split())\n l=[str(input()) for i in range(h)]\n-p=\"*\"\n+p=\"\n print(p*(w+2))\n for j in l:\n print(p+j+p)\n print(p*(w+2))\n", "FL_content": "\n h,w = map(int,input().split())\n-l=[str(input()) for i in range(h)]\n-p=\"*\"\n-print(p*(w+2))\n for j in l:\n- print(p+j+p)\n-print(p*(w+2))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u246975555", "problem_id": "p02865", "submission1_id": "s642419882-FL", "submission2_id": "s367690282", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nif n % 2 == 0:\n print(n/2 - 1)\nelse:\n print((n-1)/2)", "code2": "n = int(input())\nif n % 2 == 0:\n print(int(n/2 - 1))\nelse:\n print(int((n-1)/2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573499691", "date2": "1573499747", "bleu_score": "0.8645261500563438", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 46, "input": "825\n", "actual_output": "412.0\n", "expected_output": "412\n\n", "anno_code": ["n = int(input()) # (0): n=825\nif n % 2 == 0: # (1): NO CHANGE\n print(n/2 - 1)\nelse:\n print((n-1)/2)"], "anno_status": [true], "diff_content": " n = int(input())\n if n % 2 == 0:\n- print(n/2 - 1)\n+ print(int(n/2 - 1))\n else:\n- print((n-1)/2)\n+ print(int((n-1)/2))\n", "FL_content": "\n n = int(input())\n if n % 2 == 0:\n- print(n/2 - 1)\n else:\n- print((n-1)/2\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u859897687", "problem_id": "p03207", "submission1_id": "s578246842-FL", "submission2_id": "s524254005", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\np=[int(input()) for i in range(n)]\nprint(sum(p)-max(p)/2)", "code2": "n=int(input())\np=[int(input()) for i in range(n)]\nprint(sum(p)-max(p)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553565784", "date2": "1553565838", "bleu_score": "0.9574533680683809", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "4\n4320\n402\n4320\n4320\n", "actual_output": "11202.0\n", "expected_output": "11202\n\n", "anno_code": ["n=int(input()) # (0): n=4\np=[int(input()) for i in range(n)] # (1): p=[4320, 402, 4320, 4320]\nprint(sum(p)-max(p)/2)"], "anno_status": [true], "diff_content": " n=int(input())\n p=[int(input()) for i in range(n)]\n-print(sum(p)-max(p)/2)\n+print(sum(p)-max(p)\n", "FL_content": "\n n=int(input())\n p=[int(input()) for i in range(n)]\n-print(sum(p)-max(p)/2)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 3 }, { "user_id": "u185243955", "problem_id": "p03129", "submission1_id": "s837004104-FL", "submission2_id": "s215292024", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nN,K = [int(x) for x in input().split()]\nif K <= math.ceil(N/2):\n print('Yes')\nelse:\n print('No')\n", "code2": "import math\n\nN,K = [int(x) for x in input().split()]\nif K <= math.ceil(N/2):\n print('YES')\nelse:\n print('NO')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549765261", "date2": "1549766021", "bleu_score": "0.9471903838236817", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 60, "input": "77 50\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["import math\n\nN,K = [int(x) for x in input().split()] # (0): N=77, K=50\nif K <= math.ceil(N/2): # (1): NO CHANGE\n print('Yes')\nelse:\n print('No')\n"], "anno_status": [true], "diff_content": " import math\n \n N,K = [int(x) for x in input().split()]\n if K <= math.ceil(N/2):\n- print('Yes')\n+ print('YES')\n else:\n- print('No')\n+ print('NO')\n \n", "FL_content": "\n import math\n \n N,K = [int(x) for x in input().split()]\n if K <= math.ceil(N/2):\n- print('Yes')\n else:\n- print('No')\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u939198091", "problem_id": "p04014", "submission1_id": "s190766273-FL", "submission2_id": "s125763601", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\ndef func(b,n):\n if b > n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n\ndef _func(b,n):\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n\ndef solve(n,s):\n if n == s:\n return n+1\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n\n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n b = int((n-s)/p)+1\n if b < 2:\n continue\n if _func(b, n) == s:\n return b\n\n return -1\n\nif __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n", "code2": "import math\n\ndef func(b,n):\n if b > n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n\ndef _func(b,n):\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n\ndef solve(n,s):\n if n == s:\n return n+1\n ans = float('inf')\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n\n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n b = int((n-s)/p)+1\n if b < 2:\n continue\n if _func(b, n) == s:\n ans = min(ans, b)\n\n if ans < float('inf'):\n return ans\n else:\n return -1\n\nif __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586403576", "date2": "1586403830", "bleu_score": "0.8892172213952186", "code1_test_status": [1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 54, "total_score": 105, "input": "87654\n5894\n", "actual_output": "81761\n", "expected_output": "8177\n\n", "anno_code": ["import math\n\ndef func(b,n): # (0): func=\n if b > n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n\ndef _func(b,n): # (1): _func=\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n\ndef solve(n,s): # (2): solve=\n if n == s:\n return n+1\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n\n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n b = int((n-s)/p)+1\n if b < 2:\n continue\n if _func(b, n) == s:\n return b\n\n return -1\n\nif __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n"], "anno_status": [true], "diff_content": " import math\n \n def func(b,n):\n if b > n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n \n def _func(b,n):\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n \n def solve(n,s):\n if n == s:\n return n+1\n+ ans = float('inf')\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n \n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n b = int((n-s)/p)+1\n if b < 2:\n continue\n if _func(b, n) == s:\n- return b\n+ ans = min(ans, b)\n \n- return -1\n+ if ans < float('inf'):\n+ return ans\n+ else:\n+ return -1\n \n if __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n \n", "FL_content": "\n import math\n \n def func(b,n):\n if b > n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n \n def _func(b,n):\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n \n def solve(n,s):\n if n == s:\n- return n+1\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n \n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n b = int((n-s)/p)+1\n if b < 2:\n continue\n if _func(b, n) == s:\n return b\n \n return -1\n \n if __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 41 }, { "user_id": "u141610915", "problem_id": "p03313", "submission1_id": "s209101126-FL", "submission2_id": "s431962847", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nN = int(input())\na = list(map(int, input().split()))\nzeta = a[: ]\nzeta2 = [0] * (1 << N)\nfor i in range(N):\n for j in range(1 << N):\n if (1 << i) & j:\n if zeta[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = max(zeta[j], zeta2[(1 << i) ^ j])\n zeta[j] = zeta[(1 << i) ^ j]\n elif zeta2[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = zeta[(1 << i) ^ j]\n\nfor i in range((1 << N) - 1):\n zeta[i + 1] = max(zeta[i + 1], zeta[i])\n zeta2[i + 1] = max(zeta2[i + 1], zeta2[i])\n\nfor i in range(1, 1 << N): print(zeta[i] + zeta2[i])", "code2": "import sys\ninput = sys.stdin.readline\nN = int(input())\na = list(map(int, input().split()))\nzeta = a[: ]\nzeta2 = [0] * (1 << N)\nfor i in range(N):\n for j in range(1 << N):\n if (1 << i) & j:\n if zeta[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = max(zeta[j], zeta2[(1 << i) ^ j])\n zeta[j] = zeta[(1 << i) ^ j]\n elif zeta2[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = zeta[(1 << i) ^ j]\n\nres = 0\nfor i in range(1, 1 << N):\n res = max(res, zeta[i] + zeta2[i])\n print(res)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1588800085", "date2": "1588800345", "bleu_score": "0.8051672844887523", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 53, "total_score": 103, "input": "4\n16 1 1 112 32 17 97 8 1 1 25 72 84 17 56 82\n", "actual_output": "17\n17\n128\n128\n129\n144\n209\n209\n209\n209\n209\n209\n209\n209\n209\n", "expected_output": "17\n17\n128\n128\n128\n129\n209\n209\n209\n209\n209\n209\n209\n209\n209\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\nN = int(input()) # (1): N=4\na = list(map(int, input().split())) # (2): a=[16, 1, 1, 112, 32, 17, 97, 8, 1, 1, 25, 72, 84, 17, 56, 82]\nzeta = a[: ] # (3): zeta=[16, 1, 1, 112, 32, 17, 97, 8, 1, 1, 25, 72, 84, 17, 56, 82]\nzeta2 = [0] * (1 << N) # (4): zeta2=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(N): # (5): i=0 (63): i=1 ... (231): NO CHANGE\n for j in range(1 << N): # (6): j=0 (8): j=1 ... (230): NO CHANGE\n if (1 << i) & j: # (7): NO CHANGE (9): NO CHANGE ... (226): NO CHANGE\n if zeta[j] < zeta[(1 << i) ^ j]: # (10): NO CHANGE (17): NO CHANGE ... (227): NO CHANGE\n zeta2[j] = max(zeta[j], zeta2[(1 << i) ^ j]) # (11): zeta2=[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (25): zeta2=[0, 1, 0, 1, 0, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ... (228): zeta2=[0, 1, 1, 16, 16, 17, 32, 97, 1, 1, 16, 72, 32, 32, 84, 97]\n zeta[j] = zeta[(1 << i) ^ j] # (12): zeta=[16, 16, 1, 112, 32, 17, 97, 8, 1, 1, 25, 72, 84, 17, 56, 82] (26): zeta=[16, 16, 1, 112, 32, 32, 97, 8, 1, 1, 25, 72, 84, 17, 56, 82] ... (229): zeta=[16, 16, 16, 112, 32, 32, 97, 112, 16, 16, 25, 112, 84, 84, 97, 112]\n elif zeta2[j] < zeta[(1 << i) ^ j]: # (18): NO CHANGE (39): NO CHANGE ... (218): NO CHANGE\n zeta2[j] = zeta[(1 << i) ^ j] # (19): zeta2=[0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (40): zeta2=[0, 1, 0, 1, 0, 17, 0, 8, 0, 1, 0, 0, 0, 0, 0, 0] ... (219): zeta2=[0, 1, 1, 16, 16, 17, 32, 97, 1, 1, 16, 72, 32, 32, 56, 82]\n\nfor i in range((1 << N) - 1): # (232): i=0 (235): i=1 ... (277): NO CHANGE\n zeta[i + 1] = max(zeta[i + 1], zeta[i]) # (233): NO CHANGE (236): NO CHANGE ... (275): NO CHANGE\n zeta2[i + 1] = max(zeta2[i + 1], zeta2[i]) # (234): NO CHANGE (237): NO CHANGE ... (276): NO CHANGE\n\nfor i in range(1, 1 << N): print(zeta[i] + zeta2[i]) # (278): i=1 (279): i=2 ... (292): i=15\n"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n N = int(input())\n a = list(map(int, input().split()))\n zeta = a[: ]\n zeta2 = [0] * (1 << N)\n for i in range(N):\n for j in range(1 << N):\n if (1 << i) & j:\n if zeta[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = max(zeta[j], zeta2[(1 << i) ^ j])\n zeta[j] = zeta[(1 << i) ^ j]\n elif zeta2[j] < zeta[(1 << i) ^ j]:\n zeta2[j] = zeta[(1 << i) ^ j]\n \n-for i in range((1 << N) - 1):\n- zeta[i + 1] = max(zeta[i + 1], zeta[i])\n- zeta2[i + 1] = max(zeta2[i + 1], zeta2[i])\n-\n-for i in range(1, 1 << N): print(zeta[i] + zeta2[i])\n+res = 0\n+for i in range(1, 1 << N):\n+ res = max(res, zeta[i] + zeta2[i])\n+ print(res)\n", "FL_content": "\n import sys\n input = sys.stdin.readline\n N = int(input())\n a = list(map(int, input().split()))\n-zeta = a[: ]\n-zeta2 = [0] * (1 << N)\n-for i in range(N):\n- for j in range(1 << N):\n- if (1 << i) & j:\n- if zeta[j] < zeta[(1 << i) ^ j]:\n- zeta2[j] = max(zeta[j], zeta2[(1 << i) ^ j])\n- zeta[j] = zeta[(1 << i) ^ j]\n- elif zeta2[j] < zeta[(1 << i) ^ j]:\n- zeta2[j] = zeta[(1 << i) ^ j]\n \n-for i in range((1 << N) - 1):\n- zeta[i + 1] = max(zeta[i + 1], zeta[i])\n- zeta2[i + 1] = max(zeta2[i + 1], zeta2[i])\n \n-for i in range(1, 1 << N): print(zeta[i] + zeta2[i])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u169138653", "problem_id": "p02865", "submission1_id": "s478786720-FL", "submission2_id": "s016354485", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nif n%2==0:\n print(n/2-1)\nelse:\n print((n-1)/2)", "code2": "n=int(input())\nif n%2==0:\n print(int(n/2)-1)\nelse:\n print(int((n-1)/2))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573351651", "date2": "1573352140", "bleu_score": "0.8271094002583693", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 46, "input": "64455\n", "actual_output": "32227.0\n", "expected_output": "32227\n\n", "anno_code": ["n=int(input()) # (0): n=64455\nif n%2==0: # (1): NO CHANGE\n print(n/2-1)\nelse:\n print((n-1)/2)"], "anno_status": [true], "diff_content": " n=int(input())\n if n%2==0:\n- print(n/2-1)\n+ print(int(n/2)-1)\n else:\n- print((n-1)/2)\n+ print(int((n-1)/2))\n+\n", "FL_content": "\n n=int(input())\n if n%2==0:\n- print(n/2-1)\n else:\n- print((n-1)/2)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u785066634", "problem_id": "p03643", "submission1_id": "s974172348-FL", "submission2_id": "s778399725", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=input()\nprint ('ABC',n)", "code2": "n=str(input())\nprint ('ABC'+n)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580433885", "date2": "1580434114", "bleu_score": "0.6648633862444917", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "542\n", "actual_output": "ABC 542\n", "expected_output": "ABC542\n\n", "anno_code": ["n=input() # (0): n=542\nprint ('ABC',n)"], "anno_status": [true], "diff_content": "-n=input()\n-print ('ABC',n)\n+n=str(input())\n+print ('ABC'+n)\n", "FL_content": "\n n=input()\n-print ('ABC',n)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 2 }, { "user_id": "u390618988", "problem_id": "p02929", "submission1_id": "s660103579-FL", "submission2_id": "s044575451", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin\n\nN = int(stdin.readline().rstrip())\nS = stdin.readline().rstrip()\n\nans = 1\ninf = 10 ** 9 + 7\nd = 'L'\nl_count = 1\nr_count = 0\nfor i in range(1, 2 * N):\n if S[i] != S[i - 1]:\n if d == 'R':\n ans *= l_count - r_count\n ans %= inf\n r_count += 1\n else:\n l_count += 1\n else:\n if d == 'R':\n d = 'L'\n l_count += 1\n else:\n ans *= l_count - r_count\n ans %= inf\n d = 'R'\n r_count += 1\n\nfor j in range(1, N + 1):\n ans *= j\n ans %= inf\n\nprint(ans % inf)", "code2": "from sys import stdin\n\nN = int(stdin.readline().rstrip())\nS = stdin.readline().rstrip()\n\nans = 1\ninf = 10 ** 9 + 7\nd = 'L'\nl_count = 1\nr_count = 0\n\nif S[0] == 'W' or S[2 * N - 1] == 'W':\n print(0)\n exit()\n\nfor i in range(1, 2 * N):\n if S[i] != S[i - 1]:\n if d == 'R':\n ans *= l_count - r_count\n ans %= inf\n r_count += 1\n else:\n l_count += 1\n else:\n if d == 'R':\n d = 'L'\n l_count += 1\n else:\n ans *= l_count - r_count\n ans %= inf\n d = 'R'\n r_count += 1\n\nif l_count != r_count:\n print(0)\n exit()\n\nfor j in range(1, N + 1):\n ans *= j\n ans %= inf\n\nprint(ans % inf)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1566766208", "date2": "1566766452", "bleu_score": "0.841990856452564", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 60, "total_score": 103, "input": "5\nWWWWWXWWWU\n", "actual_output": "360\n", "expected_output": "0\n\n", "anno_code": ["from sys import stdin\n\nN = int(stdin.readline().rstrip()) # (0): N=5\nS = stdin.readline().rstrip() # (1): S=WWWWWXWWWU\n\nans = 1 # (2): ans=1\ninf = 10 ** 9 + 7 # (3): inf=1000000007\nd = 'L' # (4): d=L\nl_count = 1 # (5): l_count=1\nr_count = 0 # (6): r_count=0\nfor i in range(1, 2 * N): # (7): i=1 (14): i=2 ... (55): NO CHANGE\n if S[i] != S[i - 1]: # (8): NO CHANGE (15): NO CHANGE ... (52): NO CHANGE\n if d == 'R': # (33): NO CHANGE (37): NO CHANGE (53): NO CHANGE\n ans *= l_count - r_count\n ans %= inf\n r_count += 1\n else:\n l_count += 1 # (34): l_count=4 (38): l_count=5 (54): l_count=7\n else:\n if d == 'R': # (9): NO CHANGE (16): NO CHANGE ... (48): NO CHANGE\n d = 'L' # (17): d=L (29): d=L (49): d=L\n l_count += 1 # (18): l_count=2 (30): l_count=3 (50): l_count=6\n else:\n ans *= l_count - r_count # (10): NO CHANGE (22): NO CHANGE (42): ans=3\n ans %= inf # (11): NO CHANGE (23): NO CHANGE (43): NO CHANGE\n d = 'R' # (12): d=R (24): d=R (44): d=R\n r_count += 1 # (13): r_count=1 (25): r_count=2 (45): r_count=3\n\nfor j in range(1, N + 1): # (56): j=1 (59): j=2 ... (71): NO CHANGE\n ans *= j # (57): NO CHANGE (60): ans=6 ... (69): ans=360\n ans %= inf # (58): NO CHANGE (61): NO CHANGE ... (70): NO CHANGE\n\nprint(ans % inf)"], "anno_status": [true], "diff_content": " from sys import stdin\n \n N = int(stdin.readline().rstrip())\n S = stdin.readline().rstrip()\n \n ans = 1\n inf = 10 ** 9 + 7\n d = 'L'\n l_count = 1\n r_count = 0\n+\n+if S[0] == 'W' or S[2 * N - 1] == 'W':\n+ print(0)\n+ exit()\n+\n for i in range(1, 2 * N):\n if S[i] != S[i - 1]:\n if d == 'R':\n ans *= l_count - r_count\n ans %= inf\n r_count += 1\n else:\n l_count += 1\n else:\n if d == 'R':\n d = 'L'\n l_count += 1\n else:\n ans *= l_count - r_count\n ans %= inf\n d = 'R'\n r_count += 1\n \n+if l_count != r_count:\n+ print(0)\n+ exit()\n+\n for j in range(1, N + 1):\n ans *= j\n ans %= inf\n \n print(ans % inf)\n", "FL_content": "\n from sys import stdin\n \n N = int(stdin.readline().rstrip())\n S = stdin.readline().rstrip()\n \n ans = 1\n inf = 10 ** 9 + 7\n d = 'L'\n l_count = 1\n r_count = 0\n for i in range(1, 2 * N):\n if S[i] != S[i - 1]:\n if d == 'R':\n ans *= l_count - r_count\n ans %= inf\n r_count += 1\n else:\n l_count += 1\n else:\n if d == 'R':\n d = 'L'\n l_count += 1\n else:\n ans *= l_count - r_count\n ans %= inf\n d = 'R'\n r_count += 1\n \n-for j in range(1, N + 1):\n- ans *= j\n- ans %= inf\n \n print(ans % inf)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 33 }, { "user_id": "u634461820", "problem_id": "p02867", "submission1_id": "s520227232-FL", "submission2_id": "s331828794", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport math\nMAX_INT = int(10e12)\nMIN_INT = -MAX_INT\nmod = 998244353\nsys.setrecursionlimit(1000000)\ndef IL(): return list(map(int,input().split()))\ndef SL(): return input().split()\ndef I(): return int(sys.stdin.readline())\ndef S(): return input()\n\ndef init(n):\n for i in range(N+1):\n par[i] = i\n rnk[i] = 0\ndef find(x):\n if par[x] == x:\n return x\n else:\n par[x] = find(par[x])\n return par[x]\ndef unite(x, y):\n x = find(x)\n y = find(y)\n if x == y:\n return\n if (rnk[x] < rnk[y]):\n par[x] = y\n else:\n par[y] = x\n if(rnk[x] == rnk[y]):\n rnk[x] += 1\ndef same(x, y):\n return find(x) == find(y)\n\nN = I()\na = IL()\nb = IL()\n\npar = [0 for i in range(N+1)]\nrnk = [0 for i in range(N+1)]\ninit(N)\n\nadata = []\nbdata = []\nfor i in range(N):\n adata.append([a[i], i])\n bdata.append([b[i], i])\nadata.sort()\nbdata.sort()\nprint(adata)\nprint(bdata)\n\nfor i in range(N-1):\n atmp, aID = adata[i]\n btmp, bID = bdata[i]\n atmp2, aID2 = adata[i + 1]\n btmp2, bID2 = bdata[i + 1]\n if atmp > btmp or atmp2 > btmp2:\n print(\"No\")\n exit()\n if atmp2 <= btmp:\n print(\"Yes\")\n exit()\n\nfor i in range(N-1):\n atmp, aID = adata[i]\n btmp, bID = bdata[i]\n \n \n \n if aID == bID:\n break\n if same(aID, bID):\n break\n else:\n unite(aID, bID)\nelse:\n print(\"No\")\n exit()\nprint(\"Yes\")", "code2": "import sys\nimport math\nMAX_INT = int(10e12)\nMIN_INT = -MAX_INT\nmod = 998244353\nsys.setrecursionlimit(1000000)\ndef IL(): return list(map(int,input().split()))\ndef SL(): return input().split()\ndef I(): return int(sys.stdin.readline())\ndef S(): return input()\n\ndef init(n):\n for i in range(N+1):\n par[i] = i\n rnk[i] = 0\ndef find(x):\n if par[x] == x:\n return x\n else:\n par[x] = find(par[x])\n return par[x]\ndef unite(x, y):\n x = find(x)\n y = find(y)\n if x == y:\n return\n if (rnk[x] < rnk[y]):\n par[x] = y\n else:\n par[y] = x\n if(rnk[x] == rnk[y]):\n rnk[x] += 1\ndef same(x, y):\n return find(x) == find(y)\n\nN = I()\na = IL()\nb = IL()\n\npar = [0 for i in range(N+1)]\nrnk = [0 for i in range(N+1)]\ninit(N)\n\nadata = []\nbdata = []\nfor i in range(N):\n adata.append([a[i], i])\n bdata.append([b[i], i])\nadata.sort()\nbdata.sort()\n\n\n\na.sort()\nb.sort()\nf = 0\nfor i in range(N-1):\n atmp = a[i]\n btmp = b[i]\n atmp2 = a[i + 1]\n btmp2 = b[i + 1]\n if atmp > btmp:\n print(\"No\")\n exit()\n if atmp2 > btmp2:\n print(\"No\")\n exit()\n if atmp2 <= btmp:\n f = 1\nelse:\n if f == 1:\n print(\"Yes\")\n exit()\n\nfor i in range(N-1):\n atmp, aID = adata[i]\n btmp, bID = bdata[i]\n \n \n \n if aID == bID:\n break\n if same(aID, bID):\n break\n else:\n unite(aID, bID)\nelse:\n print(\"No\")\n exit()\nprint(\"Yes\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1573359267", "date2": "1573361274", "bleu_score": "0.9338766114479815", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "3\n1 -3 2\n-1 14 8\n", "actual_output": "[[-3, 1], [1, 0], [2, 2]]\n[[-1, 0], [8, 2], [14, 1]]\nYes\n", "expected_output": "Yes\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " import sys\n import math\n MAX_INT = int(10e12)\n MIN_INT = -MAX_INT\n mod = 998244353\n sys.setrecursionlimit(1000000)\n def IL(): return list(map(int,input().split()))\n def SL(): return input().split()\n def I(): return int(sys.stdin.readline())\n def S(): return input()\n \n def init(n):\n for i in range(N+1):\n par[i] = i\n rnk[i] = 0\n def find(x):\n if par[x] == x:\n return x\n else:\n par[x] = find(par[x])\n return par[x]\n def unite(x, y):\n x = find(x)\n y = find(y)\n if x == y:\n return\n if (rnk[x] < rnk[y]):\n par[x] = y\n else:\n par[y] = x\n if(rnk[x] == rnk[y]):\n rnk[x] += 1\n def same(x, y):\n return find(x) == find(y)\n \n N = I()\n a = IL()\n b = IL()\n \n par = [0 for i in range(N+1)]\n rnk = [0 for i in range(N+1)]\n init(N)\n \n adata = []\n bdata = []\n for i in range(N):\n adata.append([a[i], i])\n bdata.append([b[i], i])\n adata.sort()\n bdata.sort()\n-print(adata)\n-print(bdata)\n \n+\n+\n+a.sort()\n+b.sort()\n+f = 0\n for i in range(N-1):\n- atmp, aID = adata[i]\n- btmp, bID = bdata[i]\n- atmp2, aID2 = adata[i + 1]\n- btmp2, bID2 = bdata[i + 1]\n- if atmp > btmp or atmp2 > btmp2:\n+ atmp = a[i]\n+ btmp = b[i]\n+ atmp2 = a[i + 1]\n+ btmp2 = b[i + 1]\n+ if atmp > btmp:\n+ print(\"No\")\n+ exit()\n+ if atmp2 > btmp2:\n print(\"No\")\n exit()\n if atmp2 <= btmp:\n+ f = 1\n+else:\n+ if f == 1:\n print(\"Yes\")\n exit()\n \n for i in range(N-1):\n atmp, aID = adata[i]\n btmp, bID = bdata[i]\n \n \n \n if aID == bID:\n break\n if same(aID, bID):\n break\n else:\n unite(aID, bID)\n else:\n print(\"No\")\n exit()\n print(\"Yes\")\n", "FL_content": "\n import sys\n import math\n MAX_INT = int(10e12)\n MIN_INT = -MAX_INT\n mod = 998244353\n sys.setrecursionlimit(1000000)\n def IL(): return list(map(int,input().split()))\n def SL(): return input().split()\n def I(): return int(sys.stdin.readline())\n def S(): return input()\n \n def init(n):\n for i in range(N+1):\n par[i] = i\n rnk[i] = 0\n def find(x):\n if par[x] == x:\n return x\n else:\n par[x] = find(par[x])\n return par[x]\n def unite(x, y):\n x = find(x)\n y = find(y)\n if x == y:\n return\n if (rnk[x] < rnk[y]):\n par[x] = y\n else:\n par[y] = x\n if(rnk[x] == rnk[y]):\n rnk[x] += 1\n def same(x, y):\n return find(x) == find(y)\n \n N = I()\n a = IL()\n b = IL()\n \n par = [0 for i in range(N+1)]\n rnk = [0 for i in range(N+1)]\n init(N)\n \n adata = []\n bdata = []\n for i in range(N):\n adata.append([a[i], i])\n bdata.append([b[i], i])\n adata.sort()\n bdata.sort()\n-print(adata)\n-print(bdata)\n \n for i in range(N-1):\n atmp, aID = adata[i]\n btmp, bID = bdata[i]\n atmp2, aID2 = adata[i + 1]\n btmp2, bID2 = bdata[i + 1]\n if atmp > btmp or atmp2 > btmp2:\n print(\"No\")\n exit()\n if atmp2 <= btmp:\n print(\"Yes\")\n exit()\n \n for i in range(N-1):\n atmp, aID = adata[i]\n btmp, bID = bdata[i]\n \n \n \n if aID == bID:\n break\n if same(aID, bID):\n break\n else:\n unite(aID, bID)\n else:\n print(\"No\")\n exit()\n print(\"Yes\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 81 }, { "user_id": "u398942100", "problem_id": "p03856", "submission1_id": "s378434884-FL", "submission2_id": "s392177239", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input().replace('eraser','').replace('erase','').replace('dreamer','').replace('dream','')\nif S == '':\n print('Yes')\nelse:\n print('No')", "code2": "S = input().replace('eraser','').replace('erase','').replace('dreamer','').replace('dream','')\nif S == '':\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1542857694", "date2": "1542857736", "bleu_score": "0.9597276205623526", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "Yes\n", "expected_output": "YES\n", "anno_code": ["S = input().replace('eraser','').replace('erase','').replace('dreamer','').replace('dream','') # (0): S=\nif S == '': # (1): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " S = input().replace('eraser','').replace('erase','').replace('dreamer','').replace('dream','')\n if S == '':\n- print('Yes')\n+ print('YES')\n else:\n- print('No')\n+ print('NO')\n", "FL_content": "\n-S = input().replace('eraser','').replace('erase','').replace('dreamer','').replace('dream','')\n if S == '':\n- print('Yes')\n else:\n- print('No')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u787059958", "problem_id": "p03730", "submission1_id": "s415187103-FL", "submission2_id": "s906699957", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c = map(int, input().split())\nt = False\nfor i in range(1,b+1):\n if((a+i)%b==c):\n t=True\n break\n\nif(t):\n print('Yes')\nelse:\n print('No')", "code2": "a,b,c = map(int, input().split())\nt = False\nfor i in range(1,b+1):\n if((a*i)%b==c):\n t=True\n break\n\nif(t):\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565734299", "date2": "1565734488", "bleu_score": "0.9482701961140227", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 92, "input": "77 63 36\n", "actual_output": "Yes\n", "expected_output": "NO\n\n", "anno_code": ["a,b,c = map(int, input().split()) # (0): a=77, b=63, c=36\nt = False # (1): t=False\nfor i in range(1,b+1): # (2): i=1 (4): i=2 ... (44): i=22\n if((a+i)%b==c): # (3): NO CHANGE (5): NO CHANGE ... (45): NO CHANGE\n t=True # (46): t=True\n break # (47): NO CHANGE\n\nif(t): # (48): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " a,b,c = map(int, input().split())\n t = False\n for i in range(1,b+1):\n- if((a+i)%b==c):\n+ if((a*i)%b==c):\n t=True\n break\n \n if(t):\n- print('Yes')\n+ print('YES')\n else:\n- print('No')\n+ print('NO')\n", "FL_content": "\n a,b,c = map(int, input().split())\n t = False\n for i in range(1,b+1):\n if((a+i)%b==c):\n t=True\n break\n \n if(t):\n- print('Yes')\n else:\n- print('No')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u022407960", "problem_id": "p02300", "submission1_id": "s961803202-FL", "submission2_id": "s230011031", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n lower.reverse()\n lower.sort(key=attrgetter('imag'))\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "code2": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.reverse()\n \n lower_min = min(lower, key=attrgetter('imag', 'real'))\n \n min_index = lower.index(lower_min)\n lower_right = lower[min_index:]\n lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n lower_right.append(upper[k])\n return lower_right + lower_left\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1480729208", "date2": "1480734264", "bleu_score": "0.9011448775104812", "code1_test_status": [0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1], "code1_test_score": 56, "total_score": 102, "input": "4\n1 -2\n4 2\n0 2\n0 1\n", "actual_output": "4\n1 -2\n0 1\n4 2\n0 2\n", "expected_output": "4\n1 -2\n4 2\n0 2\n0 1\n\n", "anno_code": ["\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9 # (0): EPS=1e-09\n\n\ndef cross(a, b): # (1): cross=\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b): # (2): dot=\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2): # (3): check_ccw=\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon): # (4): convex_check_Andrew=\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n lower.reverse()\n lower.sort(key=attrgetter('imag'))\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))"], "anno_status": [false], "diff_content": " \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n+ \n lower.reverse()\n- lower.sort(key=attrgetter('imag'))\n+ \n+ lower_min = min(lower, key=attrgetter('imag', 'real'))\n+ \n+ min_index = lower.index(lower_min)\n+ lower_right = lower[min_index:]\n+ lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n- lower.append(upper[k])\n-\n- return lower\n+ lower_right.append(upper[k])\n+ return lower_right + lower_left\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "FL_content": "\n \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n- elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n lower.reverse()\n lower.sort(key=attrgetter('imag'))\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n \n return lower\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 78 }, { "user_id": "u013594089", "problem_id": "p02933", "submission1_id": "s619301622-FL", "submission2_id": "s598361471", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\ns = input()\nif a >= 3200:\n\tprint(a)\nelse:\n\tprint(\"red\")", "code2": "a = int(input())\ns = input()\nif a >= 3200:\n\tprint(s)\nelse:\n\tprint(\"red\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567190822", "date2": "1567190857", "bleu_score": "0.9641384561775734", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 2, "total_score": 103, "input": "4049\ncqa\n", "actual_output": "4049\n", "expected_output": "cqa\n\n", "anno_code": ["a = int(input()) # (0): a=4049\ns = input() # (1): s=cqa\nif a >= 3200: # (2): NO CHANGE\n\tprint(a)\nelse:\n\tprint(\"red\")"], "anno_status": [true], "diff_content": " a = int(input())\n s = input()\n if a >= 3200:\n-\tprint(a)\n+\tprint(s)\n else:\n \tprint(\"red\")\n", "FL_content": "\n a = int(input())\n s = input()\n if a >= 3200:\n-\tprint(a)\n else:\n \tprint(\"red\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u088063513", "problem_id": "p02702", "submission1_id": "s986034089-FL", "submission2_id": "s867249357", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nS = input()[::-1] \nN = len(S)\n\n\nremainder = [0] * 2019\ntmp = 0\nfor i in range(N):\n r = int(S[i])\n tmp += r*10**(i)\n \n remainder[tmp%2019] += 1\n tmp %= 2019\n\n \n \nremainder[0] += 1\nprint(-1)\n\n\n", "code2": "\n\nS = input()[::-1] \nN = len(S)\n\n\nremainder = [0] * 2019\ntmp = 0\nrad = 1 \nfor i in range(N):\n r = int(S[i])\n tmp += r*rad\n tmp %= 2019\n \n remainder[tmp] += 1\n rad *= 10\n rad %= 2019\n\n \n \nremainder[0] += 1\n\n\n\n\nanswer = 0\nfor i in range(2019):\n p = remainder[i]\n answer += p*(p-1)/2\nprint(int(answer))\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1588130069", "date2": "1588130950", "bleu_score": "0.6002020656898546", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 74, "input": "5235394296\n", "actual_output": "-1\n", "expected_output": "0\n\n", "anno_code": ["\n\nS = input()[::-1] # (0): S=6924935325\nN = len(S) # (1): N=10\n\n\nremainder = [0] * 2019 # (2): remainder=[0, 0, ..., 0, 0]\ntmp = 0 # (3): tmp=0\nfor i in range(N): # (4): i=0 (9): i=1 ... (54): NO CHANGE\n r = int(S[i]) # (5): r=6 (10): r=9 ... (50): r=5\n tmp += r*10**(i) # (6): tmp=6 (11): tmp=96 ... (51): tmp=5000001105\n \n remainder[tmp%2019] += 1 # (7): remainder=[0, 0, ..., 0, 0] (12): remainder=[0, 0, ..., 0, 0] ... (52): remainder=[0, 0, ..., 0, 0]\n tmp %= 2019 # (8): NO CHANGE (13): NO CHANGE ... (53): tmp=99\n\n \n \nremainder[0] += 1 # (55): remainder=[1, 0, ..., 0, 0]\nprint(-1)\n\n\n"], "anno_status": [true], "diff_content": " \n \n S = input()[::-1] \n N = len(S)\n \n \n remainder = [0] * 2019\n tmp = 0\n+rad = 1 \n for i in range(N):\n r = int(S[i])\n- tmp += r*10**(i)\n- \n- remainder[tmp%2019] += 1\n+ tmp += r*rad\n tmp %= 2019\n+ \n+ remainder[tmp] += 1\n+ rad *= 10\n+ rad %= 2019\n \n \n \n remainder[0] += 1\n-print(-1)\n \n \n \n+\n+answer = 0\n+for i in range(2019):\n+ p = remainder[i]\n+ answer += p*(p-1)/2\n+print(int(answer))\n+\n", "FL_content": "\n \n \n S = input()[::-1] \n N = len(S)\n \n \n remainder = [0] * 2019\n tmp = 0\n for i in range(N):\n r = int(S[i])\n tmp += r*10**(i)\n \n remainder[tmp%2019] += 1\n tmp %= 2019\n \n \n \n-remainder[0] += 1\n-print(-1)\n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u422581886", "problem_id": "p02958", "submission1_id": "s613674286-FL", "submission2_id": "s829937413", "status1": "Wrong Answer", "status2": "Accepted", "code1": "num = int(input())\nls = list(map(str, input().split(\" \")))\n\nsls = sorted(ls)\n\ndiff = 0\nfor i in range(num):\n if (sls[i] != ls[i]):\n diff += 1\n\nif diff == 2 or diff == 0:\n print(\"YES\")\nelse:\n print(\"NO\")", "code2": "num = int(input())\nls = list(map(int, input().split(\" \")))\n\ndiff = 0\nfor i in range(num):\n if (ls[i] != i+1):\n diff += 1\n\nif diff == 2 or diff == 0:\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565059873", "date2": "1565060195", "bleu_score": "0.8548924714209509", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 100, "input": "5\n1 20 1 1 4\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["num = int(input()) # (0): num=5\nls = list(map(str, input().split(\" \"))) # (1): ls=['1', '20', '1', '1', '4']\n\nsls = sorted(ls) # (2): sls=['1', '1', '1', '20', '4']\n\ndiff = 0 # (3): diff=0\nfor i in range(num): # (4): i=0 (6): i=1 ... (16): NO CHANGE\n if (sls[i] != ls[i]): # (5): NO CHANGE (7): NO CHANGE ... (15): NO CHANGE\n diff += 1 # (8): diff=1 (13): diff=2\n\nif diff == 2 or diff == 0: # (17): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")"], "anno_status": [true], "diff_content": " num = int(input())\n-ls = list(map(str, input().split(\" \")))\n-\n-sls = sorted(ls)\n+ls = list(map(int, input().split(\" \")))\n \n diff = 0\n for i in range(num):\n- if (sls[i] != ls[i]):\n+ if (ls[i] != i+1):\n diff += 1\n \n if diff == 2 or diff == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n", "FL_content": "\n num = int(input())\n ls = list(map(str, input().split(\" \")))\n \n sls = sorted(ls)\n \n diff = 0\n for i in range(num):\n if (sls[i] != ls[i]):\n diff += 1\n \n-if diff == 2 or diff == 0:\n print(\"YES\")\n else:\n print(\"NO\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u358254559", "problem_id": "p02975", "submission1_id": "s566471074-FL", "submission2_id": "s322108841", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\n\nres=0\n\nfor i in range(n):\n res = res ^ a[i]\n\nif n % 3 ==0:\n if res==0:\n print(\"Yes\")\n exit()\nelse:\n for i in range(n):\n if res == a[i]:\n print(\"Yes\")\n exit()\nprint(\"No\")", "code2": "n = int(input())\na = list(map(int, input().split()))\n\nres=0\na_set=set(a)\n\nres=0\nfor i in range(n):\n res = res ^ a[i]\n\nif n % 3 ==0:\n if res==0:\n print(\"Yes\")\n exit()\nelse:\n if len(a_set) ==1:\n print(\"Yes\")\n exit()\nprint(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580346582", "date2": "1580347759", "bleu_score": "0.8378291100490339", "code1_test_status": [1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 51, "total_score": 58, "input": "4\n2 -5 0 2\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n \n res=0\n+a_set=set(a)\n \n+res=0\n for i in range(n):\n res = res ^ a[i]\n \n if n % 3 ==0:\n if res==0:\n print(\"Yes\")\n exit()\n else:\n- for i in range(n):\n- if res == a[i]:\n- print(\"Yes\")\n- exit()\n+ if len(a_set) ==1:\n+ print(\"Yes\")\n+ exit()\n print(\"No\")\n", "FL_content": "\n n = int(input())\n a = list(map(int, input().split()))\n \n res=0\n \n for i in range(n):\n res = res ^ a[i]\n \n-if n % 3 ==0:\n- if res==0:\n- print(\"Yes\")\n- exit()\n-else:\n- for i in range(n):\n- if res == a[i]:\n- print(\"Yes\")\n- exit()\n print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u905582793", "problem_id": "p03183", "submission1_id": "s056367462-FL", "submission2_id": "s385367911", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nwsv = [list(map(int,input().split())) for i in range(n)]\nwsv.sort(key = lambda x:x[0]+x[1],reverse=True)\nsmx = max(list(zip(*wsv))[1])\ndp = [[0 for i in range(smx+1)] for j in range(n+1)]\nfor i in range(1,n+1):\n dp[i] = dp[i-1][:]\n w,s,v = wsv[i-1]\n dp[i][s] = max(dp[i-1][s],v)\n for ss in range(smx+1)[::-1]:\n sn = min(ss-w,s)\n if sn >= 0:\n dp[i][sn] = max(dp[i-1][sn],dp[i-1][ss]+v)\nprint(max(dp[-1]))", "code2": "n = int(input())\nwsv = [list(map(int,input().split())) for i in range(n)]\nwsv.sort(key = lambda x:x[0]+x[1],reverse=True)\nsmx = max(list(zip(*wsv))[1])\ndp = [[0 for i in range(smx+1)] for j in range(n+1)]\nfor i in range(1,n+1):\n dp[i] = dp[i-1][:]\n w,s,v = wsv[i-1]\n dp[i][s] = max(dp[i-1][s],v)\n for ss in range(smx+1)[::-1]:\n sn = min(ss-w,s)\n if sn >= 0 and dp[i-1][ss]:\n dp[i][sn] = max(dp[i][sn],dp[i-1][sn],dp[i-1][ss]+v)\nprint(max(dp[-1]))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1591215247", "date2": "1591216050", "bleu_score": "0.9401425280444373", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 104, "input": "3\n3 5 20\n1 1 7\n3 1 40\n", "actual_output": "47\n", "expected_output": "67\n\n", "anno_code": ["n = int(input()) # (0): n=3\nwsv = [list(map(int,input().split())) for i in range(n)] # (1): wsv\nwsv.sort(key = lambda x:x[0]+x[1],reverse=True) # (2): wsv\nsmx = max(list(zip(*wsv))[1]) # (3): smx=5\ndp = [[0 for i in range(smx+1)] for j in range(n+1)] # (4): dp\nfor i in range(1,n+1): # (5): i=1 (31): i=2 ... (85): NO CHANGE\n dp[i] = dp[i-1][:] # (6): NO CHANGE (32): dp (58): dp\n w,s,v = wsv[i-1] # (7): w=3, s=5, v=20 (33): s=1, v=40 (59): w=1, v=7\n dp[i][s] = max(dp[i-1][s],v) # (8): dp=[[0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 20], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0]] (34): dp (60): NO CHANGE\n for ss in range(smx+1)[::-1]: # (9): ss=5 (13): ss=4 ... (84): NO CHANGE\n sn = min(ss-w,s) # (10): sn=2 (14): sn=1 ... (82): sn=-1\n if sn >= 0: # (11): NO CHANGE (15): NO CHANGE ... (83): NO CHANGE\n dp[i][sn] = max(dp[i-1][sn],dp[i-1][ss]+v) # (12): dp (16): dp ... (80): dp\nprint(max(dp[-1]))"], "anno_status": [true], "diff_content": " n = int(input())\n wsv = [list(map(int,input().split())) for i in range(n)]\n wsv.sort(key = lambda x:x[0]+x[1],reverse=True)\n smx = max(list(zip(*wsv))[1])\n dp = [[0 for i in range(smx+1)] for j in range(n+1)]\n for i in range(1,n+1):\n dp[i] = dp[i-1][:]\n w,s,v = wsv[i-1]\n dp[i][s] = max(dp[i-1][s],v)\n for ss in range(smx+1)[::-1]:\n sn = min(ss-w,s)\n- if sn >= 0:\n- dp[i][sn] = max(dp[i-1][sn],dp[i-1][ss]+v)\n+ if sn >= 0 and dp[i-1][ss]:\n+ dp[i][sn] = max(dp[i][sn],dp[i-1][sn],dp[i-1][ss]+v)\n print(max(dp[-1]))\n", "FL_content": "\n n = int(input())\n wsv = [list(map(int,input().split())) for i in range(n)]\n wsv.sort(key = lambda x:x[0]+x[1],reverse=True)\n smx = max(list(zip(*wsv))[1])\n dp = [[0 for i in range(smx+1)] for j in range(n+1)]\n for i in range(1,n+1):\n dp[i] = dp[i-1][:]\n w,s,v = wsv[i-1]\n dp[i][s] = max(dp[i-1][s],v)\n for ss in range(smx+1)[::-1]:\n- sn = min(ss-w,s)\n if sn >= 0:\n dp[i][sn] = max(dp[i-1][sn],dp[i-1][ss]+v)\n print(max(dp[-1]))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u922489088", "problem_id": "p00591", "submission1_id": "s219821779-FL", "submission2_id": "s925137112", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nwhile True:\n n = int(sys.stdin.readline().rstrip())\n if n == 0:\n break;\n students = []\n for i in range(n):\n students.append(sys.stdin.readline().rstrip().split(' '))\n s_list=[[min(row)==s for s in row] for row in students]\n t_list=[[max(col)==s for s in col] for col in zip(*students)]\n ret = 0\n for i,data in enumerate(zip(s_list, zip(*t_list))):\n for j,d in enumerate(zip(*data)):\n if all(d):\n ret = students[i][j]\n break;\n print(ret)", "code2": "import sys\n\nwhile True:\n n = int(sys.stdin.readline().rstrip())\n if n == 0:\n break;\n students = []\n for i in range(n):\n students.append(list(map(int, sys.stdin.readline().rstrip().split(' '))))\n s_list=[[min(row)==s for s in row] for row in students]\n t_list=[[max(col)==s for s in col] for col in zip(*students)]\n ret = [0]\n for i,data in enumerate(zip(s_list, zip(*t_list))):\n for j,d in enumerate(zip(*data)):\n if all(d):\n ret.append(students[i][j])\n print(max(ret))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1503915229", "date2": "1503915640", "bleu_score": "0.9311086070999376", "code1_test_status": [0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 23, "total_score": 101, "input": "3\n1 2 3\n4 1 6\n7 10 13\n3\n1 2 3\n7 8 10\n4 5 6\n0\n", "actual_output": "0\n0\n", "expected_output": "7\n7\n\n", "anno_code": ["import sys\n\nwhile True: # (0): NO CHANGE (40): NO CHANGE (80): NO CHANGE\n n = int(sys.stdin.readline().rstrip()) # (1): n=3 (41): NO CHANGE (81): n=0\n if n == 0: # (2): NO CHANGE (42): NO CHANGE (82): NO CHANGE\n break;\n students = [] # (3): students=[] (43): students=[]\n for i in range(n): # (4): i=0 (6): i=1 ... (50): NO CHANGE\n students.append(sys.stdin.readline().rstrip().split(' ')) # (5): students (7): students ... (49): students\n s_list=[[min(row)==s for s in row] for row in students] # (11): s_list (51): s_list\n t_list=[[max(col)==s for s in col] for col in zip(*students)] # (12): t_list (52): t_list\n ret = 0 # (13): ret=0 (53): NO CHANGE\n for i,data in enumerate(zip(s_list, zip(*t_list))): # (14): i=0, data=([True, False, False], (False, True, False)) (22): i=1, data=([False, True, False], (False, False, True)) ... (78): NO CHANGE\n for j,d in enumerate(zip(*data)): # (15): j=0, d=(True, False) (17): j=1, d=(False, True) ... (77): NO CHANGE\n if all(d): # (16): NO CHANGE (18): NO CHANGE ... (76): NO CHANGE\n ret = students[i][j]\n break;\n print(ret) # (39): NO CHANGE (79): NO CHANGE\n"], "anno_status": [true], "diff_content": " import sys\n \n while True:\n n = int(sys.stdin.readline().rstrip())\n if n == 0:\n break;\n students = []\n for i in range(n):\n- students.append(sys.stdin.readline().rstrip().split(' '))\n+ students.append(list(map(int, sys.stdin.readline().rstrip().split(' '))))\n s_list=[[min(row)==s for s in row] for row in students]\n t_list=[[max(col)==s for s in col] for col in zip(*students)]\n- ret = 0\n+ ret = [0]\n for i,data in enumerate(zip(s_list, zip(*t_list))):\n for j,d in enumerate(zip(*data)):\n if all(d):\n- ret = students[i][j]\n- break;\n- print(ret)\n+ ret.append(students[i][j])\n+ print(max(ret))\n", "FL_content": "\n import sys\n \n while True:\n n = int(sys.stdin.readline().rstrip())\n if n == 0:\n break;\n students = []\n for i in range(n):\n students.append(sys.stdin.readline().rstrip().split(' '))\n s_list=[[min(row)==s for s in row] for row in students]\n t_list=[[max(col)==s for s in col] for col in zip(*students)]\n ret = 0\n for i,data in enumerate(zip(s_list, zip(*t_list))):\n for j,d in enumerate(zip(*data)):\n if all(d):\n- ret = students[i][j]\n break;\n print(ret)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u223646582", "problem_id": "p03505", "submission1_id": "s450525296-FL", "submission2_id": "s817270098", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nK,A,B=map(int,input().split())\nif A>=K:\n print(1)\nelif A-B>0:\n print(1+math.ceil((K-A)/(A-B))*2)\nelse:\n print(-1)", "code2": "from decimal import *\nimport math\nK,A,B=map(int,input().split())\nif A>=K:\n print(1)\nelif A-B>0:\n print(1+math.ceil(Decimal(K-A)/Decimal(A-B))*2)\nelse:\n print(-1)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590196354", "date2": "1590197270", "bleu_score": "0.7550906470106066", "code1_test_status": [1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0], "code1_test_score": 21, "total_score": 103, "input": "1100100001011001000 2 1\n", "actual_output": "2200200002022001921\n", "expected_output": "2200200002022001997\n\n", "anno_code": ["import math\nK,A,B=map(int,input().split()) # (0): K=1100100001011001000, A=2, B=1\nif A>=K: # (1): NO CHANGE\n print(1)\nelif A-B>0: # (2): NO CHANGE\n print(1+math.ceil((K-A)/(A-B))*2)\nelse:\n print(-1)"], "anno_status": [true], "diff_content": "+from decimal import *\n import math\n K,A,B=map(int,input().split())\n if A>=K:\n print(1)\n elif A-B>0:\n- print(1+math.ceil((K-A)/(A-B))*2)\n+ print(1+math.ceil(Decimal(K-A)/Decimal(A-B))*2)\n else:\n print(-1)\n+\n", "FL_content": "\n import math\n K,A,B=map(int,input().split())\n if A>=K:\n print(1)\n-elif A-B>0:\n- print(1+math.ceil((K-A)/(A-B))*2)\n else:\n print(-1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u989306199", "problem_id": "p03433", "submission1_id": "s433503567-FL", "submission2_id": "s512161159", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input()) \na = int(input())\n\nprint('Yes' if 0 <= n <= a else 'No')", "code2": "n = int(input())\na = int(input())\n\nn %= 500\n\nprint('Yes' if 0 <= n <= a else 'No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587878452", "date2": "1587878616", "bleu_score": "0.8459487532761104", "code1_test_status": [1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 97, "total_score": 103, "input": "2018\n110\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["n = int(input()) # (0): n=2018\na = int(input()) # (1): a=110\n\nprint('Yes' if 0 <= n <= a else 'No')"], "anno_status": [true], "diff_content": "-n = int(input()) \n+n = int(input())\n a = int(input())\n \n+n %= 500\n+\n print('Yes' if 0 <= n <= a else 'No')\n+\n", "FL_content": "\n n = int(input()) \n a = int(input())\n \n-print('Yes' if 0 <= n <= a else 'No')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 4 }, { "user_id": "u711539583", "problem_id": "p03353", "submission1_id": "s007139455-FL", "submission2_id": "s017081610", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nk = int(input())\n\nn = len(s)\nstrs = set([])\n\nfor i in range(n):\n for j in range(i+1, n+1):\n strs.add(s[i:j])\nstrs = list(strs)\n\nprint(strs[k-1])\n", "code2": "s = input()\nk = int(input())\n\nn = len(s)\nstrs = set([])\n\nfor i in range(n):\n for j in range(i+1, min(i+k+1,n+1)):\n strs.add(s[i:j])\nstrs = list(strs)\nstrs.sort()\nprint(strs[k-1])\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1576814071", "date2": "1576905382", "bleu_score": "0.8623978676273416", "code1_test_status": [0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 19, "total_score": 103, "input": "atcoderandatcodeer\n5\n", "actual_output": "oder\n", "expected_output": "andat\n", "anno_code": ["s = input() # (0): s=atcoderandatcodeer\nk = int(input()) # (1): k=5\n\nn = len(s) # (2): n=18\nstrs = set([]) # (3): strs=set()\n\nfor i in range(n): # (4): i=0 (42): i=1 ... (382): NO CHANGE\n for j in range(i+1, n+1): # (5): j=1 (7): j=2 ... (381): NO CHANGE\n strs.add(s[i:j]) # (6): strs={'a'} (8): strs={'a', 'at'} ... (380): NO CHANGE\nstrs = list(strs) # (383): strs=[eran, oderandatcodeer, ..., coderandatcode, tcoderandatcodeer]\n\nprint(strs[k-1])\n"], "anno_status": [true], "diff_content": " s = input()\n k = int(input())\n \n n = len(s)\n strs = set([])\n \n for i in range(n):\n- for j in range(i+1, n+1):\n+ for j in range(i+1, min(i+k+1,n+1)):\n strs.add(s[i:j])\n strs = list(strs)\n-\n+strs.sort()\n print(strs[k-1])\n \n", "FL_content": "\n s = input()\n k = int(input())\n \n n = len(s)\n strs = set([])\n \n for i in range(n):\n- for j in range(i+1, n+1):\n strs.add(s[i:j])\n strs = list(strs)\n \n print(strs[k-1])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u244790947", "problem_id": "p02396", "submission1_id": "s976540688-FL", "submission2_id": "s622778505", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ninputs = []\n\nfor i in range(10000) :\n\tinputraw = input()\n\tif inputraw == '0' :\n\t\tbreak\n\tinputs.append(inputraw)\n\nfor i, input in enumerate(inputs) :\n\tprint(\"Case \"+str(i)+\": \"+ str(input)+\" \")", "code2": "\ninputs = []\n\nfor i in range(10000) :\n\tinputraw = input()\n\tif inputraw == '0' :\n\t\tbreak\n\tinputs.append(inputraw)\n\nfor i, input in enumerate(inputs) :\n\tprint(\"Case \"+str(i+1)+\": \"+ str(input))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1493001884", "date2": "1493002299", "bleu_score": "0.9685893676782499", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3\n8\n2\n14\n0\n58\n0\n", "actual_output": "Case 0: 3 \nCase 1: 8 \nCase 2: 2 \nCase 3: 14 \n", "expected_output": "Case 1: 3\nCase 2: 8\nCase 3: 2\nCase 4: 14\n\n", "anno_code": ["\ninputs = [] # (0): inputs=[]\n\nfor i in range(10000) : # (1): i=0 (5): i=1 ... (17): i=4\n\tinputraw = input() # (2): inputraw=3 (6): inputraw=8 ... (18): inputraw=0\n\tif inputraw == '0' : # (3): NO CHANGE (7): NO CHANGE ... (19): NO CHANGE\n\t\tbreak # (20): NO CHANGE\n\tinputs.append(inputraw) # (4): inputs=['3'] (8): inputs=['3', '8'] ... (16): inputs=['3', '8', '2', '14']\n\nfor i, input in enumerate(inputs) : # (21): i=0, input=3 (23): i=1, input=8 ... (27): i=3, input=14\n\tprint(\"Case \"+str(i)+\": \"+ str(input)+\" \") # (22): NO CHANGE (24): NO CHANGE ... (28): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n inputs = []\n \n for i in range(10000) :\n \tinputraw = input()\n \tif inputraw == '0' :\n \t\tbreak\n \tinputs.append(inputraw)\n \n for i, input in enumerate(inputs) :\n-\tprint(\"Case \"+str(i)+\": \"+ str(input)+\" \")\n+\tprint(\"Case \"+str(i+1)+\": \"+ str(input))\n", "FL_content": "\n \n inputs = []\n \n for i in range(10000) :\n \tinputraw = input()\n \tif inputraw == '0' :\n \t\tbreak\n \tinputs.append(inputraw)\n \n for i, input in enumerate(inputs) :\n-\tprint(\"Case \"+str(i)+\": \"+ str(input)+\" \")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u313089641", "problem_id": "p02415", "submission1_id": "s946877299-FL", "submission2_id": "s541694627", "status1": "Wrong Answer", "status2": "Accepted", "code1": "sen = input()\nprint(sen.capitalize())\n", "code2": "sen = input()\nprint(sen.swapcase())\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526402982", "date2": "1526403376", "bleu_score": "0.7471823835236957", "code1_test_status": [1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 13, "total_score": 101, "input": ",RI@g KATFR, OLKANOISACCY CLOUDX.\n", "actual_output": ",ri@g katfr, olkanoisaccy cloudx.\n", "expected_output": ",ri@G katfr, olkanoisaccy cloudx.\n\n", "anno_code": ["sen = input() # (0): sen=,RI@g KATFR, OLKANOISACCY CLOUDX.\nprint(sen.capitalize())\n"], "anno_status": [true], "diff_content": " sen = input()\n-print(sen.capitalize())\n+print(sen.swapcase())\n \n", "FL_content": "\n sen = input()\n-print(sen.capitalize())\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 3 }, { "user_id": "u440566786", "problem_id": "p02549", "submission1_id": "s583638603-FL", "submission2_id": "s277065011", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nINF = 1 << 60\nMOD = 998244353\nsys.setrecursionlimit(2147483647)\ninput = lambda:sys.stdin.readline().rstrip()\n\nclass SegmentTree(object):\n def __init__(self, A, dot, unit):\n n = 1 << (len(A) - 1).bit_length()\n tree = [unit] * (2 * n)\n for i, v in enumerate(A):\n tree[i + n] = v\n for i in range(n - 1, 0, -1):\n tree[i] = dot(tree[i << 1], tree[i << 1 | 1])\n self._n = n\n self._tree = tree\n self._dot = dot\n self._unit = unit\n\n def __getitem__(self, i):\n return self._tree[i + self._n]\n\n def update(self, i, v):\n i += self._n\n self._tree[i] = v\n while i != 1:\n i >>= 1\n self._tree[i] = self._dot(self._tree[i << 1], self._tree[i << 1 | 1])\n\n def add(self, i, v):\n self.update(i, self[i] + v)\n\n def sum(self, l, r):\n l += self._n\n r += self._n\n l_val = r_val = self._unit\n while l < r:\n if l & 1:\n l_val = self._dot(l_val, self._tree[l])\n l += 1\n if r & 1:\n r -= 1\n r_val = self._dot(self._tree[r], r_val)\n l >>= 1\n r >>= 1\n return self._dot(l_val, r_val)\n\ndef resolve():\n n, k = map(int, input().split())\n\n tree = SegmentTree([0] * n, lambda x, y:(x+y)%MOD, 0)\n tree.update(0, 1)\n D = [tuple(map(int, input().split())) for _ in range(k)]\n\n for i in range(1, n):\n for l, r in D: \n if i - l >= 0:\n tree.add(i, tree.sum(i - r, i - l + 1))\n print(tree[n - 1] % MOD)\nresolve()", "code2": "import sys\nINF = 1 << 60\nMOD = 998244353\nsys.setrecursionlimit(2147483647)\ninput = lambda:sys.stdin.readline().rstrip()\n\nclass SegmentTree(object):\n def __init__(self, A, dot, unit):\n n = 1 << (len(A) - 1).bit_length()\n tree = [unit] * (2 * n)\n for i, v in enumerate(A):\n tree[i + n] = v\n for i in range(n - 1, 0, -1):\n tree[i] = dot(tree[i << 1], tree[i << 1 | 1])\n self._n = n\n self._tree = tree\n self._dot = dot\n self._unit = unit\n\n def __getitem__(self, i):\n return self._tree[i + self._n]\n\n def update(self, i, v):\n i += self._n\n self._tree[i] = v\n while i != 1:\n i >>= 1\n self._tree[i] = self._dot(self._tree[i << 1], self._tree[i << 1 | 1])\n\n def add(self, i, v):\n self.update(i, self[i] + v)\n\n def sum(self, l, r):\n l += self._n\n r += self._n\n l_val = r_val = self._unit\n while l < r:\n if l & 1:\n l_val = self._dot(l_val, self._tree[l])\n l += 1\n if r & 1:\n r -= 1\n r_val = self._dot(self._tree[r], r_val)\n l >>= 1\n r >>= 1\n return self._dot(l_val, r_val)\n\ndef resolve():\n n, k = map(int, input().split())\n D = [tuple(map(int, input().split())) for _ in range(k)]\n tree = SegmentTree([0] * n, lambda x, y : (x + y) % MOD, 0)\n tree.update(0, 1)\n\n for i in range(1, n):\n for l, r in D: \n if i - l >= 0:\n tree.add(i, tree.sum(max(0, i - r), i - l + 1))\n\n print(tree[n - 1] % MOD)\nresolve()", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600549112", "date2": "1600549319", "bleu_score": "0.9848159068212872", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 90, "total_score": 102, "input": "15 2\n1 0\n3 33\n", "actual_output": "119\n", "expected_output": "41\n\n", "anno_code": ["import sys\nINF = 1 << 60 # (0): INF=1152921504606846976\nMOD = 998244353 # (1): MOD=998244353\nsys.setrecursionlimit(2147483647) # (2): NO CHANGE\ninput = lambda:sys.stdin.readline().rstrip() # (3): input= at 0x000001AABDD85BD0>\n\nclass SegmentTree(object): # (4): SegmentTree=\n def __init__(self, A, dot, unit):\n n = 1 << (len(A) - 1).bit_length() # (9): n=16\n tree = [unit] * (2 * n) # (10): tree=[0, 0, ..., 0, 0]\n for i, v in enumerate(A): # (11): i=0, v=0 (13): i=1 ... (41): NO CHANGE\n tree[i + n] = v # (12): NO CHANGE (14): NO CHANGE ... (40): NO CHANGE\n for i in range(n - 1, 0, -1): # (42): i=15 (44): i=14 ... (72): NO CHANGE\n tree[i] = dot(tree[i << 1], tree[i << 1 | 1]) # (43): NO CHANGE (45): NO CHANGE ... (71): NO CHANGE\n self._n = n # (73): NO CHANGE\n self._tree = tree # (74): NO CHANGE\n self._dot = dot # (75): NO CHANGE\n self._unit = unit # (76): n=15, k=2, tree=\n\n def __getitem__(self, i):\n return self._tree[i + self._n]\n\n def update(self, i, v):\n i += self._n # (78): i=16 (103): i=17 ... (1128): i=30\n self._tree[i] = v # (79): NO CHANGE (104): NO CHANGE ... (1129): NO CHANGE\n while i != 1: # (80): NO CHANGE (83): NO CHANGE ... (1142): n=15, k=2, tree=, D=[(1, 0), (3, 33)], i=14, l=3, r=33\n i >>= 1 # (81): i=8 (84): i=4 ... (1140): i=1\n self._tree[i] = self._dot(self._tree[i << 1], self._tree[i << 1 | 1]) # (82): NO CHANGE (85): NO CHANGE ... (1141): NO CHANGE\n\n def add(self, i, v):\n self.update(i, self[i] + v) # (102): NO CHANGE (129): NO CHANGE ... (1127): NO CHANGE\n\n def sum(self, l, r):\n l += self._n # (98): l=17 (125): l=18 ... (1088): l=-3\n r += self._n # (99): r=17 (126): r=18 ... (1089): r=28\n l_val = r_val = self._unit # (100): l_val=0, r_val=0 (127): l_val=0, r_val=0 ... (1090): l_val=0, r_val=0\n while l < r: # (101): i=1, v=0 (128): i=2, v=0 ... (1126): i=14, v=119\n if l & 1: # (179): NO CHANGE (186): NO CHANGE ... (1120): NO CHANGE\n l_val = self._dot(l_val, self._tree[l]) # (187): NO CHANGE (194): NO CHANGE ... (1100): NO CHANGE\n l += 1 # (188): l=-6 (195): l=-2 ... (1101): l=0\n if r & 1: # (180): NO CHANGE (189): NO CHANGE ... (1121): NO CHANGE\n r -= 1 # (181): r=16 (209): r=0 ... (1122): r=0\n r_val = self._dot(self._tree[r], r_val) # (182): r_val=1 (210): NO CHANGE ... (1123): NO CHANGE\n l >>= 1 # (183): l=-7 (190): l=-3 ... (1124): NO CHANGE\n r >>= 1 # (184): r=8 (191): r=4 ... (1125): NO CHANGE\n return self._dot(l_val, r_val)\n\ndef resolve(): # (5): resolve=\n n, k = map(int, input().split()) # (7): n=15, k=2\n\n tree = SegmentTree([0] * n, lambda x, y:(x+y)%MOD, 0) # (8): self=, A=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], dot=. at 0x000001AABDD85F30>, unit=0\n tree.update(0, 1) # (77): self=, i=0, v=1\n D = [tuple(map(int, input().split())) for _ in range(k)] # (93): D=[(1, 0), (3, 33)]\n\n for i in range(1, n): # (94): i=1 (121): i=2 ... (1144): NO CHANGE\n for l, r in D: # (95): l=1, r=0 (118): l=3, r=33 ... (1143): NO CHANGE\n if i - l >= 0: # (96): NO CHANGE (119): NO CHANGE ... (1086): NO CHANGE\n tree.add(i, tree.sum(i - r, i - l + 1)) # (97): self=, r=1 (124): self=, l=2, r=2 ... (1087): self=, l=-19, r=12\n print(tree[n - 1] % MOD)\nresolve() # (6): NO CHANGE\n"], "anno_status": [false], "diff_content": " import sys\n INF = 1 << 60\n MOD = 998244353\n sys.setrecursionlimit(2147483647)\n input = lambda:sys.stdin.readline().rstrip()\n \n class SegmentTree(object):\n def __init__(self, A, dot, unit):\n n = 1 << (len(A) - 1).bit_length()\n tree = [unit] * (2 * n)\n for i, v in enumerate(A):\n tree[i + n] = v\n for i in range(n - 1, 0, -1):\n tree[i] = dot(tree[i << 1], tree[i << 1 | 1])\n self._n = n\n self._tree = tree\n self._dot = dot\n self._unit = unit\n \n def __getitem__(self, i):\n return self._tree[i + self._n]\n \n def update(self, i, v):\n i += self._n\n self._tree[i] = v\n while i != 1:\n i >>= 1\n self._tree[i] = self._dot(self._tree[i << 1], self._tree[i << 1 | 1])\n \n def add(self, i, v):\n self.update(i, self[i] + v)\n \n def sum(self, l, r):\n l += self._n\n r += self._n\n l_val = r_val = self._unit\n while l < r:\n if l & 1:\n l_val = self._dot(l_val, self._tree[l])\n l += 1\n if r & 1:\n r -= 1\n r_val = self._dot(self._tree[r], r_val)\n l >>= 1\n r >>= 1\n return self._dot(l_val, r_val)\n \n def resolve():\n n, k = map(int, input().split())\n-\n- tree = SegmentTree([0] * n, lambda x, y:(x+y)%MOD, 0)\n- tree.update(0, 1)\n D = [tuple(map(int, input().split())) for _ in range(k)]\n+ tree = SegmentTree([0] * n, lambda x, y : (x + y) % MOD, 0)\n+ tree.update(0, 1)\n \n for i in range(1, n):\n for l, r in D: \n if i - l >= 0:\n- tree.add(i, tree.sum(i - r, i - l + 1))\n+ tree.add(i, tree.sum(max(0, i - r), i - l + 1))\n+\n print(tree[n - 1] % MOD)\n resolve()\n", "FL_content": "\n import sys\n INF = 1 << 60\n MOD = 998244353\n sys.setrecursionlimit(2147483647)\n input = lambda:sys.stdin.readline().rstrip()\n \n class SegmentTree(object):\n def __init__(self, A, dot, unit):\n n = 1 << (len(A) - 1).bit_length()\n tree = [unit] * (2 * n)\n for i, v in enumerate(A):\n tree[i + n] = v\n for i in range(n - 1, 0, -1):\n tree[i] = dot(tree[i << 1], tree[i << 1 | 1])\n self._n = n\n self._tree = tree\n self._dot = dot\n self._unit = unit\n \n def __getitem__(self, i):\n return self._tree[i + self._n]\n \n def update(self, i, v):\n i += self._n\n self._tree[i] = v\n while i != 1:\n i >>= 1\n self._tree[i] = self._dot(self._tree[i << 1], self._tree[i << 1 | 1])\n \n def add(self, i, v):\n self.update(i, self[i] + v)\n \n def sum(self, l, r):\n l += self._n\n r += self._n\n l_val = r_val = self._unit\n while l < r:\n if l & 1:\n l_val = self._dot(l_val, self._tree[l])\n l += 1\n if r & 1:\n r -= 1\n r_val = self._dot(self._tree[r], r_val)\n l >>= 1\n r >>= 1\n return self._dot(l_val, r_val)\n \n def resolve():\n n, k = map(int, input().split())\n \n tree = SegmentTree([0] * n, lambda x, y:(x+y)%MOD, 0)\n tree.update(0, 1)\n D = [tuple(map(int, input().split())) for _ in range(k)]\n \n for i in range(1, n):\n for l, r in D: \n if i - l >= 0:\n- tree.add(i, tree.sum(i - r, i - l + 1))\n print(tree[n - 1] % MOD)\n resolve()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 60 }, { "user_id": "u652569315", "problem_id": "p02702", "submission1_id": "s809174281-FL", "submission2_id": "s513299389", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n s=input()[::-1]\n l,mod=len(s),2019\n x=[0]*(l+1)\n x[1]=(int(s[0])*(pow(10,1,mod)))%mod\n for i in range(2,l+1):\n x[i]=((int(s[i-1])*(pow(10,i,mod)))+x[i-1])%mod\n ll=len(set(x))\n print(l-ll+1)\nif __name__=='__main__':\n main()", "code2": "def main():\n s=input()[::-1]\n l,mod=len(s),2019\n x=[0]*mod\n x[0]=1\n a,t=0,1\n for i in range(l):\n a = (a + int(s[i])*t) % 2019\n x[a]+=1\n t=(t*10)%mod\n ans=sum([i*(i-1)\n print(ans)\nif __name__=='__main__':\n main()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1587958088", "date2": "1587958829", "bleu_score": "0.6345015325760955", "code1_test_status": [1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 66, "total_score": 74, "input": "649171600089\n", "actual_output": "3\n", "expected_output": "6\n\n", "anno_code": ["def main(): # (0): main=\n s=input()[::-1]\n l,mod=len(s),2019\n x=[0]*(l+1)\n x[1]=(int(s[0])*(pow(10,1,mod)))%mod\n for i in range(2,l+1):\n x[i]=((int(s[i-1])*(pow(10,i,mod)))+x[i-1])%mod\n ll=len(set(x))\n print(l-ll+1)\nif __name__=='__main__':\n main()"], "anno_status": [true], "diff_content": " def main():\n s=input()[::-1]\n l,mod=len(s),2019\n- x=[0]*(l+1)\n- x[1]=(int(s[0])*(pow(10,1,mod)))%mod\n- for i in range(2,l+1):\n- x[i]=((int(s[i-1])*(pow(10,i,mod)))+x[i-1])%mod\n- ll=len(set(x))\n- print(l-ll+1)\n+ x=[0]*mod\n+ x[0]=1\n+ a,t=0,1\n+ for i in range(l):\n+ a = (a + int(s[i])*t) % 2019\n+ x[a]+=1\n+ t=(t*10)%mod\n+ ans=sum([i*(i-1)\n+ print(ans)\n if __name__=='__main__':\n main()\n", "FL_content": "\n def main():\n s=input()[::-1]\n l,mod=len(s),2019\n x=[0]*(l+1)\n x[1]=(int(s[0])*(pow(10,1,mod)))%mod\n for i in range(2,l+1):\n x[i]=((int(s[i-1])*(pow(10,i,mod)))+x[i-1])%mod\n ll=len(set(x))\n- print(l-ll+1)\n if __name__=='__main__':\n main()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u864197622", "problem_id": "p02867", "submission1_id": "s785509879-FL", "submission2_id": "s248086512", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = [int(a) for a in input().split()]\nB = [int(a) for a in input().split()]\n\nAA = sorted(A)\nBB = sorted(B)\n\nIA = {}\nIB = {}\nfor i in range(N):\n IA[A[i]] = i\n IB[B[i]] = i\n\nfor i in range(N):\n if AA[i] > BB[i]:\n print(\"No\")\n break\nelse:\n i = 0\n j = 0\n k = 0\n X = [0] * N\n Y = [0] * N\n for j in range(N):\n while i < N - 1 and AA[i+1] <= BB[j]:\n i += 1\n X[j] = i\n Y[j] = k\n if i == j: k = i + 1\n \n for i in range(N):\n if IA[AA[Y[i]]] <= IB[BB[i]] <= IA[AA[X[i]]]:\n print(\"Yes\")\n break\n else:\n print(\"No\")\n\n", "code2": "N = int(input())\nA = [int(a) for a in input().split()]\nB = [int(a) for a in input().split()]\nA = [(A[i]<<18) + i for i in range(N)]\nB = [(B[i]<<18) + i + (1<<17) for i in range(N)]\nAA = sorted(A)\nBB = sorted(B)\n\nIA = {}\nIB = {}\nfor i in range(N):\n IA[AA[i]] = i\n IB[BB[i]] = i\n\nfor i in range(N):\n if AA[i] > BB[i]:\n print(\"No\")\n break\nelse:\n for i in range(1, N):\n if AA[i] <= BB[i-1]:\n print(\"Yes\")\n break\n else:\n for i in range(N):\n if IA[A[i]] == IB[B[i]]:\n print(\"Yes\")\n break\n else:\n c = 1\n i = 0\n P = [-1] * N\n for i in range(N):\n P[IA[A[i]]] = IB[B[i]]\n i = P[0]\n while i != 0:\n i = P[i]\n c += 1\n if c < N:\n print(\"Yes\")\n else:\n print(\"No\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1573355063", "date2": "1573363457", "bleu_score": "0.6144837374766059", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 78, "total_score": 103, "input": "3\n0 -3 -1\n-1 18 5\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = [int(a) for a in input().split()] # (1): A=[0, -3, -1]\nB = [int(a) for a in input().split()] # (2): B=[-1, 18, 5]\n\nAA = sorted(A) # (3): AA=[-3, -1, 0]\nBB = sorted(B) # (4): BB=[-1, 5, 18]\n\nIA = {} # (5): IA={}\nIB = {} # (6): IB={}\nfor i in range(N): # (7): i=0 (10): i=1 ... (16): NO CHANGE\n IA[A[i]] = i # (8): IA={0: 0} (11): IA={0: 0, -3: 1} (14): IA={0: 0, -3: 1, -1: 2}\n IB[B[i]] = i # (9): IB={-1: 0} (12): IB={-1: 0, 18: 1} (15): IB={-1: 0, 18: 1, 5: 2}\n\nfor i in range(N): # (17): i=0 (19): i=1 ... (23): NO CHANGE\n if AA[i] > BB[i]: # (18): NO CHANGE (20): NO CHANGE (22): NO CHANGE\n print(\"No\")\n break\nelse:\n i = 0 # (24): i=0\n j = 0 # (25): j=0\n k = 0 # (26): k=0\n X = [0] * N # (27): X=[0, 0, 0]\n Y = [0] * N # (28): Y=[0, 0, 0]\n for j in range(N): # (29): NO CHANGE (36): j=1 ... (48): NO CHANGE\n while i < N - 1 and AA[i+1] <= BB[j]: # (30): NO CHANGE (32): NO CHANGE ... (44): NO CHANGE\n i += 1 # (31): i=1 (38): i=2\n X[j] = i # (33): X=[1, 0, 0] (40): X=[1, 2, 0] (45): X=[1, 2, 2]\n Y[j] = k # (34): NO CHANGE (41): NO CHANGE (46): NO CHANGE\n if i == j: k = i + 1 # (35): NO CHANGE (42): NO CHANGE (47): k=3\n \n for i in range(N): # (49): i=0 (51): i=1 ... (55): NO CHANGE\n if IA[AA[Y[i]]] <= IB[BB[i]] <= IA[AA[X[i]]]: # (50): NO CHANGE (52): NO CHANGE (54): NO CHANGE\n print(\"Yes\")\n break\n else:\n print(\"No\")\n\n"], "anno_status": [true], "diff_content": " N = int(input())\n A = [int(a) for a in input().split()]\n B = [int(a) for a in input().split()]\n-\n+A = [(A[i]<<18) + i for i in range(N)]\n+B = [(B[i]<<18) + i + (1<<17) for i in range(N)]\n AA = sorted(A)\n BB = sorted(B)\n \n IA = {}\n IB = {}\n for i in range(N):\n- IA[A[i]] = i\n- IB[B[i]] = i\n+ IA[AA[i]] = i\n+ IB[BB[i]] = i\n \n for i in range(N):\n if AA[i] > BB[i]:\n print(\"No\")\n break\n else:\n- i = 0\n- j = 0\n- k = 0\n- X = [0] * N\n- Y = [0] * N\n- for j in range(N):\n- while i < N - 1 and AA[i+1] <= BB[j]:\n- i += 1\n- X[j] = i\n- Y[j] = k\n- if i == j: k = i + 1\n- \n- for i in range(N):\n- if IA[AA[Y[i]]] <= IB[BB[i]] <= IA[AA[X[i]]]:\n+ for i in range(1, N):\n+ if AA[i] <= BB[i-1]:\n print(\"Yes\")\n break\n else:\n- print(\"No\")\n-\n-\n+ for i in range(N):\n+ if IA[A[i]] == IB[B[i]]:\n+ print(\"Yes\")\n+ break\n+ else:\n+ c = 1\n+ i = 0\n+ P = [-1] * N\n+ for i in range(N):\n+ P[IA[A[i]]] = IB[B[i]]\n+ i = P[0]\n+ while i != 0:\n+ i = P[i]\n+ c += 1\n+ if c < N:\n+ print(\"Yes\")\n+ else:\n+ print(\"No\")\n", "FL_content": "\n N = int(input())\n A = [int(a) for a in input().split()]\n B = [int(a) for a in input().split()]\n \n AA = sorted(A)\n BB = sorted(B)\n \n IA = {}\n IB = {}\n for i in range(N):\n IA[A[i]] = i\n IB[B[i]] = i\n \n for i in range(N):\n if AA[i] > BB[i]:\n print(\"No\")\n break\n else:\n i = 0\n j = 0\n k = 0\n X = [0] * N\n Y = [0] * N\n for j in range(N):\n while i < N - 1 and AA[i+1] <= BB[j]:\n i += 1\n X[j] = i\n Y[j] = k\n if i == j: k = i + 1\n \n for i in range(N):\n- if IA[AA[Y[i]]] <= IB[BB[i]] <= IA[AA[X[i]]]:\n print(\"Yes\")\n break\n else:\n print(\"No\")\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 38 }, { "user_id": "u131411061", "problem_id": "p02916", "submission1_id": "s963746134-FL", "submission2_id": "s596826092", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\nC = list(map(int,input().split()))\n\nres = 0\nprev = -1\nfor i in range(N):\n\tres += B[A[i]-1]\n\tif prev+1 == A[i]-1:\n\t\tres += C[prev]\n\tprev = A[i]-1 \nprint(res)", "code2": "N = int(input())\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\nC = list(map(int,input().split()))\n \nans = 0\ntmp = -1\nfor a in A:\n ans += B[a-1]\n if a-tmp == 1:\n ans += C[tmp-1]\n tmp = a\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596641906", "date2": "1596641946", "bleu_score": "0.6924632189000911", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1], "code1_test_score": 86, "total_score": 103, "input": "2\n1 0\n18 74\n56\n", "actual_output": "148\n", "expected_output": "92\n\n", "anno_code": ["N = int(input()) # (0): N=2\nA = list(map(int,input().split())) # (1): A=[1, 0]\nB = list(map(int,input().split())) # (2): B=[18, 74]\nC = list(map(int,input().split())) # (3): C=[56]\n\nres = 0 # (4): res=0\nprev = -1 # (5): prev=-1\nfor i in range(N): # (6): i=0 (11): i=1 (15): NO CHANGE\n\tres += B[A[i]-1] # (7): res=18 (12): res=148\n\tif prev+1 == A[i]-1: # (8): NO CHANGE (13): NO CHANGE\n\t\tres += C[prev] # (9): res=74\n\tprev = A[i]-1 # (10): prev=0 (14): prev=-1\nprint(res)"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int,input().split()))\n B = list(map(int,input().split()))\n C = list(map(int,input().split()))\n-\n-res = 0\n-prev = -1\n-for i in range(N):\n-\tres += B[A[i]-1]\n-\tif prev+1 == A[i]-1:\n-\t\tres += C[prev]\n-\tprev = A[i]-1 \n-print(res)\n+ \n+ans = 0\n+tmp = -1\n+for a in A:\n+ ans += B[a-1]\n+ if a-tmp == 1:\n+ ans += C[tmp-1]\n+ tmp = a\n+print(ans)\n", "FL_content": "\n N = int(input())\n A = list(map(int,input().split()))\n B = list(map(int,input().split()))\n C = list(map(int,input().split()))\n \n res = 0\n-prev = -1\n for i in range(N):\n \tres += B[A[i]-1]\n-\tif prev+1 == A[i]-1:\n \t\tres += C[prev]\n-\tprev = A[i]-1 \n print(res)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u178432859", "problem_id": "p02933", "submission1_id": "s408028237-FL", "submission2_id": "s623927079", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\nb = input()\nif a >= 3200:\n print(\"red\")\nelse:\n print(b)", "code2": "a = int(input())\nb = input()\nif a >= 3200:\n print(b)\nelse: \n print(\"red\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574119846", "date2": "1574119913", "bleu_score": "0.8987560303334583", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 1, "total_score": 103, "input": "4049\nbap\n", "actual_output": "red\n", "expected_output": "bap\n\n", "anno_code": ["a = int(input()) # (0): a=4049\nb = input() # (1): b=bap\nif a >= 3200: # (2): NO CHANGE\n print(\"red\")\nelse:\n print(b)"], "anno_status": [true], "diff_content": " a = int(input())\n b = input()\n if a >= 3200:\n- print(\"red\")\n-else:\n- print(b)\n+ print(b)\n+else: \n+ print(\"red\")\n", "FL_content": "\n a = int(input())\n b = input()\n-if a >= 3200:\n- print(\"red\")\n-else:\n print(b)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u882831132", "problem_id": "p03380", "submission1_id": "s480336723-FL", "submission2_id": "s672364251", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\na = tuple(int(x) for x in input().split())\n\ndef hoge(n, r):\n return n * (min(n-r, r))\n\nn = max(a)\nans = (n, a[0])\nfor i in a[1:]:\n ans = (n, i) if hoge(*ans) < hoge(n, i) else ans\nprint(*ans)", "code2": "N = int(input())\na = sorted(int(x) for x in input().split())\n\ndef hoge(n, r):\n return n * (min(n-r, r))\n\nn = max(a)\nans = (n, a[0])\nfor i in a[1:]:\n ans = (n, i) if hoge(*ans) < hoge(n, i) else ans\nprint(*ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1523758684", "date2": "1523758784", "bleu_score": "0.9661743608671755", "code1_test_status": [1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 93, "total_score": 100, "input": "2\n011 0\n", "actual_output": "11 11\n", "expected_output": "11 0\n\n", "anno_code": ["N = int(input()) # (0): N=2\na = tuple(int(x) for x in input().split()) # (1): a=(11, 0)\n\ndef hoge(n, r): # (2): hoge=\n return n * (min(n-r, r))\n\nn = max(a) # (3): n=11\nans = (n, a[0]) # (4): ans=(11, 11)\nfor i in a[1:]: # (5): i=0 (7): NO CHANGE\n ans = (n, i) if hoge(*ans) < hoge(n, i) else ans # (6): NO CHANGE\nprint(*ans)"], "anno_status": [true], "diff_content": " N = int(input())\n-a = tuple(int(x) for x in input().split())\n+a = sorted(int(x) for x in input().split())\n \n def hoge(n, r):\n return n * (min(n-r, r))\n \n n = max(a)\n ans = (n, a[0])\n for i in a[1:]:\n ans = (n, i) if hoge(*ans) < hoge(n, i) else ans\n print(*ans)\n", "FL_content": "\n N = int(input())\n a = tuple(int(x) for x in input().split())\n \n def hoge(n, r):\n return n * (min(n-r, r))\n \n n = max(a)\n-ans = (n, a[0])\n for i in a[1:]:\n ans = (n, i) if hoge(*ans) < hoge(n, i) else ans\n print(*ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u941407962", "problem_id": "p02589", "submission1_id": "s105102881-FL", "submission2_id": "s703959964", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys;input=sys.stdin.readline\nN, = map(int, input().split())\nMOD=998244353\nS = []\nfor _ in range(N):\n s = input().strip()\n S.append(s)\nS.sort(key=lambda x:len(x))\nD = dict()\ndd = set()\nR = 0\nfor s in S:\n l = len(s)\n d = [0]*26\n for c in dd:\n d[c] += 1\n tmp=0\n for i in range(l-1, -1, -1):\n ee = ord(s[i]) - 97\n tmp = 100*tmp+ee\n R += d[ee]\n d[ee] = 0\n if tmp in D:\n for c in D[tmp]:\n d[c] += 1\n if i == 1:\n nn = tmp\n if l != 1:\n if nn not in D:\n D[nn] = set()\n D[nn].add(ee)\n else:\n dd.add(ee)\nprint(R)\n", "code2": "import sys;input=sys.stdin.readline\nN, = map(int, input().split())\nMOD=67280421310721\nS = []\nfor _ in range(N):\n s = input().strip()\n S.append(s)\nS.sort(key=lambda x:len(x))\nD = dict()\ndd = set()\nR = 0\nfor s in S:\n l = len(s)\n d = [0]*26\n for c in dd:\n d[c] += 1\n tmp=0\n for i in range(l-1, -1, -1):\n ee = ord(s[i]) - 97\n tmp = 100*tmp+(ee+1)\n tmp %= MOD\n R += d[ee]\n d[ee] = 0\n if tmp in D:\n for c in D[tmp]:\n d[c] += 1\n if i == 1:\n nn = tmp\n if l != 1:\n if nn not in D:\n D[nn] = set()\n D[nn].add(ee)\n else:\n dd.add(ee)\nprint(R)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597029341", "date2": "1597029944", "bleu_score": "0.9408173346968556", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 102, "input": "3\ncybxxa\ncyw\nbaa\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["import sys;input=sys.stdin.readline\nN, = map(int, input().split()) # (0): N=3\nMOD=998244353 # (1): MOD=998244353\nS = [] # (2): S=[]\nfor _ in range(N): # (3): _=0 (6): _=1 ... (12): NO CHANGE\n s = input().strip() # (4): s=cybxxa (7): s=cyw (10): s=baa\n S.append(s) # (5): S=['cybxxa'] (8): S=['cybxxa', 'cyw'] (11): S=['cybxxa', 'cyw', 'baa']\nS.sort(key=lambda x:len(x)) # (13): S=['cyw', 'baa', 'cybxxa']\nD = dict() # (14): D={}\ndd = set() # (15): dd=set()\nR = 0 # (16): R=0\nfor s in S: # (17): s=cyw (49): s=baa ... (137): NO CHANGE\n l = len(s) # (18): l=3 (50): NO CHANGE (82): l=6\n d = [0]*26 # (19): d=[0, 0, ..., 0, 0] (51): NO CHANGE (83): NO CHANGE\n for c in dd: # (20): NO CHANGE (52): NO CHANGE (84): NO CHANGE\n d[c] += 1\n tmp=0 # (21): tmp=0 (53): tmp=0 (85): tmp=0\n for i in range(l-1, -1, -1): # (22): i=2 (29): i=1 ... (132): NO CHANGE\n ee = ord(s[i]) - 97 # (23): ee=22 (30): ee=24 ... (126): ee=2\n tmp = 100*tmp+ee # (24): tmp=22 (31): tmp=2224 ... (127): tmp=2323012402\n R += d[ee] # (25): NO CHANGE (32): NO CHANGE ... (128): NO CHANGE\n d[ee] = 0 # (26): NO CHANGE (33): NO CHANGE ... (129): NO CHANGE\n if tmp in D: # (27): NO CHANGE (34): NO CHANGE ... (130): NO CHANGE\n for c in D[tmp]: # (92): c=1 (94): NO CHANGE\n d[c] += 1 # (93): d=[0, 1, ..., 0, 0]\n if i == 1: # (28): NO CHANGE (35): NO CHANGE ... (131): NO CHANGE\n nn = tmp # (36): nn=2224 (68): nn=0 (124): nn=23230124\n if l != 1: # (45): NO CHANGE (77): NO CHANGE (133): NO CHANGE\n if nn not in D: # (46): NO CHANGE (78): NO CHANGE (134): NO CHANGE\n D[nn] = set() # (47): D={2224: set()} (79): D={2224: {2}, 0: set()} (135): D={2224: {2}, 0: {1}, 23230124: set()}\n D[nn].add(ee) # (48): D={2224: {2}} (80): D={2224: {2}, 0: {1}} (136): D={2224: {2}, 0: {1}, 23230124: {2}}\n else:\n dd.add(ee)\nprint(R)\n"], "anno_status": [false], "diff_content": " import sys;input=sys.stdin.readline\n N, = map(int, input().split())\n-MOD=998244353\n+MOD=67280421310721\n S = []\n for _ in range(N):\n s = input().strip()\n S.append(s)\n S.sort(key=lambda x:len(x))\n D = dict()\n dd = set()\n R = 0\n for s in S:\n l = len(s)\n d = [0]*26\n for c in dd:\n d[c] += 1\n tmp=0\n for i in range(l-1, -1, -1):\n ee = ord(s[i]) - 97\n- tmp = 100*tmp+ee\n+ tmp = 100*tmp+(ee+1)\n+ tmp %= MOD\n R += d[ee]\n d[ee] = 0\n if tmp in D:\n for c in D[tmp]:\n d[c] += 1\n if i == 1:\n nn = tmp\n if l != 1:\n if nn not in D:\n D[nn] = set()\n D[nn].add(ee)\n else:\n dd.add(ee)\n print(R)\n \n", "FL_content": "\n import sys;input=sys.stdin.readline\n N, = map(int, input().split())\n MOD=998244353\n S = []\n for _ in range(N):\n s = input().strip()\n S.append(s)\n S.sort(key=lambda x:len(x))\n D = dict()\n dd = set()\n R = 0\n for s in S:\n l = len(s)\n d = [0]*26\n for c in dd:\n d[c] += 1\n tmp=0\n for i in range(l-1, -1, -1):\n ee = ord(s[i]) - 97\n tmp = 100*tmp+ee\n R += d[ee]\n d[ee] = 0\n if tmp in D:\n for c in D[tmp]:\n d[c] += 1\n if i == 1:\n nn = tmp\n- if l != 1:\n- if nn not in D:\n- D[nn] = set()\n- D[nn].add(ee)\n- else:\n- dd.add(ee)\n print(R)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 35 }, { "user_id": "u653005308", "problem_id": "p04039", "submission1_id": "s308420841-FL", "submission2_id": "s092995203", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,k=map(int,input().split())\ndislike=list(map(int,input().split()))\n\n\nwhile 1:\n for i in range(len(str(n))):\n if int(str(n)[i]) in dislike:\n break\n print(n)\n exit()\n n+=1", "code2": "n,k=map(int,input().split())\ndislike=list(map(int,input().split()))\n\n\nwhile 1:\n for i in range(len(str(n))):\n if int(str(n)[i]) in dislike:\n break\n if i==len(str(n))-1:\n print(n)\n exit()\n n+=1", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1521927210", "date2": "1521927400", "bleu_score": "0.8480457907602076", "code1_test_status": [1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 82, "total_score": 94, "input": "21630 1\n0\n", "actual_output": "21630\n", "expected_output": "21631\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " n,k=map(int,input().split())\n dislike=list(map(int,input().split()))\n \n \n while 1:\n for i in range(len(str(n))):\n if int(str(n)[i]) in dislike:\n break\n- print(n)\n- exit()\n+ if i==len(str(n))-1:\n+ print(n)\n+ exit()\n n+=1\n", "FL_content": "\n n,k=map(int,input().split())\n dislike=list(map(int,input().split()))\n \n \n while 1:\n for i in range(len(str(n))):\n if int(str(n)[i]) in dislike:\n break\n- print(n)\n exit()\n n+=1\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u845643816", "problem_id": "p02234", "submission1_id": "s114645910-FL", "submission2_id": "s451103333", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\np = list(range(n+2))\n\nfor i in range(1,n+1):\n p[i], p[n+1] = map(int, input().split())\n\n\ntable = [[0] * (n+1) for i in range(n+1)]\n\n\nfor i in range(1,n): \n table[i][i+1] = p[i]*p[i+1]*p[i+2]\n\n\nfor k in range(3, n+1): \n for i in range(1,n+2-k): \n j = i + k - 1 \n\n table[i][j] = float('inf')\n\n for x in range(i, j): \n print(i, x, j)\n cost = table[i][x] + table[x+1][j] + p[i]*p[x+1]*p[j+1]\n table[i][j] = min(table[i][j], cost)\n \n\nprint(table[1][n])", "code2": "n = int(input())\np = list(range(n+2))\n\nfor i in range(1,n+1):\n p[i], p[n+1] = map(int, input().split())\n\n\ntable = [[0] * (n+1) for i in range(n+1)]\n\n\nfor i in range(1,n): \n table[i][i+1] = p[i]*p[i+1]*p[i+2]\n\n\nfor k in range(3, n+1): \n for i in range(1,n+2-k): \n j = i + k - 1 \n\n table[i][j] = float('inf')\n\n for x in range(i, j): \n \n cost = table[i][x] + table[x+1][j] + p[i]*p[x+1]*p[j+1]\n table[i][j] = min(table[i][j], cost)\n \n\nprint(table[1][n])", "original_language1": "Python3", "original_language2": "Python3", "date1": "1511266155", "date2": "1511266457", "bleu_score": "0.9713200120860555", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "6\n0 1\n18 0\n18 0\n3 3\n1 8\n2 7\n", "actual_output": "1 1 3\n1 2 3\n2 2 4\n2 3 4\n3 3 5\n3 4 5\n4 4 6\n4 5 6\n1 1 4\n1 2 4\n1 3 4\n2 2 5\n2 3 5\n2 4 5\n3 3 6\n3 4 6\n3 5 6\n1 1 5\n1 2 5\n1 3 5\n1 4 5\n2 2 6\n2 3 6\n2 4 6\n2 5 6\n1 1 6\n1 2 6\n1 3 6\n1 4 6\n1 5 6\n0\n", "expected_output": "0\n\n", "anno_code": ["n = int(input()) # (0): n=6\np = list(range(n+2)) # (1): p=[0, 1, 2, 3, 4, 5, 6, 7]\n\nfor i in range(1,n+1): # (2): i=1 (4): i=2 ... (14): NO CHANGE\n p[i], p[n+1] = map(int, input().split()) # (3): p=[0, 0, 2, 3, 4, 5, 6, 1] (5): p=[0, 0, 18, 3, 4, 5, 6, 0] ... (13): p=[0, 0, 18, 18, 3, 1, 2, 7]\n\n\ntable = [[0] * (n+1) for i in range(n+1)] # (15): table\n\n\nfor i in range(1,n): # (16): i=1 (18): i=2 ... (26): NO CHANGE\n table[i][i+1] = p[i]*p[i+1]*p[i+2] # (17): NO CHANGE (19): table ... (25): table\n\n\nfor k in range(3, n+1): # (27): k=3 (77): k=4 ... (195): NO CHANGE\n for i in range(1,n+2-k): # (28): i=1 (40): i=2 ... (194): NO CHANGE\n j = i + k - 1 # (29): j=3 (41): j=4 ... (171): NO CHANGE\n\n table[i][j] = float('inf') # (30): table (42): table ... (172): table\n\n for x in range(i, j): # (31): x=1 (35): x=2 ... (193): NO CHANGE\n print(i, x, j) # (32): NO CHANGE (36): NO CHANGE ... (190): NO CHANGE\n cost = table[i][x] + table[x+1][j] + p[i]*p[x+1]*p[j+1] # (33): cost=972 (37): cost=0 ... (191): cost=0\n table[i][j] = min(table[i][j], cost) # (34): table (38): table ... (192): table\n \n\nprint(table[1][n])"], "anno_status": [true], "diff_content": " n = int(input())\n p = list(range(n+2))\n \n for i in range(1,n+1):\n p[i], p[n+1] = map(int, input().split())\n \n \n table = [[0] * (n+1) for i in range(n+1)]\n \n \n for i in range(1,n): \n table[i][i+1] = p[i]*p[i+1]*p[i+2]\n \n \n for k in range(3, n+1): \n for i in range(1,n+2-k): \n j = i + k - 1 \n \n table[i][j] = float('inf')\n \n for x in range(i, j): \n- print(i, x, j)\n+ \n cost = table[i][x] + table[x+1][j] + p[i]*p[x+1]*p[j+1]\n table[i][j] = min(table[i][j], cost)\n \n \n print(table[1][n])\n", "FL_content": "\n n = int(input())\n p = list(range(n+2))\n \n for i in range(1,n+1):\n p[i], p[n+1] = map(int, input().split())\n \n \n table = [[0] * (n+1) for i in range(n+1)]\n \n \n for i in range(1,n): \n table[i][i+1] = p[i]*p[i+1]*p[i+2]\n \n \n for k in range(3, n+1): \n for i in range(1,n+2-k): \n j = i + k - 1 \n \n table[i][j] = float('inf')\n \n for x in range(i, j): \n- print(i, x, j)\n cost = table[i][x] + table[x+1][j] + p[i]*p[x+1]*p[j+1]\n table[i][j] = min(table[i][j], cost)\n \n \n print(table[1][n])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u170201762", "problem_id": "p03297", "submission1_id": "s448710348-FL", "submission2_id": "s547578596", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import floor\ndef gcd(a,b):\n if b == 0:\n return a\n else:\n return gcd(b,a%b)\nT = int(input())\nfor i in range(T):\n A,B,C,D = map(int,input().split())\n if B > D:\n print(\"No\")\n else:\n if A%B>C:\n print(\"No\")\n else:\n d = gcd(B,D%B)\n r = A%B\n if r%d == 0:\n if B-D > C:\n print(\"No\")\n else:\n print(\"Yes\")\n else:\n if r+floor((B-r)/d) > C:\n print(\"No\")\n else:\n print(\"Yes\")", "code2": "from math import floor\ndef gcd(a,b):\n if b == 0:\n return a\n else:\n return gcd(b,a%b)\nT = int(input())\nfor i in range(T):\n A,B,C,D = map(int,input().split())\n if B > D or B > A:\n print(\"No\")\n else:\n if A%B>C:\n print(\"No\")\n else:\n d = gcd(B,D%B)\n r = (A%B)%d\n if B - d + r > C:\n print(\"No\")\n else:\n print(\"Yes\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531625535", "date2": "1531625869", "bleu_score": "0.6540770737206815", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "14\n9 7 5 9\n9 7 9 9\n14 10 7 12\n14 10 15 12\n14 10 9 12\n14 11 7 11\n14 10 8 11\n14 10 9 11\n9 10 3 4\n10 11 5 10\n11 10 5 7\n16 10 5 10\n1000000000100000000 17 14 999999999999999985\n1000000000010000000 23 15 1358327919252224189\n", "actual_output": "Yes\nYes\nYes\nYes\nYes\nYes\nYes\nYes\nNo\nNo\nNo\nNo\nYes\nYes\n", "expected_output": "No\nYes\nNo\nYes\nYes\nYes\nNo\nYes\nNo\nNo\nNo\nNo\nYes\nNo\n\n", "anno_code": ["from math import floor\ndef gcd(a,b): # (0): gcd=\n if b == 0: # (7): a=2, b=1 (8): a=1, b=0 ... (126): floor=, gcd=, T=14, i=13, A=1000000000010000000, B=23, C=15, D=1358327919252224189, d=1, r=14\n return a\n else:\n return gcd(b,a%b)\nT = int(input()) # (1): T=14\nfor i in range(T): # (2): i=0 (14): i=1 ... (118): i=13\n A,B,C,D = map(int,input().split()) # (3): A=9, B=7, C=5, D=9 (15): C=9 ... (119): A=1000000000010000000, B=23, C=15, D=1358327919252224189\n if B > D: # (4): NO CHANGE (16): NO CHANGE ... (120): NO CHANGE\n print(\"No\") # (94): NO CHANGE (98): NO CHANGE (102): NO CHANGE\n else:\n if A%B>C: # (5): NO CHANGE (17): NO CHANGE ... (121): NO CHANGE\n print(\"No\") # (107): NO CHANGE\n else:\n d = gcd(B,D%B) # (6): a=7, b=2 (18): a=7, b=2 ... (122): a=23, b=6\n r = A%B # (10): r=2 (22): NO CHANGE ... (127): r=0\n if r%d == 0: # (11): NO CHANGE (23): NO CHANGE ... (128): NO CHANGE\n if B-D > C: # (12): NO CHANGE (24): NO CHANGE ... (129): NO CHANGE\n print(\"No\")\n else:\n print(\"Yes\") # (13): NO CHANGE (25): NO CHANGE ... (130): NO CHANGE\n else:\n if r+floor((B-r)/d) > C: # (67): NO CHANGE (116): NO CHANGE\n print(\"No\")\n else:\n print(\"Yes\") # (68): NO CHANGE (117): NO CHANGE\n"], "anno_status": [false], "diff_content": " from math import floor\n def gcd(a,b):\n if b == 0:\n return a\n else:\n return gcd(b,a%b)\n T = int(input())\n for i in range(T):\n A,B,C,D = map(int,input().split())\n- if B > D:\n+ if B > D or B > A:\n print(\"No\")\n else:\n if A%B>C:\n print(\"No\")\n else:\n d = gcd(B,D%B)\n- r = A%B\n- if r%d == 0:\n- if B-D > C:\n- print(\"No\")\n- else:\n- print(\"Yes\")\n+ r = (A%B)%d\n+ if B - d + r > C:\n+ print(\"No\")\n else:\n- if r+floor((B-r)/d) > C:\n- print(\"No\")\n- else:\n- print(\"Yes\")\n+ print(\"Yes\")\n", "FL_content": "\n from math import floor\n def gcd(a,b):\n if b == 0:\n return a\n else:\n return gcd(b,a%b)\n T = int(input())\n for i in range(T):\n A,B,C,D = map(int,input().split())\n if B > D:\n print(\"No\")\n else:\n if A%B>C:\n print(\"No\")\n else:\n d = gcd(B,D%B)\n r = A%B\n if r%d == 0:\n if B-D > C:\n print(\"No\")\n else:\n print(\"Yes\")\n else:\n- if r+floor((B-r)/d) > C:\n print(\"No\")\n else:\n print(\"Yes\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u857460786", "problem_id": "p02601", "submission1_id": "s315358187-FL", "submission2_id": "s615085166", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nA,B,C = map(int, input().split())\nK = int(input())\n\nfor i in range(K):\n\n if A > B:\n B *= 2\n if B > A:\n if B > C:\n C *= 2\n elif B < C:\n pass\n\nif A < B and B < C:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "\n\nA,B,C = map(int, input().split())\nK = int(input())\n\nfor i in range(K):\n\n if A >= B:\n B *= 2\n elif B > A:\n if B >= C:\n C *= 2\n elif B < C:\n pass\n else:\n pass\n\nif A < B and B < C:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1595725793", "date2": "1595726081", "bleu_score": "0.8855209345080605", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1], "code1_test_score": 60, "total_score": 102, "input": "3 3 6\n5\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["\n\nA,B,C = map(int, input().split()) # (0): A=3, B=3, C=6\nK = int(input()) # (1): K=5\n\nfor i in range(K): # (2): i=0 (5): i=1 ... (17): NO CHANGE\n\n if A > B: # (3): NO CHANGE (6): NO CHANGE ... (15): NO CHANGE\n B *= 2\n if B > A: # (4): NO CHANGE (7): NO CHANGE ... (16): NO CHANGE\n if B > C:\n C *= 2\n elif B < C:\n pass\n\nif A < B and B < C: # (18): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " \n \n A,B,C = map(int, input().split())\n K = int(input())\n \n for i in range(K):\n \n- if A > B:\n+ if A >= B:\n B *= 2\n- if B > A:\n- if B > C:\n+ elif B > A:\n+ if B >= C:\n C *= 2\n elif B < C:\n pass\n+ else:\n+ pass\n \n if A < B and B < C:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": "\n \n \n A,B,C = map(int, input().split())\n K = int(input())\n \n for i in range(K):\n \n if A > B:\n B *= 2\n if B > A:\n if B > C:\n C *= 2\n elif B < C:\n pass\n \n-if A < B and B < C:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u912143677", "problem_id": "p02237", "submission1_id": "s373555860-FL", "submission2_id": "s666219413", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\n\ng = [[0 for _ in range(n)] for _ in range(n)]\n\nfor i in range(n):\n a = list(map(int, input().split()))\n for j in range(a[1]):\n g[a[0] - 1][a[j + 2] - 1] = 1\n g[a[j + 2] - 1][a[0] - 1] = 1\n\nfor i in range(n):\n print(*g[i])\n", "code2": "n = int(input())\n\ng = [[0 for _ in range(n)] for _ in range(n)]\n\nfor i in range(n):\n a = list(map(int, input().split()))\n for j in range(a[1]):\n g[a[0] - 1][a[j + 2] - 1] = 1\n\nfor i in range(n):\n print(*g[i])\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1522210792", "date2": "1522210904", "bleu_score": "0.8446027429218438", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 4, "total_score": 98, "input": "4\n1 2 3 4\n2 1 2\n0 -2\n4 1 1\n", "actual_output": "0 0 1 1\n0 1 0 0\n1 0 0 0\n1 0 0 0\n", "expected_output": "0 0 1 1\n0 1 0 0\n0 0 0 0\n1 0 0 0\n\n", "anno_code": ["n = int(input()) # (0): n=4\n\ng = [[0 for _ in range(n)] for _ in range(n)] # (1): g\n\nfor i in range(n): # (2): i=0 (11): i=1 ... (26): NO CHANGE\n a = list(map(int, input().split())) # (3): a=[1, 2, 3, 4] (12): a=[2, 1, 2] ... (21): a=[4, 1, 1]\n for j in range(a[1]): # (4): j=0 (7): j=1 ... (25): NO CHANGE\n g[a[0] - 1][a[j + 2] - 1] = 1 # (5): g (8): g ... (23): NO CHANGE\n g[a[j + 2] - 1][a[0] - 1] = 1 # (6): g (9): g ... (24): NO CHANGE\n\nfor i in range(n): # (27): i=0 (29): i=1 ... (33): i=3\n print(*g[i]) # (28): NO CHANGE (30): NO CHANGE ... (34): NO CHANGE\n"], "anno_status": [true], "diff_content": " n = int(input())\n \n g = [[0 for _ in range(n)] for _ in range(n)]\n \n for i in range(n):\n a = list(map(int, input().split()))\n for j in range(a[1]):\n g[a[0] - 1][a[j + 2] - 1] = 1\n- g[a[j + 2] - 1][a[0] - 1] = 1\n \n for i in range(n):\n print(*g[i])\n \n", "FL_content": "\n n = int(input())\n \n g = [[0 for _ in range(n)] for _ in range(n)]\n \n for i in range(n):\n a = list(map(int, input().split()))\n for j in range(a[1]):\n- g[a[0] - 1][a[j + 2] - 1] = 1\n- g[a[j + 2] - 1][a[0] - 1] = 1\n \n for i in range(n):\n print(*g[i])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u316322317", "problem_id": "p02948", "submission1_id": "s836999504-FL", "submission2_id": "s216908269", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\nn,m=map(int,input().split())\nl=[]\nfor i in range(n):\n a,b=map(int,input().split())\n l.append([a,b])\nl.sort()\nl.append([0,0])\nans=0\nk=[]\nj=0\nfor i in range(1,m+1):\n while j<=n and l[j][0]<=i:\n heapq.heappush(k, l[j][1])\n j+=1\n if len(k)!=0:\n \tans+=k[-1]\n \tk.pop(-1)\nprint(ans)", "code2": "import heapq\nn,m=map(int,input().split())\nl=[]\nfor i in range(n):\n a,b=map(int,input().split())\n l.append([a,b])\nl.sort()\nl.append([0,0])\nans=0\nk=[]\nj=0\nfor i in range(1,m+1):\n while j<=n and l[j][0]<=i:\n heapq.heappush(k, -1*l[j][1])\n j+=1\n if len(k)!=0:\n \tans+=-1*k[0]\n \theapq.heappop(k)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565494289", "date2": "1565494396", "bleu_score": "0.924705079851252", "code1_test_status": [0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 94, "total_score": 102, "input": "3 4\n4 3\n4 0\n3 2\n", "actual_output": "2\n", "expected_output": "5\n\n", "anno_code": ["import heapq\nn,m=map(int,input().split()) # (0): n=3, m=4\nl=[] # (1): l=[]\nfor i in range(n): # (2): i=0 (5): i=1 ... (11): NO CHANGE\n a,b=map(int,input().split()) # (3): a=4, b=3 (6): b=0 (9): a=3, b=2\n l.append([a,b]) # (4): l=[[4, 3]] (7): l (10): l\nl.sort() # (12): l\nl.append([0,0]) # (13): l\nans=0 # (14): ans=0\nk=[] # (15): k=[]\nj=0 # (16): j=0\nfor i in range(1,m+1): # (17): i=1 (20): i=2 ... (45): NO CHANGE\n while j<=n and l[j][0]<=i: # (18): NO CHANGE (21): NO CHANGE ... (41): NO CHANGE\n heapq.heappush(k, l[j][1]) # (25): k=[2] (33): k=[0] ... (39): k=[0, 3, 0]\n j+=1 # (26): j=1 (34): j=2 ... (40): j=4\n if len(k)!=0: # (19): NO CHANGE (22): NO CHANGE ... (42): NO CHANGE\n \tans+=k[-1] # (29): ans=2 (43): NO CHANGE\n \tk.pop(-1) # (30): k=[] (44): k=[0, 3]\nprint(ans)"], "anno_status": [true], "diff_content": " import heapq\n n,m=map(int,input().split())\n l=[]\n for i in range(n):\n a,b=map(int,input().split())\n l.append([a,b])\n l.sort()\n l.append([0,0])\n ans=0\n k=[]\n j=0\n for i in range(1,m+1):\n while j<=n and l[j][0]<=i:\n- heapq.heappush(k, l[j][1])\n+ heapq.heappush(k, -1*l[j][1])\n j+=1\n if len(k)!=0:\n- \tans+=k[-1]\n- \tk.pop(-1)\n+ \tans+=-1*k[0]\n+ \theapq.heappop(k)\n print(ans)\n", "FL_content": "\n import heapq\n n,m=map(int,input().split())\n l=[]\n for i in range(n):\n a,b=map(int,input().split())\n l.append([a,b])\n l.sort()\n l.append([0,0])\n ans=0\n k=[]\n j=0\n for i in range(1,m+1):\n while j<=n and l[j][0]<=i:\n- heapq.heappush(k, l[j][1])\n j+=1\n if len(k)!=0:\n \tans+=k[-1]\n \tk.pop(-1)\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u336892997", "problem_id": "p02300", "submission1_id": "s507367998-FL", "submission2_id": "s819572230", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef clockwise(v0, v1, v2):\n a1 = v1[0] - v0[0]\n a2 = v1[1] - v0[1]\n b1 = v2[0] - v0[0]\n b2 = v2[1] - v0[1]\n return (a1*b2 - b1*a2) < 0\n\n\nn = int(input())\nvors = [[int(a) for a in input().split() ] for _ in range(n)]\nvors.sort(key=lambda v: (v[1], v[0]))\n\nover = [vors[0], vors[1]]\n\nfor v in vors[2:]:\n while len(over) > 1 and not clockwise(over[-2], over[-1], v):\n over.pop()\n over.append(v)\n \nunder = [vors[0], vors[1]]\n\nfor v in vors[2:]:\n while len(under) > 1 and clockwise(under[-2], under[-1], v):\n under.pop()\n under.append(v)\n\nprint(len(over) + len(under) - 2)\nfor v in under[:-1]:\n print(v[0], v[1])\n\nfor v in reversed(over[1:]):\n print(v[0], v[1])\n ", "code2": "\ndef sgined_area(v0, v1, v2):\n a1 = v1[0] - v0[0]\n a2 = v1[1] - v0[1]\n b1 = v2[0] - v0[0]\n b2 = v2[1] - v0[1]\n return a1*b2 - b1*a2\n\n\nn = int(input())\nvors = [[int(a) for a in input().split() ] for _ in range(n)]\nvors.sort(key=lambda v: (v[1], v[0]))\n\nover = [vors[0], vors[1]]\n\nfor v in vors[2:]:\n while len(over) > 1 and sgined_area(over[-2], over[-1], v) > 0:\n over.pop()\n over.append(v)\n \nunder = [vors[0], vors[1]]\n\nfor v in vors[2:]:\n while len(under) > 1 and sgined_area(under[-2], under[-1], v) < 0:\n under.pop()\n under.append(v)\n\nprint(len(over) + len(under) - 2)\nfor v in under[:-1]:\n print(v[0], v[1])\n\nfor v in reversed(over[1:]):\n print(v[0], v[1])\n ", "original_language1": "Python3", "original_language2": "Python3", "date1": "1465805849", "date2": "1465806139", "bleu_score": "0.9370097623382821", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 95, "total_score": 102, "input": "4\n0 0\n2 3\n1 2\n0 1\n", "actual_output": "3\n0 0\n2 3\n0 1\n", "expected_output": "4\n0 0\n2 3\n1 2\n0 1\n\n", "anno_code": ["\ndef clockwise(v0, v1, v2): # (0): clockwise=\n a1 = v1[0] - v0[0] # (7): a1=0 (14): a1=1 ... (38): a1=1\n a2 = v1[1] - v0[1] # (8): a2=1 (15): a2=1 ... (39): a2=2\n b1 = v2[0] - v0[0] # (9): b1=1 (16): b1=2 ... (40): b1=2\n b2 = v2[1] - v0[1] # (10): clockwise=, n=4, vors=[[0, 0], [0, 1], [1, 2], [2, 3]], over=[[0, 0], [0, 1]], v=[1, 2] (17): clockwise=, n=4, vors=[[0, 0], [0, 1], [1, 2], [2, 3]], over=[[0, 0], [0, 1], [1, 2]], v=[2, 3] ... (41): clockwise=, n=4, vors=[[0, 0], [0, 1], [1, 2], [2, 3]], over, v=[2, 3], under\n return (a1*b2 - b1*a2) < 0\n\n\nn = int(input()) # (1): n=4\nvors = [[int(a) for a in input().split() ] for _ in range(n)] # (2): vors\nvors.sort(key=lambda v: (v[1], v[0])) # (3): vors\n\nover = [vors[0], vors[1]] # (4): over\n\nfor v in vors[2:]: # (5): v=[1, 2] (12): v=[2, 3] (25): NO CHANGE\n while len(over) > 1 and not clockwise(over[-2], over[-1], v): # (6): v0=[0, 0], v1=[0, 1], v2=[1, 2] (13): v0=[0, 1], v1=[1, 2], v2=[2, 3] (19): v0=[0, 0], v1=[0, 1], v2=[2, 3]\n over.pop() # (18): over\n over.append(v) # (11): over (24): over\n \nunder = [vors[0], vors[1]] # (26): under\n\nfor v in vors[2:]: # (27): v=[1, 2] (36): v=[2, 3] (45): NO CHANGE\n while len(under) > 1 and clockwise(under[-2], under[-1], v): # (28): v0=[0, 0], v1=[0, 1], v2=[1, 2] (34): NO CHANGE ... (43): NO CHANGE\n under.pop() # (33): under (42): under\n under.append(v) # (35): under (44): under\n\nprint(len(over) + len(under) - 2) # (46): NO CHANGE\nfor v in under[:-1]: # (47): v=[0, 0] (49): NO CHANGE\n print(v[0], v[1]) # (48): NO CHANGE\n\nfor v in reversed(over[1:]): # (50): v=[2, 3] (52): v=[0, 1]\n print(v[0], v[1]) # (51): NO CHANGE (53): NO CHANGE\n "], "anno_status": [false], "diff_content": " \n-def clockwise(v0, v1, v2):\n+def sgined_area(v0, v1, v2):\n a1 = v1[0] - v0[0]\n a2 = v1[1] - v0[1]\n b1 = v2[0] - v0[0]\n b2 = v2[1] - v0[1]\n- return (a1*b2 - b1*a2) < 0\n+ return a1*b2 - b1*a2\n \n \n n = int(input())\n vors = [[int(a) for a in input().split() ] for _ in range(n)]\n vors.sort(key=lambda v: (v[1], v[0]))\n \n over = [vors[0], vors[1]]\n \n for v in vors[2:]:\n- while len(over) > 1 and not clockwise(over[-2], over[-1], v):\n+ while len(over) > 1 and sgined_area(over[-2], over[-1], v) > 0:\n over.pop()\n over.append(v)\n \n under = [vors[0], vors[1]]\n \n for v in vors[2:]:\n- while len(under) > 1 and clockwise(under[-2], under[-1], v):\n+ while len(under) > 1 and sgined_area(under[-2], under[-1], v) < 0:\n under.pop()\n under.append(v)\n \n print(len(over) + len(under) - 2)\n for v in under[:-1]:\n print(v[0], v[1])\n \n for v in reversed(over[1:]):\n print(v[0], v[1])\n \n", "FL_content": "\n \n def clockwise(v0, v1, v2):\n a1 = v1[0] - v0[0]\n a2 = v1[1] - v0[1]\n b1 = v2[0] - v0[0]\n b2 = v2[1] - v0[1]\n return (a1*b2 - b1*a2) < 0\n \n \n n = int(input())\n vors = [[int(a) for a in input().split() ] for _ in range(n)]\n vors.sort(key=lambda v: (v[1], v[0]))\n \n over = [vors[0], vors[1]]\n \n for v in vors[2:]:\n while len(over) > 1 and not clockwise(over[-2], over[-1], v):\n over.pop()\n over.append(v)\n \n under = [vors[0], vors[1]]\n \n for v in vors[2:]:\n while len(under) > 1 and clockwise(under[-2], under[-1], v):\n under.pop()\n under.append(v)\n \n print(len(over) + len(under) - 2)\n for v in under[:-1]:\n print(v[0], v[1])\n \n for v in reversed(over[1:]):\n print(v[0], v[1])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 34 }, { "user_id": "u970449052", "problem_id": "p02867", "submission1_id": "s554535648-FL", "submission2_id": "s121317134", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nal=list(map(int,input().split()))\nbl=list(map(int,input().split()))\nail=[(i,a) for i,a in enumerate(al)]\nbil=[(i,b) for i,b in enumerate(bl)]\nail=sorted(ail,key=lambda x:x[1])\nbil=sorted(bil,key=lambda x:x[1])\nif not all([ail[i][1]<=bil[i][1] for i in range(n)]):\n print('No')\n exit()\nif any([ail[i][0]==bil[i][0] for i in range(n)]):\n print('Yes')\n exit()\nc=[(ail[i][0],bil[i][0]) for i in range(n)]\nc=sorted(c)\nidx=0\nfor _ in range(n-2):\n idx=c[idx][1]\n if idx==0:\n print('Yes')\n break\nelse:\n print('No')", "code2": "n=int(input())\nal=list(map(int,input().split()))\nbl=list(map(int,input().split()))\nail=[(i,a) for i,a in enumerate(al)]\nbil=[(i,b) for i,b in enumerate(bl)]\nail=sorted(ail,key=lambda x:x[1])\nbil=sorted(bil,key=lambda x:x[1])\nif not all([ail[i][1]<=bil[i][1] for i in range(n)]):\n print('No')\n exit()\nif any([ail[i+1][1]<=bil[i][1] for i in range(n-1)]):\n print('Yes')\n exit()\nc=[(ail[i][0],bil[i][0]) for i in range(n)]\nc=sorted(c)\nidx=0\nfor _ in range(n-1):\n idx=c[idx][1]\n if idx==0:\n print('Yes')\n break\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573533023", "date2": "1573533371", "bleu_score": "0.9712792109815737", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 92, "total_score": 103, "input": "3\n1 3 1\n3 2 4\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["n=int(input()) # (0): n=3\nal=list(map(int,input().split())) # (1): al=[1, 3, 1]\nbl=list(map(int,input().split())) # (2): bl=[3, 2, 4]\nail=[(i,a) for i,a in enumerate(al)] # (3): ail=[(0, 1), (1, 3), (2, 1)]\nbil=[(i,b) for i,b in enumerate(bl)] # (4): bil=[(0, 3), (1, 2), (2, 4)]\nail=sorted(ail,key=lambda x:x[1]) # (5): ail=[(0, 1), (2, 1), (1, 3)]\nbil=sorted(bil,key=lambda x:x[1]) # (6): bil=[(1, 2), (0, 3), (2, 4)]\nif not all([ail[i][1]<=bil[i][1] for i in range(n)]): # (7): NO CHANGE\n print('No')\n exit()\nif any([ail[i][0]==bil[i][0] for i in range(n)]): # (8): NO CHANGE\n print('Yes')\n exit()\nc=[(ail[i][0],bil[i][0]) for i in range(n)] # (9): c=[(0, 1), (2, 0), (1, 2)]\nc=sorted(c) # (10): c=[(0, 1), (1, 2), (2, 0)]\nidx=0 # (11): idx=0\nfor _ in range(n-2): # (12): _=0 (15): NO CHANGE\n idx=c[idx][1] # (13): idx=1\n if idx==0: # (14): NO CHANGE\n print('Yes')\n break\nelse:\n print('No')"], "anno_status": [true], "diff_content": " n=int(input())\n al=list(map(int,input().split()))\n bl=list(map(int,input().split()))\n ail=[(i,a) for i,a in enumerate(al)]\n bil=[(i,b) for i,b in enumerate(bl)]\n ail=sorted(ail,key=lambda x:x[1])\n bil=sorted(bil,key=lambda x:x[1])\n if not all([ail[i][1]<=bil[i][1] for i in range(n)]):\n print('No')\n exit()\n-if any([ail[i][0]==bil[i][0] for i in range(n)]):\n+if any([ail[i+1][1]<=bil[i][1] for i in range(n-1)]):\n print('Yes')\n exit()\n c=[(ail[i][0],bil[i][0]) for i in range(n)]\n c=sorted(c)\n idx=0\n-for _ in range(n-2):\n+for _ in range(n-1):\n idx=c[idx][1]\n if idx==0:\n print('Yes')\n break\n else:\n print('No')\n", "FL_content": "\n n=int(input())\n al=list(map(int,input().split()))\n bl=list(map(int,input().split()))\n ail=[(i,a) for i,a in enumerate(al)]\n bil=[(i,b) for i,b in enumerate(bl)]\n ail=sorted(ail,key=lambda x:x[1])\n bil=sorted(bil,key=lambda x:x[1])\n if not all([ail[i][1]<=bil[i][1] for i in range(n)]):\n print('No')\n exit()\n if any([ail[i][0]==bil[i][0] for i in range(n)]):\n print('Yes')\n exit()\n c=[(ail[i][0],bil[i][0]) for i in range(n)]\n c=sorted(c)\n idx=0\n for _ in range(n-2):\n idx=c[idx][1]\n if idx==0:\n print('Yes')\n break\n else:\n print('No')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 23 }, { "user_id": "u122598824", "problem_id": "p03448", "submission1_id": "s634158389-FL", "submission2_id": "s362639645", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A=int(input())\nB=int(input())\nC=int(input())\nX=int(input())\ncount=0\nfor i in range(A+1):\n for j in range(B+1):\n for k in range(C+1):\n if ((500*i)+(100*j)+(50*k))==0:\n count+=1\n\nprint(count)", "code2": "A=int(input())\nB=int(input())\nC=int(input())\nX=int(input())\ncount=0\nfor i in range(A+1):\n for j in range(B+1):\n for k in range(C+1):\n if ((500*i)+(100*j)+(50*k))==X:\n count+=1\n\nprint(count)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587319399", "date2": "1587319459", "bleu_score": "0.9887760724645923", "code1_test_status": [0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0], "code1_test_score": 54, "total_score": 103, "input": "30\n73\n134\n6415\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " A=int(input())\n B=int(input())\n C=int(input())\n X=int(input())\n count=0\n for i in range(A+1):\n for j in range(B+1):\n for k in range(C+1):\n- if ((500*i)+(100*j)+(50*k))==0:\n+ if ((500*i)+(100*j)+(50*k))==X:\n count+=1\n \n print(count)\n", "FL_content": "\n A=int(input())\n B=int(input())\n C=int(input())\n X=int(input())\n count=0\n for i in range(A+1):\n for j in range(B+1):\n for k in range(C+1):\n- if ((500*i)+(100*j)+(50*k))==0:\n- count+=1\n-\n print(count)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u699522269", "problem_id": "p03545", "submission1_id": "s034658032-FL", "submission2_id": "s800432583", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A,B,C,D = map(int,input())\nrt = str(A)\nfor bt in (True, False):\n tmp=7-A\n for ct in (True, False):\n for dt in (True, False):\n tmp = tmp-B if bt else tmp+B\n tmp = tmp-C if ct else tmp+C\n tmp = tmp-D if dt else tmp+D\n if tmp == 0:\n rt+=\"+\" if bt else \"-\"\n rt+=str(B)\n rt+=\"+\" if ct else \"-\"\n rt+=str(C)\n rt+=\"+\" if dt else \"-\"\n rt+=str(D)\n rt+=\"=7\"\n\nprint(rt)", "code2": "A,B,C,D = map(int,input())\ntfs = []\nrt = str(A)\nfor bt in (True, False):\n for ct in (True, False):\n for dt in (True, False):\n tfs.append([bt,ct,dt])\nfor bt,ct,dt in tfs:\n tmp=7-A\n tmp = tmp-B if bt else tmp+B\n tmp = tmp-C if ct else tmp+C\n tmp = tmp-D if dt else tmp+D\n if tmp == 0:\n rt+=\"+\" if bt else \"-\"\n rt+=str(B)\n rt+=\"+\" if ct else \"-\"\n rt+=str(C)\n rt+=\"+\" if dt else \"-\"\n rt+=str(D)\n rt+=\"=7\"\n break\n\nprint(rt)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599423470", "date2": "1599423853", "bleu_score": "0.8623530207537938", "code1_test_status": [0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 30, "total_score": 99, "input": "1802\n", "actual_output": "1\n", "expected_output": "1+8+0-2=7\n\n", "anno_code": ["A,B,C,D = map(int,input()) # (0): A=1, B=8, C=0, D=2\nrt = str(A) # (1): rt=1\nfor bt in (True, False): # (2): bt=True (29): bt=False (56): NO CHANGE\n tmp=7-A # (3): tmp=6 (30): tmp=6\n for ct in (True, False): # (4): ct=True (16): ct=False ... (55): NO CHANGE\n for dt in (True, False): # (5): dt=True (10): dt=False ... (54): NO CHANGE\n tmp = tmp-B if bt else tmp+B # (6): tmp=-2 (11): tmp=-12 ... (50): tmp=36\n tmp = tmp-C if ct else tmp+C # (7): NO CHANGE (12): NO CHANGE ... (51): NO CHANGE\n tmp = tmp-D if dt else tmp+D # (8): tmp=-4 (13): tmp=-10 ... (52): tmp=38\n if tmp == 0: # (9): NO CHANGE (14): NO CHANGE ... (53): NO CHANGE\n rt+=\"+\" if bt else \"-\"\n rt+=str(B)\n rt+=\"+\" if ct else \"-\"\n rt+=str(C)\n rt+=\"+\" if dt else \"-\"\n rt+=str(D)\n rt+=\"=7\"\n\nprint(rt)"], "anno_status": [true], "diff_content": " A,B,C,D = map(int,input())\n+tfs = []\n rt = str(A)\n for bt in (True, False):\n- tmp=7-A\n for ct in (True, False):\n for dt in (True, False):\n- tmp = tmp-B if bt else tmp+B\n- tmp = tmp-C if ct else tmp+C\n- tmp = tmp-D if dt else tmp+D\n- if tmp == 0:\n- rt+=\"+\" if bt else \"-\"\n- rt+=str(B)\n- rt+=\"+\" if ct else \"-\"\n- rt+=str(C)\n- rt+=\"+\" if dt else \"-\"\n- rt+=str(D)\n- rt+=\"=7\"\n+ tfs.append([bt,ct,dt])\n+for bt,ct,dt in tfs:\n+ tmp=7-A\n+ tmp = tmp-B if bt else tmp+B\n+ tmp = tmp-C if ct else tmp+C\n+ tmp = tmp-D if dt else tmp+D\n+ if tmp == 0:\n+ rt+=\"+\" if bt else \"-\"\n+ rt+=str(B)\n+ rt+=\"+\" if ct else \"-\"\n+ rt+=str(C)\n+ rt+=\"+\" if dt else \"-\"\n+ rt+=str(D)\n+ rt+=\"=7\"\n+ break\n \n print(rt)\n", "FL_content": "\n A,B,C,D = map(int,input())\n rt = str(A)\n for bt in (True, False):\n tmp=7-A\n for ct in (True, False):\n for dt in (True, False):\n tmp = tmp-B if bt else tmp+B\n tmp = tmp-C if ct else tmp+C\n tmp = tmp-D if dt else tmp+D\n if tmp == 0:\n rt+=\"+\" if bt else \"-\"\n- rt+=str(B)\n- rt+=\"+\" if ct else \"-\"\n- rt+=str(C)\n- rt+=\"+\" if dt else \"-\"\n- rt+=str(D)\n rt+=\"=7\"\n \n print(rt)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u627600101", "problem_id": "p02537", "submission1_id": "s029332411-FL", "submission2_id": "s023286113", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\n\n\n\n\ndef segfunc(x, y):\n return max(x, y)\n\n \n\nide_ele = -1\n\n \nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\n\n\n\nN, K = map(int, input().split())\ntree = [0 for _ in range(400000)]\ntree = SegTree(tree, segfunc, ide_ele)\nfor k in range(N):\n A = int(input())\n A -= 1\n n = tree.query(max(0, A-K), min(400000, A+K+1))\n tree.update(A, n+1)\nprint(tree.query(0, 400000))\n\n\n\n\n\n\n", "code2": "\n\n\n\n\n\n\n\n\ndef segfunc(x, y):\n return max(x, y)\n\n \n\nide_ele = -1\n\n \nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\n\n\n\nN, K = map(int, input().split())\ntree = [0 for _ in range(400000)]\ntree = SegTree(tree, segfunc, ide_ele)\nfor k in range(N):\n A = int(input())\n n = tree.query(max(0, A-K), min(400000, A+K+1))\n tree.update(A, n+1)\nprint(tree.query(0, 400000))\n\n\n\n\n\n\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601171508", "date2": "1601171868", "bleu_score": "0.9934853651353326", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 81, "total_score": 101, "input": "10 3\n1\n5\n2\n0\n1\n6\n9\n8\n4\n2\n", "actual_output": "5\n", "expected_output": "6\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n \n \n \n \n \n \n \n \n def segfunc(x, y):\n return max(x, y)\n \n \n \n ide_ele = -1\n \n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n \n \n \n N, K = map(int, input().split())\n tree = [0 for _ in range(400000)]\n tree = SegTree(tree, segfunc, ide_ele)\n for k in range(N):\n A = int(input())\n- A -= 1\n n = tree.query(max(0, A-K), min(400000, A+K+1))\n tree.update(A, n+1)\n print(tree.query(0, 400000))\n \n \n \n \n \n \n \n", "FL_content": "\n \n \n \n \n \n \n \n \n \n def segfunc(x, y):\n return max(x, y)\n \n \n \n ide_ele = -1\n \n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n \n \n \n N, K = map(int, input().split())\n-tree = [0 for _ in range(400000)]\n tree = SegTree(tree, segfunc, ide_ele)\n for k in range(N):\n A = int(input())\n A -= 1\n- n = tree.query(max(0, A-K), min(400000, A+K+1))\n tree.update(A, n+1)\n print(tree.query(0, 400000))\n \n \n \n \n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 76 }, { "user_id": "u392319141", "problem_id": "p03880", "submission1_id": "s179613245-FL", "submission2_id": "s714782629", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = [int(input()) for _ in range(N)]\n\nA.sort(reverse=True, key=lambda a: (a & -a))\n\nxor = 0\nfor a in A:\n xor ^= a\n\nleft = 0\nans = 0\n\nfor digit in range(1, xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n while left < N and (A[left] & -A[left]).bit_length() > digit:\n left += 1\n\n if left >= N:\n print(-1)\n exit()\n\n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n\nif xor:\n for a in A:\n if a % 2 == 1:\n ans += 1\n break\n else:\n print(-1)\n exit()\n\nprint(ans)", "code2": "N = int(input())\nA = [int(input()) for _ in range(N)]\n\nA.sort(reverse=True, key=lambda a: (a & -a))\n\nxor = 0\nfor a in A:\n xor ^= a\n\nleft = 0\nans = 0\n\nfor digit in range(xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n while left < N and ((A[left] & -A[left]).bit_length() - 1) > digit:\n left += 1\n\n if left >= N or ((A[left] & -A[left]).bit_length() - 1) != digit:\n print(-1)\n exit()\n\n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1570894733", "date2": "1570896477", "bleu_score": "0.7788048700666129", "code1_test_status": [0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1], "code1_test_score": 39, "total_score": 89, "input": "3\n111\n100\n111\n", "actual_output": "4\n", "expected_output": "-1\n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = [int(input()) for _ in range(N)] # (1): A=[111, 100, 111]\n\nA.sort(reverse=True, key=lambda a: (a & -a)) # (2): A=[100, 111, 111]\n\nxor = 0 # (3): xor=0\nfor a in A: # (4): a=100 (6): a=111 ... (10): NO CHANGE\n xor ^= a # (5): xor=100 (7): xor=11 (9): xor=100\n\nleft = 0 # (11): left=0\nans = 0 # (12): ans=0\n\nfor digit in range(1, xor.bit_length() + 1)[:: -1]: # (13): digit=7 (15): digit=6 ... (45): NO CHANGE\n if (xor & (1 << digit)) > 0: # (14): NO CHANGE (16): NO CHANGE ... (40): NO CHANGE\n while left < N and (A[left] & -A[left]).bit_length() > digit: # (17): NO CHANGE (25): NO CHANGE ... (41): NO CHANGE\n left += 1 # (34): left=1\n\n if left >= N: # (18): NO CHANGE (26): NO CHANGE ... (42): NO CHANGE\n print(-1)\n exit()\n\n ans += 1 # (19): ans=1 (27): ans=2 ... (43): ans=4\n xor ^= ((1 << (digit + 1)) - 1) # (20): xor=27 (28): xor=4 ... (44): xor=0\n\nif xor: # (46): NO CHANGE\n for a in A:\n if a % 2 == 1:\n ans += 1\n break\n else:\n print(-1)\n exit()\n\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n A = [int(input()) for _ in range(N)]\n \n A.sort(reverse=True, key=lambda a: (a & -a))\n \n xor = 0\n for a in A:\n xor ^= a\n \n left = 0\n ans = 0\n \n-for digit in range(1, xor.bit_length() + 1)[:: -1]:\n+for digit in range(xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n- while left < N and (A[left] & -A[left]).bit_length() > digit:\n+ while left < N and ((A[left] & -A[left]).bit_length() - 1) > digit:\n left += 1\n \n- if left >= N:\n+ if left >= N or ((A[left] & -A[left]).bit_length() - 1) != digit:\n print(-1)\n exit()\n \n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n \n-if xor:\n- for a in A:\n- if a % 2 == 1:\n- ans += 1\n- break\n- else:\n- print(-1)\n- exit()\n-\n print(ans)\n", "FL_content": "\n N = int(input())\n A = [int(input()) for _ in range(N)]\n \n A.sort(reverse=True, key=lambda a: (a & -a))\n \n xor = 0\n for a in A:\n xor ^= a\n \n left = 0\n ans = 0\n \n for digit in range(1, xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n while left < N and (A[left] & -A[left]).bit_length() > digit:\n left += 1\n \n if left >= N:\n print(-1)\n exit()\n \n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n \n if xor:\n for a in A:\n if a % 2 == 1:\n ans += 1\n break\n else:\n print(-1)\n exit()\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 34 }, { "user_id": "u591717585", "problem_id": "p02830", "submission1_id": "s298340446-FL", "submission2_id": "s739956201", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = input()\nb = input()\nres = ''\nfor i in range(len(a)):\n res += a[i]\n res += b[i]\nprint(res)\n", "code2": "n = int(input())\na, b = input().split(' ')\nres = ''\nfor i in range(n):\n res += a[i]\n res += b[i]\nprint(res)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577066554", "date2": "1577066719", "bleu_score": "0.7844459427272394", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "5\nbabaa babaa\n", "actual_output": "5b\n", "expected_output": "bbaabbaaaa\n\n", "anno_code": ["a = input() # (0): a=5\nb = input() # (1): b=babaa babaa\nres = '' # (2): res=\nfor i in range(len(a)): # (3): i=0 (6): NO CHANGE\n res += a[i] # (4): res=5\n res += b[i] # (5): res=5b\nprint(res)\n"], "anno_status": [true], "diff_content": "-a = input()\n-b = input()\n+n = int(input())\n+a, b = input().split(' ')\n res = ''\n-for i in range(len(a)):\n+for i in range(n):\n res += a[i]\n res += b[i]\n print(res)\n \n", "FL_content": "\n a = input()\n b = input()\n res = ''\n for i in range(len(a)):\n res += a[i]\n res += b[i]\n-print(res)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u390618988", "problem_id": "p02975", "submission1_id": "s268735541-FL", "submission2_id": "s507347414", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from sys import stdin, exit\n\nN = int(stdin.readline().rstrip())\na = [int(x) for x in stdin.readline().rstrip().split()]\n\nnum = []\nfor k in a:\n if k not in num:\n num.append(k)\n if len(num) > 3:\n print('No')\n exit()\nif len(num) == 1 and num[0] == 0:\n print('Yes')\n exit()\nif len(num) == 2 and num[0] ^ num[1] == num[0] and N % 2 == 0:\n print('Yes')\n exit()\nif len(num) <= 2:\n print('No')\n exit()\nif num[0] ^ num[1] != num[2] and num[2] ^ num[1] != num[0] and num[0] ^ num[2] != num[1] and N % 3 == 0:\n print('No')\nelse:\n print('Yes')\n", "code2": "from sys import stdin, exit\n\nN = int(stdin.readline().rstrip())\na = [int(x) for x in stdin.readline().rstrip().split()]\n\nnum = []\ncount = []\nfor k in a:\n if k not in num:\n num.append(k)\n count.append(1)\n else:\n count[num.index(k)] += 1\n if len(num) > 3:\n print('No')\n exit()\nif len(num) == 1 and num[0] == 0:\n print('Yes')\n exit()\nif len(num) == 2 and num[0] ^ num[1] == num[1] and N % 3 == 0 and count[1] == 2 * count[0]:\n print('Yes')\n exit()\nif len(num) == 2 and num[0] ^ num[1] == num[0] and N % 3 == 0 and count[0] == 2 * count[1]:\n print('Yes')\n exit()\nif len(num) <= 2:\n print('No')\n exit()\nif num[0] ^ num[1] ^ num[2] == 0 and N % 3 == 0 and count[0] == count[1] == count[2] == int(N / 3):\n print('Yes')\nelse:\n print('No')\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1563156513", "date2": "1563164939", "bleu_score": "0.6929282058716065", "code1_test_status": [1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0], "code1_test_score": 36, "total_score": 58, "input": "4\n0 7 1 0\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["from sys import stdin, exit\n\nN = int(stdin.readline().rstrip()) # (0): N=4\na = [int(x) for x in stdin.readline().rstrip().split()] # (1): a=[0, 7, 1, 0]\n\nnum = [] # (2): num=[]\nfor k in a: # (3): k=0 (7): k=7 ... (18): NO CHANGE\n if k not in num: # (4): NO CHANGE (8): NO CHANGE ... (16): NO CHANGE\n num.append(k) # (5): num=[0] (9): num=[0, 7] (13): num=[0, 7, 1]\n if len(num) > 3: # (6): NO CHANGE (10): NO CHANGE ... (17): NO CHANGE\n print('No')\n exit()\nif len(num) == 1 and num[0] == 0: # (19): NO CHANGE\n print('Yes')\n exit()\nif len(num) == 2 and num[0] ^ num[1] == num[0] and N % 2 == 0: # (20): NO CHANGE\n print('Yes')\n exit()\nif len(num) <= 2: # (21): NO CHANGE\n print('No')\n exit()\nif num[0] ^ num[1] != num[2] and num[2] ^ num[1] != num[0] and num[0] ^ num[2] != num[1] and N % 3 == 0: # (22): NO CHANGE\n print('No')\nelse:\n print('Yes')\n"], "anno_status": [true], "diff_content": " from sys import stdin, exit\n \n N = int(stdin.readline().rstrip())\n a = [int(x) for x in stdin.readline().rstrip().split()]\n \n num = []\n+count = []\n for k in a:\n if k not in num:\n num.append(k)\n+ count.append(1)\n+ else:\n+ count[num.index(k)] += 1\n if len(num) > 3:\n print('No')\n exit()\n if len(num) == 1 and num[0] == 0:\n print('Yes')\n exit()\n-if len(num) == 2 and num[0] ^ num[1] == num[0] and N % 2 == 0:\n+if len(num) == 2 and num[0] ^ num[1] == num[1] and N % 3 == 0 and count[1] == 2 * count[0]:\n+ print('Yes')\n+ exit()\n+if len(num) == 2 and num[0] ^ num[1] == num[0] and N % 3 == 0 and count[0] == 2 * count[1]:\n print('Yes')\n exit()\n if len(num) <= 2:\n print('No')\n exit()\n-if num[0] ^ num[1] != num[2] and num[2] ^ num[1] != num[0] and num[0] ^ num[2] != num[1] and N % 3 == 0:\n- print('No')\n-else:\n+if num[0] ^ num[1] ^ num[2] == 0 and N % 3 == 0 and count[0] == count[1] == count[2] == int(N / 3):\n print('Yes')\n+else:\n+ print('No')\n \n", "FL_content": "\n from sys import stdin, exit\n \n N = int(stdin.readline().rstrip())\n a = [int(x) for x in stdin.readline().rstrip().split()]\n \n num = []\n for k in a:\n if k not in num:\n num.append(k)\n if len(num) > 3:\n print('No')\n exit()\n if len(num) == 1 and num[0] == 0:\n print('Yes')\n exit()\n if len(num) == 2 and num[0] ^ num[1] == num[0] and N % 2 == 0:\n print('Yes')\n exit()\n if len(num) <= 2:\n print('No')\n exit()\n-if num[0] ^ num[1] != num[2] and num[2] ^ num[1] != num[0] and num[0] ^ num[2] != num[1] and N % 3 == 0:\n print('No')\n else:\n print('Yes')\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 26 }, { "user_id": "u695811449", "problem_id": "p03297", "submission1_id": "s836011374-FL", "submission2_id": "s116989003", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def gcd(a, b):\n\twhile b:\n\t\ta, b = b, a % b\n\treturn a\n\nT=int(input())\nJuice=[None]*T\nfor i in range(T):\n Juice[i]=list(map(int,input().split()))\n\n\n\n\n\ndef juicecheck(i):\n A=Juice[i][0]\n B=Juice[i][1]\n C=Juice[i][2]\n D=Juice[i][3]\n\n if AD:\n print(\"No\")\n return\n elif BB%z and ((C+1)%z<=x%z or x%zD:\n print(\"No\")\n return\n elif B-1<=C:\n print(\"Yes\")\n return\n else:\n x=A%B\n y=D%B\n \n\n z=gcd(B,D)\n\n if z==1 or B-(C+1)>=z or (C+1)%z<=x%z<=(B-1)%z or ( (C+1)%z>B%z and ((C+1)%z<=x%z or x%z\n\twhile b: # (44): NO CHANGE (46): NO CHANGE ... (243): i=13, A=1000000000000000001, B=16, C=15, D=2424336645253281229, x=1, z=1\n\t\ta, b = b, a % b # (45): a=9, b=7 (47): a=7, b=2 ... (242): a=1, b=0\n\treturn a\n\nT=int(input()) # (1): T=14\nJuice=[None]*T # (2): Juice=[None, None, None, None, None, None, None, None, None, None, None, None, None, None]\nfor i in range(T): # (3): i=0 (5): Juice, i=1 ... (31): NO CHANGE\n Juice[i]=list(map(int,input().split())) # (4): Juice (6): Juice ... (30): Juice\n\n\n\n\n\ndef juicecheck(i): # (32): juicecheck=\n A=Juice[i][0] # (35): A=7 (58): A=8 ... (224): A=1000000000000000001\n B=Juice[i][1] # (36): B=7 (59): B=7 ... (225): B=16\n C=Juice[i][2] # (37): C=5 (60): C=1 ... (226): C=15\n D=Juice[i][3] # (38): D=9 (61): D=9 ... (227): D=2424336645253281229\n\n if A, T=14, Juice, juicecheck= (166): gcd=, T=14, Juice, juicecheck= ... (202): gcd=, T=14, Juice, juicecheck=\n elif B>D: # (40): NO CHANGE (63): NO CHANGE ... (229): NO CHANGE\n print(\"No\")\n return\n elif B, T=14, Juice, juicecheck=\n else:\n x=A%B # (42): x=0 (65): x=1 ... (231): x=1\n \n\n z=gcd(B,D) # (43): a=7, b=9 (66): a=7, b=9 ... (232): a=16, b=2424336645253281229\n\n if ((C+1)!=B) and (z==1 or (C+1)%z==B%z==x%z or (C+1)%z<=x%zB%z and ((C+1)%z<=x%z or x%z, T=14, Juice, juicecheck= (78): gcd=, T=14, Juice, juicecheck= ... (221): gcd=, T=14, Juice, juicecheck=\n\n print(\"Yes\") # (98): NO CHANGE (147): NO CHANGE (245): NO CHANGE\n return # (99): gcd=, T=14, Juice, juicecheck= (148): gcd=, T=14, Juice, juicecheck= (246): gcd=, T=14, Juice, juicecheck=\n \n \n\nfor i in range(T): # (33): i=0 (56): i=1 ... (222): i=13\n juicecheck(i) # (34): NO CHANGE (57): NO CHANGE ... (223): NO CHANGE\n"], "anno_status": [false], "diff_content": " def gcd(a, b):\n \twhile b:\n \t\ta, b = b, a % b\n \treturn a\n \n T=int(input())\n Juice=[None]*T\n for i in range(T):\n Juice[i]=list(map(int,input().split()))\n \n \n \n \n \n def juicecheck(i):\n A=Juice[i][0]\n B=Juice[i][1]\n C=Juice[i][2]\n D=Juice[i][3]\n \n if AD:\n print(\"No\")\n return\n- elif BB%z and ((C+1)%z<=x%z or x%z=z or (C+1)%z<=x%z<=(B-1)%z or ( (C+1)%z>B%z and ((C+1)%z<=x%z or x%zD:\n print(\"No\")\n return\n elif BB%z and ((C+1)%z<=x%z or x%z\n\n\ndef main(): # (1): main=\n a = int(input())\n s = input().strip()\n print(\"red\" if a < 3200 else a)\n\n\nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " import sys\n \n input = sys.stdin.readline\n \n \n def main():\n a = int(input())\n s = input().strip()\n- print(\"red\" if a < 3200 else a)\n+ print(\"red\" if a < 3200 else s)\n \n \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": "\n import sys\n \n input = sys.stdin.readline\n \n \n def main():\n a = int(input())\n s = input().strip()\n- print(\"red\" if a < 3200 else a)\n \n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u113107956", "problem_id": "p03456", "submission1_id": "s417688853-FL", "submission2_id": "s872728320", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\na,b=input().split()\nc=a+b\nd=math.sqrt(float(c))\n\nif d*d==int(c):\n print('Yes')\nelse:\n print('No')", "code2": "import math\na,b=input().split()\nc=a+b\nd=math.floor(math.sqrt(float(c)))\n\nif int(d*d)==int(c):\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593118357", "date2": "1593122627", "bleu_score": "0.8443807866295573", "code1_test_status": [1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1], "code1_test_score": 51, "total_score": 91, "input": "101 010\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["import math\na,b=input().split() # (0): a=101, b=010\nc=a+b # (1): c=101010\nd=math.sqrt(float(c)) # (2): d=317.820704\n\nif d*d==int(c): # (3): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " import math\n a,b=input().split()\n c=a+b\n-d=math.sqrt(float(c))\n+d=math.floor(math.sqrt(float(c)))\n \n-if d*d==int(c):\n+if int(d*d)==int(c):\n print('Yes')\n else:\n print('No')\n", "FL_content": "\n import math\n a,b=input().split()\n c=a+b\n-d=math.sqrt(float(c))\n \n if d*d==int(c):\n print('Yes')\n else:\n print('No')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u691018832", "problem_id": "p03437", "submission1_id": "s246952041-FL", "submission2_id": "s273373395", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nx, y = map(int, input().split())\nif y%x == 0:\n ans = -1\nelse:\n ans = x\nprint(ans)", "code2": "import sys\ninput = sys.stdin.readline\n\nx, y = map(int, input().split())\nif x%y == 0:\n ans = -1\nelse:\n ans = x\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559836946", "date2": "1559837372", "bleu_score": "0.9695503019761654", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 24, "total_score": 25, "input": "-6 12\n", "actual_output": "-1\n", "expected_output": "-6\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\nx, y = map(int, input().split()) # (1): x=-6, y=12\nif y%x == 0: # (2): NO CHANGE\n ans = -1 # (3): ans=-1\nelse:\n ans = x\nprint(ans)"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n \n x, y = map(int, input().split())\n-if y%x == 0:\n+if x%y == 0:\n ans = -1\n else:\n ans = x\n print(ans)\n", "FL_content": "\n import sys\n input = sys.stdin.readline\n \n x, y = map(int, input().split())\n-if y%x == 0:\n ans = -1\n else:\n ans = x\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u565380863", "problem_id": "p03139", "submission1_id": "s118404601-FL", "submission2_id": "s352251100", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import bisect\nimport sys\n\nsys.setrecursionlimit(200000)\n\n\ndef input():\n return sys.stdin.readline()[:-1]\n\n\ndef ii(t: type = int):\n return t(input())\n\n\ndef il(t: type = int):\n return list(map(t, input().split()))\n\n\ndef imi(N: int, t: type = int):\n return [ii(t) for _ in range(N)]\n\n\ndef iml(N: int, t: type = int):\n return [il(t) for _ in range(N)]\n\n\ndef solve():\n N, a, b = il()\n return \"{} {}\".format(min(a, b), b if a == b else max(0, a - b))\n\n\nif __name__ == \"__main__\":\n print(solve())\n", "code2": "import bisect\nimport sys\n\nsys.setrecursionlimit(200000)\n\n\ndef input():\n return sys.stdin.readline()[:-1]\n\n\ndef ii(t: type = int):\n return t(input())\n\n\ndef il(t: type = int):\n return list(map(t, input().split()))\n\n\ndef imi(N: int, t: type = int):\n return [ii(t) for _ in range(N)]\n\n\ndef iml(N: int, t: type = int):\n return [il(t) for _ in range(N)]\n\n\ndef solve():\n N, a, b = il()\n return \"{} {}\".format(min(a, b), max(0, a - (N - b)))\n\n\nif __name__ == \"__main__\":\n print(solve())\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1548641117", "date2": "1548641247", "bleu_score": "0.9656735008535292", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 8, "total_score": 81, "input": "1 5 0\n", "actual_output": "0 5\n", "expected_output": "0 4\n\n", "anno_code": ["import bisect\nimport sys\n\nsys.setrecursionlimit(200000) # (0): NO CHANGE\n\n\ndef input(): # (1): input=\n return sys.stdin.readline()[:-1]\n\n\ndef ii(t: type = int): # (2): ii=\n return t(input())\n\n\ndef il(t: type = int): # (3): il=\n return list(map(t, input().split()))\n\n\ndef imi(N: int, t: type = int): # (4): imi=\n return [ii(t) for _ in range(N)]\n\n\ndef iml(N: int, t: type = int): # (5): iml=\n return [il(t) for _ in range(N)]\n\n\ndef solve(): # (6): solve=\n N, a, b = il()\n return \"{} {}\".format(min(a, b), b if a == b else max(0, a - b))\n\n\nif __name__ == \"__main__\":\n print(solve())\n"], "anno_status": [true], "diff_content": " import bisect\n import sys\n \n sys.setrecursionlimit(200000)\n \n \n def input():\n return sys.stdin.readline()[:-1]\n \n \n def ii(t: type = int):\n return t(input())\n \n \n def il(t: type = int):\n return list(map(t, input().split()))\n \n \n def imi(N: int, t: type = int):\n return [ii(t) for _ in range(N)]\n \n \n def iml(N: int, t: type = int):\n return [il(t) for _ in range(N)]\n \n \n def solve():\n N, a, b = il()\n- return \"{} {}\".format(min(a, b), b if a == b else max(0, a - b))\n+ return \"{} {}\".format(min(a, b), max(0, a - (N - b)))\n \n \n if __name__ == \"__main__\":\n print(solve())\n \n", "FL_content": "\n import bisect\n import sys\n \n sys.setrecursionlimit(200000)\n \n \n def input():\n return sys.stdin.readline()[:-1]\n \n \n def ii(t: type = int):\n return t(input())\n \n \n def il(t: type = int):\n return list(map(t, input().split()))\n \n \n def imi(N: int, t: type = int):\n return [ii(t) for _ in range(N)]\n \n \n def iml(N: int, t: type = int):\n return [il(t) for _ in range(N)]\n \n \n def solve():\n N, a, b = il()\n- return \"{} {}\".format(min(a, b), b if a == b else max(0, a - b))\n \n \n if __name__ == \"__main__\":\n print(solve())\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 34 }, { "user_id": "u474423089", "problem_id": "p02616", "submission1_id": "s867611646-FL", "submission2_id": "s418073431", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int, input().split(' '))\nA = sorted(list(map(int, input().split(' '))))\nmod = 10 ** 9 + 7\np = 0\nfor i in range(N):\n if A[i] >= 0:\n break\np = i\nif (p==N-1 and K%2 != 0) or (N==K and p%2 == 0):\n ans = 1\n for i in range(K):\n ans *= A[-1-i]\n ans %= mod\n print(ans)\n exit()\nminus = A[:p]\nplus = A[p:]\nlen_m = len(minus)\nlen_p = len(plus)\nm = 0\np = 0\nans = 1\nwhile K > 0:\n if K >= 2 and m <= len_m - 2 and p <= len_p - 2:\n if minus[m] * minus[m] >= plus[p] * plus[p + 1]:\n ans *= minus[m] * minus[m+1]\n ans %= mod\n m += 2\n else:\n ans *= plus[p] * plus[p + 1]\n ans %= mod\n p += 2\n K -= 2\n elif K >= 2 and m <= len_m-2:\n ans *= minus[m] * minus[m+1]\n ans %= mod\n m += 2\n K -= 2\n elif K >= 2 and p <= len_p-2:\n ans *= plus[p] * plus[p + 1]\n ans %= mod\n p += 2\n K -= 2\n elif p <= len_p -1:\n ans *= plus[p]\n ans %= mod\n p += 1\n K -= 1\n else:\n ans *= minus[m]\n ans %= mod\n m += 1\n K -= 1\nprint(ans)", "code2": "N, K = map(int, input().split(' '))\nA = sorted(list(map(int, input().split(' '))))\nmod = 10 ** 9 + 7\np = 0\nfor i in range(N):\n if A[i] >= 0:\n break\np = i\nif (p == N - 1 and K % 2 != 0):\n ans = 1\n for i in range(K):\n ans *= A[-1 - i]\n ans %= mod\n print(ans%mod)\n exit()\nminus = A[:p]\nplus = sorted(A[p:],reverse=True)\nlen_m = len(minus)\nlen_p = len(plus)\nm = 0\np = 0\nans = 1\nwhile K > 0:\n if K >= 2 and m <= len_m - 2 and p <= len_p - 2:\n if minus[m] * minus[m+1] >= plus[p] * plus[p + 1]:\n ans *= minus[m] * minus[m + 1]\n ans %= mod\n m += 2\n else:\n ans *= plus[p] * plus[p + 1]\n ans %= mod\n p += 2\n K -= 2\n elif K >= 2 and m <= len_m - 2:\n ans *= minus[m] * minus[m + 1]\n ans %= mod\n m += 2\n K -= 2\n elif K >= 2 and p <= len_p - 2:\n ans *= plus[p] * plus[p + 1]\n ans %= mod\n p += 2\n K -= 2\n elif p <= len_p - 1:\n ans *= plus[p]\n ans %= mod\n p += 1\n K -= 1\n else:\n ans *= minus[m]\n ans %= mod\n m += 1\n K -= 1\nprint(ans%mod)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593980534", "date2": "1593981667", "bleu_score": "0.9419864526179231", "code1_test_status": [0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1], "code1_test_score": 42, "total_score": 104, "input": "4 2\n1 2 -3 0\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["N, K = map(int, input().split(' ')) # (0): N=4, K=2\nA = sorted(list(map(int, input().split(' ')))) # (1): A=[-3, 0, 1, 2]\nmod = 10 ** 9 + 7 # (2): mod=1000000007\np = 0 # (3): p=0\nfor i in range(N): # (4): i=0 (6): i=1\n if A[i] >= 0: # (5): NO CHANGE (7): NO CHANGE\n break # (8): NO CHANGE\np = i # (9): p=1\nif (p==N-1 and K%2 != 0) or (N==K and p%2 == 0): # (10): NO CHANGE\n ans = 1\n for i in range(K):\n ans *= A[-1-i]\n ans %= mod\n print(ans)\n exit()\nminus = A[:p] # (11): minus=[-3]\nplus = A[p:] # (12): plus=[0, 1, 2]\nlen_m = len(minus) # (13): len_m=1\nlen_p = len(plus) # (14): len_p=3\nm = 0 # (15): m=0\np = 0 # (16): p=0\nans = 1 # (17): ans=1\nwhile K > 0: # (18): NO CHANGE (26): NO CHANGE\n if K >= 2 and m <= len_m - 2 and p <= len_p - 2: # (19): NO CHANGE\n if minus[m] * minus[m] >= plus[p] * plus[p + 1]:\n ans *= minus[m] * minus[m+1]\n ans %= mod\n m += 2\n else:\n ans *= plus[p] * plus[p + 1]\n ans %= mod\n p += 2\n K -= 2\n elif K >= 2 and m <= len_m-2: # (20): NO CHANGE\n ans *= minus[m] * minus[m+1]\n ans %= mod\n m += 2\n K -= 2\n elif K >= 2 and p <= len_p-2: # (21): NO CHANGE\n ans *= plus[p] * plus[p + 1] # (22): ans=0\n ans %= mod # (23): NO CHANGE\n p += 2 # (24): p=2\n K -= 2 # (25): K=0\n elif p <= len_p -1:\n ans *= plus[p]\n ans %= mod\n p += 1\n K -= 1\n else:\n ans *= minus[m]\n ans %= mod\n m += 1\n K -= 1\nprint(ans)"], "anno_status": [false], "diff_content": " N, K = map(int, input().split(' '))\n A = sorted(list(map(int, input().split(' '))))\n mod = 10 ** 9 + 7\n p = 0\n for i in range(N):\n if A[i] >= 0:\n break\n p = i\n-if (p==N-1 and K%2 != 0) or (N==K and p%2 == 0):\n+if (p == N - 1 and K % 2 != 0):\n ans = 1\n for i in range(K):\n- ans *= A[-1-i]\n+ ans *= A[-1 - i]\n ans %= mod\n- print(ans)\n+ print(ans%mod)\n exit()\n minus = A[:p]\n-plus = A[p:]\n+plus = sorted(A[p:],reverse=True)\n len_m = len(minus)\n len_p = len(plus)\n m = 0\n p = 0\n ans = 1\n while K > 0:\n if K >= 2 and m <= len_m - 2 and p <= len_p - 2:\n- if minus[m] * minus[m] >= plus[p] * plus[p + 1]:\n- ans *= minus[m] * minus[m+1]\n+ if minus[m] * minus[m+1] >= plus[p] * plus[p + 1]:\n+ ans *= minus[m] * minus[m + 1]\n ans %= mod\n m += 2\n else:\n ans *= plus[p] * plus[p + 1]\n ans %= mod\n p += 2\n K -= 2\n- elif K >= 2 and m <= len_m-2:\n- ans *= minus[m] * minus[m+1]\n+ elif K >= 2 and m <= len_m - 2:\n+ ans *= minus[m] * minus[m + 1]\n ans %= mod\n m += 2\n K -= 2\n- elif K >= 2 and p <= len_p-2:\n+ elif K >= 2 and p <= len_p - 2:\n ans *= plus[p] * plus[p + 1]\n ans %= mod\n p += 2\n K -= 2\n- elif p <= len_p -1:\n+ elif p <= len_p - 1:\n ans *= plus[p]\n ans %= mod\n p += 1\n K -= 1\n else:\n ans *= minus[m]\n ans %= mod\n m += 1\n K -= 1\n-print(ans)\n+print(ans%mod)\n+\n", "FL_content": "\n N, K = map(int, input().split(' '))\n A = sorted(list(map(int, input().split(' '))))\n mod = 10 ** 9 + 7\n p = 0\n for i in range(N):\n if A[i] >= 0:\n break\n p = i\n-if (p==N-1 and K%2 != 0) or (N==K and p%2 == 0):\n- ans = 1\n- for i in range(K):\n- ans *= A[-1-i]\n- ans %= mod\n- print(ans)\n- exit()\n minus = A[:p]\n plus = A[p:]\n len_m = len(minus)\n len_p = len(plus)\n m = 0\n p = 0\n ans = 1\n while K > 0:\n if K >= 2 and m <= len_m - 2 and p <= len_p - 2:\n if minus[m] * minus[m] >= plus[p] * plus[p + 1]:\n ans *= minus[m] * minus[m+1]\n ans %= mod\n m += 2\n else:\n ans *= plus[p] * plus[p + 1]\n ans %= mod\n p += 2\n K -= 2\n elif K >= 2 and m <= len_m-2:\n ans *= minus[m] * minus[m+1]\n ans %= mod\n m += 2\n K -= 2\n elif K >= 2 and p <= len_p-2:\n ans *= plus[p] * plus[p + 1]\n ans %= mod\n p += 2\n K -= 2\n elif p <= len_p -1:\n ans *= plus[p]\n ans %= mod\n p += 1\n K -= 1\n else:\n ans *= minus[m]\n ans %= mod\n m += 1\n K -= 1\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 54 }, { "user_id": "u894521144", "problem_id": "p02549", "submission1_id": "s996267709-FL", "submission2_id": "s253874306", "status1": "Wrong Answer", "status2": "Accepted", "code1": "mod = 998244353\n\n\ndef main(N, S):\n dp = [0 if n != 0 else 1 for n in range(N)] \n A = [0 if n != 0 else 1 for n in range(N)] \n\n for i in range(1, N): \n for l, r in S: \n if i - l < 0: \n break\n else: \n dp[i] += A[i-l] - A[max(i-r-1, 0)] \n dp[i] %= mod\n A[i] = (A[i-1] + dp[i]) % mod\n print(dp[-1])\n\nif __name__ == '__main__':\n N, K = list(map(int, input().split()))\n S = {tuple(map(int, input().split())) for k in range(K)}\n S = sorted(list(S), key = lambda x:x[0]) \n main(N, S)", "code2": "mod = 998244353\n\n\ndef main(N, S):\n dp = [0 if n != 0 else 1 for n in range(N)] \n A = [0 if n != 0 else 1 for n in range(N)] \n\n for i in range(1, N): \n for l, r in S: \n if i - l < 0: \n break\n else: \n dp[i] += A[i-l] - A[max(i-r, 0)-1] \n dp[i] %= mod\n A[i] = (A[i-1] + dp[i]) % mod\n print(dp[-1])\n\nif __name__ == '__main__':\n N, K = list(map(int, input().split()))\n S = {tuple(map(int, input().split())) for k in range(K)}\n S = sorted(list(S), key = lambda x:x[0]) \n main(N, S)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600692541", "date2": "1600692715", "bleu_score": "0.9928764983134523", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0], "code1_test_score": 23, "total_score": 102, "input": "84 3\n5 4\n1 1\n1 27\n", "actual_output": "0\n", "expected_output": "894733340\n\n", "anno_code": ["mod = 998244353 # (0): mod=998244353\n\n\ndef main(N, S): # (1): main=\n dp = [0 if n != 0 else 1 for n in range(N)] \n A = [0 if n != 0 else 1 for n in range(N)] \n\n for i in range(1, N): \n for l, r in S: \n if i - l < 0: \n break\n else: \n dp[i] += A[i-l] - A[max(i-r-1, 0)] \n dp[i] %= mod\n A[i] = (A[i-1] + dp[i]) % mod\n print(dp[-1])\n\nif __name__ == '__main__':\n N, K = list(map(int, input().split()))\n S = {tuple(map(int, input().split())) for k in range(K)}\n S = sorted(list(S), key = lambda x:x[0]) \n main(N, S)"], "anno_status": [true], "diff_content": " mod = 998244353\n \n \n def main(N, S):\n dp = [0 if n != 0 else 1 for n in range(N)] \n A = [0 if n != 0 else 1 for n in range(N)] \n \n for i in range(1, N): \n for l, r in S: \n if i - l < 0: \n break\n else: \n- dp[i] += A[i-l] - A[max(i-r-1, 0)] \n+ dp[i] += A[i-l] - A[max(i-r, 0)-1] \n dp[i] %= mod\n A[i] = (A[i-1] + dp[i]) % mod\n print(dp[-1])\n \n if __name__ == '__main__':\n N, K = list(map(int, input().split()))\n S = {tuple(map(int, input().split())) for k in range(K)}\n S = sorted(list(S), key = lambda x:x[0]) \n main(N, S)\n", "FL_content": "\n mod = 998244353\n \n \n def main(N, S):\n- dp = [0 if n != 0 else 1 for n in range(N)] \n- A = [0 if n != 0 else 1 for n in range(N)] \n \n for i in range(1, N): \n for l, r in S: \n if i - l < 0: \n break\n else: \n dp[i] += A[i-l] - A[max(i-r-1, 0)] \n dp[i] %= mod\n A[i] = (A[i-1] + dp[i]) % mod\n print(dp[-1])\n \n if __name__ == '__main__':\n N, K = list(map(int, input().split()))\n S = {tuple(map(int, input().split())) for k in range(K)}\n S = sorted(list(S), key = lambda x:x[0]) \n main(N, S)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u196653484", "problem_id": "p02318", "submission1_id": "s588168327-FL", "submission2_id": "s066226375", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\ndef search(a,b):\n na=len(a)\n nb=len(b)\n array = [[0]*(nb+1) for _ in range(na+1)]\n for i in range(na):\n array[i][0]=i\n for j in range(nb):\n array[0][j]=j\n for i,x in enumerate(a,1):\n prerow=array[i-1]\n row=array[i]\n for j,y in enumerate(b,1):\n if x == y:\n row[j]=prerow[j-1]\n elif prerow[j] > row[j-1]:\n row[j] = row[j-1]+1\n else:\n row[j] = prerow[j]+1\n return array[-1][-1]\n\na=input()\nb=input()\nprint(search(a,b))\n", "code2": "def search(a,b):\n na=len(a)\n nb=len(b)\n array = [[0]*(nb+1) for _ in range(na+1)]\n for i in range(na+1):\n array[i][0]=i\n for j in range(nb+1):\n array[0][j]=j\n for i,x in enumerate(a,1):\n prerow=array[i-1]\n row=array[i]\n for j,y in enumerate(b,1):\n if x == y:\n row[j]=prerow[j-1]\n else:\n row[j]=min(prerow[j], prerow[j-1], row[j-1])+1\n \n return array[-1][-1]\n\na=input()\nb=input()\nprint(search(a,b))\n\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1531898088", "date2": "1531899909", "bleu_score": "0.8733132782095607", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 1, "total_score": 102, "input": "cca_\nlcb\n", "actual_output": "1\n", "expected_output": "3\n\n", "anno_code": ["\nimport sys\ndef search(a,b): # (0): search=\n na=len(a) # (4): na=4\n nb=len(b) # (5): nb=3\n array = [[0]*(nb+1) for _ in range(na+1)] # (6): array\n for i in range(na): # (7): i=0 (9): i=1 ... (15): NO CHANGE\n array[i][0]=i # (8): NO CHANGE (10): array ... (14): array\n for j in range(nb): # (16): j=0 (18): j=1 ... (22): NO CHANGE\n array[0][j]=j # (17): NO CHANGE (19): array (21): array\n for i,x in enumerate(a,1): # (23): i=1, x=c (26): i=2 ... (35): NO CHANGE\n prerow=array[i-1] # (24): prerow=[0, 1, 2, 0] (27): prerow=[1, 0, 0, 0] ... (33): prerow=[3, 0, 0, 0]\n row=array[i] # (25): row=[1, 0, 0, 0] (28): row=[2, 0, 0, 0] ... (34): row=[0, 0, 0, 0]\n for j,y in enumerate(b,1): # (36): j=1, y=l (40): j=2, y=c (44): j=3, y=b\n if x == y: # (37): NO CHANGE (41): NO CHANGE (45): NO CHANGE\n row[j]=prerow[j-1]\n elif prerow[j] > row[j-1]: # (38): NO CHANGE (42): NO CHANGE (46): NO CHANGE\n row[j] = row[j-1]+1\n else:\n row[j] = prerow[j]+1 # (39): array=[[0, 1, 2, 0], [1, 0, 0, 0], [2, 0, 0, 0], [3, 0, 0, 0], [0, 1, 0, 0]], row=[0, 1, 0, 0] (43): array=[[0, 1, 2, 0], [1, 0, 0, 0], [2, 0, 0, 0], [3, 0, 0, 0], [0, 1, 1, 0]], row=[0, 1, 1, 0] (47): array, row=[0, 1, 1, 1]\n return array[-1][-1]\n\na=input() # (1): a=cca_\nb=input() # (2): b=lcb\nprint(search(a,b)) # (3): NO CHANGE\n"], "anno_status": [true], "diff_content": "-\n-import sys\n def search(a,b):\n na=len(a)\n nb=len(b)\n array = [[0]*(nb+1) for _ in range(na+1)]\n- for i in range(na):\n+ for i in range(na+1):\n array[i][0]=i\n- for j in range(nb):\n+ for j in range(nb+1):\n array[0][j]=j\n for i,x in enumerate(a,1):\n prerow=array[i-1]\n row=array[i]\n- for j,y in enumerate(b,1):\n+ for j,y in enumerate(b,1):\n if x == y:\n row[j]=prerow[j-1]\n- elif prerow[j] > row[j-1]:\n- row[j] = row[j-1]+1\n else:\n- row[j] = prerow[j]+1\n+ row[j]=min(prerow[j], prerow[j-1], row[j-1])+1\n+ \n return array[-1][-1]\n \n a=input()\n b=input()\n print(search(a,b))\n \n+\n+\n", "FL_content": "\n \n import sys\n def search(a,b):\n na=len(a)\n nb=len(b)\n array = [[0]*(nb+1) for _ in range(na+1)]\n for i in range(na):\n array[i][0]=i\n for j in range(nb):\n array[0][j]=j\n for i,x in enumerate(a,1):\n prerow=array[i-1]\n row=array[i]\n for j,y in enumerate(b,1):\n if x == y:\n row[j]=prerow[j-1]\n elif prerow[j] > row[j-1]:\n row[j] = row[j-1]+1\n else:\n row[j] = prerow[j]+1\n return array[-1][-1]\n \n a=input()\n b=input()\n print(search(a,b))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 26 }, { "user_id": "u230621983", "problem_id": "p03086", "submission1_id": "s910137367-FL", "submission2_id": "s541739552", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\ntmp=0\nans=0\nfor s in S:\n if s in 'ACGT':\n tmp+=1\n else:\n ans = max(ans,tmp)\n tmp=0\nprint(ans)", "code2": "S = input()\ntmp=0\nans=0\nfor s in S:\n if s in 'ACGT':\n tmp+=1\n else:\n tmp=0\n ans = max(ans,tmp)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577920960", "date2": "1577921337", "bleu_score": "0.9669859986221173", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "REBPCTA\n", "actual_output": "0\n", "expected_output": "3\n\n", "anno_code": ["S = input() # (0): S=REBPCTA\ntmp=0 # (1): tmp=0\nans=0 # (2): ans=0\nfor s in S: # (3): s=R (7): s=E ... (28): NO CHANGE\n if s in 'ACGT': # (4): NO CHANGE (8): NO CHANGE ... (26): NO CHANGE\n tmp+=1 # (21): tmp=1 (24): tmp=2 (27): tmp=3\n else:\n ans = max(ans,tmp) # (5): NO CHANGE (9): NO CHANGE ... (17): NO CHANGE\n tmp=0 # (6): NO CHANGE (10): NO CHANGE ... (18): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " S = input()\n tmp=0\n ans=0\n for s in S:\n if s in 'ACGT':\n tmp+=1\n else:\n- ans = max(ans,tmp)\n tmp=0\n+ ans = max(ans,tmp)\n print(ans)\n", "FL_content": "\n S = input()\n tmp=0\n ans=0\n for s in S:\n if s in 'ACGT':\n tmp+=1\n else:\n ans = max(ans,tmp)\n tmp=0\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u900688325", "problem_id": "p03363", "submission1_id": "s264036092-FL", "submission2_id": "s197767687", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA_list = list(map(int, input().split()))\nimport math\n\nruiseki_A_list = [0 for _ in range(N)]\n\nfor i in range(N):\n if i == 0:\n ruiseki_A_list[i] = A_list[i]\n else:\n ruiseki_A_list[i] = A_list[i] + ruiseki_A_list[i-1]\n\n\n\nruiseki_A_list.insert(0,0)\nans = 0\n\n\nruiseki_A_list.sort()\nkosuu = [1]\nk = 0\nfor i in range(N):\n if ruiseki_A_list[i+1] - ruiseki_A_list[i] == 0:\n kosuu[k] += 1\n else:\n k += 1\n kosuu.append(1)\n\nkosuu[-1] += 1\nfor num in kosuu:\n if num <= 1:\n ans += 0\n else:\n ans += math.factorial(num)/(math.factorial(2) * math.factorial(num-2))\nprint(ans)", "code2": "N = int(input())\nA_list = list(map(int, input().split()))\nimport math\n\nruiseki_A_list = [0 for _ in range(N)]\n\nfor i in range(N):\n if i == 0:\n ruiseki_A_list[i] = A_list[i]\n else:\n ruiseki_A_list[i] = A_list[i] + ruiseki_A_list[i-1]\n\n\n\nruiseki_A_list.insert(0,0)\nans = 0\n\n\nruiseki_A_list.sort()\nkosuu = [1]\nk = 0\nfor i in range(N):\n if ruiseki_A_list[i+1] - ruiseki_A_list[i] == 0:\n kosuu[k] += 1\n else:\n k += 1\n kosuu.append(1)\n \nfor num in kosuu:\n if num <= 1:\n ans += 0\n else:\n ans += math.factorial(num)/(math.factorial(2) * math.factorial(num-2))\nprint(int(ans))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555467640", "date2": "1555468090", "bleu_score": "0.9750514358521677", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "6\n-1 1 -3 2 1 -3\n", "actual_output": "8.0\n", "expected_output": "5\n\n", "anno_code": ["N = int(input()) # (0): N=6\nA_list = list(map(int, input().split())) # (1): A_list=[-1, 1, -3, 2, 1, -3], math=\nimport math\n\nruiseki_A_list = [0 for _ in range(N)] # (2): ruiseki_A_list=[0, 0, 0, 0, 0, 0]\n\nfor i in range(N): # (3): i=0 (6): i=1 ... (21): NO CHANGE\n if i == 0: # (4): NO CHANGE (7): NO CHANGE ... (19): NO CHANGE\n ruiseki_A_list[i] = A_list[i] # (5): ruiseki_A_list=[-1, 0, 0, 0, 0, 0]\n else:\n ruiseki_A_list[i] = A_list[i] + ruiseki_A_list[i-1] # (8): NO CHANGE (11): ruiseki_A_list=[-1, 0, -3, 0, 0, 0] ... (20): ruiseki_A_list=[-1, 0, -3, -1, 0, -3]\n\n\n\nruiseki_A_list.insert(0,0) # (22): ruiseki_A_list=[0, -1, 0, -3, -1, 0, -3]\nans = 0 # (23): ans=0\n\n\nruiseki_A_list.sort() # (24): ruiseki_A_list=[-3, -3, -1, -1, 0, 0, 0]\nkosuu = [1] # (25): kosuu=[1]\nk = 0 # (26): k=0\nfor i in range(N): # (27): i=0 (30): i=1 ... (47): NO CHANGE\n if ruiseki_A_list[i+1] - ruiseki_A_list[i] == 0: # (28): NO CHANGE (31): NO CHANGE ... (45): NO CHANGE\n kosuu[k] += 1 # (29): kosuu=[2] (36): kosuu=[2, 2] ... (46): kosuu=[2, 2, 3]\n else:\n k += 1 # (32): k=1 (39): k=2\n kosuu.append(1) # (33): kosuu=[2, 1] (40): kosuu=[2, 2, 1]\n\nkosuu[-1] += 1 # (48): kosuu=[2, 2, 4]\nfor num in kosuu: # (49): num=2 (52): NO CHANGE ... (58): NO CHANGE\n if num <= 1: # (50): NO CHANGE (53): NO CHANGE (56): NO CHANGE\n ans += 0\n else:\n ans += math.factorial(num)/(math.factorial(2) * math.factorial(num-2)) # (51): ans=1.0 (54): ans=2.0 (57): ans=8.0\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n A_list = list(map(int, input().split()))\n import math\n \n ruiseki_A_list = [0 for _ in range(N)]\n \n for i in range(N):\n if i == 0:\n ruiseki_A_list[i] = A_list[i]\n else:\n ruiseki_A_list[i] = A_list[i] + ruiseki_A_list[i-1]\n \n \n \n ruiseki_A_list.insert(0,0)\n ans = 0\n \n \n ruiseki_A_list.sort()\n kosuu = [1]\n k = 0\n for i in range(N):\n if ruiseki_A_list[i+1] - ruiseki_A_list[i] == 0:\n kosuu[k] += 1\n else:\n k += 1\n kosuu.append(1)\n-\n-kosuu[-1] += 1\n+ \n for num in kosuu:\n if num <= 1:\n ans += 0\n else:\n ans += math.factorial(num)/(math.factorial(2) * math.factorial(num-2))\n-print(ans)\n+print(int(ans))\n", "FL_content": "\n N = int(input())\n A_list = list(map(int, input().split()))\n import math\n \n ruiseki_A_list = [0 for _ in range(N)]\n \n for i in range(N):\n if i == 0:\n ruiseki_A_list[i] = A_list[i]\n else:\n ruiseki_A_list[i] = A_list[i] + ruiseki_A_list[i-1]\n \n \n \n ruiseki_A_list.insert(0,0)\n ans = 0\n \n \n ruiseki_A_list.sort()\n kosuu = [1]\n k = 0\n for i in range(N):\n if ruiseki_A_list[i+1] - ruiseki_A_list[i] == 0:\n kosuu[k] += 1\n else:\n k += 1\n kosuu.append(1)\n \n kosuu[-1] += 1\n for num in kosuu:\n if num <= 1:\n ans += 0\n else:\n- ans += math.factorial(num)/(math.factorial(2) * math.factorial(num-2))\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 35 }, { "user_id": "u779455925", "problem_id": "p02616", "submission1_id": "s096693886-FL", "submission2_id": "s191902560", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from heapq import *\nimport sys\nfrom collections import *\nfrom itertools import *\nfrom decimal import *\nimport copy\nfrom bisect import *\nimport math\nsys.setrecursionlimit(4100000)\ndef gcd(a,b):\n if(a%b==0):return(b)\n return (gcd(b,a%b))\ninput=lambda :sys.stdin.readline().rstrip()\nN,K=map(int,input().split())\n\nA=list(map(int,input().split()))\nmod=10**9+7\nAm=[-i for i in A if i<0]\nAp=[i for i in A if i>=0]\n\nAm.sort()\nAp.sort()\nAm=deque(Am)\nAp=deque(Ap)\n\n\n\nif N-K==0 and len(Am)%2==0 or len(Ap)==0 and K%2:\n c=1\n while K and (Am or Ap) :\n if Am and Ap:\n if Am[0]Ap[0]:\n\n a=Am.pop()\n c*=a\n h+=1\n else:\n\n b=Ap.pop()\n c*=b\n\n elif Am:\n a=Am.pop()\n c*=a\n h+=1\n elif Ap:\n b=Ap.pop()\n c*=b\n K-=1\n c%=mod\n \n\n\nprint(c%mod)\n", "code2": "from heapq import *\nimport sys\nfrom collections import *\nfrom itertools import *\nfrom decimal import *\nimport copy\nfrom bisect import *\nimport math\nsys.setrecursionlimit(4100000)\ndef gcd(a,b):\n if(a%b==0):return(b)\n return (gcd(b,a%b))\ninput=lambda :sys.stdin.readline().rstrip()\nN,K=map(int,input().split())\n\nA=list(map(int,input().split()))\nmod=10**9+7\nAm=[-i for i in A if i<0]\nAp=[i for i in A if i>=0]\n\nAm.sort()\nAp.sort()\nAm=deque(Am)\nAp=deque(Ap)\n\n\n\nif N==K:\n c=1\n for a in A:\n c*=a\n c%=mod\n\nelif len(Ap)==0 and K%2:\n c=1\n while K :\n c*=Am.popleft()\n\n K-=1\n\n c%=mod\n c=-c\n c%=mod\n \n\nelse:\n \n c=1\n h=0\n a=\"unko\"\n b=\"unko\"\n while K and (Am or Ap) :\n if Am and Ap:\n if Am[-1]>Ap[-1]:\n\n a=Am.pop()\n c*=a\n h+=1\n else:\n\n b=Ap.pop()\n c*=b\n\n elif Am:\n a=Am.pop()\n c*=a\n h+=1\n elif Ap:\n b=Ap.pop()\n c*=b\n K-=1\n c%=mod\n\n if h%2:\n if Am and Ap and a!=\"unko\" and b!=\"unko\":\n if Am[-1]*a>Ap[-1]*b:\n a=Am.pop()\n c*=a\n c*=pow(b,mod-2,mod)\n else:\n b=Ap.pop()\n c*=b\n c*=pow(a,mod-2,mod)\n elif Am and b!=\"unko\":\n a=Am.pop()\n c*=a\n c*=pow(b,mod-2,mod)\n else:\n b=Ap.pop()\n c*=b\n c*=pow(a,mod-2,mod)\n\n\nprint(c%mod)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593981526", "date2": "1593984180", "bleu_score": "0.8362306321451449", "code1_test_status": [0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 101, "total_score": 104, "input": "4 2\n1 2 -4 -1\n", "actual_output": "2\n", "expected_output": "4\n\n", "anno_code": ["from heapq import *\nimport sys\nfrom collections import *\nfrom itertools import *\nfrom decimal import *\nimport copy\nfrom bisect import *\nimport math\nsys.setrecursionlimit(4100000) # (0): NO CHANGE\ndef gcd(a,b): # (1): gcd=\n if(a%b==0):return(b)\n return (gcd(b,a%b))\ninput=lambda :sys.stdin.readline().rstrip() # (2): input= at 0x00000189CEA59EA0>\nN,K=map(int,input().split()) # (3): N=4, K=2\n\nA=list(map(int,input().split())) # (4): A=[1, 2, -4, -1]\nmod=10**9+7 # (5): mod=1000000007\nAm=[-i for i in A if i<0] # (6): Am=[4, 1]\nAp=[i for i in A if i>=0] # (7): Ap=[1, 2]\n\nAm.sort() # (8): Am=[1, 4]\nAp.sort() # (9): NO CHANGE\nAm=deque(Am) # (10): NO CHANGE\nAp=deque(Ap) # (11): NO CHANGE\n\n\n\nif N-K==0 and len(Am)%2==0 or len(Ap)==0 and K%2: # (12): NO CHANGE\n c=1\n while K and (Am or Ap) :\n if Am and Ap:\n if Am[0]Ap[0]: # (22): NO CHANGE (29): NO CHANGE\n\n a=Am.pop()\n c*=a\n h+=1\n else:\n\n b=Ap.pop() # (23): b=2 (30): b=1\n c*=b # (24): c=2 (31): NO CHANGE\n\n elif Am:\n a=Am.pop()\n c*=a\n h+=1\n elif Ap:\n b=Ap.pop()\n c*=b\n K-=1 # (25): K=1 (32): K=0\n c%=mod # (26): NO CHANGE (33): NO CHANGE\n \n\n\nprint(c%mod)\n"], "anno_status": [false], "diff_content": " from heapq import *\n import sys\n from collections import *\n from itertools import *\n from decimal import *\n import copy\n from bisect import *\n import math\n sys.setrecursionlimit(4100000)\n def gcd(a,b):\n if(a%b==0):return(b)\n return (gcd(b,a%b))\n input=lambda :sys.stdin.readline().rstrip()\n N,K=map(int,input().split())\n \n A=list(map(int,input().split()))\n mod=10**9+7\n Am=[-i for i in A if i<0]\n Ap=[i for i in A if i>=0]\n \n Am.sort()\n Ap.sort()\n Am=deque(Am)\n Ap=deque(Ap)\n \n \n \n-if N-K==0 and len(Am)%2==0 or len(Ap)==0 and K%2:\n+if N==K:\n c=1\n- while K and (Am or Ap) :\n- if Am and Ap:\n- if Am[0]Ap[0]:\n+ if Am and Ap:\n+ if Am[-1]>Ap[-1]:\n+\n+ a=Am.pop()\n+ c*=a\n+ h+=1\n+ else:\n \n- a=Am.pop()\n- c*=a\n- h+=1\n- else:\n+ b=Ap.pop()\n+ c*=b\n \n- b=Ap.pop()\n- c*=b\n+ elif Am:\n+ a=Am.pop()\n+ c*=a\n+ h+=1\n+ elif Ap:\n+ b=Ap.pop()\n+ c*=b\n+ K-=1\n+ c%=mod\n \n- elif Am:\n+ if h%2:\n+ if Am and Ap and a!=\"unko\" and b!=\"unko\":\n+ if Am[-1]*a>Ap[-1]*b:\n a=Am.pop()\n c*=a\n- h+=1\n- elif Ap:\n+ c*=pow(b,mod-2,mod)\n+ else:\n b=Ap.pop()\n c*=b\n- K-=1\n- c%=mod\n- \n+ c*=pow(a,mod-2,mod)\n+ elif Am and b!=\"unko\":\n+ a=Am.pop()\n+ c*=a\n+ c*=pow(b,mod-2,mod)\n+ else:\n+ b=Ap.pop()\n+ c*=b\n+ c*=pow(a,mod-2,mod)\n \n \n print(c%mod)\n \n", "FL_content": "\n from heapq import *\n import sys\n from collections import *\n from itertools import *\n from decimal import *\n import copy\n from bisect import *\n import math\n sys.setrecursionlimit(4100000)\n def gcd(a,b):\n if(a%b==0):return(b)\n return (gcd(b,a%b))\n input=lambda :sys.stdin.readline().rstrip()\n N,K=map(int,input().split())\n \n A=list(map(int,input().split()))\n mod=10**9+7\n Am=[-i for i in A if i<0]\n Ap=[i for i in A if i>=0]\n \n Am.sort()\n Ap.sort()\n Am=deque(Am)\n Ap=deque(Ap)\n \n \n \n-if N-K==0 and len(Am)%2==0 or len(Ap)==0 and K%2:\n c=1\n while K and (Am or Ap) :\n if Am and Ap:\n if Am[0]Ap[0]:\n \n a=Am.pop()\n c*=a\n h+=1\n else:\n \n b=Ap.pop()\n c*=b\n \n elif Am:\n a=Am.pop()\n c*=a\n h+=1\n elif Ap:\n b=Ap.pop()\n c*=b\n K-=1\n c%=mod\n \n \n \n print(c%mod)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 79 }, { "user_id": "u639343026", "problem_id": "p02899", "submission1_id": "s189513333-FL", "submission2_id": "s647547768", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=list(map(int,input().split()))\nb=[0]*n\nfor i in range(n):\n for l in range(n):\n if a[i]==l+1:\n b[i]=l+1\n break\nprint(*b)", "code2": "n=int(input())\na=list(map(int,input().split()))\nb=[0]*n\nfor i in range(n):\n b[i]=[a[i],i+1]\nb=sorted(b, key=lambda x: x[0])\nfor i in range(n):\n if i!=n-1:\n print(b[i][1],end=\" \")\n else:\n print(b[i][1])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569719406", "date2": "1569719775", "bleu_score": "0.6072950608479625", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 1, "total_score": 11, "input": "3\n-2 0 -1\n", "actual_output": "0 0 0\n", "expected_output": "1 3 2 \n\n", "anno_code": ["n=int(input()) # (0): n=3\na=list(map(int,input().split())) # (1): a=[-2, 0, -1]\nb=[0]*n # (2): b=[0, 0, 0]\nfor i in range(n): # (3): i=0 (11): i=1 ... (27): NO CHANGE\n for l in range(n): # (4): l=0 (6): l=1 ... (26): NO CHANGE\n if a[i]==l+1: # (5): NO CHANGE (7): NO CHANGE ... (25): NO CHANGE\n b[i]=l+1\n break\nprint(*b)"], "anno_status": [true], "diff_content": " n=int(input())\n a=list(map(int,input().split()))\n b=[0]*n\n for i in range(n):\n- for l in range(n):\n- if a[i]==l+1:\n- b[i]=l+1\n- break\n-print(*b)\n+ b[i]=[a[i],i+1]\n+b=sorted(b, key=lambda x: x[0])\n+for i in range(n):\n+ if i!=n-1:\n+ print(b[i][1],end=\" \")\n+ else:\n+ print(b[i][1])\n", "FL_content": "\n n=int(input())\n a=list(map(int,input().split()))\n b=[0]*n\n for i in range(n):\n- for l in range(n):\n- if a[i]==l+1:\n- b[i]=l+1\n- break\n print(*b)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u183896397", "problem_id": "p02921", "submission1_id": "s723186060-FL", "submission2_id": "s661539735", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = str(input())\nT = str(input())\n\ns = list(S)\nt = list(T)\n\nans = 0\n\nfor i in range(2):\n if s[i] == t[i]:\n ans += 1\n \nprint(ans)", "code2": "S = str(input())\nT = str(input())\n\ns = list(S)\nt = list(T)\n\nans = 0\n\nfor i in range(3):\n if s[i] == t[i]:\n ans += 1\n \nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567364738", "date2": "1567364786", "bleu_score": "0.9824846426725741", "code1_test_status": [1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 80, "total_score": 103, "input": "RTS\nTTS\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["S = str(input()) # (0): S=RTS\nT = str(input()) # (1): T=TTS\n\ns = list(S) # (2): s=['R', 'T', 'S']\nt = list(T) # (3): t=['T', 'T', 'S']\n\nans = 0 # (4): ans=0\n\nfor i in range(2): # (5): i=0 (7): i=1 (10): NO CHANGE\n if s[i] == t[i]: # (6): NO CHANGE (8): NO CHANGE\n ans += 1 # (9): ans=1\n \nprint(ans)"], "anno_status": [true], "diff_content": " S = str(input())\n T = str(input())\n \n s = list(S)\n t = list(T)\n \n ans = 0\n \n-for i in range(2):\n+for i in range(3):\n if s[i] == t[i]:\n ans += 1\n \n print(ans)\n", "FL_content": "\n S = str(input())\n T = str(input())\n \n s = list(S)\n t = list(T)\n \n ans = 0\n \n-for i in range(2):\n if s[i] == t[i]:\n ans += 1\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u131881594", "problem_id": "p03380", "submission1_id": "s699246863-FL", "submission2_id": "s961945835", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=list(map(int,input().split()))\nans1=max(a)\nm=10**9+1\ntemp=ans1/2\ni=0\nfor index,val in enumerate(a):\n if abs(val-temp)=0 and answer>b-c):\n answer=b-c\n if (c-b>0 and answer>c-b):\n answer=c-b\nprint(answer)", "code2": "b=input()\na=input().split()\nfor i in range(0,len(a)):\n a[i]=int(a[i])\nb=0\nc=0\nanswer=sum(a)\nfor i in range(0,len(a)):\n b=b+a[i]\n c=sum(a)-b\n if (b-c>=0 and answer>b-c):\n answer=b-c\n elif (c-b>0 and answer>c-b):\n answer=c-b\nprint(answer)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560133451", "date2": "1560135233", "bleu_score": "0.9495937721580872", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "8\n47 30 99 2 5 2 102 4\n", "actual_output": "0\n", "expected_output": "61\n\n", "anno_code": ["a=input().split() # (0): a=['8']\ndel a[0] # (1): a=[]\nfor i in range(0,len(a)): # (2): NO CHANGE\n a[i]=int(a[i])\nb=0 # (3): b=0\nc=0 # (4): c=0\nanswer=sum(a) # (5): answer=0\nfor i in range(0,len(a)): # (6): NO CHANGE\n b=b+a[i]\n c=sum(a)-b\n if (b-c>=0 and answer>b-c):\n answer=b-c\n if (c-b>0 and answer>c-b):\n answer=c-b\nprint(answer)"], "anno_status": [true], "diff_content": "+b=input()\n a=input().split()\n-del a[0]\n for i in range(0,len(a)):\n a[i]=int(a[i])\n b=0\n c=0\n answer=sum(a)\n for i in range(0,len(a)):\n b=b+a[i]\n c=sum(a)-b\n if (b-c>=0 and answer>b-c):\n answer=b-c\n- if (c-b>0 and answer>c-b):\n+ elif (c-b>0 and answer>c-b):\n answer=c-b\n print(answer)\n", "FL_content": "\n a=input().split()\n del a[0]\n for i in range(0,len(a)):\n a[i]=int(a[i])\n b=0\n c=0\n-answer=sum(a)\n for i in range(0,len(a)):\n b=b+a[i]\n c=sum(a)-b\n if (b-c>=0 and answer>b-c):\n answer=b-c\n if (c-b>0 and answer>c-b):\n answer=c-b\n print(answer)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u482157295", "problem_id": "p03617", "submission1_id": "s127521709-FL", "submission2_id": "s306555147", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nq,h,s,d = map(int,input().split())\nn = int(input())\nvalue = [0]*4\nvalue[0] = q*4\nvalue[1] = h*2\nvalue[2] = s\nvalue[3] = d/2\ndum = min(value)\nind = value.index(dum)\nif ind == 0:\n print(value[0]*n)\nelif ind == 1:\n print(value[1]*n)\nelif ind == 2:\n print(value[2]*n)\nelse:\n if n == 1:\n value.sort()\n print(value[1])\n elif n%2 == 0:\n print(math.floor(value[3]*n))\n else:\n dum1 = n\n value.sort()\n print(math.floor(value[1]+dum1))", "code2": "import math\nq,h,s,d = map(int,input().split())\nn = int(input())\nvalue = [0]*4\nvalue[0] = q*4\nvalue[1] = h*2\nvalue[2] = s\nvalue[3] = d/2\ndum = min(value)\nind = value.index(dum)\nif ind == 0:\n print(value[0]*n)\nelif ind == 1:\n print(value[1]*n)\nelif ind == 2:\n print(value[2]*n)\nelse:\n if n == 1:\n value.sort()\n print(value[1])\n elif n%2 == 0:\n print(math.floor(d*n\n else:\n dum1 = (n\n value.sort()\n print(math.floor(value[1]+dum1))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1590539418", "date2": "1590542069", "bleu_score": "0.9710686285723217", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 85, "total_score": 104, "input": "11100 0010 111 -2\n-1\n", "actual_output": "19\n", "expected_output": "22\n\n", "anno_code": ["import math\nq,h,s,d = map(int,input().split()) # (0): q=11100, h=10, s=111, d=-2\nn = int(input()) # (1): n=-1\nvalue = [0]*4 # (2): value=[0, 0, 0, 0]\nvalue[0] = q*4 # (3): value=[44400, 0, 0, 0]\nvalue[1] = h*2 # (4): value=[44400, 20, 0, 0]\nvalue[2] = s # (5): value=[44400, 20, 111, 0]\nvalue[3] = d/2 # (6): value=[44400, 20, 111, -1.0]\ndum = min(value) # (7): dum=-1.0\nind = value.index(dum) # (8): ind=3\nif ind == 0: # (9): NO CHANGE\n print(value[0]*n)\nelif ind == 1: # (10): NO CHANGE\n print(value[1]*n)\nelif ind == 2: # (11): NO CHANGE\n print(value[2]*n)\nelse:\n if n == 1: # (12): NO CHANGE\n value.sort()\n print(value[1])\n elif n%2 == 0: # (13): NO CHANGE\n print(math.floor(value[3]*n))\n else:\n dum1 = n # (14): dum1=-1\n value.sort() # (15): value=[-1.0, 20, 111, 44400]\n print(math.floor(value[1]+dum1))"], "anno_status": [true], "diff_content": " import math\n q,h,s,d = map(int,input().split())\n n = int(input())\n value = [0]*4\n value[0] = q*4\n value[1] = h*2\n value[2] = s\n value[3] = d/2\n dum = min(value)\n ind = value.index(dum)\n if ind == 0:\n print(value[0]*n)\n elif ind == 1:\n print(value[1]*n)\n elif ind == 2:\n print(value[2]*n)\n else:\n if n == 1:\n value.sort()\n print(value[1])\n elif n%2 == 0:\n- print(math.floor(value[3]*n))\n+ print(math.floor(d*n\n else:\n- dum1 = n\n+ dum1 = (n\n value.sort()\n print(math.floor(value[1]+dum1))\n", "FL_content": "\n import math\n q,h,s,d = map(int,input().split())\n n = int(input())\n value = [0]*4\n value[0] = q*4\n value[1] = h*2\n value[2] = s\n value[3] = d/2\n dum = min(value)\n ind = value.index(dum)\n if ind == 0:\n print(value[0]*n)\n elif ind == 1:\n print(value[1]*n)\n elif ind == 2:\n print(value[2]*n)\n else:\n if n == 1:\n value.sort()\n print(value[1])\n elif n%2 == 0:\n print(math.floor(value[3]*n))\n else:\n- dum1 = n\n value.sort()\n- print(math.floor(value[1]+dum1))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 26 }, { "user_id": "u858748695", "problem_id": "p02929", "submission1_id": "s052941027-FL", "submission2_id": "s713250941", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nMOD = 10**9 + 7\nn = int(input())\ns = input()\nd = 1\nans = 1\nfor i in range(1, 2 * n):\n if (s[i] == 'B') ^ (d % 2 != 0):\n d += 1\n else:\n ans *= max(1, d)\n ans %= MOD\n d -= 1\nif d != 0 or s[0] == 'W' or s[-1] == 'W':\n print(0)\n exit()\nfor i in range(1, n + 1):\n ans *= i\n ans %= MOD\nprint(ans)\n", "code2": "\nMOD = 10**9 + 7\nn = int(input())\ns = input()\nd = 0\nans = 1\nfor i in range(2 * n):\n if (s[i] == 'B') ^ (d % 2 != 0):\n d += 1\n else:\n ans *= d\n ans %= MOD\n d -= 1\nif d != 0:\n print(0)\n exit()\nfor i in range(1, n + 1):\n ans *= i\n ans %= MOD\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566705415", "date2": "1566705689", "bleu_score": "0.8461513037514891", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "4\nBWBBWBWX\n", "actual_output": "144\n", "expected_output": "0\n\n", "anno_code": ["\nMOD = 10**9 + 7 # (0): MOD=1000000007\nn = int(input()) # (1): n=4\ns = input() # (2): s=BWBBWBWX\nd = 1 # (3): d=1\nans = 1 # (4): ans=1\nfor i in range(1, 2 * n): # (5): i=1 (8): i=2 ... (34): NO CHANGE\n if (s[i] == 'B') ^ (d % 2 != 0): # (6): NO CHANGE (9): NO CHANGE ... (32): NO CHANGE\n d += 1 # (7): d=2 (10): d=3 (33): d=0\n else:\n ans *= max(1, d) # (13): ans=3 (18): ans=6 ... (28): NO CHANGE\n ans %= MOD # (14): NO CHANGE (19): NO CHANGE ... (29): NO CHANGE\n d -= 1 # (15): d=2 (20): d=1 ... (30): d=-1\nif d != 0 or s[0] == 'W' or s[-1] == 'W': # (35): NO CHANGE\n print(0)\n exit()\nfor i in range(1, n + 1): # (36): i=1 (39): i=2 ... (48): NO CHANGE\n ans *= i # (37): NO CHANGE (40): ans=12 ... (46): ans=144\n ans %= MOD # (38): NO CHANGE (41): NO CHANGE ... (47): NO CHANGE\nprint(ans)\n"], "anno_status": [true], "diff_content": " \n MOD = 10**9 + 7\n n = int(input())\n s = input()\n-d = 1\n+d = 0\n ans = 1\n-for i in range(1, 2 * n):\n+for i in range(2 * n):\n if (s[i] == 'B') ^ (d % 2 != 0):\n d += 1\n else:\n- ans *= max(1, d)\n+ ans *= d\n ans %= MOD\n d -= 1\n-if d != 0 or s[0] == 'W' or s[-1] == 'W':\n+if d != 0:\n print(0)\n exit()\n for i in range(1, n + 1):\n ans *= i\n ans %= MOD\n print(ans)\n \n", "FL_content": "\n \n MOD = 10**9 + 7\n n = int(input())\n s = input()\n d = 1\n ans = 1\n for i in range(1, 2 * n):\n if (s[i] == 'B') ^ (d % 2 != 0):\n d += 1\n else:\n ans *= max(1, d)\n ans %= MOD\n d -= 1\n-if d != 0 or s[0] == 'W' or s[-1] == 'W':\n print(0)\n exit()\n for i in range(1, n + 1):\n ans *= i\n ans %= MOD\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 21 }, { "user_id": "u453055089", "problem_id": "p03086", "submission1_id": "s747901466-FL", "submission2_id": "s428926730", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\ncount = 0\ncount_list =[0]\nfor i in range(len(s)):\n if s[i] == \"A\" or s[i] == \"C\" or s[i] == \"G\" or s[i] == \"T\":\n count += 1\n else:\n count_list.append(count)\n count = 0\n\nprint(max(count_list))", "code2": "s = input()\n\ncount = 0\ncount_list = [0]\nfor i in range(len(s)):\n if s[i] == \"A\" or s[i] == \"C\" or s[i] == \"G\" or s[i] == \"T\":\n count += 1\n else:\n count_list.append(count)\n count = 0\ncount_list.append(count)\nprint(max(count_list))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586877356", "date2": "1586878584", "bleu_score": "0.8898913472431736", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "VUKJNIHT\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["s = input() # (0): s=VUKJNIHT\n\ncount = 0 # (1): count=0\ncount_list =[0] # (2): count_list=[0]\nfor i in range(len(s)): # (3): i=0 (7): i=1 ... (34): NO CHANGE\n if s[i] == \"A\" or s[i] == \"C\" or s[i] == \"G\" or s[i] == \"T\": # (4): NO CHANGE (8): NO CHANGE ... (32): NO CHANGE\n count += 1 # (33): count=1\n else:\n count_list.append(count) # (5): count_list=[0, 0] (9): count_list=[0, 0, 0] ... (29): count_list=[0, 0, 0, 0, 0, 0, 0, 0]\n count = 0 # (6): NO CHANGE (10): NO CHANGE ... (30): NO CHANGE\n\nprint(max(count_list))"], "anno_status": [true], "diff_content": " s = input()\n \n count = 0\n-count_list =[0]\n+count_list = [0]\n for i in range(len(s)):\n if s[i] == \"A\" or s[i] == \"C\" or s[i] == \"G\" or s[i] == \"T\":\n count += 1\n else:\n count_list.append(count)\n count = 0\n-\n+count_list.append(count)\n print(max(count_list))\n", "FL_content": "\n s = input()\n \n count = 0\n count_list =[0]\n for i in range(len(s)):\n if s[i] == \"A\" or s[i] == \"C\" or s[i] == \"G\" or s[i] == \"T\":\n- count += 1\n else:\n count_list.append(count)\n count = 0\n \n print(max(count_list))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u869919400", "problem_id": "p03448", "submission1_id": "s491519202-FL", "submission2_id": "s919018400", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = int(input())\nb = int(input())\nc = int(input())\nx = int(input())\n\ncount = 0\nfor i in range(a+1):\n for j in range(b+1):\n for k in range(c+1):\n if 500 * i + 100 * j + 50 * k == x:\n count += 1", "code2": "a = int(input())\nb = int(input())\nc = int(input())\nx = int(input())\n\ncount = 0\nfor i in range(a+1):\n for j in range(b+1):\n for k in range(c+1):\n if 500 * i + 100 * j + 50 * k == x:\n count += 1\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566680576", "date2": "1566680697", "bleu_score": "0.9457190336617247", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "30\n168\n252\n5860\n", "actual_output": "no output\n", "expected_output": "0\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " a = int(input())\n b = int(input())\n c = int(input())\n x = int(input())\n \n count = 0\n for i in range(a+1):\n for j in range(b+1):\n for k in range(c+1):\n if 500 * i + 100 * j + 50 * k == x:\n count += 1\n+print(count)\n", "FL_content": "\n a = int(input())\n b = int(input())\n c = int(input())\n x = int(input())\n \n count = 0\n for i in range(a+1):\n for j in range(b+1):\n for k in range(c+1):\n if 500 * i + 100 * j + 50 * k == x:\n count += 1\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u874320250", "problem_id": "p02839", "submission1_id": "s540032712-FL", "submission2_id": "s678026637", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, 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)]\nr_k = 80*10\ndiffs = [[abs(A[i][j] - B[i][j]) for j in range(W)] for i in range(H)]\ndp = [[[False] * r_k for _ in range(W+1)] for _ in range(H+1)]\nfor i in range(H+1):\n dp[i][0][0] = True\nfor j in range(W+1):\n dp[0][j][0] = True\nfor i in range(H):\n for j in range(W):\n diff = diffs[i][j]\n for k in range(r_k):\n dp[i + 1][j + 1][abs(k - diff)] = dp[i + 1][j][k] or dp[i][j +\n 1][k] or dp[i + 1][j + 1][abs(k - diff)]\n if k + diff < r_k:\n dp[i + 1][j + 1][k + diff] = dp[i + 1][j][k] or dp[i][j +\n 1][k] or dp[i + 1][j + 1][k+diff]\n\nfor k in range(r_k):\n if dp[H][W][k]:\n print(k)\n break\n", "code2": "H, 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)]\ndiffs = [[abs(A[i][j] - B[i][j]) for j in range(W)] for i in range(H)]\nmax_diff = 0\nfor diff in diffs:\n max_diff = max(max_diff, max(diff))\nr_k = max_diff*(H+W)\ndp = [[[False] * r_k for _ in range(W)] for _ in range(H)]\ndp[0][0][0] = True\nfor i in range(H):\n for j in range(W):\n diff = diffs[i][j]\n dp_ = dp[i][j]\n if j < W-1:\n dpj = dp[i][j + 1]\n for k in range(r_k):\n if dp_[k] == True:\n dpj[abs(k - diff)] = True\n if k+diff 1:\n pairs.append((LL+1, LR))\n LL += 1\n LR -= 1\n while RR - RL > 1:\n pairs.append((RL+1, RR))\n RL += 1\n RR -= 1\n for i in range(M):\n print(*pairs[i])\n\n\nif __name__ == '__main__':\n inputs = read()\n solve(*inputs)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1588473517", "date2": "1597290417", "bleu_score": "0.6555727707942819", "code1_test_status": [0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 6, "input": "20 9\n", "actual_output": "1 20\n2 19\n3 18\n4 17\n5 16\n6 15\n7 14\n8 13\n9 12\n", "expected_output": "1 10\n2 9\n3 8\n4 7\n5 6\n11 19\n12 18\n13 17\n14 16\n\n", "anno_code": ["from collections import deque\nfrom itertools import product\nimport sys\nimport math\n\nsys.setrecursionlimit(200000) # (0): NO CHANGE\ninput = sys.stdin.readline # (1): input=\n\n\ndef read(): # (2): read=\n N, M = map(int, input().strip().split())\n return N, M\n\n\ndef solve(N, M): # (3): solve=\n pairs = []\n n = N \n for m in range(M):\n pairs.append((m+1, n-m))\n \n for a, b in pairs:\n print(a, b)\n\nif __name__ == '__main__':\n inputs = read()\n solve(*inputs)\n"], "anno_status": [true], "diff_content": " from collections import deque\n from itertools import product\n import sys\n import math\n \n sys.setrecursionlimit(200000)\n input = sys.stdin.readline\n \n \n def read():\n N, M = map(int, input().strip().split())\n return N, M\n \n \n def solve(N, M):\n+ H = (N-1) \n+ LL = 0\n+ LR = (H \n+ RL = N - (H - H\n+ RR = N\n pairs = []\n- n = N \n- for m in range(M):\n- pairs.append((m+1, n-m))\n- \n- for a, b in pairs:\n- print(a, b)\n+ while LR - LL > 1:\n+ pairs.append((LL+1, LR))\n+ LL += 1\n+ LR -= 1\n+ while RR - RL > 1:\n+ pairs.append((RL+1, RR))\n+ RL += 1\n+ RR -= 1\n+ for i in range(M):\n+ print(*pairs[i])\n+\n \n if __name__ == '__main__':\n inputs = read()\n solve(*inputs)\n \n", "FL_content": "\n from collections import deque\n from itertools import product\n import sys\n import math\n \n sys.setrecursionlimit(200000)\n input = sys.stdin.readline\n \n \n def read():\n N, M = map(int, input().strip().split())\n return N, M\n \n \n def solve(N, M):\n pairs = []\n- n = N \n for m in range(M):\n- pairs.append((m+1, n-m))\n \n for a, b in pairs:\n print(a, b)\n \n if __name__ == '__main__':\n inputs = read()\n solve(*inputs)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u842689614", "problem_id": "p04014", "submission1_id": "s461733151-FL", "submission2_id": "s079261653", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\ns=int(input())\n\nb_ans=1\n\nif n==s:\n b_ans=n+1\nif b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\n\nif b_ans==1:\n for p in range(1,int(n**0.5)):\n b=int(n/p)\n q=n-p*b\n if s==p+q and q0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\nif b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n\n if b.is_integer() and 0<=s-pn**0.5:\n b_ans=int(b)\n break\n\nif b_ans!=1:\n print(b_ans)\nelse:\n print(-1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566167907", "date2": "1566170554", "bleu_score": "0.8699322293300966", "code1_test_status": [1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 48, "total_score": 105, "input": "87654\n4\n", "actual_output": "-1\n", "expected_output": "43826\n\n", "anno_code": ["n=int(input()) # (0): n=87654\ns=int(input()) # (1): s=4\n\nb_ans=1 # (2): b_ans=1\n\nif n==s: # (3): NO CHANGE\n b_ans=n+1\nif b_ans==1: # (4): NO CHANGE\n for b in range(2,int(n**0.5)+1): # (5): b=2 (61): b=3 ... (4402): NO CHANGE\n nn=n # (6): nn=87654 (62): nn=87654 ... (4389): nn=87654\n st=[] # (7): st=[] (63): st=[] ... (4390): st=[]\n while(nn>0): # (8): NO CHANGE (11): NO CHANGE ... (4400): NO CHANGE\n st.append(nn%b) # (9): st=[0] (12): st=[0, 1.0] ... (4398): st=[38, 0.0, 1.0]\n nn=(nn-st[-1])/b # (10): nn=43827.0 (13): nn=21913.0 ... (4399): nn=0.0\n \n if sum(st)==s: # (60): NO CHANGE (98): NO CHANGE ... (4401): NO CHANGE\n b_ans=b\n break\n\n\nif b_ans==1: # (4403): NO CHANGE\n for p in range(1,int(n**0.5)): # (4404): p=1 (4408): p=2 ... (5584): NO CHANGE\n b=int(n/p) # (4405): b=87654 (4409): b=43827 ... (5581): b=297\n q=n-p*b # (4406): q=0 (4410): NO CHANGE ... (5582): q=39\n if s==p+q and q0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n-\n if b_ans==1:\n- for p in range(1,int(n**0.5)):\n- b=int(n/p)\n- q=n-p*b\n- if s==p+q and qn**0.5:\n+ b_ans=int(b)\n break\n \n if b_ans!=1:\n print(b_ans)\n else:\n print(-1)\n", "FL_content": "\n n=int(input())\n s=int(input())\n \n b_ans=1\n \n if n==s:\n b_ans=n+1\n if b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n \n if b_ans==1:\n for p in range(1,int(n**0.5)):\n b=int(n/p)\n q=n-p*b\n- if s==p+q and q cnt_1:\n return cnt_0, tmp_0\n else:\n return cnt_1, tmp_1\n else:\n tmp[j] = 0\n return cnt, tmp\n\nr = [-1] * n\ncnt, r = max_count(r, 0)\nprint(cnt)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586323499", "date2": "1586382994", "bleu_score": "0.6479336043898812", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 88, "total_score": 103, "input": "3\n1\n3 1\n1\n2 1\n1\n1 0\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["n = int(input()) # (0): n=3\n\ndef trust_remark(i, r): # (1): trust_remark=\n \n people = [-1] * n # (8): people=[-1, -1, -1] (17): people=[-1, -1, -1] (26): people=[-1, -1, -1]\n people[i] = 1 # (9): people=[1, -1, -1] (18): people=[-1, 1, -1] (27): people=[-1, -1, 1]\n for x, y in r: # (10): x=3, y=1 (12): n=3, trust_remark=, check=, remarks=[[1, -1, 1]], a=1 ... (30): n=3, trust_remark=, check=, remarks, a=1\n people[x - 1] = y # (11): people=[1, -1, 1] (20): NO CHANGE (29): people=[0, -1, 1]\n return people\n\ndef check(x, y): # (2): check=\n new_list = [] # (42): new_list=[] (54): new_list=[] ... (128): new_list=[]\n for a, b in zip(x, y): # (43): a=1, b=1 (46): a=-1, b=-1 ... (132): b=-1\n if abs(a) != abs(b): # (44): NO CHANGE (47): NO CHANGE ... (133): n=3, trust_remark=, check=, remarks=[[1, -1, 1], [-1, 1, -1], [0, -1, 1]], i=2, a=1, r=[(1, 0)], dp=[], cnt_max=0, r_i=[0, -1, 1], cnt=0, tmp=[0, 0, 1], j=2, r_j=[0, -1, 1]\n return False\n else:\n new_list.append(max(a, b)) # (45): new_list=[1] (48): new_list=[1, -1] ... (131): new_list=[0]\n return new_list\n\nremarks = [] # (3): remarks=[]\nfor i in range(n): # (4): i=0 (13): i=1 ... (31): NO CHANGE\n a = int(input()) # (5): a=1 (14): NO CHANGE (23): NO CHANGE\n r = [tuple(map(int, input().split())) for _ in range(a)] # (6): r=[(3, 1)] (15): r=[(2, 1)] (24): r=[(1, 0)]\n remarks.append(trust_remark(i, r)) # (7): NO CHANGE (16): NO CHANGE (25): NO CHANGE\n\ndp = [] # (32): dp=[]\ncnt_max = 0 # (33): cnt_max=0\nfor i, r_i in enumerate(remarks): # (34): i=0, r_i=[1, -1, 1] (105): i=1, r_i=[-1, 1, -1] ... (138): NO CHANGE\n if i in dp: continue # (35): NO CHANGE (106): NO CHANGE (121): NO CHANGE\n cnt = 0 # (36): cnt=0 (107): NO CHANGE (122): NO CHANGE\n tmp = [0] * i + r_i[i:] # (37): tmp=[1, -1, 1] (108): tmp=[0, 1, -1] (123): tmp=[0, 0, 1]\n for j, r_j in enumerate(remarks[i:]): # (38): j=0, r_j=[1, -1, 1] (66): j=1, r_j=[-1, 1, -1] ... (124): j=0, r_j=[0, -1, 1]\n j += i # (39): NO CHANGE (67): NO CHANGE ... (125): j=2\n if r_i[j] == 0: continue # (40): NO CHANGE (68): NO CHANGE ... (126): NO CHANGE\n if check(tmp, r_j): # (41): x=[1, -1, 1], y=[1, -1, 1] (69): x=[1, -1, 1], y=[-1, 1, -1] ... (127): x=[0, 0, 1], y=[0, -1, 1]\n tmp = check(tmp, r_j) # (53): x=[1, -1, 1], y=[1, -1, 1] (81): x=[1, -1, 1], y=[-1, 1, -1]\n cnt += 1 # (65): cnt=1 (93): cnt=2\n elif r_i[j] == -1: # (101): NO CHANGE (116): NO CHANGE (134): NO CHANGE\n tmp[j] = 0\n continue\n else:\n cnt = 0 # (102): cnt=0 (117): NO CHANGE (135): NO CHANGE\n break # (103): NO CHANGE (118): NO CHANGE (136): NO CHANGE\n if cnt != 0: # (104): NO CHANGE (119): NO CHANGE (137): NO CHANGE\n for j, x in enumerate(tmp):\n if x == 1: dp.append(j)\n cnt_max = max(cnt, cnt_max)\n\nprint(cnt_max)"], "anno_status": [false], "diff_content": " n = int(input())\n \n-def trust_remark(i, r):\n+\n+def make_remark_list(i, r):\n \n people = [-1] * n\n people[i] = 1\n for x, y in r:\n people[x - 1] = y\n return people\n \n+\n def check(x, y):\n new_list = []\n for a, b in zip(x, y):\n- if abs(a) != abs(b):\n+ a, b = min(a, b), max(a, b)\n+ if (a, b) == (0, 1):\n return False\n+ elif (a, b) == (-1, 0):\n+ new_list.append(0)\n else:\n new_list.append(max(a, b))\n return new_list\n \n+\n remarks = []\n for i in range(n):\n a = int(input())\n r = [tuple(map(int, input().split())) for _ in range(a)]\n- remarks.append(trust_remark(i, r))\n-\n-dp = []\n-cnt_max = 0\n-for i, r_i in enumerate(remarks):\n- if i in dp: continue\n- cnt = 0\n- tmp = [0] * i + r_i[i:]\n- for j, r_j in enumerate(remarks[i:]):\n- j += i\n- if r_i[j] == 0: continue\n- if check(tmp, r_j):\n- tmp = check(tmp, r_j)\n- cnt += 1\n- elif r_i[j] == -1:\n- tmp[j] = 0\n+ remarks.append(make_remark_list(i, r))\n+\n+def max_count(r, cnt, i = 0):\n+ tmp = r\n+ for j, r_j in enumerate(remarks):\n+ if j < i: continue\n+ if tmp[j] == 0:\n continue\n+ elif tmp[j] == 1:\n+ if check(tmp, r_j):\n+ tmp = check(tmp, r_j)\n+ cnt += 1\n+ else:\n+ cnt = 0\n+ break\n else:\n- cnt = 0\n- break\n- if cnt != 0:\n- for j, x in enumerate(tmp):\n- if x == 1: dp.append(j)\n- cnt_max = max(cnt, cnt_max)\n-\n-print(cnt_max)\n+ tmp[j] = 1\n+ if check(tmp, r_j):\n+ cnt_1, tmp_1 = max_count(tmp, cnt, j)\n+ tmp[j] = 0\n+ cnt_0, tmp_0 = max_count(tmp, cnt, j)\n+ if cnt_0 > cnt_1:\n+ return cnt_0, tmp_0\n+ else:\n+ return cnt_1, tmp_1\n+ else:\n+ tmp[j] = 0\n+ return cnt, tmp\n+\n+r = [-1] * n\n+cnt, r = max_count(r, 0)\n+print(cnt)\n", "FL_content": "\n n = int(input())\n \n def trust_remark(i, r):\n \n people = [-1] * n\n people[i] = 1\n for x, y in r:\n people[x - 1] = y\n return people\n \n def check(x, y):\n new_list = []\n for a, b in zip(x, y):\n if abs(a) != abs(b):\n return False\n else:\n new_list.append(max(a, b))\n return new_list\n \n remarks = []\n for i in range(n):\n a = int(input())\n r = [tuple(map(int, input().split())) for _ in range(a)]\n remarks.append(trust_remark(i, r))\n \n dp = []\n cnt_max = 0\n for i, r_i in enumerate(remarks):\n if i in dp: continue\n cnt = 0\n- tmp = [0] * i + r_i[i:]\n for j, r_j in enumerate(remarks[i:]):\n j += i\n if r_i[j] == 0: continue\n if check(tmp, r_j):\n tmp = check(tmp, r_j)\n cnt += 1\n elif r_i[j] == -1:\n tmp[j] = 0\n continue\n else:\n cnt = 0\n break\n if cnt != 0:\n for j, x in enumerate(tmp):\n if x == 1: dp.append(j)\n cnt_max = max(cnt, cnt_max)\n \n print(cnt_max)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 49 }, { "user_id": "u842964692", "problem_id": "p03164", "submission1_id": "s106776575-FL", "submission2_id": "s065866127", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nN,W=map(int,input().split())\n\nw,v=[0],[0]\n\nfor _ in range(N):\n wi,vi=map(int,input().split())\n w.append(wi)\n v.append(vi)\n\ndp=[[10**12 for _ in range(N*max(v)+1)] for _ in range(N+1)]\ndp[0][0]=0\n\nfor i in range(N):\n for sum_v in range(N*max(v)+1):\n if sum_v-v[i]>=0:\n dp[i+1][sum_v]=min(dp[i][sum_v-v[i]]+w[i],dp[i][sum_v])\n else:\n dp[i+1][sum_v]=dp[i][sum_v]\n\n\nans=0\n\nfor sum_v in range(N*max(v)+1):\n if dp[N][sum_v]<=W:\n ans=max(ans,sum_v)\nprint(ans) \n", "code2": "\n\nN,W=map(int,input().split())\n\nw,v=[0],[0]\n\nfor _ in range(N):\n wi,vi=map(int,input().split())\n w.append(wi)\n v.append(vi)\n\ndp=[[10**12 for _ in range(N*max(v)+1)] for _ in range(N+1)]\ndp[0][0]=0\n\nfor i in range(N):\n for sum_v in range(N*max(v)+1):\n if sum_v-v[i+1]>=0:\n dp[i+1][sum_v]=min(dp[i][sum_v-v[i+1]]+w[i+1],dp[i][sum_v])\n else:\n dp[i+1][sum_v]=dp[i][sum_v]\n\nans=0\n\nfor sum_v in range(N*max(v)+1):\n if dp[N][sum_v]<=W:\n ans=max(ans,sum_v)\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1585778269", "date2": "1585778717", "bleu_score": "0.9776862415905002", "code1_test_status": [0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 24, "total_score": 103, "input": "3 3\n6 9\n5 5\n0 4\n6 5\n3 5\n0 3\n", "actual_output": "0\n", "expected_output": "4\n\n", "anno_code": ["\n\nN,W=map(int,input().split()) # (0): N=3, W=3\n\nw,v=[0],[0] # (1): w=[0], v=[0]\n\nfor _ in range(N): # (2): _=0 (6): _=1 ... (14): NO CHANGE\n wi,vi=map(int,input().split()) # (3): wi=6, vi=9 (7): wi=5, vi=5 (11): wi=0, vi=4\n w.append(wi) # (4): w=[0, 6] (8): w=[0, 6, 5] (12): w=[0, 6, 5, 0]\n v.append(vi) # (5): v=[0, 9] (9): v=[0, 9, 5] (13): v=[0, 9, 5, 4]\n\ndp=[[10**12 for _ in range(N*max(v)+1)] for _ in range(N+1)] # (15): dp\ndp[0][0]=0 # (16): dp\n\nfor i in range(N): # (17): i=0 (103): i=1 ... (275): NO CHANGE\n for sum_v in range(N*max(v)+1): # (18): sum_v=0 (21): sum_v=1 ... (274): NO CHANGE\n if sum_v-v[i]>=0: # (19): NO CHANGE (22): NO CHANGE ... (272): NO CHANGE\n dp[i+1][sum_v]=min(dp[i][sum_v-v[i]]+w[i],dp[i][sum_v]) # (20): dp (23): NO CHANGE ... (273): NO CHANGE\n else:\n dp[i+1][sum_v]=dp[i][sum_v] # (106): dp (109): NO CHANGE ... (204): NO CHANGE\n\n\nans=0 # (276): ans=0\n\nfor sum_v in range(N*max(v)+1): # (277): sum_v=0 (280): sum_v=1 ... (334): NO CHANGE\n if dp[N][sum_v]<=W: # (278): NO CHANGE (281): NO CHANGE ... (333): NO CHANGE\n ans=max(ans,sum_v) # (279): NO CHANGE\nprint(ans) \n"], "anno_status": [true], "diff_content": " \n \n N,W=map(int,input().split())\n \n w,v=[0],[0]\n \n for _ in range(N):\n wi,vi=map(int,input().split())\n w.append(wi)\n v.append(vi)\n \n dp=[[10**12 for _ in range(N*max(v)+1)] for _ in range(N+1)]\n dp[0][0]=0\n \n for i in range(N):\n for sum_v in range(N*max(v)+1):\n- if sum_v-v[i]>=0:\n- dp[i+1][sum_v]=min(dp[i][sum_v-v[i]]+w[i],dp[i][sum_v])\n+ if sum_v-v[i+1]>=0:\n+ dp[i+1][sum_v]=min(dp[i][sum_v-v[i+1]]+w[i+1],dp[i][sum_v])\n else:\n dp[i+1][sum_v]=dp[i][sum_v]\n \n-\n ans=0\n \n for sum_v in range(N*max(v)+1):\n if dp[N][sum_v]<=W:\n ans=max(ans,sum_v)\n-print(ans) \n+print(ans)\n \n", "FL_content": "\n \n \n N,W=map(int,input().split())\n \n w,v=[0],[0]\n \n for _ in range(N):\n wi,vi=map(int,input().split())\n w.append(wi)\n v.append(vi)\n \n dp=[[10**12 for _ in range(N*max(v)+1)] for _ in range(N+1)]\n dp[0][0]=0\n \n for i in range(N):\n for sum_v in range(N*max(v)+1):\n if sum_v-v[i]>=0:\n dp[i+1][sum_v]=min(dp[i][sum_v-v[i]]+w[i],dp[i][sum_v])\n else:\n dp[i+1][sum_v]=dp[i][sum_v]\n \n \n ans=0\n \n for sum_v in range(N*max(v)+1):\n if dp[N][sum_v]<=W:\n ans=max(ans,sum_v)\n print(ans) \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 29 }, { "user_id": "u871201743", "problem_id": "p03164", "submission1_id": "s504213395-FL", "submission2_id": "s083495067", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\n\nMAX_VAL = 100000\nN, W = map(int, input().split())\n\ndp = defaultdict(lambda: 1e9)\ndp[0] = 1\nans = 0\nfor _ in range(N):\n w, v = map(int, input().split())\n for k in range(MAX_VAL, -1, -1):\n dp[k + v] = min(dp[k+v], dp[k] + w)\n if dp[k + v] <= W:\n ans = max(ans, k + v)\n\n\nprint(ans)\n", "code2": "from collections import defaultdict\n\nN, W = map(int, input().split())\n\ndp = defaultdict(lambda: 1e9)\ndp[0] = 0\nans = 0\nfor _ in range(N):\n w, v = map(int, input().split())\n keys = sorted(dp.keys(), reverse=True)\n for k in keys:\n dp[k + v] = min(dp[k + v], dp[k] + w)\n if dp[k + v] <= W:\n ans = max(ans, k + v)\n\n\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575428122", "date2": "1575428647", "bleu_score": "0.8546623767515183", "code1_test_status": [0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1], "code1_test_score": 79, "total_score": 103, "input": "2 0\n5 6\n0 29\n8 191\n", "actual_output": "0\n", "expected_output": "29\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " from collections import defaultdict\n \n-MAX_VAL = 100000\n N, W = map(int, input().split())\n \n dp = defaultdict(lambda: 1e9)\n-dp[0] = 1\n+dp[0] = 0\n ans = 0\n for _ in range(N):\n w, v = map(int, input().split())\n- for k in range(MAX_VAL, -1, -1):\n- dp[k + v] = min(dp[k+v], dp[k] + w)\n+ keys = sorted(dp.keys(), reverse=True)\n+ for k in keys:\n+ dp[k + v] = min(dp[k + v], dp[k] + w)\n if dp[k + v] <= W:\n ans = max(ans, k + v)\n \n \n print(ans)\n \n", "FL_content": "\n from collections import defaultdict\n \n MAX_VAL = 100000\n N, W = map(int, input().split())\n \n dp = defaultdict(lambda: 1e9)\n-dp[0] = 1\n ans = 0\n for _ in range(N):\n w, v = map(int, input().split())\n for k in range(MAX_VAL, -1, -1):\n dp[k + v] = min(dp[k+v], dp[k] + w)\n if dp[k + v] <= W:\n ans = max(ans, k + v)\n \n \n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u752907966", "problem_id": "p03031", "submission1_id": "s771065496-FL", "submission2_id": "s246022367", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import product \nn,m = map(int,input().split())\nlamp = [list(map(int,input().split())) for _ in range(m)]\np = list(map(int,input().split()))\n\nans = 0\nfor i in product('01',repeat=n):\n tmp = 0\n ac = True\n for k,b in enumerate(lamp):\n for a in b[1:]:\n tmp += int(i[a-1])\n tmp %= 2\n if p[k] != tmp:\n ac = False\n if ac == True:\n ans += 1\nprint(ans)", "code2": "from itertools import product\nn,m = map(int,input().split())\nlamp = [list(map(int,input().split())) for _ in range(m)]\np = list(map(int,input().split()))\n\nans = 0\nfor i in product([0,1],repeat=n):\n ac = True\n for k,b in enumerate(lamp):\n tmp = 0\n for a in b[1:]:\n tmp += i[a-1]\n if p[k] != tmp%2:\n ac = False\n break\n if ac:\n ans += 1\nprint(ans)\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591716950", "date2": "1591792415", "bleu_score": "0.9212470360197424", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "2 3\n2 1 2\n1 1\n1 2\n0 1 0\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": "-from itertools import product \n+from itertools import product\n n,m = map(int,input().split())\n lamp = [list(map(int,input().split())) for _ in range(m)]\n p = list(map(int,input().split()))\n \n ans = 0\n-for i in product('01',repeat=n):\n- tmp = 0\n+for i in product([0,1],repeat=n):\n ac = True\n for k,b in enumerate(lamp):\n+ tmp = 0\n for a in b[1:]:\n- tmp += int(i[a-1])\n- tmp %= 2\n- if p[k] != tmp:\n+ tmp += i[a-1]\n+ if p[k] != tmp%2:\n ac = False\n- if ac == True:\n+ break\n+ if ac:\n ans += 1\n print(ans)\n+\n+\n", "FL_content": "\n from itertools import product \n n,m = map(int,input().split())\n lamp = [list(map(int,input().split())) for _ in range(m)]\n p = list(map(int,input().split()))\n \n ans = 0\n for i in product('01',repeat=n):\n tmp = 0\n ac = True\n for k,b in enumerate(lamp):\n for a in b[1:]:\n tmp += int(i[a-1])\n tmp %= 2\n if p[k] != tmp:\n ac = False\n if ac == True:\n ans += 1\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u386131832", "problem_id": "p03838", "submission1_id": "s272693399-FL", "submission2_id": "s459163489", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y=[int(i) for i in input().split()]\nif 0<=x and 0<=y:\n if x>y:\n print(x-y+1)\n else:\n print(y-x)\n\nelif 0<=x and y<0:\n if y==0:\n print(abs(abs(x)-y)+1)\n elif abs(y)==abs(x):\n print(1)\n else:\n print(abs(abs(x)-y)+1)\n\nelif x<0 and 0<=y:\n if y==0:\n print(abs(abs(x)-y))\n elif abs(y)==abs(x):\n print(1)\n else:\n print(abs(abs(x)-y)+1)\n\nelif x<0 and y<0:\n if abs(x)y:\n print(x-y+2)\n sys.exit()\n else:\n print(y-x)\n sys.exit()\n\nelif 0<=x and y<0:\n print(abs(abs(y)-x)+1)\n sys.exit()\n\nelif x<0 and 0<=y:\n if y==0:\n print(abs(abs(x)-y))\n sys.exit()\n else:\n print(abs(abs(x)-y)+1)\n sys.exit()\n\nelif x<0 and y<0:\n if abs(x)y: # (2): NO CHANGE\n print(x-y+1)\n else:\n print(y-x)\n\nelif 0<=x and y<0:\n if y==0:\n print(abs(abs(x)-y)+1)\n elif abs(y)==abs(x):\n print(1)\n else:\n print(abs(abs(x)-y)+1)\n\nelif x<0 and 0<=y:\n if y==0:\n print(abs(abs(x)-y))\n elif abs(y)==abs(x):\n print(1)\n else:\n print(abs(abs(x)-y)+1)\n\nelif x<0 and y<0:\n if abs(x)y:\n- print(x-y+1)\n+ print(x-y+2)\n+ sys.exit()\n else:\n print(y-x)\n+ sys.exit()\n \n elif 0<=x and y<0:\n- if y==0:\n- print(abs(abs(x)-y)+1)\n- elif abs(y)==abs(x):\n- print(1)\n- else:\n- print(abs(abs(x)-y)+1)\n+ print(abs(abs(y)-x)+1)\n+ sys.exit()\n \n elif x<0 and 0<=y:\n if y==0:\n print(abs(abs(x)-y))\n- elif abs(y)==abs(x):\n- print(1)\n+ sys.exit()\n else:\n print(abs(abs(x)-y)+1)\n+ sys.exit()\n \n elif x<0 and y<0:\n if abs(x)y:\n print(x-y+1)\n else:\n print(y-x)\n \n elif 0<=x and y<0:\n if y==0:\n print(abs(abs(x)-y)+1)\n elif abs(y)==abs(x):\n print(1)\n else:\n print(abs(abs(x)-y)+1)\n \n elif x<0 and 0<=y:\n if y==0:\n print(abs(abs(x)-y))\n elif abs(y)==abs(x):\n print(1)\n else:\n print(abs(abs(x)-y)+1)\n \n elif x<0 and y<0:\n if abs(x)\n x = array[r] # (5): x=22\n i = p-1 # (6): i=-1\n for j in range(p, r): # (7): j=0 (9): j=1 ... (47): NO CHANGE\n if array[j] <= x: # (8): NO CHANGE (10): NO CHANGE ... (44): NO CHANGE\n i += 1 # (11): i=0 (15): i=1 ... (45): i=8\n array[i], array[j] = array[j], array[i] # (12): array=[19, 23, 9, 9, 23, 8, 7, 4, 13, -1, 10, 22] (16): array=[19, 9, 23, 9, 23, 8, 7, 4, 13, -1, 10, 22] ... (46): array=[19, 9, 9, 8, 7, 4, 13, -1, 10, 23, 23, 22]\n array[i+1], array[r] = array[r], array[i+1] # (48): partition=, n=12, array=[19, 9, 9, 8, 7, 4, 13, -1, 10, 22, 23, 23], buff=[23, 19, 9, 9, 23, 8, 7, 4, 13, -1, 10, 22], p=9\n return i+1\n\nn = int(input()) # (1): n=12\narray = [int(a) for a in input().split()] # (2): array=[23, 19, 9, 9, 23, 8, 7, 4, 13, -1, 10, 22]\nbuff = array[:] # (3): buff=[23, 19, 9, 9, 23, 8, 7, 4, 13, -1, 10, 22]\np = partition(array, 0, n-1) # (4): p=0, r=11\n\nfor a in array: # (49): a=19 (53): a=9 ... (92): NO CHANGE\n if a == buff[-1]: # (50): NO CHANGE (54): NO CHANGE ... (93): NO CHANGE\n print(\"[{0}]\".format(a), end=\" \") # (87): NO CHANGE\n elif a == array[-1]: # (51): NO CHANGE (55): NO CHANGE ... (94): NO CHANGE\n print(a) # (91): NO CHANGE (95): NO CHANGE\n else:\n print(a, end=\" \") # (52): NO CHANGE (56): NO CHANGE ... (84): NO CHANGE\n"], "anno_status": [true], "diff_content": " def partition(array, p, r):\n x = array[r]\n i = p-1\n for j in range(p, r):\n if array[j] <= x:\n i += 1\n array[i], array[j] = array[j], array[i]\n array[i+1], array[r] = array[r], array[i+1]\n+ a1 = array[:i+1]\n+ a2 = \"[\" + str(array[i+1]) + \"]\"\n+ a3 = array[i+2:]\n+ array = a1[:]\n+ array.append(a2)\n+ array += a3\n+ print(*array)\n return i+1\n \n n = int(input())\n array = [int(a) for a in input().split()]\n-buff = array[:]\n p = partition(array, 0, n-1)\n \n-for a in array:\n- if a == buff[-1]:\n- print(\"[{0}]\".format(a), end=\" \")\n- elif a == array[-1]:\n- print(a)\n- else:\n- print(a, end=\" \")\n-\n", "FL_content": "\n def partition(array, p, r):\n x = array[r]\n i = p-1\n for j in range(p, r):\n if array[j] <= x:\n i += 1\n array[i], array[j] = array[j], array[i]\n array[i+1], array[r] = array[r], array[i+1]\n return i+1\n \n n = int(input())\n array = [int(a) for a in input().split()]\n buff = array[:]\n-p = partition(array, 0, n-1)\n \n for a in array:\n if a == buff[-1]:\n print(\"[{0}]\".format(a), end=\" \")\n elif a == array[-1]:\n print(a)\n else:\n print(a, end=\" \")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 23 }, { "user_id": "u641446860", "problem_id": "p02843", "submission1_id": "s903700700-FL", "submission2_id": "s238201608", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X = int(input())\na = [100, 101, 102, 103, 104, 105]\ndp = [[False]*100010 for _ in range(10)]\ndp[0][0] = True\nfor i in range(6):\n for j in range(100001):\n dp[i+1][j] |= dp[i][j]\n if j >= a[i]:\n dp[i+1][j] |= dp[i][j-a[i]]\n\nif dp[6][X]:\n print(1)\nelse:\n print(0)", "code2": "X = int(input())\na = [100, 101, 102, 103, 104, 105]\ndp = [[False]*100010 for _ in range(10)]\ndp[0][0] = True\n\nfor j in range(X+1):\n for i in range(6):\n dp[i+1][j] |= dp[i][j]\n if j >= a[i]:\n dp[i+1][j] |= dp[i][j-a[i]]\n dp[i+1][j] |= dp[i+1][j-a[i]]\nif dp[6][X]:\n print(1)\nelse:\n print(0)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1588025576", "date2": "1588039327", "bleu_score": "0.8573583600742151", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 23, "total_score": 26, "input": "622\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " X = int(input())\n a = [100, 101, 102, 103, 104, 105]\n dp = [[False]*100010 for _ in range(10)]\n dp[0][0] = True\n-for i in range(6):\n- for j in range(100001):\n+\n+for j in range(X+1):\n+ for i in range(6):\n dp[i+1][j] |= dp[i][j]\n if j >= a[i]:\n dp[i+1][j] |= dp[i][j-a[i]]\n-\n+ dp[i+1][j] |= dp[i+1][j-a[i]]\n if dp[6][X]:\n print(1)\n else:\n print(0)\n", "FL_content": "\n X = int(input())\n a = [100, 101, 102, 103, 104, 105]\n dp = [[False]*100010 for _ in range(10)]\n dp[0][0] = True\n for i in range(6):\n- for j in range(100001):\n dp[i+1][j] |= dp[i][j]\n if j >= a[i]:\n dp[i+1][j] |= dp[i][j-a[i]]\n \n if dp[6][X]:\n print(1)\n else:\n print(0)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u146575240", "problem_id": "p03523", "submission1_id": "s339328655-FL", "submission2_id": "s563442790", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nS = str(input())\n\n\n\nif S.find('AA') == -1 or S.find('KA') == -1 or S.find('IA') == -1:\n S2 = S.replace('A','')\n if S2 == 'KIHBR':\n print('YES')\n else:\n print('NO')\nelse:\n print('NO')", "code2": "\nS = str(input())\n\n\n\nif S.find('AA') == -1 :\n if S.find('KA') == -1 :\n if S.find('IA') == -1:\n S2 = S.replace('A','')\n if S2 == 'KIHBR':\n print('YES')\n else:\n print('NO')\n else:\n print('NO')\n else:\n print('NO')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567273149", "date2": "1567274001", "bleu_score": "0.6062149647349748", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 101, "total_score": 102, "input": "AAKIAHBAARA\n", "actual_output": "YES\n", "expected_output": "NO\n", "anno_code": ["\nS = str(input()) # (0): S=AAKIAHBAARA\n\n\n\nif S.find('AA') == -1 or S.find('KA') == -1 or S.find('IA') == -1: # (1): NO CHANGE\n S2 = S.replace('A','') # (2): S2=KIHBR\n if S2 == 'KIHBR': # (3): NO CHANGE\n print('YES')\n else:\n print('NO')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " \n S = str(input())\n \n \n \n-if S.find('AA') == -1 or S.find('KA') == -1 or S.find('IA') == -1:\n- S2 = S.replace('A','')\n- if S2 == 'KIHBR':\n- print('YES')\n+if S.find('AA') == -1 :\n+ if S.find('KA') == -1 :\n+ if S.find('IA') == -1:\n+ S2 = S.replace('A','')\n+ if S2 == 'KIHBR':\n+ print('YES')\n+ else:\n+ print('NO')\n+ else:\n+ print('NO')\n else:\n print('NO')\n else:\n print('NO')\n", "FL_content": "\n \n S = str(input())\n \n \n \n-if S.find('AA') == -1 or S.find('KA') == -1 or S.find('IA') == -1:\n S2 = S.replace('A','')\n- if S2 == 'KIHBR':\n print('YES')\n else:\n print('NO')\n else:\n print('NO')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u842170774", "problem_id": "p02839", "submission1_id": "s816379753-FL", "submission2_id": "s472297078", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nMI=lambda:map(int,input().split())\nLI=lambda:list(map(int,input().split()))\n\nH,W=MI()\nA=[LI() for _ in [0]*H]\nB=[LI() for _ in [0]*H]\n \nG=[[set() for i in range(W)] for j in range(H)]\ndif=A[0][0]-B[0][0]\nG[0][0].add(0)\n\nM=80*(H+W)\n\nfor h in range(H):\n for w in range(W):\n d=A[h][w]-B[h][w]\n for a in G[h][w]:\n if h!=H-1:\n G[h+1][w].add(abs(a+d))\n G[h+1][w].add(abs(a-d))\n if w!=W-1:\n G[h][w+1].add(abs(a+d))\n G[h][w+1].add(abs(a-d))\n \nres=set()\nfor a in G[H-1][W-1]:\n res.add(a)\nd=A[H-1][W-1]-B[H-1][W-1]\nfor a in G[H-1][W-1]:\n res.add(abs(a+d))\n res.add(abs(a-d))\n\nres=sorted(list(res))\nprint(min(res))\n", "code2": "import sys\ninput = sys.stdin.readline\nMI=lambda:map(int,input().split())\nLI=lambda:list(map(int,input().split()))\n\nH,W=MI()\nA=[LI() for _ in [0]*H]\nB=[LI() for _ in [0]*H]\n\nG=[[set() for i in range(W)] for j in range(H)]\nG[0][0].add(0)\n\nfor h in range(H):\n for w in range(W):\n d=A[h][w]-B[h][w]\n for a in G[h][w]:\n if h!=H-1:\n G[h+1][w].add(abs(a+d))\n G[h+1][w].add(abs(a-d))\n if w!=W-1:\n G[h][w+1].add(abs(a+d))\n G[h][w+1].add(abs(a-d))\n\nres=set()\nd=A[H-1][W-1]-B[H-1][W-1]\nfor a in G[H-1][W-1]:\n res.add(abs(a+d))\n res.add(abs(a-d))\n\nres=sorted(list(res))\nprint(min(res))", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601099564", "date2": "1601099920", "bleu_score": "0.8873583332830381", "code1_test_status": [0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1], "code1_test_score": 81, "total_score": 102, "input": "1 3\n-1 10 120\n9 14 3\n1 1 0\n3 0 6\n", "actual_output": "6\n", "expected_output": "103\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\nMI=lambda:map(int,input().split()) # (1): MI= at 0x000002ACBABD5B40>\nLI=lambda:list(map(int,input().split())) # (2): LI= at 0x000002ACBABD5C60>\n\nH,W=MI() # (3): H=1, W=3\nA=[LI() for _ in [0]*H] # (4): A\nB=[LI() for _ in [0]*H] # (5): B\n \nG=[[set() for i in range(W)] for j in range(H)] # (6): G\ndif=A[0][0]-B[0][0] # (7): dif=-10\nG[0][0].add(0) # (8): G\n\nM=80*(H+W) # (9): M=320\n\nfor h in range(H): # (10): h=0 (37): NO CHANGE\n for w in range(W): # (11): w=0 (19): w=1 ... (36): NO CHANGE\n d=A[h][w]-B[h][w] # (12): d=-10 (20): d=-4 (28): d=117\n for a in G[h][w]: # (13): a=0 (18): NO CHANGE ... (35): NO CHANGE\n if h!=H-1: # (14): NO CHANGE (22): NO CHANGE ... (33): NO CHANGE\n G[h+1][w].add(abs(a+d))\n G[h+1][w].add(abs(a-d))\n if w!=W-1: # (15): NO CHANGE (23): NO CHANGE ... (34): NO CHANGE\n G[h][w+1].add(abs(a+d)) # (16): G (24): G\n G[h][w+1].add(abs(a-d)) # (17): NO CHANGE (25): G\n \nres=set() # (38): res=set()\nfor a in G[H-1][W-1]: # (39): a=6 (41): a=14 (43): NO CHANGE\n res.add(a) # (40): res={6} (42): res={6, 14}\nd=A[H-1][W-1]-B[H-1][W-1] # (44): NO CHANGE\nfor a in G[H-1][W-1]: # (45): a=6 (48): a=14 (51): NO CHANGE\n res.add(abs(a+d)) # (46): res={123, 6, 14} (49): res={131, 6, 14, 111, 123}\n res.add(abs(a-d)) # (47): res={123, 14, 6, 111} (50): res={131, 6, 103, 14, 111, 123}\n\nres=sorted(list(res)) # (52): res=[6, 14, 103, 111, 123, 131]\nprint(min(res))\n"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n MI=lambda:map(int,input().split())\n LI=lambda:list(map(int,input().split()))\n \n H,W=MI()\n A=[LI() for _ in [0]*H]\n B=[LI() for _ in [0]*H]\n- \n+\n G=[[set() for i in range(W)] for j in range(H)]\n-dif=A[0][0]-B[0][0]\n G[0][0].add(0)\n \n-M=80*(H+W)\n-\n for h in range(H):\n for w in range(W):\n d=A[h][w]-B[h][w]\n for a in G[h][w]:\n if h!=H-1:\n G[h+1][w].add(abs(a+d))\n G[h+1][w].add(abs(a-d))\n if w!=W-1:\n G[h][w+1].add(abs(a+d))\n G[h][w+1].add(abs(a-d))\n- \n+\n res=set()\n-for a in G[H-1][W-1]:\n- res.add(a)\n d=A[H-1][W-1]-B[H-1][W-1]\n for a in G[H-1][W-1]:\n res.add(abs(a+d))\n res.add(abs(a-d))\n \n res=sorted(list(res))\n print(min(res))\n-\n", "FL_content": "\n import sys\n input = sys.stdin.readline\n MI=lambda:map(int,input().split())\n LI=lambda:list(map(int,input().split()))\n \n H,W=MI()\n A=[LI() for _ in [0]*H]\n B=[LI() for _ in [0]*H]\n \n G=[[set() for i in range(W)] for j in range(H)]\n dif=A[0][0]-B[0][0]\n G[0][0].add(0)\n \n-M=80*(H+W)\n \n for h in range(H):\n for w in range(W):\n d=A[h][w]-B[h][w]\n for a in G[h][w]:\n if h!=H-1:\n G[h+1][w].add(abs(a+d))\n G[h+1][w].add(abs(a-d))\n if w!=W-1:\n G[h][w+1].add(abs(a+d))\n G[h][w+1].add(abs(a-d))\n \n res=set()\n for a in G[H-1][W-1]:\n res.add(a)\n dif=A[H-1][W-1]-B[H-1][W-1]\n for a in G[H-1][W-1]:\n res.add(abs(a+d))\n res.add(abs(a-d))\n \n res=sorted(list(res))\n print(min(res))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 37 }, { "user_id": "u655612181", "problem_id": "p03172", "submission1_id": "s378608435-FL", "submission2_id": "s953656055", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import accumulate\n\ndef f(k, A):\n n = len(A)\n\n mod = int(1e9 + 7)\n dp = [0] * (k + 1)\n\n \n for j in range(min(A[n - 1], k) + 1):\n dp[j] = 1\n\n for i in range(n - 2, -1, -1):\n dp = list(accumulate(dp))\n a = A[i]\n dp[a+1:] = [x - y for x, y in zip(dp[a + 1:], dp)]\n\n return dp[-1]\n\nassert f(4, [2, 3]) == 2\nassert f(4, [1, 2, 3]) == 5\nassert f(10, [9]) == 0\nassert f(0, [0, 0]) == 1\n\n\nn, k = map(int, input().split())\nA = list(map(int, input().split()))\nans = f(k, A)\nprint(ans)\n", "code2": "from itertools import accumulate\n\ndef f(k, A):\n n = len(A)\n\n mod = int(1e9 + 7)\n dp = [0] * (k + 1)\n\n \n for j in range(min(A[n - 1], k) + 1):\n dp[j] = 1\n\n for i in range(n - 2, -1, -1):\n dp = list(accumulate(dp))\n a = A[i]\n dp[a+1:] = [x - y for x, y in zip(dp[a + 1:], dp)]\n dp = [x % mod for x in dp]\n\n return dp[-1] % mod\n\nassert f(4, [2, 3]) == 2\nassert f(4, [1, 2, 3]) == 5\nassert f(10, [9]) == 0\nassert f(0, [0, 0]) == 1\nassert f(100000, [100000, 100000, 100000, 100000]) == 665683269\n\nn, k = map(int, input().split())\nA = list(map(int, input().split()))\nans = f(k, A)\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1569754490", "date2": "1569754675", "bleu_score": "0.8329226699937213", "code1_test_status": [1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1], "code1_test_score": 34, "total_score": 103, "input": "4 101000\n101010 101100 101001 000101\n", "actual_output": "519746368651\n", "expected_output": "746365018\n\n", "anno_code": ["from itertools import accumulate\n\ndef f(k, A): # (0): f=\n n = len(A) # (2): n=2 (20): n=3 ... (82): n=4\n\n mod = int(1e9 + 7) # (3): mod=1000000007 (21): mod=1000000007 ... (83): mod=1000000007\n dp = [0] * (k + 1) # (4): dp=[0, 0, 0, 0, 0] (22): dp=[0, 0, 0, 0, 0] ... (84): dp=[0, 0, ..., 0, 0]\n\n \n for j in range(min(A[n - 1], k) + 1): # (5): j=0 (7): j=1 ... (289): NO CHANGE\n dp[j] = 1 # (6): dp=[1, 0, 0, 0, 0] (8): dp=[1, 1, 0, 0, 0] ... (288): dp=[1, 1, ..., 0, 0]\n\n for i in range(n - 2, -1, -1): # (14): i=0 (18): accumulate=, f= ... (302): accumulate=, f=, ans=519746368651\n dp = list(accumulate(dp)) # (15): dp=[1, 2, 3, 4, 4] (33): dp=[1, 2, 3, 4, 4] ... (299): dp=[1, 4, ..., 519736071700, 519746368651]\n a = A[i] # (16): a=2 (34): a=2 ... (300): a=101010\n dp[a+1:] = [x - y for x, y in zip(dp[a + 1:], dp)] # (17): dp=[1, 2, 3, 3, 2] (35): dp=[1, 2, 3, 3, 2] ... (301): NO CHANGE\n\n return dp[-1]\n\nassert f(4, [2, 3]) == 2 # (1): k=4, A=[2, 3]\nassert f(4, [1, 2, 3]) == 5 # (19): k=4, A=[1, 2, 3]\nassert f(10, [9]) == 0 # (41): k=10, A=[9]\nassert f(0, [0, 0]) == 1 # (67): k=0, A=[0, 0]\n\n\nn, k = map(int, input().split()) # (79): n=4, k=101000\nA = list(map(int, input().split())) # (80): A=[101010, 101100, 101001, 101]\nans = f(k, A) # (81): NO CHANGE\nprint(ans)\n"], "anno_status": [false], "diff_content": " from itertools import accumulate\n \n def f(k, A):\n n = len(A)\n \n mod = int(1e9 + 7)\n dp = [0] * (k + 1)\n \n \n for j in range(min(A[n - 1], k) + 1):\n dp[j] = 1\n \n for i in range(n - 2, -1, -1):\n dp = list(accumulate(dp))\n a = A[i]\n dp[a+1:] = [x - y for x, y in zip(dp[a + 1:], dp)]\n+ dp = [x % mod for x in dp]\n \n- return dp[-1]\n+ return dp[-1] % mod\n \n assert f(4, [2, 3]) == 2\n assert f(4, [1, 2, 3]) == 5\n assert f(10, [9]) == 0\n assert f(0, [0, 0]) == 1\n-\n+assert f(100000, [100000, 100000, 100000, 100000]) == 665683269\n \n n, k = map(int, input().split())\n A = list(map(int, input().split()))\n ans = f(k, A)\n print(ans)\n \n", "FL_content": "\n from itertools import accumulate\n \n def f(k, A):\n n = len(A)\n \n mod = int(1e9 + 7)\n dp = [0] * (k + 1)\n \n \n for j in range(min(A[n - 1], k) + 1):\n dp[j] = 1\n \n for i in range(n - 2, -1, -1):\n dp = list(accumulate(dp))\n a = A[i]\n dp[a+1:] = [x - y for x, y in zip(dp[a + 1:], dp)]\n \n return dp[-1]\n \n-assert f(4, [2, 3]) == 2\n-assert f(4, [1, 2, 3]) == 5\n-assert f(10, [9]) == 0\n-assert f(0, [0, 0]) == 1\n \n \n n, k = map(int, input().split())\n A = list(map(int, input().split()))\n ans = f(k, A)\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 30 }, { "user_id": "u842689614", "problem_id": "p04014", "submission1_id": "s632545794-FL", "submission2_id": "s079261653", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\ns=int(input())\n\nb_ans=1\n\n\n\nif n==s:\n b_ans=n+1\nif b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\n\nif b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n\n if b.is_integer() and s-p0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\nif b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n\n if b.is_integer() and 0<=s-pn**0.5:\n b_ans=int(b)\n break\n\nif b_ans!=1:\n print(b_ans)\nelse:\n print(-1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566169945", "date2": "1566170554", "bleu_score": "0.955352874296988", "code1_test_status": [1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 84, "total_score": 105, "input": "87654\n7\n", "actual_output": "660\n", "expected_output": "12522\n\n", "anno_code": ["n=int(input()) # (0): n=87654\ns=int(input()) # (1): s=7\n\nb_ans=1 # (2): b_ans=1\n\n\n\nif n==s: # (3): NO CHANGE\n b_ans=n+1\nif b_ans==1: # (4): NO CHANGE\n for b in range(2,int(n**0.5)+1): # (5): b=2 (61): b=3 ... (4402): NO CHANGE\n nn=n # (6): nn=87654 (62): nn=87654 ... (4389): nn=87654\n st=[] # (7): st=[] (63): st=[] ... (4390): st=[]\n while(nn>0): # (8): NO CHANGE (11): NO CHANGE ... (4400): NO CHANGE\n st.append(nn%b) # (9): st=[0] (12): st=[0, 1.0] ... (4398): st=[38, 0.0, 1.0]\n nn=(nn-st[-1])/b # (10): nn=43827.0 (13): nn=21913.0 ... (4399): nn=0.0\n \n if sum(st)==s: # (60): NO CHANGE (98): NO CHANGE ... (4401): NO CHANGE\n b_ans=b\n break\n\n\nif b_ans==1: # (4403): NO CHANGE\n for p in range(int(n**0.5),0,-1): # (4404): p=296 (4407): p=295 ... (4893): p=133\n b=(n-s+p)/p # (4405): b=297.10473 (4408): b=298.108475 ... (4894): b=660.0\n\n if b.is_integer() and s-p0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n-\n if b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n \n- if b.is_integer() and s-pn**0.5:\n b_ans=int(b)\n break\n \n if b_ans!=1:\n print(b_ans)\n else:\n print(-1)\n", "FL_content": "\n n=int(input())\n s=int(input())\n \n b_ans=1\n \n \n \n if n==s:\n b_ans=n+1\n if b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n \n if b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n \n if b.is_integer() and s-p= K:\n print(1)\n sys.exit()\nelif (A - B) <= 0:\n print(-1)\n sys.exit()\nd = A - B\n\np = K-A\nq = math.ceil(float(p)/d)\nprint(2*q + 1)\n", "code2": "import sys\nimport math\nK, A, B = list(map(int, input().split()))\n \nif (A >= K):\n print('1')\n sys.exit()\nelif (A - B) <= 0:\n print('-1')\n sys.exit()\nd = A-B\np = K-A\nq = int(p\nif ((p % d) != 0):\n q += 1\nprint(str(2*q + 1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512518774", "date2": "1512521288", "bleu_score": "0.7525374078475608", "code1_test_status": [1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 20, "total_score": 103, "input": "0100001110110000011 2 0\n", "actual_output": "100001110110000017\n", "expected_output": "100001110110000011\n\n", "anno_code": ["import sys\nimport math\nK, A, B = list(map(int, input().split())) # (0): K=100001110110000011, A=2, B=0\n\nif A >= K: # (1): NO CHANGE\n print(1)\n sys.exit()\nelif (A - B) <= 0: # (2): NO CHANGE\n print(-1)\n sys.exit()\nd = A - B # (3): d=2\n\np = K-A # (4): p=100001110110000009\nq = math.ceil(float(p)/d) # (5): q=50000555055000008\nprint(2*q + 1)\n"], "anno_status": [true], "diff_content": " import sys\n import math\n K, A, B = list(map(int, input().split()))\n-\n-if A >= K:\n- print(1)\n+ \n+if (A >= K):\n+ print('1')\n sys.exit()\n elif (A - B) <= 0:\n- print(-1)\n+ print('-1')\n sys.exit()\n-d = A - B\n-\n+d = A-B\n p = K-A\n-q = math.ceil(float(p)/d)\n-print(2*q + 1)\n-\n+q = int(p\n+if ((p % d) != 0):\n+ q += 1\n+print(str(2*q + 1))\n", "FL_content": "\n import sys\n import math\n K, A, B = list(map(int, input().split()))\n \n if A >= K:\n print(1)\n sys.exit()\n-elif (A - B) <= 0:\n print(-1)\n sys.exit()\n d = A - B\n \n-p = K-A\n-q = math.ceil(float(p)/d)\n-print(2*q + 1)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u835924161", "problem_id": "p03437", "submission1_id": "s909854599-FL", "submission2_id": "s409696114", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y=map(int,input().split())\nif y%x==0:\n\tprint(-1)\nelse:\n\tprint(x)", "code2": "x,y=map(int,input().split())\nif x%y==0:\n\tprint(-1)\nelse:\n\tprint(x)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1581594644", "date2": "1581594913", "bleu_score": "0.9406015835370575", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 24, "total_score": 25, "input": "-6 12\n", "actual_output": "-1\n", "expected_output": "-6\n\n", "anno_code": ["x,y=map(int,input().split()) # (0): x=-6, y=12\nif y%x==0: # (1): NO CHANGE\n\tprint(-1)\nelse:\n\tprint(x)"], "anno_status": [true], "diff_content": " x,y=map(int,input().split())\n-if y%x==0:\n+if x%y==0:\n \tprint(-1)\n else:\n \tprint(x)\n", "FL_content": "\n x,y=map(int,input().split())\n-if y%x==0:\n \tprint(-1)\n else:\n-\tprint(x)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u237362582", "problem_id": "p03856", "submission1_id": "s962648127-FL", "submission2_id": "s623219470", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nrS = S[::-1]\nkeys = ['dream', 'dreamer', 'erase', 'eraser']\nreversed_keys = [keys[i][::-1] for i in range(len(keys))]\ni = 0\nprint(reversed_keys)\nwhile i < len(rS):\n if rS[i:i+5] in reversed_keys:\n i += 5\n elif rS[i:i+6] in reversed_keys:\n i += 6\n elif rS[i:i+7] in reversed_keys:\n i += 7\n else:\n break\nif i == len(rS):\n print('YES')\nelse:\n print('NO')\n", "code2": "S = input()\nrS = S[::-1]\nkeys = ['dream', 'dreamer', 'erase', 'eraser']\nreversed_keys = [keys[i][::-1] for i in range(len(keys))]\ni = 0\n\nwhile i < len(rS):\n if rS[i:i+5] in reversed_keys:\n i += 5\n elif rS[i:i+6] in reversed_keys:\n i += 6\n elif rS[i:i+7] in reversed_keys:\n i += 7\n else:\n break\nif i == len(rS):\n print('YES')\nelse:\n print('NO')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1544047388", "date2": "1544047500", "bleu_score": "0.9463308078061249", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "['maerd', 'remaerd', 'esare', 'resare']\nYES\n", "expected_output": "YES\n", "anno_code": ["S = input() # (0): S=erasedream\nrS = S[::-1] # (1): rS=maerdesare\nkeys = ['dream', 'dreamer', 'erase', 'eraser'] # (2): keys=['dream', 'dreamer', 'erase', 'eraser']\nreversed_keys = [keys[i][::-1] for i in range(len(keys))] # (3): reversed_keys=['maerd', 'remaerd', 'esare', 'resare']\ni = 0 # (4): i=0\nprint(reversed_keys) # (5): NO CHANGE\nwhile i < len(rS): # (6): NO CHANGE (9): NO CHANGE (12): NO CHANGE\n if rS[i:i+5] in reversed_keys: # (7): NO CHANGE (10): NO CHANGE\n i += 5 # (8): i=5 (11): i=10\n elif rS[i:i+6] in reversed_keys:\n i += 6\n elif rS[i:i+7] in reversed_keys:\n i += 7\n else:\n break\nif i == len(rS): # (13): NO CHANGE\n print('YES')\nelse:\n print('NO')\n"], "anno_status": [true], "diff_content": " S = input()\n rS = S[::-1]\n keys = ['dream', 'dreamer', 'erase', 'eraser']\n reversed_keys = [keys[i][::-1] for i in range(len(keys))]\n i = 0\n-print(reversed_keys)\n+\n while i < len(rS):\n if rS[i:i+5] in reversed_keys:\n i += 5\n elif rS[i:i+6] in reversed_keys:\n i += 6\n elif rS[i:i+7] in reversed_keys:\n i += 7\n else:\n break\n if i == len(rS):\n print('YES')\n else:\n print('NO')\n \n", "FL_content": "\n S = input()\n rS = S[::-1]\n keys = ['dream', 'dreamer', 'erase', 'eraser']\n reversed_keys = [keys[i][::-1] for i in range(len(keys))]\n i = 0\n-print(reversed_keys)\n while i < len(rS):\n if rS[i:i+5] in reversed_keys:\n i += 5\n elif rS[i:i+6] in reversed_keys:\n i += 6\n elif rS[i:i+7] in reversed_keys:\n i += 7\n else:\n break\n if i == len(rS):\n print('YES')\n else:\n print('NO')\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u846552659", "problem_id": "p03505", "submission1_id": "s030960076-FL", "submission2_id": "s307346955", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport math\nk,a,b = map(int, input().split())\nif a >= k:\n print(1)\nelse:\n if a <= b:\n print(-1)\n else:\n print((2*math.ceil((k-a)/(a-b)))+1)", "code2": "\nfrom decimal import *\nimport math\nk,a,b = map(int, input().split())\nif a >= k:\n print(1)\nelse:\n if a <= b:\n print(-1)\n else:\n print(2*math.ceil(Decimal(k-a)/Decimal(a-b))+1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1514081773", "date2": "1514083222", "bleu_score": "0.7950745065357415", "code1_test_status": [1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0], "code1_test_score": 21, "total_score": 103, "input": "1100010010001000000 2 -11\n", "actual_output": "169232309230923073\n", "expected_output": "169232309230923079\n\n", "anno_code": ["\nimport math\nk,a,b = map(int, input().split()) # (0): k=1100010010001000000, a=2, b=-11\nif a >= k: # (1): NO CHANGE\n print(1)\nelse:\n if a <= b: # (2): NO CHANGE\n print(-1)\n else:\n print((2*math.ceil((k-a)/(a-b)))+1)"], "anno_status": [true], "diff_content": " \n+from decimal import *\n import math\n k,a,b = map(int, input().split())\n if a >= k:\n print(1)\n else:\n if a <= b:\n print(-1)\n else:\n- print((2*math.ceil((k-a)/(a-b)))+1)\n+ print(2*math.ceil(Decimal(k-a)/Decimal(a-b))+1)\n", "FL_content": "\n \n import math\n k,a,b = map(int, input().split())\n if a >= k:\n print(1)\n else:\n- if a <= b:\n print(-1)\n else:\n- print((2*math.ceil((k-a)/(a-b)))+1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u272336707", "problem_id": "p02601", "submission1_id": "s002620160-FL", "submission2_id": "s368638080", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b, c = map(int, input().split())\nk = int(input())\nfor x in range(k+1):\n for y in range(x, k+1):\n if a * (2**x) < b * (2**(y-x)) < c* (2**(k-x-y)):\n print(\"Yes\")\n break\n break\nelse:\n print(\"No\")", "code2": "import sys\n\na, b, c = map(int, input().split())\nk = int(input())\nfor x in range(k+1):\n for y in range(x, k+1):\n if a * (2**x) < b * (2**(y-x)) < c* (2**(k-x-y)):\n print(\"Yes\")\n sys.exit()\nelse:\n print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595726580", "date2": "1595726707", "bleu_score": "0.905930496194067", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1], "code1_test_score": 77, "total_score": 102, "input": "8 3 4\n3\n", "actual_output": "no output\n", "expected_output": "No\n\n", "anno_code": ["a, b, c = map(int, input().split()) # (0): a=8, b=3, c=4\nk = int(input()) # (1): k=3\nfor x in range(k+1): # (2): x=0\n for y in range(x, k+1): # (3): y=0 (5): y=1 ... (11): NO CHANGE\n if a * (2**x) < b * (2**(y-x)) < c* (2**(k-x-y)): # (4): NO CHANGE (6): NO CHANGE ... (10): NO CHANGE\n print(\"Yes\")\n break\n break\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": "+import sys\n+\n a, b, c = map(int, input().split())\n k = int(input())\n for x in range(k+1):\n for y in range(x, k+1):\n if a * (2**x) < b * (2**(y-x)) < c* (2**(k-x-y)):\n print(\"Yes\")\n- break\n- break\n+ sys.exit()\n else:\n print(\"No\")\n", "FL_content": "\n a, b, c = map(int, input().split())\n k = int(input())\n for x in range(k+1):\n for y in range(x, k+1):\n if a * (2**x) < b * (2**(y-x)) < c* (2**(k-x-y)):\n- print(\"Yes\")\n break\n- break\n else:\n- print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u360515075", "problem_id": "p03945", "submission1_id": "s091139033-FL", "submission2_id": "s197344367", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\np = S[0]\nans = 0\nfor i in range(1, len(S)):\n if S[i] != p: ans += 1\nprint (ans)\n", "code2": "S = input()\np = S[0]\nans = 0\nfor i in range(1, len(S)):\n if S[i] != p: ans += 1\n p = S[i]\nprint (ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567193003", "date2": "1567193150", "bleu_score": "0.8852194792030204", "code1_test_status": [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 24, "total_score": 103, "input": "WVWWWY\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["S = input() # (0): S=WVWWWY\np = S[0] # (1): p=W\nans = 0 # (2): ans=0\nfor i in range(1, len(S)): # (3): i=1 (5): i=2 ... (13): NO CHANGE\n if S[i] != p: ans += 1 # (4): ans=1 (6): NO CHANGE ... (12): ans=2\nprint (ans)\n"], "anno_status": [true], "diff_content": " S = input()\n p = S[0]\n ans = 0\n for i in range(1, len(S)):\n if S[i] != p: ans += 1\n+ p = S[i]\n print (ans)\n \n", "FL_content": "\n S = input()\n p = S[0]\n ans = 0\n for i in range(1, len(S)):\n if S[i] != p: ans += 1\n print (ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u338597441", "problem_id": "p02601", "submission1_id": "s848826651-FL", "submission2_id": "s900149866", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=map(int,input().split())\nk=int(input())\ni=0\nwhile a>=b:\n b*=2\n i+=1\n \n\nwhile b>=c:\n c*=2\n i+=1\n\nif a=b:\n b*=2\n i+=1\n \n\nwhile b>=c:\n c*=2\n i+=1\n\nif a=b: # (3): NO CHANGE (6): NO CHANGE (9): NO CHANGE\n b*=2 # (4): b=6 (7): b=12\n i+=1 # (5): i=1 (8): i=2\n \n\nwhile b>=c: # (10): NO CHANGE (13): NO CHANGE\n c*=2 # (11): c=18\n i+=1 # (12): i=3\n\nif a=b:\n b*=2\n i+=1\n \n \n while b>=c:\n c*=2\n i+=1\n \n if a=b:\n b*=2\n i+=1\n \n \n while b>=c:\n c*=2\n i+=1\n \n-if a\n\ndef main(): # (1): main=\n X, Y = map(int, input().split())\n if X == Y:\n print(-1)\n else:\n for i in range(2,10**1):\n if X*i%Y != 0:\n print(X*i)\n exit()\n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " import sys\n \n input = sys.stdin.readline\n \n def main():\n X, Y = map(int, input().split())\n- if X == Y:\n+ if X%Y == 0:\n print(-1)\n else:\n- for i in range(2,10**1):\n- if X*i%Y != 0:\n- print(X*i)\n- exit()\n+ print(X)\n \n if __name__ == '__main__':\n main()\n", "FL_content": "\n import sys\n \n input = sys.stdin.readline\n \n def main():\n X, Y = map(int, input().split())\n if X == Y:\n print(-1)\n else:\n- for i in range(2,10**1):\n if X*i%Y != 0:\n print(X*i)\n exit()\n \n if __name__ == '__main__':\n main()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u277104886", "problem_id": "p03698", "submission1_id": "s697276283-FL", "submission2_id": "s739672933", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nfor i in s:\n if s.count(i) != 1:\n print('No')\n exit()\nprint('Yes')", "code2": "s = input()\nfor i in s:\n if s.count(i) != 1:\n print('no')\n exit()\nprint('yes')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1592010857", "date2": "1592010895", "bleu_score": "0.9459113584260849", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "ql\n", "actual_output": "Yes\n", "expected_output": "yes\n\n", "anno_code": ["s = input() # (0): s=ql\nfor i in s: # (1): i=q (3): i=l (5): NO CHANGE\n if s.count(i) != 1: # (2): NO CHANGE (4): NO CHANGE\n print('No')\n exit()\nprint('Yes')"], "anno_status": [true], "diff_content": " s = input()\n for i in s:\n if s.count(i) != 1:\n- print('No')\n+ print('no')\n exit()\n-print('Yes')\n+print('yes')\n", "FL_content": "\n s = input()\n for i in s:\n if s.count(i) != 1:\n- print('No')\n exit()\n-print('Yes')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u545368057", "problem_id": "p02867", "submission1_id": "s147530812-FL", "submission2_id": "s203335472", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\n\nfrom collections import defaultdict\nclass UnionFind:\n def __init__(self, n):\n class KeyDict(dict):\n \n def __missing__(self,key):\n self[key] = key\n return key\n self.parent = KeyDict()\n self.rank = defaultdict(int)\n self.weight = defaultdict(int)\n\n \n def find(self, x):\n if self.parent[x] == x:\n return x\n else:\n \n \n y = self.find(self.parent[x]) \n self.weight[x] += self.weight[self.parent[x]] \n self.parent[x] = y \n return self.parent[x]\n\n \n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n \n if self.rank[x] < self.rank[y]:\n self.parent[x] = y\n else:\n self.parent[y] = x\n \n if self.rank[x] == self.rank[y]:\n self.rank[x] += 1\n\n \n def weighted_union(self, x, y, w):\n \n px = self.find(x)\n py = self.find(y)\n \n \n if self.rank[px] < self.rank[py]:\n self.parent[px] = py\n self.weight[px] = - w - self.weight[x] + self.weight[y]\n else:\n self.parent[py] = px\n self.weight[py] = w + self.weight[x] - self.weight[y]\n if self.rank[px] == self.rank[py]:\n self.rank[px] += 1\n return 0\n\n \n def judge(self, x, y):\n return self.find(x) == self.find(y)\n\nN = int(input())\nAs = list(map(int, input().split()))\nBs = list(map(int, input().split()))\nAs_ind = [(a,i) for i,a in enumerate(As)]\nBs_ind = [(b,i) for i,b in enumerate(Bs)]\nAs_ind.sort()\nBs_ind.sort()\n\n\nuf = UnionFind(N)\nd_list = defaultdict(list)\nfor A,B in zip(As_ind,Bs_ind):\n \n if A[0] > B[0]:\n print(\"No\")\n exit()\n uf.union(A[1],B[1])\n d_list[uf.find(A[1])].append(A[0])\n\n\nd_ans = defaultdict(int)\nfor i in range(N):\n root = uf.find(i)\n d_ans[root] += 1\nif len(d_ans) >= 2:\n print(\"Yes\")\nelse:\n \n for k in d_list.keys():\n if len(d_list[k]) > len(set(d_list[k])):\n print(\"Yes\")\n exit()\n print(\"No\")", "code2": "\n\n\n\n\n\nfrom collections import defaultdict\nclass UnionFind:\n def __init__(self, n):\n class KeyDict(dict):\n \n def __missing__(self,key):\n self[key] = key\n return key\n self.parent = KeyDict()\n self.rank = defaultdict(int)\n self.weight = defaultdict(int)\n\n \n def find(self, x):\n if self.parent[x] == x:\n return x\n else:\n \n \n y = self.find(self.parent[x]) \n self.weight[x] += self.weight[self.parent[x]] \n self.parent[x] = y \n return self.parent[x]\n\n \n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n \n if self.rank[x] < self.rank[y]:\n self.parent[x] = y\n else:\n self.parent[y] = x\n \n if self.rank[x] == self.rank[y]:\n self.rank[x] += 1\n\n \n def weighted_union(self, x, y, w):\n \n px = self.find(x)\n py = self.find(y)\n \n \n if self.rank[px] < self.rank[py]:\n self.parent[px] = py\n self.weight[px] = - w - self.weight[x] + self.weight[y]\n else:\n self.parent[py] = px\n self.weight[py] = w + self.weight[x] - self.weight[y]\n if self.rank[px] == self.rank[py]:\n self.rank[px] += 1\n return 0\n\n \n def judge(self, x, y):\n return self.find(x) == self.find(y)\n\nN = int(input())\nAs = list(map(int, input().split()))\nBs = list(map(int, input().split()))\nAs_ind = [(a,i) for i,a in enumerate(As)]\nBs_ind = [(b,i) for i,b in enumerate(Bs)]\nAs_ind.sort()\nBs_ind.sort()\n\n\n\nuf = UnionFind(N)\ncnt = 0\nfor A,B in zip(As_ind,Bs_ind):\n \n if A[0] > B[0]:\n print(\"No\")\n exit()\n uf.union(A[1],B[1])\n\n\nd_ans = defaultdict(int)\n\nfor i in range(N):\n root = uf.find(i)\n d_ans[root] += 1\nif len(d_ans) >= 2:\n print(\"Yes\")\nelse:\n \n \n \n for i in range(1,N):\n if As_ind[i][0] <= Bs_ind[i-1][0]:\n print(\"Yes\")\n exit()\n print(\"No\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1573357541", "date2": "1573502239", "bleu_score": "0.9510753352732632", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 96, "total_score": 103, "input": "3\n0 -3 2\n-1 18 8\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["\n\n\n\n\n\nfrom collections import defaultdict\nclass UnionFind: # (0): UnionFind=\n def __init__(self, n):\n class KeyDict(dict): # (9): KeyDict=\n \n def __missing__(self,key):\n self[key] = key # (19): self=, x=1, y=0 (22): self=, x=1, y=0 (40): self=, x=1, y=2\n return key\n self.parent = KeyDict() # (10): NO CHANGE\n self.rank = defaultdict(int) # (11): NO CHANGE\n self.weight = defaultdict(int) # (12): defaultdict=, UnionFind=, N=3, As=[0, -3, 2], Bs=[-1, 18, 8], As_ind=[(-3, 1), (0, 0), (2, 2)], Bs_ind=[(-1, 0), (8, 2), (18, 1)], uf=\n\n \n def find(self, x):\n if self.parent[x] == x: # (18): self={}, key=1 (21): self={1: 1}, key=0 ... (89): x=2, y=1\n return x\n else:\n \n \n y = self.find(self.parent[x]) # (34): x=1 (46): x=1 ... (88): x=1\n self.weight[x] += self.weight[self.parent[x]] # (36): NO CHANGE (48): NO CHANGE ... (90): NO CHANGE\n self.parent[x] = y # (37): x=1, y=2 (49): defaultdict=, UnionFind=, N=3, As=[0, -3, 2], Bs=[-1, 18, 8], As_ind=[(-3, 1), (0, 0), (2, 2)], Bs_ind=[(-1, 0), (8, 2), (18, 1)], uf=, d_list=defaultdict(, {1: [-3, 0]}), A=(0, 0), B=(8, 2) ... (91): defaultdict=, UnionFind=, N=3, As=[0, -3, 2], Bs=[-1, 18, 8], As_ind=[(-3, 1), (0, 0), (2, 2)], Bs_ind=[(-1, 0), (8, 2), (18, 1)], uf=, d_list=defaultdict(, {1: [-3, 0, 2]}), A=(2, 2), B=(18, 1), d_ans=defaultdict(, {1: 2}), i=2, root=1\n return self.parent[x]\n\n \n def union(self, x, y):\n x = self.find(x) # (17): NO CHANGE (32): NO CHANGE (53): NO CHANGE\n y = self.find(y) # (20): x=0 (38): x=2 (59): NO CHANGE\n \n if self.rank[x] < self.rank[y]: # (23): NO CHANGE (41): NO CHANGE (61): NO CHANGE\n self.parent[x] = y\n else:\n self.parent[y] = x # (24): NO CHANGE (42): NO CHANGE (62): NO CHANGE\n \n if self.rank[x] == self.rank[y]: # (25): NO CHANGE (43): defaultdict=, UnionFind=, N=3, As=[0, -3, 2], Bs=[-1, 18, 8], As_ind=[(-3, 1), (0, 0), (2, 2)], Bs_ind=[(-1, 0), (8, 2), (18, 1)], uf=, d_list=defaultdict(, {1: [-3]}), A=(0, 0), B=(8, 2) (63): NO CHANGE\n self.rank[x] += 1 # (26): defaultdict=, UnionFind=, N=3, As=[0, -3, 2], Bs=[-1, 18, 8], As_ind=[(-3, 1), (0, 0), (2, 2)], Bs_ind=[(-1, 0), (8, 2), (18, 1)], uf=, d_list=defaultdict(, {}), A=(-3, 1), B=(-1, 0) (64): defaultdict=, UnionFind=, N=3, As=[0, -3, 2], Bs=[-1, 18, 8], As_ind=[(-3, 1), (0, 0), (2, 2)], Bs_ind=[(-1, 0), (8, 2), (18, 1)], uf=, d_list=defaultdict(, {1: [-3, 0]}), A=(2, 2), B=(18, 1)\n\n \n def weighted_union(self, x, y, w):\n \n px = self.find(x)\n py = self.find(y)\n \n \n if self.rank[px] < self.rank[py]:\n self.parent[px] = py\n self.weight[px] = - w - self.weight[x] + self.weight[y]\n else:\n self.parent[py] = px\n self.weight[py] = w + self.weight[x] - self.weight[y]\n if self.rank[px] == self.rank[py]:\n self.rank[px] += 1\n return 0\n\n \n def judge(self, x, y):\n return self.find(x) == self.find(y)\n\nN = int(input()) # (1): N=3\nAs = list(map(int, input().split())) # (2): As=[0, -3, 2]\nBs = list(map(int, input().split())) # (3): Bs=[-1, 18, 8]\nAs_ind = [(a,i) for i,a in enumerate(As)] # (4): As_ind=[(0, 0), (-3, 1), (2, 2)]\nBs_ind = [(b,i) for i,b in enumerate(Bs)] # (5): Bs_ind=[(-1, 0), (18, 1), (8, 2)]\nAs_ind.sort() # (6): As_ind=[(-3, 1), (0, 0), (2, 2)]\nBs_ind.sort() # (7): Bs_ind=[(-1, 0), (8, 2), (18, 1)]\n\n\nuf = UnionFind(N) # (8): self=, n=3\nd_list = defaultdict(list) # (13): d_list=defaultdict(, {})\nfor A,B in zip(As_ind,Bs_ind): # (14): A=(-3, 1), B=(-1, 0) (29): A=(0, 0), B=(8, 2) ... (71): NO CHANGE\n \n if A[0] > B[0]: # (15): NO CHANGE (30): NO CHANGE (51): NO CHANGE\n print(\"No\")\n exit()\n uf.union(A[1],B[1]) # (16): self=, x=1, y=0 (31): self=, x=0, y=2 (52): self=, x=2, y=1\n d_list[uf.find(A[1])].append(A[0]) # (27): self=, x=1 (44): self=, x=0 (65): self=, x=2\n\n\nd_ans = defaultdict(int) # (72): d_ans=defaultdict(, {})\nfor i in range(N): # (73): i=0 (81): i=1 ... (93): NO CHANGE\n root = uf.find(i) # (74): self=, x=0 (82): self=, x=1 (86): self=, x=2\n d_ans[root] += 1 # (80): d_ans=defaultdict(, {1: 1}) (84): d_ans=defaultdict(, {1: 2}) (92): d_ans=defaultdict(, {1: 3})\nif len(d_ans) >= 2: # (94): NO CHANGE\n print(\"Yes\")\nelse:\n \n for k in d_list.keys(): # (95): k=1 (97): NO CHANGE\n if len(d_list[k]) > len(set(d_list[k])): # (96): NO CHANGE\n print(\"Yes\")\n exit()\n print(\"No\")"], "anno_status": [false], "diff_content": " \n \n \n \n \n \n from collections import defaultdict\n class UnionFind:\n def __init__(self, n):\n class KeyDict(dict):\n \n def __missing__(self,key):\n self[key] = key\n return key\n self.parent = KeyDict()\n self.rank = defaultdict(int)\n self.weight = defaultdict(int)\n \n \n def find(self, x):\n if self.parent[x] == x:\n return x\n else:\n \n \n y = self.find(self.parent[x]) \n self.weight[x] += self.weight[self.parent[x]] \n self.parent[x] = y \n return self.parent[x]\n \n \n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n \n if self.rank[x] < self.rank[y]:\n self.parent[x] = y\n else:\n self.parent[y] = x\n \n if self.rank[x] == self.rank[y]:\n self.rank[x] += 1\n \n \n def weighted_union(self, x, y, w):\n \n px = self.find(x)\n py = self.find(y)\n \n \n if self.rank[px] < self.rank[py]:\n self.parent[px] = py\n self.weight[px] = - w - self.weight[x] + self.weight[y]\n else:\n self.parent[py] = px\n self.weight[py] = w + self.weight[x] - self.weight[y]\n if self.rank[px] == self.rank[py]:\n self.rank[px] += 1\n return 0\n \n \n def judge(self, x, y):\n return self.find(x) == self.find(y)\n \n N = int(input())\n As = list(map(int, input().split()))\n Bs = list(map(int, input().split()))\n As_ind = [(a,i) for i,a in enumerate(As)]\n Bs_ind = [(b,i) for i,b in enumerate(Bs)]\n As_ind.sort()\n Bs_ind.sort()\n \n \n+\n uf = UnionFind(N)\n-d_list = defaultdict(list)\n+cnt = 0\n for A,B in zip(As_ind,Bs_ind):\n \n if A[0] > B[0]:\n print(\"No\")\n exit()\n uf.union(A[1],B[1])\n- d_list[uf.find(A[1])].append(A[0])\n \n \n d_ans = defaultdict(int)\n+\n for i in range(N):\n root = uf.find(i)\n d_ans[root] += 1\n if len(d_ans) >= 2:\n print(\"Yes\")\n else:\n \n- for k in d_list.keys():\n- if len(d_list[k]) > len(set(d_list[k])):\n+ \n+ \n+ for i in range(1,N):\n+ if As_ind[i][0] <= Bs_ind[i-1][0]:\n print(\"Yes\")\n exit()\n print(\"No\")\n", "FL_content": "\n \n \n \n \n \n \n from collections import defaultdict\n class UnionFind:\n def __init__(self, n):\n class KeyDict(dict):\n \n def __missing__(self,key):\n self[key] = key\n return key\n self.parent = KeyDict()\n self.rank = defaultdict(int)\n self.weight = defaultdict(int)\n \n \n def find(self, x):\n if self.parent[x] == x:\n return x\n else:\n \n \n y = self.find(self.parent[x]) \n self.weight[x] += self.weight[self.parent[x]] \n self.parent[x] = y \n return self.parent[x]\n \n \n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n \n if self.rank[x] < self.rank[y]:\n self.parent[x] = y\n else:\n self.parent[y] = x\n \n if self.rank[x] == self.rank[y]:\n self.rank[x] += 1\n \n \n def weighted_union(self, x, y, w):\n \n px = self.find(x)\n py = self.find(y)\n \n \n if self.rank[px] < self.rank[py]:\n self.parent[px] = py\n self.weight[px] = - w - self.weight[x] + self.weight[y]\n else:\n self.parent[py] = px\n self.weight[py] = w + self.weight[x] - self.weight[y]\n if self.rank[px] == self.rank[py]:\n self.rank[px] += 1\n return 0\n \n \n def judge(self, x, y):\n return self.find(x) == self.find(y)\n \n N = int(input())\n As = list(map(int, input().split()))\n Bs = list(map(int, input().split()))\n As_ind = [(a,i) for i,a in enumerate(As)]\n Bs_ind = [(b,i) for i,b in enumerate(Bs)]\n As_ind.sort()\n Bs_ind.sort()\n \n \n uf = UnionFind(N)\n d_list = defaultdict(list)\n for A,B in zip(As_ind,Bs_ind):\n \n if A[0] > B[0]:\n print(\"No\")\n exit()\n uf.union(A[1],B[1])\n d_list[uf.find(A[1])].append(A[0])\n \n \n d_ans = defaultdict(int)\n for i in range(N):\n root = uf.find(i)\n d_ans[root] += 1\n if len(d_ans) >= 2:\n print(\"Yes\")\n else:\n \n for k in d_list.keys():\n if len(d_list[k]) > len(set(d_list[k])):\n print(\"Yes\")\n exit()\n print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 97 }, { "user_id": "u408444038", "problem_id": "p01102", "submission1_id": "s089191014-FL", "submission2_id": "s618343622", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a1 = input()\na2 = input()\nb1 = a1.split('\"')\nb2 = a2.split('\"')\ncnt = 0\nif len(b1)==len(b2):\n for i in range(0,len(b1)):\n if i%2==0:\n if b1[i]!=b2[i]:\n cnt+=10000\n break\n if i%2!=0:\n if b1[i]!=b2[i]:\n cnt+=1\nelse:\n cnt+=10000\n\nif cnt>1:\n print(\"DIFFERENT\")\nif cnt==1:\n print(\"CLOSE\")\nif cnt==0:\n print(\"IDENTICAL\")\n", "code2": "st = []\nwhile(1):\n a1 = input()\n if a1 =='.':\n break\n a2 = input()\n b1 = a1.split('\"')\n b2 = a2.split('\"')\n cnt = 0\n if len(b1)==len(b2):\n for i in range(0,len(b1)):\n if i%2==0:\n if b1[i]!=b2[i]:\n cnt+=10000\n break\n if i%2!=0:\n if b1[i]!=b2[i]:\n cnt+=1\n else:\n cnt+=10000\n \n if cnt>1:\n st.append(\"DIFFERENT\")\n if cnt==1:\n st.append(\"CLOSE\")\n if cnt==0:\n st.append(\"IDENTICAL\")\n\nfor i in range(len(st)):\n print(st[i])\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526969705", "date2": "1526970149", "bleu_score": "0.6343050363129596", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "print\"hello\";irpnt123\nprint\"hello\";print123\nread\"B1input\";solve;output;\nread\"B2\";stlve;ovtpuo;\nread\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"\"\"\"\"\"\"\"\n\"\"\"\"\"24\"\"\"\nslwo\"program\"\n\"edoc\"tsaf\n\"super\"fast\"program\"\n\"super\"faster\"program\"\n\"\"X\nX\nI\"S\"\"CREAM\"\nI\"CE\"\"CREAM\"\n11\"22\"11\n1\"33\"111\n.\n", "actual_output": "DIFFERENT\n", "expected_output": "DIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\n\n", "anno_code": ["a1 = input() # (0): a1=print\"hello\";irpnt123\na2 = input() # (1): a2=print\"hello\";print123\nb1 = a1.split('\"') # (2): b1=['print', 'hello', ';irpnt123']\nb2 = a2.split('\"') # (3): b2=['print', 'hello', ';print123']\ncnt = 0 # (4): cnt=0\nif len(b1)==len(b2): # (5): NO CHANGE\n for i in range(0,len(b1)): # (6): i=0 (10): i=1 (14): i=2\n if i%2==0: # (7): NO CHANGE (11): NO CHANGE (15): NO CHANGE\n if b1[i]!=b2[i]: # (8): NO CHANGE (16): NO CHANGE\n cnt+=10000 # (17): cnt=10000\n break # (18): NO CHANGE\n if i%2!=0: # (9): NO CHANGE (12): NO CHANGE\n if b1[i]!=b2[i]: # (13): NO CHANGE\n cnt+=1\nelse:\n cnt+=10000\n\nif cnt>1: # (19): NO CHANGE\n print(\"DIFFERENT\") # (20): NO CHANGE\nif cnt==1: # (21): NO CHANGE\n print(\"CLOSE\")\nif cnt==0:\n print(\"IDENTICAL\")\n"], "anno_status": [true], "diff_content": "-a1 = input()\n-a2 = input()\n-b1 = a1.split('\"')\n-b2 = a2.split('\"')\n-cnt = 0\n-if len(b1)==len(b2):\n- for i in range(0,len(b1)):\n- if i%2==0:\n- if b1[i]!=b2[i]:\n- cnt+=10000\n- break\n- if i%2!=0:\n- if b1[i]!=b2[i]:\n- cnt+=1\n-else:\n- cnt+=10000\n+st = []\n+while(1):\n+ a1 = input()\n+ if a1 =='.':\n+ break\n+ a2 = input()\n+ b1 = a1.split('\"')\n+ b2 = a2.split('\"')\n+ cnt = 0\n+ if len(b1)==len(b2):\n+ for i in range(0,len(b1)):\n+ if i%2==0:\n+ if b1[i]!=b2[i]:\n+ cnt+=10000\n+ break\n+ if i%2!=0:\n+ if b1[i]!=b2[i]:\n+ cnt+=1\n+ else:\n+ cnt+=10000\n+ \n+ if cnt>1:\n+ st.append(\"DIFFERENT\")\n+ if cnt==1:\n+ st.append(\"CLOSE\")\n+ if cnt==0:\n+ st.append(\"IDENTICAL\")\n \n-if cnt>1:\n- print(\"DIFFERENT\")\n-if cnt==1:\n- print(\"CLOSE\")\n-if cnt==0:\n- print(\"IDENTICAL\")\n+for i in range(len(st)):\n+ print(st[i])\n \n", "FL_content": "\n a1 = input()\n a2 = input()\n b1 = a1.split('\"')\n b2 = a2.split('\"')\n cnt = 0\n if len(b1)==len(b2):\n for i in range(0,len(b1)):\n if i%2==0:\n if b1[i]!=b2[i]:\n cnt+=10000\n break\n if i%2!=0:\n if b1[i]!=b2[i]:\n cnt+=1\n else:\n cnt+=10000\n \n if cnt>1:\n print(\"DIFFERENT\")\n if cnt==1:\n print(\"CLOSE\")\n if cnt==0:\n print(\"IDENTICAL\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u038155726", "problem_id": "p02601", "submission1_id": "s179307236-FL", "submission2_id": "s963848216", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\ndef magic(a, b, c, k):\n i = 0\n while i < k:\n if a > b:\n b = b * 2\n elif b > c:\n c = c * 2\n if a < b and b < c:\n return \"Yes\"\n i += 1\n return \"No\"\n\n\nif __name__ == \"__main__\":\n param_a, param_b, param_c = input().split(' ')\n param_k = int(input())\n print(magic(int(param_a), int(param_b), int(param_c), int(param_k)))\n", "code2": "\n\n\ndef magic(a, b, c, k):\n for i in range(k):\n if a >= b:\n b = b * 2\n elif b >= c:\n c = c * 2\n i += 1\n if a < b and b < c:\n return \"Yes\"\n else:\n return \"No\"\n\n\nif __name__ == \"__main__\":\n param_a, param_b, param_c = map(int, input().split(' '))\n param_k = int(input())\n print(magic(param_a, param_b, param_c, param_k))\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595874810", "date2": "1595875175", "bleu_score": "0.8777396872107135", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 63, "total_score": 102, "input": "2 1 6\n2\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["\n\n\ndef magic(a, b, c, k): # (0): magic=\n i = 0\n while i < k:\n if a > b:\n b = b * 2\n elif b > c:\n c = c * 2\n if a < b and b < c:\n return \"Yes\"\n i += 1\n return \"No\"\n\n\nif __name__ == \"__main__\":\n param_a, param_b, param_c = input().split(' ')\n param_k = int(input())\n print(magic(int(param_a), int(param_b), int(param_c), int(param_k)))\n"], "anno_status": [true], "diff_content": " \n \n \n def magic(a, b, c, k):\n- i = 0\n- while i < k:\n- if a > b:\n+ for i in range(k):\n+ if a >= b:\n b = b * 2\n- elif b > c:\n+ elif b >= c:\n c = c * 2\n- if a < b and b < c:\n- return \"Yes\"\n i += 1\n- return \"No\"\n+ if a < b and b < c:\n+ return \"Yes\"\n+ else:\n+ return \"No\"\n \n \n if __name__ == \"__main__\":\n- param_a, param_b, param_c = input().split(' ')\n+ param_a, param_b, param_c = map(int, input().split(' '))\n param_k = int(input())\n- print(magic(int(param_a), int(param_b), int(param_c), int(param_k)))\n+ print(magic(param_a, param_b, param_c, param_k))\n \n", "FL_content": "\n \n \n \n def magic(a, b, c, k):\n i = 0\n while i < k:\n if a > b:\n b = b * 2\n elif b > c:\n c = c * 2\n- if a < b and b < c:\n return \"Yes\"\n i += 1\n return \"No\"\n \n \n if __name__ == \"__main__\":\n param_a, param_b, param_c = input().split(' ')\n param_k = int(input())\n print(magic(int(param_a), int(param_b), int(param_c), int(param_k)))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 21 }, { "user_id": "u693716675", "problem_id": "p04008", "submission1_id": "s379043547-FL", "submission2_id": "s728107826", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nsys.setrecursionlimit(2 * 10 ** 5 + 10)\n\nn,k = [int(i) for i in input().split()]\na = [int(i)-1 for i in input().split()]\n\n\ndef dfs(u, d):\n change = 0\n if d>k:\n d = 0\n change += 1\n for v in edges[u]:\n change += dfs(v, d+1)\n return change\n\n\ncnt = 0\nif a[0]!=0:\n cnt += 1\n\nedges = [[] for _ in range(n)]\nfor i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n\ncnt += dfs(0,0) \nprint(cnt)", "code2": "\n\n\n\nimport sys\nsys.setrecursionlimit(2 * 10 ** 5 + 10)\n\nn,k = [int(i) for i in input().split()]\na = [int(i)-1 for i in input().split()]\n\n\n\ndef dfs(u):\n global cnt\n depth = 0 \n \n for v in edges[u]:\n depth = max(depth, (dfs(v)+1)%k) \n \n \n if depth==k-1 and u!=0 and a[u] != 0:\n cnt += 1\n \n return depth\n\n\ncnt = 0\nif a[0]!=0:\n cnt += 1\n\nedges = [[] for _ in range(n)]\nfor i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n\ndfs(0) \nprint(cnt)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583625138", "date2": "1583629077", "bleu_score": "0.78113689876801", "code1_test_status": [1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 82, "total_score": 97, "input": "8 2\n-1 1 4 5 1 1 5 4\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["\nimport sys\nsys.setrecursionlimit(2 * 10 ** 5 + 10) # (0): NO CHANGE\n\nn,k = [int(i) for i in input().split()] # (1): n=8, k=2\na = [int(i)-1 for i in input().split()] # (2): a=[-2, 0, 3, 4, 0, 0, 4, 3]\n\n\ndef dfs(u, d): # (3): dfs=\n change = 0 # (31): change=0 (35): change=0 ... (69): change=0\n if d>k: # (32): NO CHANGE (36): NO CHANGE ... (70): NO CHANGE\n d = 0 # (50): d=0 (57): d=0\n change += 1 # (51): change=1 (58): change=1\n for v in edges[u]: # (33): v=1 (37): u=0, d=0, v=1 ... (72): sys=, n=8, k=2, a=[-2, 0, 3, 4, 0, 0, 4, 3], dfs=, cnt=3, edges, i=7, pa=3\n change += dfs(v, d+1) # (34): u=1, d=1 (39): u=4, d=1 ... (68): u=5, d=1\n return change\n\n\ncnt = 0 # (4): cnt=0\nif a[0]!=0: # (5): NO CHANGE\n cnt += 1 # (6): cnt=1\n\nedges = [[] for _ in range(n)] # (7): edges\nfor i in range(1,n): # (8): i=1 (11): edges, i=2 ... (29): edges\n pa = a[i] # (9): pa=0 (12): edges=[[1], [], [], [], [], [], [], []], pa=3 ... (27): edges, pa=3\n edges[a[i]].append(i) # (10): edges (13): edges ... (28): edges\n\ncnt += dfs(0,0) # (30): u=0, d=0\nprint(cnt)"], "anno_status": [true], "diff_content": " \n+\n+\n+\n import sys\n sys.setrecursionlimit(2 * 10 ** 5 + 10)\n \n n,k = [int(i) for i in input().split()]\n a = [int(i)-1 for i in input().split()]\n \n \n-def dfs(u, d):\n- change = 0\n- if d>k:\n- d = 0\n- change += 1\n+\n+def dfs(u):\n+ global cnt\n+ depth = 0 \n+ \n for v in edges[u]:\n- change += dfs(v, d+1)\n- return change\n+ depth = max(depth, (dfs(v)+1)%k) \n+ \n+ \n+ if depth==k-1 and u!=0 and a[u] != 0:\n+ cnt += 1\n+ \n+ return depth\n \n \n cnt = 0\n if a[0]!=0:\n cnt += 1\n \n edges = [[] for _ in range(n)]\n for i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n \n-cnt += dfs(0,0) \n+dfs(0) \n print(cnt)\n", "FL_content": "\n \n import sys\n sys.setrecursionlimit(2 * 10 ** 5 + 10)\n \n n,k = [int(i) for i in input().split()]\n a = [int(i)-1 for i in input().split()]\n \n \n def dfs(u, d):\n change = 0\n if d>k:\n d = 0\n change += 1\n for v in edges[u]:\n change += dfs(v, d+1)\n return change\n \n \n cnt = 0\n-if a[0]!=0:\n cnt += 1\n \n edges = [[] for _ in range(n)]\n for i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n \n cnt += dfs(0,0) \n print(cnt)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 29 }, { "user_id": "u201660334", "problem_id": "p03523", "submission1_id": "s748584472-FL", "submission2_id": "s329060952", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import re\n\ns = input()\nregex = re.compile(r\"A?KIHA?BA?RA?\")\nif regex.match(s):\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "import re\n\ns = input()\nregex = re.compile(r\"A?KIHA?BA?RA?\")\nif regex.fullmatch(s):\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597392594", "date2": "1597393061", "bleu_score": "0.9052348398866766", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "PIKBH\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["import re\n\ns = input() # (0): s=PIKBH\nregex = re.compile(r\"A?KIHA?BA?RA?\") # (1): regex=re.compile('A?KIHA?BA?RA?')\nif regex.match(s): # (2): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " import re\n \n s = input()\n regex = re.compile(r\"A?KIHA?BA?RA?\")\n-if regex.match(s):\n- print(\"Yes\")\n+if regex.fullmatch(s):\n+ print(\"YES\")\n else:\n- print(\"No\")\n+ print(\"NO\")\n", "FL_content": "\n import re\n \n s = input()\n-regex = re.compile(r\"A?KIHA?BA?RA?\")\n if regex.match(s):\n- print(\"Yes\")\n else:\n- print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u482227082", "problem_id": "p02408", "submission1_id": "s000274119-FL", "submission2_id": "s087075707", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = [0] * 13\nh = [0] * 13\nc = [0] * 13\nd = [0] * 13\n\nnum = int(input())\nfor i in range(num):\n m, n = input().split()\n n = int(n)\n if m == \"s\":\n s[n] == 1\n if m == \"h\":\n h[n] == 1\n if m == \"c\":\n h[n] == 1\n if m == \"d\":\n h[n] == 1\n\nfor i in range(1,13):\n if s[i] == 0:\n print(\"S %d\" %i)\n\nfor i in range(1,13):\n if h[i] == 0:\n print(\"H %d\" %i)\n\nfor i in range(1,13):\n if c[i] == 0:\n print(\"C %d\" %i)\n\nfor i in range(1,13):\n if d[i] == 0:\n print(\"S %d\" %i)\n\n\n\n\n", "code2": "s = [0] * 13\nh = [0] * 13\nc = [0] * 13\nd = [0] * 13\n\nnum = int(input())\nfor i in range(num):\n m, n = input().split()\n x = int(n) - 1\n if m == \"S\":\n s[x] = 1\n elif m == \"H\":\n h[x] = 1\n elif m == \"C\":\n c[x] = 1\n elif m == \"D\":\n d[x] = 1\n else:\n break\n\nfor i in range(13):\n if s[i] == 0:\n print(\"S %d\" % (i+1))\n\nfor i in range(13):\n if h[i] == 0:\n print(\"H %d\" % (i+1))\n\nfor i in range(13):\n if c[i] == 0:\n print(\"C %d\" % (i+1))\n\nfor i in range(13):\n if d[i] == 0:\n print(\"D %d\" % (i+1))\n\n\n\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556432306", "date2": "1556433481", "bleu_score": "0.8232446123347282", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "47\nS 10\nS 11\nS 12\nS 13\nH 1\nH 2\nS 6\nS 7\nS 2\nS 9\nH 6\nH 8\nH 9\nH 10\nH 11\nH 4\nH 7\nS 1\nS 3\nS 4\nS 5\nH 12\nH 13\nC 1\nC 2\nD 1\nD 2\nD 3\nD 4\nD 5\nD 8\nD 7\nC 3\nC 4\nC 5\nC 6\nC 7\nC 8\nC 9\nC 10\nC 11\nC 13\nD 9\nD 10\nD 11\nD 12\nD 13\n", "actual_output": "S 1\nS 2\nS 3\nS 4\nS 5\nS 6\nS 7\nS 8\nS 9\nS 10\nS 11\nS 12\nH 1\nH 2\nH 3\nH 4\nH 5\nH 6\nH 7\nH 8\nH 9\nH 10\nH 11\nH 12\nC 1\nC 2\nC 3\nC 4\nC 5\nC 6\nC 7\nC 8\nC 9\nC 10\nC 11\nC 12\nS 1\nS 2\nS 3\nS 4\nS 5\nS 6\nS 7\nS 8\nS 9\nS 10\nS 11\nS 12\n", "expected_output": "S 8\nH 3\nH 5\nC 12\nD 6\n\n", "anno_code": ["s = [0] * 13 # (0): s=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nh = [0] * 13 # (1): h=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nc = [0] * 13 # (2): c=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nd = [0] * 13 # (3): d=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\nnum = int(input()) # (4): num=47\nfor i in range(num): # (5): i=0 (12): i=1 ... (334): NO CHANGE\n m, n = input().split() # (6): m=S, n=10 (13): n=11 ... (328): n=13\n n = int(n) # (7): n=10 (14): n=11 ... (329): n=13\n if m == \"s\": # (8): NO CHANGE (15): NO CHANGE ... (330): NO CHANGE\n s[n] == 1\n if m == \"h\": # (9): NO CHANGE (16): NO CHANGE ... (331): NO CHANGE\n h[n] == 1\n if m == \"c\": # (10): NO CHANGE (17): NO CHANGE ... (332): NO CHANGE\n h[n] == 1\n if m == \"d\": # (11): NO CHANGE (18): NO CHANGE ... (333): NO CHANGE\n h[n] == 1\n\nfor i in range(1,13): # (335): i=1 (338): i=2 ... (371): NO CHANGE\n if s[i] == 0: # (336): NO CHANGE (339): NO CHANGE ... (369): NO CHANGE\n print(\"S %d\" %i) # (337): NO CHANGE (340): NO CHANGE ... (370): NO CHANGE\n\nfor i in range(1,13): # (372): i=1 (375): i=2 ... (408): NO CHANGE\n if h[i] == 0: # (373): NO CHANGE (376): NO CHANGE ... (406): NO CHANGE\n print(\"H %d\" %i) # (374): NO CHANGE (377): NO CHANGE ... (407): NO CHANGE\n\nfor i in range(1,13): # (409): i=1 (412): i=2 ... (445): NO CHANGE\n if c[i] == 0: # (410): NO CHANGE (413): NO CHANGE ... (443): NO CHANGE\n print(\"C %d\" %i) # (411): NO CHANGE (414): NO CHANGE ... (444): NO CHANGE\n\nfor i in range(1,13): # (446): i=1 (449): i=2 ... (479): i=12\n if d[i] == 0: # (447): NO CHANGE (450): NO CHANGE ... (480): NO CHANGE\n print(\"S %d\" %i) # (448): NO CHANGE (451): NO CHANGE ... (481): NO CHANGE\n\n\n\n\n"], "anno_status": [false], "diff_content": " s = [0] * 13\n h = [0] * 13\n c = [0] * 13\n d = [0] * 13\n \n num = int(input())\n for i in range(num):\n m, n = input().split()\n- n = int(n)\n- if m == \"s\":\n- s[n] == 1\n- if m == \"h\":\n- h[n] == 1\n- if m == \"c\":\n- h[n] == 1\n- if m == \"d\":\n- h[n] == 1\n-\n-for i in range(1,13):\n+ x = int(n) - 1\n+ if m == \"S\":\n+ s[x] = 1\n+ elif m == \"H\":\n+ h[x] = 1\n+ elif m == \"C\":\n+ c[x] = 1\n+ elif m == \"D\":\n+ d[x] = 1\n+ else:\n+ break\n+\n+for i in range(13):\n if s[i] == 0:\n- print(\"S %d\" %i)\n+ print(\"S %d\" % (i+1))\n \n-for i in range(1,13):\n+for i in range(13):\n if h[i] == 0:\n- print(\"H %d\" %i)\n+ print(\"H %d\" % (i+1))\n \n-for i in range(1,13):\n+for i in range(13):\n if c[i] == 0:\n- print(\"C %d\" %i)\n+ print(\"C %d\" % (i+1))\n \n-for i in range(1,13):\n+for i in range(13):\n if d[i] == 0:\n- print(\"S %d\" %i)\n+ print(\"D %d\" % (i+1))\n \n \n \n \n \n", "FL_content": "\n s = [0] * 13\n h = [0] * 13\n c = [0] * 13\n d = [0] * 13\n \n num = int(input())\n for i in range(num):\n m, n = input().split()\n n = int(n)\n if m == \"s\":\n- s[n] == 1\n if m == \"h\":\n- h[n] == 1\n if m == \"c\":\n- h[n] == 1\n if m == \"d\":\n- h[n] == 1\n \n for i in range(1,13):\n if s[i] == 0:\n print(\"S %d\" %i)\n \n for i in range(1,13):\n if h[i] == 0:\n print(\"H %d\" %i)\n \n for i in range(1,13):\n if c[i] == 0:\n print(\"C %d\" %i)\n \n for i in range(1,13):\n if d[i] == 0:\n- print(\"S %d\" %i)\n \n \n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 38 }, { "user_id": "u832152513", "problem_id": "p03944", "submission1_id": "s221670297-FL", "submission2_id": "s825777862", "status1": "Wrong Answer", "status2": "Accepted", "code1": "w, h, n = map(int, input().split())\nxya = [list(map(int, input().split())) for _ in range(n)]\n\nw0 = 0\nh0 = 0\nfor i in range(n):\n if xya[i][2] == 1:\n w0 = xya[i][0]\n elif xya[i][2] == 2:\n w = xya[i][0]\n elif xya[i][2] == 3:\n h0 = xya[i][1]\n else:\n h = xya[i][1]\n\nprint(max(0,(w-w0) * (h-h0)))", "code2": "w, h, n = map(int, input().split())\nxya = [list(map(int, input().split())) for _ in range(n)]\n\nw0 = 0\nh0 = 0\nfor i in range(n):\n if xya[i][2] == 1:\n w0 = max(w0,xya[i][0])\n elif xya[i][2] == 2:\n w = min(w,xya[i][0])\n elif xya[i][2] == 3:\n h0 = max(h0,xya[i][1])\n else:\n h = min(h,xya[i][1])\n \nprint(max(0, (w-w0)) * max(0, (h-h0)))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1574838480", "date2": "1574839222", "bleu_score": "0.8326107890933703", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 96, "total_score": 103, "input": "5 4 3\n2 1 2\n6 11 3\n1 2 3\n", "actual_output": "4\n", "expected_output": "0\n\n", "anno_code": ["w, h, n = map(int, input().split()) # (0): w=5, h=4, n=3\nxya = [list(map(int, input().split())) for _ in range(n)] # (1): xya\n\nw0 = 0 # (2): w0=0\nh0 = 0 # (3): h0=0\nfor i in range(n): # (4): i=0 (8): i=1 ... (18): NO CHANGE\n if xya[i][2] == 1: # (5): NO CHANGE (9): NO CHANGE (14): NO CHANGE\n w0 = xya[i][0]\n elif xya[i][2] == 2: # (6): NO CHANGE (10): NO CHANGE (15): NO CHANGE\n w = xya[i][0] # (7): w=2\n elif xya[i][2] == 3: # (11): NO CHANGE (16): NO CHANGE\n h0 = xya[i][1] # (12): h0=11 (17): h0=2\n else:\n h = xya[i][1]\n\nprint(max(0,(w-w0) * (h-h0)))"], "anno_status": [true], "diff_content": " w, h, n = map(int, input().split())\n xya = [list(map(int, input().split())) for _ in range(n)]\n \n w0 = 0\n h0 = 0\n for i in range(n):\n if xya[i][2] == 1:\n- w0 = xya[i][0]\n+ w0 = max(w0,xya[i][0])\n elif xya[i][2] == 2:\n- w = xya[i][0]\n+ w = min(w,xya[i][0])\n elif xya[i][2] == 3:\n- h0 = xya[i][1]\n+ h0 = max(h0,xya[i][1])\n else:\n- h = xya[i][1]\n-\n-print(max(0,(w-w0) * (h-h0)))\n+ h = min(h,xya[i][1])\n+ \n+print(max(0, (w-w0)) * max(0, (h-h0)))\n", "FL_content": "\n w, h, n = map(int, input().split())\n xya = [list(map(int, input().split())) for _ in range(n)]\n \n w0 = 0\n h0 = 0\n for i in range(n):\n if xya[i][2] == 1:\n w0 = xya[i][0]\n elif xya[i][2] == 2:\n- w = xya[i][0]\n elif xya[i][2] == 3:\n h0 = xya[i][1]\n else:\n- h = xya[i][1]\n \n print(max(0,(w-w0) * (h-h0)))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u961674365", "problem_id": "p02702", "submission1_id": "s801753575-FL", "submission2_id": "s419202249", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nn=len(s)\nrst=[0 for j in range(2019)]\nx=0\nans=0\nfor i in range(n):\n y=(int(s[n-1-i])*(10**i))%2019\n x+=y\n if x>=2019:\n x%=2019\n print(x,y)\n ans+=rst[x]\n rst[x]+=1\nif rst[0]==1:\n ans+=1\n\nprint(ans)", "code2": "s=input()\nn=len(s)\nrst=[0 for j in range(2019)]\nrst[0]=1\nx=0\nans=0\ndrst=1\nfor i in range(n):\n y=(int(s[n-1-i])*drst)%2019\n drst=(drst*10)%2019\n x+=y\n if x>=2019:\n x%=2019\n \n ans+=rst[x]\n rst[x]+=1\n\n \n\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1587950852", "date2": "1587953506", "bleu_score": "0.8278878864158989", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 74, "input": "1176854830\n", "actual_output": "0 0\n30 30\n830 800\n792 1981\n317 1544\n793 476\n325 1551\n1595 1270\n525 949\n1939 1414\n1\n", "expected_output": "1\n\n", "anno_code": ["s=input() # (0): s=1176854830\nn=len(s) # (1): n=10\nrst=[0 for j in range(2019)] # (2): rst=[0, 0, ..., 0, 0]\nx=0 # (3): x=0\nans=0 # (4): ans=0\nfor i in range(n): # (5): i=0 (12): i=1 ... (79): NO CHANGE\n y=(int(s[n-1-i])*(10**i))%2019 # (6): y=0 (13): y=30 ... (73): y=1414\n x+=y # (7): NO CHANGE (14): x=30 ... (74): x=1939\n if x>=2019: # (8): NO CHANGE (15): NO CHANGE ... (75): NO CHANGE\n x%=2019 # (30): x=792 (38): x=317 ... (68): x=525\n print(x,y) # (9): NO CHANGE (16): NO CHANGE ... (76): NO CHANGE\n ans+=rst[x] # (10): NO CHANGE (17): NO CHANGE ... (77): NO CHANGE\n rst[x]+=1 # (11): rst=[1, 0, ..., 0, 0] (18): rst=[1, 0, ..., 0, 0] ... (78): rst=[1, 0, ..., 0, 0]\nif rst[0]==1: # (80): NO CHANGE\n ans+=1 # (81): ans=1\n\nprint(ans)"], "anno_status": [true], "diff_content": " s=input()\n n=len(s)\n rst=[0 for j in range(2019)]\n+rst[0]=1\n x=0\n ans=0\n+drst=1\n for i in range(n):\n- y=(int(s[n-1-i])*(10**i))%2019\n+ y=(int(s[n-1-i])*drst)%2019\n+ drst=(drst*10)%2019\n x+=y\n if x>=2019:\n x%=2019\n- print(x,y)\n+ \n ans+=rst[x]\n rst[x]+=1\n-if rst[0]==1:\n- ans+=1\n+\n+ \n \n print(ans)\n", "FL_content": "\n s=input()\n n=len(s)\n rst=[0 for j in range(2019)]\n x=0\n ans=0\n for i in range(n):\n y=(int(s[n-1-i])*(10**i))%2019\n x+=y\n if x>=2019:\n x%=2019\n- print(x,y)\n ans+=rst[x]\n rst[x]+=1\n if rst[0]==1:\n ans+=1\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u516494592", "problem_id": "p03448", "submission1_id": "s721033324-FL", "submission2_id": "s746558790", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A = int(input())\nB = int(input())\nC = int(input())\nX = int(input())\n\ncount = 0\n\nfor i in range(A + 1):\n for j in range(B + 1):\n for k in range(C + 1):\n total = 500 * A + 100 * B + 50 * C\n if total == X:\n count = count + 1\n\nprint(count)", "code2": "A = int(input())\nB = int(input())\nC = int(input())\nX = int(input())\n\ncount = 0\n\nfor a in range(A + 1):\n for b in range(B + 1):\n for c in range(C + 1):\n total = 500 * a + 100 * b + 50 * c\n if total == X:\n count = count + 1\n\nprint(count)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590289683", "date2": "1590289906", "bleu_score": "0.9461201516864589", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0], "code1_test_score": 86, "total_score": 103, "input": "5\n0\n1\n0\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["A = int(input()) # (0): A=5\nB = int(input()) # (1): B=0\nC = int(input()) # (2): C=1\nX = int(input()) # (3): X=0\n\ncount = 0 # (4): count=0\n\nfor i in range(A + 1): # (5): i=0 (15): i=1 ... (65): NO CHANGE\n for j in range(B + 1): # (6): j=0 (14): NO CHANGE ... (64): NO CHANGE\n for k in range(C + 1): # (7): k=0 (10): k=1 ... (63): NO CHANGE\n total = 500 * A + 100 * B + 50 * C # (8): total=2550 (11): NO CHANGE ... (61): NO CHANGE\n if total == X: # (9): NO CHANGE (12): NO CHANGE ... (62): NO CHANGE\n count = count + 1\n\nprint(count)"], "anno_status": [true], "diff_content": " A = int(input())\n B = int(input())\n C = int(input())\n X = int(input())\n \n count = 0\n \n-for i in range(A + 1):\n- for j in range(B + 1):\n- for k in range(C + 1):\n- total = 500 * A + 100 * B + 50 * C\n+for a in range(A + 1):\n+ for b in range(B + 1):\n+ for c in range(C + 1):\n+ total = 500 * a + 100 * b + 50 * c\n if total == X:\n count = count + 1\n \n print(count)\n", "FL_content": "\n A = int(input())\n B = int(input())\n C = int(input())\n X = int(input())\n \n count = 0\n \n for i in range(A + 1):\n for j in range(B + 1):\n for k in range(C + 1):\n- total = 500 * A + 100 * B + 50 * C\n- if total == X:\n count = count + 1\n \n print(count)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u561231954", "problem_id": "p02958", "submission1_id": "s183157445-FL", "submission2_id": "s195365721", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\narray=[int(i) for i in input().split()]\n\nmistake=[]\nfor i in range(n):\n if array[i]!=i+1:\n mistake.append([i+1,array[i]])\n\nans='Yes'\nk=len(mistake)\nif k>2:\n ans='No'\nelif k==2:\n if mistake[0][0]!=mistake[1][1]:\n ans='No'\n\nprint(ans)\n ", "code2": "n=int(input())\narray=[int(i) for i in input().split()]\n\nmistake=[]\nfor i in range(n):\n if array[i]!=i+1:\n mistake.append([i+1,array[i]])\n\nans='YES'\nk=len(mistake)\nif k>2:\n ans='NO'\nelif k==2:\n if mistake[0][0]!=mistake[1][1]:\n ans='NO'\n\nprint(ans)\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572904602", "date2": "1572904681", "bleu_score": "0.9671001210590896", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "5\n1 20 -1 -2 0\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["n=int(input()) # (0): n=5\narray=[int(i) for i in input().split()] # (1): array=[1, 20, -1, -2, 0]\n\nmistake=[] # (2): mistake=[]\nfor i in range(n): # (3): i=0 (5): i=1 ... (17): NO CHANGE\n if array[i]!=i+1: # (4): NO CHANGE (6): NO CHANGE ... (15): NO CHANGE\n mistake.append([i+1,array[i]]) # (7): mistake (10): mistake ... (16): mistake\n\nans='Yes' # (18): ans=Yes\nk=len(mistake) # (19): k=4\nif k>2: # (20): NO CHANGE\n ans='No' # (21): ans=No\nelif k==2:\n if mistake[0][0]!=mistake[1][1]:\n ans='No'\n\nprint(ans)\n "], "anno_status": [true], "diff_content": " n=int(input())\n array=[int(i) for i in input().split()]\n \n mistake=[]\n for i in range(n):\n if array[i]!=i+1:\n mistake.append([i+1,array[i]])\n \n-ans='Yes'\n+ans='YES'\n k=len(mistake)\n if k>2:\n- ans='No'\n+ ans='NO'\n elif k==2:\n if mistake[0][0]!=mistake[1][1]:\n- ans='No'\n+ ans='NO'\n \n print(ans)\n \n", "FL_content": "\n n=int(input())\n array=[int(i) for i in input().split()]\n \n mistake=[]\n for i in range(n):\n if array[i]!=i+1:\n mistake.append([i+1,array[i]])\n \n-ans='Yes'\n k=len(mistake)\n if k>2:\n- ans='No'\n elif k==2:\n if mistake[0][0]!=mistake[1][1]:\n- ans='No'\n \n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u426649993", "problem_id": "p03254", "submission1_id": "s125114477-FL", "submission2_id": "s483350380", "status1": "Wrong Answer", "status2": "Accepted", "code1": "if __name__ == \"__main__\":\n n, x = map(int, input().split())\n a = list(map(int, input().split()))\n\n if sum(a) == x:\n print(n)\n exit()\n\n a.sort()\n\n ans = 0\n tmp = 0\n for aa in a:\n if tmp < x and aa <= x-tmp:\n tmp += aa\n ans += 1\n if tmp == x:\n print(ans)\n exit()\n if x-tmp > 0:\n ans -= 1\n\n print(ans)\n", "code2": "if __name__ == \"__main__\":\n n, x = map(int, input().split())\n a = list(map(int, input().split()))\n\n if sum(a) == x:\n print(n)\n exit()\n\n a.sort()\n\n ans = 0\n for i in range(n):\n if sum(a[:i+1]) <= x:\n ans = i+1\n else:\n print(i)\n exit()\n\n if sum(a[:ans]) == x:\n print(ans)\n else:\n print(ans-1)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1587341726", "date2": "1587341982", "bleu_score": "0.7991020448854764", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1], "code1_test_score": 50, "total_score": 104, "input": "2 10\n29 20\n", "actual_output": "-1\n", "expected_output": "0\n\n", "anno_code": ["if __name__ == \"__main__\":\n n, x = map(int, input().split())\n a = list(map(int, input().split()))\n\n if sum(a) == x:\n print(n)\n exit()\n\n a.sort()\n\n ans = 0\n tmp = 0\n for aa in a:\n if tmp < x and aa <= x-tmp:\n tmp += aa\n ans += 1\n if tmp == x:\n print(ans)\n exit()\n if x-tmp > 0:\n ans -= 1\n\n print(ans)\n"], "anno_status": [true], "diff_content": " if __name__ == \"__main__\":\n n, x = map(int, input().split())\n a = list(map(int, input().split()))\n \n if sum(a) == x:\n print(n)\n exit()\n \n a.sort()\n \n ans = 0\n- tmp = 0\n- for aa in a:\n- if tmp < x and aa <= x-tmp:\n- tmp += aa\n- ans += 1\n- if tmp == x:\n- print(ans)\n+ for i in range(n):\n+ if sum(a[:i+1]) <= x:\n+ ans = i+1\n+ else:\n+ print(i)\n exit()\n- if x-tmp > 0:\n- ans -= 1\n \n- print(ans)\n+ if sum(a[:ans]) == x:\n+ print(ans)\n+ else:\n+ print(ans-1)\n \n", "FL_content": "\n if __name__ == \"__main__\":\n n, x = map(int, input().split())\n a = list(map(int, input().split()))\n \n if sum(a) == x:\n- print(n)\n exit()\n \n a.sort()\n \n ans = 0\n tmp = 0\n for aa in a:\n if tmp < x and aa <= x-tmp:\n tmp += aa\n ans += 1\n if tmp == x:\n print(ans)\n exit()\n if x-tmp > 0:\n ans -= 1\n \n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u558528117", "problem_id": "p03856", "submission1_id": "s468917985-FL", "submission2_id": "s023355238", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(10000)\n\ndef solve(s):\n if s == \"\":\n return True\n elif s.endswith(\"dream\"):\n return solve(s[:-5])\n elif s.endswith(\"dreamer\"):\n return solve(s[:-7])\n elif s.endswith(\"erase\"):\n return solve(s[:-5])\n elif s.endswith(\"eraser\"):\n return solve(s[:-6])\n else:\n return False\n return False\n\n\ndef main():\n line = sys.stdin.readline()\n\n if solve(line):\n print(\"YES\")\n else:\n print(\"NO\")\n\n return 0\n\nif __name__ == '__main__':\n sys.exit(main())\n", "code2": "import sys\n\ndef solve(s):\n tmp_s = s\n while(len(tmp_s) > 0):\n if tmp_s.startswith(\"maerd\"):\n tmp_s = tmp_s[5:]\n elif tmp_s.startswith(\"remaerd\"):\n tmp_s = tmp_s[7:]\n elif tmp_s.startswith(\"esare\"):\n tmp_s = tmp_s[5:]\n elif tmp_s.startswith(\"resare\"):\n tmp_s = tmp_s[6:]\n else:\n return False\n\n return True\n\ndef main():\n line = sys.stdin.readline().rstrip()\n line_rev = line[::-1]\n\n if solve(line_rev):\n print(\"YES\")\n else:\n print(\"NO\")\n\n return 0\n\nif __name__ == '__main__':\n sys.exit(main())\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1492901797", "date2": "1492948313", "bleu_score": "0.6276201314294582", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "NO\n", "expected_output": "YES\n", "anno_code": ["import sys\nsys.setrecursionlimit(10000) # (0): NO CHANGE\n\ndef solve(s): # (1): solve=\n if s == \"\":\n return True\n elif s.endswith(\"dream\"):\n return solve(s[:-5])\n elif s.endswith(\"dreamer\"):\n return solve(s[:-7])\n elif s.endswith(\"erase\"):\n return solve(s[:-5])\n elif s.endswith(\"eraser\"):\n return solve(s[:-6])\n else:\n return False\n return False\n\n\ndef main(): # (2): main=\n line = sys.stdin.readline()\n\n if solve(line):\n print(\"YES\")\n else:\n print(\"NO\")\n\n return 0\n\nif __name__ == '__main__':\n sys.exit(main())\n"], "anno_status": [true], "diff_content": " import sys\n-sys.setrecursionlimit(10000)\n \n def solve(s):\n- if s == \"\":\n- return True\n- elif s.endswith(\"dream\"):\n- return solve(s[:-5])\n- elif s.endswith(\"dreamer\"):\n- return solve(s[:-7])\n- elif s.endswith(\"erase\"):\n- return solve(s[:-5])\n- elif s.endswith(\"eraser\"):\n- return solve(s[:-6])\n- else:\n- return False\n- return False\n+ tmp_s = s\n+ while(len(tmp_s) > 0):\n+ if tmp_s.startswith(\"maerd\"):\n+ tmp_s = tmp_s[5:]\n+ elif tmp_s.startswith(\"remaerd\"):\n+ tmp_s = tmp_s[7:]\n+ elif tmp_s.startswith(\"esare\"):\n+ tmp_s = tmp_s[5:]\n+ elif tmp_s.startswith(\"resare\"):\n+ tmp_s = tmp_s[6:]\n+ else:\n+ return False\n \n+ return True\n \n def main():\n- line = sys.stdin.readline()\n+ line = sys.stdin.readline().rstrip()\n+ line_rev = line[::-1]\n \n- if solve(line):\n+ if solve(line_rev):\n print(\"YES\")\n else:\n print(\"NO\")\n \n return 0\n \n if __name__ == '__main__':\n sys.exit(main())\n \n", "FL_content": "\n import sys\n sys.setrecursionlimit(10000)\n \n def solve(s):\n if s == \"\":\n return True\n- elif s.endswith(\"dream\"):\n- return solve(s[:-5])\n- elif s.endswith(\"dreamer\"):\n- return solve(s[:-7])\n- elif s.endswith(\"erase\"):\n- return solve(s[:-5])\n- elif s.endswith(\"eraser\"):\n- return solve(s[:-6])\n else:\n return False\n return False\n \n \n def main():\n line = sys.stdin.readline()\n \n if solve(line):\n print(\"YES\")\n else:\n print(\"NO\")\n \n return 0\n \n if __name__ == '__main__':\n sys.exit(main())\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 32 }, { "user_id": "u060938295", "problem_id": "p02697", "submission1_id": "s551674043-FL", "submission2_id": "s266067472", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nimport sys\n\n\nsys.setrecursionlimit(10 ** 9)\n\n\nmod = 10**9+7\n\n\nN, M = map(int,input().split())\n\n\n\n\n\n\n\nodd = (N % 2 != 0)\nans = []\nif odd:\n x = N - 1\nelse:\n x = N\n\nfor i in range(M):\n ans.append([i+1,x])\n x -= 1\n\nfor a in ans:\n print(' '.join(map(str,a)))\n ", "code2": "\n\n\nimport sys\n\n\nsys.setrecursionlimit(10 ** 9)\n\n\nmod = 10**9+7\n\n\nN, M = map(int,input().split())\n\n\n\n\n\n\n\nodd = (N % 2 != 0)\nans = []\nif odd:\n x = N - 1\n for i in range(M):\n ans.append([i+1,x])\n x -= 1\nelse:\n x = N\n flg = True\n for i in range(M):\n if flg and x - (i+1) <= N\n x -= 1\n flg = False\n ans.append([i+1,x])\n x -= 1\n\n\n\n\n\nfor a in ans:\n print(' '.join(map(str,a)))\n ", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1588470724", "date2": "1588472199", "bleu_score": "0.6083440268991649", "code1_test_status": [0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 6, "input": "24 11\n", "actual_output": "1 24\n2 23\n3 22\n4 21\n5 20\n6 19\n7 18\n8 17\n9 16\n10 15\n11 14\n", "expected_output": "1 12\n2 11\n3 10\n4 9\n5 8\n6 7\n13 23\n14 22\n15 21\n16 20\n17 19\n\n", "anno_code": ["\n\n\nimport sys\n\n\nsys.setrecursionlimit(10 ** 9) # (0): NO CHANGE\n\n\nmod = 10**9+7 # (1): mod=1000000007\n\n\nN, M = map(int,input().split()) # (2): N=24, M=11\n\n\n\n\n\n\n\nodd = (N % 2 != 0) # (3): odd=False\nans = [] # (4): ans=[]\nif odd: # (5): NO CHANGE\n x = N - 1\nelse:\n x = N # (6): x=24\n\nfor i in range(M): # (7): i=0 (10): i=1 ... (40): NO CHANGE\n ans.append([i+1,x]) # (8): ans (11): ans ... (38): ans\n x -= 1 # (9): x=23 (12): x=22 ... (39): x=13\n\nfor a in ans: # (41): a=[1, 24] (43): a=[2, 23] ... (61): a=[11, 14]\n print(' '.join(map(str,a))) # (42): NO CHANGE (44): NO CHANGE ... (62): NO CHANGE\n "], "anno_status": [true], "diff_content": " \n \n \n import sys\n \n \n sys.setrecursionlimit(10 ** 9)\n \n \n mod = 10**9+7\n \n \n N, M = map(int,input().split())\n \n \n \n \n \n \n \n odd = (N % 2 != 0)\n ans = []\n if odd:\n x = N - 1\n+ for i in range(M):\n+ ans.append([i+1,x])\n+ x -= 1\n else:\n x = N\n+ flg = True\n+ for i in range(M):\n+ if flg and x - (i+1) <= N\n+ x -= 1\n+ flg = False\n+ ans.append([i+1,x])\n+ x -= 1\n+\n+\n+\n \n-for i in range(M):\n- ans.append([i+1,x])\n- x -= 1\n \n for a in ans:\n print(' '.join(map(str,a)))\n \n", "FL_content": "\n \n \n \n import sys\n \n \n sys.setrecursionlimit(10 ** 9)\n \n \n mod = 10**9+7\n \n \n \n \n \n \n \n odd = (N % 2 != 0)\n ans = []\n if odd:\n x = N - 1\n else:\n x = N\n \n for i in range(M):\n ans.append([i+1,x])\n x -= 1\n \n for a in ans:\n print(' '.join(map(str,a)))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 34 }, { "user_id": "u419978514", "problem_id": "p02555", "submission1_id": "s651780798-FL", "submission2_id": "s557544618", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=int(input())\na=[0]*2001\nx=(10**9)+7\nif s<3:\n print(0)\n exit()\n \nelif 3<=x<6:\n for i in range(3,6):\n a[i]=1\n \nelse:\n for i in range(6,2001):\n a[i]=(sum(a[3:i-2])+1)%(x)\n\nprint(a[s])\n ", "code2": "s=int(input())\na=[0]*2001\nx=(10**9)+7\nif s<3:\n print(0)\n exit()\n\n \nelse:\n\n for i in range(3,6):\n a[i]=1\n\n for i in range(6,2001):\n a[i]=(sum(a[3:i-2])+1)%(x)\n\nprint(a[s])\n \n\n\n\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600035219", "date2": "1600035569", "bleu_score": "0.8821031678115925", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "1175\n", "actual_output": "248010664\n", "expected_output": "531468532\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " s=int(input())\n a=[0]*2001\n x=(10**9)+7\n if s<3:\n- print(0)\n- exit()\n- \n-elif 3<=x<6:\n- for i in range(3,6):\n- a[i]=1\n+ print(0)\n+ exit()\n+\n \n else:\n- for i in range(6,2001):\n- a[i]=(sum(a[3:i-2])+1)%(x)\n+\n+ for i in range(3,6):\n+ a[i]=1\n+\n+ for i in range(6,2001):\n+ a[i]=(sum(a[3:i-2])+1)%(x)\n \n print(a[s])\n \n+\n+\n+\n+\n", "FL_content": "\n s=int(input())\n a=[0]*2001\n x=(10**9)+7\n if s<3:\n print(0)\n exit()\n \n-elif 3<=x<6:\n for i in range(3,6):\n a[i]=1\n \n else:\n for i in range(6,2001):\n a[i]=(sum(a[3:i-2])+1)%(x)\n \n print(a[s])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u628732336", "problem_id": "p02413", "submission1_id": "s835234408-FL", "submission2_id": "s000455519", "status1": "Wrong Answer", "status2": "Accepted", "code1": "r, c = [int(i) for i in input().split()]\n\ndata = []\nsum_row = [0] * (c + 1)\n\nfor ri in range(r):\n data.append([int(i) for i in input().split()])\n data[ri].append(sum(data[ri]))\n print(\" \".join([str(d) for d in data[ri]]))\n for ci in range(c + 1):\n sum_row[ci] += data[ri][ci]\n\nprint(\" \".join([str(s) for s in sum_row]))\n\nfrom pprint import pprint\npprint(data)\npprint(sum_row)", "code2": "r, c = [int(i) for i in input().split()]\n\ndata = []\nsum_row = [0] * (c + 1)\n\nfor ri in range(r):\n data.append([int(i) for i in input().split()])\n data[ri].append(sum(data[ri]))\n print(\" \".join([str(d) for d in data[ri]]))\n for ci in range(c + 1):\n sum_row[ci] += data[ri][ci]\n\nprint(\" \".join([str(s) for s in sum_row]))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1470199481", "date2": "1470199498", "bleu_score": "0.8473169312608667", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "4 5\n4 1 3 5 0\n4 4 1 6 10\n3 4 0 1 3\n2 0 4 18 5\n", "actual_output": "4 1 3 5 0 13\n4 4 1 6 10 25\n3 4 0 1 3 11\n2 0 4 18 5 29\n13 9 8 30 18 78\n[[4, 1, 3, 5, 0, 13],\n [4, 4, 1, 6, 10, 25],\n [3, 4, 0, 1, 3, 11],\n [2, 0, 4, 18, 5, 29]]\n[13, 9, 8, 30, 18, 78]\n", "expected_output": "4 1 3 5 0 13\n4 4 1 6 10 25\n3 4 0 1 3 11\n2 0 4 18 5 29\n13 9 8 30 18 78\n\n", "anno_code": ["r, c = [int(i) for i in input().split()] # (0): r=4, c=5\n\ndata = [] # (1): data=[]\nsum_row = [0] * (c + 1) # (2): sum_row=[0, 0, 0, 0, 0, 0]\n\nfor ri in range(r): # (3): ri=0 (20): ri=1 ... (71): NO CHANGE\n data.append([int(i) for i in input().split()]) # (4): data (21): data ... (55): data\n data[ri].append(sum(data[ri])) # (5): data (22): data ... (56): data\n print(\" \".join([str(d) for d in data[ri]])) # (6): NO CHANGE (23): NO CHANGE ... (57): NO CHANGE\n for ci in range(c + 1): # (7): ci=0 (9): ci=1 ... (70): NO CHANGE\n sum_row[ci] += data[ri][ci] # (8): sum_row=[4, 0, 0, 0, 0, 0] (10): sum_row=[4, 1, 0, 0, 0, 0] ... (69): sum_row=[13, 9, 8, 30, 18, 78]\n\nprint(\" \".join([str(s) for s in sum_row])) # (72): pprint=\n\nfrom pprint import pprint\npprint(data) # (73): NO CHANGE\npprint(sum_row)"], "anno_status": [true], "diff_content": " r, c = [int(i) for i in input().split()]\n \n data = []\n sum_row = [0] * (c + 1)\n \n for ri in range(r):\n data.append([int(i) for i in input().split()])\n data[ri].append(sum(data[ri]))\n print(\" \".join([str(d) for d in data[ri]]))\n for ci in range(c + 1):\n sum_row[ci] += data[ri][ci]\n \n print(\" \".join([str(s) for s in sum_row]))\n-\n-from pprint import pprint\n-pprint(data)\n-pprint(sum_row)\n", "FL_content": "\n r, c = [int(i) for i in input().split()]\n \n data = []\n sum_row = [0] * (c + 1)\n \n for ri in range(r):\n data.append([int(i) for i in input().split()])\n data[ri].append(sum(data[ri]))\n- print(\" \".join([str(d) for d in data[ri]]))\n for ci in range(c + 1):\n sum_row[ci] += data[ri][ci]\n \n print(\" \".join([str(s) for s in sum_row]))\n \n-from pprint import pprint\n-pprint(data)\n-pprint(sum_row)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u370608397", "problem_id": "p03838", "submission1_id": "s188529096-FL", "submission2_id": "s641932040", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y=map(int,input().split())\nans=abs(abs(x)-abs(y))\nif x>=0:\n if y<0:\n ans+=1\n elif x>y:\n ans+=2\nelse:\n if y>0:\n ans+=1\n elif x>y:\n ans+=2\n\nprint(ans)", "code2": "x,y=map(int,input().split())\nans=abs(abs(x)-abs(y))\nif y==0:\n if x>0:\n ans+=1\nelif x>=0:\n if y<0:\n ans+=1\n elif x>y:\n ans+=2\nelse:\n if y>0:\n ans+=1\n elif x>y:\n ans+=2\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568346729", "date2": "1568347790", "bleu_score": "0.832225080540225", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 68, "total_score": 90, "input": "664 0\n", "actual_output": "666\n", "expected_output": "665\n\n", "anno_code": ["x,y=map(int,input().split()) # (0): x=664, y=0\nans=abs(abs(x)-abs(y)) # (1): ans=664\nif x>=0: # (2): NO CHANGE\n if y<0: # (3): NO CHANGE\n ans+=1\n elif x>y: # (4): NO CHANGE\n ans+=2 # (5): ans=666\nelse:\n if y>0:\n ans+=1\n elif x>y:\n ans+=2\n\nprint(ans)"], "anno_status": [true], "diff_content": " x,y=map(int,input().split())\n ans=abs(abs(x)-abs(y))\n-if x>=0:\n+if y==0:\n+ if x>0:\n+ ans+=1\n+elif x>=0:\n if y<0:\n ans+=1\n elif x>y:\n ans+=2\n else:\n if y>0:\n ans+=1\n elif x>y:\n ans+=2\n \n print(ans)\n", "FL_content": "\n x,y=map(int,input().split())\n-ans=abs(abs(x)-abs(y))\n if x>=0:\n if y<0:\n ans+=1\n elif x>y:\n ans+=2\n else:\n if y>0:\n ans+=1\n elif x>y:\n ans+=2\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u612223903", "problem_id": "p03164", "submission1_id": "s954761711-FL", "submission2_id": "s737219767", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,W = map(int,input().split())\nw = []\nv = []\nfor _ in range(n):\n weight,value = map(int,input().split())\n w.append(weight)\n v.append(value)\nINF =float(\"inf\")\norder = 150\ndp = [[INF] * order for _ in range(n+1)] \ndp[0] =[-INF] * order\ndp[0][0]=0\nfor i in range(n):\n for value in range(order):\n if value - v[i] >= 0:\n dp[i+1][value] = min(dp[i+1][value], dp[i][value-v[i]] + w[i])\n if dp[i][value] != -INF:\n dp[i+1][value] = min(dp[i+1][value],dp[i][value])\nans = 0\nfor value in range(order):\n if 0<=dp[n][value]<= W:\n ans = max(ans,value)\n\nprint(ans)\n", "code2": "n,W = map(int,input().split())\nw = []\nv = []\nfor _ in range(n):\n weight,value = map(int,input().split())\n w.append(weight)\n v.append(value)\n\nINF = float(\"inf\")\norder = 10**5 + 1 \ndp = [[INF] * order for _ in range(n+1)] \ndp[0][0] = 0\n\nfor i in range(n):\n for value in range(order):\n if value-v[i]>= 0:\n dp[i+1][value] = min(dp[i+1][value],dp[i][value-v[i]] + w[i])\n dp[i+1][value] = min(dp[i+1][value],dp[i][value])\n\nans = 0\nfor value in range(order):\n if dp[n][value] <= W:\n ans = max(ans,value)\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589627163", "date2": "1589628450", "bleu_score": "0.8679569246042043", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 90, "total_score": 103, "input": "3 1\n0 0\n-1 42\n1 180\n", "actual_output": "0\n", "expected_output": "222\n\n", "anno_code": ["n,W = map(int,input().split()) # (0): n=3, W=1\nw = [] # (1): w=[]\nv = [] # (2): v=[]\nfor _ in range(n): # (3): _=0 (7): _=1 ... (15): NO CHANGE\n weight,value = map(int,input().split()) # (4): weight=0, value=0 (8): weight=-1, value=42 (12): weight=1, value=180\n w.append(weight) # (5): w=[0] (9): w=[0, -1] (13): w=[0, -1, 1]\n v.append(value) # (6): v=[0] (10): v=[0, 42] (14): v=[0, 42, 180]\nINF =float(\"inf\") # (16): INF=inf\norder = 150 # (17): order=150\ndp = [[INF] * order for _ in range(n+1)] # (18): dp\ndp[0] =[-INF] * order # (19): dp\ndp[0][0]=0 # (20): dp\nfor i in range(n): # (21): i=0 (624): i=1 ... (1680): NO CHANGE\n for value in range(order): # (22): value=0 (27): value=1 ... (1679): NO CHANGE\n if value - v[i] >= 0: # (23): NO CHANGE (28): NO CHANGE ... (1677): NO CHANGE\n dp[i+1][value] = min(dp[i+1][value], dp[i][value-v[i]] + w[i]) # (24): dp (29): dp ... (1182): dp\n if dp[i][value] != -INF: # (25): NO CHANGE (30): NO CHANGE ... (1678): NO CHANGE\n dp[i+1][value] = min(dp[i+1][value],dp[i][value]) # (26): NO CHANGE (628): dp ... (1357): dp\nans = 0 # (1681): ans=0\nfor value in range(order): # (1682): value=0 (1685): value=1 ... (1983): NO CHANGE\n if 0<=dp[n][value]<= W: # (1683): NO CHANGE (1686): NO CHANGE ... (1982): NO CHANGE\n ans = max(ans,value) # (1684): NO CHANGE\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " n,W = map(int,input().split())\n w = []\n v = []\n for _ in range(n):\n weight,value = map(int,input().split())\n w.append(weight)\n v.append(value)\n-INF =float(\"inf\")\n-order = 150\n+\n+INF = float(\"inf\")\n+order = 10**5 + 1 \n dp = [[INF] * order for _ in range(n+1)] \n-dp[0] =[-INF] * order\n-dp[0][0]=0\n-for i in range(n):\n+dp[0][0] = 0\n+\n+for i in range(n):\n for value in range(order):\n- if value - v[i] >= 0:\n- dp[i+1][value] = min(dp[i+1][value], dp[i][value-v[i]] + w[i])\n- if dp[i][value] != -INF:\n- dp[i+1][value] = min(dp[i+1][value],dp[i][value])\n+ if value-v[i]>= 0:\n+ dp[i+1][value] = min(dp[i+1][value],dp[i][value-v[i]] + w[i])\n+ dp[i+1][value] = min(dp[i+1][value],dp[i][value])\n+\n ans = 0\n for value in range(order):\n- if 0<=dp[n][value]<= W:\n+ if dp[n][value] <= W:\n ans = max(ans,value)\n-\n print(ans)\n-\n", "FL_content": "\n n,W = map(int,input().split())\n w = []\n v = []\n for _ in range(n):\n weight,value = map(int,input().split())\n w.append(weight)\n v.append(value)\n INF =float(\"inf\")\n order = 150\n dp = [[INF] * order for _ in range(n+1)] \n dp[0] =[-INF] * order\n dp[0][0]=0\n for i in range(n):\n for value in range(order):\n if value - v[i] >= 0:\n dp[i+1][value] = min(dp[i+1][value], dp[i][value-v[i]] + w[i])\n if dp[i][value] != -INF:\n dp[i+1][value] = min(dp[i+1][value],dp[i][value])\n ans = 0\n for value in range(order):\n if 0<=dp[n][value]<= W:\n ans = max(ans,value)\n \n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 25 }, { "user_id": "u970899068", "problem_id": "p03380", "submission1_id": "s602420285-FL", "submission2_id": "s740237347", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=list(map(int, input().split()))\nans=[]\nx=max(a)\nans.append(x)\ny=x\nb=10**9\nd=10**9\nfor i in range(n):\n c=abs(a[i]-y)\n if b>c:\n d=a[i]\n b=min(b,c)\nans.append(d)\nprint(*ans)\n\n \n\n", "code2": "n=int(input())\na=list(map(int, input().split()))\nans=[]\nx=max(a)\nans.append(x)\na.remove(max(a))\ny=x/2\nb=10**10\nd=10**10\n\nfor i in range(n-1):\n c=abs(a[i]-y)\n if b>c:\n d=a[i]\n b=min(b,c)\nans.append(d)\nprint(*ans)\n\n\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569799453", "date2": "1569800153", "bleu_score": "0.8535400950984214", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "5\n1 9 0 8 16\n", "actual_output": "16 16\n", "expected_output": "16 8\n\n", "anno_code": ["n=int(input()) # (0): n=5\na=list(map(int, input().split())) # (1): a=[1, 9, 0, 8, 16]\nans=[] # (2): ans=[]\nx=max(a) # (3): x=16\nans.append(x) # (4): ans=[16]\ny=x # (5): y=16\nb=10**9 # (6): b=1000000000\nd=10**9 # (7): d=1000000000\nfor i in range(n): # (8): i=0 (13): i=1 ... (31): NO CHANGE\n c=abs(a[i]-y) # (9): c=15 (14): c=7 ... (27): c=0\n if b>c: # (10): NO CHANGE (15): NO CHANGE ... (28): NO CHANGE\n d=a[i] # (11): d=1 (16): d=9 (29): d=16\n b=min(b,c) # (12): b=15 (17): b=7 ... (30): b=0\nans.append(d) # (32): ans=[16, 16]\nprint(*ans)\n\n \n\n"], "anno_status": [true], "diff_content": " n=int(input())\n a=list(map(int, input().split()))\n ans=[]\n x=max(a)\n ans.append(x)\n-y=x\n-b=10**9\n-d=10**9\n-for i in range(n):\n+a.remove(max(a))\n+y=x/2\n+b=10**10\n+d=10**10\n+\n+for i in range(n-1):\n c=abs(a[i]-y)\n if b>c:\n d=a[i]\n b=min(b,c)\n ans.append(d)\n print(*ans)\n \n- \n+\n \n \n", "FL_content": "\n n=int(input())\n a=list(map(int, input().split()))\n ans=[]\n x=max(a)\n ans.append(x)\n y=x\n b=10**9\n d=10**9\n for i in range(n):\n c=abs(a[i]-y)\n if b>c:\n d=a[i]\n- b=min(b,c)\n ans.append(d)\n print(*ans)\n \n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u610816226", "problem_id": "p02410", "submission1_id": "s727161014-FL", "submission2_id": "s630286297", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\nn_l = []\nans = [0, 0, 0]\n\nfor _ in range(n):\n l = list(map(int, input().split()))\n n_l.append(l)\nfor x in range(m):\n p = int(input())\n for o in range(n):\n n_l[o] *= p\nfor i in n_l:\n print(sum(i))\n", "code2": "n, m = map(int, input().split())\nn_l = []\nans = [0, 0, 0]\n\nfor _ in range(n):\n l = list(map(int, input().split()))\n n_l.append(l)\nfor x in range(m):\n p = int(input())\n for o in range(n):\n n_l[o][x] *= p\nfor i in n_l:\n print(sum(i))\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556870607", "date2": "1556870831", "bleu_score": "0.9851287744977599", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 4\n1 1 0 1\n0 3 1 1\n0 0 1 -1\n1\n2\n0\n0\n", "actual_output": "0\n0\n0\n", "expected_output": "3\n6\n0\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=3, m=4\nn_l = [] # (1): n_l=[]\nans = [0, 0, 0] # (2): ans=[0, 0, 0]\n\nfor _ in range(n): # (3): _=0 (6): _=1 ... (12): NO CHANGE\n l = list(map(int, input().split())) # (4): l=[1, 1, 0, 1] (7): l=[0, 3, 1, 1] (10): l=[0, 0, 1, -1]\n n_l.append(l) # (5): n_l=[[1, 1, 0, 1]] (8): n_l (11): n_l\nfor x in range(m): # (13): x=0 (22): x=1 ... (49): NO CHANGE\n p = int(input()) # (14): p=1 (23): p=2 ... (41): NO CHANGE\n for o in range(n): # (15): o=0 (17): o=1 ... (48): NO CHANGE\n n_l[o] *= p # (16): NO CHANGE (18): NO CHANGE ... (47): NO CHANGE\nfor i in n_l: # (50): i=[] (52): NO CHANGE (54): NO CHANGE\n print(sum(i)) # (51): NO CHANGE (53): NO CHANGE (55): NO CHANGE\n"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n n_l = []\n ans = [0, 0, 0]\n \n for _ in range(n):\n l = list(map(int, input().split()))\n n_l.append(l)\n for x in range(m):\n p = int(input())\n for o in range(n):\n- n_l[o] *= p\n+ n_l[o][x] *= p\n for i in n_l:\n print(sum(i))\n \n", "FL_content": "\n n, m = map(int, input().split())\n n_l = []\n-ans = [0, 0, 0]\n \n for _ in range(n):\n l = list(map(int, input().split()))\n n_l.append(l)\n for x in range(m):\n p = int(input())\n for o in range(n):\n n_l[o] *= p\n for i in n_l:\n print(sum(i))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u859125915", "problem_id": "p03617", "submission1_id": "s129630402-FL", "submission2_id": "s886869842", "status1": "Wrong Answer", "status2": "Accepted", "code1": "q,h,s,d=map(int,input().split())\nn=int(input())\n \nl=min(q*n*8,h*n*4,s*n*2,d*n)\nif l != d*n:\n print(l/2)\nelse:\n m=min(q*4,h*2,s)\n print((d*(n-1)/2)+m if n%2==1 else l/2)", "code2": "q,h,s,d=map(int,input().split())\nn=int(input())\n \nl=min(q*n*8,h*n*4,s*n*2,d*n)\nif l != d*n:\n print(l\nelse:\n m=min(q*4,h*2,s)\n print((d*(n-1))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586133048", "date2": "1586133280", "bleu_score": "0.824813999693215", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 104, "input": "20 30 126 63\n1\n", "actual_output": "60.0\n", "expected_output": "60\n\n", "anno_code": ["q,h,s,d=map(int,input().split()) # (0): q=20, h=30, s=126, d=63\nn=int(input()) # (1): n=1\n \nl=min(q*n*8,h*n*4,s*n*2,d*n) # (2): l=63\nif l != d*n: # (3): NO CHANGE\n print(l/2)\nelse:\n m=min(q*4,h*2,s) # (4): m=60\n print((d*(n-1)/2)+m if n%2==1 else l/2)"], "anno_status": [true], "diff_content": " q,h,s,d=map(int,input().split())\n n=int(input())\n \n l=min(q*n*8,h*n*4,s*n*2,d*n)\n if l != d*n:\n- print(l/2)\n+ print(l\n else:\n m=min(q*4,h*2,s)\n- print((d*(n-1)/2)+m if n%2==1 else l/2)\n+ print((d*(n-1))\n+\n", "FL_content": "\n q,h,s,d=map(int,input().split())\n n=int(input())\n \n l=min(q*n*8,h*n*4,s*n*2,d*n)\n if l != d*n:\n- print(l/2)\n else:\n m=min(q*4,h*2,s)\n- print((d*(n-1)/2)+m if n%2==1 else l/2)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u614181788", "problem_id": "p04044", "submission1_id": "s020589925-FL", "submission2_id": "s535660481", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,l = map(int,input().split())\ns = [0]*n\nfor i in range(n):\n s[i] = input()\ns = sorted(s)\nans = []\nfor i in range(n):\n ans.extend(s[i])\nprint(ans)", "code2": "n,l = map(int,input().split())\ns = [0]*n\nfor i in range(n):\n s[i] = input()\ns = sorted(s)\nans = []\nfor i in range(n):\n print(s[i],end=\"\")\nprint(\"\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588552933", "date2": "1588553036", "bleu_score": "0.8953241443743615", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 3\nxcw\nxxa\ndxy\n", "actual_output": "['d', 'x', 'y', 'x', 'c', 'w', 'x', 'x', 'a']\n", "expected_output": "dxyxcwxxa\n\n", "anno_code": ["n,l = map(int,input().split()) # (0): n=3, l=3\ns = [0]*n # (1): s=[0, 0, 0]\nfor i in range(n): # (2): i=0 (4): i=1 ... (8): NO CHANGE\n s[i] = input() # (3): s=['xcw', 0, 0] (5): s=['xcw', 'xxa', 0] (7): s=['xcw', 'xxa', 'dxy']\ns = sorted(s) # (9): s=['dxy', 'xcw', 'xxa']\nans = [] # (10): ans=[]\nfor i in range(n): # (11): i=0 (13): i=1 ... (17): NO CHANGE\n ans.extend(s[i]) # (12): ans=['d', 'x', 'y'] (14): ans=['d', 'x', 'y', 'x', 'c', 'w'] (16): ans=['d', 'x', 'y', 'x', 'c', 'w', 'x', 'x', 'a']\nprint(ans)"], "anno_status": [true], "diff_content": " n,l = map(int,input().split())\n s = [0]*n\n for i in range(n):\n s[i] = input()\n s = sorted(s)\n ans = []\n for i in range(n):\n- ans.extend(s[i])\n-print(ans)\n+ print(s[i],end=\"\")\n+print(\"\")\n", "FL_content": "\n n,l = map(int,input().split())\n s = [0]*n\n for i in range(n):\n s[i] = input()\n s = sorted(s)\n ans = []\n for i in range(n):\n ans.extend(s[i])\n-print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u550061714", "problem_id": "p02537", "submission1_id": "s681878376-FL", "submission2_id": "s050068231", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\n\nclass SegmentTree:\n \n\n def __init__(self, size, f=lambda x, y: max(x, y), default=0):\n self.size = 2 ** (size - 1).bit_length()\n self.default = default\n self.dat = [default] * (self.size * 2)\n self.f = f\n\n def update(self, i, x):\n i += self.size\n self.dat[i] = x\n while i > 0:\n i >>= 1\n self.dat[i] = self.f(self.dat[i * 2], self.dat[i * 2 + 1])\n\n def query(self, l, r):\n l += self.size\n r += self.size\n lres, rres = self.default, self.default\n while l < r:\n if l & 1:\n lres = self.f(lres, self.dat[l])\n l += 1\n\n if r & 1:\n r -= 1\n rres = self.f(self.dat[r], rres)\n l >>= 1\n r >>= 1\n res = self.f(lres, rres)\n return res\n\n\ninput = sys.stdin.buffer.readline\n\nN, K = map(int, input().split())\nMAX = 300010\nB = SegmentTree(MAX)\n\nfor _ in range(N):\n a = int(input())\n m = B.query(max(1, a - K), min(MAX, a + K + 1))\n B.update(a, m + 1)\nprint(B.query(1, MAX))\n", "code2": "import sys\n\n\nclass SegmentTree:\n \n\n def __init__(self, size, f=lambda x, y: max(x, y), default=0):\n self.size = 2 ** (size - 1).bit_length()\n self.default = default\n self.dat = [default] * (self.size * 2)\n self.f = f\n\n def update(self, i, x):\n i += self.size\n self.dat[i] = x\n while i > 0:\n i >>= 1\n self.dat[i] = self.f(self.dat[i * 2], self.dat[i * 2 + 1])\n\n def query(self, l, r):\n l += self.size\n r += self.size\n lres, rres = self.default, self.default\n while l < r:\n if l & 1:\n lres = self.f(lres, self.dat[l])\n l += 1\n\n if r & 1:\n r -= 1\n rres = self.f(self.dat[r], rres)\n l >>= 1\n r >>= 1\n res = self.f(lres, rres)\n return res\n\n\ninput = sys.stdin.buffer.readline\n\nN, K = map(int, input().split())\nMAX = 300010\nB = SegmentTree(MAX)\nfor _ in range(N):\n a = int(input()) + 1\n m = B.query(max(1, a - K), min(MAX, a + K + 1))\n B.update(a, m + 1)\nprint(B.query(1, MAX))\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601170420", "date2": "1601170736", "bleu_score": "0.994353398029145", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 81, "total_score": 101, "input": "10 3\n1\n5\n2\n0\n6\n0\n9\n8\n4\n2\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["import sys\n\n\nclass SegmentTree: # (0): SegmentTree=\n \n\n def __init__(self, size, f=lambda x, y: max(x, y), default=0):\n self.size = 2 ** (size - 1).bit_length() # (5): NO CHANGE\n self.default = default # (6): NO CHANGE\n self.dat = [default] * (self.size * 2) # (7): NO CHANGE\n self.f = f # (8): sys=, SegmentTree=, input=, N=10, K=3, MAX=300010, B=\n\n def update(self, i, x):\n i += self.size # (34): i=524289 (127): i=524293 ... (847): i=524290\n self.dat[i] = x # (35): NO CHANGE (128): NO CHANGE ... (848): NO CHANGE\n while i > 0: # (36): NO CHANGE (39): NO CHANGE ... (909): sys=, SegmentTree=, input=, N=10, K=3, MAX=300010, B=, _=9, a=2, m=3\n i >>= 1 # (37): i=262144 (40): i=131072 ... (907): i=0\n self.dat[i] = self.f(self.dat[i * 2], self.dat[i * 2 + 1]) # (38): NO CHANGE (41): NO CHANGE ... (908): NO CHANGE\n\n def query(self, l, r):\n l += self.size # (12): l=524289 (100): l=524290 ... (912): l=524289\n r += self.size # (13): r=524293 (101): r=524297 ... (913): r=824298\n lres, rres = self.default, self.default # (14): lres=0, rres=0 (102): lres=0, rres=0 ... (914): lres=0, rres=0\n while l < r: # (15): NO CHANGE (24): NO CHANGE ... (1059): NO CHANGE\n if l & 1: # (16): NO CHANGE (25): NO CHANGE ... (1053): NO CHANGE\n lres = self.f(lres, self.dat[l]) # (17): NO CHANGE (26): NO CHANGE ... (1054): NO CHANGE\n l += 1 # (18): l=524290 (27): l=262146 ... (1055): l=6\n\n if r & 1: # (19): NO CHANGE (28): NO CHANGE ... (1056): NO CHANGE\n r -= 1 # (20): r=524292 (106): r=524296 ... (1041): r=24\n rres = self.f(self.dat[r], rres) # (21): NO CHANGE (107): NO CHANGE ... (1042): NO CHANGE\n l >>= 1 # (22): l=262145 (29): l=131073 ... (1057): l=3\n r >>= 1 # (23): r=262146 (30): r=131073 ... (1058): r=3\n res = self.f(lres, rres) # (32): sys=, SegmentTree=, input=, N=10, K=3, MAX=300010, B=, _=0, a=1, m=0 (125): sys=, SegmentTree=, input=, N=10, K=3, MAX=300010, B=, _=1, a=5, m=0 ... (845): sys=, SegmentTree=, input=, N=10, K=3, MAX=300010, B=, _=9, a=2, m=3\n return res\n\n\ninput = sys.stdin.buffer.readline # (1): input=\n\nN, K = map(int, input().split()) # (2): N=10, K=3\nMAX = 300010 # (3): MAX=300010\nB = SegmentTree(MAX) # (4): self=, size=300010, f= at 0x0000014253CB9B40>, default=0\n\nfor _ in range(N): # (9): _=0 (97): _=1 ... (910): NO CHANGE\n a = int(input()) # (10): a=1 (98): a=5 ... (823): a=2\n m = B.query(max(1, a - K), min(MAX, a + K + 1)) # (11): self=, l=1, r=5 (99): self=, l=2, r=9 ... (824): self=, l=1, r=6\n B.update(a, m + 1) # (33): self=, i=1, x=1 (126): self=, i=5, x=1 ... (846): self=, i=2, x=4\nprint(B.query(1, MAX)) # (911): self=, l=1, r=300010\n"], "anno_status": [false], "diff_content": " import sys\n \n \n class SegmentTree:\n \n \n def __init__(self, size, f=lambda x, y: max(x, y), default=0):\n self.size = 2 ** (size - 1).bit_length()\n self.default = default\n self.dat = [default] * (self.size * 2)\n self.f = f\n \n def update(self, i, x):\n i += self.size\n self.dat[i] = x\n while i > 0:\n i >>= 1\n self.dat[i] = self.f(self.dat[i * 2], self.dat[i * 2 + 1])\n \n def query(self, l, r):\n l += self.size\n r += self.size\n lres, rres = self.default, self.default\n while l < r:\n if l & 1:\n lres = self.f(lres, self.dat[l])\n l += 1\n \n if r & 1:\n r -= 1\n rres = self.f(self.dat[r], rres)\n l >>= 1\n r >>= 1\n res = self.f(lres, rres)\n return res\n \n \n input = sys.stdin.buffer.readline\n \n N, K = map(int, input().split())\n MAX = 300010\n B = SegmentTree(MAX)\n-\n for _ in range(N):\n- a = int(input())\n+ a = int(input()) + 1\n m = B.query(max(1, a - K), min(MAX, a + K + 1))\n B.update(a, m + 1)\n print(B.query(1, MAX))\n \n", "FL_content": "\n import sys\n \n \n class SegmentTree:\n \n \n def __init__(self, size, f=lambda x, y: max(x, y), default=0):\n self.size = 2 ** (size - 1).bit_length()\n self.default = default\n self.dat = [default] * (self.size * 2)\n self.f = f\n \n def update(self, i, x):\n i += self.size\n self.dat[i] = x\n while i > 0:\n i >>= 1\n self.dat[i] = self.f(self.dat[i * 2], self.dat[i * 2 + 1])\n \n def query(self, l, r):\n l += self.size\n r += self.size\n lres, rres = self.default, self.default\n while l < r:\n if l & 1:\n lres = self.f(lres, self.dat[l])\n l += 1\n \n if r & 1:\n r -= 1\n rres = self.f(self.dat[r], rres)\n l >>= 1\n r >>= 1\n res = self.f(lres, rres)\n return res\n \n \n input = sys.stdin.buffer.readline\n \n N, K = map(int, input().split())\n MAX = 300010\n B = SegmentTree(MAX)\n \n for _ in range(N):\n a = int(input())\n m = B.query(max(1, a - K), min(MAX, a + K + 1))\n B.update(a, m + 1)\n print(B.query(1, MAX))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 49 }, { "user_id": "u102655885", "problem_id": "p02536", "submission1_id": "s561277202-FL", "submission2_id": "s132965694", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nclass UnionFind:\n def __init__(self, size):\n self.parent_indexes = [-1] * size\n \n def find(self, n):\n if self.parent_indexes[n] < 0:\n return n\n \n \n self.parent_indexes[n] = self.find(self.parent_indexes[n])\n return self.parent_indexes[n] \n \n def union(self, n1, n2):\n if self.same_group(n1, n2):\n return False\n \n \n if self.size(n1) >= self.size(n2):\n tmp = self.size(n2)\n self.parent_indexes[self.find(n2)] = self.find(n1)\n self.parent_indexes[self.find(n1)] -= tmp\n return True\n \n \n tmp = self.size(n1)\n self.parent_indexes[self.find(n1)] = self.find(n2)\n self.parent_indexes[self.find(n2)] -= tmp\n return True\n \n \n def size(self, n):\n return -self.parent_indexes[self.find(n)]\n \n def same_group(self, n1, n2):\n return self.find(n1) == self.find(n2)\n\nn, m = map(lambda x: int(x), input().split())\n\n\nuf = UnionFind(n)\n\nfor _ in range(m):\n a, b = map(lambda x: int(x), input().split())\n uf.union(a-1, b-1)\n \nnum_parents = 0\n \nfor p_index in uf.parent_indexes:\n if p_index < 0:\n num_parents += 1\nprint(math.ceil((math.log2(num_parents))))", "code2": "import math\n\nclass UnionFind:\n def __init__(self, size):\n self.parent_indexes = [-1] * size\n \n def find(self, n):\n if self.parent_indexes[n] < 0:\n return n\n \n \n self.parent_indexes[n] = self.find(self.parent_indexes[n])\n return self.parent_indexes[n] \n \n def union(self, n1, n2):\n if self.same_group(n1, n2):\n return False\n \n \n if self.size(n1) >= self.size(n2):\n tmp = self.size(n2)\n self.parent_indexes[self.find(n2)] = self.find(n1)\n self.parent_indexes[self.find(n1)] -= tmp\n return True\n \n \n tmp = self.size(n1)\n self.parent_indexes[self.find(n1)] = self.find(n2)\n self.parent_indexes[self.find(n2)] -= tmp\n return True\n \n \n def size(self, n):\n return -self.parent_indexes[self.find(n)]\n \n def same_group(self, n1, n2):\n return self.find(n1) == self.find(n2)\n\nn, m = map(lambda x: int(x), input().split())\n\n\nuf = UnionFind(n)\n\nfor _ in range(m):\n a, b = map(lambda x: int(x), input().split())\n uf.union(a-1, b-1)\n \nnum_parents = 0\n \nfor p_index in uf.parent_indexes:\n if p_index < 0:\n num_parents += 1\n\nprint(num_parents - 1)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1601169480", "date2": "1601169789", "bleu_score": "0.9797077305005434", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 4, "total_score": 90, "input": "79 1\n2 9\n", "actual_output": "7\n", "expected_output": "77\n\n", "anno_code": ["import math\n\nclass UnionFind: # (0): UnionFind=\n def __init__(self, size):\n self.parent_indexes = [-1] * size # (3): math=, UnionFind=, n=79, m=1, uf=\n \n def find(self, n):\n if self.parent_indexes[n] < 0: # (8): n=8 (9): n1=1, n2=8 ... (19): math=, UnionFind=, n=79, m=1, uf=, _=0, a=2, b=9\n return n\n \n \n self.parent_indexes[n] = self.find(self.parent_indexes[n])\n return self.parent_indexes[n] \n \n def union(self, n1, n2):\n if self.same_group(n1, n2): # (7): n=1\n return False\n \n \n if self.size(n1) >= self.size(n2): # (10): n=1\n tmp = self.size(n2) # (13): n=8\n self.parent_indexes[self.find(n2)] = self.find(n1) # (15): n=1\n self.parent_indexes[self.find(n1)] -= tmp # (18): n=1\n return True\n \n \n tmp = self.size(n1)\n self.parent_indexes[self.find(n1)] = self.find(n2)\n self.parent_indexes[self.find(n2)] -= tmp\n return True\n \n \n def size(self, n):\n return -self.parent_indexes[self.find(n)]\n \n def same_group(self, n1, n2):\n return self.find(n1) == self.find(n2)\n\nn, m = map(lambda x: int(x), input().split()) # (1): n=79, m=1\n\n\nuf = UnionFind(n) # (2): self=, size=79\n\nfor _ in range(m): # (4): _=0 (20): NO CHANGE\n a, b = map(lambda x: int(x), input().split()) # (5): a=2, b=9\n uf.union(a-1, b-1) # (6): self=, n1=1, n2=8\n \nnum_parents = 0 # (21): num_parents=0\n \nfor p_index in uf.parent_indexes: # (22): p_index=-1 (25): p_index=-2 ... (258): NO CHANGE\n if p_index < 0: # (23): NO CHANGE (26): NO CHANGE ... (256): NO CHANGE\n num_parents += 1 # (24): num_parents=1 (27): num_parents=2 ... (257): num_parents=78\nprint(math.ceil((math.log2(num_parents))))"], "anno_status": [false], "diff_content": " import math\n \n class UnionFind:\n def __init__(self, size):\n self.parent_indexes = [-1] * size\n \n def find(self, n):\n if self.parent_indexes[n] < 0:\n return n\n \n \n self.parent_indexes[n] = self.find(self.parent_indexes[n])\n return self.parent_indexes[n] \n \n def union(self, n1, n2):\n if self.same_group(n1, n2):\n return False\n \n \n if self.size(n1) >= self.size(n2):\n tmp = self.size(n2)\n self.parent_indexes[self.find(n2)] = self.find(n1)\n self.parent_indexes[self.find(n1)] -= tmp\n return True\n \n \n tmp = self.size(n1)\n self.parent_indexes[self.find(n1)] = self.find(n2)\n self.parent_indexes[self.find(n2)] -= tmp\n return True\n \n \n def size(self, n):\n return -self.parent_indexes[self.find(n)]\n \n def same_group(self, n1, n2):\n return self.find(n1) == self.find(n2)\n \n n, m = map(lambda x: int(x), input().split())\n \n \n uf = UnionFind(n)\n \n for _ in range(m):\n a, b = map(lambda x: int(x), input().split())\n uf.union(a-1, b-1)\n \n num_parents = 0\n \n for p_index in uf.parent_indexes:\n if p_index < 0:\n num_parents += 1\n-print(math.ceil((math.log2(num_parents))))\n+\n+print(num_parents - 1)\n", "FL_content": "\n import math\n \n class UnionFind:\n def __init__(self, size):\n self.parent_indexes = [-1] * size\n \n def find(self, n):\n if self.parent_indexes[n] < 0:\n return n\n \n \n self.parent_indexes[n] = self.find(self.parent_indexes[n])\n return self.parent_indexes[n] \n \n def union(self, n1, n2):\n if self.same_group(n1, n2):\n return False\n \n \n if self.size(n1) >= self.size(n2):\n tmp = self.size(n2)\n self.parent_indexes[self.find(n2)] = self.find(n1)\n self.parent_indexes[self.find(n1)] -= tmp\n return True\n \n \n tmp = self.size(n1)\n self.parent_indexes[self.find(n1)] = self.find(n2)\n self.parent_indexes[self.find(n2)] -= tmp\n return True\n \n \n def size(self, n):\n return -self.parent_indexes[self.find(n)]\n \n def same_group(self, n1, n2):\n return self.find(n1) == self.find(n2)\n \n n, m = map(lambda x: int(x), input().split())\n \n \n uf = UnionFind(n)\n \n for _ in range(m):\n a, b = map(lambda x: int(x), input().split())\n uf.union(a-1, b-1)\n \n num_parents = 0\n \n for p_index in uf.parent_indexes:\n if p_index < 0:\n num_parents += 1\n-print(math.ceil((math.log2(num_parents))))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 53 }, { "user_id": "u508486691", "problem_id": "p02867", "submission1_id": "s118981924-FL", "submission2_id": "s227810621", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport math\nfrom collections import defaultdict\n\nsys.setrecursionlimit(10**7)\ndef input():\n return sys.stdin.readline()[:-1]\n\nmod = 10**9 + 7\n\ndef I(): return int(input())\ndef II(): return map(int, input().split())\ndef III(): return list(map(int, input().split()))\ndef Line(N,num):\n if N<=0:\n return [[]]*num\n elif num==1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return map(list, zip(*read_all))\n\n\n\nN = I()\nA = III()\nB = III()\n\nfrom bisect import bisect_left\n\n\n\ndef index_sort(A):\n a = []\n for i,x in enumerate(A):\n a.append([i,x])\n return sorted(a,key=lambda x: x[1])\n\nA2 = sorted(A)\nB2 = sorted(B)\n\nfor i in range(N):\n if A2[i]>B2[i]:\n print('No')\n exit()\n\nfor i in range(N-1):\n if B2[i]>=A2[i+1]:\n print('Yes')\n exit()\n\nprint('No')", "code2": "import sys\nimport math\nfrom collections import defaultdict\n\nsys.setrecursionlimit(10**7)\ndef input():\n return sys.stdin.readline()[:-1]\n\nmod = 10**9 + 7\n\ndef I(): return int(input())\ndef II(): return map(int, input().split())\ndef III(): return list(map(int, input().split()))\ndef Line(N,num):\n if N<=0:\n return [[]]*num\n elif num==1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return map(list, zip(*read_all))\n\n\n\nN = I()\nA = III()\nB = III()\n\ndef index_sort(A):\n a = []\n for i,x in enumerate(A):\n a.append([i,x])\n asort = sorted(a,key=lambda x: x[1])\n return [asort[i][0] for i in range(len(a))]\n\nA2 = sorted(A)\nB2 = sorted(B)\n\nfor i in range(N):\n if A2[i]>B2[i]:\n print('No')\n exit()\n\nAindex = index_sort(A)\nBindex = index_sort(B)\nmove = [0]*N\nfor i in range(N):\n move[Aindex[i]] = Bindex[i]\n\nnow = 0\nfor i in range(N):\n if move[now]==0 and i!=N-1:\n print('Yes')\n exit()\n now = move[now]\n\nfor i in range(N-1):\n if B2[i]>=A2[i+1]:\n print('Yes')\n exit()\n\nprint('No')", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1573359249", "date2": "1573361733", "bleu_score": "0.7609496628018064", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 102, "total_score": 103, "input": "3\n1 3 2\n1 2 3\n", "actual_output": "No\n", "expected_output": "Yes\n", "anno_code": ["import sys\nimport math\nfrom collections import defaultdict\n\nsys.setrecursionlimit(10**7) # (0): NO CHANGE\ndef input(): # (1): input=\n return sys.stdin.readline()[:-1]\n\nmod = 10**9 + 7 # (2): mod=1000000007, I=, II=, III=\n\ndef I(): return int(input())\ndef II(): return map(int, input().split())\ndef III(): return list(map(int, input().split()))\ndef Line(N,num): # (3): Line=\n if N<=0:\n return [[]]*num\n elif num==1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return map(list, zip(*read_all))\n\n\n\nN = I() # (4): N=3\nA = III() # (5): A=[1, 3, 2]\nB = III() # (6): B=[1, 2, 3], bisect_left=\n\nfrom bisect import bisect_left\n\n\n\ndef index_sort(A): # (7): index_sort=\n a = []\n for i,x in enumerate(A):\n a.append([i,x])\n return sorted(a,key=lambda x: x[1])\n\nA2 = sorted(A) # (8): A2=[1, 2, 3]\nB2 = sorted(B) # (9): B2=[1, 2, 3]\n\nfor i in range(N): # (10): i=0 (12): i=1 ... (16): NO CHANGE\n if A2[i]>B2[i]: # (11): NO CHANGE (13): NO CHANGE (15): NO CHANGE\n print('No')\n exit()\n\nfor i in range(N-1): # (17): i=0 (19): i=1 (21): NO CHANGE\n if B2[i]>=A2[i+1]: # (18): NO CHANGE (20): NO CHANGE\n print('Yes')\n exit()\n\nprint('No')"], "anno_status": [true], "diff_content": " import sys\n import math\n from collections import defaultdict\n \n sys.setrecursionlimit(10**7)\n def input():\n return sys.stdin.readline()[:-1]\n \n mod = 10**9 + 7\n \n def I(): return int(input())\n def II(): return map(int, input().split())\n def III(): return list(map(int, input().split()))\n def Line(N,num):\n if N<=0:\n return [[]]*num\n elif num==1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return map(list, zip(*read_all))\n \n \n \n N = I()\n A = III()\n B = III()\n \n-from bisect import bisect_left\n-\n-\n-\n def index_sort(A):\n a = []\n for i,x in enumerate(A):\n a.append([i,x])\n- return sorted(a,key=lambda x: x[1])\n+ asort = sorted(a,key=lambda x: x[1])\n+ return [asort[i][0] for i in range(len(a))]\n \n A2 = sorted(A)\n B2 = sorted(B)\n \n for i in range(N):\n if A2[i]>B2[i]:\n print('No')\n exit()\n \n+Aindex = index_sort(A)\n+Bindex = index_sort(B)\n+move = [0]*N\n+for i in range(N):\n+ move[Aindex[i]] = Bindex[i]\n+\n+now = 0\n+for i in range(N):\n+ if move[now]==0 and i!=N-1:\n+ print('Yes')\n+ exit()\n+ now = move[now]\n+\n for i in range(N-1):\n if B2[i]>=A2[i+1]:\n print('Yes')\n exit()\n \n print('No')\n", "FL_content": "\n import sys\n import math\n from collections import defaultdict\n \n sys.setrecursionlimit(10**7)\n def input():\n return sys.stdin.readline()[:-1]\n \n mod = 10**9 + 7\n \n def I(): return int(input())\n def II(): return map(int, input().split())\n def III(): return list(map(int, input().split()))\n def Line(N,num):\n if N<=0:\n return [[]]*num\n elif num==1:\n return [I() for _ in range(N)]\n else:\n read_all = [tuple(II()) for _ in range(N)]\n return map(list, zip(*read_all))\n \n \n \n N = I()\n A = III()\n B = III()\n \n from bisect import bisect_left\n \n \n \n def index_sort(A):\n a = []\n for i,x in enumerate(A):\n a.append([i,x])\n return sorted(a,key=lambda x: x[1])\n \n A2 = sorted(A)\n B2 = sorted(B)\n \n for i in range(N):\n if A2[i]>B2[i]:\n print('No')\n exit()\n \n for i in range(N-1):\n if B2[i]>=A2[i+1]:\n print('Yes')\n exit()\n \n print('No')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 52 }, { "user_id": "u702786238", "problem_id": "p03139", "submission1_id": "s609316528-FL", "submission2_id": "s453853150", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, A, B = map(int, input().split())\n\nans1 = B if A>B else A\nans2 = A+B-N\n\nprint(\"{} {}\".format(ans1, ans2))", "code2": "N, A, B = map(int, input().split())\n\nans1 = B if A>B else A\nans2 = A+B-N if A+B-N >= 0 else 0\n\nprint(\"{} {}\".format(ans1, ans2))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1585056075", "date2": "1585056134", "bleu_score": "0.821976415259977", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 74, "total_score": 81, "input": "5 -3 -1\n", "actual_output": "-3 -9\n", "expected_output": "-3 0\n\n", "anno_code": ["N, A, B = map(int, input().split()) # (0): N=5, A=-3, B=-1\n\nans1 = B if A>B else A # (1): ans1=-3\nans2 = A+B-N # (2): ans2=-9\n\nprint(\"{} {}\".format(ans1, ans2))"], "anno_status": [true], "diff_content": " N, A, B = map(int, input().split())\n \n ans1 = B if A>B else A\n-ans2 = A+B-N\n+ans2 = A+B-N if A+B-N >= 0 else 0\n \n print(\"{} {}\".format(ans1, ans2))\n", "FL_content": "\n N, A, B = map(int, input().split())\n \n-ans1 = B if A>B else A\n-ans2 = A+B-N\n \n print(\"{} {}\".format(ans1, ans2))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u908651435", "problem_id": "p02408", "submission1_id": "s616805969-FL", "submission2_id": "s992956542", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nx={0:'S',1:'H',2:'C',3:'D'}\nc=[[0]*13,[0]*13,[0]*13,[0]*13]\nfor i in range(n):\n a,b=input().split()\n b=int(b)\n if a=='S':\n c[0].insert(b,b)\n elif a=='H':\n c[1].insert(b,b)\n elif a=='C':\n c[2].insert(b,b)\n else:\n c[3].insert(b,b)\nfor i in range(4):\n for j in range(13):\n if c[i][j]==0:\n print(x[i],j)\n", "code2": "n=int(input())\nx={0:'S',1:'H',2:'C',3:'D'}\nc=[[0]*13,[0]*13,[0]*13,[0]*13]\nfor r in range(n):\n a,b=input().split()\n b=int(b)-1\n if a=='S':\n c[0][b]=1\n elif a=='H':\n c[1][b]=1\n elif a=='C':\n c[2][b]=1\n else:\n c[3][b]=1\nfor i in range(4):\n for j in range(13):\n if c[i][j]==0:\n print(x[i],j+1)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1525702543", "date2": "1525703289", "bleu_score": "0.8462040634130794", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "47\nS 10\nS 11\nS 12\nS 13\nH 1\nH 2\nS 6\nS 7\nS 8\nS 9\nH 6\nH 8\nH 9\nH 10\nH 11\nH 4\nH 7\nS 1\nS 3\nS 4\nS 5\nH 12\nH 13\nC 1\nC 2\nD 1\nD 2\nD 3\nD 6\nD 5\nD 8\nD 7\nC 3\nC 4\nC 5\nC 6\nC 7\nC 8\nC 9\nC 10\nC 11\nC 13\nD 9\nD 10\nD 11\nD 12\nD 13\n", "actual_output": "S 0\nS 2\nS 6\nS 7\nS 8\nS 9\nH 0\nH 3\nH 5\nH 6\nH 9\nC 0\nC 12\nD 0\nD 4\nD 6\n", "expected_output": "S 2\nH 3\nH 5\nC 12\nD 4\n\n", "anno_code": ["n=int(input()) # (0): n=47\nx={0:'S',1:'H',2:'C',3:'D'} # (1): x={0: 'S', 1: 'H', 2: 'C', 3: 'D'}\nc=[[0]*13,[0]*13,[0]*13,[0]*13] # (2): c\nfor i in range(n): # (3): i=0 (8): c, i=1 ... (297): c\n a,b=input().split() # (4): a=S, b=10 (9): c=[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], b=11 ... (291): c, b=13\n b=int(b) # (5): b=10 (10): c=[[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], b=11 ... (292): c, b=13\n if a=='S': # (6): NO CHANGE (11): c ... (293): c\n c[0].insert(b,b) # (7): c (12): c ... (116): c\n elif a=='H': # (27): c (33): c ... (294): c\n c[1].insert(b,b) # (28): c (34): c ... (128): c\n elif a=='C': # (134): c (141): c ... (295): c\n c[2].insert(b,b) # (135): c (142): c ... (261): c\n else:\n c[3].insert(b,b) # (149): c (156): c ... (296): c\nfor i in range(4): # (298): c, i=0 (332): c, i=1 ... (395): c, i=3\n for j in range(13): # (299): c, j=0 (302): c, j=1 ... (425): c\n if c[i][j]==0: # (300): c (303): c ... (424): c\n print(x[i],j) # (301): c (306): c ... (412): c\n"], "anno_status": [false], "diff_content": " n=int(input())\n x={0:'S',1:'H',2:'C',3:'D'}\n c=[[0]*13,[0]*13,[0]*13,[0]*13]\n-for i in range(n):\n+for r in range(n):\n a,b=input().split()\n- b=int(b)\n+ b=int(b)-1\n if a=='S':\n- c[0].insert(b,b)\n+ c[0][b]=1\n elif a=='H':\n- c[1].insert(b,b)\n+ c[1][b]=1\n elif a=='C':\n- c[2].insert(b,b)\n+ c[2][b]=1\n else:\n- c[3].insert(b,b)\n+ c[3][b]=1\n for i in range(4):\n for j in range(13):\n if c[i][j]==0:\n- print(x[i],j)\n+ print(x[i],j+1)\n \n", "FL_content": "\n n=int(input())\n x={0:'S',1:'H',2:'C',3:'D'}\n c=[[0]*13,[0]*13,[0]*13,[0]*13]\n for i in range(n):\n a,b=input().split()\n b=int(b)\n if a=='S':\n- c[0].insert(b,b)\n elif a=='H':\n- c[1].insert(b,b)\n elif a=='C':\n- c[2].insert(b,b)\n else:\n- c[3].insert(b,b)\n for i in range(4):\n for j in range(13):\n if c[i][j]==0:\n print(x[i],j)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u982594421", "problem_id": "p03957", "submission1_id": "s964757530-FL", "submission2_id": "s826623778", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nc = s.find('C')\nf = s.find('F')\nif c < f and c >= 0 and f >= 0:\n print('Yes')\nelse:\n print('No')\n ", "code2": "s = input()\nans = 'No'\nc = s.find('C')\nif c != -1:\n f = s[c:].find('F')\n if f != -1:\n ans = 'Yes'\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560973123", "date2": "1560973674", "bleu_score": "0.6049604246413381", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 94, "total_score": 103, "input": "DOFCQDKAIVSF\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["s = input() # (0): s=DOFCQDKAIVSF\nc = s.find('C') # (1): c=3\nf = s.find('F') # (2): f=2\nif c < f and c >= 0 and f >= 0: # (3): NO CHANGE\n print('Yes')\nelse:\n print('No')\n "], "anno_status": [true], "diff_content": " s = input()\n+ans = 'No'\n c = s.find('C')\n-f = s.find('F')\n-if c < f and c >= 0 and f >= 0:\n- print('Yes')\n-else:\n- print('No')\n- \n+if c != -1:\n+ f = s[c:].find('F')\n+ if f != -1:\n+ ans = 'Yes'\n+print(ans)\n+\n", "FL_content": "\n s = input()\n c = s.find('C')\n f = s.find('F')\n-if c < f and c >= 0 and f >= 0:\n print('Yes')\n else:\n print('No')\n- \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u476562059", "problem_id": "p02909", "submission1_id": "s547597908-FL", "submission2_id": "s746840402", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nif(s == \"Sunny\"):\n print(\"Cloudy\")\n\nelif(s == \"Cloudy\"):\n print(\"Rainy\")\n\nelse:\n print(\"Suuny\")", "code2": "s = input()\nif(s == \"Sunny\"):\n print(\"Cloudy\")\n\nelif(s == \"Cloudy\"):\n print(\"Rainy\")\n\nelse:\n print(\"Sunny\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568745007", "date2": "1568745031", "bleu_score": "0.9801741867115217", "code1_test_status": [0, 1], "code1_test_score": 1, "total_score": 2, "input": "Rainy\n", "actual_output": "Suuny\n", "expected_output": "Sunny\n", "anno_code": ["s = input() # (0): s=Rainy\nif(s == \"Sunny\"): # (1): NO CHANGE\n print(\"Cloudy\")\n\nelif(s == \"Cloudy\"): # (2): NO CHANGE\n print(\"Rainy\")\n\nelse:\n print(\"Suuny\")"], "anno_status": [true], "diff_content": " s = input()\n if(s == \"Sunny\"):\n print(\"Cloudy\")\n \n elif(s == \"Cloudy\"):\n print(\"Rainy\")\n \n else:\n- print(\"Suuny\")\n+ print(\"Sunny\")\n", "FL_content": "\n s = input()\n if(s == \"Sunny\"):\n print(\"Cloudy\")\n \n elif(s == \"Cloudy\"):\n print(\"Rainy\")\n \n else:\n- print(\"Suuny\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u576432509", "problem_id": "p03739", "submission1_id": "s920884684-FL", "submission2_id": "s019988788", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\n\na=list(map(int,input().split()))\n\nkp=0\nasum=0\nflag=-1\nfor i in range(n):\n asum=asum+a[i]\n if flag==-1:\n if asum>=0:\n kp=kp+asum+1\n asum=-1\n else:\n if asum<=0:\n kp=kp+1-asum\n asum=1\n flag=-flag\n print(asum)\nprint(\"-----\",kp) \nkm=0\nasum=0\nflag=1\nfor i in range(n):\n asum=asum+a[i]\n if flag==-1:\n if asum>=0:\n km=km+asum+1\n asum=-1\n else:\n if asum<=0:\n km=km+1-asum\n asum=1\n flag=-flag\n print(asum)\nprint(\"-----\",km) \n\nprint(min(kp,km))\n ", "code2": "n=int(input())\n\na=list(map(int,input().split()))\n\nkp=0\nasum=0\nflag=-1\nfor i in range(n):\n asum=asum+a[i]\n if flag==-1:\n if asum>=0:\n kp=kp+asum+1\n asum=-1\n else:\n if asum<=0:\n kp=kp+1-asum\n asum=1\n flag=-flag\n\n\nkm=0\nasum=0\nflag=1\nfor i in range(n):\n asum=asum+a[i]\n if flag==-1:\n if asum>=0:\n km=km+asum+1\n asum=-1\n else:\n if asum<=0:\n km=km+1-asum\n asum=1\n flag=-flag\n\n\n\nprint(min(kp,km))\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586313798", "date2": "1586313859", "bleu_score": "0.8419633617565788", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 94, "input": "6\n0 8 0 2 -5 -1\n", "actual_output": "-1\n7\n-1\n1\n-4\n1\n----- 15\n1\n-1\n1\n-1\n1\n-1\n----- 25\n15\n", "expected_output": "15\n\n", "anno_code": ["n=int(input()) # (0): n=6\n\na=list(map(int,input().split())) # (1): a=[0, 8, 0, 2, -5, -1]\n\nkp=0 # (2): kp=0\nasum=0 # (3): asum=0\nflag=-1 # (4): flag=-1\nfor i in range(n): # (5): i=0 (13): i=1 ... (47): NO CHANGE\n asum=asum+a[i] # (6): NO CHANGE (14): asum=7 ... (40): asum=-5\n if flag==-1: # (7): NO CHANGE (15): NO CHANGE ... (41): NO CHANGE\n if asum>=0: # (8): NO CHANGE (22): NO CHANGE (36): NO CHANGE\n kp=kp+asum+1 # (9): kp=1 (23): kp=9\n asum=-1 # (10): asum=-1 (24): asum=-1\n else:\n if asum<=0: # (16): NO CHANGE (30): NO CHANGE (42): NO CHANGE\n kp=kp+1-asum # (43): kp=15\n asum=1 # (44): asum=1\n flag=-flag # (11): flag=1 (17): flag=-1 ... (45): flag=-1\n print(asum) # (12): NO CHANGE (18): NO CHANGE ... (46): NO CHANGE\nprint(\"-----\",kp) # (48): NO CHANGE\nkm=0 # (49): km=0\nasum=0 # (50): asum=0\nflag=1 # (51): flag=1\nfor i in range(n): # (52): i=0 (60): i=1 ... (100): NO CHANGE\n asum=asum+a[i] # (53): NO CHANGE (61): asum=9 ... (93): asum=0\n if flag==-1: # (54): NO CHANGE (62): NO CHANGE ... (94): NO CHANGE\n if asum>=0: # (63): NO CHANGE (79): NO CHANGE (95): NO CHANGE\n km=km+asum+1 # (64): km=11 (80): km=17 (96): km=25\n asum=-1 # (65): asum=-1 (81): asum=-1 (97): asum=-1\n else:\n if asum<=0: # (55): NO CHANGE (71): NO CHANGE (87): NO CHANGE\n km=km+1-asum # (56): km=1 (72): km=13 (88): km=24\n asum=1 # (57): asum=1 (73): asum=1 (89): asum=1\n flag=-flag # (58): flag=-1 (66): flag=1 ... (98): flag=1\n print(asum) # (59): NO CHANGE (67): NO CHANGE ... (99): NO CHANGE\nprint(\"-----\",km) # (101): NO CHANGE\n\nprint(min(kp,km))\n "], "anno_status": [true], "diff_content": " n=int(input())\n \n a=list(map(int,input().split()))\n \n kp=0\n asum=0\n flag=-1\n for i in range(n):\n asum=asum+a[i]\n if flag==-1:\n if asum>=0:\n kp=kp+asum+1\n asum=-1\n else:\n if asum<=0:\n kp=kp+1-asum\n asum=1\n flag=-flag\n- print(asum)\n-print(\"-----\",kp) \n+\n+\n km=0\n asum=0\n flag=1\n for i in range(n):\n asum=asum+a[i]\n if flag==-1:\n if asum>=0:\n km=km+asum+1\n asum=-1\n else:\n if asum<=0:\n km=km+1-asum\n asum=1\n flag=-flag\n- print(asum)\n-print(\"-----\",km) \n+\n+\n \n print(min(kp,km))\n \n", "FL_content": "\n n=int(input())\n \n a=list(map(int,input().split()))\n \n kp=0\n asum=0\n flag=-1\n for i in range(n):\n asum=asum+a[i]\n if flag==-1:\n if asum>=0:\n kp=kp+asum+1\n asum=-1\n else:\n if asum<=0:\n kp=kp+1-asum\n asum=1\n flag=-flag\n- print(asum)\n-print(\"-----\",kp) \n km=0\n asum=0\n flag=1\n for i in range(n):\n asum=asum+a[i]\n if flag==-1:\n if asum>=0:\n km=km+asum+1\n asum=-1\n else:\n if asum<=0:\n km=km+1-asum\n asum=1\n flag=-flag\n- print(asum)\n-print(\"-----\",km) \n \n print(min(kp,km))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 39 }, { "user_id": "u238084414", "problem_id": "p02958", "submission1_id": "s828035126-FL", "submission2_id": "s138810478", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nP = list(input(). split())\nQ = sorted(P)\ncnt = 0\ni = 0\n\nwhile cnt <= 2 and i < len(P):\n if Q[i] != P[i]:\n cnt += 1\n i += 1\n\nif cnt <= 2:\n print(\"YES\")\nelse:\n print(\"NO\")", "code2": "N = int(input())\nP = list(map(int, input(). split()))\nQ = sorted(P)\ncnt = 0\ni = 0\n\nwhile cnt <= 2 and i < len(P):\n if Q[i] != P[i]:\n cnt += 1\n i += 1\n\nif cnt <= 2:\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588182984", "date2": "1588183053", "bleu_score": "0.9440889306649072", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 100, "input": "5\n1 20 1 1 4\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["N = int(input()) # (0): N=5\nP = list(input(). split()) # (1): P=['1', '20', '1', '1', '4']\nQ = sorted(P) # (2): Q=['1', '1', '1', '20', '4']\ncnt = 0 # (3): cnt=0\ni = 0 # (4): i=0\n\nwhile cnt <= 2 and i < len(P): # (5): NO CHANGE (8): NO CHANGE ... (22): NO CHANGE\n if Q[i] != P[i]: # (6): NO CHANGE (9): NO CHANGE ... (20): NO CHANGE\n cnt += 1 # (10): cnt=1 (17): cnt=2\n i += 1 # (7): i=1 (11): i=2 ... (21): i=5\n\nif cnt <= 2: # (23): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")"], "anno_status": [true], "diff_content": " N = int(input())\n-P = list(input(). split())\n+P = list(map(int, input(). split()))\n Q = sorted(P)\n cnt = 0\n i = 0\n \n while cnt <= 2 and i < len(P):\n if Q[i] != P[i]:\n cnt += 1\n i += 1\n \n if cnt <= 2:\n print(\"YES\")\n else:\n print(\"NO\")\n", "FL_content": "\n N = int(input())\n-P = list(input(). split())\n Q = sorted(P)\n cnt = 0\n i = 0\n \n while cnt <= 2 and i < len(P):\n if Q[i] != P[i]:\n cnt += 1\n i += 1\n \n if cnt <= 2:\n print(\"YES\")\n else:\n print(\"NO\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u198998746", "problem_id": "p02916", "submission1_id": "s677245956-FL", "submission2_id": "s125737863", "status1": "Wrong Answer", "status2": "Accepted", "code1": "num = int(input())\nindex = list(map(int, input().split()))\npoint = list(map(int, input().split()))\nadd = list(map(int, input().split()))\n\ntotal = 0\nfor i in range(num):\n total += point[index[i]-1]\n\nfor j in range(num-1):\n if index[j+1] == index[j]+ 1:\n total += add[j]\n\nprint(total)", "code2": "num = int(input())\nindex = list(map(int, input().split()))\npoint = list(map(int, input().split()))\nadd = list(map(int, input().split()))\n\n\ntotal = 0\nfor i in range(num):\n total += point[index[i]-1]\n\nfor j in range(num-1):\n if index[j+1] == index[j]+ 1:\n total += add[index[j]-1]\n\nprint(total)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586494760", "date2": "1586494920", "bleu_score": "0.9601857701286821", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0], "code1_test_score": 25, "total_score": 103, "input": "3\n3 1 2\n1 1 0\n3 16\n", "actual_output": "18\n", "expected_output": "5\n\n", "anno_code": ["num = int(input()) # (0): num=3\nindex = list(map(int, input().split())) # (1): index=[3, 1, 2]\npoint = list(map(int, input().split())) # (2): point=[1, 1, 0]\nadd = list(map(int, input().split())) # (3): add=[3, 16]\n\ntotal = 0 # (4): total=0\nfor i in range(num): # (5): i=0 (7): i=1 ... (11): NO CHANGE\n total += point[index[i]-1] # (6): NO CHANGE (8): total=1 (10): total=2\n\nfor j in range(num-1): # (12): j=0 (14): j=1 (17): NO CHANGE\n if index[j+1] == index[j]+ 1: # (13): NO CHANGE (15): NO CHANGE\n total += add[j] # (16): total=18\n\nprint(total)"], "anno_status": [true], "diff_content": " num = int(input())\n index = list(map(int, input().split()))\n point = list(map(int, input().split()))\n add = list(map(int, input().split()))\n \n+\n total = 0\n for i in range(num):\n total += point[index[i]-1]\n \n for j in range(num-1):\n if index[j+1] == index[j]+ 1:\n- total += add[j]\n+ total += add[index[j]-1]\n \n print(total)\n", "FL_content": "\n num = int(input())\n index = list(map(int, input().split()))\n point = list(map(int, input().split()))\n add = list(map(int, input().split()))\n \n total = 0\n for i in range(num):\n total += point[index[i]-1]\n \n for j in range(num-1):\n- if index[j+1] == index[j]+ 1:\n total += add[j]\n \n print(total)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u821969418", "problem_id": "p02909", "submission1_id": "s391006791-FL", "submission2_id": "s162461267", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import random\n\nw = input()\n\nf = random.randint(0, 2)\n\nif f == 0:\n print(\"Sunny\")\nelif f == 1:\n print(\"Cloudy\")\nelif f == 2:\n print(\"Rainy\")", "code2": "import random\n\nw = input()\n\nif w == \"Sunny\":\n print(\"Cloudy\")\nelif w == \"Cloudy\":\n print(\"Rainy\")\nelif w == \"Rainy\":\n print(\"Sunny\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568595761", "date2": "1568595896", "bleu_score": "0.7299353821375921", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "Sunny\n", "actual_output": "Rainy\n", "expected_output": "Cloudy\n", "anno_code": ["import random\n\nw = input() # (0): w=Sunny\n\nf = random.randint(0, 2) # (1): f=2\n\nif f == 0: # (2): NO CHANGE\n print(\"Sunny\")\nelif f == 1: # (3): NO CHANGE\n print(\"Cloudy\")\nelif f == 2: # (4): NO CHANGE\n print(\"Rainy\")"], "anno_status": [true], "diff_content": " import random\n \n w = input()\n \n-f = random.randint(0, 2)\n-\n-if f == 0:\n- print(\"Sunny\")\n-elif f == 1:\n+if w == \"Sunny\":\n print(\"Cloudy\")\n-elif f == 2:\n+elif w == \"Cloudy\":\n print(\"Rainy\")\n+elif w == \"Rainy\":\n+ print(\"Sunny\")\n", "FL_content": "\n import random\n \n w = input()\n \n-f = random.randint(0, 2)\n \n if f == 0:\n print(\"Sunny\")\n elif f == 1:\n print(\"Cloudy\")\n elif f == 2:\n print(\"Rainy\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u638795007", "problem_id": "p03523", "submission1_id": "s215444266-FL", "submission2_id": "s356314213", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def examA():\n S = SI()\n T = \"AKIHABARA\"\n ans = \"YES\"\n L = len(T); cur = 0\n for s in S:\n if cur>=L:\n ans = \"NO\"\n break\n while(cur=L:\n ans = \"NO\"\n break\n cur += 1\n if d[\"K\"]<1 or d[\"I\"]<1 or d[\"H\"]<1 or d[\"B\"]<1 or d[\"R\"]<1:\n ans = \"NO\"\n print(ans)\n return\n\n\nimport sys,copy,bisect,itertools,heapq,math\nfrom heapq import heappop,heappush,heapify\nfrom collections import Counter,defaultdict,deque\ndef I(): return int(sys.stdin.readline())\ndef LI(): return list(map(int,sys.stdin.readline().split()))\ndef LSI(): return list(map(str,sys.stdin.readline().split()))\ndef LS(): return sys.stdin.readline().split()\ndef SI(): return sys.stdin.readline().strip()\nmod = 10**9 + 7\ninf = float('inf')\n\nif __name__ == '__main__':\n examA()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1576287131", "date2": "1576287599", "bleu_score": "0.839415781050483", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 100, "total_score": 102, "input": "AKHBAAARH\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["def examA(): # (0): examA=, sys=, copy=, bisect=, itertools=, heapq=, math=, heappop=, heappush=, heapify=, Counter=, defaultdict=, deque=, I=, LI=, LSI=, LS=, SI=\n S = SI()\n T = \"AKIHABARA\"\n ans = \"YES\"\n L = len(T); cur = 0\n for s in S:\n if cur>=L:\n ans = \"NO\"\n break\n while(cur=L:\n- ans = \"NO\"\n- break\n+ d[s] +=1\n while(cur=L:\n+ ans = \"NO\"\n+ break\n+ cur += 1\n+ if d[\"K\"]<1 or d[\"I\"]<1 or d[\"H\"]<1 or d[\"B\"]<1 or d[\"R\"]<1:\n+ ans = \"NO\"\n print(ans)\n return\n \n \n import sys,copy,bisect,itertools,heapq,math\n from heapq import heappop,heappush,heapify\n from collections import Counter,defaultdict,deque\n def I(): return int(sys.stdin.readline())\n def LI(): return list(map(int,sys.stdin.readline().split()))\n def LSI(): return list(map(str,sys.stdin.readline().split()))\n def LS(): return sys.stdin.readline().split()\n def SI(): return sys.stdin.readline().strip()\n mod = 10**9 + 7\n inf = float('inf')\n \n if __name__ == '__main__':\n examA()\n \n", "FL_content": "\n def examA():\n S = SI()\n T = \"AKIHABARA\"\n ans = \"YES\"\n L = len(T); cur = 0\n for s in S:\n if cur>=L:\n ans = \"NO\"\n break\n while(cur\n x=A[r] # (4): x=1\n i=p-1 # (5): i=-1\n for j in range(p,r): # (6): j=0 (8): j=1 ... (30): NO CHANGE\n if A[j], n=12, A=[0, 1, 9, 1, 12, 8, 8, 6, 21, 40, 10, 19], k=1\n return i+1\n\nn=int(input()) # (1): n=12\nA=list(map(int,input().split())) # (2): A=[40, 19, 9, 1, 12, 8, 8, 6, 21, 0, 10, 1]\nk=partition(A,0,len(A)-1) # (3): p=0, r=11\nfront=\" \".join(map(str,A[:k])) # (32): front=0\nback=\" \".join(map(str,A[k+1:])) # (33): back=9 1 12 8 8 6 21 40 10 19\nans=front+\" [\"+str(A[k])+\"] \"+back # (34): ans=0 [1] 9 1 12 8 8 6 21 40 10 19\nprint(ans)\n"], "anno_status": [true], "diff_content": " def partition(A,p,r):\n x=A[r]\n i=p-1\n for j in range(p,r):\n- if A[j]\n return sys.stdin.readline()[:-1]\n\n\nmod = 10**9 + 7 # (2): mod=1000000007, I=, II=, III=\n\n\ndef I(): return int(input())\ndef II(): return map(int, input().split())\ndef III(): return list(map(int, input().split()))\ndef Line(N): # (3): Line=\n read_all = [tuple(map(int, input().split())) for _ in range(N)]\n return map(list,zip(*read_all))\n\n\n\ndef fact(a,M=mod): # (4): fact=\n ans = 1 # (82): ans=1\n for i in range(2,a+1): # (83): i=2 (86): i=3 ... (92): sys=, math=, defaultdict=, input=, mod=1000000007, I=, II=, III=, Line=, fact=, N=4, S=BWABWCWW, d=['L', 'L', 'L', 'L', 'L', 'L', 'L', 'R'], i=7, temp=7, x=[0, 0, 0, 0, 0, 0, 0, 7], ans=168, rnum=1\n ans = ans*i # (84): ans=2 (87): ans=6 (90): ans=24\n ans = ans%M # (85): NO CHANGE (88): NO CHANGE (91): NO CHANGE\n return ans\n\nN = I() # (5): N=4\nS = str(input()) # (6): S=BWABWCWW\n\nif S[0]=='W': # (7): NO CHANGE\n print(0)\n exit()\n\nd = ['L']*(2*N) # (8): d=['L', 'L', 'L', 'L', 'L', 'L', 'L', 'L']\nfor i in range(1,2*N): # (9): i=1 (12): i=2 ... (31): NO CHANGE\n if S[i]!=S[i-1]: # (10): NO CHANGE (13): NO CHANGE ... (28): NO CHANGE\n d[i]=d[i-1] # (11): NO CHANGE (14): NO CHANGE ... (26): NO CHANGE\n else:\n if d[i-1]=='L': # (29): NO CHANGE\n d[i] = 'R' # (30): d=['L', 'L', 'L', 'L', 'L', 'L', 'L', 'R']\n else:\n d[i] = 'L'\n\ntemp = 0 # (32): temp=0\nx = [0]*(2*N) # (33): x=[0, 0, 0, 0, 0, 0, 0, 0]\nfor i in range(2*N): # (34): i=0 (37): i=1 ... (58): NO CHANGE\n if d[i]=='L': # (35): NO CHANGE (38): NO CHANGE ... (56): NO CHANGE\n temp += 1 # (36): temp=1 (39): temp=2 ... (54): temp=7\n else:\n x[i] = temp # (57): x=[0, 0, 0, 0, 0, 0, 0, 7]\n\nans = 1 # (59): ans=1\nrnum = 0 # (60): rnum=0\nfor i in range(2*N): # (61): i=0 (63): i=1 ... (80): NO CHANGE\n if d[i]=='R': # (62): NO CHANGE (64): NO CHANGE ... (76): NO CHANGE\n ans *= x[i]-rnum # (77): ans=7\n ans %= mod # (78): NO CHANGE\n rnum += 1 # (79): rnum=1\n\nans *= fact(N) # (81): a=4, M=1000000007\nans %= mod # (93): NO CHANGE\n\nprint(ans)"], "anno_status": [false], "diff_content": " \n import sys\n import math\n from collections import defaultdict\n \n \n sys.setrecursionlimit(10**7)\n def input():\n return sys.stdin.readline()[:-1]\n \n \n mod = 10**9 + 7\n \n \n def I(): return int(input())\n def II(): return map(int, input().split())\n def III(): return list(map(int, input().split()))\n def Line(N):\n read_all = [tuple(map(int, input().split())) for _ in range(N)]\n return map(list,zip(*read_all))\n \n \n \n def fact(a,M=mod):\n ans = 1\n for i in range(2,a+1):\n ans = ans*i\n ans = ans%M\n return ans\n \n N = I()\n S = str(input())\n \n if S[0]=='W':\n print(0)\n exit()\n \n+if S[2*N-1]=='W':\n+ print(0)\n+ exit()\n+\n d = ['L']*(2*N)\n+\n for i in range(1,2*N):\n if S[i]!=S[i-1]:\n d[i]=d[i-1]\n else:\n if d[i-1]=='L':\n d[i] = 'R'\n else:\n d[i] = 'L'\n \n+nr = 0\n+nl = 0\n+for i in range(2*N):\n+ if d[i]=='L':\n+ nl += 1\n+ else:\n+ nr += 1\n+if nl != nr:\n+ print(0)\n+ exit()\n+\n+\n+\n temp = 0\n x = [0]*(2*N)\n for i in range(2*N):\n if d[i]=='L':\n temp += 1\n else:\n x[i] = temp\n \n ans = 1\n rnum = 0\n for i in range(2*N):\n if d[i]=='R':\n ans *= x[i]-rnum\n ans %= mod\n rnum += 1\n \n ans *= fact(N)\n ans %= mod\n \n print(ans)\n", "FL_content": "\n \n import sys\n import math\n from collections import defaultdict\n \n \n sys.setrecursionlimit(10**7)\n def input():\n return sys.stdin.readline()[:-1]\n \n \n mod = 10**9 + 7\n \n \n def I(): return int(input())\n def II(): return map(int, input().split())\n def III(): return list(map(int, input().split()))\n def Line(N):\n read_all = [tuple(map(int, input().split())) for _ in range(N)]\n return map(list,zip(*read_all))\n \n \n \n def fact(a,M=mod):\n ans = 1\n for i in range(2,a+1):\n ans = ans*i\n ans = ans%M\n return ans\n \n N = I()\n S = str(input())\n \n if S[0]=='W':\n print(0)\n exit()\n \n d = ['L']*(2*N)\n for i in range(1,2*N):\n if S[i]!=S[i-1]:\n d[i]=d[i-1]\n else:\n if d[i-1]=='L':\n d[i] = 'R'\n else:\n d[i] = 'L'\n \n temp = 0\n x = [0]*(2*N)\n for i in range(2*N):\n if d[i]=='L':\n temp += 1\n else:\n x[i] = temp\n \n ans = 1\n rnum = 0\n for i in range(2*N):\n if d[i]=='R':\n ans *= x[i]-rnum\n ans = ans%mod\n rnum += 1\n \n ans *= fact(N)\n ans %= mod\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 67 }, { "user_id": "u375616706", "problem_id": "p02929", "submission1_id": "s629094553-FL", "submission2_id": "s612267302", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\n\nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\n\n\nclass FactMod():\n \n\n def __init__(self, n, mod):\n \n self.mod = mod\n self.f = [1]*(n+1)\n for i in range(1, n+1):\n self.f[i] = self.f[i-1]*i % mod\n\n self.inv = [pow(self.f[-1], mod-2, mod)]\n for i in range(1, n+1)[::-1]:\n self.inv.append(self.inv[-1]*i % mod)\n self.inv.reverse()\n\n def fact(self, n):\n \n return self.f[n]\n\n def comb(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]*self.inv[r]\n ret %= self.mod\n return ret\n\n def perm(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]\n ret %= self.mod\n return ret\n\n def fact(self, n):\n return self.f[n]\n\n\nMOD = 10**9+7\nN = int(input())\nS = input()[:-1]\nF = FactMod(N+1, MOD)\n\ncnt_W = 0\ncnt = 0\nans = 1\nfor i, c in enumerate(S):\n if c == \"B\":\n tmp = 1\n else:\n tmp = 0\n if i % 2 == 0:\n tmp ^= 1\n\n if tmp == 0:\n cnt += 1\n else:\n ans *= cnt\n ans %= MOD\n cnt -= 1\n cnt_W += 1\nif cnt != N:\n ans = 0\nelse:\n ans *= F.fact(N)\n ans %= MOD\nprint(ans)\n", "code2": "from collections import Counter\n\nimport sys\nsys.setrecursionlimit(10**9)\ninput = sys.stdin.readline\n\n\nclass FactMod():\n \n\n def __init__(self, n, mod):\n \n self.mod = mod\n self.f = [1]*(n+1)\n for i in range(1, n+1):\n self.f[i] = self.f[i-1]*i % mod\n\n self.inv = [pow(self.f[-1], mod-2, mod)]\n for i in range(1, n+1)[::-1]:\n self.inv.append(self.inv[-1]*i % mod)\n self.inv.reverse()\n\n def fact(self, n):\n \n return self.f[n]\n\n def comb(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]*self.inv[r]\n ret %= self.mod\n return ret\n\n def perm(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]\n ret %= self.mod\n return ret\n\n def fact(self, n):\n return self.f[n]\n\n\nMOD = 10**9+7\nN = int(input())\nS = input()[:-1]\nF = FactMod(N+1, MOD)\n\ncnt_W = 0\ncnt = 0\nans = 1\nfor i, c in enumerate(S):\n if c == \"B\":\n tmp = 1\n else:\n tmp = 0\n if i % 2 == 0:\n tmp ^= 1\n\n if tmp == 0:\n cnt += 1\n else:\n ans *= cnt\n ans %= MOD\n cnt -= 1\n cnt_W += 1\nif cnt_W != N:\n ans = 0\nelse:\n ans *= F.fact(N)\n ans %= MOD\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1566759274", "date2": "1566759320", "bleu_score": "0.9971566952772454", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1], "code1_test_score": 100, "total_score": 103, "input": "4\nBWWWBBWB\n", "actual_output": "0\n", "expected_output": "288\n\n", "anno_code": ["from collections import Counter\n\nimport sys\nsys.setrecursionlimit(10**9) # (0): NO CHANGE\ninput = sys.stdin.readline # (1): input=\n\n\nclass FactMod(): # (2): FactMod=\n \n\n def __init__(self, n, mod):\n \n self.mod = mod # (7): NO CHANGE\n self.f = [1]*(n+1) # (8): NO CHANGE\n for i in range(1, n+1): # (9): i=1 (11): i=2 ... (19): NO CHANGE\n self.f[i] = self.f[i-1]*i % mod # (10): NO CHANGE (12): NO CHANGE ... (18): NO CHANGE\n\n self.inv = [pow(self.f[-1], mod-2, mod)] # (20): NO CHANGE\n for i in range(1, n+1)[::-1]: # (21): NO CHANGE (23): i=4 ... (31): NO CHANGE\n self.inv.append(self.inv[-1]*i % mod) # (22): NO CHANGE (24): NO CHANGE ... (30): NO CHANGE\n self.inv.reverse() # (32): Counter=, sys=, input=, FactMod=, MOD=1000000007, N=4, S=BWWWBBWB, F=\n\n def fact(self, n):\n \n return self.f[n]\n\n def comb(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]*self.inv[r]\n ret %= self.mod\n return ret\n\n def perm(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]\n ret %= self.mod\n return ret\n\n def fact(self, n):\n return self.f[n]\n\n\nMOD = 10**9+7 # (3): MOD=1000000007\nN = int(input()) # (4): N=4\nS = input()[:-1] # (5): S=BWWWBBWB\nF = FactMod(N+1, MOD) # (6): self=, n=5, mod=1000000007\n\ncnt_W = 0 # (33): cnt_W=0\ncnt = 0 # (34): cnt=0\nans = 1 # (35): ans=1\nfor i, c in enumerate(S): # (36): i=0, c=B (43): i=1, c=W ... (100): NO CHANGE\n if c == \"B\": # (37): NO CHANGE (44): NO CHANGE ... (92): NO CHANGE\n tmp = 1 # (38): tmp=1 (67): tmp=1 ... (93): NO CHANGE\n else:\n tmp = 0 # (45): NO CHANGE (51): NO CHANGE ... (83): tmp=0\n if i % 2 == 0: # (39): NO CHANGE (46): NO CHANGE ... (94): NO CHANGE\n tmp ^= 1 # (40): tmp=0 (53): tmp=1 ... (85): tmp=1\n\n if tmp == 0: # (41): NO CHANGE (47): NO CHANGE ... (95): NO CHANGE\n cnt += 1 # (42): cnt=1 (48): cnt=2 ... (71): cnt=3\n else:\n ans *= cnt # (55): ans=2 (77): ans=6 ... (96): NO CHANGE\n ans %= MOD # (56): NO CHANGE (78): NO CHANGE ... (97): NO CHANGE\n cnt -= 1 # (57): cnt=1 (79): cnt=2 ... (98): cnt=0\n cnt_W += 1 # (58): cnt_W=1 (80): cnt_W=2 ... (99): cnt_W=4\nif cnt != N: # (101): NO CHANGE\n ans = 0 # (102): ans=0\nelse:\n ans *= F.fact(N)\n ans %= MOD\nprint(ans)\n"], "anno_status": [false], "diff_content": " from collections import Counter\n \n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n \n \n class FactMod():\n \n \n def __init__(self, n, mod):\n \n self.mod = mod\n self.f = [1]*(n+1)\n for i in range(1, n+1):\n self.f[i] = self.f[i-1]*i % mod\n \n self.inv = [pow(self.f[-1], mod-2, mod)]\n for i in range(1, n+1)[::-1]:\n self.inv.append(self.inv[-1]*i % mod)\n self.inv.reverse()\n \n def fact(self, n):\n \n return self.f[n]\n \n def comb(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]*self.inv[r]\n ret %= self.mod\n return ret\n \n def perm(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]\n ret %= self.mod\n return ret\n \n def fact(self, n):\n return self.f[n]\n \n \n MOD = 10**9+7\n N = int(input())\n S = input()[:-1]\n F = FactMod(N+1, MOD)\n \n cnt_W = 0\n cnt = 0\n ans = 1\n for i, c in enumerate(S):\n if c == \"B\":\n tmp = 1\n else:\n tmp = 0\n if i % 2 == 0:\n tmp ^= 1\n \n if tmp == 0:\n cnt += 1\n else:\n ans *= cnt\n ans %= MOD\n cnt -= 1\n cnt_W += 1\n-if cnt != N:\n+if cnt_W != N:\n ans = 0\n else:\n ans *= F.fact(N)\n ans %= MOD\n print(ans)\n \n", "FL_content": "\n from collections import Counter\n \n import sys\n sys.setrecursionlimit(10**9)\n input = sys.stdin.readline\n \n \n class FactMod():\n \n \n def __init__(self, n, mod):\n \n self.mod = mod\n self.f = [1]*(n+1)\n for i in range(1, n+1):\n self.f[i] = self.f[i-1]*i % mod\n \n self.inv = [pow(self.f[-1], mod-2, mod)]\n for i in range(1, n+1)[::-1]:\n self.inv.append(self.inv[-1]*i % mod)\n self.inv.reverse()\n \n def fact(self, n):\n \n return self.f[n]\n \n def comb(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]*self.inv[r]\n ret %= self.mod\n return ret\n \n def perm(self, n, r):\n \n ret = self.f[n] * self.inv[n-r]\n ret %= self.mod\n return ret\n \n def fact(self, n):\n return self.f[n]\n \n \n MOD = 10**9+7\n N = int(input())\n S = input()[:-1]\n F = FactMod(N+1, MOD)\n \n cnt_W = 0\n cnt = 0\n ans = 1\n for i, c in enumerate(S):\n if c == \"B\":\n tmp = 1\n else:\n tmp = 0\n if i % 2 == 0:\n tmp ^= 1\n \n if tmp == 0:\n cnt += 1\n else:\n ans *= cnt\n ans %= MOD\n cnt -= 1\n cnt_W += 1\n if cnt != N:\n ans = 0\n else:\n ans *= F.fact(N)\n ans %= MOD\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 72 }, { "user_id": "u940139461", "problem_id": "p03419", "submission1_id": "s994317798-FL", "submission2_id": "s256071548", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nn, m = map(int, input().split())\n\nperemeter = 0\nif n == 1 or m == 1:\n peremeter += 2\nelse:\n if n - 1 > 0:\n peremeter += (n - 1) * 2\n if m - 1 > 0:\n peremeter += (m - 1) * 2\nans = n * m - peremeter\nprint(ans)", "code2": "\n\nn, m = map(int, input().split())\n\nperemeter = 0\nif n == 1 and m == 1:\n pass \nelif n == 1 or m == 1:\n peremeter += 2\nelse:\n peremeter += (n - 1) * 2\n peremeter += (m - 1) * 2\nans = n * m - peremeter\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1588264667", "date2": "1588265094", "bleu_score": "0.8611262209220072", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 69, "total_score": 78, "input": "69 -1\n", "actual_output": "-205\n", "expected_output": "-201\n\n", "anno_code": ["\n\nn, m = map(int, input().split()) # (0): n=69, m=-1\n\nperemeter = 0 # (1): peremeter=0\nif n == 1 or m == 1: # (2): NO CHANGE\n peremeter += 2\nelse:\n if n - 1 > 0: # (3): NO CHANGE\n peremeter += (n - 1) * 2 # (4): peremeter=136\n if m - 1 > 0: # (5): NO CHANGE\n peremeter += (m - 1) * 2\nans = n * m - peremeter # (6): ans=-205\nprint(ans)"], "anno_status": [true], "diff_content": " \n \n n, m = map(int, input().split())\n \n peremeter = 0\n-if n == 1 or m == 1:\n+if n == 1 and m == 1:\n+ pass \n+elif n == 1 or m == 1:\n peremeter += 2\n else:\n- if n - 1 > 0:\n- peremeter += (n - 1) * 2\n- if m - 1 > 0:\n- peremeter += (m - 1) * 2\n+ peremeter += (n - 1) * 2\n+ peremeter += (m - 1) * 2\n ans = n * m - peremeter\n print(ans)\n", "FL_content": "\n \n \n n, m = map(int, input().split())\n \n peremeter = 0\n-if n == 1 or m == 1:\n- peremeter += 2\n-else:\n- if n - 1 > 0:\n- peremeter += (n - 1) * 2\n- if m - 1 > 0:\n- peremeter += (m - 1) * 2\n ans = n * m - peremeter\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u046136258", "problem_id": "p03502", "submission1_id": "s393275944-FL", "submission2_id": "s889441480", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nif int(s)%sum(map(int,list(s)))==0:\n\tprint('YES')\nelse:\n \tprint('NO')\n ", "code2": "s=input()\nif int(s)%sum(map(int,list(s)))==0:\n\tprint('Yes')\nelse:\n \tprint('No')\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1513052404", "date2": "1513052512", "bleu_score": "0.9273566911694289", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 23, "input": "151\n", "actual_output": "NO\n", "expected_output": "No\n\n", "anno_code": ["s=input() # (0): s=151\nif int(s)%sum(map(int,list(s)))==0: # (1): NO CHANGE\n\tprint('YES')\nelse:\n \tprint('NO')\n "], "anno_status": [true], "diff_content": " s=input()\n if int(s)%sum(map(int,list(s)))==0:\n-\tprint('YES')\n+\tprint('Yes')\n else:\n- \tprint('NO')\n+ \tprint('No')\n \n", "FL_content": "\n s=input()\n if int(s)%sum(map(int,list(s)))==0:\n-\tprint('YES')\n else:\n- \tprint('NO')\n- \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u679759899", "problem_id": "p03291", "submission1_id": "s957840790-FL", "submission2_id": "s463668266", "status1": "Wrong Answer", "status2": "Accepted", "code1": "MOD = 10 **9 + 7\ns = input()\n\nn = len(s)\na = [0] * (n+1)\nb = [0] * (n+1)\nc = [0] * (n+1)\n\nfor i in range(n):\n if s[i] == '?':\n a[i+1] = a[i] * 3 + 1\n b[i+1] = b[i] * 3 + a[i]\n c[i+1] = c[i] * 3 + b[i]\n else:\n a[i+1] = a[i]\n b[i+1] = b[i]\n c[i+1] = c[i]\n if s[i] == 'A':\n a[i+1] += 1\n if s[i] == 'B':\n b[i+1] += a[i]\n if s[i] == 'C':\n c[i+1] += b[i]\n a[i+1] = a[i+1] % MOD\n b[i+1] = b[i+1] % MOD\n c[i+1] = c[i+1] % MOD\nprint(c[n])", "code2": "MOD = 10 **9 + 7\ns = input()\n\nn = len(s)\no = [1] * (n+1)\na = [0] * (n+1)\nb = [0] * (n+1)\nc = [0] * (n+1)\n\nfor i in range(n):\n if s[i] == '?':\n o[i+1] = o[i] * 3\n a[i+1] = a[i] * 3 + o[i]\n b[i+1] = b[i] * 3 + a[i]\n c[i+1] = c[i] * 3 + b[i]\n else:\n o[i+1] = o[i]\n a[i+1] = a[i]\n b[i+1] = b[i]\n c[i+1] = c[i]\n if s[i] == 'A':\n a[i+1] += o[i]\n if s[i] == 'B':\n b[i+1] += a[i]\n if s[i] == 'C':\n c[i+1] += b[i]\n o[i+1] = o[i+1] % MOD\n a[i+1] = a[i+1] % MOD\n b[i+1] = b[i+1] % MOD\n c[i+1] = c[i+1] % MOD\nprint(c[n])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566012410", "date2": "1566013183", "bleu_score": "0.8411865537993586", "code1_test_status": [1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 7, "total_score": 103, "input": "??>=>=?B;=@@C??@>@@??A???\n", "actual_output": "215884\n", "expected_output": "498636\n\n", "anno_code": ["MOD = 10 **9 + 7 # (0): MOD=1000000007\ns = input() # (1): s=??>=>=?B;=@@C??@>@@??A???\n\nn = len(s) # (2): n=25\na = [0] * (n+1) # (3): a=[0, 0, ..., 0, 0]\nb = [0] * (n+1) # (4): b=[0, 0, ..., 0, 0]\nc = [0] * (n+1) # (5): c=[0, 0, ..., 0, 0]\n\nfor i in range(n): # (6): i=0 (14): i=1 ... (254): NO CHANGE\n if s[i] == '?': # (7): NO CHANGE (15): NO CHANGE ... (247): NO CHANGE\n a[i+1] = a[i] * 3 + 1 # (8): a=[0, 1, ..., 0, 0] (16): a=[0, 1, ..., 0, 0] ... (248): a=[0, 1, ..., 9850, 29551]\n b[i+1] = b[i] * 3 + a[i] # (9): NO CHANGE (17): b=[0, 0, ..., 0, 0] ... (249): b=[0, 0, ..., 34087, 112111]\n c[i+1] = c[i] * 3 + b[i] # (10): NO CHANGE (18): NO CHANGE ... (250): c=[0, 0, ..., 60599, 215884]\n else:\n a[i+1] = a[i] # (24): a=[0, 1, ..., 0, 0] (35): a=[0, 1, ..., 0, 0] ... (220): a=[0, 1, ..., 0, 0]\n b[i+1] = b[i] # (25): b=[0, 0, ..., 0, 0] (36): b=[0, 0, ..., 0, 0] ... (221): b=[0, 0, ..., 0, 0]\n c[i+1] = c[i] # (26): NO CHANGE (37): NO CHANGE ... (222): c=[0, 0, ..., 0, 0]\n if s[i] == 'A': # (27): NO CHANGE (38): NO CHANGE ... (223): NO CHANGE\n a[i+1] += 1 # (224): a=[0, 1, ..., 0, 0]\n if s[i] == 'B': # (28): NO CHANGE (39): NO CHANGE ... (225): NO CHANGE\n b[i+1] += a[i] # (81): b=[0, 0, ..., 0, 0]\n if s[i] == 'C': # (29): NO CHANGE (40): NO CHANGE ... (226): NO CHANGE\n c[i+1] += b[i] # (138): c=[0, 0, ..., 0, 0]\n a[i+1] = a[i+1] % MOD # (11): NO CHANGE (19): NO CHANGE ... (251): NO CHANGE\n b[i+1] = b[i+1] % MOD # (12): NO CHANGE (20): NO CHANGE ... (252): NO CHANGE\n c[i+1] = c[i+1] % MOD # (13): NO CHANGE (21): NO CHANGE ... (253): NO CHANGE\nprint(c[n])"], "anno_status": [false], "diff_content": " MOD = 10 **9 + 7\n s = input()\n \n n = len(s)\n+o = [1] * (n+1)\n a = [0] * (n+1)\n b = [0] * (n+1)\n c = [0] * (n+1)\n \n for i in range(n):\n if s[i] == '?':\n- a[i+1] = a[i] * 3 + 1\n+ o[i+1] = o[i] * 3\n+ a[i+1] = a[i] * 3 + o[i]\n b[i+1] = b[i] * 3 + a[i]\n c[i+1] = c[i] * 3 + b[i]\n else:\n+ o[i+1] = o[i]\n a[i+1] = a[i]\n b[i+1] = b[i]\n c[i+1] = c[i]\n if s[i] == 'A':\n- a[i+1] += 1\n+ a[i+1] += o[i]\n if s[i] == 'B':\n b[i+1] += a[i]\n if s[i] == 'C':\n c[i+1] += b[i]\n+ o[i+1] = o[i+1] % MOD\n a[i+1] = a[i+1] % MOD\n b[i+1] = b[i+1] % MOD\n c[i+1] = c[i+1] % MOD\n print(c[n])\n", "FL_content": "\n MOD = 10 **9 + 7\n s = input()\n \n n = len(s)\n a = [0] * (n+1)\n b = [0] * (n+1)\n c = [0] * (n+1)\n \n for i in range(n):\n if s[i] == '?':\n a[i+1] = a[i] * 3 + 1\n b[i+1] = b[i] * 3 + a[i]\n c[i+1] = c[i] * 3 + b[i]\n else:\n a[i+1] = a[i]\n b[i+1] = b[i]\n c[i+1] = c[i]\n if s[i] == 'A':\n a[i+1] += 1\n if s[i] == 'B':\n b[i+1] += a[i]\n if s[i] == 'C':\n c[i+1] += b[i]\n a[i+1] = a[i+1] % MOD\n b[i+1] = b[i+1] % MOD\n c[i+1] = c[i+1] % MOD\n-print(c[n])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u708618797", "problem_id": "p02839", "submission1_id": "s956231502-FL", "submission2_id": "s276845746", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nsys.setrecursionlimit(2147483647)\nINF=float(\"inf\")\nMOD=10**9+7\ninput=lambda:sys.stdin.readline().rstrip()\ndef resolve():\n ofs=6400\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 dp=[[0]*w for _ in range(h)]\n x=abs(A[0][0]-B[0][0])\n dp[0][0]|=(1<<(ofs+x))|(1<<(ofs-x))\n\n from itertools import product\n for i,j in product(range(h),range(w)):\n x=abs(A[i][j]-B[i][j])\n t=0\n if(i-1>=0):\n t|=dp[i-1][j]\n if(j-1>=0):\n t|=dp[i][j-1]\n dp[i][j]=(t<>x)\n\n for i,s in enumerate(bin(dp[-1][-1])[ofs:]):\n if(s=='1'):\n print(i)\n return\n \nresolve()\n", "code2": "\nimport sys\nsys.setrecursionlimit(2147483647)\nINF=float(\"inf\")\nMOD=10**9+7\ninput=lambda:sys.stdin.readline().rstrip()\ndef resolve():\n ofs=6400\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 dp=[[0]*w for _ in range(h)]\n x=abs(A[0][0]-B[0][0])\n dp[0][0]|=((1<<(ofs+x))|(1<<(ofs-x)))\n\n from itertools import product\n for i,j in product(range(h),range(w)):\n x=abs(A[i][j]-B[i][j])\n t=0\n if(i-1>=0):\n t|=dp[i-1][j]\n if(j-1>=0):\n t|=dp[i][j-1]\n dp[i][j]|=((t<>x))\n\n for i,s in enumerate(bin(dp[-1][-1])[-ofs-1:]):\n if(s=='1'):\n print(i)\n return\n \nresolve()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575873149", "date2": "1575874859", "bleu_score": "0.981482674593877", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "2 3\n1 10 80\n80 10 1\n1 2 3\n4 2 6\n", "actual_output": "no output\n", "expected_output": "5\n\n", "anno_code": ["\nimport sys\nsys.setrecursionlimit(2147483647) # (0): NO CHANGE\nINF=float(\"inf\") # (1): INF=inf\nMOD=10**9+7 # (2): MOD=1000000007\ninput=lambda:sys.stdin.readline().rstrip() # (3): input= at 0x000001DE1C995BD0>\ndef resolve(): # (4): resolve=\n ofs=6400 # (6): ofs=6400\n h,w=map(int,input().split()) # (7): h=2, w=3\n A=[list(map(int,input().split())) for _ in range(h)] # (8): A\n B=[list(map(int,input().split())) for _ in range(h)] # (9): B\n dp=[[0]*w for _ in range(h)] # (10): dp\n x=abs(A[0][0]-B[0][0]) # (11): x=0\n dp[0][0]|=(1<<(ofs+x))|(1<<(ofs-x)) # (12): dp, product=\n\n from itertools import product\n for i,j in product(range(h),range(w)): # (13): i=0, j=0 (19): j=1 ... (56): NO CHANGE\n x=abs(A[i][j]-B[i][j]) # (14): NO CHANGE (20): x=8 ... (49): x=5\n t=0 # (15): t=0 (21): NO CHANGE ... (50): NO CHANGE\n if(i-1>=0): # (16): NO CHANGE (22): NO CHANGE ... (51): NO CHANGE\n t|=dp[i-1][j] # (37): NO CHANGE (44): NO CHANGE (52): NO CHANGE\n if(j-1>=0): # (17): NO CHANGE (23): NO CHANGE ... (53): NO CHANGE\n t|=dp[i][j-1] # (24): NO CHANGE (31): NO CHANGE ... (54): NO CHANGE\n dp[i][j]=(t<>x) # (18): dp (25): NO CHANGE ... (55): NO CHANGE\n\n for i,s in enumerate(bin(dp[-1][-1])[ofs:]):\n if(s=='1'):\n print(i)\n return\n \nresolve() # (5): NO CHANGE\n"], "anno_status": [false], "diff_content": " \n import sys\n sys.setrecursionlimit(2147483647)\n INF=float(\"inf\")\n MOD=10**9+7\n input=lambda:sys.stdin.readline().rstrip()\n def resolve():\n ofs=6400\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 dp=[[0]*w for _ in range(h)]\n x=abs(A[0][0]-B[0][0])\n- dp[0][0]|=(1<<(ofs+x))|(1<<(ofs-x))\n+ dp[0][0]|=((1<<(ofs+x))|(1<<(ofs-x)))\n \n from itertools import product\n for i,j in product(range(h),range(w)):\n x=abs(A[i][j]-B[i][j])\n t=0\n if(i-1>=0):\n t|=dp[i-1][j]\n if(j-1>=0):\n t|=dp[i][j-1]\n- dp[i][j]=(t<>x)\n+ dp[i][j]|=((t<>x))\n \n- for i,s in enumerate(bin(dp[-1][-1])[ofs:]):\n+ for i,s in enumerate(bin(dp[-1][-1])[-ofs-1:]):\n if(s=='1'):\n print(i)\n return\n \n resolve()\n \n", "FL_content": "\n \n import sys\n sys.setrecursionlimit(2147483647)\n INF=float(\"inf\")\n MOD=10**9+7\n input=lambda:sys.stdin.readline().rstrip()\n def resolve():\n- ofs=6400\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 dp=[[0]*w for _ in range(h)]\n x=abs(A[0][0]-B[0][0])\n- dp[0][0]|=(1<<(ofs+x))|(1<<(ofs-x))\n \n from itertools import product\n for i,j in product(range(h),range(w)):\n x=abs(A[i][j]-B[i][j])\n t=0\n if(i-1>=0):\n t|=dp[i-1][j]\n if(j-1>=0):\n t|=dp[i][j-1]\n dp[i][j]=(t<>x)\n \n for i,s in enumerate(bin(dp[-1][-1])[ofs:]):\n if(s=='1'):\n print(i)\n return\n \n resolve()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 32 }, { "user_id": "u889919275", "problem_id": "p03031", "submission1_id": "s318214017-FL", "submission2_id": "s644939042", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\nk_list = [list(map(int, input().split()))[1:] for _ in range(m)]\np_list = list(map(int, input().split()))\n\nans = 0\nfor bit in range(2**n):\n check = True\n for k, p in zip(k_list, p_list):\n count = 0\n for i in range(n):\n if bit & (1 << i):\n if i in k:\n count += 1\n if (count%2) != p:\n check = False\n break\n if check:\n ans += 1\n \nprint(ans)", "code2": "N, M = map(int, input().split())\nks = []\nfor _ in range(M):\n ks.append(list(map(int, input().split())))\np = list(map(int, input().split()))\n\nans = 0\nfor bit in range(2**N):\n on_list = []\n for i in range(N):\n if bit & (1 << i):\n on_list.append(i+1)\n flag = True\n for s, p_ in zip(ks, p):\n on_sum = len(list(set(on_list) & set(s[1:])))\n if on_sum % 2 != p_:\n flag = False\n break\n \n if flag:\n ans += 1\n \nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592881497", "date2": "1595903347", "bleu_score": "0.7452275335339373", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 99, "total_score": 103, "input": "2 2\n1 1 2\n1 2\n0 0\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=2, m=2\nk_list = [list(map(int, input().split()))[1:] for _ in range(m)] # (1): k_list\np_list = list(map(int, input().split())) # (2): k_list, p_list=[0, 0]\n\nans = 0 # (3): k_list, ans=0\nfor bit in range(2**n): # (4): k_list, bit=0 (25): k_list, bit=1 ... (79): k_list\n check = True # (5): k_list, check=True (26): k_list ... (64): k_list, check=True\n for k, p in zip(k_list, p_list): # (6): k_list, k=[1, 2], p=0 (14): k_list, k=[2] ... (65): k_list\n count = 0 # (7): k_list, count=0 (15): k_list ... (66): k_list, count=0\n for i in range(n): # (8): k_list, i=0 (10): k_list, i=1 ... (74): k_list\n if bit & (1 << i): # (9): k_list (11): k_list ... (71): k_list\n if i in k: # (31): k_list (40): k_list ... (72): k_list\n count += 1 # (57): k_list, count=1 (73): k_list, count=1\n if (count%2) != p: # (13): k_list (21): k_list ... (75): k_list\n check = False # (60): k_list, check=False (76): k_list, check=False\n break # (61): k_list (77): k_list\n if check: # (23): k_list (46): k_list ... (78): k_list\n ans += 1 # (24): k_list, ans=1 (47): k_list, ans=2\n \nprint(ans)"], "anno_status": [true], "diff_content": "-n, m = map(int, input().split())\n-k_list = [list(map(int, input().split()))[1:] for _ in range(m)]\n-p_list = list(map(int, input().split()))\n+N, M = map(int, input().split())\n+ks = []\n+for _ in range(M):\n+ ks.append(list(map(int, input().split())))\n+p = list(map(int, input().split()))\n \n ans = 0\n-for bit in range(2**n):\n- check = True\n- for k, p in zip(k_list, p_list):\n- count = 0\n- for i in range(n):\n- if bit & (1 << i):\n- if i in k:\n- count += 1\n- if (count%2) != p:\n- check = False\n+for bit in range(2**N):\n+ on_list = []\n+ for i in range(N):\n+ if bit & (1 << i):\n+ on_list.append(i+1)\n+ flag = True\n+ for s, p_ in zip(ks, p):\n+ on_sum = len(list(set(on_list) & set(s[1:])))\n+ if on_sum % 2 != p_:\n+ flag = False\n break\n- if check:\n+ \n+ if flag:\n ans += 1\n \n print(ans)\n", "FL_content": "\n n, m = map(int, input().split())\n k_list = [list(map(int, input().split()))[1:] for _ in range(m)]\n p_list = list(map(int, input().split()))\n \n ans = 0\n for bit in range(2**n):\n check = True\n for k, p in zip(k_list, p_list):\n count = 0\n for i in range(n):\n if bit & (1 << i):\n if i in k:\n count += 1\n if (count%2) != p:\n check = False\n break\n if check:\n ans += 1\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u560301743", "problem_id": "p04000", "submission1_id": "s115002494-FL", "submission2_id": "s883653680", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, W, N = [int(v) for v in input().split()]\npoints = (map(int, input().split()) for _ in range(N))\nmemory = {}\n\nfor ai, bi in points:\n for i in range(max(2, ai - 1), min(H - 1, ai + 1) + 1):\n for j in range(max(2, bi - 1), min(W - 1, bi + 1) + 1):\n key = (i, j)\n if not key in memory:\n memory[key] = 0\n memory[key] += 1\n\ncounter = {i: 0 for i in range(1, 9 + 1)}\nfor v in memory.values():\n counter[v] += 1\n\nfor i in range(1, 9 + 1):\n print(counter[i])", "code2": "H, W, N = [int(v) for v in input().split()]\npoints = (map(int, input().split()) for _ in range(N))\nmemory = {}\nfor ai, bi in points:\n for i in range(max(2, ai - 1), min(H - 1, ai + 1) + 1):\n for j in range(max(2, bi - 1), min(W - 1, bi + 1) + 1):\n key = (i, j)\n if not key in memory:\n memory[key] = 0\n memory[key] += 1\n\ncounter = {i: 0 for i in range(1, 10)}\nfor v in memory.values():\n counter[v] += 1\n\nprint((H - 2) * (W - 2) - sum(counter.values()))\nfor i in range(1, 10):\n print(counter[i])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590350007", "date2": "1590350331", "bleu_score": "0.898822056643126", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "10 10 20\n1 2\n1 4\n1 9\n2 5\n3 10\n4 2\n4 7\n5 9\n6 4\n6 6\n6 7\n7 1\n7 3\n7 7\n8 1\n9 5\n8 10\n9 2\n10 0\n10 9\n", "actual_output": "28\n22\n9\n1\n0\n0\n0\n0\n0\n", "expected_output": "4\n28\n22\n9\n1\n0\n0\n0\n0\n0\n\n", "anno_code": ["H, W, N = [int(v) for v in input().split()] # (0): H=10, W=10, N=20\npoints = (map(int, input().split()) for _ in range(N)) # (1): points= at 0x0000027AD0E5BCA0>\nmemory = {} # (2): memory={}\n\nfor ai, bi in points: # (3): ai=1, bi=2 (17): bi=4 ... (609): NO CHANGE\n for i in range(max(2, ai - 1), min(H - 1, ai + 1) + 1): # (4): i=2 (16): NO CHANGE ... (608): NO CHANGE\n for j in range(max(2, bi - 1), min(W - 1, bi + 1) + 1): # (5): j=2 (10): j=3 ... (607): NO CHANGE\n key = (i, j) # (6): key=(2, 2) (11): key=(2, 3) ... (604): key=(9, 9)\n if not key in memory: # (7): NO CHANGE (12): NO CHANGE ... (605): NO CHANGE\n memory[key] = 0 # (8): memory={(2, 2): 0} (13): memory={(2, 2): 1, (2, 3): 0} ... (601): memory={(2, 2): 1, (2, 3): 2, (2, 4): 2, (2, 5): 2, (2, 8): 1, (2, 9): 2, (2, 6): 1, (3, 4): 1, (3, 5): 1, (3, 6): 2, (3, 9): 1, (4, 9): 2, (3, 2): 1, (3, 3): 1, (4, 2): 1, (4, 3): 1, (5, 2): 1, (5, 3): 2, (3, 7): 1, (3, 8): 1, (4, 6): 1, (4, 7): 1, (4, 8): 2, (5, 6): 3, (5, 7): 3, (5, 8): 3, (5, 9): 1, (6, 8): 3, (6, 9): 1, (5, 4): 1, (5, 5): 2, (6, 3): 2, (6, 4): 2, (6, 5): 2, (7, 3): 2, (7, 4): 2, (7, 5): 2, (6, 6): 3, (6, 7): 3, (7, 6): 3, (7, 7): 3, (7, 8): 2, (6, 2): 2, (7, 2): 3, (8, 2): 4, (8, 3): 2, (8, 4): 2, (8, 6): 2, (8, 7): 1, (8, 8): 1, (9, 2): 2, (8, 5): 1, (9, 4): 1, (9, 5): 1, (9, 6): 1, (7, 9): 1, (8, 9): 1, (9, 9): 1, (9, 3): 1, (9, 8): 0}\n memory[key] += 1 # (9): memory={(2, 2): 1} (14): memory={(2, 2): 1, (2, 3): 1} ... (606): memory={(2, 2): 1, (2, 3): 2, (2, 4): 2, (2, 5): 2, (2, 8): 1, (2, 9): 2, (2, 6): 1, (3, 4): 1, (3, 5): 1, (3, 6): 2, (3, 9): 1, (4, 9): 2, (3, 2): 1, (3, 3): 1, (4, 2): 1, (4, 3): 1, (5, 2): 1, (5, 3): 2, (3, 7): 1, (3, 8): 1, (4, 6): 1, (4, 7): 1, (4, 8): 2, (5, 6): 3, (5, 7): 3, (5, 8): 3, (5, 9): 1, (6, 8): 3, (6, 9): 1, (5, 4): 1, (5, 5): 2, (6, 3): 2, (6, 4): 2, (6, 5): 2, (7, 3): 2, (7, 4): 2, (7, 5): 2, (6, 6): 3, (6, 7): 3, (7, 6): 3, (7, 7): 3, (7, 8): 2, (6, 2): 2, (7, 2): 3, (8, 2): 4, (8, 3): 2, (8, 4): 2, (8, 6): 2, (8, 7): 1, (8, 8): 1, (9, 2): 2, (8, 5): 1, (9, 4): 1, (9, 5): 1, (9, 6): 1, (7, 9): 1, (8, 9): 1, (9, 9): 2, (9, 3): 1, (9, 8): 1}\n\ncounter = {i: 0 for i in range(1, 9 + 1)} # (610): counter={1: 0, 2: 0, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0, 8: 0, 9: 0}\nfor v in memory.values(): # (611): v=1 (613): v=2 ... (731): NO CHANGE\n counter[v] += 1 # (612): counter={1: 1, 2: 0, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0, 8: 0, 9: 0} (614): counter={1: 1, 2: 1, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0, 8: 0, 9: 0} ... (730): counter={1: 28, 2: 22, 3: 9, 4: 1, 5: 0, 6: 0, 7: 0, 8: 0, 9: 0}\n\nfor i in range(1, 9 + 1): # (732): i=1 (734): i=2 ... (748): i=9\n print(counter[i]) # (733): NO CHANGE (735): NO CHANGE ... (749): NO CHANGE\n"], "anno_status": [false], "diff_content": " H, W, N = [int(v) for v in input().split()]\n points = (map(int, input().split()) for _ in range(N))\n memory = {}\n-\n for ai, bi in points:\n for i in range(max(2, ai - 1), min(H - 1, ai + 1) + 1):\n for j in range(max(2, bi - 1), min(W - 1, bi + 1) + 1):\n key = (i, j)\n if not key in memory:\n memory[key] = 0\n memory[key] += 1\n \n-counter = {i: 0 for i in range(1, 9 + 1)}\n+counter = {i: 0 for i in range(1, 10)}\n for v in memory.values():\n counter[v] += 1\n \n-for i in range(1, 9 + 1):\n+print((H - 2) * (W - 2) - sum(counter.values()))\n+for i in range(1, 10):\n print(counter[i])\n+\n", "FL_content": "\n H, W, N = [int(v) for v in input().split()]\n points = (map(int, input().split()) for _ in range(N))\n memory = {}\n \n for ai, bi in points:\n for i in range(max(2, ai - 1), min(H - 1, ai + 1) + 1):\n for j in range(max(2, bi - 1), min(W - 1, bi + 1) + 1):\n key = (i, j)\n if not key in memory:\n memory[key] = 0\n memory[key] += 1\n \n counter = {i: 0 for i in range(1, 9 + 1)}\n for v in memory.values():\n counter[v] += 1\n \n for i in range(1, 9 + 1):\n print(counter[i])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u720674978", "problem_id": "p02415", "submission1_id": "s814805313-FL", "submission2_id": "s543043180", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print(input().swapcase)\n", "code2": "print(input().swapcase())\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1540250572", "date2": "1540250589", "bleu_score": "0.8647513948254395", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "GAg,U HAQI-T AKK@YBJRODPN BKWUD1Q\n", "actual_output": "\n", "expected_output": "gaG,u haqi-t akk@ybjrodpn bkwud1q\n\n", "anno_code": ["print(input().swapcase)\n"], "anno_status": [true], "diff_content": "-print(input().swapcase)\n+print(input().swapcase())\n \n", "FL_content": "\n-print(input().swapcase)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 2 }, { "user_id": "u630511239", "problem_id": "p03437", "submission1_id": "s819063335-FL", "submission2_id": "s171624133", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X, Y = map(int, input().split())\nif Y % X == 0 or X % Y == 0:\n ans = -1\nelse:\n ans = X\nif ans > 10**18:\n ans = -1\nif X == 1 and Y != 1:\n ans = Y + 1\nprint(ans)", "code2": "X, Y = map(int, input().split())\nif X % Y == 0:\n ans = -1\nelif Y % X == 0:\n ans = X * (Y\nelse:\n ans = X\nif ans > 10**18:\n ans = -1\nif X == 1 and Y != 1:\n ans = Y + 1\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1593171620", "date2": "1593172184", "bleu_score": "0.8759433950524602", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 24, "total_score": 25, "input": "-6 12\n", "actual_output": "-1\n", "expected_output": "-6\n\n", "anno_code": ["X, Y = map(int, input().split()) # (0): X=-6, Y=12\nif Y % X == 0 or X % Y == 0: # (1): NO CHANGE\n ans = -1 # (2): ans=-1\nelse:\n ans = X\nif ans > 10**18: # (3): NO CHANGE\n ans = -1\nif X == 1 and Y != 1: # (4): NO CHANGE\n ans = Y + 1\nprint(ans)"], "anno_status": [true], "diff_content": " X, Y = map(int, input().split())\n-if Y % X == 0 or X % Y == 0:\n+if X % Y == 0:\n ans = -1\n+elif Y % X == 0:\n+ ans = X * (Y\n else:\n ans = X\n if ans > 10**18:\n ans = -1\n if X == 1 and Y != 1:\n ans = Y + 1\n print(ans)\n", "FL_content": "\n X, Y = map(int, input().split())\n if Y % X == 0 or X % Y == 0:\n ans = -1\n else:\n ans = X\n if ans > 10**18:\n ans = -1\n-if X == 1 and Y != 1:\n- ans = Y + 1\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u345710188", "problem_id": "p03338", "submission1_id": "s693145670-FL", "submission2_id": "s146676510", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nS = input()\na = set(S[:1])\nb = set(S[1:])\nM = a & b\n\nfor i in range(2,N):\n a = set(S[:i])\n b = set(S[i:])\n if (a & b) > M:\n M = (a & b)\n else:\n print(M)\n break", "code2": "N = int(input())\nS = input()\na = set(S[:1])\nb = set(S[1:])\nM = len(a & b)\n\nfor i in range(2,N):\n a = set(S[:i])\n b = set(S[i:])\n if len(a & b) > M:\n M = len(a & b)\n\nprint(M)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569635973", "date2": "1569636907", "bleu_score": "0.8485713281722653", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "6\nabdbb`\n", "actual_output": "{'b'}\n", "expected_output": "1\n\n", "anno_code": ["N = int(input()) # (0): N=6\nS = input() # (1): S=abdbb`\na = set(S[:1]) # (2): a={'a'}\nb = set(S[1:]) # (3): b={'d', 'b', '`'}\nM = a & b # (4): M=set()\n\nfor i in range(2,N): # (5): i=2 (10): i=3\n a = set(S[:i]) # (6): a={'a', 'b'} (11): a={'d', 'b', 'a'}\n b = set(S[i:]) # (7): NO CHANGE (12): b={'b', '`'}\n if (a & b) > M: # (8): NO CHANGE (13): NO CHANGE\n M = (a & b) # (9): M={'b'}\n else:\n print(M) # (14): NO CHANGE\n break"], "anno_status": [true], "diff_content": " N = int(input())\n S = input()\n a = set(S[:1])\n b = set(S[1:])\n-M = a & b\n+M = len(a & b)\n \n for i in range(2,N):\n a = set(S[:i])\n b = set(S[i:])\n- if (a & b) > M:\n- M = (a & b)\n- else:\n- print(M)\n- break\n+ if len(a & b) > M:\n+ M = len(a & b)\n+\n+print(M)\n", "FL_content": "\n N = int(input())\n S = input()\n a = set(S[:1])\n b = set(S[1:])\n M = a & b\n \n for i in range(2,N):\n a = set(S[:i])\n b = set(S[i:])\n if (a & b) > M:\n M = (a & b)\n else:\n- print(M)\n break\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u423585790", "problem_id": "p02948", "submission1_id": "s507960250-FL", "submission2_id": "s994316654", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nfrom collections import defaultdict,deque\nfrom heapq import heappush, heappop\nfrom bisect import *\nimport sys, random, itertools, math\nsys.setrecursionlimit(10**5)\ninput = sys.stdin.readline\nsqrt = math.sqrt\ndef LI(): return list(map(int, input().split()))\ndef LF(): return list(map(float, input().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, input().split()))\ndef II(): return int(input())\ndef IF(): return float(input())\ndef LS(): return list(map(list, input().split()))\ndef S(): return list(input().rstrip())\ndef IR(n): return [II() for _ in range(n)]\ndef LIR(n): return [LI() for _ in range(n)]\ndef FR(n): return [IF() for _ in range(n)]\ndef LFR(n): return [LI() for _ in range(n)]\ndef LIR_(n): return [LI_() for _ in range(n)]\ndef SR(n): return [S() for _ in range(n)]\ndef LSR(n): return [LS() for _ in range(n)]\nmod = 1000000007\ninf = float('INF')\n\n\ndef A():\n a, b = LI()\n print(max(a + b, a - b, a * b))\n return\n\n\ndef B():\n k, x = LI()\n ans = []\n for i in range(x - k + 1, x + k):\n ans.append(i)\n print(*ans)\n return\n\n\ndef C():\n n = II()\n d = defaultdict(int)\n for _ in range(n):\n s = S()\n s.sort()\n d[tuple(s)] += 1\n ans = 0\n for i in d.values():\n ans += i * (i - 1) \n print(ans)\n return\n\n\ndef D():\n n, m = LI()\n ab = LIR(n)\n ab.sort(key=lambda x: (x[1], x[0]), reverse=True)\n ans = 0\n for i in range(n):\n if m >= ab[i][0]:\n ans += ab[i][1]\n m -= 1\n print(ans)\n return\n\n\ndef E():\n return\n\n\ndef F():\n return\n\n\nif __name__ == '__main__':\n D()\n", "code2": "\nfrom collections import defaultdict,deque\nfrom heapq import heappush, heappop\nfrom bisect import *\nimport sys, random, itertools, math\nsys.setrecursionlimit(10**5)\ninput = sys.stdin.readline\nsqrt = math.sqrt\ndef LI(): return list(map(int, input().split()))\ndef LF(): return list(map(float, input().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, input().split()))\ndef II(): return int(input())\ndef IF(): return float(input())\ndef LS(): return list(map(list, input().split()))\ndef S(): return list(input().rstrip())\ndef IR(n): return [II() for _ in range(n)]\ndef LIR(n): return [LI() for _ in range(n)]\ndef FR(n): return [IF() for _ in range(n)]\ndef LFR(n): return [LI() for _ in range(n)]\ndef LIR_(n): return [LI_() for _ in range(n)]\ndef SR(n): return [S() for _ in range(n)]\ndef LSR(n): return [LS() for _ in range(n)]\nmod = 1000000007\ninf = float('INF')\n\n\ndef A():\n a, b = LI()\n print(max(a + b, a - b, a * b))\n return\n\n\ndef B():\n k, x = LI()\n ans = []\n for i in range(x - k + 1, x + k):\n ans.append(i)\n print(*ans)\n return\n\n\ndef C():\n n = II()\n d = defaultdict(int)\n for _ in range(n):\n s = S()\n s.sort()\n d[tuple(s)] += 1\n ans = 0\n for i in d.values():\n ans += i * (i - 1) \n print(ans)\n return\n\n\n\n\n\ndef D():\n n, m = LI()\n q = []\n d = defaultdict(list)\n ans = 0\n for _ in range(n):\n a, b = LI()\n d[a].append(b)\n for i in range(m):\n for di in d[i+1]:\n heappush(q, -di)\n if q:\n ans -= heappop(q)\n print(ans)\n return\n\n\ndef E():\n return\n\n\ndef F():\n return\n\n\nif __name__ == '__main__':\n D()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1569523896", "date2": "1569524925", "bleu_score": "0.9196496586209593", "code1_test_status": [1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 98, "total_score": 102, "input": "3 5\n4 3\n4 1\n2 2\n", "actual_output": "5\n", "expected_output": "6\n\n", "anno_code": ["\nfrom collections import defaultdict,deque\nfrom heapq import heappush, heappop\nfrom bisect import *\nimport sys, random, itertools, math\nsys.setrecursionlimit(10**5) # (0): NO CHANGE\ninput = sys.stdin.readline # (1): input=\nsqrt = math.sqrt # (2): sqrt=, LI=, LF=, LI_=, II=, IF=, LS=, S=, IR=, LIR=, FR=, LFR=, LIR_=, SR=, LSR=\ndef LI(): return list(map(int, input().split()))\ndef LF(): return list(map(float, input().split()))\ndef LI_(): return list(map(lambda x: int(x)-1, input().split()))\ndef II(): return int(input())\ndef IF(): return float(input())\ndef LS(): return list(map(list, input().split()))\ndef S(): return list(input().rstrip())\ndef IR(n): return [II() for _ in range(n)]\ndef LIR(n): return [LI() for _ in range(n)]\ndef FR(n): return [IF() for _ in range(n)]\ndef LFR(n): return [LI() for _ in range(n)]\ndef LIR_(n): return [LI_() for _ in range(n)]\ndef SR(n): return [S() for _ in range(n)]\ndef LSR(n): return [LS() for _ in range(n)]\nmod = 1000000007 # (3): mod=1000000007\ninf = float('INF') # (4): inf=inf\n\n\ndef A(): # (5): A=\n a, b = LI()\n print(max(a + b, a - b, a * b))\n return\n\n\ndef B(): # (6): B=\n k, x = LI()\n ans = []\n for i in range(x - k + 1, x + k):\n ans.append(i)\n print(*ans)\n return\n\n\ndef C(): # (7): C=\n n = II()\n d = defaultdict(int)\n for _ in range(n):\n s = S()\n s.sort()\n d[tuple(s)] += 1\n ans = 0\n for i in d.values():\n ans += i * (i - 1) \n print(ans)\n return\n\n\ndef D(): # (8): D=\n n, m = LI()\n ab = LIR(n)\n ab.sort(key=lambda x: (x[1], x[0]), reverse=True)\n ans = 0\n for i in range(n):\n if m >= ab[i][0]:\n ans += ab[i][1]\n m -= 1\n print(ans)\n return\n\n\ndef E(): # (9): E=\n return\n\n\ndef F(): # (10): F=\n return\n\n\nif __name__ == '__main__':\n D()\n"], "anno_status": [false], "diff_content": " \n from collections import defaultdict,deque\n from heapq import heappush, heappop\n from bisect import *\n import sys, random, itertools, math\n sys.setrecursionlimit(10**5)\n input = sys.stdin.readline\n sqrt = math.sqrt\n def LI(): return list(map(int, input().split()))\n def LF(): return list(map(float, input().split()))\n def LI_(): return list(map(lambda x: int(x)-1, input().split()))\n def II(): return int(input())\n def IF(): return float(input())\n def LS(): return list(map(list, input().split()))\n def S(): return list(input().rstrip())\n def IR(n): return [II() for _ in range(n)]\n def LIR(n): return [LI() for _ in range(n)]\n def FR(n): return [IF() for _ in range(n)]\n def LFR(n): return [LI() for _ in range(n)]\n def LIR_(n): return [LI_() for _ in range(n)]\n def SR(n): return [S() for _ in range(n)]\n def LSR(n): return [LS() for _ in range(n)]\n mod = 1000000007\n inf = float('INF')\n \n \n def A():\n a, b = LI()\n print(max(a + b, a - b, a * b))\n return\n \n \n def B():\n k, x = LI()\n ans = []\n for i in range(x - k + 1, x + k):\n ans.append(i)\n print(*ans)\n return\n \n \n def C():\n n = II()\n d = defaultdict(int)\n for _ in range(n):\n s = S()\n s.sort()\n d[tuple(s)] += 1\n ans = 0\n for i in d.values():\n ans += i * (i - 1) \n print(ans)\n return\n \n \n+\n+\n+\n def D():\n n, m = LI()\n- ab = LIR(n)\n- ab.sort(key=lambda x: (x[1], x[0]), reverse=True)\n+ q = []\n+ d = defaultdict(list)\n ans = 0\n- for i in range(n):\n- if m >= ab[i][0]:\n- ans += ab[i][1]\n- m -= 1\n+ for _ in range(n):\n+ a, b = LI()\n+ d[a].append(b)\n+ for i in range(m):\n+ for di in d[i+1]:\n+ heappush(q, -di)\n+ if q:\n+ ans -= heappop(q)\n print(ans)\n return\n \n \n def E():\n return\n \n \n def F():\n return\n \n \n if __name__ == '__main__':\n D()\n \n", "FL_content": "\n \n from collections import defaultdict,deque\n from heapq import heappush, heappop\n from bisect import *\n import sys, random, itertools, math\n sys.setrecursionlimit(10**5)\n input = sys.stdin.readline\n sqrt = math.sqrt\n def LI(): return list(map(int, input().split()))\n def LF(): return list(map(float, input().split()))\n def LI_(): return list(map(lambda x: int(x)-1, input().split()))\n def II(): return int(input())\n def IF(): return float(input())\n def LS(): return list(map(list, input().split()))\n def S(): return list(input().rstrip())\n def IR(n): return [II() for _ in range(n)]\n def LIR(n): return [LI() for _ in range(n)]\n def FR(n): return [IF() for _ in range(n)]\n def LFR(n): return [LI() for _ in range(n)]\n def LIR_(n): return [LI_() for _ in range(n)]\n def SR(n): return [S() for _ in range(n)]\n def LSR(n): return [LS() for _ in range(n)]\n mod = 1000000007\n inf = float('INF')\n \n \n def A():\n a, b = LI()\n- print(max(a + b, a - b, a * b))\n return\n \n \n def B():\n k, x = LI()\n ans = []\n for i in range(x - k + 1, x + k):\n ans.append(i)\n print(*ans)\n return\n \n \n def C():\n n = II()\n d = defaultdict(int)\n for _ in range(n):\n s = S()\n s.sort()\n d[tuple(s)] += 1\n ans = 0\n for i in d.values():\n ans += i * (i - 1) \n print(ans)\n return\n \n \n def D():\n n, m = LI()\n ab = LIR(n)\n ab.sort(key=lambda x: (x[1], x[0]), reverse=True)\n ans = 0\n for i in range(n):\n if m >= ab[i][0]:\n ans += ab[i][1]\n m -= 1\n print(ans)\n return\n \n \n def E():\n return\n \n \n def F():\n return\n \n \n if __name__ == '__main__':\n D()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 79 }, { "user_id": "u392319141", "problem_id": "p03880", "submission1_id": "s291889977-FL", "submission2_id": "s714782629", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = [int(input()) for _ in range(N)]\n\nA.sort(reverse=True, key=lambda a: (a & -a))\n\nxor = 0\nfor a in A:\n xor ^= a\n\nleft = 0\nans = 0\n\nfor digit in range(1, xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n while left < N and (A[left] & -A[left]).bit_length() > digit:\n left += 1\n\n if left >= N or (A[left] & -A[left]).bit_length() != digit:\n print(-1)\n exit()\n\n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n\nif xor:\n for a in A:\n if a % 2 == 1:\n ans += 1\n break\n else:\n print(-1)\n exit()\n\nprint(ans)", "code2": "N = int(input())\nA = [int(input()) for _ in range(N)]\n\nA.sort(reverse=True, key=lambda a: (a & -a))\n\nxor = 0\nfor a in A:\n xor ^= a\n\nleft = 0\nans = 0\n\nfor digit in range(xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n while left < N and ((A[left] & -A[left]).bit_length() - 1) > digit:\n left += 1\n\n if left >= N or ((A[left] & -A[left]).bit_length() - 1) != digit:\n print(-1)\n exit()\n\n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1570894790", "date2": "1570896477", "bleu_score": "0.7731831643381074", "code1_test_status": [1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 72, "total_score": 89, "input": "3\n001\n110\n100\n", "actual_output": "3\n", "expected_output": "-1\n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = [int(input()) for _ in range(N)] # (1): A=[1, 110, 100]\n\nA.sort(reverse=True, key=lambda a: (a & -a)) # (2): A=[100, 110, 1]\n\nxor = 0 # (3): xor=0\nfor a in A: # (4): a=100 (6): a=110 ... (10): NO CHANGE\n xor ^= a # (5): xor=100 (7): xor=10 (9): xor=11\n\nleft = 0 # (11): left=0\nans = 0 # (12): ans=0\n\nfor digit in range(1, xor.bit_length() + 1)[:: -1]: # (13): digit=4 (15): digit=3 ... (37): NO CHANGE\n if (xor & (1 << digit)) > 0: # (14): NO CHANGE (16): NO CHANGE ... (30): NO CHANGE\n while left < N and (A[left] & -A[left]).bit_length() > digit: # (17): NO CHANGE (23): NO CHANGE ... (33): NO CHANGE\n left += 1 # (24): left=1 (32): left=2\n\n if left >= N or (A[left] & -A[left]).bit_length() != digit: # (18): NO CHANGE (26): NO CHANGE (34): NO CHANGE\n print(-1)\n exit()\n\n ans += 1 # (19): ans=1 (27): ans=2 (35): ans=3\n xor ^= ((1 << (digit + 1)) - 1) # (20): xor=4 (28): xor=3 (36): xor=0\n\nif xor: # (38): NO CHANGE\n for a in A:\n if a % 2 == 1:\n ans += 1\n break\n else:\n print(-1)\n exit()\n\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n A = [int(input()) for _ in range(N)]\n \n A.sort(reverse=True, key=lambda a: (a & -a))\n \n xor = 0\n for a in A:\n xor ^= a\n \n left = 0\n ans = 0\n \n-for digit in range(1, xor.bit_length() + 1)[:: -1]:\n+for digit in range(xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n- while left < N and (A[left] & -A[left]).bit_length() > digit:\n+ while left < N and ((A[left] & -A[left]).bit_length() - 1) > digit:\n left += 1\n \n- if left >= N or (A[left] & -A[left]).bit_length() != digit:\n+ if left >= N or ((A[left] & -A[left]).bit_length() - 1) != digit:\n print(-1)\n exit()\n \n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n \n-if xor:\n- for a in A:\n- if a % 2 == 1:\n- ans += 1\n- break\n- else:\n- print(-1)\n- exit()\n-\n print(ans)\n", "FL_content": "\n N = int(input())\n A = [int(input()) for _ in range(N)]\n \n A.sort(reverse=True, key=lambda a: (a & -a))\n \n xor = 0\n for a in A:\n xor ^= a\n \n left = 0\n ans = 0\n \n for digit in range(1, xor.bit_length() + 1)[:: -1]:\n if (xor & (1 << digit)) > 0:\n while left < N and (A[left] & -A[left]).bit_length() > digit:\n left += 1\n \n if left >= N or (A[left] & -A[left]).bit_length() != digit:\n print(-1)\n exit()\n \n ans += 1\n xor ^= ((1 << (digit + 1)) - 1)\n \n if xor:\n for a in A:\n if a % 2 == 1:\n ans += 1\n break\n else:\n print(-1)\n exit()\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 34 }, { "user_id": "u785989355", "problem_id": "p03187", "submission1_id": "s414659188-FL", "submission2_id": "s466229163", "status1": "Wrong Answer", "status2": "Accepted", "code1": "L,N = list(map(int,input().split()))\nX=[]\nY=[]\nSX=[0]\nSY=[0]\nsx=0\nsy=0\nfor i in range(N):\n x=int(input())\n X.append(x)\n sx+=x\n SX.append(sx)\n Y.append(L-x)\n sy+=L-x\n SY.append(sy) \n\nmax_score=0 \nfor i in range(N):\n if i>N-i-1:\n max_score=max(2*(SX[i]-SX[2*i-N])+2*(SY[N]-SY[i+1])+Y[i],max_score)\n elif iN-i-1:\n max_score=max(2*(SX[i]-SX[2*i-N])+2*(SY[N]-SY[i+1])+Y[i],max_score)\n elif iN-i-1: # (34): NO CHANGE (41): NO CHANGE (47): NO CHANGE\n max_score=max(2*(SX[i]-SX[2*i-N])+2*(SY[N]-SY[i+1])+Y[i],max_score) # (48): NO CHANGE\n elif iN-i-1:\n max_score=max(2*(SX[i]-SX[2*i-N])+2*(SY[N]-SY[i+1])+Y[i],max_score)\n elif iN-i-1:\n max_score=max(2*(SX[i]-SX[2*i-N])+2*(SY[N]-SY[i+1])+Y[i],max_score)\n elif i\n\tif b==0:return a\n\treturn gcd(b,a%b)\na,b,c,d=map(int,input().split()) # (1): a=47, b=16, c=-1, d=5\nc-=a # (2): c=-48\nd-=b # (3): d=-11\ng=gcd(max(c,d),min(c,d)) # (4): g=-1\nj=int(c/g) # (5): j=48\nk=int(d/g) # (6): k=11\nprint((j+k-1)*g)"], "anno_status": [true], "diff_content": " def gcd(a,b):\n \tif b==0:return a\n \treturn gcd(b,a%b)\n a,b,c,d=map(int,input().split())\n-c-=a\n-d-=b\n+c=abs(c-a)\n+d=abs(d-b)\n g=gcd(max(c,d),min(c,d))\n j=int(c/g)\n k=int(d/g)\n print((j+k-1)*g)\n", "FL_content": "\n def gcd(a,b):\n \tif b==0:return a\n \treturn gcd(b,a%b)\n a,b,c,d=map(int,input().split())\n c-=a\n d-=b\n g=gcd(max(c,d),min(c,d))\n j=int(c/g)\n k=int(d/g)\n-print((j+k-1)*g)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u549579601", "problem_id": "p03523", "submission1_id": "s709175893-FL", "submission2_id": "s759919964", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = 'AKIHABARA'\n\nimport itertools\n\nA = []\nfor i in range(1, len(list(s))+1):\n B = itertools.combinations(s, i)\n for j in B:\n A.append(\"\".join(j))\nif input() in A:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "s = 'AKIHABARA'\n\nimport itertools\n\nA = []\nfor i in range(1, len(list(s))+1):\n B = itertools.combinations(s, i)\n for j in B:\n string = \"\".join(j)\n if 'K' in string and 'I' in string and 'H' in string and 'B' in string and 'R' in string:\n A.append(string)\nif input() in A:\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586487036", "date2": "1586487212", "bleu_score": "0.6024347804804293", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "AAJIAHBA@RA\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["s = 'AKIHABARA' # (0): s=AKIHABARA, itertools=\n\nimport itertools\n\nA = [] # (1): A=[]\nfor i in range(1, len(list(s))+1): # (2): i=1 (23): i=2 ... (1051): NO CHANGE\n B = itertools.combinations(s, i) # (3): B= (24): B= ... (1047): B=\n for j in B: # (4): j=('A',) (6): j=('K',) ... (1050): NO CHANGE\n A.append(\"\".join(j)) # (5): A=['A'] (7): A=['A', 'K'] ... (1049): A=[A, K, ..., KIHABARA, AKIHABARA]\nif input() in A: # (1052): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " s = 'AKIHABARA'\n \n import itertools\n \n A = []\n for i in range(1, len(list(s))+1):\n B = itertools.combinations(s, i)\n for j in B:\n- A.append(\"\".join(j))\n+ string = \"\".join(j)\n+ if 'K' in string and 'I' in string and 'H' in string and 'B' in string and 'R' in string:\n+ A.append(string)\n if input() in A:\n- print(\"Yes\")\n+ print(\"YES\")\n else:\n- print(\"No\")\n+ print(\"NO\")\n", "FL_content": "\n-s = 'AKIHABARA'\n \n import itertools\n \n A = []\n for i in range(1, len(list(s))+1):\n B = itertools.combinations(s, i)\n for j in B:\n A.append(\"\".join(j))\n if input() in A:\n- print(\"Yes\")\n else:\n- print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u762540523", "problem_id": "p02555", "submission1_id": "s511654012-FL", "submission2_id": "s299370028", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def resolve():\n mod = 10 ** 9 + 7\n s = int(input())\n dp = [0] * (s + 1)\n dp[s] = 1\n for i in range(s, 2, -1):\n dp[i] %= mod\n for j in range(3, 10):\n if i - j >= 0:\n dp[i - j] += dp[i]\n print(dp[0] % mod)\n\n\nif __name__ == '__main__':\n resolve()\n", "code2": "def resolve():\n mod = 10 ** 9 + 7\n s = int(input())\n dp = [0] * (s + 1)\n dp[s] = 1\n for i in range(s, 2, -1):\n dp[i] %= mod\n for j in range(3, i + 1):\n dp[i - j] += dp[i]\n print(dp[0] % mod)\n\n\nif __name__ == '__main__':\n resolve()\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600030815", "date2": "1600030942", "bleu_score": "0.8890139612402265", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "1175\n", "actual_output": "778758794\n", "expected_output": "531468532\n\n", "anno_code": ["def resolve(): # (0): resolve=\n mod = 10 ** 9 + 7\n s = int(input())\n dp = [0] * (s + 1)\n dp[s] = 1\n for i in range(s, 2, -1):\n dp[i] %= mod\n for j in range(3, 10):\n if i - j >= 0:\n dp[i - j] += dp[i]\n print(dp[0] % mod)\n\n\nif __name__ == '__main__':\n resolve()\n"], "anno_status": [true], "diff_content": " def resolve():\n mod = 10 ** 9 + 7\n s = int(input())\n dp = [0] * (s + 1)\n dp[s] = 1\n for i in range(s, 2, -1):\n dp[i] %= mod\n- for j in range(3, 10):\n- if i - j >= 0:\n- dp[i - j] += dp[i]\n+ for j in range(3, i + 1):\n+ dp[i - j] += dp[i]\n print(dp[0] % mod)\n \n \n if __name__ == '__main__':\n resolve()\n \n", "FL_content": "\n def resolve():\n mod = 10 ** 9 + 7\n s = int(input())\n dp = [0] * (s + 1)\n dp[s] = 1\n for i in range(s, 2, -1):\n dp[i] %= mod\n- for j in range(3, 10):\n if i - j >= 0:\n dp[i - j] += dp[i]\n print(dp[0] % mod)\n \n \n if __name__ == '__main__':\n resolve()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u281808376", "problem_id": "p02396", "submission1_id": "s397101708-FL", "submission2_id": "s260299501", "status1": "Wrong Answer", "status2": "Accepted", "code1": "i=1\nwhile True:\n if int(input())==0:\n break\n print(\"Case\"+\" \"+str(i)+\":\"+\" \"+input())\n i+=1\n \n", "code2": "i=1\nwhile True:\n x=int(input())\n if x==0:\n break\n print(\"Case {}: {}\".format(i,x))\n i+=1\n \n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1540285940", "date2": "1540286970", "bleu_score": "0.7006795677441049", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3\n5\n11\n14\n26\n34\n0\n", "actual_output": "Case 1: 5\nCase 2: 14\nCase 3: 34\n", "expected_output": "Case 1: 3\nCase 2: 5\nCase 3: 11\nCase 4: 14\nCase 5: 26\nCase 6: 34\n\n", "anno_code": ["i=1 # (0): i=1\nwhile True: # (1): NO CHANGE (5): NO CHANGE ... (13): NO CHANGE\n if int(input())==0: # (2): NO CHANGE (6): NO CHANGE ... (14): NO CHANGE\n break\n print(\"Case\"+\" \"+str(i)+\":\"+\" \"+input()) # (3): NO CHANGE (7): NO CHANGE (11): NO CHANGE\n i+=1 # (4): i=2 (8): i=3 (12): i=4\n \n"], "anno_status": [true], "diff_content": " i=1\n while True:\n- if int(input())==0:\n- break\n- print(\"Case\"+\" \"+str(i)+\":\"+\" \"+input())\n- i+=1\n+ x=int(input())\n+ if x==0:\n+ break\n+ print(\"Case {}: {}\".format(i,x))\n+ i+=1\n \n \n", "FL_content": "\n i=1\n while True:\n if int(input())==0:\n break\n- print(\"Case\"+\" \"+str(i)+\":\"+\" \"+input())\n i+=1\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u187516587", "problem_id": "p02929", "submission1_id": "s554722719-FL", "submission2_id": "s975599160", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nS=input()\nl=0\na=1\nfor i in range(2*N):\n if S[i]==\"W\":\n if l%2==0:\n a=a*l%(10**9+7)\n l-=1\n else:\n l+=1\n else:\n if l%2==0:\n l+=1\n else:\n a=a*l%(10**9+7)\n l-=1\nif l!=1:\n a=0\nfor i in range(1,N+1):\n a=a*i%(10**9+7)\nprint(a)", "code2": "N=int(input())\nS=input()\nl=0\na=1\nfor i in range(2*N):\n if S[i]==\"W\":\n if l%2==0:\n a=a*l%(10**9+7)\n l-=1\n else:\n l+=1\n else:\n if l%2==0:\n l+=1\n else:\n a=a*l%(10**9+7)\n l-=1\nif l!=0:\n a=0\nfor i in range(1,N+1):\n a=a*i%(10**9+7)\nprint(a)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1566700375", "date2": "1566700443", "bleu_score": "0.9925979086008202", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1], "code1_test_score": 100, "total_score": 103, "input": "4\nBWWWBBWB\n", "actual_output": "0\n", "expected_output": "288\n\n", "anno_code": ["N=int(input()) # (0): N=4\nS=input() # (1): S=BWWWBBWB\nl=0 # (2): l=0\na=1 # (3): a=1\nfor i in range(2*N): # (4): i=0 (8): i=1 ... (40): NO CHANGE\n if S[i]==\"W\": # (5): NO CHANGE (9): NO CHANGE ... (36): NO CHANGE\n if l%2==0: # (10): NO CHANGE (14): NO CHANGE ... (32): NO CHANGE\n a=a*l%(10**9+7) # (15): a=2 (33): a=12\n l-=1 # (16): l=1 (34): l=1\n else:\n l+=1 # (11): l=2 (20): l=2\n else:\n if l%2==0: # (6): NO CHANGE (23): NO CHANGE ... (37): NO CHANGE\n l+=1 # (7): l=1 (24): l=3\n else:\n a=a*l%(10**9+7) # (28): a=6 (38): NO CHANGE\n l-=1 # (29): l=2 (39): l=0\nif l!=1: # (41): NO CHANGE\n a=0 # (42): a=0\nfor i in range(1,N+1): # (43): i=1 (45): i=2 ... (51): NO CHANGE\n a=a*i%(10**9+7) # (44): NO CHANGE (46): NO CHANGE ... (50): NO CHANGE\nprint(a)"], "anno_status": [true], "diff_content": " N=int(input())\n S=input()\n l=0\n a=1\n for i in range(2*N):\n if S[i]==\"W\":\n if l%2==0:\n a=a*l%(10**9+7)\n l-=1\n else:\n l+=1\n else:\n if l%2==0:\n l+=1\n else:\n a=a*l%(10**9+7)\n l-=1\n-if l!=1:\n+if l!=0:\n a=0\n for i in range(1,N+1):\n a=a*i%(10**9+7)\n print(a)\n", "FL_content": "\n N=int(input())\n S=input()\n l=0\n a=1\n for i in range(2*N):\n if S[i]==\"W\":\n if l%2==0:\n a=a*l%(10**9+7)\n l-=1\n else:\n l+=1\n else:\n if l%2==0:\n l+=1\n else:\n a=a*l%(10**9+7)\n l-=1\n if l!=1:\n a=0\n for i in range(1,N+1):\n a=a*i%(10**9+7)\n print(a)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u604437890", "problem_id": "p02419", "submission1_id": "s050006109-FL", "submission2_id": "s132495260", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import fileinput\nW = input()\ncnt = 0\nfor line in fileinput.input():\n if line.rstrip() == 'END_OF_TEXT':\n break\n line = ''.join(line.lower().split())\n print(line)\n cnt += line.count(W)\nprint(cnt)\n", "code2": "import fileinput\nW = input()\ncnt = 0\nfor T in fileinput.input():\n if T.rstrip() =='END_OF_TEXT':\n break\n\n T = T.lower().split()\n cnt += T.count(W)\n \nprint(cnt)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526967116", "date2": "1527026283", "bleu_score": "0.7368735300285362", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "comquter\nserutruN computer scitntisfs aod highlx-skilled computer engineers\nwho lliw create and tiolpxe \"knowledge\" for the enw era.\nProvides an sutotanding ctmpuoer environment.\nEND_OF_TEXT\n", "actual_output": "serutruncomputerscitntisfsaodhighlx-skilledcomputerengineers\nwholliwcreateandtiolpxe\"knowledge\"fortheenwera.\nprovidesansutotandingctmpuoerenvironment.\n0\n", "expected_output": "0\n\n", "anno_code": ["import fileinput\nW = input() # (0): W=comquter\ncnt = 0 # (1): cnt=0\nfor line in fileinput.input(): # (2): line=import fileinput (7): line=W = input() ... (72): line=END_OF_TEXT \n if line.rstrip() == 'END_OF_TEXT': # (3): NO CHANGE (8): NO CHANGE ... (73): NO CHANGE\n break # (74): NO CHANGE\n line = ''.join(line.lower().split()) # (4): line=importfileinput (9): line=w=input() ... (69): line=providesansutotandingctmpuoerenvironment.\n print(line) # (5): NO CHANGE (10): NO CHANGE ... (70): NO CHANGE\n cnt += line.count(W) # (6): NO CHANGE (11): NO CHANGE ... (71): NO CHANGE\nprint(cnt)\n"], "anno_status": [true], "diff_content": " import fileinput\n W = input()\n cnt = 0\n-for line in fileinput.input():\n- if line.rstrip() == 'END_OF_TEXT':\n+for T in fileinput.input():\n+ if T.rstrip() =='END_OF_TEXT':\n break\n- line = ''.join(line.lower().split())\n- print(line)\n- cnt += line.count(W)\n+\n+ T = T.lower().split()\n+ cnt += T.count(W)\n+ \n print(cnt)\n \n+\n", "FL_content": "\n import fileinput\n W = input()\n cnt = 0\n for line in fileinput.input():\n if line.rstrip() == 'END_OF_TEXT':\n break\n line = ''.join(line.lower().split())\n- print(line)\n cnt += line.count(W)\n print(cnt)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u246217175", "problem_id": "p03363", "submission1_id": "s560136412-FL", "submission2_id": "s667082587", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter\nimport math\nn = int(input())\na = list(map(int,input().split()))\n \ns = []\n\ntem = 0\ns.append(tem)\nfor i in range(n):\n tem += a[i]\n s.append(tem)\n \nb = Counter(s)\nc = b.values()\n\nans = 0\nfor i in c:\n if i != 1:\n ans += math.factorial(i-1)\n \nprint(ans)", "code2": "from collections import Counter\nimport math\nn = int(input())\na = list(map(int,input().split()))\n \ns = []\n\ntem = 0\ns.append(tem)\nfor i in range(n):\n tem += a[i]\n s.append(tem)\n \nb = Counter(s)\nc = b.values()\n\nans = 0\nfor i in c:\n ans += (i*(i-1)\n \nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587767028", "date2": "1587767271", "bleu_score": "0.8830823005676833", "code1_test_status": [0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 51, "total_score": 103, "input": "7\n0 -2 2 -11 0 0 0\n", "actual_output": "8\n", "expected_output": "9\n\n", "anno_code": ["from collections import Counter\nimport math\nn = int(input()) # (0): n=7\na = list(map(int,input().split())) # (1): a=[0, -2, 2, -11, 0, 0, 0]\n \ns = [] # (2): s=[]\n\ntem = 0 # (3): tem=0\ns.append(tem) # (4): s=[0]\nfor i in range(n): # (5): i=0 (8): i=1 ... (26): NO CHANGE\n tem += a[i] # (6): NO CHANGE (9): tem=-2 ... (24): NO CHANGE\n s.append(tem) # (7): s=[0, 0] (10): s=[0, 0, -2] ... (25): s=[0, 0, -2, 0, -11, -11, -11, -11]\n \nb = Counter(s) # (27): b=Counter({-11: 4, 0: 3, -2: 1})\nc = b.values() # (28): c=dict_values([3, 1, 4])\n\nans = 0 # (29): ans=0\nfor i in c: # (30): i=3 (33): i=1 ... (38): NO CHANGE\n if i != 1: # (31): NO CHANGE (34): NO CHANGE (36): NO CHANGE\n ans += math.factorial(i-1) # (32): ans=2 (37): ans=8\n \nprint(ans)"], "anno_status": [true], "diff_content": " from collections import Counter\n import math\n n = int(input())\n a = list(map(int,input().split()))\n \n s = []\n \n tem = 0\n s.append(tem)\n for i in range(n):\n tem += a[i]\n s.append(tem)\n \n b = Counter(s)\n c = b.values()\n \n ans = 0\n for i in c:\n- if i != 1:\n- ans += math.factorial(i-1)\n+ ans += (i*(i-1)\n \n print(ans)\n", "FL_content": "\n from collections import Counter\n import math\n n = int(input())\n a = list(map(int,input().split()))\n \n s = []\n \n tem = 0\n s.append(tem)\n for i in range(n):\n tem += a[i]\n s.append(tem)\n \n b = Counter(s)\n c = b.values()\n \n ans = 0\n for i in c:\n- if i != 1:\n- ans += math.factorial(i-1)\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u873190923", "problem_id": "p02697", "submission1_id": "s336896653-FL", "submission2_id": "s756388796", "status1": "Wrong Answer", "status2": "Accepted", "code1": "inf = 10**15\nmod = 10**9+7\nn,m = map(int, input().split())\nif n % 2 == 0:\n tmp = n\n for i in range(m):\n print('{} {}'.format(tmp-i, tmp+1+i))\nelse:\n tmp = n\n for i in range(m):\n print('{} {}'.format(tmp-i, tmp+1+i))", "code2": "inf = 10**15\nmod = 10**9+7\nn,m = map(int, input().split())\ntmp = n\nfor i in range(m):\n if i % 2 == 0:\n print('{} {}'.format(tmp-i\n else:\n print('{} {}'.format(1+i", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1588472710", "date2": "1588473536", "bleu_score": "0.6809908908982464", "code1_test_status": [0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 6, "input": "24 11\n", "actual_output": "24 25\n23 26\n22 27\n21 28\n20 29\n19 30\n18 31\n17 32\n16 33\n15 34\n14 35\n", "expected_output": "1 12\n2 11\n3 10\n4 9\n5 8\n6 7\n13 23\n14 22\n15 21\n16 20\n17 19\n\n", "anno_code": ["inf = 10**15 # (0): inf=1000000000000000\nmod = 10**9+7 # (1): mod=1000000007\nn,m = map(int, input().split()) # (2): n=24, m=11\nif n % 2 == 0: # (3): NO CHANGE\n tmp = n # (4): tmp=24\n for i in range(m): # (5): i=0 (7): i=1 ... (25): i=10\n print('{} {}'.format(tmp-i, tmp+1+i)) # (6): NO CHANGE (8): NO CHANGE ... (26): NO CHANGE\nelse:\n tmp = n\n for i in range(m):\n print('{} {}'.format(tmp-i, tmp+1+i))"], "anno_status": [true], "diff_content": " inf = 10**15\n mod = 10**9+7\n n,m = map(int, input().split())\n-if n % 2 == 0:\n- tmp = n\n- for i in range(m):\n- print('{} {}'.format(tmp-i, tmp+1+i))\n-else:\n- tmp = n\n- for i in range(m):\n- print('{} {}'.format(tmp-i, tmp+1+i))\n+tmp = n\n+for i in range(m):\n+ if i % 2 == 0:\n+ print('{} {}'.format(tmp-i\n+ else:\n+ print('{} {}'.format(1+i\n", "FL_content": "\n inf = 10**15\n mod = 10**9+7\n n,m = map(int, input().split())\n if n % 2 == 0:\n tmp = n\n for i in range(m):\n print('{} {}'.format(tmp-i, tmp+1+i))\n else:\n tmp = n\n for i in range(m):\n print('{} {}'.format(tmp-i, tmp+1+i))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u846150137", "problem_id": "p03505", "submission1_id": "s524008672-FL", "submission2_id": "s572959561", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import ceil\nk,a,b=map(int,input().split())\nk-=a\nif k<=0:\n print(1)\nelif a>b:\n print(1+ceil(k/(a-b))*2)\nelse:\n print(-1)", "code2": "from math import ceil\nk,a,b=map(int,input().split())\nif k<=a:\n print(1)\nelif a>b:\n print(1+(k-b-1)\nelse:\n print(-1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1536755146", "date2": "1536755967", "bleu_score": "0.8237148912802666", "code1_test_status": [1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0], "code1_test_score": 21, "total_score": 103, "input": "1100110001111001010 2 0\n", "actual_output": "1100110001111000961\n", "expected_output": "1100110001111001009\n\n", "anno_code": ["from math import ceil\nk,a,b=map(int,input().split()) # (0): k=1100110001111001010, a=2, b=0\nk-=a # (1): k=1100110001111001008\nif k<=0: # (2): NO CHANGE\n print(1)\nelif a>b: # (3): NO CHANGE\n print(1+ceil(k/(a-b))*2)\nelse:\n print(-1)"], "anno_status": [true], "diff_content": " from math import ceil\n k,a,b=map(int,input().split())\n-k-=a\n-if k<=0:\n+if k<=a:\n print(1)\n elif a>b:\n- print(1+ceil(k/(a-b))*2)\n+ print(1+(k-b-1)\n else:\n print(-1)\n", "FL_content": "\n from math import ceil\n k,a,b=map(int,input().split())\n-k-=a\n-if k<=0:\n- print(1)\n-elif a>b:\n- print(1+ceil(k/(a-b))*2)\n-else:\n- print(-1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u845643816", "problem_id": "p02408", "submission1_id": "s440868245-FL", "submission2_id": "s764087573", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import itertools\nn = int(input())\nc = list(itertools.product(['S', 'H', 'C', 'D'], range(1,14)))\nfor _ in range(n):\n s, num = input().split()\n c.remove((s, int(num)))\nfor i in range(4*13 - n):\n print(*c, sep = '\\n')", "code2": "import itertools\nn = int(input())\nc = list(itertools.product(['S', 'H', 'C', 'D'], range(1,14)))\nfor _ in range(n):\n s, num = input().split()\n c.remove((s, int(num)))\nfor i in range(4*13 - n):\n print(c[i][0], c[i][1])", "original_language1": "Python3", "original_language2": "Python3", "date1": "1509201248", "date2": "1509201400", "bleu_score": "0.9297793665350373", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "47\nS 10\nS 11\nS 12\nS 13\nH 1\nH 3\nS 6\nS 7\nS 8\nS 9\nH 6\nH 7\nH 9\nH 10\nH 11\nH 4\nH 5\nS 2\nS 3\nS 1\nS 5\nH 12\nH 13\nC 1\nC 2\nD 1\nD 2\nD 3\nD 4\nD 5\nD 6\nD 7\nC 3\nC 4\nC 5\nC 6\nC 8\nC 12\nC 9\nC 10\nC 11\nC 13\nD 9\nD 10\nD 11\nD 12\nD 13\n", "actual_output": "('S', 4)\n('H', 2)\n('H', 8)\n('C', 7)\n('D', 8)\n('S', 4)\n('H', 2)\n('H', 8)\n('C', 7)\n('D', 8)\n('S', 4)\n('H', 2)\n('H', 8)\n('C', 7)\n('D', 8)\n('S', 4)\n('H', 2)\n('H', 8)\n('C', 7)\n('D', 8)\n('S', 4)\n('H', 2)\n('H', 8)\n('C', 7)\n('D', 8)\n", "expected_output": "S 4\nH 2\nH 8\nC 7\nD 8\n\n", "anno_code": ["import itertools\nn = int(input()) # (0): n=47\nc = list(itertools.product(['S', 'H', 'C', 'D'], range(1,14))) # (1): c=[('S', 1), ('S', 2), ..., ('D', 12), ('D', 13)]\nfor _ in range(n): # (2): _=0 (5): _=1 ... (143): NO CHANGE\n s, num = input().split() # (3): s=S, num=10 (6): num=11 ... (141): num=13\n c.remove((s, int(num))) # (4): c=[('S', 1), ('S', 2), ..., ('D', 12), ('D', 13)] (7): c=[('S', 1), ('S', 2), ..., ('D', 12), ('D', 13)] ... (142): c=[('S', 4), ('H', 2), ('H', 8), ('C', 7), ('D', 8)]\nfor i in range(4*13 - n): # (144): i=0 (146): i=1 ... (152): i=4\n print(*c, sep = '\\n') # (145): NO CHANGE (147): NO CHANGE ... (153): NO CHANGE\n"], "anno_status": [true], "diff_content": " import itertools\n n = int(input())\n c = list(itertools.product(['S', 'H', 'C', 'D'], range(1,14)))\n for _ in range(n):\n s, num = input().split()\n c.remove((s, int(num)))\n for i in range(4*13 - n):\n- print(*c, sep = '\\n')\n+ print(c[i][0], c[i][1])\n", "FL_content": "\n import itertools\n n = int(input())\n c = list(itertools.product(['S', 'H', 'C', 'D'], range(1,14)))\n for _ in range(n):\n s, num = input().split()\n c.remove((s, int(num)))\n-for i in range(4*13 - n):\n- print(*c, sep = '\\n')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u553070631", "problem_id": "p02933", "submission1_id": "s059056361-FL", "submission2_id": "s278554063", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=int(input())\ns=input()\n\nif a >=3200:\n print('red')\nelse:\n print(s)", "code2": "a=int(input())\ns=input()\n\nif a >=3200:\n print(s)\nelse:\n print('red')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569725821", "date2": "1569725892", "bleu_score": "0.9819093526942501", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 1, "total_score": 103, "input": "4049\nbcq\n", "actual_output": "red\n", "expected_output": "bcq\n\n", "anno_code": ["a=int(input()) # (0): a=4049\ns=input() # (1): s=bcq\n\nif a >=3200: # (2): NO CHANGE\n print('red')\nelse:\n print(s)"], "anno_status": [true], "diff_content": " a=int(input())\n s=input()\n \n if a >=3200:\n- print('red')\n-else:\n print(s)\n+else:\n+ print('red')\n+\n", "FL_content": "\n a=int(input())\n s=input()\n \n if a >=3200:\n- print('red')\n else:\n print(s)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u497046426", "problem_id": "p04039", "submission1_id": "s169913417-FL", "submission2_id": "s965720108", "status1": "Wrong Answer", "status2": "Accepted", "code1": "numbers = {str(i) for i in range(10)}\nN, K = map(int, input().split())\n*D, = map(str, input().split())\nD = set(D)\navailable = numbers - D\nans = 0\nfor i in range(N, 100000):\n nums = set(str(i))\n if nums < available:\n print(i)\n break", "code2": "numbers = {str(i) for i in range(10)}\nN, K = map(int, input().split())\n*D, = map(str, input().split())\nD = set(D)\navailable = numbers - D\nans = 0\nfor i in range(N, 100000):\n nums = set(str(i))\n if nums <= available:\n print(i)\n break", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560468690", "date2": "1560468777", "bleu_score": "0.9899895766450997", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 91, "total_score": 94, "input": "1001 8\n1 3 4 5 6 7 8 9\n", "actual_output": "2222\n", "expected_output": "2000\n\n", "anno_code": ["numbers = {str(i) for i in range(10)} # (0): numbers={'7', '6', '2', '8', '0', '5', '9', '3', '4', '1'}\nN, K = map(int, input().split()) # (1): N=1001, K=8\n*D, = map(str, input().split()) # (2): D=['1', '3', '4', '5', '6', '7', '8', '9']\nD = set(D) # (3): D={'7', '6', '8', '5', '9', '3', '4', '1'}\navailable = numbers - D # (4): available={'0', '2'}\nans = 0 # (5): ans=0\nfor i in range(N, 100000): # (6): i=1001 (9): i=1002 ... (3669): i=2222\n nums = set(str(i)) # (7): nums={'0', '1'} (10): nums={'0', '2', '1'} ... (3670): nums={'2'}\n if nums < available: # (8): NO CHANGE (11): NO CHANGE ... (3671): NO CHANGE\n print(i) # (3672): NO CHANGE\n break"], "anno_status": [true], "diff_content": " numbers = {str(i) for i in range(10)}\n N, K = map(int, input().split())\n *D, = map(str, input().split())\n D = set(D)\n available = numbers - D\n ans = 0\n for i in range(N, 100000):\n nums = set(str(i))\n- if nums < available:\n+ if nums <= available:\n print(i)\n break\n", "FL_content": "\n numbers = {str(i) for i in range(10)}\n N, K = map(int, input().split())\n *D, = map(str, input().split())\n D = set(D)\n available = numbers - D\n ans = 0\n-for i in range(N, 100000):\n nums = set(str(i))\n- if nums < available:\n print(i)\n break\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u452885705", "problem_id": "p02830", "submission1_id": "s535773074-FL", "submission2_id": "s006605683", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ns,t = map(list, input().split(\" \"))\na=[]\nprint(n,s,t)\nfor i in range(n):\n a.append(s[i])\n a.append(t[i])\nprint(''.join(a))", "code2": "n = int(input())\ns,t = map(list, input().split(\" \"))\na=[]\nfor i in range(n):\n a.append(s[i])\n a.append(t[i])\nprint(''.join(a))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577166236", "date2": "1577166301", "bleu_score": "0.9009354293464784", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "8\njmgnlhmm uvtuvutu\n", "actual_output": "8 ['j', 'm', 'g', 'n', 'l', 'h', 'm', 'm'] ['u', 'v', 't', 'u', 'v', 'u', 't', 'u']\njumvgtnulvhumtmu\n", "expected_output": "jumvgtnulvhumtmu\n\n", "anno_code": ["n = int(input()) # (0): n=8\ns,t = map(list, input().split(\" \")) # (1): s=['j', 'm', 'g', 'n', 'l', 'h', 'm', 'm'], t=['u', 'v', 't', 'u', 'v', 'u', 't', 'u']\na=[] # (2): a=[]\nprint(n,s,t) # (3): NO CHANGE\nfor i in range(n): # (4): i=0 (7): i=1 ... (28): NO CHANGE\n a.append(s[i]) # (5): a=['j'] (8): a=['j', 'u', 'm'] ... (26): a=['j', 'u', 'm', 'v', 'g', 't', 'n', 'u', 'l', 'v', 'h', 'u', 'm', 't', 'm']\n a.append(t[i]) # (6): a=['j', 'u'] (9): a=['j', 'u', 'm', 'v'] ... (27): a=['j', 'u', 'm', 'v', 'g', 't', 'n', 'u', 'l', 'v', 'h', 'u', 'm', 't', 'm', 'u']\nprint(''.join(a))"], "anno_status": [true], "diff_content": " n = int(input())\n s,t = map(list, input().split(\" \"))\n a=[]\n-print(n,s,t)\n for i in range(n):\n a.append(s[i])\n a.append(t[i])\n print(''.join(a))\n", "FL_content": "\n n = int(input())\n s,t = map(list, input().split(\" \"))\n a=[]\n-print(n,s,t)\n for i in range(n):\n a.append(s[i])\n a.append(t[i])\n print(''.join(a))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u033524082", "problem_id": "p03012", "submission1_id": "s311289913-FL", "submission2_id": "s787374097", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nl=list(map(int,input().split()))\ns=sum(l)\nm=[]\nfor i in range(1,n-1):\n m.append(abs(-sum(l[:i])*2))\nprint(min(m))", "code2": "n=int(input())\nl=list(map(int,input().split()))\ns=sum(l)\nm=[]\nfor i in range(n):\n m.append(abs(s-sum(l[:i+1])*2))\nprint(min(m))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565473573", "date2": "1565474310", "bleu_score": "0.9297405003874497", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 1, "total_score": 100, "input": "8\n1 5 22 0 1 1 106 3\n", "actual_output": "2\n", "expected_output": "79\n\n", "anno_code": ["n=int(input()) # (0): n=8\nl=list(map(int,input().split())) # (1): l=[1, 5, 22, 0, 1, 1, 106, 3]\ns=sum(l) # (2): s=139\nm=[] # (3): m=[]\nfor i in range(1,n-1): # (4): i=1 (6): i=2 ... (16): NO CHANGE\n m.append(abs(-sum(l[:i])*2)) # (5): m=[2] (7): m=[2, 12] ... (15): m=[2, 12, 56, 56, 58, 60]\nprint(min(m))"], "anno_status": [true], "diff_content": " n=int(input())\n l=list(map(int,input().split()))\n s=sum(l)\n m=[]\n-for i in range(1,n-1):\n- m.append(abs(-sum(l[:i])*2))\n+for i in range(n):\n+ m.append(abs(s-sum(l[:i+1])*2))\n print(min(m))\n", "FL_content": "\n n=int(input())\n l=list(map(int,input().split()))\n s=sum(l)\n m=[]\n-for i in range(1,n-1):\n- m.append(abs(-sum(l[:i])*2))\n print(min(m))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u382639013", "problem_id": "p02899", "submission1_id": "s107831354-FL", "submission2_id": "s328085258", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split()))\nL = [0]*N\nfor i in range(0, N):\n L[A[i]-1] = i + 1\n print(L,A[i])\nprint(*L)", "code2": "N = int(input())\nA = list(map(int, input().split()))\nL = [0]*N\nfor i in range(0, N):\n L[A[i]-1] = i + 1\nprint(*L)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590761342", "date2": "1590761364", "bleu_score": "0.850577732092957", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 11, "input": "5\n2 1 3 4 5\n", "actual_output": "[0, 1, 0, 0, 0] 2\n[2, 1, 0, 0, 0] 1\n[2, 1, 3, 0, 0] 3\n[2, 1, 3, 4, 0] 4\n[2, 1, 3, 4, 5] 5\n2 1 3 4 5\n", "expected_output": "2 1 3 4 5 \n\n", "anno_code": ["N = int(input()) # (0): N=5\nA = list(map(int, input().split())) # (1): A=[2, 1, 3, 4, 5]\nL = [0]*N # (2): L=[0, 0, 0, 0, 0]\nfor i in range(0, N): # (3): i=0 (6): i=1 ... (18): NO CHANGE\n L[A[i]-1] = i + 1 # (4): L=[0, 1, 0, 0, 0] (7): L=[2, 1, 0, 0, 0] ... (16): L=[2, 1, 3, 4, 5]\n print(L,A[i]) # (5): NO CHANGE (8): NO CHANGE ... (17): NO CHANGE\nprint(*L)"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int, input().split()))\n L = [0]*N\n for i in range(0, N):\n L[A[i]-1] = i + 1\n- print(L,A[i])\n print(*L)\n", "FL_content": "\n N = int(input())\n A = list(map(int, input().split()))\n L = [0]*N\n for i in range(0, N):\n L[A[i]-1] = i + 1\n- print(L,A[i])\n print(*L)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u394721319", "problem_id": "p03254", "submission1_id": "s020695961-FL", "submission2_id": "s138030969", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, x = map(int,input().split())\nli = list(map(int,input().split()))\n\nli.sort()\nans = 0\n\nfor i in range(n):\n x = x-li[i]\n if x < 0:\n ans = i\n break\n ans = i+1\nprint(ans)\n", "code2": "n, x = map(int,input().split())\nli = list(map(int,input().split()))\n\nli.sort()\nans = 0\n\nfor i in range(n):\n x = x-li[i]\n if x < 0:\n ans = i\n break\n ans = i+1\n\nif x > 0:\n ans -=1\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1544819665", "date2": "1544820748", "bleu_score": "0.8833353930433216", "code1_test_status": [0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0], "code1_test_score": 70, "total_score": 104, "input": "3 70\n4 24 5\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["n, x = map(int,input().split()) # (0): n=3, x=70\nli = list(map(int,input().split())) # (1): li=[4, 24, 5]\n\nli.sort() # (2): li=[4, 5, 24]\nans = 0 # (3): ans=0\n\nfor i in range(n): # (4): i=0 (8): i=1 ... (16): NO CHANGE\n x = x-li[i] # (5): x=66 (9): x=61 (13): x=37\n if x < 0: # (6): NO CHANGE (10): NO CHANGE (14): NO CHANGE\n ans = i\n break\n ans = i+1 # (7): ans=1 (11): ans=2 (15): ans=3\nprint(ans)\n"], "anno_status": [true], "diff_content": " n, x = map(int,input().split())\n li = list(map(int,input().split()))\n \n li.sort()\n ans = 0\n \n for i in range(n):\n- x = x-li[i]\n+ x = x-li[i]\n if x < 0:\n ans = i\n break\n ans = i+1\n+\n+if x > 0:\n+ ans -=1\n+\n print(ans)\n \n", "FL_content": "\n n, x = map(int,input().split())\n li = list(map(int,input().split()))\n \n li.sort()\n ans = 0\n \n for i in range(n):\n x = x-li[i]\n if x < 0:\n ans = i\n break\n- ans = i+1\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u882620594", "problem_id": "p03856", "submission1_id": "s972951566-FL", "submission2_id": "s625821798", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\n\nS = input()\nindex = len(S)\nwhile index >= 7:\n five = S[index-5:index]\n six = S[index-6:index]\n seven = S[index-7:index]\n if five == \"dream\" or five == \"erase\":\n index -= 5\n elif six == \"eraser\":\n index -= 6\n elif seven == \"dreamer\":\n index -= 7\n else:\n print(\"NO\")\n sys.exit()\n\nlast = S[:index]\n\n\n\n", "code2": "\nimport sys\n\nS = input()\nindex = len(S)\nwhile index > 7:\n five = S[index-5:index]\n six = S[index-6:index]\n seven = S[index-7:index]\n if five == \"dream\" or five == \"erase\":\n index -= 5\n elif six == \"eraser\":\n index -= 6\n elif seven == \"dreamer\":\n index -= 7\n else:\n print(\"NO\")\n sys.exit()\n\nlast = S[:index]\nif last == \"dream\" or last == \"erase\" or last == \"eraser\" or last == \"dreamer\":\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1562989404", "date2": "1562989521", "bleu_score": "0.7533501757523471", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "no output\n", "expected_output": "YES\n", "anno_code": ["\nimport sys\n\nS = input() # (0): S=erasedream\nindex = len(S) # (1): index=10\nwhile index >= 7: # (2): NO CHANGE (8): NO CHANGE\n five = S[index-5:index] # (3): five=dream\n six = S[index-6:index] # (4): six=edream\n seven = S[index-7:index] # (5): seven=sedream\n if five == \"dream\" or five == \"erase\": # (6): NO CHANGE\n index -= 5 # (7): index=5\n elif six == \"eraser\":\n index -= 6\n elif seven == \"dreamer\":\n index -= 7\n else:\n print(\"NO\")\n sys.exit()\n\nlast = S[:index]\n\n\n\n"], "anno_status": [true], "diff_content": " \n import sys\n \n S = input()\n index = len(S)\n-while index >= 7:\n+while index > 7:\n five = S[index-5:index]\n six = S[index-6:index]\n seven = S[index-7:index]\n if five == \"dream\" or five == \"erase\":\n index -= 5\n elif six == \"eraser\":\n index -= 6\n elif seven == \"dreamer\":\n index -= 7\n else:\n print(\"NO\")\n sys.exit()\n \n last = S[:index]\n-\n-\n-\n-\n+if last == \"dream\" or last == \"erase\" or last == \"eraser\" or last == \"dreamer\":\n+ print(\"YES\")\n+else:\n+ print(\"NO\")\n", "FL_content": "\n \n import sys\n \n S = input()\n index = len(S)\n-while index >= 7:\n five = S[index-5:index]\n six = S[index-6:index]\n seven = S[index-7:index]\n if five == \"dream\" or five == \"erase\":\n index -= 5\n elif six == \"eraser\":\n index -= 6\n elif seven == \"dreamer\":\n index -= 7\n else:\n print(\"NO\")\n sys.exit()\n \n last = S[:index]\n \n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u673173160", "problem_id": "p03433", "submission1_id": "s287707584-FL", "submission2_id": "s929272690", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = input()\ns = int(input())\nn1 = int(n[-2] + n[-1])\nif n1 <= s:\n print('Yes')\nelse:\n print('No')", "code2": "n = int(input())\ns = int(input())\nif n%500 <= s:\n print('Yes')\nelse:\n print('No')", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1576427169", "date2": "1576427268", "bleu_score": "0.7454472094374568", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "2763\n84\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["n = input() # (0): n=2763\ns = int(input()) # (1): s=84\nn1 = int(n[-2] + n[-1]) # (2): n1=63\nif n1 <= s: # (3): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": "-n = input()\n+n = int(input())\n s = int(input())\n-n1 = int(n[-2] + n[-1])\n-if n1 <= s:\n+if n%500 <= s:\n print('Yes')\n else:\n print('No')\n", "FL_content": "\n n = input()\n s = int(input())\n-n1 = int(n[-2] + n[-1])\n-if n1 <= s:\n print('Yes')\n else:\n print('No')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u703950586", "problem_id": "p03172", "submission1_id": "s039571537-FL", "submission2_id": "s976464471", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys,queue,math,copy,itertools,bisect,collections,heapq\nsys.setrecursionlimit(10**7)\nINF = 10**18\nMOD = 10**9 + 7\nLI = lambda : [int(x) for x in sys.stdin.readline().split()]\nNI = lambda : int(sys.stdin.readline())\n\nN,K = LI()\na = [0]+LI()\nif K == 0:\n print(1)\n exit(0)\ndp = [[1] * (K+1) for _ in range(N+1)]\nac = 0\nfor i in range(1,N+1):\n ac += a[i]\n s = 0\n for j in range(K+1):\n s += dp[i-1][j]\n if j-a[i]-1 >= 0: s -= dp[i-1][j-a[i]-1]\n dp[i][j] = s % MOD\nprint(dp[-1][K]-dp[-1][K-1])\n", "code2": "import sys,queue,math,copy,itertools,bisect,collections,heapq\nsys.setrecursionlimit(10**7)\nINF = 10**18\nMOD = 10**9 + 7\nLI = lambda : [int(x) for x in sys.stdin.readline().split()]\nNI = lambda : int(sys.stdin.readline())\n\nN,K = LI()\na = [0]+LI()\nif K == 0:\n print(1)\n exit(0)\ndp = [[1] * (K+1) for _ in range(N+1)]\nac = 0\nfor i in range(1,N+1):\n ac += a[i]\n s = 0\n for j in range(K+1):\n s += dp[i-1][j]\n if j-a[i]-1 >= 0: s -= dp[i-1][j-a[i]-1]\n dp[i][j] = s % MOD\nprint((dp[-1][K]-dp[-1][K-1])%MOD)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1588815657", "date2": "1588815820", "bleu_score": "0.9864279828136503", "code1_test_status": [1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1], "code1_test_score": 66, "total_score": 103, "input": "4 101001\n101000 100000 100100 101000\n", "actual_output": "-155911274\n", "expected_output": "844088733\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import sys,queue,math,copy,itertools,bisect,collections,heapq\n sys.setrecursionlimit(10**7)\n INF = 10**18\n MOD = 10**9 + 7\n LI = lambda : [int(x) for x in sys.stdin.readline().split()]\n NI = lambda : int(sys.stdin.readline())\n \n N,K = LI()\n a = [0]+LI()\n if K == 0:\n print(1)\n exit(0)\n dp = [[1] * (K+1) for _ in range(N+1)]\n ac = 0\n for i in range(1,N+1):\n ac += a[i]\n s = 0\n for j in range(K+1):\n s += dp[i-1][j]\n if j-a[i]-1 >= 0: s -= dp[i-1][j-a[i]-1]\n dp[i][j] = s % MOD\n-print(dp[-1][K]-dp[-1][K-1])\n+print((dp[-1][K]-dp[-1][K-1])%MOD)\n \n", "FL_content": "\n import sys,queue,math,copy,itertools,bisect,collections,heapq\n sys.setrecursionlimit(10**7)\n INF = 10**18\n MOD = 10**9 + 7\n LI = lambda : [int(x) for x in sys.stdin.readline().split()]\n NI = lambda : int(sys.stdin.readline())\n \n N,K = LI()\n a = [0]+LI()\n if K == 0:\n print(1)\n exit(0)\n dp = [[1] * (K+1) for _ in range(N+1)]\n ac = 0\n for i in range(1,N+1):\n ac += a[i]\n s = 0\n for j in range(K+1):\n s += dp[i-1][j]\n if j-a[i]-1 >= 0: s -= dp[i-1][j-a[i]-1]\n dp[i][j] = s % MOD\n-print(dp[-1][K]-dp[-1][K-1])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 23 }, { "user_id": "u712397093", "problem_id": "p02975", "submission1_id": "s637826951-FL", "submission2_id": "s259490528", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\na = list(map(int, input().split()))\n\nsum = 0\nfor i in range(N):\n sum ^= a[i]\n\n print('Yes' if sum == 0 else 'No')\n", "code2": "N = int(input())\na = list(map(int, input().split()))\n\nsum = 0\nfor i in range(N):\n sum ^= a[i]\n\nprint('Yes' if sum == 0 else 'No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563643904", "date2": "1563644069", "bleu_score": "0.9591964190670353", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 58, "input": "3\n-1 49 -1\n", "actual_output": "No\nNo\nNo\n", "expected_output": "No\n\n", "anno_code": ["N = int(input()) # (0): N=3\na = list(map(int, input().split())) # (1): a=[-1, 49, -1]\n\nsum = 0 # (2): sum=0\nfor i in range(N): # (3): i=0 (6): i=1 (9): i=2\n sum ^= a[i] # (4): sum=-1 (7): sum=-50 (10): sum=49\n\n print('Yes' if sum == 0 else 'No') # (5): NO CHANGE (8): NO CHANGE (11): NO CHANGE\n"], "anno_status": [true], "diff_content": " N = int(input())\n a = list(map(int, input().split()))\n \n sum = 0\n for i in range(N):\n sum ^= a[i]\n \n- print('Yes' if sum == 0 else 'No')\n+print('Yes' if sum == 0 else 'No')\n \n", "FL_content": "\n N = int(input())\n a = list(map(int, input().split()))\n \n sum = 0\n for i in range(N):\n sum ^= a[i]\n \n- print('Yes' if sum == 0 else 'No')\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u067972379", "problem_id": "p02369", "submission1_id": "s431214808-FL", "submission2_id": "s648181220", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque, defaultdict\n\ndef topological_sort(V, E):\n \n indeg = {v: 0 for v in V}\n for ends in E.values():\n for v in ends:\n indeg[v] += 1\n \n q = deque([v for v in V if indeg[v] == 0])\n top_sorted = []\n while q:\n v = q.popleft()\n top_sorted.append(v)\n \n for u in E[v]:\n indeg[u] -= 1\n if indeg[u] == 0:\n q.append(u)\n if len(top_sorted) == len(V): \n return top_sorted\n else: \n return None\n\nN, M = map(int, input().split())\nV = range(N)\nE = defaultdict(list)\nfor _ in range(M):\n s, t = map(int, input().split())\n E[s].append(t)\nprint(0 if topological_sort(V, E) is None else 1)\n", "code2": "from collections import deque, defaultdict\n\ndef topological_sort(V, E):\n \n indeg = {v: 0 for v in V}\n for ends in E.values():\n for v in ends:\n indeg[v] += 1\n \n q = deque([v for v in V if indeg[v] == 0])\n top_sorted = []\n while q:\n v = q.popleft()\n top_sorted.append(v)\n \n for u in E[v]:\n indeg[u] -= 1\n if indeg[u] == 0:\n q.append(u)\n if len(top_sorted) == len(V): \n return top_sorted\n else: \n return None\n\nN, M = map(int, input().split())\nV = range(N)\nE = defaultdict(list)\nfor _ in range(M):\n s, t = map(int, input().split())\n E[s].append(t)\nprint(1 if topological_sort(V, E) is None else 0)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1559212961", "date2": "1559213007", "bleu_score": "0.9941051901452527", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "8 2\n0 2\n0 2\n0 4\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["from collections import deque, defaultdict\n\ndef topological_sort(V, E): # (0): topological_sort=\n \n indeg = {v: 0 for v in V} # (12): indeg={0: 0, 1: 0, 2: 0, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0}\n for ends in E.values(): # (13): ends=[2, 2] (19): NO CHANGE\n for v in ends: # (14): v=2 (16): NO CHANGE (18): NO CHANGE\n indeg[v] += 1 # (15): indeg={0: 0, 1: 0, 2: 1, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0} (17): indeg={0: 0, 1: 0, 2: 2, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0}\n \n q = deque([v for v in V if indeg[v] == 0]) # (20): q=deque([])\n top_sorted = [] # (21): top_sorted=[]\n while q: # (22): NO CHANGE (33): NO CHANGE ... (61): NO CHANGE\n v = q.popleft() # (23): v=0 (34): v=1 ... (58): v=2\n top_sorted.append(v) # (24): top_sorted=[0] (35): top_sorted=[0, 1] ... (59): top_sorted=[0, 1, 3, 4, 5, 6, 7, 2]\n \n for u in E[v]: # (25): u=2 (28): NO CHANGE ... (60): E=defaultdict(, {0: [2, 2], 1: [], 3: [], 4: [], 5: [], 6: [], 7: [], 2: []})\n indeg[u] -= 1 # (26): indeg={0: 0, 1: 0, 2: 1, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0} (29): indeg={0: 0, 1: 0, 2: 0, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0}\n if indeg[u] == 0: # (27): NO CHANGE (30): NO CHANGE\n q.append(u) # (31): NO CHANGE\n if len(top_sorted) == len(V): \n return top_sorted\n else: \n return None\n\nN, M = map(int, input().split()) # (1): N=8, M=2\nV = range(N) # (2): V=range(0, 8)\nE = defaultdict(list) # (3): E=defaultdict(, {})\nfor _ in range(M): # (4): _=0 (7): _=1 (10): NO CHANGE\n s, t = map(int, input().split()) # (5): s=0, t=2 (8): NO CHANGE\n E[s].append(t) # (6): E=defaultdict(, {0: [2]}) (9): E=defaultdict(, {0: [2, 2]})\nprint(0 if topological_sort(V, E) is None else 1) # (11): NO CHANGE\n"], "anno_status": [true], "diff_content": " from collections import deque, defaultdict\n \n def topological_sort(V, E):\n \n indeg = {v: 0 for v in V}\n for ends in E.values():\n for v in ends:\n indeg[v] += 1\n \n q = deque([v for v in V if indeg[v] == 0])\n top_sorted = []\n while q:\n v = q.popleft()\n top_sorted.append(v)\n \n for u in E[v]:\n indeg[u] -= 1\n if indeg[u] == 0:\n q.append(u)\n if len(top_sorted) == len(V): \n return top_sorted\n else: \n return None\n \n N, M = map(int, input().split())\n V = range(N)\n E = defaultdict(list)\n for _ in range(M):\n s, t = map(int, input().split())\n E[s].append(t)\n-print(0 if topological_sort(V, E) is None else 1)\n+print(1 if topological_sort(V, E) is None else 0)\n \n", "FL_content": "\n from collections import deque, defaultdict\n \n def topological_sort(V, E):\n \n indeg = {v: 0 for v in V}\n for ends in E.values():\n for v in ends:\n indeg[v] += 1\n \n q = deque([v for v in V if indeg[v] == 0])\n top_sorted = []\n while q:\n v = q.popleft()\n top_sorted.append(v)\n \n for u in E[v]:\n indeg[u] -= 1\n if indeg[u] == 0:\n q.append(u)\n- if len(top_sorted) == len(V): \n- return top_sorted\n- else: \n- return None\n \n N, M = map(int, input().split())\n V = range(N)\n E = defaultdict(list)\n for _ in range(M):\n s, t = map(int, input().split())\n E[s].append(t)\n print(0 if topological_sort(V, E) is None else 1)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 32 }, { "user_id": "u215065194", "problem_id": "p03712", "submission1_id": "s824404286-FL", "submission2_id": "s285875318", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h,w=map(int, input().split())\nprint(\"*\"*w+\"**\")\nfor i in range(0, h):\n print(\"*\"+input()+\"*\")\nprint(\"*\"*w+\"**\")\n ", "code2": "h,w=map(int, input().split())\nar=[input() for _ in range(0,h)]\nprint(\"\nfor _ in ar:\n print(\"\nprint(\"\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1533776866", "date2": "1533777223", "bleu_score": "0.6420921106679712", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "1 -1\n{\n", "actual_output": "**\n*{*\n**\n", "expected_output": "#\n#{#\n#\n\n", "anno_code": ["h,w=map(int, input().split()) # (0): h=1, w=-1\nprint(\"*\"*w+\"**\") # (1): NO CHANGE\nfor i in range(0, h): # (2): i=0 (4): NO CHANGE\n print(\"*\"+input()+\"*\") # (3): NO CHANGE\nprint(\"*\"*w+\"**\")\n "], "anno_status": [true], "diff_content": " h,w=map(int, input().split())\n-print(\"*\"*w+\"**\")\n-for i in range(0, h):\n- print(\"*\"+input()+\"*\")\n-print(\"*\"*w+\"**\")\n- \n+ar=[input() for _ in range(0,h)]\n+print(\"\n+for _ in ar:\n+ print(\"\n+print(\"\n+ \n", "FL_content": "\n h,w=map(int, input().split())\n-print(\"*\"*w+\"**\")\n for i in range(0, h):\n- print(\"*\"+input()+\"*\")\n-print(\"*\"*w+\"**\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u896240461", "problem_id": "p02318", "submission1_id": "s143843683-FL", "submission2_id": "s163334525", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s1 = input()\ns2 = input()\nx = [[0 for i in range(len(s2))]for j in range(len(s1))]\n\ndef g(i,j):\n if i == 0 or j == 0:\n if s1[i] == s2[j]:\n x[i][j] = abs(i-j)\n else:\n if i == 0:\n x[i][j] = x[i][j-1] + 1\n else:\n x[i][j] = x[i-1][j] + 1\n elif s1[i] == s2[j]:\n x[i][j] = x[i-1][j-1]\n else:\n x[i][j] = min(x[i][j-1] + 1,x[i-1][j] + 1)\n \n\nfor i in range(len(s1)):\n for j in range(len(s2)):\n g(i,j)\n\nprint(x[len(s1)-1][len(s2)-1])\n", "code2": "s1 = input()\ns2 = input()\nx = [[0 for i in range(len(s2))]for j in range(len(s1))]\n\ndef g(i,j):\n if i == 0 or j == 0:\n if s1[i] == s2[j]:\n x[i][j] = abs(i-j)\n else:\n if i == 0:\n x[i][j] = x[i][j-1] + 1\n else:\n x[i][j] = x[i-1][j] + 1\n elif s1[i] == s2[j]:\n x[i][j] = min(x[i-1][j-1],x[i][j-1]+1,x[i-1][j]+1)\n else:\n x[i][j] = min(x[i-1][j-1]+1,x[i][j-1]+1,x[i-1][j]+1)\n \n\nfor i in range(len(s1)):\n for j in range(len(s2)):\n g(i,j)\n\nprint(x[len(s1)-1][len(s2)-1])\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1531298679", "date2": "1531298894", "bleu_score": "0.9126424142721763", "code1_test_status": [1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0], "code1_test_score": 21, "total_score": 102, "input": "rbia\nalcm\n", "actual_output": "6\n", "expected_output": "4\n\n", "anno_code": ["s1 = input() # (0): s1=rbia\ns2 = input() # (1): s2=alcm\nx = [[0 for i in range(len(s2))]for j in range(len(s1))] # (2): x\n\ndef g(i,j): # (3): g=\n if i == 0 or j == 0: # (7): NO CHANGE (13): NO CHANGE ... (94): NO CHANGE\n if s1[i] == s2[j]: # (8): NO CHANGE (14): NO CHANGE ... (80): NO CHANGE\n x[i][j] = abs(i-j) # (81): s1=rbia, s2=alcm, x, g=\n else:\n if i == 0: # (9): NO CHANGE (15): NO CHANGE ... (58): NO CHANGE\n x[i][j] = x[i][j-1] + 1 # (10): s1=rbia, s2=alcm, x=[[1, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]], g= (16): s1=rbia, s2=alcm, x=[[1, 2, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]], g= ... (28): s1=rbia, s2=alcm, x, g=\n else:\n x[i][j] = x[i-1][j] + 1 # (36): s1=rbia, s2=alcm, x=[[1, 2, 3, 4], [2, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]], g= (59): s1=rbia, s2=alcm, x, g=\n elif s1[i] == s2[j]: # (40): NO CHANGE (45): NO CHANGE ... (95): NO CHANGE\n x[i][j] = x[i-1][j-1]\n else:\n x[i][j] = min(x[i][j-1] + 1,x[i-1][j] + 1) # (41): s1=rbia, s2=alcm, x=[[1, 2, 3, 4], [2, 3, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]], g= (46): s1=rbia, s2=alcm, x=[[1, 2, 3, 4], [2, 3, 4, 0], [0, 0, 0, 0], [0, 0, 0, 0]], g= ... (96): s1=rbia, s2=alcm, x, g=\n \n\nfor i in range(len(s1)): # (4): i=0 (30): i=1 ... (98): NO CHANGE\n for j in range(len(s2)): # (5): j=0 (11): j=1 ... (97): NO CHANGE\n g(i,j) # (6): NO CHANGE (12): NO CHANGE ... (93): NO CHANGE\n\nprint(x[len(s1)-1][len(s2)-1])\n"], "anno_status": [true], "diff_content": " s1 = input()\n s2 = input()\n x = [[0 for i in range(len(s2))]for j in range(len(s1))]\n \n def g(i,j):\n if i == 0 or j == 0:\n if s1[i] == s2[j]:\n x[i][j] = abs(i-j)\n else:\n if i == 0:\n x[i][j] = x[i][j-1] + 1\n else:\n x[i][j] = x[i-1][j] + 1\n elif s1[i] == s2[j]:\n- x[i][j] = x[i-1][j-1]\n+ x[i][j] = min(x[i-1][j-1],x[i][j-1]+1,x[i-1][j]+1)\n else:\n- x[i][j] = min(x[i][j-1] + 1,x[i-1][j] + 1)\n+ x[i][j] = min(x[i-1][j-1]+1,x[i][j-1]+1,x[i-1][j]+1)\n \n \n for i in range(len(s1)):\n for j in range(len(s2)):\n g(i,j)\n \n print(x[len(s1)-1][len(s2)-1])\n \n", "FL_content": "\n s1 = input()\n s2 = input()\n x = [[0 for i in range(len(s2))]for j in range(len(s1))]\n \n def g(i,j):\n if i == 0 or j == 0:\n if s1[i] == s2[j]:\n- x[i][j] = abs(i-j)\n else:\n if i == 0:\n x[i][j] = x[i][j-1] + 1\n else:\n x[i][j] = x[i-1][j] + 1\n elif s1[i] == s2[j]:\n x[i][j] = x[i-1][j-1]\n else:\n x[i][j] = min(x[i][j-1] + 1,x[i-1][j] + 1)\n \n \n for i in range(len(s1)):\n for j in range(len(s2)):\n g(i,j)\n \n print(x[len(s1)-1][len(s2)-1])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 25 }, { "user_id": "u336564899", "problem_id": "p02916", "submission1_id": "s930634817-FL", "submission2_id": "s734992045", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\n\nans = sum(B)\n\nfor i in range(N-1):\n if A[i] == A[i+1] - 1:\n print(str(A[i])+ \" : \" +str(A[i+1]))\n ans += C[A[i]-1]\n\nprint(ans)\n", "code2": "N = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\n\nans = sum(B)\n\nfor i in range(N-1):\n if A[i]+1 == A[i+1]:\n \n ans += C[A[i]-1]\n\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1578120507", "date2": "1578120842", "bleu_score": "0.8275239383229507", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0], "code1_test_score": 16, "total_score": 103, "input": "4\n2 3 4 1\n7 1 1 24\n45 9 16\n", "actual_output": "2 : 3\n3 : 4\n58\n", "expected_output": "58\n\n", "anno_code": ["N = int(input()) # (0): N=4\nA = list(map(int, input().split())) # (1): A=[2, 3, 4, 1]\nB = list(map(int, input().split())) # (2): B=[7, 1, 1, 24]\nC = list(map(int, input().split())) # (3): C=[45, 9, 16]\n\nans = sum(B) # (4): ans=33\n\nfor i in range(N-1): # (5): i=0 (9): i=1 ... (15): NO CHANGE\n if A[i] == A[i+1] - 1: # (6): NO CHANGE (10): NO CHANGE (14): NO CHANGE\n print(str(A[i])+ \" : \" +str(A[i+1])) # (7): NO CHANGE (11): NO CHANGE\n ans += C[A[i]-1] # (8): ans=42 (12): ans=58\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n C = list(map(int, input().split()))\n \n ans = sum(B)\n \n for i in range(N-1):\n- if A[i] == A[i+1] - 1:\n- print(str(A[i])+ \" : \" +str(A[i+1]))\n+ if A[i]+1 == A[i+1]:\n+ \n ans += C[A[i]-1]\n \n print(ans)\n \n", "FL_content": "\n N = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n C = list(map(int, input().split()))\n \n ans = sum(B)\n \n for i in range(N-1):\n if A[i] == A[i+1] - 1:\n- print(str(A[i])+ \" : \" +str(A[i+1]))\n ans += C[A[i]-1]\n \n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u256464928", "problem_id": "p02837", "submission1_id": "s580925072-FL", "submission2_id": "s601399158", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nlist = [list() for _ in range(N)]\n\nfor i in range(N):\n a = int(input())\n for j in range(a):\n x,y = map(int,input().split())\n list[i].append([x,y])\n\n\nans = 0\nfor i in range(2**N):\n flg = False\n do = [0] * N\n for j in range(N):\n if ((i >> j) & 1):\n do[j] = 1\n \n P = [-1] * N\n for n in range(N):\n if flg:break\n for p in list[n]:\n if P[p[0]-1] == -1:\n \n \n if do[n] == 1:\n P[p[0]-1] = p[1]\n else:\n if p[1] == 1:\n P[p[0]-1] = 0\n else:\n P[p[0]-1] = 1\n if P[p[0]-1] != do[p[0]-1]:\n flg = True\n else:\n if P[p[0]-1] != do[p[0]-1]:\n flg = True\n \n \n elif do[n] == 1 and P[p[0]-1] != p[1]:\n flg = True\n elif do[n] == 0 and P[p[0]-1] == p[1]:\n flg = True\n if flg:break\n \n if flg:\n continue\n \n ans = max(ans,sum(do))\n \nprint(ans)\n\n\n\n", "code2": "N = int(input())\nlist = [list() for _ in range(N)]\nif N == 1:\n print(1)\n exit()\n\nfor i in range(N):\n a = int(input())\n for j in range(a):\n x,y = map(int,input().split())\n list[i].append([x,y])\n\nans = 0\nfor i in range(2**N):\n flg = False\n do = [0] * N\n for j in range(N):\n if ((i >> j) & 1):\n do[j] = 1\n P = [-1] * N\n for n in range(N):\n if flg:break\n for p in list[n]:\n if P[p[0]-1] == -1:\n if do[n] == 1:\n P[p[0]-1] = p[1]\n if P[p[0]-1] != do[p[0]-1]:\n flg = True\n \n \n \n \n \n else:\n if do[n] == 1 and P[p[0]-1] != p[1]:\n flg = True\n if flg:\n continue\n ans = max(ans,sum(do))\nprint(ans)\n\n\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575862283", "date2": "1575867939", "bleu_score": "0.707596934195474", "code1_test_status": [1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1], "code1_test_score": 51, "total_score": 103, "input": "3\n2\n2 1\n3 1\n2\n3 1\n1 0\n2\n1 0\n2 0\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["N = int(input()) # (0): N=3\nlist = [list() for _ in range(N)] # (1): list\n\nfor i in range(N): # (2): i=0 (11): list, i=1 ... (29): NO CHANGE\n a = int(input()) # (3): a=2 (12): list (21): list\n for j in range(a): # (4): j=0 (7): list, j=1 ... (28): NO CHANGE\n x,y = map(int,input().split()) # (5): x=2, y=1 (8): list=[[[2, 1]], [], []], x=3 ... (26): list, x=2\n list[i].append([x,y]) # (6): list (9): list ... (27): list\n\n\nans = 0 # (30): ans=0\nfor i in range(2**N): # (31): i=0 (79): i=1 ... (296): NO CHANGE\n flg = False # (32): flg=False (80): flg=False ... (249): flg=False\n do = [0] * N # (33): do=[0, 0, 0] (81): NO CHANGE ... (250): do=[0, 0, 0]\n for j in range(N): # (34): j=0 (36): j=1 ... (260): NO CHANGE\n if ((i >> j) & 1): # (35): NO CHANGE (37): NO CHANGE ... (258): NO CHANGE\n do[j] = 1 # (84): do=[1, 0, 0] (111): do=[0, 1, 0] ... (259): do=[1, 1, 1]\n \n P = [-1] * N # (41): P=[-1, -1, -1] (90): P=[-1, -1, -1] ... (261): P=[-1, -1, -1]\n for n in range(N): # (42): n=0 (59): n=1 ... (292): n=2\n if flg:break # (43): NO CHANGE (60): NO CHANGE ... (293): NO CHANGE\n for p in list[n]: # (44): p=[2, 1] (51): p=[3, 1] ... (285): p=[1, 0]\n if P[p[0]-1] == -1: # (45): NO CHANGE (52): NO CHANGE ... (286): NO CHANGE\n \n \n if do[n] == 1: # (46): NO CHANGE (53): NO CHANGE ... (287): NO CHANGE\n P[p[0]-1] = p[1] # (96): P=[-1, 1, -1] (148): P=[-1, 1, -1] ... (288): P=[0, 1, 1]\n else:\n if p[1] == 1: # (47): NO CHANGE (54): NO CHANGE ... (239): NO CHANGE\n P[p[0]-1] = 0 # (48): P=[-1, 0, -1] (55): P=[-1, 0, 0] ... (240): P=[-1, 0, -1]\n else:\n P[p[0]-1] = 1 # (71): P=[1, 0, 0]\n if P[p[0]-1] != do[p[0]-1]: # (49): NO CHANGE (56): NO CHANGE ... (289): NO CHANGE\n flg = True # (73): flg=True (98): flg=True ... (290): flg=True\n else:\n if P[p[0]-1] != do[p[0]-1]: # (63): NO CHANGE (281): NO CHANGE\n flg = True\n \n \n elif do[n] == 1 and P[p[0]-1] != p[1]: # (64): NO CHANGE (282): NO CHANGE\n flg = True\n elif do[n] == 0 and P[p[0]-1] == p[1]: # (65): NO CHANGE (283): NO CHANGE\n flg = True\n if flg:break # (50): NO CHANGE (57): NO CHANGE ... (291): NO CHANGE\n \n if flg: # (77): NO CHANGE (102): NO CHANGE ... (294): NO CHANGE\n continue # (78): NO CHANGE (103): NO CHANGE ... (295): NO CHANGE\n \n ans = max(ans,sum(do))\n \nprint(ans)\n\n\n\n"], "anno_status": [false], "diff_content": " N = int(input())\n list = [list() for _ in range(N)]\n+if N == 1:\n+ print(1)\n+ exit()\n \n for i in range(N):\n a = int(input())\n for j in range(a):\n x,y = map(int,input().split())\n list[i].append([x,y])\n \n-\n ans = 0\n for i in range(2**N):\n flg = False\n do = [0] * N\n for j in range(N):\n if ((i >> j) & 1):\n do[j] = 1\n- \n P = [-1] * N\n for n in range(N):\n if flg:break\n for p in list[n]:\n if P[p[0]-1] == -1:\n- \n- \n if do[n] == 1:\n P[p[0]-1] = p[1]\n- else:\n- if p[1] == 1:\n- P[p[0]-1] = 0\n- else:\n- P[p[0]-1] = 1\n- if P[p[0]-1] != do[p[0]-1]:\n- flg = True\n- else:\n- if P[p[0]-1] != do[p[0]-1]:\n- flg = True\n+ if P[p[0]-1] != do[p[0]-1]:\n+ flg = True\n \n \n- elif do[n] == 1 and P[p[0]-1] != p[1]:\n- flg = True\n- elif do[n] == 0 and P[p[0]-1] == p[1]:\n+ \n+ \n+ \n+ else:\n+ if do[n] == 1 and P[p[0]-1] != p[1]:\n flg = True\n- if flg:break\n- \n if flg:\n continue\n- \n ans = max(ans,sum(do))\n- \n print(ans)\n \n \n \n \n", "FL_content": "\n N = int(input())\n list = [list() for _ in range(N)]\n \n for i in range(N):\n a = int(input())\n for j in range(a):\n x,y = map(int,input().split())\n list[i].append([x,y])\n \n \n ans = 0\n for i in range(2**N):\n flg = False\n do = [0] * N\n for j in range(N):\n if ((i >> j) & 1):\n do[j] = 1\n \n P = [-1] * N\n for n in range(N):\n if flg:break\n \n- \n- \n for p in list[n]:\n if P[p[0]-1] == -1:\n \n \n if do[n] == 1:\n P[p[0]-1] = p[1]\n else:\n if p[1] == 1:\n P[p[0]-1] = 0\n else:\n P[p[0]-1] = 1\n if P[p[0]-1] != do[p[0]-1]:\n flg = True\n else:\n if P[p[0]-1] != do[p[0]-1]:\n flg = True\n \n \n elif do[n] == 1 and P[p[0]-1] != p[1]:\n flg = True\n elif do[n] == 0 and P[p[0]-1] == p[1]:\n flg = True\n if flg:break\n \n if flg:\n continue\n \n ans = max(ans,sum(do))\n \n print(ans)\n \n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 55 }, { "user_id": "u291528105", "problem_id": "p02720", "submission1_id": "s188536520-FL", "submission2_id": "s146922900", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\nimport sys\n\ndef solve(k):\n if k < 10:\n return k\n \n heap = [1,2,3,4,5,6,7,8,9]\n heapq.heapify(heap)\n\n for i in range(k-1):\n lunlun = heapq.heappop(heap)\n lastDigit = lunlun % 10\n \n heapq.heappush(heap, (lunlun*10) + lastDigit)\n\n if lastDigit == 0:\n newlunlun = (lunlun * 10) + 1\n heapq.heappush(heap, newlunlun) \n elif lastDigit == 9:\n newlunlun = (lunlun * 10) + 8\n heapq.heappush(heap, newlunlun) \n else:\n newlunlun1 = (lunlun * 10) + lastDigit + 1\n newlunlun2 = (lunlun * 10) + lastDigit - 1\n heapq.heappush(heap, newlunlun1)\n heapq.heappush(heap, newlunlun2)\n\n return heapq.heappop(heap)\n\n\nk = 100000\nprint(solve(int(k)))", "code2": "import heapq\nimport sys\n\ndef solve(k):\n if k < 10:\n return k\n \n heap = [1,2,3,4,5,6,7,8,9]\n heapq.heapify(heap)\n\n for i in range(k-1):\n lunlun = heapq.heappop(heap)\n lastDigit = lunlun % 10\n \n heapq.heappush(heap, (lunlun*10) + lastDigit)\n\n if lastDigit == 0:\n newlunlun = (lunlun * 10) + 1\n heapq.heappush(heap, newlunlun) \n elif lastDigit == 9:\n newlunlun = (lunlun * 10) + 8\n heapq.heappush(heap, newlunlun) \n else:\n newlunlun1 = (lunlun * 10) + lastDigit + 1\n newlunlun2 = (lunlun * 10) + lastDigit - 1\n heapq.heappush(heap, newlunlun1)\n heapq.heappush(heap, newlunlun2)\n\n return heapq.heappop(heap)\n\nk = input()\n\nprint(solve(int(k)))", "original_language1": "Python (2.7.6)", "original_language2": "Python (2.7.6)", "date1": "1586195265", "date2": "1586195329", "bleu_score": "0.9884816208581918", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "179\n", "actual_output": "3234566667\n", "expected_output": "3434\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import heapq\n import sys\n \n def solve(k):\n if k < 10:\n return k\n \n heap = [1,2,3,4,5,6,7,8,9]\n heapq.heapify(heap)\n \n for i in range(k-1):\n lunlun = heapq.heappop(heap)\n lastDigit = lunlun % 10\n \n heapq.heappush(heap, (lunlun*10) + lastDigit)\n \n if lastDigit == 0:\n newlunlun = (lunlun * 10) + 1\n heapq.heappush(heap, newlunlun) \n elif lastDigit == 9:\n newlunlun = (lunlun * 10) + 8\n heapq.heappush(heap, newlunlun) \n else:\n newlunlun1 = (lunlun * 10) + lastDigit + 1\n newlunlun2 = (lunlun * 10) + lastDigit - 1\n heapq.heappush(heap, newlunlun1)\n heapq.heappush(heap, newlunlun2)\n \n return heapq.heappop(heap)\n \n+k = input()\n \n-k = 100000\n print(solve(int(k)))\n", "FL_content": "\n import heapq\n import sys\n \n def solve(k):\n if k < 10:\n return k\n \n- heap = [1,2,3,4,5,6,7,8,9]\n heapq.heapify(heap)\n \n for i in range(k-1):\n lunlun = heapq.heappop(heap)\n lastDigit = lunlun % 10\n \n heapq.heappush(heap, (lunlun*10) + lastDigit)\n \n if lastDigit == 0:\n newlunlun = (lunlun * 10) + 1\n heapq.heappush(heap, newlunlun) \n elif lastDigit == 9:\n newlunlun = (lunlun * 10) + 8\n heapq.heappush(heap, newlunlun) \n else:\n newlunlun1 = (lunlun * 10) + lastDigit + 1\n newlunlun2 = (lunlun * 10) + lastDigit - 1\n heapq.heappush(heap, newlunlun1)\n heapq.heappush(heap, newlunlun2)\n \n return heapq.heappop(heap)\n \n \n-k = 100000\n-print(solve(int(k)))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 33 }, { "user_id": "u569272329", "problem_id": "p03437", "submission1_id": "s937889218-FL", "submission2_id": "s031425955", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X, Y = map(int, input().split())\nif (X % Y == 0) or (Y % X == 0):\n print(-1)\nelse:\n print(X * 2)\n", "code2": "X, Y = map(int, input().split())\nif (X % Y == 0):\n print(-1)\nelse:\n print(X)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560656717", "date2": "1560657655", "bleu_score": "0.7736689917386741", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 25, "input": "46 6\n", "actual_output": "92\n", "expected_output": "46\n\n", "anno_code": ["X, Y = map(int, input().split()) # (0): X=46, Y=6\nif (X % Y == 0) or (Y % X == 0): # (1): NO CHANGE\n print(-1)\nelse:\n print(X * 2)\n"], "anno_status": [true], "diff_content": " X, Y = map(int, input().split())\n-if (X % Y == 0) or (Y % X == 0):\n+if (X % Y == 0):\n print(-1)\n else:\n- print(X * 2)\n+ print(X)\n \n", "FL_content": "\n X, Y = map(int, input().split())\n if (X % Y == 0) or (Y % X == 0):\n print(-1)\n else:\n- print(X * 2)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u997346103", "problem_id": "p03556", "submission1_id": "s401287643-FL", "submission2_id": "s207359469", "status1": "Wrong Answer", "status2": "Accepted", "code1": "print(round(int(input())**.5)**2)", "code2": "print(int(int(input())**.5)**2)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1572569261", "date2": "1572569321", "bleu_score": "0.7988634909550008", "code1_test_status": [0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 45, "total_score": 83, "input": "670\n", "actual_output": "676\n", "expected_output": "625\n\n", "anno_code": ["print(round(int(input())**.5)**2)"], "anno_status": [true], "diff_content": "-print(round(int(input())**.5)**2)\n+print(int(int(input())**.5)**2)\n", "FL_content": "\n-print(round(int(input())**.5)**2)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 1 }, { "user_id": "u847467233", "problem_id": "p02458", "submission1_id": "s303395059-FL", "submission2_id": "s119665155", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nfrom bisect import bisect_left, bisect_right, insort_left\ndict = {}\nkeytbl = []\ncnt = 0\nq = int(input())\nfor i in range(q):\n\ta = list(input().split())\n\tki = int(a[1])\n\tif a[0] == '0':\n\t\tif ki not in dict:\n\t\t\tdict[ki] = 1\n\t\t\tinsort_left(keytbl, ki)\n\t\telse: dict[ki] += 1\n\t\tcnt += 1\n\t\tprint(cnt)\n\telif a[0] == '1': print(dict[ki] if ki in dict else 0)\n\telif a[0] == '2':\n\t\tif ki in dict:\n\t\t\tcnt -= dict[ki]\n\t\t\tdict[ki] = 0\n\telse:\n\t\tL = bisect_left (keytbl, int(a[1]))\n\t\tR = bisect_right(keytbl, int(a[2]), L)\n\t\tfor j in range(L, R):\n\t\t\tif dict[keytbl[j]] > 0: print(keytbl[j])\n", "code2": "\n\n\nfrom bisect import bisect_left, bisect_right, insort_left\ndict = {}\nkeytbl = []\ncnt = 0\nq = int(input())\nfor i in range(q):\n\ta = list(input().split())\n\tki = int(a[1])\n\tif a[0] == '0':\n\t\tif ki not in dict:\n\t\t\tdict[ki] = 1\n\t\t\tinsort_left(keytbl, ki)\n\t\telse: dict[ki] += 1\n\t\tcnt += 1\n\t\tprint(cnt)\n\telif a[0] == '1': print(dict[ki] if ki in dict else 0)\n\telif a[0] == '2':\n\t\tif ki in dict:\n\t\t\tcnt -= dict[ki]\n\t\t\tdict[ki] = 0\n\telse:\n\t\tL = bisect_left (keytbl, int(a[1]))\n\t\tR = bisect_right(keytbl, int(a[2]), L)\n\t\tfor j in range(L, R):\n\t\t\tfor k in range(dict[keytbl[j]]): print(keytbl[j])\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1529833747", "date2": "1529834240", "bleu_score": "0.969645057306938", "code1_test_status": [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 85, "total_score": 101, "input": "10\n1 1\n0 1\n0 2\n1 3\n2 2\n1 1\n0 1\n1 6\n1 4\n3 1 4\n", "actual_output": "0\n1\n2\n0\n1\n2\n0\n0\n1\n", "expected_output": "0\n1\n2\n0\n1\n2\n0\n0\n1\n1\n\n", "anno_code": ["\n\n\nfrom bisect import bisect_left, bisect_right, insort_left\ndict = {} # (0): dict={}\nkeytbl = [] # (1): keytbl=[]\ncnt = 0 # (2): cnt=0\nq = int(input()) # (3): q=10\nfor i in range(q): # (4): i=0 (9): i=1 ... (64): i=9\n\ta = list(input().split()) # (5): a=['1', '1'] (10): a=['0', '1'] ... (65): a=['3', '1', '4']\n\tki = int(a[1]) # (6): ki=1 (11): NO CHANGE ... (66): ki=1\n\tif a[0] == '0': # (7): NO CHANGE (12): NO CHANGE ... (67): NO CHANGE\n\t\tif ki not in dict: # (13): NO CHANGE (22): NO CHANGE (50): NO CHANGE\n\t\t\tdict[ki] = 1 # (14): dict={1: 1} (23): dict={1: 1, 2: 1}\n\t\t\tinsort_left(keytbl, ki) # (15): keytbl=[1] (24): keytbl=[1, 2]\n\t\telse: dict[ki] += 1 # (51): dict={1: 2, 2: 0}\n\t\tcnt += 1 # (16): cnt=1 (25): cnt=2 (52): cnt=2\n\t\tprint(cnt) # (17): NO CHANGE (26): NO CHANGE (53): NO CHANGE\n\telif a[0] == '1': print(dict[ki] if ki in dict else 0) # (8): NO CHANGE (31): NO CHANGE ... (68): NO CHANGE\n\telif a[0] == '2': # (37): NO CHANGE (69): NO CHANGE\n\t\tif ki in dict: # (38): NO CHANGE\n\t\t\tcnt -= dict[ki] # (39): cnt=1\n\t\t\tdict[ki] = 0 # (40): dict={1: 1, 2: 0}\n\telse:\n\t\tL = bisect_left (keytbl, int(a[1])) # (70): L=0\n\t\tR = bisect_right(keytbl, int(a[2]), L) # (71): R=2\n\t\tfor j in range(L, R): # (72): j=0 (74): j=1 (76): NO CHANGE\n\t\t\tif dict[keytbl[j]] > 0: print(keytbl[j]) # (73): NO CHANGE (75): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n \n \n from bisect import bisect_left, bisect_right, insort_left\n dict = {}\n keytbl = []\n cnt = 0\n q = int(input())\n for i in range(q):\n \ta = list(input().split())\n \tki = int(a[1])\n \tif a[0] == '0':\n \t\tif ki not in dict:\n \t\t\tdict[ki] = 1\n \t\t\tinsort_left(keytbl, ki)\n \t\telse: dict[ki] += 1\n \t\tcnt += 1\n \t\tprint(cnt)\n \telif a[0] == '1': print(dict[ki] if ki in dict else 0)\n \telif a[0] == '2':\n \t\tif ki in dict:\n \t\t\tcnt -= dict[ki]\n \t\t\tdict[ki] = 0\n \telse:\n \t\tL = bisect_left (keytbl, int(a[1]))\n \t\tR = bisect_right(keytbl, int(a[2]), L)\n \t\tfor j in range(L, R):\n-\t\t\tif dict[keytbl[j]] > 0: print(keytbl[j])\n+\t\t\tfor k in range(dict[keytbl[j]]): print(keytbl[j])\n \n", "FL_content": "\n \n \n \n from bisect import bisect_left, bisect_right, insort_left\n dict = {}\n keytbl = []\n cnt = 0\n q = int(input())\n for i in range(q):\n \ta = list(input().split())\n \tki = int(a[1])\n \tif a[0] == '0':\n \t\tif ki not in dict:\n \t\t\tdict[ki] = 1\n \t\t\tinsort_left(keytbl, ki)\n \t\telse: dict[ki] += 1\n \t\tcnt += 1\n \t\tprint(cnt)\n \telif a[0] == '1': print(dict[ki] if ki in dict else 0)\n \telif a[0] == '2':\n \t\tif ki in dict:\n \t\t\tcnt -= dict[ki]\n \t\t\tdict[ki] = 0\n \telse:\n \t\tL = bisect_left (keytbl, int(a[1]))\n \t\tR = bisect_right(keytbl, int(a[2]), L)\n \t\tfor j in range(L, R):\n \t\t\tif dict[keytbl[j]] > 0: print(keytbl[j])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 29 }, { "user_id": "u405027099", "problem_id": "p02318", "submission1_id": "s742560898-FL", "submission2_id": "s517676136", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n for i in range(len(X)+1):\n f[i][0]=i\n for j in range(1,len(Y)+1):\n f[0][j]=j\n for i in range(1,len(X)+1):\n for j in range(len(Y)+1):\n if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n\nX=input()\nY=input()\n\nprint(levenshtein(X,Y))\n", "code2": "def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n for i in range(len(X)+1):\n f[i][0]=i\n for j in range(len(Y)+1):\n f[0][j]=j\n for i in range(1,len(X)+1):\n for j in range(1,len(Y)+1):\n if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n\nX=input()\nY=input()\n\nprint(levenshtein(X,Y))\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1531820515", "date2": "1531820628", "bleu_score": "0.9980099403873665", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 93, "total_score": 102, "input": "ipcb\nckbo\n", "actual_output": "3\n", "expected_output": "4\n\n", "anno_code": ["def levenshtein(X,Y): # (0): levenshtein=\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)] # (4): f\n for i in range(len(X)+1): # (5): i=0 (7): i=1 ... (15): NO CHANGE\n f[i][0]=i # (6): NO CHANGE (8): f ... (14): f\n for j in range(1,len(Y)+1): # (16): j=1 (18): j=2 ... (24): NO CHANGE\n f[0][j]=j # (17): f (19): f ... (23): f\n for i in range(1,len(X)+1): # (25): i=1 (42): i=2 ... (76): i=4\n for j in range(len(Y)+1): # (26): j=0 (29): j=1 ... (92): NO CHANGE\n if X[i-1]==Y[j-1]: # (27): NO CHANGE (30): NO CHANGE ... (90): NO CHANGE\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]) # (65): f (88): f\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1) # (28): NO CHANGE (31): f ... (91): f\n return f[len(X)][len(Y)]\n\nX=input() # (1): X=ipcb\nY=input() # (2): Y=ckbo\n\nprint(levenshtein(X,Y)) # (3): NO CHANGE\n"], "anno_status": [true], "diff_content": " def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n for i in range(len(X)+1):\n f[i][0]=i\n- for j in range(1,len(Y)+1):\n+ for j in range(len(Y)+1):\n f[0][j]=j\n for i in range(1,len(X)+1):\n- for j in range(len(Y)+1):\n+ for j in range(1,len(Y)+1):\n if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n \n X=input()\n Y=input()\n \n print(levenshtein(X,Y))\n \n+\n", "FL_content": "\n def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n for i in range(len(X)+1):\n f[i][0]=i\n for j in range(1,len(Y)+1):\n f[0][j]=j\n for i in range(1,len(X)+1):\n for j in range(len(Y)+1):\n- if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n \n X=input()\n Y=input()\n \n print(levenshtein(X,Y))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u422272120", "problem_id": "p03523", "submission1_id": "s596830322-FL", "submission2_id": "s278013157", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import re\ns = input()\np = r'[A]?KIH[A]?B[A]?R[A]?'\nr = re.fullmatch(p,s)\nif r:\n print (\"Yes\")\nelse:\n print (\"No\")\n", "code2": "import re\nr = re.fullmatch(r'[A]?KIH[A]?B[A]?R[A]?', input())\nif r:\n print (\"YES\")\nelse:\n print (\"NO\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584582453", "date2": "1584582565", "bleu_score": "0.8004313603220171", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "IABA@CHJR\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["import re\ns = input() # (0): s=IABA@CHJR\np = r'[A]?KIH[A]?B[A]?R[A]?' # (1): p=[A]?KIH[A]?B[A]?R[A]?\nr = re.fullmatch(p,s) # (2): r=None\nif r: # (3): NO CHANGE\n print (\"Yes\")\nelse:\n print (\"No\")\n"], "anno_status": [true], "diff_content": " import re\n-s = input()\n-p = r'[A]?KIH[A]?B[A]?R[A]?'\n-r = re.fullmatch(p,s)\n+r = re.fullmatch(r'[A]?KIH[A]?B[A]?R[A]?', input())\n if r:\n- print (\"Yes\")\n+ print (\"YES\")\n else:\n- print (\"No\")\n+ print (\"NO\")\n \n", "FL_content": "\n import re\n s = input()\n p = r'[A]?KIH[A]?B[A]?R[A]?'\n r = re.fullmatch(p,s)\n if r:\n- print (\"Yes\")\n else:\n- print (\"No\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u135116520", "problem_id": "p02933", "submission1_id": "s777630432-FL", "submission2_id": "s697491924", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=int(input())\ns=input()\nif a>=3200: \n print(a)\nelse:\n print(\"red\")", "code2": "a=int(input())\ns=input()\nif 2800<=a<3200:\n print(\"red\")\nelif 3200<=a<5000:\n print(s)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577039181", "date2": "1577039322", "bleu_score": "0.6541751251140129", "code1_test_status": [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 2, "total_score": 103, "input": "3200\nogom\n", "actual_output": "3200\n", "expected_output": "ogom\n\n", "anno_code": ["a=int(input()) # (0): a=3200\ns=input() # (1): s=ogom\nif a>=3200: # (2): NO CHANGE\n print(a)\nelse:\n print(\"red\")"], "anno_status": [true], "diff_content": " a=int(input())\n s=input()\n-if a>=3200: \n- print(a)\n-else:\n+if 2800<=a<3200:\n print(\"red\")\n+elif 3200<=a<5000:\n+ print(s)\n", "FL_content": "\n a=int(input())\n s=input()\n if a>=3200: \n- print(a)\n else:\n print(\"red\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u397531548", "problem_id": "p03957", "submission1_id": "s547464341-FL", "submission2_id": "s682122582", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nfor i in range(len(s)):\n for j in range(i,len(s)):\n if s[i]==\"C\":\n if s[j]==\"F\":\n print(\"Yes\")\n break\nelse:\n print(\"No\")", "code2": "s=input()\na=\"No\"\nfor i in range(len(s)):\n for j in range(i,len(s)):\n if s[i]==\"C\":\n if s[j]==\"F\":\n a=\"Yes\"\n break\nprint(a)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1543944957", "date2": "1543945191", "bleu_score": "0.8650561252856952", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0], "code1_test_score": 86, "total_score": 103, "input": "FSVP@DDQCFIK\n", "actual_output": "Yes\nNo\n", "expected_output": "Yes\n\n", "anno_code": ["s=input() # (0): s=FSVP@DDQCFIK\nfor i in range(len(s)): # (1): i=0 (27): i=1 ... (180): NO CHANGE\n for j in range(i,len(s)): # (2): j=0 (4): j=1 ... (179): NO CHANGE\n if s[i]==\"C\": # (3): NO CHANGE (5): NO CHANGE ... (178): NO CHANGE\n if s[j]==\"F\": # (156): NO CHANGE (159): NO CHANGE\n print(\"Yes\") # (160): NO CHANGE\n break # (161): NO CHANGE\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " s=input()\n+a=\"No\"\n for i in range(len(s)):\n for j in range(i,len(s)):\n if s[i]==\"C\":\n if s[j]==\"F\":\n- print(\"Yes\")\n+ a=\"Yes\"\n break\n-else:\n- print(\"No\")\n+print(a)\n", "FL_content": "\n s=input()\n for i in range(len(s)):\n- for j in range(i,len(s)):\n if s[i]==\"C\":\n if s[j]==\"F\":\n print(\"Yes\")\n break\n else:\n print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u672220554", "problem_id": "p03172", "submission1_id": "s071625340-FL", "submission2_id": "s521930773", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n for j in range(K):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n \n \n\n return dp[N][K] % MOD\n\n\nprint(main())\n", "code2": "def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n for j in range(K+1):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n for j in range(K+1):\n dp[i+1][j] = dp[i+1][j] % MOD\n\n return dp[N][K]\n\n\nprint(main())\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1582147606", "date2": "1582148247", "bleu_score": "0.8996665524184058", "code1_test_status": [1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1], "code1_test_score": 5, "total_score": 103, "input": "4 101000\n101000 001100 101001 100000\n", "actual_output": "600177772\n", "expected_output": "710774323\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n- for j in range(K):\n+ for j in range(K+1):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n- \n- \n+ for j in range(K+1):\n+ dp[i+1][j] = dp[i+1][j] % MOD\n \n- return dp[N][K] % MOD\n+ return dp[N][K]\n \n \n print(main())\n \n", "FL_content": "\n def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n for j in range(K):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n \n \n \n return dp[N][K] % MOD\n \n \n print(main())\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u089142196", "problem_id": "p02720", "submission1_id": "s406888778-FL", "submission2_id": "s579139708", "status1": "Wrong Answer", "status2": "Accepted", "code1": "K=int(input())\nx=[[0] for _ in range(11)]\ny=[ 0 for _ in range(11)]\n\nx[1]=[1,2,3,4,5,6,7,8,9]\ny[1]=9\n\nfor i in range(2,11):\n x[i].pop()\n for num in x[i-1]:\n last = num%10\n if last==0:\n x[i].append(10*num)\n x[i].append(10*num+1)\n y[i] +=2\n elif last==9:\n x[i].append(10*num+8)\n x[i].append(10*num+9)\n y[i] +=2\n else:\n x[i].append(10*num+(last-1))\n x[i].append(10*num+last)\n x[i].append(10*num+(last+1))\n y[i] +=3\n \n\n\n\nz=[0,y[1]]\nfor i in range(2,11):\n z.append(z[-1]+y[i])\n\n\nmaxi=0\nfor r in range(11):\n if z[r]<=K:\n maxi=max(maxi,r)\n \nketa=maxi+1\n\nprint(x[keta][K-y[maxi]-1])", "code2": "K=int(input())\nx=[[0] for _ in range(11)]\ny=[ 0 for _ in range(11)]\n\nx[1]=[1,2,3,4,5,6,7,8,9]\ny[1]=9\n\nfor i in range(2,11):\n x[i].pop()\n for num in x[i-1]:\n last = num%10\n if last==0:\n x[i].append(10*num)\n x[i].append(10*num+1)\n y[i] +=2\n elif last==9:\n x[i].append(10*num+8)\n x[i].append(10*num+9)\n y[i] +=2\n else:\n x[i].append(10*num+(last-1))\n x[i].append(10*num+last)\n x[i].append(10*num+(last+1))\n y[i] +=3\n \n\n\n\nz=[0,y[1]]\nfor i in range(2,11):\n z.append(z[-1]+y[i])\n\n\nketa=0\nfor i,num in enumerate(z):\n if num<=K:\n keta=i+1\n\ns= K-z[keta-1]\n\nprint(x[keta][s-1])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586054387", "date2": "1586054797", "bleu_score": "0.9162558731495822", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "179\n", "actual_output": "5433\n", "expected_output": "3434\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " K=int(input())\n x=[[0] for _ in range(11)]\n y=[ 0 for _ in range(11)]\n \n x[1]=[1,2,3,4,5,6,7,8,9]\n y[1]=9\n \n for i in range(2,11):\n x[i].pop()\n for num in x[i-1]:\n last = num%10\n if last==0:\n x[i].append(10*num)\n x[i].append(10*num+1)\n y[i] +=2\n elif last==9:\n x[i].append(10*num+8)\n x[i].append(10*num+9)\n y[i] +=2\n else:\n x[i].append(10*num+(last-1))\n x[i].append(10*num+last)\n x[i].append(10*num+(last+1))\n y[i] +=3\n \n \n \n \n z=[0,y[1]]\n for i in range(2,11):\n z.append(z[-1]+y[i])\n \n \n-maxi=0\n-for r in range(11):\n- if z[r]<=K:\n- maxi=max(maxi,r)\n- \n-keta=maxi+1\n-\n-print(x[keta][K-y[maxi]-1])\n+keta=0\n+for i,num in enumerate(z):\n+ if num<=K:\n+ keta=i+1\n+\n+s= K-z[keta-1]\n+\n+print(x[keta][s-1])\n", "FL_content": "\n K=int(input())\n x=[[0] for _ in range(11)]\n y=[ 0 for _ in range(11)]\n \n x[1]=[1,2,3,4,5,6,7,8,9]\n y[1]=9\n \n for i in range(2,11):\n x[i].pop()\n for num in x[i-1]:\n last = num%10\n if last==0:\n x[i].append(10*num)\n x[i].append(10*num+1)\n y[i] +=2\n elif last==9:\n x[i].append(10*num+8)\n x[i].append(10*num+9)\n y[i] +=2\n else:\n x[i].append(10*num+(last-1))\n x[i].append(10*num+last)\n x[i].append(10*num+(last+1))\n y[i] +=3\n \n \n \n \n z=[0,y[1]]\n for i in range(2,11):\n z.append(z[-1]+y[i])\n \n \n maxi=0\n for r in range(11):\n if z[r]<=K:\n maxi=max(maxi,r)\n \n keta=maxi+1\n \n print(x[keta][K-y[maxi]-1])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 41 }, { "user_id": "u970899068", "problem_id": "p02929", "submission1_id": "s635520159-FL", "submission2_id": "s236697245", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\nn=int(input())\ns=list(input())\n\nfor i in range(0,2*n,2):\n if s[i]=='W':\n s[i]='B'\n else:\n s[i]='W'\n\n\ncountL=0\nans=1\nfor i in range(2*n):\n if s[i]=='W':\n countL+=1\n else:\n ans*=countL\n if countL==0:\n print(0)\n exit()\n countL-=1\n\n\nx=math.factorial(n)\nx=x%(10**9+7)\nans=ans%(10**9+7)\nprint((ans*x)%(10**9+7))\n\n\n", "code2": "mod=10**9+7\nn=int(input())\ns=list(input())\n\nfor i in range(0,2*n,2):\n if s[i]=='W':\n s[i]='B'\n else:\n s[i]='W'\n\n\ncountL=0\nans=1\nfor i in range(2*n):\n if s[i]=='W':\n countL+=1\n else:\n ans*=countL\n if countL==0:\n print(0)\n exit()\n ans%=mod\n countL-=1\nif countL!=0:\n print(0)\n exit()\n\nfor i in range(1,n+1):\n ans*=i\n ans%=mod\nprint(ans)\n\n\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1566739252", "date2": "1566741655", "bleu_score": "0.7781721913992556", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 101, "total_score": 103, "input": "4\nBBAWVCWW\n", "actual_output": "144\n", "expected_output": "0\n\n", "anno_code": ["import math\n\nn=int(input()) # (0): n=4\ns=list(input()) # (1): s=['B', 'B', 'A', 'W', 'V', 'C', 'W', 'W']\n\nfor i in range(0,2*n,2): # (2): i=0 (5): i=2 ... (14): NO CHANGE\n if s[i]=='W': # (3): NO CHANGE (6): NO CHANGE ... (12): NO CHANGE\n s[i]='B' # (13): s=['W', 'B', 'W', 'W', 'W', 'C', 'B', 'W']\n else:\n s[i]='W' # (4): s=['W', 'B', 'A', 'W', 'V', 'C', 'W', 'W'] (7): s=['W', 'B', 'W', 'W', 'V', 'C', 'W', 'W'] (10): s=['W', 'B', 'W', 'W', 'W', 'C', 'W', 'W']\n\n\ncountL=0 # (15): countL=0\nans=1 # (16): ans=1\nfor i in range(2*n): # (17): i=0 (20): i=1 ... (47): NO CHANGE\n if s[i]=='W': # (18): NO CHANGE (21): NO CHANGE ... (45): NO CHANGE\n countL+=1 # (19): countL=1 (27): countL=1 ... (46): countL=2\n else:\n ans*=countL # (22): NO CHANGE (36): ans=3 (41): ans=6\n if countL==0: # (23): NO CHANGE (37): NO CHANGE (42): NO CHANGE\n print(0)\n exit()\n countL-=1 # (24): countL=0 (38): countL=2 (43): countL=1\n\n\nx=math.factorial(n) # (48): x=24\nx=x%(10**9+7) # (49): NO CHANGE\nans=ans%(10**9+7) # (50): NO CHANGE\nprint((ans*x)%(10**9+7))\n\n\n"], "anno_status": [true], "diff_content": "-import math\n-\n+mod=10**9+7\n n=int(input())\n s=list(input())\n \n for i in range(0,2*n,2):\n if s[i]=='W':\n s[i]='B'\n else:\n s[i]='W'\n \n \n countL=0\n ans=1\n for i in range(2*n):\n if s[i]=='W':\n countL+=1\n else:\n ans*=countL\n if countL==0:\n print(0)\n exit()\n+ ans%=mod\n countL-=1\n-\n-\n-x=math.factorial(n)\n-x=x%(10**9+7)\n-ans=ans%(10**9+7)\n-print((ans*x)%(10**9+7))\n+if countL!=0:\n+ print(0)\n+ exit()\n+\n+for i in range(1,n+1):\n+ ans*=i\n+ ans%=mod\n+print(ans)\n \n \n \n", "FL_content": "\n import math\n \n n=int(input())\n s=list(input())\n \n for i in range(0,2*n,2):\n if s[i]=='W':\n s[i]='B'\n else:\n s[i]='W'\n \n \n countL=0\n ans=1\n for i in range(2*n):\n if s[i]=='W':\n countL+=1\n else:\n ans*=countL\n if countL==0:\n print(0)\n exit()\n countL-=1\n \n \n x=math.factorial(n)\n x=x%(10**9+7)\n ans=ans%(10**9+7)\n print((ans*x)%(10**9+7))\n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 32 }, { "user_id": "u197300773", "problem_id": "p02867", "submission1_id": "s086304308-FL", "submission2_id": "s487742399", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nN=int(input())\n\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\naa=[[a[i],i] for i in range(N)]\nbb=[[b[i],i] for i in range(N)]\naa.sort()\nbb.sort()\n\n\nfor i in range(N):\n if aa[i][0]>bb[i][0]: print(\"No\"),sys.exit()\n\n\nfor i in range(N-1):\n if aa[i][0]==aa[i+1][0] or bb[i][0]==bb[i+1][0]: print(\"Yes\"),sys.exit()\n if bb[i][0]>=aa[i+1][0]: print(\"Yes\"),sys.exit()\n\n\ndicb={}\nfor i in range(N):\n dicb[bb[i][0]]=i\n\n\ntmp=1\nj=0\nprint(dicb)\n\nwhile tmpbb[i][0]:\n print(\"No\")\n sys.exit()\n\nfor i in range(N-1):\n if aa[i][0]==aa[i+1][0] or bb[i][0]==bb[i+1][0]:\n print(\"Yes\")\n sys.exit()\n\nfor i in range(1,N):\n if aa[i][0]<=bb[i-1][0]:\n print(\"Yes\")\n sys.exit()\n\n\ndic={}\nfor i in range(N):\n dic[aa[i][0]]=i\n\ninij=1\ncycle=1\nj=inij\n\nwhile True:\n j=dic[a[j]]\n if j==inij:\n break\n cycle+=1\n\nprint(\"Yes\" if cyclebb[i][0]: print(\"No\"),sys.exit()\n-\n+ if aa[i][0]>bb[i][0]:\n+ print(\"No\")\n+ sys.exit()\n \n for i in range(N-1):\n- if aa[i][0]==aa[i+1][0] or bb[i][0]==bb[i+1][0]: print(\"Yes\"),sys.exit()\n- if bb[i][0]>=aa[i+1][0]: print(\"Yes\"),sys.exit()\n+ if aa[i][0]==aa[i+1][0] or bb[i][0]==bb[i+1][0]:\n+ print(\"Yes\")\n+ sys.exit()\n+\n+for i in range(1,N):\n+ if aa[i][0]<=bb[i-1][0]:\n+ print(\"Yes\")\n+ sys.exit()\n \n \n-dicb={}\n+dic={}\n for i in range(N):\n- dicb[bb[i][0]]=i\n+ dic[aa[i][0]]=i\n \n+inij=1\n+cycle=1\n+j=inij\n \n-tmp=1\n-j=0\n-print(dicb)\n+while True:\n+ j=dic[a[j]]\n+ if j==inij:\n+ break\n+ cycle+=1\n \n-while tmpbb[i][0]: print(\"No\"),sys.exit()\n \n \n for i in range(N-1):\n if aa[i][0]==aa[i+1][0] or bb[i][0]==bb[i+1][0]: print(\"Yes\"),sys.exit()\n if bb[i][0]>=aa[i+1][0]: print(\"Yes\"),sys.exit()\n \n \n dicb={}\n for i in range(N):\n dicb[bb[i][0]]=i\n \n \n tmp=1\n j=0\n-print(dicb)\n \n while tmp=cnt[c[1]]:\n print('Yes')\n else:\n print('No')\nif len(b)==3:\n if c[0]==0:\n print('No')\n elif cnt[c[0]]==cnt[c[1]]==cnt[c[2]] and c[0]^c[1]==c[2]:\n print('Yes')\n else:\n print('No')\nif len(b)>3:\n print('No')\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563157256", "date2": "1563160017", "bleu_score": "0.6946770140897192", "code1_test_status": [1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0], "code1_test_score": 20, "total_score": 58, "input": "4\n1 4 1 -1\n", "actual_output": "no output\n", "expected_output": "No\n\n", "anno_code": ["import collections\nn=input() # (0): n=4\na=list(map(int,input().split())) # (1): a=[1, 4, 1, -1]\nb=set(a) # (2): b={1, 4, -1}\nc=list(b) # (3): c=[1, 4, -1]\nc.sort() # (4): c=[-1, 1, 4]\ncnt=collections.Counter(a) # (5): cnt=Counter({1: 2, 4: 1, -1: 1})\nif len(b)==1: # (6): NO CHANGE\n if c[0]==0:\n print('Yes')\nif len(b)==2: # (7): NO CHANGE\n if c[0]==0 and cnt[1]%2==0:\n print('Yes')\nif len(b)==3: # (8): NO CHANGE\n if cnt[c[0]]==cnt[c[1]]==cnt[c[2]]:\n if c[0]^c[1]==c[2]:\n print('Yes')\nelse:\n print('No')\n"], "anno_status": [true], "diff_content": " import collections\n n=input()\n a=list(map(int,input().split()))\n b=set(a)\n c=list(b)\n c.sort()\n cnt=collections.Counter(a)\n if len(b)==1:\n if c[0]==0:\n print('Yes')\n+ else:\n+ print('No')\n if len(b)==2:\n- if c[0]==0 and cnt[1]%2==0:\n+ if c[0]==0 and cnt[c[1]]%2==0 and cnt[c[0]]*2>=cnt[c[1]]:\n print('Yes')\n+ else:\n+ print('No')\n if len(b)==3:\n- if cnt[c[0]]==cnt[c[1]]==cnt[c[2]]:\n- if c[0]^c[1]==c[2]:\n- print('Yes')\n-else:\n+ if c[0]==0:\n+ print('No')\n+ elif cnt[c[0]]==cnt[c[1]]==cnt[c[2]] and c[0]^c[1]==c[2]:\n+ print('Yes')\n+ else:\n+ print('No')\n+if len(b)>3:\n print('No')\n \n", "FL_content": "\n import collections\n n=input()\n a=list(map(int,input().split()))\n b=set(a)\n c=list(b)\n c.sort()\n cnt=collections.Counter(a)\n if len(b)==1:\n if c[0]==0:\n- print('Yes')\n if len(b)==2:\n if c[0]==0 and cnt[1]%2==0:\n- print('Yes')\n if len(b)==3:\n if cnt[c[0]]==cnt[c[1]]==cnt[c[2]]:\n if c[0]^c[1]==c[2]:\n- print('Yes')\n else:\n- print('No')\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u721970149", "problem_id": "p03730", "submission1_id": "s276038000-FL", "submission2_id": "s756371860", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, C = map(int,input().split())\n\nans = \"No\"\n\nfor i in range(1,B+1) :\n if (A*i)%B == C :\n ans = \"Yes\"\n\nprint(ans)\n", "code2": "A, B, C = map(int,input().split())\n\nans = \"NO\"\n\nfor i in range(1,B+1) :\n if (A*i)%B == C :\n ans = \"YES\"\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582403615", "date2": "1582403646", "bleu_score": "0.9514641493683826", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 92, "input": "1 010 2\n", "actual_output": "Yes\n", "expected_output": "YES\n\n", "anno_code": ["A, B, C = map(int,input().split()) # (0): A=1, B=10, C=2\n\nans = \"No\" # (1): ans=No\n\nfor i in range(1,B+1) : # (2): i=1 (4): i=2 ... (23): NO CHANGE\n if (A*i)%B == C : # (3): NO CHANGE (5): NO CHANGE ... (22): NO CHANGE\n ans = \"Yes\" # (6): ans=Yes\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " A, B, C = map(int,input().split())\n \n-ans = \"No\"\n+ans = \"NO\"\n \n for i in range(1,B+1) :\n if (A*i)%B == C :\n- ans = \"Yes\"\n+ ans = \"YES\"\n \n print(ans)\n \n", "FL_content": "\n A, B, C = map(int,input().split())\n \n-ans = \"No\"\n-\n for i in range(1,B+1) :\n if (A*i)%B == C :\n- ans = \"Yes\"\n \n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u494314211", "problem_id": "p02408", "submission1_id": "s646322857-FL", "submission2_id": "s196943809", "status1": "Wrong Answer", "status2": "Accepted", "code1": "l=[]\nfor mark in [\"S\",\"H\",\"C\",\"D\"]:\n\tfor i in range(1,14):\n\t\tl.append(mark+\" \"+str(i))\nprint(l)\nn=input()\nfor i in range(int(n)):\n\tl.remove(input())\nfor i in l[:-1]:\n\tprint(i)\nprint(l[-1],end=\"\")", "code2": "l=[]\nfor mark in [\"S\",\"H\",\"C\",\"D\"]:\n\tfor i in range(1,14):\n\t\tl.append(mark+\" \"+str(i))\nn=input()\nfor i in range(int(n)):\n\tl.remove(input())\nfor i in l:\n\tprint(i)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1481413573", "date2": "1481413734", "bleu_score": "0.8006569231426618", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "47\nS 10\nS 11\nS 12\nS 13\nH 1\nH 2\nS 6\nS 7\nS 8\nS 9\nH 6\nH 8\nH 9\nH 3\nH 11\nH 4\nH 5\nS 2\nS 3\nS 4\nS 5\nH 12\nH 13\nC 1\nC 2\nD 1\nD 2\nD 3\nD 4\nD 5\nD 6\nD 7\nC 3\nC 4\nC 5\nC 6\nC 7\nC 8\nC 9\nC 10\nC 11\nC 13\nD 9\nD 10\nD 11\nD 12\nD 13\n", "actual_output": "['S 1', 'S 2', 'S 3', 'S 4', 'S 5', 'S 6', 'S 7', 'S 8', 'S 9', 'S 10', 'S 11', 'S 12', 'S 13', 'H 1', 'H 2', 'H 3', 'H 4', 'H 5', 'H 6', 'H 7', 'H 8', 'H 9', 'H 10', 'H 11', 'H 12', 'H 13', 'C 1', 'C 2', 'C 3', 'C 4', 'C 5', 'C 6', 'C 7', 'C 8', 'C 9', 'C 10', 'C 11', 'C 12', 'C 13', 'D 1', 'D 2', 'D 3', 'D 4', 'D 5', 'D 6', 'D 7', 'D 8', 'D 9', 'D 10', 'D 11', 'D 12', 'D 13']\nS 1\nH 7\nH 10\nC 12\nD 8", "expected_output": "S 1\nH 7\nH 10\nC 12\nD 8\n\n", "anno_code": ["l=[] # (0): l=[]\nfor mark in [\"S\",\"H\",\"C\",\"D\"]: # (1): mark=S (29): mark=H ... (113): NO CHANGE\n\tfor i in range(1,14): # (2): i=1 (4): i=2 ... (112): NO CHANGE\n\t\tl.append(mark+\" \"+str(i)) # (3): l=['S 1'] (5): l=['S 1', 'S 2'] ... (111): l=[S 1, S 2, ..., D 12, D 13]\nprint(l) # (114): NO CHANGE\nn=input() # (115): n=47\nfor i in range(int(n)): # (116): i=0 (118): i=1 ... (210): NO CHANGE\n\tl.remove(input()) # (117): l=[S 1, S 2, ..., D 12, D 13] (119): l=[S 1, S 2, ..., D 12, D 13] ... (209): l=['S 1', 'H 7', 'H 10', 'C 12', 'D 8']\nfor i in l[:-1]: # (211): i=S 1 (213): i=H 7 ... (219): NO CHANGE\n\tprint(i) # (212): NO CHANGE (214): NO CHANGE ... (218): NO CHANGE\nprint(l[-1],end=\"\")"], "anno_status": [true], "diff_content": " l=[]\n for mark in [\"S\",\"H\",\"C\",\"D\"]:\n \tfor i in range(1,14):\n \t\tl.append(mark+\" \"+str(i))\n-print(l)\n n=input()\n for i in range(int(n)):\n \tl.remove(input())\n-for i in l[:-1]:\n+for i in l:\n \tprint(i)\n-print(l[-1],end=\"\")\n", "FL_content": "\n l=[]\n for mark in [\"S\",\"H\",\"C\",\"D\"]:\n \tfor i in range(1,14):\n \t\tl.append(mark+\" \"+str(i))\n-print(l)\n n=input()\n for i in range(int(n)):\n \tl.remove(input())\n for i in l[:-1]:\n \tprint(i)\n print(l[-1],end=\"\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u578489732", "problem_id": "p03338", "submission1_id": "s713744596-FL", "submission2_id": "s993432441", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nfrom functools import reduce\n\n\n\ndef solve(lines):\n def func(n, i, initializer=0):\n a = set(S[:i])\n b = set(S[i:])\n return max( n, len(a & b) )\n\n N = int(lines.pop(0))\n S = lines.pop(0)\n\n print( reduce( func, range(1,N) ) )\n\n\n\n\nlines = [x.strip() for x in sys.stdin.readlines()]\n\n\n\n\nsolve(lines)", "code2": "\nimport sys\nfrom functools import reduce\n\n\n\ndef solve(lines):\n def func(n, i):\n a = set(S[:i])\n b = set(S[i:])\n return max( n, len(a & b) )\n\n N = int(lines.pop(0))\n S = lines.pop(0)\n\n print( reduce( func, range(1,N), 0 ) )\n\n\n\n\nlines = [x.strip() for x in sys.stdin.readlines()]\n\n\n\n\nsolve(lines)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549596144", "date2": "1549596614", "bleu_score": "0.9490727005320709", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "6\nb`^dca\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["\nimport sys\nfrom functools import reduce\n\n\n\ndef solve(lines): # (0): solve=\n def func(n, i, initializer=0): # (3): func=.func at 0x000001AD8BEE9B40>\n a = set(S[:i]) # (7): a={'b', '`'} (9): a={'b', '^', '`'} ... (13): a={'c', '^', '`', 'd', 'b'}\n b = set(S[i:]) # (8): i=3 (10): i=4 (12): i=5\n return max( n, len(a & b) )\n\n N = int(lines.pop(0)) # (4): lines=['b`^dca'], N=6\n S = lines.pop(0) # (5): lines=[], S=b`^dca\n\n print( reduce( func, range(1,N) ) ) # (6): n=1, i=2, initializer=0\n\n\n\n\nlines = [x.strip() for x in sys.stdin.readlines()] # (1): lines=['6', 'b`^dca']\n\n\n\n\nsolve(lines) # (2): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n import sys\n from functools import reduce\n \n \n \n def solve(lines):\n- def func(n, i, initializer=0):\n+ def func(n, i):\n a = set(S[:i])\n b = set(S[i:])\n return max( n, len(a & b) )\n \n N = int(lines.pop(0))\n S = lines.pop(0)\n \n- print( reduce( func, range(1,N) ) )\n+ print( reduce( func, range(1,N), 0 ) )\n \n \n \n \n lines = [x.strip() for x in sys.stdin.readlines()]\n \n \n \n \n solve(lines)\n", "FL_content": "\n \n import sys\n from functools import reduce\n \n \n \n def solve(lines):\n def func(n, i, initializer=0):\n- a = set(S[:i])\n- b = set(S[i:])\n return max( n, len(a & b) )\n \n N = int(lines.pop(0))\n S = lines.pop(0)\n \n print( reduce( func, range(1,N) ) )\n \n \n \n \n lines = [x.strip() for x in sys.stdin.readlines()]\n \n \n \n \n solve(lines)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 26 }, { "user_id": "u189023301", "problem_id": "p03419", "submission1_id": "s153718765-FL", "submission2_id": "s459259784", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m = map(int, input().split())\nif n <= 1 or m <= 1:\n print(max(n-2, m-2, 0))\nelse:\n print((n-2)*(m-2))", "code2": "n,m = map(int, input().split())\nif n == 1 and m==1:\n print(1)\nelif n == 1 or m == 1:\n print(max(n-2, m-2, 0))\nelse:\n print((n-2)*(m-2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568252683", "date2": "1568253200", "bleu_score": "0.7212172748297971", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 69, "total_score": 78, "input": "115 0\n", "actual_output": "113\n", "expected_output": "-226\n\n", "anno_code": ["n,m = map(int, input().split()) # (0): n=115, m=0\nif n <= 1 or m <= 1: # (1): NO CHANGE\n print(max(n-2, m-2, 0))\nelse:\n print((n-2)*(m-2))"], "anno_status": [true], "diff_content": " n,m = map(int, input().split())\n-if n <= 1 or m <= 1:\n+if n == 1 and m==1:\n+ print(1)\n+elif n == 1 or m == 1:\n print(max(n-2, m-2, 0))\n else:\n print((n-2)*(m-2))\n", "FL_content": "\n n,m = map(int, input().split())\n if n <= 1 or m <= 1:\n- print(max(n-2, m-2, 0))\n else:\n- print((n-2)*(m-2))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u423585790", "problem_id": "p04008", "submission1_id": "s749965836-FL", "submission2_id": "s321934376", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(10**6)\nn,k = map(int,input().split())\na = [int(i)-1 for i in input().split()]\nedg = [[] for i in range(n)]\nfor i in range(1,n):\n edg[a[i]].append(i)\nans = [0] * n\nans[0] = a[0] != 0\ndef dfs(now):\n res = 0\n for e in edg[now]:\n res = max(res, dfs(e)+1)\n if res == k - 1 and a[now] != 0:\n ans[now] = 1\n res = 0\n return res\n \ndfs(0)\nprint(sum(ans))\n", "code2": "import sys\nsys.setrecursionlimit(10**6)\nn,k = map(int,input().split())\na = [int(i)-1 for i in input().split()]\nedg = [[] for i in range(n)]\nfor i in range(1,n):\n edg[a[i]].append(i)\nans = [0] * n\nans[0] = a[0] != 0\ndef dfs(now):\n res = 0\n for e in edg[now]:\n res = max(res, dfs(e)+1)\n if res == k - 1 and a[now] != 0:\n ans[now] = 1\n res = -1\n return res\n \ndfs(0)\nprint(sum(ans))\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1590166000", "date2": "1590166300", "bleu_score": "0.991160658072406", "code1_test_status": [1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 85, "total_score": 97, "input": "8 2\n4 1 4 5 1 1 1 3\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["import sys\nsys.setrecursionlimit(10**6) # (0): NO CHANGE\nn,k = map(int,input().split()) # (1): n=8, k=2\na = [int(i)-1 for i in input().split()] # (2): a=[3, 0, 3, 4, 0, 0, 0, 2]\nedg = [[] for i in range(n)] # (3): edg\nfor i in range(1,n): # (4): i=1 (6): edg, i=2 ... (18): edg\n edg[a[i]].append(i) # (5): edg (7): edg ... (17): edg\nans = [0] * n # (19): edg, ans=[0, 0, 0, 0, 0, 0, 0, 0]\nans[0] = a[0] != 0 # (20): edg, ans=[True, 0, 0, 0, 0, 0, 0, 0]\ndef dfs(now): # (21): edg, dfs=\n res = 0 # (23): res=0 (26): res=0 ... (60): res=0\n for e in edg[now]: # (24): e=1 (27): NO CHANGE ... (63): NO CHANGE\n res = max(res, dfs(e)+1) # (25): now=1 (30): now=4 ... (59): now=6\n if res == k - 1 and a[now] != 0: # (28): now=0, res=1, e=1 (42): now=2, res=1, e=7 ... (64): sys=, n=8, k=2, a=[3, 0, 3, 4, 0, 0, 0, 2], edg=[[1, 4, 5, 6], [], [7], [2], [3], [], [], []], i=7, ans=[True, 0, 1, 1, 0, 0, 0, 0], dfs=\n ans[now] = 1 # (45): NO CHANGE (49): NO CHANGE\n res = 0 # (46): now=3, e=2 (50): now=4, e=3\n return res\n \ndfs(0) # (22): now=0\nprint(sum(ans))\n"], "anno_status": [true], "diff_content": " import sys\n sys.setrecursionlimit(10**6)\n n,k = map(int,input().split())\n a = [int(i)-1 for i in input().split()]\n edg = [[] for i in range(n)]\n for i in range(1,n):\n edg[a[i]].append(i)\n ans = [0] * n\n ans[0] = a[0] != 0\n def dfs(now):\n res = 0\n for e in edg[now]:\n res = max(res, dfs(e)+1)\n if res == k - 1 and a[now] != 0:\n ans[now] = 1\n- res = 0\n+ res = -1\n return res\n \n dfs(0)\n print(sum(ans))\n \n", "FL_content": "\n import sys\n sys.setrecursionlimit(10**6)\n n,k = map(int,input().split())\n a = [int(i)-1 for i in input().split()]\n edg = [[] for i in range(n)]\n for i in range(1,n):\n edg[a[i]].append(i)\n ans = [0] * n\n-ans[0] = a[0] != 0\n def dfs(now):\n res = 0\n for e in edg[now]:\n res = max(res, dfs(e)+1)\n if res == k - 1 and a[now] != 0:\n ans[now] = 1\n res = 0\n return res\n \n dfs(0)\n print(sum(ans))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 21 }, { "user_id": "u925814846", "problem_id": "p02843", "submission1_id": "s564408235-FL", "submission2_id": "s135099771", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nleft = n\nn = n%100\npay = 0\nchance = 0\nfor i in range(5, 0,-1):\n\tpay+=n\n\tchance+=(n%i)\n\tn=n/i\n\nif payNone:\n W, H, N = map(int, input().split())\n range_N = range(N)\n xl, xr, yd, yu = 0, W, 0, H\n for i in range_N:\n x, y, a = map(int, input().split())\n if a == 1:\n xl = max(x, xl)\n if a == 2:\n xr = min(x, xr)\n if a == 3:\n yd = max(y, yd)\n else:\n yu = min(y, yu)\n if xl >= xr or yd >= yu:\n print(0)\n else:\n print((xr - xl) * (yu - yd))\n\nif __name__ == \"__main__\":\n main()", "code2": "\n\n\ndef main()->None:\n W, H, N = map(int, input().split())\n range_N = range(N)\n xl, xr, yd, yu = 0, W, 0, H\n for i in range_N:\n x, y, a = map(int, input().split())\n if a == 1:\n xl = max(x, xl)\n elif a == 2:\n xr = min(x, xr)\n elif a == 3:\n yd = max(y, yd)\n else:\n yu = min(y, yu)\n if xl >= xr or yd >= yu:\n print(0)\n else:\n print((xr - xl) * (yu - yd))\n\nif __name__ == \"__main__\":\n main()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576019980", "date2": "1576020647", "bleu_score": "0.9859373947289705", "code1_test_status": [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0], "code1_test_score": 50, "total_score": 103, "input": "5 2 3\n2 0 3\n3 11 2\n2 0 1\n", "actual_output": "0\n", "expected_output": "2\n\n", "anno_code": ["\n\n\ndef main()->None: # (0): main=\n W, H, N = map(int, input().split())\n range_N = range(N)\n xl, xr, yd, yu = 0, W, 0, H\n for i in range_N:\n x, y, a = map(int, input().split())\n if a == 1:\n xl = max(x, xl)\n if a == 2:\n xr = min(x, xr)\n if a == 3:\n yd = max(y, yd)\n else:\n yu = min(y, yu)\n if xl >= xr or yd >= yu:\n print(0)\n else:\n print((xr - xl) * (yu - yd))\n\nif __name__ == \"__main__\":\n main()"], "anno_status": [true], "diff_content": " \n \n \n def main()->None:\n W, H, N = map(int, input().split())\n range_N = range(N)\n xl, xr, yd, yu = 0, W, 0, H\n for i in range_N:\n x, y, a = map(int, input().split())\n if a == 1:\n xl = max(x, xl)\n- if a == 2:\n+ elif a == 2:\n xr = min(x, xr)\n- if a == 3:\n+ elif a == 3:\n yd = max(y, yd)\n else:\n yu = min(y, yu)\n if xl >= xr or yd >= yu:\n print(0)\n else:\n print((xr - xl) * (yu - yd))\n \n if __name__ == \"__main__\":\n main()\n", "FL_content": "\n \n \n \n def main()->None:\n W, H, N = map(int, input().split())\n range_N = range(N)\n xl, xr, yd, yu = 0, W, 0, H\n for i in range_N:\n x, y, a = map(int, input().split())\n if a == 1:\n xl = max(x, xl)\n if a == 2:\n xr = min(x, xr)\n if a == 3:\n yd = max(y, yd)\n else:\n yu = min(y, yu)\n- if xl >= xr or yd >= yu:\n print(0)\n else:\n print((xr - xl) * (yu - yd))\n \n if __name__ == \"__main__\":\n main()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u530383736", "problem_id": "p03556", "submission1_id": "s113466825-FL", "submission2_id": "s931870369", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nfrom decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\n\nN = int(input().strip())\n\nprint( int(N**(1/2)) )\n", "code2": "\nfrom decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\n\nN = int(input().strip())\n\nprint( int(N**(1/2))**2 )\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1582584320", "date2": "1582584425", "bleu_score": "0.9598415906376219", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 83, "input": "526826000\n", "actual_output": "22952\n", "expected_output": "526794304\n\n", "anno_code": [" # (0): Decimal=, ROUND_HALF_UP=ROUND_HALF_UP, ROUND_HALF_EVEN=ROUND_HALF_EVEN\nfrom decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\n\nN = int(input().strip()) # (1): N=526826000\n\nprint( int(N**(1/2)) )\n"], "anno_status": [true], "diff_content": " \n from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\n \n N = int(input().strip())\n \n-print( int(N**(1/2)) )\n+print( int(N**(1/2))**2 )\n \n", "FL_content": "\n \n from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN\n \n N = int(input().strip())\n \n-print( int(N**(1/2)) )\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u813102292", "problem_id": "p02837", "submission1_id": "s719093831-FL", "submission2_id": "s670925636", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = [dict() for _ in range(N)] \nfor i in range(N):\n a = int(input())\n for j in range(a):\n x, y = map(int, input().split())\n x -= 1\n A[i][x] = y\n\n\nres = 0\nfor i in range(1,2 ** N):\n i_bin = bin(i)[2:]\n i_bin = i_bin.zfill(N)\n p = [0] * N\n for j in range(N):\n p[j] = int(i_bin[j])\n for j in range(N):\n x = i_bin[j]\n if x == '1':\n for k, v in A[j].items():\n p[k] = v\n \n \n isPossible = True\n for j in range(N):\n if int(i_bin[j]) != p[j]: \n isPossible = False\n break\n if isPossible:\n res = max(res, sum(p))\n\nprint(res)", "code2": "N = int(input())\nA = [dict() for _ in range(N)] \nfor i in range(N):\n a = int(input())\n for j in range(a):\n x, y = map(int, input().split())\n x -= 1\n A[i][x] = y\n\n\nres = 0\nfor i in range(1,2 ** N):\n i_bin = bin(i)[2:]\n i_bin = i_bin.zfill(N)\n p = [0] * N\n for j in range(N):\n p[j] = int(i_bin[j])\n isPossible = True\n for j in range(N):\n x = i_bin[j]\n if x == '1':\n for k, v in A[j].items():\n if p[k] != v:\n isPossible = False\n break\n if isPossible:\n res = max(res, sum(p))\n\nprint(res)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1575860291", "date2": "1575860498", "bleu_score": "0.9084934785320817", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1], "code1_test_score": 94, "total_score": 103, "input": "3\n1\n3 1\n1\n1 1\n1\n1 0\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = [dict() for _ in range(N)] # (1): A=[{}, {}, {}]\nfor i in range(N): # (2): i=0 (9): i=1 ... (23): NO CHANGE\n a = int(input()) # (3): a=1 (10): NO CHANGE (17): NO CHANGE\n for j in range(a): # (4): j=0 (8): NO CHANGE ... (22): NO CHANGE\n x, y = map(int, input().split()) # (5): x=3, y=1 (12): x=1 (19): x=1, y=0\n x -= 1 # (6): x=2 (13): x=0 (20): x=0\n A[i][x] = y # (7): A=[{2: 1}, {}, {}] (14): A=[{2: 1}, {0: 1}, {}] (21): A=[{2: 1}, {0: 1}, {0: 0}]\n\n\nres = 0 # (24): res=0\nfor i in range(1,2 ** N): # (25): i=1 (59): i=2 ... (266): NO CHANGE\n i_bin = bin(i)[2:] # (26): i_bin=1 (60): i_bin=10 ... (231): i_bin=111\n i_bin = i_bin.zfill(N) # (27): i_bin=001 (61): i_bin=010 ... (232): NO CHANGE\n p = [0] * N # (28): p=[0, 0, 0] (62): p=[0, 0, 0] ... (233): p=[0, 0, 0]\n for j in range(N): # (29): NO CHANGE (31): j=1 ... (240): NO CHANGE\n p[j] = int(i_bin[j]) # (30): NO CHANGE (32): NO CHANGE ... (239): p=[1, 1, 1]\n for j in range(N): # (36): j=0 (39): j=1 ... (259): NO CHANGE\n x = i_bin[j] # (37): x=0 (40): NO CHANGE ... (254): NO CHANGE\n if x == '1': # (38): NO CHANGE (41): NO CHANGE ... (255): NO CHANGE\n for k, v in A[j].items(): # (45): k=0, v=0 (47): NO CHANGE ... (258): NO CHANGE\n p[k] = v # (46): NO CHANGE (77): p=[1, 1, 0] ... (257): p=[0, 1, 1]\n \n \n isPossible = True # (49): isPossible=True (83): NO CHANGE ... (260): isPossible=True\n for j in range(N): # (50): j=0 (52): j=1 ... (261): j=0\n if int(i_bin[j]) != p[j]: # (51): NO CHANGE (53): NO CHANGE ... (262): NO CHANGE\n isPossible = False # (86): isPossible=False (157): isPossible=False ... (263): isPossible=False\n break # (87): NO CHANGE (158): NO CHANGE ... (264): NO CHANGE\n if isPossible: # (57): NO CHANGE (88): NO CHANGE ... (265): NO CHANGE\n res = max(res, sum(p)) # (58): res=1 (125): res=2\n\nprint(res)"], "anno_status": [false], "diff_content": " N = int(input())\n A = [dict() for _ in range(N)] \n for i in range(N):\n a = int(input())\n for j in range(a):\n x, y = map(int, input().split())\n x -= 1\n A[i][x] = y\n \n \n res = 0\n for i in range(1,2 ** N):\n i_bin = bin(i)[2:]\n i_bin = i_bin.zfill(N)\n p = [0] * N\n for j in range(N):\n p[j] = int(i_bin[j])\n+ isPossible = True\n for j in range(N):\n x = i_bin[j]\n if x == '1':\n for k, v in A[j].items():\n- p[k] = v\n- \n- \n- isPossible = True\n- for j in range(N):\n- if int(i_bin[j]) != p[j]: \n- isPossible = False\n- break\n+ if p[k] != v:\n+ isPossible = False\n+ break\n if isPossible:\n res = max(res, sum(p))\n \n print(res)\n", "FL_content": "\n N = int(input())\n A = [dict() for _ in range(N)] \n for i in range(N):\n a = int(input())\n for j in range(a):\n x, y = map(int, input().split())\n x -= 1\n A[i][x] = y\n \n \n res = 0\n for i in range(1,2 ** N):\n i_bin = bin(i)[2:]\n i_bin = i_bin.zfill(N)\n p = [0] * N\n for j in range(N):\n p[j] = int(i_bin[j])\n- for j in range(N):\n- x = i_bin[j]\n- if x == '1':\n- for k, v in A[j].items():\n- p[k] = v\n- \n- \n isPossible = True\n for j in range(N):\n if int(i_bin[j]) != p[j]: \n isPossible = False\n break\n if isPossible:\n res = max(res, sum(p))\n \n print(res)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 33 }, { "user_id": "u112324182", "problem_id": "p03147", "submission1_id": "s653316953-FL", "submission2_id": "s200949660", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nh = list(map(int,input().split()))\nh.insert(0,0)\nsum = 0\nbottom = 0\nfor i, hn in enumerate(h):\n if (i == 0) :\n continue\n if (hn < h[i-1]):\n sum += (h[i-1] - bottom)\n bottom = hn\nend = bottom if h[n-1] < h[n] else 0\nprint(sum+end)", "code2": "n = int(input())\nh = list(map(int,input().split()))\nh.insert(0,0)\nsum = 0\nbottom = 0\nfor i, hn in enumerate(h):\n if (i == 0) :\n continue\n if (hn < h[i-1]):\n bottom = hn\n else:\n sum += hn - h[i-1]\nprint(sum)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1570641331", "date2": "1570643217", "bleu_score": "0.7950038985141609", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1], "code1_test_score": 46, "total_score": 99, "input": "8\n6 23 136 1 23 32 50 100\n", "actual_output": "137\n", "expected_output": "235\n\n", "anno_code": ["n = int(input()) # (0): n=8\nh = list(map(int,input().split())) # (1): h=[6, 23, 136, 1, 23, 32, 50, 100]\nh.insert(0,0) # (2): h=[0, 6, 23, 136, 1, 23, 32, 50, 100]\nsum = 0 # (3): sum=0\nbottom = 0 # (4): bottom=0\nfor i, hn in enumerate(h): # (5): i=0, hn=0 (8): i=1, hn=6 ... (34): NO CHANGE\n if (i == 0) : # (6): NO CHANGE (9): NO CHANGE ... (32): NO CHANGE\n continue # (7): NO CHANGE\n if (hn < h[i-1]): # (10): NO CHANGE (13): NO CHANGE ... (33): NO CHANGE\n sum += (h[i-1] - bottom) # (20): sum=136\n bottom = hn # (21): bottom=1\nend = bottom if h[n-1] < h[n] else 0 # (35): end=1\nprint(sum+end)"], "anno_status": [true], "diff_content": " n = int(input())\n h = list(map(int,input().split()))\n h.insert(0,0)\n sum = 0\n bottom = 0\n for i, hn in enumerate(h):\n if (i == 0) :\n continue\n if (hn < h[i-1]):\n- sum += (h[i-1] - bottom)\n bottom = hn\n-end = bottom if h[n-1] < h[n] else 0\n-print(sum+end)\n+ else:\n+ sum += hn - h[i-1]\n+print(sum)\n", "FL_content": "\n n = int(input())\n h = list(map(int,input().split()))\n h.insert(0,0)\n sum = 0\n bottom = 0\n for i, hn in enumerate(h):\n if (i == 0) :\n continue\n if (hn < h[i-1]):\n sum += (h[i-1] - bottom)\n bottom = hn\n-end = bottom if h[n-1] < h[n] else 0\n print(sum+end)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u640123177", "problem_id": "p02843", "submission1_id": "s300619417-FL", "submission2_id": "s403766811", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x = int(input())\na = 0\ni = 0\nwhile a <= x:\n a += 100\n i += 1\ny = x - 100*(a-1)\nif y <= (i-1)*a:\n print(\"1\")\nelse:\n print(\"0\")", "code2": "x = int(input())\na = 0\ni = 0\nwhile a <= x:\n a += 100\n i += 1\na -= 100\ni -= 1\ny = x - a\nif y <= i*5:\n print(\"1\")\nelse:\n print(\"0\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575254062", "date2": "1575255542", "bleu_score": "0.8494856040009963", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0], "code1_test_score": 5, "total_score": 26, "input": "152\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["x = int(input()) # (0): x=152\na = 0 # (1): a=0\ni = 0 # (2): i=0\nwhile a <= x: # (3): NO CHANGE (6): NO CHANGE (9): NO CHANGE\n a += 100 # (4): a=100 (7): a=200\n i += 1 # (5): i=1 (8): i=2\ny = x - 100*(a-1) # (10): y=-19748\nif y <= (i-1)*a: # (11): NO CHANGE\n print(\"1\")\nelse:\n print(\"0\")"], "anno_status": [true], "diff_content": " x = int(input())\n a = 0\n i = 0\n while a <= x:\n a += 100\n i += 1\n-y = x - 100*(a-1)\n-if y <= (i-1)*a:\n+a -= 100\n+i -= 1\n+y = x - a\n+if y <= i*5:\n print(\"1\")\n else:\n print(\"0\")\n+\n", "FL_content": "\n x = int(input())\n a = 0\n i = 0\n-while a <= x:\n a += 100\n i += 1\n y = x - 100*(a-1)\n if y <= (i-1)*a:\n print(\"1\")\n else:\n print(\"0\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u564398841", "problem_id": "p02237", "submission1_id": "s975217761-FL", "submission2_id": "s776458618", "status1": "Wrong Answer", "status2": "Accepted", "code1": "if __name__ == '__main__':\n N = int(input())\n matrix = [[0] * N for _ in range(N)]\n for i in matrix:\n node_info = [int(i) for i in input().split()]\n node_i = node_info[0] - 1\n if not node_info[1] == 0:\n for i in node_info[2:]:\n matrix[node_i][i-1] = 1\n [print(line) for line in matrix]", "code2": "if __name__ == '__main__':\n N = int(input())\n matrix = [['0'] * N for _ in range(N)]\n for i in matrix:\n node_info = [int(i) for i in input().split()]\n node_i = node_info[0] - 1\n if not node_info[1] == 0:\n for i in node_info[2:]:\n matrix[node_i][i - 1] = '1'\n [print(' '.join(line)) for line in matrix]", "original_language1": "Python3", "original_language2": "Python3", "date1": "1485070101", "date2": "1485070335", "bleu_score": "0.9328451896549952", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "4\n1 2 1 4\n2 1 4\n1 -1\n4 1 3\n", "actual_output": "[1, 0, 0, 1]\n[0, 0, 0, 1]\n[0, 0, 0, 0]\n[0, 0, 1, 0]\n", "expected_output": "1 0 0 1\n0 0 0 1\n0 0 0 0\n0 0 1 0\n\n", "anno_code": ["if __name__ == '__main__':\n N = int(input())\n matrix = [[0] * N for _ in range(N)]\n for i in matrix:\n node_info = [int(i) for i in input().split()]\n node_i = node_info[0] - 1\n if not node_info[1] == 0:\n for i in node_info[2:]:\n matrix[node_i][i-1] = 1\n [print(line) for line in matrix]"], "anno_status": [true], "diff_content": " if __name__ == '__main__':\n N = int(input())\n- matrix = [[0] * N for _ in range(N)]\n+ matrix = [['0'] * N for _ in range(N)]\n for i in matrix:\n node_info = [int(i) for i in input().split()]\n node_i = node_info[0] - 1\n if not node_info[1] == 0:\n for i in node_info[2:]:\n- matrix[node_i][i-1] = 1\n- [print(line) for line in matrix]\n+ matrix[node_i][i - 1] = '1'\n+ [print(' '.join(line)) for line in matrix]\n", "FL_content": "\n if __name__ == '__main__':\n N = int(input())\n matrix = [[0] * N for _ in range(N)]\n for i in matrix:\n node_info = [int(i) for i in input().split()]\n node_i = node_info[0] - 1\n if not node_info[1] == 0:\n for i in node_info[2:]:\n matrix[node_i][i-1] = 1\n- [print(line) for line in matrix]\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u333731247", "problem_id": "p02843", "submission1_id": "s759836275-FL", "submission2_id": "s298902635", "status1": "Wrong Answer", "status2": "Accepted", "code1": "X=int(input())\n\nh_num=int(X/100)\nx_s=int(X%100)\n\nans=int(x_s/5)+1\n\nif ans<=h_num:\n print(1)\nelse:\n print(0)", "code2": "X=int(input())\n\nh_num=int(X/100)\nx_s=int(X%100)\n\nans=int(x_s/5)+1\n\nif X%105==0:\n print(1)\nelif ans<=h_num:\n print(1)\nelse:\n print(0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575253751", "date2": "1575253945", "bleu_score": "0.7992686407266096", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 25, "total_score": 26, "input": "420\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["X=int(input()) # (0): X=420\n\nh_num=int(X/100) # (1): h_num=4\nx_s=int(X%100) # (2): x_s=20\n\nans=int(x_s/5)+1 # (3): ans=5\n\nif ans<=h_num: # (4): NO CHANGE\n print(1)\nelse:\n print(0)"], "anno_status": [true], "diff_content": " X=int(input())\n \n h_num=int(X/100)\n x_s=int(X%100)\n \n ans=int(x_s/5)+1\n \n-if ans<=h_num:\n+if X%105==0:\n+ print(1)\n+elif ans<=h_num:\n print(1)\n else:\n print(0)\n", "FL_content": "\n X=int(input())\n \n h_num=int(X/100)\n-x_s=int(X%100)\n \n-ans=int(x_s/5)+1\n \n if ans<=h_num:\n print(1)\n else:\n print(0)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u019053283", "problem_id": "p02830", "submission1_id": "s592463982-FL", "submission2_id": "s852585853", "status1": "Wrong Answer", "status2": "Accepted", "code1": "RESULT = \"\"\nN = int(input())\nS,T=str(input()).split()\nfor i in S:\n RESULT += i\n for v in T:\n RESULT += v\n break\n\nprint(RESULT)", "code2": "RESULT = \"\"\nN = int(input())\nS,T=str(input()).split()\nfor i in range(len(S)):\n RESULT += S[i]\n RESULT += T[i]\nprint(RESULT)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577068437", "date2": "1577069014", "bleu_score": "0.7844138604833146", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 14, "total_score": 103, "input": "5\nac`b` aab`b\n", "actual_output": "aaca`aba`a\n", "expected_output": "aaca`bb``b\n\n", "anno_code": ["RESULT = \"\" # (0): RESULT=\nN = int(input()) # (1): N=5\nS,T=str(input()).split() # (2): S=ac`b`, T=aab`b\nfor i in S: # (3): i=a (8): i=c ... (28): NO CHANGE\n RESULT += i # (4): RESULT=a (9): RESULT=aac ... (24): RESULT=aaca`aba`\n for v in T: # (5): v=a (10): NO CHANGE ... (25): NO CHANGE\n RESULT += v # (6): RESULT=aa (11): RESULT=aaca ... (26): RESULT=aaca`aba`a\n break # (7): NO CHANGE (12): NO CHANGE ... (27): NO CHANGE\n\nprint(RESULT)"], "anno_status": [true], "diff_content": " RESULT = \"\"\n N = int(input())\n S,T=str(input()).split()\n-for i in S:\n- RESULT += i\n- for v in T:\n- RESULT += v\n- break\n-\n+for i in range(len(S)):\n+ RESULT += S[i]\n+ RESULT += T[i]\n print(RESULT)\n", "FL_content": "\n RESULT = \"\"\n N = int(input())\n S,T=str(input()).split()\n for i in S:\n RESULT += i\n- for v in T:\n- RESULT += v\n- break\n \n print(RESULT)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u217703215", "problem_id": "p01102", "submission1_id": "s641451662-FL", "submission2_id": "s029593510", "status1": "Wrong Answer", "status2": "Accepted", "code1": "ans=[]\nwhile 1:\n s1=input().split('\"')\n if s1==[\".\"]: break\n s2=input().split('\"')\n if len(s1)!=len(s2):\n ans.append(\"DIFFERENT\")\n continue\n else:\n cnt=0\n for i in range(len(s1)):\n if s1[i]!=s2[i]:\n cnt+=1\n else: pass\n if cnt==0:\n ans.append(\"IDENTICAL\")\n elif cnt==1:\n ans.append(\"CLOSE\")\n else: \n ans.append(\"DIFFERENT\")\nfor i in range(len(ans)):\n print(ans[i])\n\n", "code2": "ans=[]\nwhile 1:\n s1=input().split('\"')\n if s1==[\".\"]: break\n s2=input().split('\"')\n if len(s1)!=len(s2):\n ans.append(\"DIFFERENT\")\n continue\n else:\n cnt=0\n flag=0\n for i in range(len(s1)):\n if s1[i]!=s2[i]:\n if i%2==0:\n ans.append(\"DIFFERENT\")\n flag=1\n break\n else:\n cnt+=1\n else: pass\n if flag==1:\n continue\n else: pass\n if cnt==0:\n ans.append(\"IDENTICAL\")\n elif cnt==1:\n ans.append(\"CLOSE\")\n else: \n ans.append(\"DIFFERENT\")\n\nfor i in range(len(ans)):\n print(ans[i])\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526614502", "date2": "1526889066", "bleu_score": "0.6884842588164952", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0], "code1_test_score": 26, "total_score": 101, "input": "print\"hello\";print133\nprint\"hello\";qrint123\nread\"B1input\";somve;output;\n;tuptuo;evlos;\"2B\"daer\nread\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"\"\"\"\"\"\"\"\n\"\"#\"\"25\"!\"\nslow\"progr\"ma\nfast\"cod\"e\n\"surer\"fast\"progpam\"\n\"super\"faster\"prohram\"\nX\"\"\nY\nI\"S\"\"CREAM\"\nI\"CE\"\"BREAM\"\n11\"12\"11\n13\"3\"111\n.\n", "actual_output": "CLOSE\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\n", "expected_output": "DIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\nDIFFERENT\n\n", "anno_code": ["ans=[] # (0): ans=[]\nwhile 1: # (1): NO CHANGE (20): NO CHANGE ... (166): NO CHANGE\n s1=input().split('\"') # (2): s1=['print', 'hello', ';print133'] (21): s1=['read', 'B1input', ';somve;output;'] ... (167): s1=['.']\n if s1==[\".\"]: break # (3): NO CHANGE (22): NO CHANGE ... (168): NO CHANGE\n s2=input().split('\"') # (4): s2=['print', 'hello', ';qrint123'] (23): s2=[';tuptuo;evlos;', '2B', 'daer'] ... (150): s2=['13', '3', '111']\n if len(s1)!=len(s2): # (5): NO CHANGE (24): NO CHANGE ... (151): NO CHANGE\n ans.append(\"DIFFERENT\") # (69): ans=['CLOSE', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT'] (120): ans=['CLOSE', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT']\n continue # (70): NO CHANGE (121): NO CHANGE\n else:\n cnt=0 # (6): cnt=0 (25): cnt=0 ... (152): cnt=0\n for i in range(len(s1)): # (7): i=0 (10): i=1 ... (162): NO CHANGE\n if s1[i]!=s2[i]: # (8): NO CHANGE (11): NO CHANGE ... (160): NO CHANGE\n cnt+=1 # (15): cnt=1 (28): cnt=1 ... (161): cnt=3\n else: pass # (9): NO CHANGE (12): NO CHANGE ... (142): NO CHANGE\n if cnt==0: # (17): NO CHANGE (36): NO CHANGE ... (163): NO CHANGE\n ans.append(\"IDENTICAL\")\n elif cnt==1: # (18): NO CHANGE (37): NO CHANGE ... (164): NO CHANGE\n ans.append(\"CLOSE\") # (19): ans=['CLOSE']\n else: \n ans.append(\"DIFFERENT\") # (38): ans=['CLOSE', 'DIFFERENT'] (63): ans=['CLOSE', 'DIFFERENT', 'DIFFERENT'] ... (165): ans=['CLOSE', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT', 'DIFFERENT']\nfor i in range(len(ans)): # (169): i=0 (171): i=1 ... (185): i=8\n print(ans[i]) # (170): NO CHANGE (172): NO CHANGE ... (186): NO CHANGE\n\n"], "anno_status": [false], "diff_content": " ans=[]\n while 1:\n s1=input().split('\"')\n if s1==[\".\"]: break\n s2=input().split('\"')\n if len(s1)!=len(s2):\n ans.append(\"DIFFERENT\")\n continue\n else:\n cnt=0\n+ flag=0\n for i in range(len(s1)):\n if s1[i]!=s2[i]:\n- cnt+=1\n+ if i%2==0:\n+ ans.append(\"DIFFERENT\")\n+ flag=1\n+ break\n+ else:\n+ cnt+=1\n else: pass\n+ if flag==1:\n+ continue\n+ else: pass\n if cnt==0:\n ans.append(\"IDENTICAL\")\n elif cnt==1:\n ans.append(\"CLOSE\")\n else: \n ans.append(\"DIFFERENT\")\n+\n for i in range(len(ans)):\n print(ans[i])\n \n-\n", "FL_content": "\n ans=[]\n while 1:\n s1=input().split('\"')\n if s1==[\".\"]: break\n s2=input().split('\"')\n if len(s1)!=len(s2):\n ans.append(\"DIFFERENT\")\n continue\n else:\n cnt=0\n for i in range(len(s1)):\n if s1[i]!=s2[i]:\n cnt+=1\n else: pass\n if cnt==0:\n ans.append(\"IDENTICAL\")\n elif cnt==1:\n- ans.append(\"CLOSE\")\n else: \n ans.append(\"DIFFERENT\")\n for i in range(len(ans)):\n print(ans[i])\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u603049633", "problem_id": "p02368", "submission1_id": "s943261356-FL", "submission2_id": "s555526634", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nsys.setrecursionlimit(100000)\n\nV,E = map(int, input().split())\n\nD1 = [[] for _ in range(V)]\nD2 = [[] for _ in range(V)]\nfor _ in range(E):\n s,t = map(int, input().split())\n D1[s].append(t)\n D2[t].append(s)\n\nstuck = []\ncolor = [0 for _ in range(V)]\ndef dfs1(s):\n color[s] = 1\n for next in D1[s]:\n if color[next] == 0:\n dfs1(next)\n stuck.append(s)\n return\n\ndfs1(0)\n\ncolor = [0 for _ in range(V)]\ndef dfs2(s, cnt):\n color[s] = cnt\n for next in D2[s]:\n if color[next] == 0:\n dfs2(next, cnt)\n return\n\nstuck = stuck[::-1]\ncnt = 0\nfor i in stuck:\n if color[i] == 0:\n cnt += 1\n dfs2(i, cnt)\n\nQ = int(input())\nfor _ in range(Q):\n u,v = map(int, input().split())\n if color[u] == color[v]:\n print(1)\n else: print(0)", "code2": "import sys\nsys.setrecursionlimit(100000)\n\nV,E = map(int, input().split())\n\nD1 = [[] for _ in range(V)]\nD2 = [[] for _ in range(V)]\nfor _ in range(E):\n s,t = map(int, input().split())\n D1[s].append(t)\n D2[t].append(s)\n\nstuck = []\ncolor = [0 for _ in range(V)]\ndef dfs1(s):\n color[s] = 1\n for next in D1[s]:\n if color[next] == 0:\n dfs1(next)\n stuck.append(s)\n return\n\nfor i in range(V):\n if color[i] == 0:\n dfs1(i)\n\ncolor = [0 for _ in range(V)]\ndef dfs2(s, cnt):\n color[s] = cnt\n for next in D2[s]:\n if color[next] == 0:\n dfs2(next, cnt)\n return\n\nstuck = stuck[::-1]\ncnt = 0\nfor i in stuck:\n if color[i] == 0:\n cnt += 1\n dfs2(i, cnt)\n\nQ = int(input())\nfor _ in range(Q):\n u,v = map(int, input().split())\n if color[u] == color[v]:\n print(1)\n else: print(0)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1497945103", "date2": "1497945388", "bleu_score": "0.9387605608351347", "code1_test_status": [1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1], "code1_test_score": 42, "total_score": 101, "input": "9 6\n1 1\n1 0\n1 4\n2 4\n4 3\n4 2\n4\n1 1\n-1 3\n2 -1\n3 4\n", "actual_output": "1\n1\n1\n1\n", "expected_output": "1\n0\n0\n0\n\n", "anno_code": ["import sys\nsys.setrecursionlimit(100000) # (0): NO CHANGE\n\nV,E = map(int, input().split()) # (1): V=9, E=6\n\nD1 = [[] for _ in range(V)] # (2): D1\nD2 = [[] for _ in range(V)] # (3): D2\nfor _ in range(E): # (4): _=0 (8): D1=[[], [1], [], [], [], [], [], [], []], D2, _=1 ... (28): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2\n s,t = map(int, input().split()) # (5): s=1, t=1 (9): D1=[[], [1], [], [], [], [], [], [], []], D2=[[], [1], [], [], [], [], [], [], []], t=0 ... (25): D1=[[], [1, 0, 4], [4], [], [3], [], [], [], []], D2, t=2\n D1[s].append(t) # (6): D1 (10): D1, D2 ... (26): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2\n D2[t].append(s) # (7): D1=[[], [1], [], [], [], [], [], [], []], D2 (11): D1, D2 ... (27): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2\n\nstuck = [] # (29): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, stuck=[]\ncolor = [0 for _ in range(V)] # (30): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, color=[0, 0, 0, 0, 0, 0, 0, 0, 0]\ndef dfs1(s): # (31): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, dfs1=\n color[s] = 1 # (33): NO CHANGE\n for next in D1[s]: # (34): NO CHANGE\n if color[next] == 0:\n dfs1(next)\n stuck.append(s) # (35): NO CHANGE\n return # (36): sys=, V=9, E=6, D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2=[[1], [1], [4], [4], [1, 2], [], [], [], []], _=5, s=4, t=2, stuck=[0], color=[1, 0, 0, 0, 0, 0, 0, 0, 0], dfs1=\n\ndfs1(0) # (32): s=0\n\ncolor = [0 for _ in range(V)] # (37): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, color=[0, 0, 0, 0, 0, 0, 0, 0, 0]\ndef dfs2(s, cnt): # (38): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, dfs2=\n color[s] = cnt # (45): NO CHANGE (49): NO CHANGE\n for next in D2[s]: # (46): next=1 (50): next=1 ... (54): NO CHANGE\n if color[next] == 0: # (47): NO CHANGE (51): NO CHANGE\n dfs2(next, cnt) # (48): s=1\n return # (53): s=0 (55): sys=, V=9, E=6, D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2=[[1], [1], [4], [4], [1, 2], [], [], [], []], _=5, s=4, t=2, stuck=[0], color=[1, 1, 0, 0, 0, 0, 0, 0, 0], dfs1=, dfs2=, i=0\n\nstuck = stuck[::-1] # (39): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2\ncnt = 0 # (40): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, cnt=0\nfor i in stuck: # (41): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, i=0 (56): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2\n if color[i] == 0: # (42): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2\n cnt += 1 # (43): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, cnt=1\n dfs2(i, cnt) # (44): s=0\n\nQ = int(input()) # (57): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, Q=4\nfor _ in range(Q): # (58): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, _=0 (62): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, _=1 ... (70): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, _=3\n u,v = map(int, input().split()) # (59): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, u=1, v=1 (63): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, u=-1, v=3 ... (71): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2, u=3, v=4\n if color[u] == color[v]: # (60): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2 (64): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2 ... (72): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2\n print(1) # (61): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2 (65): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2 ... (73): D1=[[], [1, 0, 4], [4], [], [3, 2], [], [], [], []], D2\n else: print(0)"], "anno_status": [false], "diff_content": " import sys\n sys.setrecursionlimit(100000)\n \n V,E = map(int, input().split())\n \n D1 = [[] for _ in range(V)]\n D2 = [[] for _ in range(V)]\n for _ in range(E):\n s,t = map(int, input().split())\n D1[s].append(t)\n D2[t].append(s)\n \n stuck = []\n color = [0 for _ in range(V)]\n def dfs1(s):\n color[s] = 1\n for next in D1[s]:\n if color[next] == 0:\n dfs1(next)\n stuck.append(s)\n return\n \n-dfs1(0)\n+for i in range(V):\n+ if color[i] == 0:\n+ dfs1(i)\n \n color = [0 for _ in range(V)]\n def dfs2(s, cnt):\n color[s] = cnt\n for next in D2[s]:\n if color[next] == 0:\n dfs2(next, cnt)\n return\n \n stuck = stuck[::-1]\n cnt = 0\n for i in stuck:\n if color[i] == 0:\n cnt += 1\n dfs2(i, cnt)\n \n Q = int(input())\n for _ in range(Q):\n u,v = map(int, input().split())\n if color[u] == color[v]:\n print(1)\n else: print(0)\n", "FL_content": "\n import sys\n sys.setrecursionlimit(100000)\n \n V,E = map(int, input().split())\n \n D1 = [[] for _ in range(V)]\n D2 = [[] for _ in range(V)]\n for _ in range(E):\n s,t = map(int, input().split())\n D1[s].append(t)\n D2[t].append(s)\n \n stuck = []\n color = [0 for _ in range(V)]\n def dfs1(s):\n color[s] = 1\n for next in D1[s]:\n if color[next] == 0:\n dfs1(next)\n stuck.append(s)\n return\n \n dfs1(0)\n \n color = [0 for _ in range(V)]\n def dfs2(s, cnt):\n color[s] = cnt\n for next in D2[s]:\n if color[next] == 0:\n dfs2(next, cnt)\n return\n \n stuck = stuck[::-1]\n cnt = 0\n for i in stuck:\n if color[i] == 0:\n cnt += 1\n dfs2(i, cnt)\n \n Q = int(input())\n for _ in range(Q):\n u,v = map(int, input().split())\n if color[u] == color[v]:\n print(1)\n else: print(0)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 45 }, { "user_id": "u188138642", "problem_id": "p02916", "submission1_id": "s353009705-FL", "submission2_id": "s139916689", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nans = 0\ni = -1\nfor j in range(n):\n if a[j]-1 == i+1:\n ans += c[i]\n i = a[j] - 1\n ans += b[i]\nprint(ans)\n", "code2": "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nans = 0\ni = -2\nfor j in range(n):\n if a[j]-1 == i+1:\n ans += c[i]\n i = a[j] - 1\n ans += b[i]\nprint(ans)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598488926", "date2": "1598490006", "bleu_score": "0.9897431450598241", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1], "code1_test_score": 86, "total_score": 103, "input": "2\n1 2\n10 95\n31\n", "actual_output": "167\n", "expected_output": "136\n\n", "anno_code": ["n = int(input()) # (0): n=2\na = list(map(int, input().split())) # (1): a=[1, 2]\nb = list(map(int, input().split())) # (2): b=[10, 95]\nc = list(map(int, input().split())) # (3): c=[31]\n\nans = 0 # (4): ans=0\ni = -1 # (5): i=-1\nfor j in range(n): # (6): j=0 (11): j=1 (16): NO CHANGE\n if a[j]-1 == i+1: # (7): NO CHANGE (12): NO CHANGE\n ans += c[i] # (8): ans=31 (13): ans=72\n i = a[j] - 1 # (9): i=0 (14): i=1\n ans += b[i] # (10): ans=41 (15): ans=167\nprint(ans)\n"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n c = list(map(int, input().split()))\n \n ans = 0\n-i = -1\n+i = -2\n for j in range(n):\n if a[j]-1 == i+1:\n ans += c[i]\n i = a[j] - 1\n ans += b[i]\n print(ans)\n \n", "FL_content": "\n n = int(input())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n c = list(map(int, input().split()))\n \n ans = 0\n-i = -1\n for j in range(n):\n- if a[j]-1 == i+1:\n- ans += c[i]\n- i = a[j] - 1\n- ans += b[i]\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u506587641", "problem_id": "p02830", "submission1_id": "s339377993-FL", "submission2_id": "s364839495", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ns, t = map(str, input().split())\nx= []\n\nfor i in range(n):\n\n lst = [s[i], t[i]]\n x.append(''.join(lst))", "code2": "n = int(input())\ns, t = map(str, input().split())\nx= []\n\nfor i in range(n):\n\n lst = [s[i], t[i]]\n x.append(''.join(lst))\n\nprint(''.join(x))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577294733", "date2": "1577294771", "bleu_score": "0.8675871673129381", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "2\nqk be\n", "actual_output": "no output\n", "expected_output": "qbke\n\n", "anno_code": ["n = int(input()) # (0): n=2\ns, t = map(str, input().split()) # (1): s=qk, t=be\nx= [] # (2): x=[]\n\nfor i in range(n): # (3): i=0 (6): i=1\n\n lst = [s[i], t[i]] # (4): lst=['q', 'b'] (7): lst=['k', 'e']\n x.append(''.join(lst)) # (5): x=['qb'] (8): x=['qb', 'ke']\n"], "anno_status": [true], "diff_content": " n = int(input())\n s, t = map(str, input().split())\n x= []\n \n for i in range(n):\n \n lst = [s[i], t[i]]\n x.append(''.join(lst))\n+\n+print(''.join(x))\n", "FL_content": "\n n = int(input())\n s, t = map(str, input().split())\n x= []\n \n for i in range(n):\n \n lst = [s[i], t[i]]\n x.append(''.join(lst))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u659302741", "problem_id": "p02419", "submission1_id": "s074613101-FL", "submission2_id": "s798660664", "status1": "Wrong Answer", "status2": "Accepted", "code1": "word = input().lower()\ncount = 0\nwhile True:\n line = input()\n if line == \"END_OF_TEXT\":\n break\n print(line.lower())\n words = line.lower().split()\n for w in words:\n if w == word:\n count += 1\nprint(count)", "code2": "word = input().lower()\ncount = 0\nwhile True:\n line = input()\n if line == \"END_OF_TEXT\":\n break\n words = line.lower().split()\n for w in words:\n if w == word:\n count += 1\nprint(count)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1477751765", "date2": "1477751805", "bleu_score": "0.8957519524485242", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "comquter\nNurttres computer scienuists and highlx-skilled computer engineers\nwhp will create and tiolpxe \"knowledge\" for the enw dr.a\nProvider an sutotanding ctmpuoer environment.\nEND_OF_TEXT\n", "actual_output": "nurttres computer scienuists and highlx-skilled computer engineers\nwhp will create and tiolpxe \"knowledge\" for the enw dr.a\nprovider an sutotanding ctmpuoer environment.\n0\n", "expected_output": "0\n\n", "anno_code": ["word = input().lower() # (0): word=comquter\ncount = 0 # (1): count=0\nwhile True: # (2): NO CHANGE (22): NO CHANGE ... (64): NO CHANGE\n line = input() # (3): line=Nurttres computer scienuists and highlx-skilled computer engineers (23): line=whp will create and tiolpxe \"knowledge\" for the enw dr.a ... (65): line=END_OF_TEXT\n if line == \"END_OF_TEXT\": # (4): NO CHANGE (24): NO CHANGE ... (66): NO CHANGE\n break # (67): NO CHANGE\n print(line.lower()) # (5): NO CHANGE (25): NO CHANGE (51): NO CHANGE\n words = line.lower().split() # (6): words=['nurttres', 'computer', 'scienuists', 'and', 'highlx-skilled', 'computer', 'engineers'] (26): words=['whp', 'will', 'create', 'and', 'tiolpxe', '\"knowledge\"', 'for', 'the', 'enw', 'dr.a'] (52): words=['provider', 'an', 'sutotanding', 'ctmpuoer', 'environment.']\n for w in words: # (7): w=nurttres (9): w=computer ... (63): NO CHANGE\n if w == word: # (8): NO CHANGE (10): NO CHANGE ... (62): NO CHANGE\n count += 1\nprint(count)"], "anno_status": [true], "diff_content": " word = input().lower()\n count = 0\n while True:\n line = input()\n if line == \"END_OF_TEXT\":\n break\n- print(line.lower())\n words = line.lower().split()\n for w in words:\n if w == word:\n count += 1\n print(count)\n", "FL_content": "\n word = input().lower()\n count = 0\n while True:\n line = input()\n if line == \"END_OF_TEXT\":\n break\n- print(line.lower())\n words = line.lower().split()\n for w in words:\n if w == word:\n count += 1\n print(count)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u930847736", "problem_id": "p02639", "submission1_id": "s706022455-FL", "submission2_id": "s098853308", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x = list(map(int, input().split()))\nif x[0] == 0: print(1)\nif x[1] == 0: print(2)\nif x[2] == 0: print(3)\nif x[3] == 0: print(4)\nif x[4]: print(5)", "code2": "x = list(map(int, input().split()))\nif x[0] == 0: print(1)\nif x[1] == 0: print(2)\nif x[2] == 0: print(3)\nif x[3] == 0: print(4)\nif x[4] == 0: print(5)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592458155", "date2": "1592458193", "bleu_score": "0.9561374825240697", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "1\n5\n", "expected_output": "1\n", "anno_code": ["x = list(map(int, input().split())) # (0): x=[0, 2, 3, 4, 5]\nif x[0] == 0: print(1) # (1): NO CHANGE\nif x[1] == 0: print(2) # (2): NO CHANGE\nif x[2] == 0: print(3) # (3): NO CHANGE\nif x[3] == 0: print(4) # (4): NO CHANGE\nif x[4]: print(5)"], "anno_status": [true], "diff_content": " x = list(map(int, input().split()))\n if x[0] == 0: print(1)\n if x[1] == 0: print(2)\n if x[2] == 0: print(3)\n if x[3] == 0: print(4)\n-if x[4]: print(5)\n+if x[4] == 0: print(5)\n", "FL_content": "\n x = list(map(int, input().split()))\n if x[0] == 0: print(1)\n if x[1] == 0: print(2)\n if x[2] == 0: print(3)\n if x[3] == 0: print(4)\n-if x[4]: print(5)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u252828980", "problem_id": "p03712", "submission1_id": "s834994240-FL", "submission2_id": "s558848770", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,m = map(int,input().split())\nL = []\nL.append(\"*\"*(m+2))\nfor i in range(n):\n L.append(\"*\"+input()+\"*\")\nL.append(\"*\"*(m+2))\nfor i in range(len(L)):\n print(L[i])\n", "code2": "n,m = map(int,input().split())\nL = []\nL.append(\"\nfor i in range(n):\n L.append(\"\nL.append(\"\nfor i in range(len(L)):\n print(L[i])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579028446", "date2": "1579028594", "bleu_score": "0.7474832739233186", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "1 3\ny\n", "actual_output": "*****\n*y*\n*****\n", "expected_output": "#####\n#y#\n#####\n\n", "anno_code": ["n,m = map(int,input().split()) # (0): n=1, m=3\nL = [] # (1): L=[]\nL.append(\"*\"*(m+2)) # (2): L=['*****']\nfor i in range(n): # (3): i=0 (5): NO CHANGE\n L.append(\"*\"+input()+\"*\") # (4): L=['*****', '*y*']\nL.append(\"*\"*(m+2)) # (6): L=['*****', '*y*', '*****']\nfor i in range(len(L)): # (7): NO CHANGE (9): i=1 (11): i=2\n print(L[i]) # (8): NO CHANGE (10): NO CHANGE (12): NO CHANGE\n"], "anno_status": [true], "diff_content": " n,m = map(int,input().split())\n L = []\n-L.append(\"*\"*(m+2))\n+L.append(\"\n for i in range(n):\n- L.append(\"*\"+input()+\"*\")\n-L.append(\"*\"*(m+2))\n+ L.append(\"\n+L.append(\"\n for i in range(len(L)):\n print(L[i])\n-\n", "FL_content": "\n n,m = map(int,input().split())\n L = []\n L.append(\"*\"*(m+2))\n for i in range(n):\n- L.append(\"*\"+input()+\"*\")\n L.append(\"*\"*(m+2))\n for i in range(len(L)):\n print(L[i])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u897329068", "problem_id": "p03739", "submission1_id": "s119742065-FL", "submission2_id": "s316072547", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA2 = list(map(int,input().split()))\n\n\n\ndef getSign(a):\n\tif a < 0:\n\t\treturn -1\n\telif a == 0:\n\t\treturn 0\n\telse:\n\t\treturn 1\n\ncounts = []\nfor j in range(2):\n\tA = list(A2)\n\tcount = 0\n\tsumN = A[0]\n\tbeforeSign = getSign(A[0])\n\t\n\tif j == 0:\n\t\tadd = -A[0] - beforeSign\n\t\tA[0] += add\n\t\tcount += abs(add)\n\t\n\tfor i in range(1,N):\n\t\tsumN += A[i]\n\n\t\t\n\n\t\tif 0 <= beforeSign * sumN:\n\t\t\tadd = -sumN - beforeSign\n\t\t\tA[i] += add\n\t\t\tsumN += add\n\t\t\tcount += abs(add)\n\t\t\n\t\tbeforeSign = getSign(sumN)\n\t\t\n\t\n\tcounts.append(count)\n\t\nprint(min(counts))", "code2": "N = int(input())\nA = list(map(int,input().split()))\n\n\n\ndef getSign(a):\n\tif a < 0:\n\t\treturn -1\n\telif a == 0:\n\t\treturn 0\n\telse:\n\t\treturn 1\n\ncounts = []\nfor beforeSign in [-1,1]:\n\tcount = 0\n\tsumN = 0\n\tfor i in range(N):\n\t\tsumN += A[i]\n\n\t\t\n\n\t\tif 0 <= beforeSign * sumN:\n\t\t\tadd = -sumN - beforeSign\n\t\t\tsumN += add\n\t\t\tcount += abs(add)\n\t\t\n\t\tbeforeSign = getSign(sumN)\n\t\t\n\t\n\tcounts.append(count)\n\t\nprint(min(counts))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552972595", "date2": "1553028021", "bleu_score": "0.701374424575256", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1], "code1_test_score": 62, "total_score": 94, "input": "5\n40 -1 -1 1 -5\n", "actual_output": "53\n", "expected_output": "46\n\n", "anno_code": ["N = int(input()) # (0): N=5\nA2 = list(map(int,input().split())) # (1): A2=[40, -1, -1, 1, -5]\n\n\n\ndef getSign(a): # (2): getSign=\n\tif a < 0: # (9): NO CHANGE (23): N=5, A2=[40, -1, -1, 1, -5], getSign=, counts=[], j=0, A=[-1, -41, -1, 1, -5], count=81, sumN=-1, beforeSign=-1, add=-40, i=1 ... (99): NO CHANGE\n\t\treturn -1\n\telif a == 0: # (10): N=5, A2=[40, -1, -1, 1, -5], getSign=, counts=[], j=0, A=[40, -1, -1, 1, -5], count=0, sumN=40, beforeSign=1 (33): N=5, A2=[40, -1, -1, 1, -5], getSign=, counts=[], j=0, A=[-1, -41, 2, 1, -5], count=84, sumN=1, beforeSign=1, add=3, i=2 ... (100): N=5, A2=[40, -1, -1, 1, -5], getSign=, counts=[94], j=1, A=[40, -41, 2, -2, 2], count=53, sumN=1, beforeSign=1, add=7, i=4\n\t\treturn 0\n\telse:\n\t\treturn 1\n\ncounts = [] # (3): counts=[]\nfor j in range(2): # (4): j=0 (55): j=1 (103): NO CHANGE\n\tA = list(A2) # (5): A=[40, -1, -1, 1, -5] (56): A=[40, -1, -1, 1, -5]\n\tcount = 0 # (6): count=0 (57): count=0\n\tsumN = A[0] # (7): sumN=40 (58): sumN=40\n\tbeforeSign = getSign(A[0]) # (8): a=40 (59): a=40\n\t\n\tif j == 0: # (11): NO CHANGE (62): NO CHANGE\n\t\tadd = -A[0] - beforeSign # (12): add=-41\n\t\tA[0] += add # (13): A=[-1, -1, -1, 1, -5]\n\t\tcount += abs(add) # (14): count=41\n\t\n\tfor i in range(1,N): # (15): i=1 (24): i=2 ... (101): NO CHANGE\n\t\tsumN += A[i] # (16): sumN=39 (25): sumN=-2 ... (92): sumN=-6\n\n\t\t\n\n\t\tif 0 <= beforeSign * sumN: # (17): NO CHANGE (26): NO CHANGE ... (93): NO CHANGE\n\t\t\tadd = -sumN - beforeSign # (18): add=-40 (27): add=3 ... (94): add=7\n\t\t\tA[i] += add # (19): A=[-1, -41, -1, 1, -5] (28): A=[-1, -41, 2, 1, -5] ... (95): A=[40, -41, 2, -2, 2]\n\t\t\tsumN += add # (20): sumN=-1 (29): sumN=1 ... (96): sumN=1\n\t\t\tcount += abs(add) # (21): count=81 (30): count=84 ... (97): count=53\n\t\t\n\t\tbeforeSign = getSign(sumN) # (22): a=-1 (31): a=1 ... (98): a=1\n\t\t\n\t\n\tcounts.append(count) # (54): counts=[94] (102): counts=[94, 53]\n\t\nprint(min(counts))"], "anno_status": [false], "diff_content": " N = int(input())\n-A2 = list(map(int,input().split()))\n+A = list(map(int,input().split()))\n \n \n \n def getSign(a):\n \tif a < 0:\n \t\treturn -1\n \telif a == 0:\n \t\treturn 0\n \telse:\n \t\treturn 1\n \n counts = []\n-for j in range(2):\n-\tA = list(A2)\n+for beforeSign in [-1,1]:\n \tcount = 0\n-\tsumN = A[0]\n-\tbeforeSign = getSign(A[0])\n-\t\n-\tif j == 0:\n-\t\tadd = -A[0] - beforeSign\n-\t\tA[0] += add\n-\t\tcount += abs(add)\n-\t\n-\tfor i in range(1,N):\n+\tsumN = 0\n+\tfor i in range(N):\n \t\tsumN += A[i]\n \n \t\t\n \n \t\tif 0 <= beforeSign * sumN:\n \t\t\tadd = -sumN - beforeSign\n-\t\t\tA[i] += add\n \t\t\tsumN += add\n \t\t\tcount += abs(add)\n \t\t\n \t\tbeforeSign = getSign(sumN)\n \t\t\n \t\n \tcounts.append(count)\n \t\n print(min(counts))\n", "FL_content": "\n N = int(input())\n A2 = list(map(int,input().split()))\n \n \n \n def getSign(a):\n \tif a < 0:\n \t\treturn -1\n \telif a == 0:\n \t\treturn 0\n \telse:\n \t\treturn 1\n \n counts = []\n for j in range(2):\n \tA = list(A2)\n \tcount = 0\n \tsumN = A[0]\n \tbeforeSign = getSign(A[0])\n \t\n \tif j == 0:\n-\t\tadd = -A[0] - beforeSign\n \t\tA[0] += add\n \t\tcount += abs(add)\n \t\n \tfor i in range(1,N):\n \t\tsumN += A[i]\n \n \t\t\n \n \t\tif 0 <= beforeSign * sumN:\n \t\t\tadd = -sumN - beforeSign\n \t\t\tA[i] += add\n \t\t\tsumN += add\n \t\t\tcount += abs(add)\n \t\t\n \t\tbeforeSign = getSign(sumN)\n \t\t\n \n \tcounts.append(count)\n \t\n print(min(counts))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 42 }, { "user_id": "u584563392", "problem_id": "p03545", "submission1_id": "s528633389-FL", "submission2_id": "s242619992", "status1": "Wrong Answer", "status2": "Accepted", "code1": "input_str = input()\nA = int(input_str[0])\nB = int(input_str[1])\nC = int(input_str[2])\nD = int(input_str[3])\n\nlist = []\nlist.append(A + B + C + D)\nlist.append(A + B + C - D)\nlist.append(A + B - C + D)\nlist.append(A + B - C - D)\nlist.append(A - B + C + D)\nlist.append(A - B + C - D)\nlist.append(A - B - C + D)\nlist.append(A - B - C - D)\n\nnum = list.index(7)\nprint(num)\n\nif num <= 3:\n op1 = '+'\nelse:\n op1 = '-'\n\nif num == 0 or num == 1 or num == 4 or num == 5:\n op2 = '+'\nelse:\n op2 = '-'\n\nif num % 2 == 0:\n op3 = '+'\nelse:\n op3 = '-'\n\nprint('{}{}{}{}{}{}{}=7'.format(A,op1,B,op2,C,op3,D))\n", "code2": "input_str = input()\nA = int(input_str[0])\nB = int(input_str[1])\nC = int(input_str[2])\nD = int(input_str[3])\n\nlist = []\nlist.append(A + B + C + D)\nlist.append(A + B + C - D)\nlist.append(A + B - C + D)\nlist.append(A + B - C - D)\nlist.append(A - B + C + D)\nlist.append(A - B + C - D)\nlist.append(A - B - C + D)\nlist.append(A - B - C - D)\n\nnum = list.index(7)\n\nif num <= 3:\n op1 = '+'\nelse:\n op1 = '-'\n\nif num == 0 or num == 1 or num == 4 or num == 5:\n op2 = '+'\nelse:\n op2 = '-'\n\nif num % 2 == 0:\n op3 = '+'\nelse:\n op3 = '-'\n\nprint('{}{}{}{}{}{}{}=7'.format(A,op1,B,op2,C,op3,D))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1511060389", "date2": "1511060500", "bleu_score": "0.9795858581806592", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 99, "input": "1222\n", "actual_output": "0\n1+2+2+2=7\n", "expected_output": "1+2+2+2=7\n", "anno_code": ["input_str = input() # (0): input_str=1222\nA = int(input_str[0]) # (1): A=1\nB = int(input_str[1]) # (2): B=2\nC = int(input_str[2]) # (3): C=2\nD = int(input_str[3]) # (4): D=2\n\nlist = [] # (5): list=[]\nlist.append(A + B + C + D) # (6): list=[7]\nlist.append(A + B + C - D) # (7): list=[7, 3]\nlist.append(A + B - C + D) # (8): list=[7, 3, 3]\nlist.append(A + B - C - D) # (9): list=[7, 3, 3, -1]\nlist.append(A - B + C + D) # (10): list=[7, 3, 3, -1, 3]\nlist.append(A - B + C - D) # (11): list=[7, 3, 3, -1, 3, -1]\nlist.append(A - B - C + D) # (12): list=[7, 3, 3, -1, 3, -1, -1]\nlist.append(A - B - C - D) # (13): list=[7, 3, 3, -1, 3, -1, -1, -5]\n\nnum = list.index(7) # (14): num=0\nprint(num) # (15): NO CHANGE\n\nif num <= 3: # (16): NO CHANGE\n op1 = '+' # (17): op1=+\nelse:\n op1 = '-'\n\nif num == 0 or num == 1 or num == 4 or num == 5: # (18): NO CHANGE\n op2 = '+' # (19): op2=+\nelse:\n op2 = '-'\n\nif num % 2 == 0: # (20): NO CHANGE\n op3 = '+' # (21): op3=+\nelse:\n op3 = '-'\n\nprint('{}{}{}{}{}{}{}=7'.format(A,op1,B,op2,C,op3,D))\n"], "anno_status": [true], "diff_content": " input_str = input()\n A = int(input_str[0])\n B = int(input_str[1])\n C = int(input_str[2])\n D = int(input_str[3])\n \n list = []\n list.append(A + B + C + D)\n list.append(A + B + C - D)\n list.append(A + B - C + D)\n list.append(A + B - C - D)\n list.append(A - B + C + D)\n list.append(A - B + C - D)\n list.append(A - B - C + D)\n list.append(A - B - C - D)\n \n num = list.index(7)\n-print(num)\n \n if num <= 3:\n op1 = '+'\n else:\n op1 = '-'\n \n if num == 0 or num == 1 or num == 4 or num == 5:\n op2 = '+'\n else:\n op2 = '-'\n \n if num % 2 == 0:\n op3 = '+'\n else:\n op3 = '-'\n \n print('{}{}{}{}{}{}{}=7'.format(A,op1,B,op2,C,op3,D))\n-\n", "FL_content": "\n input_str = input()\n A = int(input_str[0])\n B = int(input_str[1])\n C = int(input_str[2])\n D = int(input_str[3])\n \n list = []\n list.append(A + B + C + D)\n list.append(A + B + C - D)\n list.append(A + B - C + D)\n list.append(A + B - C - D)\n list.append(A - B + C + D)\n list.append(A - B + C - D)\n list.append(A - B - C + D)\n list.append(A - B - C - D)\n \n num = list.index(7)\n-print(num)\n \n if num <= 3:\n op1 = '+'\n else:\n op1 = '-'\n \n if num == 0 or num == 1 or num == 4 or num == 5:\n op2 = '+'\n else:\n op2 = '-'\n \n if num % 2 == 0:\n op3 = '+'\n else:\n op3 = '-'\n \n print('{}{}{}{}{}{}{}=7'.format(A,op1,B,op2,C,op3,D))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 36 }, { "user_id": "u826929627", "problem_id": "p02899", "submission1_id": "s087210574-FL", "submission2_id": "s156971463", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list(map(int,input().split()))\n\nans = [0] * N\nfor i,a in enumerate(A):\n ans[a-1] = i+1\n\nprint(ans)", "code2": "N = int(input())\nA = list(map(int,input().split()))\n\nans = [0] * N\nfor i,a in enumerate(A):\n ans[a-1] = i+1\n\nprint(*ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579983789", "date2": "1579983828", "bleu_score": "0.9789435002605391", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 11, "input": "3\n3 -2 -1\n", "actual_output": "[2, 3, 1]\n", "expected_output": "2 3 1 \n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = list(map(int,input().split())) # (1): A=[3, -2, -1]\n\nans = [0] * N # (2): ans=[0, 0, 0]\nfor i,a in enumerate(A): # (3): i=0, a=3 (5): i=1, a=-2 ... (9): NO CHANGE\n ans[a-1] = i+1 # (4): ans=[0, 0, 1] (6): ans=[2, 0, 1] (8): ans=[2, 3, 1]\n\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n A = list(map(int,input().split()))\n \n ans = [0] * N\n for i,a in enumerate(A):\n ans[a-1] = i+1\n \n-print(ans)\n+print(*ans)\n", "FL_content": "\n N = int(input())\n A = list(map(int,input().split()))\n \n ans = [0] * N\n for i,a in enumerate(A):\n ans[a-1] = i+1\n \n-print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u334533374", "problem_id": "p02639", "submission1_id": "s455392214-FL", "submission2_id": "s069762653", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x = map(int,input().split())\ny =15\nprint(y)\nprint(y-sum(x))", "code2": "x = map(int,input().split())\ny =15\nprint(y-sum(x))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592228187", "date2": "1592228216", "bleu_score": "0.8352702114112719", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "15\n1\n", "expected_output": "1\n", "anno_code": ["x = map(int,input().split()) # (0): x=\ny =15 # (1): y=15\nprint(y) # (2): NO CHANGE\nprint(y-sum(x))"], "anno_status": [true], "diff_content": " x = map(int,input().split())\n y =15\n-print(y)\n print(y-sum(x))\n", "FL_content": "\n x = map(int,input().split())\n-y =15\n-print(y)\n-print(y-sum(x))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 4 }, { "user_id": "u250734103", "problem_id": "p03944", "submission1_id": "s646579933-FL", "submission2_id": "s367557830", "status1": "Wrong Answer", "status2": "Accepted", "code1": "W, H, N = map(int, input().split())\nx, y, a = [0] * N, [0] * N, [0] * N\nfor i in range(N):\n x[i], y[i], a[i] = map(int, input().split())\n \nw_s = 0\nw_e = W\nh_s = 0\nh_e = H\n\nfor i in range(N):\n if a[i] == 1:\n w_s = x[i]\n elif a[i] == 2:\n w_e = x[i]\n elif a[i] == 3:\n h_s = y[i]\n else:\n h_e = y[i]\n\nheight = h_e - h_s\nwidth = w_e - w_s\n\nif height <= 0 or width <= 0:\n print(0)\nelse:\n print(height * width)", "code2": "W, H, N = map(int, input().split())\nx, y, a = [0] * N, [0] * N, [0] * N\nfor i in range(N):\n x[i], y[i], a[i] = map(int, input().split())\n \nxmin = 0\nxmax = W\nymin = 0\nymax = H\n\nfor i in range(N):\n if a[i] == 1:\n xmin = max(x[i], xmin)\n elif a[i] == 2:\n xmax = min(x[i], xmax)\n elif a[i] == 3:\n ymin = max(y[i], ymin)\n else:\n ymax = min(y[i], ymax)\n\nheight = ymax - ymin\nwidth = xmax - xmin\n\nif height <= 0 or width <= 0:\n print(0)\nelse:\n print(height * width)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599804913", "date2": "1599805650", "bleu_score": "0.7626587548788706", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 96, "total_score": 103, "input": "5 2 3\n2 0 2\n1 11 2\n2 4 2\n", "actual_output": "4\n", "expected_output": "2\n\n", "anno_code": ["W, H, N = map(int, input().split()) # (0): W=5, H=2, N=3\nx, y, a = [0] * N, [0] * N, [0] * N # (1): x=[0, 0, 0], y=[0, 0, 0], a=[0, 0, 0]\nfor i in range(N): # (2): i=0 (4): i=1 ... (8): NO CHANGE\n x[i], y[i], a[i] = map(int, input().split()) # (3): x=[2, 0, 0], a=[2, 0, 0] (5): x=[2, 1, 0], y=[0, 11, 0], a=[2, 2, 0] (7): x=[2, 1, 2], y=[0, 11, 4], a=[2, 2, 2]\n \nw_s = 0 # (9): w_s=0\nw_e = W # (10): w_e=5\nh_s = 0 # (11): h_s=0\nh_e = H # (12): h_e=2\n\nfor i in range(N): # (13): i=0 (17): i=1 ... (25): NO CHANGE\n if a[i] == 1: # (14): NO CHANGE (18): NO CHANGE (22): NO CHANGE\n w_s = x[i]\n elif a[i] == 2: # (15): NO CHANGE (19): NO CHANGE (23): NO CHANGE\n w_e = x[i] # (16): w_e=2 (20): w_e=1 (24): w_e=2\n elif a[i] == 3:\n h_s = y[i]\n else:\n h_e = y[i]\n\nheight = h_e - h_s # (26): height=2\nwidth = w_e - w_s # (27): width=2\n\nif height <= 0 or width <= 0: # (28): NO CHANGE\n print(0)\nelse:\n print(height * width)"], "anno_status": [true], "diff_content": " W, H, N = map(int, input().split())\n x, y, a = [0] * N, [0] * N, [0] * N\n for i in range(N):\n x[i], y[i], a[i] = map(int, input().split())\n \n-w_s = 0\n-w_e = W\n-h_s = 0\n-h_e = H\n+xmin = 0\n+xmax = W\n+ymin = 0\n+ymax = H\n \n for i in range(N):\n if a[i] == 1:\n- w_s = x[i]\n+ xmin = max(x[i], xmin)\n elif a[i] == 2:\n- w_e = x[i]\n+ xmax = min(x[i], xmax)\n elif a[i] == 3:\n- h_s = y[i]\n+ ymin = max(y[i], ymin)\n else:\n- h_e = y[i]\n+ ymax = min(y[i], ymax)\n \n-height = h_e - h_s\n-width = w_e - w_s\n+height = ymax - ymin\n+width = xmax - xmin\n \n if height <= 0 or width <= 0:\n print(0)\n else:\n print(height * width)\n", "FL_content": "\n W, H, N = map(int, input().split())\n x, y, a = [0] * N, [0] * N, [0] * N\n for i in range(N):\n x[i], y[i], a[i] = map(int, input().split())\n \n w_s = 0\n w_e = W\n h_s = 0\n h_e = H\n \n for i in range(N):\n if a[i] == 1:\n w_s = x[i]\n elif a[i] == 2:\n w_e = x[i]\n elif a[i] == 3:\n h_s = y[i]\n else:\n h_e = y[i]\n \n height = h_e - h_s\n width = w_e - w_s\n \n if height <= 0 or width <= 0:\n print(0)\n else:\n print(height * width)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u075836834", "problem_id": "p00015", "submission1_id": "s874429214-FL", "submission2_id": "s147590026", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nfor _ in range(n):\n\ts=int(input())+int(input())\n\tprint('overflow' if s/1e80>1 else s)", "code2": "n=int(input())\nfor _ in range(n):\n\ts=int(input())+int(input())\n\tprint('overflow' if len(str(s))>80 else s)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1458769278", "date2": "1458769352", "bleu_score": "0.8651813126873771", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0], "code1_test_score": 98, "total_score": 101, "input": "6\n1000\n800\n167319819924237415589807736201027599985\n1\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n1\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n0\n101000000000000000000000000000000000000000000000000000000000000000000000000000000\n1\n100000000000000000000000000000000000000000000000000010000000000000000000000000000\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n", "actual_output": "1800\n167319819924237415589807736201027599986\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\noverflow\noverflow\n", "expected_output": "1800\n167319819924237415589807736201027599986\noverflow\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\noverflow\noverflow\n\n", "anno_code": ["n=int(input()) # (0): n=6\nfor _ in range(n): # (1): _=0 (4): _=1 ... (16): _=5\n\ts=int(input())+int(input()) # (2): s=1800 (5): s=167319819924237415589807736201027599986 ... (17): s=200000000000000000000000000000000000000000000000000010000000000000000000000000000\n\tprint('overflow' if s/1e80>1 else s) # (3): NO CHANGE (6): NO CHANGE ... (18): NO CHANGE\n"], "anno_status": [false], "diff_content": " n=int(input())\n for _ in range(n):\n \ts=int(input())+int(input())\n-\tprint('overflow' if s/1e80>1 else s)\n+\tprint('overflow' if len(str(s))>80 else s)\n", "FL_content": "\n n=int(input())\n for _ in range(n):\n \ts=int(input())+int(input())\n-\tprint('overflow' if s/1e80>1 else s)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 4 }, { "user_id": "u655110382", "problem_id": "p03086", "submission1_id": "s706954484-FL", "submission2_id": "s315615766", "status1": "Wrong Answer", "status2": "Accepted", "code1": "mx = 0\nS = input()\ntmp = 0\nfor ch in S:\n if ch in \"ATCG\":\n tmp += 1\n else:\n mx = max(tmp, mx)\n tmp = 0\n\nprint(mx)\n", "code2": "mx = 0\nS = input()\ntmp = 0\nfor ch in S:\n if ch in \"ATCG\":\n tmp += 1\n else:\n mx = max(tmp, mx)\n tmp = 0\n\nmx = max(tmp, mx)\nprint(mx)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1559851215", "date2": "1559851328", "bleu_score": "0.8865189569431954", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "VKUJNIHT\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["mx = 0 # (0): mx=0\nS = input() # (1): S=VKUJNIHT\ntmp = 0 # (2): tmp=0\nfor ch in S: # (3): ch=V (7): ch=K ... (34): NO CHANGE\n if ch in \"ATCG\": # (4): NO CHANGE (8): NO CHANGE ... (32): NO CHANGE\n tmp += 1 # (33): tmp=1\n else:\n mx = max(tmp, mx) # (5): NO CHANGE (9): NO CHANGE ... (29): NO CHANGE\n tmp = 0 # (6): NO CHANGE (10): NO CHANGE ... (30): NO CHANGE\n\nprint(mx)\n"], "anno_status": [true], "diff_content": " mx = 0\n S = input()\n tmp = 0\n for ch in S:\n if ch in \"ATCG\":\n tmp += 1\n else:\n mx = max(tmp, mx)\n tmp = 0\n \n+mx = max(tmp, mx)\n print(mx)\n-\n", "FL_content": "\n mx = 0\n S = input()\n tmp = 0\n for ch in S:\n- if ch in \"ATCG\":\n tmp += 1\n else:\n mx = max(tmp, mx)\n tmp = 0\n \n print(mx)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u389188163", "problem_id": "p02639", "submission1_id": "s408380405-FL", "submission2_id": "s529852030", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x1, x2, x3, x4, x5 = map(int, input().split())\n\nl = [x1, x2, x3, x4, x5]\nls = [str(n) for n in l]\ns = ''.join(ls).find('0')\nprint(s)", "code2": "x1, x2, x3, x4, x5 = map(int, input().split())\n\nl = [x1, x2, x3, x4, x5]\nls = [str(n) for n in l]\ns = ''.join(ls).find('0')\nprint(s+1)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592270409", "date2": "1592270534", "bleu_score": "0.9792167288591885", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "0\n", "expected_output": "1\n", "anno_code": ["x1, x2, x3, x4, x5 = map(int, input().split()) # (0): x1=0, x2=2, x3=3, x4=4, x5=5\n\nl = [x1, x2, x3, x4, x5] # (1): l=[0, 2, 3, 4, 5]\nls = [str(n) for n in l] # (2): ls=['0', '2', '3', '4', '5']\ns = ''.join(ls).find('0') # (3): s=0\nprint(s)"], "anno_status": [true], "diff_content": " x1, x2, x3, x4, x5 = map(int, input().split())\n \n l = [x1, x2, x3, x4, x5]\n ls = [str(n) for n in l]\n s = ''.join(ls).find('0')\n-print(s)\n+print(s+1)\n", "FL_content": "\n x1, x2, x3, x4, x5 = map(int, input().split())\n \n l = [x1, x2, x3, x4, x5]\n ls = [str(n) for n in l]\n-s = ''.join(ls).find('0')\n-print(s)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u760636024", "problem_id": "p03433", "submission1_id": "s208644856-FL", "submission2_id": "s884072091", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = int(input())\nif N > 1000:\n N = N%1000\nif N >= A:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "N = int(input())\nA = int(input())\nif N > 1000:\n N = N%1000\nif N <= A:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589106707", "date2": "1589106797", "bleu_score": "0.9770064524882032", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "2018\n000\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["N = int(input()) # (0): N=2018\nA = int(input()) # (1): A=0\nif N > 1000: # (2): NO CHANGE\n N = N%1000 # (3): N=18\nif N >= A: # (4): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " N = int(input())\n A = int(input())\n if N > 1000:\n N = N%1000\n-if N >= A:\n+if N <= A:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": "\n N = int(input())\n A = int(input())\n if N > 1000:\n N = N%1000\n-if N >= A:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u498511622", "problem_id": "p02420", "submission1_id": "s035326002-FL", "submission2_id": "s721968323", "status1": "Wrong Answer", "status2": "Accepted", "code1": "al=input()\nm=int(input())\nfor i in range(m):\n n = int(input())\n if n=='-':\n break\n else:\n al= al[n:] + al[:n]\nprint(al)", "code2": "while True:\n al=input()\n if al=='-':\n break\n else:\n m=int(input())\n for i in range(m):\n n = int(input())\n al= al[n:] + al[:n]\n print(al)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1502023821", "date2": "1502023963", "bleu_score": "0.7988446762118908", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "a`ac\n3\n1\n4\n1\nvwxzz\n2\n0\n1\n-\n", "actual_output": "aca`\n", "expected_output": "aca`\nwxzzv\n\n", "anno_code": ["al=input() # (0): al=a`ac\nm=int(input()) # (1): m=3\nfor i in range(m): # (2): i=0 (6): i=1 ... (14): NO CHANGE\n n = int(input()) # (3): n=1 (7): n=4 (11): n=1\n if n=='-': # (4): NO CHANGE (8): NO CHANGE (12): NO CHANGE\n break\n else:\n al= al[n:] + al[:n] # (5): al=`aca (9): NO CHANGE (13): al=aca`\nprint(al)"], "anno_status": [true], "diff_content": "-al=input()\n-m=int(input())\n-for i in range(m):\n- n = int(input())\n- if n=='-':\n- break\n- else:\n+while True:\n+ al=input()\n+ if al=='-':\n+ break\n+ else:\n+ m=int(input())\n+ for i in range(m):\n+ n = int(input())\n al= al[n:] + al[:n]\n-print(al)\n+ print(al)\n", "FL_content": "\n al=input()\n m=int(input())\n for i in range(m):\n n = int(input())\n if n=='-':\n break\n else:\n- al= al[n:] + al[:n]\n print(al)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u605879293", "problem_id": "p02276", "submission1_id": "s774966951-FL", "submission2_id": "s453131144", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def partition(array, p, r):\n x = array[r]\n i = p-1\n for j in range(p, r):\n if array[j] <= x:\n i += 1\n array[i], array[j] = array[j], array[i]\n array[i+1], array[r] = array[r], array[i+1]\n a1 = array[:i+1]\n a2 = \"[\" + str(array[i+1]) + \"]\"\n a3 = array[i+1:]\n array = a1[:]\n array.append(a2)\n array += a3\n print(*array)\n return i+1\n\nn = int(input())\narray = [int(a) for a in input().split()]\np = partition(array, 0, n-1)\n", "code2": "def partition(array, p, r):\n x = array[r]\n i = p-1\n for j in range(p, r):\n if array[j] <= x:\n i += 1\n array[i], array[j] = array[j], array[i]\n array[i+1], array[r] = array[r], array[i+1]\n a1 = array[:i+1]\n a2 = \"[\" + str(array[i+1]) + \"]\"\n a3 = array[i+2:]\n array = a1[:]\n array.append(a2)\n array += a3\n print(*array)\n return i+1\n\nn = int(input())\narray = [int(a) for a in input().split()]\np = partition(array, 0, n-1)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1529725973", "date2": "1529726083", "bleu_score": "0.9948212790032804", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "12\n63 19 22 2 12 11 0 5 21 -1 0 37\n", "actual_output": "19 22 2 12 11 0 5 21 -1 0 [37] 37 63\n", "expected_output": "19 22 2 12 11 0 5 21 -1 0 [37] 63\n\n", "anno_code": ["def partition(array, p, r): # (0): partition=\n x = array[r] # (4): x=37\n i = p-1 # (5): i=-1\n for j in range(p, r): # (6): j=0 (8): j=1 ... (48): NO CHANGE\n if array[j] <= x: # (7): NO CHANGE (9): NO CHANGE ... (45): NO CHANGE\n i += 1 # (10): i=0 (14): i=1 ... (46): i=9\n array[i], array[j] = array[j], array[i] # (11): array=[19, 63, 22, 2, 12, 11, 0, 5, 21, -1, 0, 37] (15): array=[19, 22, 63, 2, 12, 11, 0, 5, 21, -1, 0, 37] ... (47): array=[19, 22, 2, 12, 11, 0, 5, 21, -1, 0, 63, 37]\n array[i+1], array[r] = array[r], array[i+1] # (49): array=[19, 22, 2, 12, 11, 0, 5, 21, -1, 0, 37, 63]\n a1 = array[:i+1] # (50): a1=[19, 22, 2, 12, 11, 0, 5, 21, -1, 0]\n a2 = \"[\" + str(array[i+1]) + \"]\" # (51): a2=[37]\n a3 = array[i+1:] # (52): a3=[37, 63]\n array = a1[:] # (53): array=[19, 22, 2, 12, 11, 0, 5, 21, -1, 0]\n array.append(a2) # (54): array=[19, 22, 2, 12, 11, 0, 5, 21, -1, 0, '[37]']\n array += a3 # (55): array=[19, 22, 2, 12, 11, 0, 5, 21, -1, 0, '[37]', 37, 63]\n print(*array)\n return i+1\n\nn = int(input()) # (1): n=12\narray = [int(a) for a in input().split()] # (2): array=[63, 19, 22, 2, 12, 11, 0, 5, 21, -1, 0, 37]\np = partition(array, 0, n-1) # (3): p=0, r=11\n"], "anno_status": [true], "diff_content": " def partition(array, p, r):\n x = array[r]\n i = p-1\n for j in range(p, r):\n if array[j] <= x:\n i += 1\n array[i], array[j] = array[j], array[i]\n array[i+1], array[r] = array[r], array[i+1]\n a1 = array[:i+1]\n a2 = \"[\" + str(array[i+1]) + \"]\"\n- a3 = array[i+1:]\n+ a3 = array[i+2:]\n array = a1[:]\n array.append(a2)\n array += a3\n print(*array)\n return i+1\n \n n = int(input())\n array = [int(a) for a in input().split()]\n p = partition(array, 0, n-1)\n \n", "FL_content": "\n def partition(array, p, r):\n x = array[r]\n i = p-1\n for j in range(p, r):\n if array[j] <= x:\n i += 1\n array[i], array[j] = array[j], array[i]\n array[i+1], array[r] = array[r], array[i+1]\n a1 = array[:i+1]\n- a2 = \"[\" + str(array[i+1]) + \"]\"\n a3 = array[i+1:]\n array = a1[:]\n array.append(a2)\n array += a3\n print(*array)\n return i+1\n \n n = int(input())\n array = [int(a) for a in input().split()]\n p = partition(array, 0, n-1)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 21 }, { "user_id": "u017810624", "problem_id": "p03944", "submission1_id": "s460123423-FL", "submission2_id": "s064587231", "status1": "Wrong Answer", "status2": "Accepted", "code1": "w,h,n=map(int,input().split())\na=[list(map(int,input().split())) for i in range(n)]\na1=[0];a2=[0];a3=[0];a4=[0]\nfor i in a:\n if i[2]==1:a1.append(i[0])\n else:pass\nfor i in a:\n if i[2]==2:a2.append(i[0])\n else:pass\nfor i in a:\n if i[2]==3:a3.append(i[1])\n else:pass\nfor i in a:\n if i[2]==4:a4.append(i[1])\n else:pass\nif max(a1)-min(a2)<0:x=max(a1)-min(a2)\nelse:x=0\nif max(a3)-min(a4)<0:y=max(a3)-min(a4)\nelse:y=0\nprint(x*y)", "code2": "w,h,n=map(int,input().split())\na=[list(map(int,input().split())) for i in range(n)]\na1=[0];a2=[w];a3=[0];a4=[h]\nfor i in a:\n if i[2]==1:a1.append(i[0])\n else:pass\nfor i in a:\n if i[2]==2:a2.append(i[0])\n else:pass\nfor i in a:\n if i[2]==3:a3.append(i[1])\n else:pass\nfor i in a:\n if i[2]==4:a4.append(i[1])\n else:pass\nif max(a1)-min(a2)<0:x=max(a1)-min(a2)\nelse:x=0\nif max(a3)-min(a4)<0:y=max(a3)-min(a4)\nelse:y=0\nprint(x*y)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1536382629", "date2": "1536383064", "bleu_score": "0.9883037546671282", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0], "code1_test_score": 27, "total_score": 103, "input": "5 4 3\n2 0 2\n3 11 2\n2 4 2\n", "actual_output": "0\n", "expected_output": "8\n\n", "anno_code": ["w,h,n=map(int,input().split()) # (0): w=5, h=4, n=3\na=[list(map(int,input().split())) for i in range(n)] # (1): a\na1=[0];a2=[0];a3=[0];a4=[0] # (2): a1=[0], a2=[0], a3=[0], a4=[0]\nfor i in a: # (3): i=[2, 0, 2] (6): i=[3, 11, 2] ... (12): NO CHANGE\n if i[2]==1:a1.append(i[0]) # (4): NO CHANGE (7): NO CHANGE (10): NO CHANGE\n else:pass # (5): NO CHANGE (8): NO CHANGE (11): NO CHANGE\nfor i in a: # (13): i=[2, 0, 2] (15): i=[3, 11, 2] ... (19): NO CHANGE\n if i[2]==2:a2.append(i[0]) # (14): a2=[0, 2] (16): a2=[0, 2, 3] (18): a2=[0, 2, 3, 2]\n else:pass\nfor i in a: # (20): i=[2, 0, 2] (23): i=[3, 11, 2] ... (29): NO CHANGE\n if i[2]==3:a3.append(i[1]) # (21): NO CHANGE (24): NO CHANGE (27): NO CHANGE\n else:pass # (22): NO CHANGE (25): NO CHANGE (28): NO CHANGE\nfor i in a: # (30): i=[2, 0, 2] (33): i=[3, 11, 2] ... (39): NO CHANGE\n if i[2]==4:a4.append(i[1]) # (31): NO CHANGE (34): NO CHANGE (37): NO CHANGE\n else:pass # (32): NO CHANGE (35): NO CHANGE (38): NO CHANGE\nif max(a1)-min(a2)<0:x=max(a1)-min(a2) # (40): NO CHANGE\nelse:x=0 # (41): x=0\nif max(a3)-min(a4)<0:y=max(a3)-min(a4) # (42): NO CHANGE\nelse:y=0 # (43): y=0\nprint(x*y)"], "anno_status": [true], "diff_content": " w,h,n=map(int,input().split())\n a=[list(map(int,input().split())) for i in range(n)]\n-a1=[0];a2=[0];a3=[0];a4=[0]\n+a1=[0];a2=[w];a3=[0];a4=[h]\n for i in a:\n if i[2]==1:a1.append(i[0])\n else:pass\n for i in a:\n if i[2]==2:a2.append(i[0])\n else:pass\n for i in a:\n if i[2]==3:a3.append(i[1])\n else:pass\n for i in a:\n if i[2]==4:a4.append(i[1])\n else:pass\n if max(a1)-min(a2)<0:x=max(a1)-min(a2)\n else:x=0\n if max(a3)-min(a4)<0:y=max(a3)-min(a4)\n else:y=0\n print(x*y)\n", "FL_content": "\n w,h,n=map(int,input().split())\n a=[list(map(int,input().split())) for i in range(n)]\n a1=[0];a2=[0];a3=[0];a4=[0]\n for i in a:\n if i[2]==1:a1.append(i[0])\n else:pass\n for i in a:\n if i[2]==2:a2.append(i[0])\n else:pass\n for i in a:\n if i[2]==3:a3.append(i[1])\n else:pass\n for i in a:\n if i[2]==4:a4.append(i[1])\n else:pass\n-if max(a1)-min(a2)<0:x=max(a1)-min(a2)\n else:x=0\n-if max(a3)-min(a4)<0:y=max(a3)-min(a4)\n else:y=0\n print(x*y)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u733945366", "problem_id": "p02237", "submission1_id": "s146678668-FL", "submission2_id": "s320210913", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input());\nG=[[0 for i in range(n)]for j in range(n)]\n\nfor i in range(n):\n list=[int(m) for m in input().split()]\n u=list[0]\n k=list[1]\n for j in range(2,len(list)):\n v=list[j]\n G[u-1][v-1]=1\nprint(G)\n", "code2": "n=int(input());\nG=[[0 for i in range(n)]for j in range(n)]\nfor i in range(n):\n list=[int(m) for m in input().split()]\n u=list[0]\n k=list[1]\n for j in range(2,len(list)):\n v=list[j]\n G[u-1][v-1]=1\nfor i in range(n):\n for j in range(n):\n if j!=n-1:\n print(G[i][j],end=\" \")\n else:\n print(G[i][j],end=\"\\n\")\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1529482184", "date2": "1529482807", "bleu_score": "0.6162197396987387", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "4\n1 2 3 4\n2 1 4\n3 -1\n4 1 1\n", "actual_output": "[[0, 0, 1, 1], [0, 0, 0, 1], [0, 0, 0, 0], [1, 0, 0, 0]]\n", "expected_output": "0 0 1 1\n0 0 0 1\n0 0 0 0\n1 0 0 0\n\n", "anno_code": ["n=int(input()); # (0): n=4\nG=[[0 for i in range(n)]for j in range(n)] # (1): G\n\nfor i in range(n): # (2): i=0 (13): i=1 ... (34): NO CHANGE\n list=[int(m) for m in input().split()] # (3): list=[1, 2, 3, 4] (14): list=[2, 1, 4] ... (27): list=[4, 1, 1]\n u=list[0] # (4): u=1 (15): u=2 ... (28): u=4\n k=list[1] # (5): k=2 (16): k=1 ... (29): k=1\n for j in range(2,len(list)): # (6): j=2 (9): j=3 ... (33): NO CHANGE\n v=list[j] # (7): v=3 (10): v=4 ... (31): v=1\n G[u-1][v-1]=1 # (8): G (11): G ... (32): G\nprint(G)\n"], "anno_status": [true], "diff_content": " n=int(input());\n G=[[0 for i in range(n)]for j in range(n)]\n-\n for i in range(n):\n list=[int(m) for m in input().split()]\n u=list[0]\n k=list[1]\n for j in range(2,len(list)):\n v=list[j]\n G[u-1][v-1]=1\n-print(G)\n+for i in range(n):\n+ for j in range(n):\n+ if j!=n-1:\n+ print(G[i][j],end=\" \")\n+ else:\n+ print(G[i][j],end=\"\\n\")\n+\n \n", "FL_content": "\n n=int(input());\n G=[[0 for i in range(n)]for j in range(n)]\n \n for i in range(n):\n list=[int(m) for m in input().split()]\n u=list[0]\n k=list[1]\n for j in range(2,len(list)):\n v=list[j]\n G[u-1][v-1]=1\n-print(G)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u131984977", "problem_id": "p02413", "submission1_id": "s551865630-FL", "submission2_id": "s262392587", "status1": "Wrong Answer", "status2": "Accepted", "code1": "(r, c) = [int(i) for i in input().split()]\n\nct = [0 for d in range(c)]\ntmp = []\nfor rc in range(r):\n tmp = [int(i) for i in input().split()]\n total = 0\n for cc in range(c):\n ct[cc] += tmp[cc]\n total += tmp[cc]\n print(tmp[cc], end=' ')\n print(total)\ntotal = sum(ct)\nprint(' '.join([str(i) for i in tmp]), total)", "code2": "(r, c) = [int(i) for i in input().split()]\n\nct = [0 for d in range(c)]\ntmp = []\nfor rc in range(r):\n tmp = [int(i) for i in input().split()]\n total = 0\n for cc in range(c):\n ct[cc] += tmp[cc]\n total += tmp[cc]\n print(tmp[cc], end=' ')\n print(total)\ntotal = sum(ct)\nprint(' '.join([str(i) for i in ct]), total)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1423019825", "date2": "1423019950", "bleu_score": "0.987539700461717", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 2, "total_score": 101, "input": "4 5\n2 1 3 4 13\n2 2 2 5 5\n3 3 0 1 1\n2 6 4 1 11\n", "actual_output": "2 1 3 4 13 23\n2 2 2 5 5 16\n3 3 0 1 1 8\n2 6 4 1 11 24\n2 6 4 1 11 71\n", "expected_output": "2 1 3 4 13 23\n2 2 2 5 5 16\n3 3 0 1 1 8\n2 6 4 1 11 24\n9 12 9 11 30 71\n\n", "anno_code": ["(r, c) = [int(i) for i in input().split()] # (0): r=4, c=5\n\nct = [0 for d in range(c)] # (1): ct=[0, 0, 0, 0, 0]\ntmp = [] # (2): tmp=[]\nfor rc in range(r): # (3): rc=0 (28): rc=1 ... (103): NO CHANGE\n tmp = [int(i) for i in input().split()] # (4): tmp=[2, 1, 3, 4, 13] (29): tmp=[2, 2, 2, 5, 5] ... (79): tmp=[2, 6, 4, 1, 11]\n total = 0 # (5): total=0 (30): total=0 ... (80): total=0\n for cc in range(c): # (6): cc=0 (10): cc=1 ... (101): NO CHANGE\n ct[cc] += tmp[cc] # (7): ct=[2, 0, 0, 0, 0] (11): ct=[2, 1, 0, 0, 0] ... (98): ct=[9, 12, 9, 11, 30]\n total += tmp[cc] # (8): total=2 (12): total=3 ... (99): total=24\n print(tmp[cc], end=' ') # (9): NO CHANGE (13): NO CHANGE ... (100): NO CHANGE\n print(total) # (27): NO CHANGE (52): NO CHANGE ... (102): NO CHANGE\ntotal = sum(ct) # (104): total=71\nprint(' '.join([str(i) for i in tmp]), total)"], "anno_status": [true], "diff_content": " (r, c) = [int(i) for i in input().split()]\n \n ct = [0 for d in range(c)]\n tmp = []\n for rc in range(r):\n tmp = [int(i) for i in input().split()]\n total = 0\n for cc in range(c):\n ct[cc] += tmp[cc]\n total += tmp[cc]\n print(tmp[cc], end=' ')\n print(total)\n total = sum(ct)\n-print(' '.join([str(i) for i in tmp]), total)\n+print(' '.join([str(i) for i in ct]), total)\n", "FL_content": "\n (r, c) = [int(i) for i in input().split()]\n \n ct = [0 for d in range(c)]\n tmp = []\n for rc in range(r):\n tmp = [int(i) for i in input().split()]\n total = 0\n for cc in range(c):\n ct[cc] += tmp[cc]\n total += tmp[cc]\n- print(tmp[cc], end=' ')\n print(total)\n total = sum(ct)\n-print(' '.join([str(i) for i in tmp]), total)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u620480037", "problem_id": "p03380", "submission1_id": "s280461501-FL", "submission2_id": "s481105602", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\na=list(map(int,input().split()))\n\nMAX=max(a)\nHarf=MAX/2\n\ncnt=10**20\nans=0\nfor i in range(n):\n if abs(Harf-a[i]) 0:\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n sum_ -= abs(sum_) + 1\n count += abs(sum_) + 1\n print(count) \nelif sum_ < 0:\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n sum_ += -abs(sum_) - 1\n count += abs(sum_) + 1 \n print(count) \nelse:\n sum_ = 1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n sum_ -= -abs(sum_) - 1\n count += abs(sum_) + 1\n count1 = count \n sum_ = -1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1 \n count2 = count \n print(min(count1, count2))", "code2": "n = int(input())\nnum_list = list(map(int, input().split()))\ncount = 0\nsum_ = num_list[0]\nif sum_ > 0:\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n count += abs(sum_) + 1\n sum_ = 1\n else:\n if sum_ >= 0:\n count += abs(sum_) + 1\n sum_ = -1\n count1 = count\n \n count = 0\n sum_ = -1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n count += abs(sum_) + 1\n sum_ = 1\n else:\n if sum_ >= 0:\n count += abs(sum_) + 1\n sum_ = -1\n count2 = count + num_list[0] + 1\n \n print(min(count1, count2))\nelif sum_ < 0:\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n count += abs(sum_) + 1\n sum_ = 1\n else:\n if sum_ >= 0:\n count += abs(sum_) + 1\n sum_ = -1\n count1 = count\n \n count = 0\n sum_ = 1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n count += abs(sum_) + 1\n sum_ = 1\n else:\n if sum_ >= 0:\n count += abs(sum_) + 1\n sum_ = -1\n count2 = count + abs(num_list[0]) + 1\n \n print(min(count1, count2))\n \nelse:\n sum_ = -1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n count += abs(sum_) + 1\n sum_ = 1\n else:\n if sum_ >= 0:\n count += abs(sum_) + 1\n sum_ = -1\n count1 = count + 1\n \n count = 0\n sum_ = 1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n count += abs(sum_) + 1\n sum_ = 1\n else:\n if sum_ >= 0:\n count += abs(sum_) + 1\n sum_ = -1\n count2 = count + 1 \n\n print(min(count1, count2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1542511557", "date2": "1542568220", "bleu_score": "0.6770445590459119", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0], "code1_test_score": 4, "total_score": 94, "input": "6\n-1 4 1 2 -5 0\n", "actual_output": "4\n", "expected_output": "10\n\n", "anno_code": ["n = int(input()) # (0): n=6\nnum_list = list(map(int, input().split())) # (1): num_list=[-1, 4, 1, 2, -5, 0]\ncount = 0 # (2): count=0\nsum_ = num_list[0] # (3): sum_=-1\nif sum_ > 0: # (4): NO CHANGE\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n sum_ -= abs(sum_) + 1\n count += abs(sum_) + 1\n print(count) \nelif sum_ < 0: # (5): NO CHANGE\n for i in range(1, n): # (6): i=1 (10): i=2 ... (30): NO CHANGE\n sum_ += num_list[i] # (7): sum_=3 (11): sum_=4 ... (25): NO CHANGE\n if i%2 == 1: # (8): NO CHANGE (12): NO CHANGE ... (26): NO CHANGE\n if sum_ <= 0: # (9): NO CHANGE (19): NO CHANGE (27): NO CHANGE\n sum_ += abs(sum_) + 1 # (28): sum_=1\n count += abs(sum_) + 1 # (29): count=4\n else:\n if sum_ >= 0: # (13): NO CHANGE (23): NO CHANGE\n sum_ += -abs(sum_) - 1 # (14): sum_=-1\n count += abs(sum_) + 1 # (15): count=2\n print(count) \nelse:\n sum_ = 1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n sum_ -= -abs(sum_) - 1\n count += abs(sum_) + 1\n count1 = count \n sum_ = -1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1 \n count2 = count \n print(min(count1, count2))"], "anno_status": [false], "diff_content": " n = int(input())\n num_list = list(map(int, input().split()))\n count = 0\n sum_ = num_list[0]\n if sum_ > 0:\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n- sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n+ sum_ = 1\n else:\n if sum_ >= 0:\n- sum_ -= abs(sum_) + 1\n count += abs(sum_) + 1\n- print(count) \n+ sum_ = -1\n+ count1 = count\n+ \n+ count = 0\n+ sum_ = -1\n+ for i in range(1, n):\n+ sum_ += num_list[i]\n+ if i%2 == 1:\n+ if sum_ <= 0:\n+ count += abs(sum_) + 1\n+ sum_ = 1\n+ else:\n+ if sum_ >= 0:\n+ count += abs(sum_) + 1\n+ sum_ = -1\n+ count2 = count + num_list[0] + 1\n+ \n+ print(min(count1, count2))\n elif sum_ < 0:\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n- sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n+ sum_ = 1\n else:\n if sum_ >= 0:\n- sum_ += -abs(sum_) - 1\n- count += abs(sum_) + 1 \n- print(count) \n-else:\n+ count += abs(sum_) + 1\n+ sum_ = -1\n+ count1 = count\n+ \n+ count = 0\n sum_ = 1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n- sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n+ sum_ = 1\n else:\n if sum_ >= 0:\n- sum_ -= -abs(sum_) - 1\n count += abs(sum_) + 1\n- count1 = count \n+ sum_ = -1\n+ count2 = count + abs(num_list[0]) + 1\n+ \n+ print(min(count1, count2))\n+ \n+else:\n sum_ = -1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n- sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n+ sum_ = 1\n+ else:\n+ if sum_ >= 0:\n+ count += abs(sum_) + 1\n+ sum_ = -1\n+ count1 = count + 1\n+ \n+ count = 0\n+ sum_ = 1\n+ for i in range(1, n):\n+ sum_ += num_list[i]\n+ if i%2 == 0:\n+ if sum_ <= 0:\n+ count += abs(sum_) + 1\n+ sum_ = 1\n else:\n if sum_ >= 0:\n- sum_ += abs(sum_) + 1\n- count += abs(sum_) + 1 \n- count2 = count \n+ count += abs(sum_) + 1\n+ sum_ = -1\n+ count2 = count + 1 \n+\n print(min(count1, count2))\n", "FL_content": "\n n = int(input())\n num_list = list(map(int, input().split()))\n count = 0\n sum_ = num_list[0]\n if sum_ > 0:\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n sum_ -= abs(sum_) + 1\n count += abs(sum_) + 1\n print(count) \n elif sum_ < 0:\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1 \n print(count) \n else:\n- sum_ = 1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 0:\n if sum_ <= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n sum_ -= abs(sum_) + 1\n count += abs(sum_) + 1\n count1 = count \n sum_ = -1\n for i in range(1, n):\n sum_ += num_list[i]\n if i%2 == 1:\n if sum_ <= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1\n else:\n if sum_ >= 0:\n sum_ += abs(sum_) + 1\n count += abs(sum_) + 1 \n count2 = count \n print(min(count1, count2))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 54 }, { "user_id": "u257974487", "problem_id": "p03129", "submission1_id": "s437213118-FL", "submission2_id": "s540147343", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b = map(int, input().split())\nif a > b:\n print(\"YES\")\nelse:\n print(\"NO\")", "code2": "a, b = map(int, input().split())\nif a >= 2 * b - 1:\n print(\"YES\")\nelse:\n print(\"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1549920088", "date2": "1549920212", "bleu_score": "0.866627220670795", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 51, "total_score": 60, "input": "87 50\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["a, b = map(int, input().split()) # (0): a=87, b=50\nif a > b: # (1): NO CHANGE\n print(\"YES\")\nelse:\n print(\"NO\")"], "anno_status": [true], "diff_content": " a, b = map(int, input().split())\n-if a > b:\n+if a >= 2 * b - 1:\n print(\"YES\")\n else:\n print(\"NO\")\n", "FL_content": "\n a, b = map(int, input().split())\n-if a > b:\n print(\"YES\")\n else:\n print(\"NO\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u546285759", "problem_id": "p00637", "submission1_id": "s299943821-FL", "submission2_id": "s702601982", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n n = int(input())\n if n == 0:\n break\n line = list(map(int, input().split()))\n t = len(line)-1\n ans = []\n i = 0\n while True:\n ans.append(line[i])\n while i < t:\n if line[i]+1 == line[i+1]:\n i += 1\n else:\n ans.append(line[i])\n i += 1\n break\n if i == t:\n ans.append(line[i])\n break\n print(*ans)", "code2": "while True:\n n = int(input())\n if n == 0:\n break\n line = list(map(int, input().split()))\n i = 0\n while i < n:\n j = i\n while j+1 < n and line[j+1]-line[j] == 1:\n j += 1\n s = \"\\n\" if n-1 == j else \" \"\n if i == j:\n print(\"%d%s\" % (line[i], s), end='')\n i += 1\n else:\n print(\"%d-%d%s\" % (line[i], line[j], s), end='')\n i = j+1", "original_language1": "Python3", "original_language2": "Python3", "date1": "1492664337", "date2": "1492665020", "bleu_score": "0.699147635014877", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "5\n1 1 5 3 4\n3\n24 8 9\n0\n", "actual_output": "1 1 1 1 5 5 3 4\n24 24 8 9\n", "expected_output": "1 1 5 3-4\n24 8-9\n\n", "anno_code": ["while True: # (0): NO CHANGE (41): NO CHANGE (66): NO CHANGE\n n = int(input()) # (1): n=5 (42): n=3 (67): n=0\n if n == 0: # (2): NO CHANGE (43): NO CHANGE (68): NO CHANGE\n break\n line = list(map(int, input().split())) # (3): line=[1, 1, 5, 3, 4] (44): line=[24, 8, 9]\n t = len(line)-1 # (4): t=4 (45): t=2\n ans = [] # (5): ans=[] (46): ans=[]\n i = 0 # (6): i=0 (47): i=0\n while True: # (7): NO CHANGE (15): NO CHANGE ... (56): NO CHANGE\n ans.append(line[i]) # (8): ans=[1] (16): ans=[1, 1, 1] ... (57): ans=[24, 24, 8]\n while i < t: # (9): NO CHANGE (17): NO CHANGE ... (61): NO CHANGE\n if line[i]+1 == line[i+1]: # (10): NO CHANGE (18): NO CHANGE ... (59): NO CHANGE\n i += 1 # (35): i=4 (60): i=2\n else:\n ans.append(line[i]) # (11): ans=[1, 1] (19): ans=[1, 1, 1, 1] ... (52): ans=[24, 24]\n i += 1 # (12): i=1 (20): i=2 ... (53): i=1\n break # (13): NO CHANGE (21): NO CHANGE ... (54): NO CHANGE\n if i == t: # (14): NO CHANGE (22): NO CHANGE ... (62): NO CHANGE\n ans.append(line[i]) # (38): ans=[1, 1, 1, 1, 5, 5, 3, 4] (63): ans=[24, 24, 8, 9]\n break # (39): NO CHANGE (64): NO CHANGE\n print(*ans) # (40): NO CHANGE (65): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n n = int(input())\n if n == 0:\n break\n line = list(map(int, input().split()))\n- t = len(line)-1\n- ans = []\n i = 0\n- while True:\n- ans.append(line[i])\n- while i < t:\n- if line[i]+1 == line[i+1]:\n- i += 1\n- else:\n- ans.append(line[i])\n- i += 1\n- break\n- if i == t:\n- ans.append(line[i])\n- break\n- print(*ans)\n+ while i < n:\n+ j = i\n+ while j+1 < n and line[j+1]-line[j] == 1:\n+ j += 1\n+ s = \"\\n\" if n-1 == j else \" \"\n+ if i == j:\n+ print(\"%d%s\" % (line[i], s), end='')\n+ i += 1\n+ else:\n+ print(\"%d-%d%s\" % (line[i], line[j], s), end='')\n+ i = j+1\n", "FL_content": "\n while True:\n n = int(input())\n if n == 0:\n break\n line = list(map(int, input().split()))\n t = len(line)-1\n ans = []\n i = 0\n while True:\n ans.append(line[i])\n while i < t:\n if line[i]+1 == line[i+1]:\n i += 1\n else:\n ans.append(line[i])\n i += 1\n break\n if i == t:\n ans.append(line[i])\n break\n print(*ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 21 }, { "user_id": "u609814378", "problem_id": "p02909", "submission1_id": "s163457373-FL", "submission2_id": "s422323015", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\nif s == \"Suuny\":\n print(\"Cloudy\")\nelif s == \"Cloudy\":\n print(\"Sunny\")\nelif s==(\"Rainy\"):\n print(\"Suuny\")", "code2": "s = input()\n \nif s == 'Sunny':\n print('Cloudy')\nif s == 'Cloudy':\n print('Rainy')\nif s == 'Rainy':\n print('Sunny')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573854532", "date2": "1573854998", "bleu_score": "0.6198837798622997", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "Sunny\n", "actual_output": "no output\n", "expected_output": "Cloudy\n", "anno_code": ["s = input() # (0): s=Sunny\n\nif s == \"Suuny\": # (1): NO CHANGE\n print(\"Cloudy\")\nelif s == \"Cloudy\": # (2): NO CHANGE\n print(\"Sunny\")\nelif s==(\"Rainy\"):\n print(\"Suuny\")"], "anno_status": [true], "diff_content": " s = input()\n-\n-if s == \"Suuny\":\n- print(\"Cloudy\")\n-elif s == \"Cloudy\":\n- print(\"Sunny\")\n-elif s==(\"Rainy\"):\n- print(\"Suuny\")\n+ \n+if s == 'Sunny':\n+ print('Cloudy')\n+if s == 'Cloudy':\n+ print('Rainy')\n+if s == 'Rainy':\n+ print('Sunny')\n", "FL_content": "\n s = input()\n \n-if s == \"Suuny\":\n print(\"Cloudy\")\n elif s == \"Cloudy\":\n print(\"Sunny\")\n-elif s==(\"Rainy\"):\n- print(\"Suuny\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u125269142", "problem_id": "p03086", "submission1_id": "s664501168-FL", "submission2_id": "s625506222", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\nmax = 0\ncnt = 0\n\nfor i in range(len(s)):\n if s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T':\n cnt += 1\n if max < cnt:\n max = cnt\n else:\n cnt = 0\n\nprint(max)", "code2": "s = input()\n\nmax = 0\ncnt = 0\n\nfor i in range(len(s)):\n if s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T':\n cnt += 1\n if max < cnt:\n max = cnt\n else:\n cnt = 0\n\nprint(max)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597614510", "date2": "1597614633", "bleu_score": "0.9547175896106327", "code1_test_status": [1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 76, "total_score": 103, "input": "AYCH@TAH\n", "actual_output": "4\n", "expected_output": "2\n\n", "anno_code": ["s = input() # (0): s=AYCH@TAH\n\nmax = 0 # (1): max=0\ncnt = 0 # (2): cnt=0\n\nfor i in range(len(s)): # (3): i=0 (8): i=1 ... (31): NO CHANGE\n if s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T': # (4): NO CHANGE (9): NO CHANGE ... (30): NO CHANGE\n cnt += 1 # (5): cnt=1 (12): cnt=2 ... (26): cnt=4\n if max < cnt: # (6): NO CHANGE (13): NO CHANGE ... (27): NO CHANGE\n max = cnt # (7): max=1 (14): max=2 ... (28): max=4\n else:\n cnt = 0\n\nprint(max)"], "anno_status": [true], "diff_content": " s = input()\n \n max = 0\n cnt = 0\n \n for i in range(len(s)):\n if s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T':\n cnt += 1\n if max < cnt:\n max = cnt\n- else:\n- cnt = 0\n+ else:\n+ cnt = 0\n \n print(max)\n+\n", "FL_content": "\n s = input()\n \n max = 0\n cnt = 0\n \n for i in range(len(s)):\n if s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T':\n- cnt += 1\n- if max < cnt:\n- max = cnt\n- else:\n- cnt = 0\n \n print(max)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u485986915", "problem_id": "p02401", "submission1_id": "s117622120-FL", "submission2_id": "s375369262", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n a,op,b = input().split()\n A = int(a)\n B = int(b)\n\n if op == '?': break\n elif op == '+':\n print(A+B)\n elif op == '-':\n print(A-B)\n elif op == '*':\n print(A*B)\n elif op == '/':\n print(A/B)\n \n", "code2": "while True:\n a,op,b = input().split()\n\n A = int(a)\n B = int(b)\n\n if op == '?': break\n elif op == '+':\n print(A+B)\n elif op == '-':\n print(A-B)\n elif op == '*':\n print(A*B)\n elif op == '/':\n print(A\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1524475791", "date2": "1524475987", "bleu_score": "0.9482467771190035", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "1 , 4\n25 - 18\n10 * 2\n001 / 29\n28 , 81\n0 ? 0\n", "actual_output": "7\n20\n0.034482758620689655\n", "expected_output": "(1, 4)\n7\n20\n0\n(28, 81)\n\n", "anno_code": ["while True: # (0): NO CHANGE (9): NO CHANGE ... (45): NO CHANGE\n a,op,b = input().split() # (1): a=1, op=,, b=4 (10): a=25, op=-, b=18 ... (46): a=0, op=?, b=0\n A = int(a) # (2): A=1 (11): A=25 ... (47): A=0\n B = int(b) # (3): B=4 (12): B=18 ... (48): B=0\n\n if op == '?': break # (4): NO CHANGE (13): NO CHANGE ... (40): NO CHANGE\n elif op == '+': # (5): NO CHANGE (14): NO CHANGE ... (41): NO CHANGE\n print(A+B)\n elif op == '-': # (6): NO CHANGE (15): NO CHANGE ... (42): NO CHANGE\n print(A-B) # (16): NO CHANGE\n elif op == '*': # (7): NO CHANGE (24): NO CHANGE ... (43): NO CHANGE\n print(A*B) # (25): NO CHANGE\n elif op == '/': # (8): NO CHANGE (34): NO CHANGE (44): NO CHANGE\n print(A/B) # (35): NO CHANGE\n \n"], "anno_status": [true], "diff_content": " while True:\n a,op,b = input().split()\n+\n A = int(a)\n B = int(b)\n \n if op == '?': break\n elif op == '+':\n print(A+B)\n elif op == '-':\n print(A-B)\n elif op == '*':\n print(A*B)\n elif op == '/':\n- print(A/B)\n- \n+ print(A\n \n", "FL_content": "\n while True:\n a,op,b = input().split()\n A = int(a)\n B = int(b)\n \n if op == '?': break\n elif op == '+':\n print(A+B)\n elif op == '-':\n print(A-B)\n elif op == '*':\n print(A*B)\n elif op == '/':\n- print(A/B)\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u089230684", "problem_id": "p03003", "submission1_id": "s073653293-FL", "submission2_id": "s579834667", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nfrom math import ceil\n\ndef input():\n return sys.stdin.readline().strip()\n\ndef iinput():\n return int(input())\n\ndef finput():\n return float(input())\n\ndef tinput():\n return input().split()\n\ndef rinput():\n return map(int, tinput())\n\ndef rlinput():\n return list(rinput())\n\ndef nok(a, b):\n m = a * b\n while a != 0 and b != 0:\n if a > b:\n a %= b\n else:\n b %= a\n return m \n\n\ndef main():\n mod = 1e9 + 7\n n, m = rinput()\n s = rlinput()\n t = rlinput()\n a = [1] * (m + 1)\n for j in s:\n d = a[:]\n k = 0\n for i, v in enumerate(t):\n d[i] = (k + d[i]) % mod\n if j == v:\n k = (k + a[i]) % mod\n d[-1] = (k + d[-1]) % mod\n a = d[:]\n print(a[-1])\n \n \n \nmain()", "code2": "import sys\nfrom math import ceil\n\ndef input():\n return sys.stdin.readline().strip()\n\ndef iinput():\n return int(input())\n\ndef finput():\n return float(input())\n\ndef tinput():\n return input().split()\n\ndef rinput():\n return map(int, tinput())\n\ndef rlinput():\n return list(rinput())\n\ndef nok(a, b):\n m = a * b\n while a != 0 and b != 0:\n if a > b:\n a %= b\n else:\n b %= a\n return m \n\n\ndef main():\n mod = 1e9 + 7\n n, m = rinput()\n s = rlinput()\n t = rlinput()\n a = [1] * (m + 1)\n for j in s:\n d = a[:]\n k = 0\n for i, v in enumerate(t):\n d[i] = (k + d[i]) % mod\n if j == v:\n k = (k + a[i]) % mod\n d[-1] = (k + d[-1]) % mod\n a = d[:]\n print(int(a[-1]))\n \n \n \nmain()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566975685", "date2": "1566975792", "bleu_score": "0.9929731077507992", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 105, "input": "20 20\n1 1 1 1 1 1 1 0 1 1 1 1 2 1 1 1 1 1 1 -1\n1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 0 1 2\n", "actual_output": "556030426.0\n", "expected_output": "556030426\n\n", "anno_code": ["import sys\nfrom math import ceil\n\ndef input(): # (0): input=\n return sys.stdin.readline().strip()\n\ndef iinput(): # (1): iinput=\n return int(input())\n\ndef finput(): # (2): finput=\n return float(input())\n\ndef tinput(): # (3): tinput=\n return input().split()\n\ndef rinput(): # (4): rinput=\n return map(int, tinput())\n\ndef rlinput(): # (5): rlinput=\n return list(rinput())\n\ndef nok(a, b): # (6): nok=\n m = a * b\n while a != 0 and b != 0:\n if a > b:\n a %= b\n else:\n b %= a\n return m \n\n\ndef main(): # (7): main=\n mod = 1e9 + 7 # (9): mod=1000000007.0\n n, m = rinput() # (10): n=20, m=20\n s = rlinput() # (11): s=[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, -1]\n t = rlinput() # (12): t=[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 2]\n a = [1] * (m + 1) # (13): a=[1, 1, ..., 1, 1]\n for j in s: # (14): j=1 (96): NO CHANGE ... (1610): NO CHANGE\n d = a[:] # (15): d=[1, 1, ..., 1, 1] (97): NO CHANGE ... (1545): NO CHANGE\n k = 0 # (16): k=0 (98): k=0 ... (1546): k=0\n for i, v in enumerate(t): # (17): i=0, v=1 (21): i=1 ... (1607): NO CHANGE\n d[i] = (k + d[i]) % mod # (18): NO CHANGE (22): d=[1.0, 2.0, ..., 1, 1] ... (1605): NO CHANGE\n if j == v: # (19): NO CHANGE (23): NO CHANGE ... (1606): NO CHANGE\n k = (k + a[i]) % mod # (20): k=1.0 (24): k=2.0 ... (1537): k=730481688.0\n d[-1] = (k + d[-1]) % mod # (94): d=[1.0, 2.0, ..., 17.0, 17.0] (176): d=[1.0, 3.0, ..., 153.0, 153.0] ... (1608): NO CHANGE\n a = d[:] # (95): a=[1.0, 2.0, ..., 17.0, 17.0] (177): a=[1.0, 3.0, ..., 153.0, 153.0] ... (1609): NO CHANGE\n print(a[-1])\n \n \n \nmain() # (8): NO CHANGE\n"], "anno_status": [false], "diff_content": " import sys\n from math import ceil\n \n def input():\n return sys.stdin.readline().strip()\n \n def iinput():\n return int(input())\n \n def finput():\n return float(input())\n \n def tinput():\n return input().split()\n \n def rinput():\n return map(int, tinput())\n \n def rlinput():\n return list(rinput())\n \n def nok(a, b):\n m = a * b\n while a != 0 and b != 0:\n if a > b:\n a %= b\n else:\n b %= a\n return m \n \n \n def main():\n mod = 1e9 + 7\n n, m = rinput()\n s = rlinput()\n t = rlinput()\n a = [1] * (m + 1)\n for j in s:\n d = a[:]\n k = 0\n for i, v in enumerate(t):\n d[i] = (k + d[i]) % mod\n if j == v:\n k = (k + a[i]) % mod\n d[-1] = (k + d[-1]) % mod\n a = d[:]\n- print(a[-1])\n+ print(int(a[-1]))\n \n \n \n main()\n", "FL_content": "\n import sys\n-from math import ceil\n \n def input():\n return sys.stdin.readline().strip()\n \n def iinput():\n return int(input())\n \n def finput():\n return float(input())\n \n def tinput():\n return input().split()\n \n def rinput():\n return map(int, tinput())\n \n def rlinput():\n return list(rinput())\n \n def nok(a, b):\n m = a * b\n while a != 0 and b != 0:\n if a > b:\n a %= b\n else:\n b %= a\n return m \n \n \n def main():\n- mod = 1e9 + 7\n n, m = rinput()\n s = rlinput()\n t = rlinput()\n a = [1] * (m + 1)\n for j in s:\n d = a[:]\n k = 0\n for i, v in enumerate(t):\n d[i] = (k + d[i]) % mod\n if j == v:\n k = (k + a[i]) % mod\n d[-1] = (k + d[-1]) % mod\n a = d[:]\n print(a[-1])\n \n \n \n main()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 51 }, { "user_id": "u847758719", "problem_id": "p02916", "submission1_id": "s906488466-FL", "submission2_id": "s274691462", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = input().split()\nb = input().split()\nc = input().split()\n\nresult = 0\nj = 0\nfor i in a:\n m = int(i) - 1\n result += int(b[m])\n if (not (m == 0)) and (j + 1 == m):\n result += int(c[j])\n j = m\nprint(result)", "code2": "n = int(input())\na = input().split()\nb = input().split()\nc = input().split()\n\nresult = 0\nj = 0\nisFirst = True\nfor i in a:\n m = int(i) - 1\n result += int(b[m])\n if (not (isFirst)) and (j + 1 == m):\n result += int(c[j])\n j = m\n isFirst = False\nprint(result)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567909611", "date2": "1567909873", "bleu_score": "0.8422643784700724", "code1_test_status": [1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0], "code1_test_score": 32, "total_score": 103, "input": "4\n2 3 4 1\n14 10 1 70\n8 6 16\n", "actual_output": "125\n", "expected_output": "117\n\n", "anno_code": ["n = int(input()) # (0): n=4\na = input().split() # (1): a=['2', '3', '4', '1']\nb = input().split() # (2): b=['14', '10', '1', '70']\nc = input().split() # (3): c=['8', '6', '16']\n\nresult = 0 # (4): result=0\nj = 0 # (5): j=0\nfor i in a: # (6): i=2 (12): i=3 ... (29): NO CHANGE\n m = int(i) - 1 # (7): m=1 (13): m=2 ... (25): m=0\n result += int(b[m]) # (8): result=10 (14): result=19 ... (26): result=125\n if (not (m == 0)) and (j + 1 == m): # (9): NO CHANGE (15): NO CHANGE ... (27): NO CHANGE\n result += int(c[j]) # (10): result=18 (16): result=25 (22): result=111\n j = m # (11): j=1 (17): j=2 ... (28): j=0\nprint(result)"], "anno_status": [true], "diff_content": " n = int(input())\n a = input().split()\n b = input().split()\n c = input().split()\n \n result = 0\n j = 0\n+isFirst = True\n for i in a:\n m = int(i) - 1\n result += int(b[m])\n- if (not (m == 0)) and (j + 1 == m):\n+ if (not (isFirst)) and (j + 1 == m):\n result += int(c[j])\n j = m\n+ isFirst = False\n print(result)\n", "FL_content": "\n n = int(input())\n a = input().split()\n b = input().split()\n c = input().split()\n \n result = 0\n j = 0\n for i in a:\n m = int(i) - 1\n result += int(b[m])\n- if (not (m == 0)) and (j + 1 == m):\n result += int(c[j])\n- j = m\n print(result)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u624696727", "problem_id": "p02899", "submission1_id": "s051751914-FL", "submission2_id": "s376882735", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nsys.setrecursionlimit(10 ** 6)\nint1 = lambda x: int(x) - 1\np2D = lambda x: print(*x, sep=\"\\n\")\ndef IS(): return sys.stdin.readline()[:-1]\ndef II(): return int(sys.stdin.readline())\ndef MI(): return map(int, sys.stdin.readline().split())\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef LI1(): return list(map(int1, sys.stdin.readline().split()))\ndef LII(rows_number): return [II() for _ in range(rows_number)]\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\ndef LLI1(rows_number): return [LI1() for _ in range(rows_number)]\n\ndef main():\n\tN = II()\n\tA = LI()\n\torder = [0]*N\n\tfor i,a in enumerate(A):\n\t\torder[a-1] = i+1\n\tA = list(map(str,A))\n\tprint(\"\".join(A))\n\nmain()", "code2": "import sys\n\nsys.setrecursionlimit(10 ** 6)\nint1 = lambda x: int(x) - 1\np2D = lambda x: print(*x, sep=\"\\n\")\ndef IS(): return sys.stdin.readline()[:-1]\ndef II(): return int(sys.stdin.readline())\ndef MI(): return map(int, sys.stdin.readline().split())\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef LI1(): return list(map(int1, sys.stdin.readline().split()))\ndef LII(rows_number): return [II() for _ in range(rows_number)]\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\ndef LLI1(rows_number): return [LI1() for _ in range(rows_number)]\n\ndef main():\n\tN = II()\n\tA = LI()\n\torder = [0]*N\n\tfor i,a in enumerate(A):\n\t\torder[a-1] = i+1\n\torder = list(map(str,order))\n\tprint(\" \".join(order))\n\nmain()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1581279332", "date2": "1581281486", "bleu_score": "0.9694781727170962", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 11, "input": "3\n2 -2 3\n", "actual_output": "2-23\n", "expected_output": "2 1 3 \n\n", "anno_code": ["import sys\n\nsys.setrecursionlimit(10 ** 6) # (0): NO CHANGE\nint1 = lambda x: int(x) - 1 # (1): int1= at 0x0000018A7EB49BD0>\np2D = lambda x: print(*x, sep=\"\\n\") # (2): p2D= at 0x0000018A7EB49B40>, IS=, II=, MI=, LI=, LI1=, LII=, LLI=, LLI1=\ndef IS(): return sys.stdin.readline()[:-1]\ndef II(): return int(sys.stdin.readline())\ndef MI(): return map(int, sys.stdin.readline().split())\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef LI1(): return list(map(int1, sys.stdin.readline().split()))\ndef LII(rows_number): return [II() for _ in range(rows_number)]\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\ndef LLI1(rows_number): return [LI1() for _ in range(rows_number)]\n\ndef main(): # (3): main=\n\tN = II() # (5): N=3\n\tA = LI() # (6): A=[2, -2, 3]\n\torder = [0]*N # (7): order=[0, 0, 0]\n\tfor i,a in enumerate(A): # (8): i=0, a=2 (10): i=1, a=-2 ... (14): NO CHANGE\n\t\torder[a-1] = i+1 # (9): order=[0, 1, 0] (11): order=[2, 1, 0] (13): order=[2, 1, 3]\n\tA = list(map(str,A)) # (15): A=['2', '-2', '3']\n\tprint(\"\".join(A))\n\nmain() # (4): NO CHANGE\n"], "anno_status": [true], "diff_content": " import sys\n \n sys.setrecursionlimit(10 ** 6)\n int1 = lambda x: int(x) - 1\n p2D = lambda x: print(*x, sep=\"\\n\")\n def IS(): return sys.stdin.readline()[:-1]\n def II(): return int(sys.stdin.readline())\n def MI(): return map(int, sys.stdin.readline().split())\n def LI(): return list(map(int, sys.stdin.readline().split()))\n def LI1(): return list(map(int1, sys.stdin.readline().split()))\n def LII(rows_number): return [II() for _ in range(rows_number)]\n def LLI(rows_number): return [LI() for _ in range(rows_number)]\n def LLI1(rows_number): return [LI1() for _ in range(rows_number)]\n \n def main():\n \tN = II()\n \tA = LI()\n \torder = [0]*N\n \tfor i,a in enumerate(A):\n \t\torder[a-1] = i+1\n-\tA = list(map(str,A))\n-\tprint(\"\".join(A))\n+\torder = list(map(str,order))\n+\tprint(\" \".join(order))\n \n main()\n", "FL_content": "\n import sys\n \n sys.setrecursionlimit(10 ** 6)\n int1 = lambda x: int(x) - 1\n p2D = lambda x: print(*x, sep=\"\\n\")\n def IS(): return sys.stdin.readline()[:-1]\n def II(): return int(sys.stdin.readline())\n def MI(): return map(int, sys.stdin.readline().split())\n def LI(): return list(map(int, sys.stdin.readline().split()))\n def LI1(): return list(map(int1, sys.stdin.readline().split()))\n def LII(rows_number): return [II() for _ in range(rows_number)]\n def LLI(rows_number): return [LI() for _ in range(rows_number)]\n def LLI1(rows_number): return [LI1() for _ in range(rows_number)]\n \n def main():\n \tN = II()\n \tA = LI()\n \torder = [0]*N\n \tfor i,a in enumerate(A):\n \t\torder[a-1] = i+1\n-\tA = list(map(str,A))\n-\tprint(\"\".join(A))\n \n main()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u023141436", "problem_id": "p02909", "submission1_id": "s475511386-FL", "submission2_id": "s673525808", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\nif s == \"Sunny\":\n\tprint(\"Cloudy\")\nelif s == \"Cloudy\":\n\tprint(\"Rainy\")\nelif s == \"Rainy\":\n\tprint(\"Rainy\")", "code2": "s = input()\n\nif s == \"Sunny\":\n\tprint(\"Cloudy\")\nelif s == \"Cloudy\":\n\tprint(\"Rainy\")\nelif s == \"Rainy\":\n\tprint(\"Sunny\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568595709", "date2": "1568595977", "bleu_score": "0.9608889364388631", "code1_test_status": [0, 1], "code1_test_score": 1, "total_score": 2, "input": "Rainy\n", "actual_output": "Rainy\n", "expected_output": "Sunny\n", "anno_code": ["s = input() # (0): s=Rainy\n\nif s == \"Sunny\": # (1): NO CHANGE\n\tprint(\"Cloudy\")\nelif s == \"Cloudy\": # (2): NO CHANGE\n\tprint(\"Rainy\")\nelif s == \"Rainy\": # (3): NO CHANGE\n\tprint(\"Rainy\")"], "anno_status": [true], "diff_content": " s = input()\n \n if s == \"Sunny\":\n \tprint(\"Cloudy\")\n elif s == \"Cloudy\":\n \tprint(\"Rainy\")\n elif s == \"Rainy\":\n-\tprint(\"Rainy\")\n+\tprint(\"Sunny\")\n", "FL_content": "\n s = input()\n \n if s == \"Sunny\":\n \tprint(\"Cloudy\")\n elif s == \"Cloudy\":\n \tprint(\"Rainy\")\n elif s == \"Rainy\":\n-\tprint(\"Rainy\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u749770850", "problem_id": "p03129", "submission1_id": "s806949686-FL", "submission2_id": "s254725479", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int, input().split())\nprint( \"YES\" if n -k >= 1 else \"NO\")", "code2": "n, k = map(int, input().split())\n\nif k * 2 -1 <= n:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584246708", "date2": "1584247396", "bleu_score": "0.601688432330959", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 51, "total_score": 60, "input": "51 27\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["n, k = map(int, input().split()) # (0): n=51, k=27\nprint( \"YES\" if n -k >= 1 else \"NO\")"], "anno_status": [true], "diff_content": " n, k = map(int, input().split())\n-print( \"YES\" if n -k >= 1 else \"NO\")\n+\n+if k * 2 -1 <= n:\n+\tprint(\"YES\")\n+else:\n+\tprint(\"NO\")\n", "FL_content": "\n n, k = map(int, input().split())\n-print( \"YES\" if n -k >= 1 else \"NO\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 2 }, { "user_id": "u337626942", "problem_id": "p03147", "submission1_id": "s485632901-FL", "submission2_id": "s909688610", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nh=list(map(int, input().split()))\nans=0\n\nfor i in range(n-1):\n ans+=max(h[i+1]-h[i], 0)\n\nprint(ans)", "code2": "n=int(input())\nh=[0]+list(map(int, input().split()))\nans=0\n\nfor i in range(n):\n ans+=max(h[i+1]-h[i],0)\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590088783", "date2": "1590088912", "bleu_score": "0.9262857197456473", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 3, "total_score": 99, "input": "8\n4 2 75 0 21 13 66 101\n", "actual_output": "182\n", "expected_output": "186\n\n", "anno_code": ["n=int(input()) # (0): n=8\nh=list(map(int, input().split())) # (1): h=[4, 2, 75, 0, 21, 13, 66, 101]\nans=0 # (2): ans=0\n\nfor i in range(n-1): # (3): i=0 (5): i=1 ... (17): NO CHANGE\n ans+=max(h[i+1]-h[i], 0) # (4): NO CHANGE (6): ans=73 ... (16): ans=182\n\nprint(ans)"], "anno_status": [true], "diff_content": " n=int(input())\n-h=list(map(int, input().split()))\n+h=[0]+list(map(int, input().split()))\n ans=0\n \n-for i in range(n-1):\n- ans+=max(h[i+1]-h[i], 0)\n+for i in range(n):\n+ ans+=max(h[i+1]-h[i],0)\n \n print(ans)\n", "FL_content": "\n n=int(input())\n h=list(map(int, input().split()))\n ans=0\n \n-for i in range(n-1):\n ans+=max(h[i+1]-h[i], 0)\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u698919163", "problem_id": "p03945", "submission1_id": "s002899941-FL", "submission2_id": "s658853591", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\n\ncount = 0\ncheck = S[0]\n\nfor i in S[1:]:\n if check != S:\n count+=1\n check = i\n \nprint(count)", "code2": "S = input()\ncount = 0\ncheck = S[0]\n\nfor i in S[1:]:\n if check != i:\n count+=1\n check = i\n \nprint(count)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583614976", "date2": "1583615127", "bleu_score": "0.9680541113369007", "code1_test_status": [0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1], "code1_test_score": 35, "total_score": 103, "input": "XWVUWW\n", "actual_output": "5\n", "expected_output": "4\n\n", "anno_code": ["S = input() # (0): S=XWVUWW\n\ncount = 0 # (1): count=0\ncheck = S[0] # (2): check=X\n\nfor i in S[1:]: # (3): i=W (7): i=V ... (23): NO CHANGE\n if check != S: # (4): NO CHANGE (8): NO CHANGE ... (20): NO CHANGE\n count+=1 # (5): count=1 (9): count=2 ... (21): count=5\n check = i # (6): check=W (10): check=V ... (22): NO CHANGE\n \nprint(count)"], "anno_status": [true], "diff_content": " S = input()\n-\n count = 0\n check = S[0]\n \n for i in S[1:]:\n- if check != S:\n+ if check != i:\n count+=1\n check = i\n \n print(count)\n+\n", "FL_content": "\n S = input()\n \n count = 0\n check = S[0]\n \n for i in S[1:]:\n- if check != S:\n count+=1\n check = i\n \n print(count)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u819048695", "problem_id": "p03313", "submission1_id": "s091809122-FL", "submission2_id": "s870573826", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nA=list(map(int,input().split()))\ndata=[[] for i in range(2**N)]\ndata[0]=[0,0]\nif A[1]>A[0]:\n data[1]=[1,0]\nelse:\n data[1]=[0,1]\nans=[0]*2**N\nans[1]=sum(A[0:2])\nfor i in range(2,2**N):\n ans[i]=ans[i-1]\n h=[[A[i],i]]\n for j in range(N):\n if i&(1<ans[i]:\n ans[i]=h[0][0]+h[1][0]\n data[i]=[h[0][1],h[1][1]]\n else:\n data[i]=data[i-1][:]\nfor i in range(1,2**N):\n print(ans[i])", "code2": "N=int(input())\nA=list(map(int,input().split()))+[0]\n\ndata=[[] for i in range(2**N)]\n\nfor i in range(1,2**N):\n for j in range(N):\n if i&(1<=A[a]:\n a,b=c,d\n elif A[c]>A[a]:\n a,b=c,a\n elif A[a]>=A[c]>A[b] and a!=c:\n b=c\n elif A[a]>=A[d]>A[b] and a!=d:\n b=d\n MAX[k]=a\n semiMAX[k]=b\n K.append(max(K[-1],A[a]+A[b]))\n\nfor u in K:\n print(u)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1578674872", "date2": "1580744786", "bleu_score": "0.6254154579229406", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 12, "total_score": 103, "input": "3\n3 312 59 33 0 9 17 82\n", "actual_output": "315\n315\n345\n345\n345\n345\n394\n", "expected_output": "315\n315\n371\n371\n371\n371\n394\n\n", "anno_code": ["N=int(input()) # (0): N=3\nA=list(map(int,input().split())) # (1): A=[3, 312, 59, 33, 0, 9, 17, 82]\ndata=[[] for i in range(2**N)] # (2): data\ndata[0]=[0,0] # (3): data\nif A[1]>A[0]: # (4): data\n data[1]=[1,0] # (5): data\nelse:\n data[1]=[0,1]\nans=[0]*2**N # (6): data, ans=[0, 0, 0, 0, 0, 0, 0, 0]\nans[1]=sum(A[0:2]) # (7): data, ans=[0, 315, 0, 0, 0, 0, 0, 0]\nfor i in range(2,2**N): # (8): data=[[0, 0], [1, 0], [], [], [], [], [], []], i=2 (31): data, i=3 ... (184): NO CHANGE\n ans[i]=ans[i-1] # (9): data=[[0, 0], [1, 0], [], [], [], [], [], []], ans=[0, 315, 315, 0, 0, 0, 0, 0] (32): data=[[0, 0], [1, 0], [1, 0], [], [], [], [], []], ans=[0, 315, 315, 315, 0, 0, 0, 0] ... (148): data, ans=[0, 315, 315, 345, 345, 345, 345, 345]\n h=[[A[i],i]] # (10): data=[[0, 0], [1, 0], [], [], [], [], [], []], h (33): data, h ... (149): data=[[0, 0], [1, 0], [1, 0], [1, 3], [1, 3], [1, 3], [1, 3], []], h\n for j in range(N): # (11): data, j=0 (14): data, j=1 ... (179): data\n if i&(1<ans[i]: # (29): data (59): data ... (181): data\n ans[i]=h[0][0]+h[1][0] # (60): data=[[0, 0], [1, 0], [1, 0], [], [], [], [], []], ans=[0, 315, 315, 345, 0, 0, 0, 0] (182): data, ans=[0, 315, 315, 345, 345, 345, 345, 394]\n data[i]=[h[0][1],h[1][1]] # (61): data (183): data\n else:\n data[i]=data[i-1][:] # (30): data (84): data ... (146): data\nfor i in range(1,2**N): # (185): i=1 (187): i=2 ... (197): i=7\n print(ans[i]) # (186): NO CHANGE (188): NO CHANGE ... (198): NO CHANGE\n"], "anno_status": [false], "diff_content": " N=int(input())\n-A=list(map(int,input().split()))\n+A=list(map(int,input().split()))+[0]\n+\n data=[[] for i in range(2**N)]\n-data[0]=[0,0]\n-if A[1]>A[0]:\n- data[1]=[1,0]\n-else:\n- data[1]=[0,1]\n-ans=[0]*2**N\n-ans[1]=sum(A[0:2])\n-for i in range(2,2**N):\n- ans[i]=ans[i-1]\n- h=[[A[i],i]]\n+\n+for i in range(1,2**N):\n for j in range(N):\n if i&(1<ans[i]:\n- ans[i]=h[0][0]+h[1][0]\n- data[i]=[h[0][1],h[1][1]]\n- else:\n- data[i]=data[i-1][:]\n-for i in range(1,2**N):\n- print(ans[i])\n+ data[i].append(i-(1<=A[a]:\n+ a,b=c,d\n+ elif A[c]>A[a]:\n+ a,b=c,a\n+ elif A[a]>=A[c]>A[b] and a!=c:\n+ b=c\n+ elif A[a]>=A[d]>A[b] and a!=d:\n+ b=d\n+ MAX[k]=a\n+ semiMAX[k]=b\n+ K.append(max(K[-1],A[a]+A[b]))\n+\n+for u in K:\n+ print(u)\n", "FL_content": "\n N=int(input())\n A=list(map(int,input().split()))\n data=[[] for i in range(2**N)]\n data[0]=[0,0]\n if A[1]>A[0]:\n data[1]=[1,0]\n else:\n data[1]=[0,1]\n ans=[0]*2**N\n ans[1]=sum(A[0:2])\n for i in range(2,2**N):\n ans[i]=ans[i-1]\n h=[[A[i],i]]\n for j in range(N):\n if i&(1<ans[i]:\n ans[i]=h[0][0]+h[1][0]\n data[i]=[h[0][1],h[1][1]]\n else:\n data[i]=data[i-1][:]\n for i in range(1,2**N):\n print(ans[i])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 34 }, { "user_id": "u144913062", "problem_id": "p03689", "submission1_id": "s755380031-FL", "submission2_id": "s353013451", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, W, h, w = map(int, input().split())\nif H % h == 0 and W % h == 0:\n print('No')\n exit()\nprint('Yes')\na = [[1] * W for _ in range(H)]\nfor i in range(h-1, H, h):\n for j in range(w-1, W, w):\n a[i][j] = -h * w\nfor row in a:\n print(*row)\n", "code2": "H, W, h, w = map(int, input().split())\nrem = H * W - (H - H % h) * (W - W % w)\nif rem == 0:\n print('No')\n exit()\nx = (H \nif abs(x) > 10**9 or abs(-(h * w - 1) * x - 1) > 10**9:\n print('No')\n exit()\nprint('Yes')\na = [[x] * W for _ in range(H)]\nfor i in range(h-1, H, h):\n for j in range(w-1, W, w):\n a[i][j] = -(h * w - 1) * x - 1\nfor row in a:\n print(*row)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1593796003", "date2": "1593797633", "bleu_score": "0.6208001415315565", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 3, "total_score": 96, "input": "1 11 4 3\n", "actual_output": "Yes\n1 1 1 1 1 1 1 1 1 1 1\n", "expected_output": "Yes\n1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000\n\n", "anno_code": ["H, W, h, w = map(int, input().split()) # (0): H=1, W=11, h=4, w=3\nif H % h == 0 and W % h == 0: # (1): NO CHANGE\n print('No')\n exit()\nprint('Yes') # (2): NO CHANGE\na = [[1] * W for _ in range(H)] # (3): a\nfor i in range(h-1, H, h): # (4): NO CHANGE\n for j in range(w-1, W, w):\n a[i][j] = -h * w\nfor row in a: # (5): row=[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]\n print(*row) # (6): NO CHANGE\n"], "anno_status": [true], "diff_content": " H, W, h, w = map(int, input().split())\n-if H % h == 0 and W % h == 0:\n+rem = H * W - (H - H % h) * (W - W % w)\n+if rem == 0:\n+ print('No')\n+ exit()\n+x = (H \n+if abs(x) > 10**9 or abs(-(h * w - 1) * x - 1) > 10**9:\n print('No')\n exit()\n print('Yes')\n-a = [[1] * W for _ in range(H)]\n+a = [[x] * W for _ in range(H)]\n for i in range(h-1, H, h):\n for j in range(w-1, W, w):\n- a[i][j] = -h * w\n+ a[i][j] = -(h * w - 1) * x - 1\n for row in a:\n print(*row)\n \n", "FL_content": "\n H, W, h, w = map(int, input().split())\n if H % h == 0 and W % h == 0:\n print('No')\n exit()\n print('Yes')\n a = [[1] * W for _ in range(H)]\n-for i in range(h-1, H, h):\n- for j in range(w-1, W, w):\n- a[i][j] = -h * w\n for row in a:\n print(*row)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u707870100", "problem_id": "p04039", "submission1_id": "s726895938-FL", "submission2_id": "s653932056", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\n\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\nn=hoge[0]\nk=hoge[1]\n\nd=[]\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\nfor i in range(0,k):\n\td.append(hoge[i])\n\npayment=0\nfor i in range(0,10000-n+1):\n\tpayment=n+i\n\tfor j in range(0,k):\n\t\tif(str(d[j]) in str(payment)):\n\t\t\tbreak\n\t\tif(j==k-1):\n\t\t\tprint(payment)\n\t\t\tsys.exit()", "code2": "\n\nimport sys\n\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\nn=hoge[0]\nk=hoge[1]\n\nd=[]\ntmp = input().split()\nhoge = list(map(lambda a: int(a), tmp))\nfor i in range(0,k):\n\td.append(hoge[i])\n\npayment=0\nfor i in range(0,100000):\n\tpayment=n+i\n\tfor j in range(0,k):\n\t\tif(str(d[j]) in str(payment)):\n\t\t\tbreak\n\t\tif(j==k-1):\n\t\t\tprint(payment)\n\t\t\tsys.exit()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564589334", "date2": "1564589634", "bleu_score": "0.9848964880107537", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 72, "total_score": 94, "input": "19738 1\n-1\n", "actual_output": "no output\n", "expected_output": "19738\n\n", "anno_code": ["\n\nimport sys\n\ntmp = input().split() # (0): tmp=['19738', '1']\nhoge = list(map(lambda a: int(a), tmp)) # (1): hoge=[19738, 1]\nn=hoge[0] # (2): n=19738\nk=hoge[1] # (3): k=1\n\nd=[] # (4): d=[]\ntmp = input().split() # (5): tmp=['-1']\nhoge = list(map(lambda a: int(a), tmp)) # (6): hoge=[-1]\nfor i in range(0,k): # (7): i=0 (9): NO CHANGE\n\td.append(hoge[i]) # (8): d=[-1]\n\npayment=0 # (10): payment=0\nfor i in range(0,10000-n+1):\n\tpayment=n+i\n\tfor j in range(0,k):\n\t\tif(str(d[j]) in str(payment)):\n\t\t\tbreak\n\t\tif(j==k-1):\n\t\t\tprint(payment)\n\t\t\tsys.exit()"], "anno_status": [true], "diff_content": " \n \n import sys\n \n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n n=hoge[0]\n k=hoge[1]\n \n d=[]\n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n for i in range(0,k):\n \td.append(hoge[i])\n \n payment=0\n-for i in range(0,10000-n+1):\n+for i in range(0,100000):\n \tpayment=n+i\n \tfor j in range(0,k):\n \t\tif(str(d[j]) in str(payment)):\n \t\t\tbreak\n \t\tif(j==k-1):\n \t\t\tprint(payment)\n \t\t\tsys.exit()\n", "FL_content": "\n \n \n import sys\n \n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n n=hoge[0]\n k=hoge[1]\n \n d=[]\n tmp = input().split()\n hoge = list(map(lambda a: int(a), tmp))\n for i in range(0,k):\n \td.append(hoge[i])\n \n payment=0\n for i in range(0,10000-n+1):\n \tpayment=n+i\n \tfor j in range(0,k):\n-\t\tif(str(d[j]) in str(payment)):\n-\t\t\tbreak\n-\t\tif(j==k-1):\n-\t\t\tprint(payment)\n-\t\t\tsys.exit()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u063056051", "problem_id": "p02237", "submission1_id": "s254031710-FL", "submission2_id": "s022518739", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\nn=int(input())\nlist1=[[0 for i in range(n)] for j in range(n)]\n\n\nfor i in range(n):\n\ta=list(map(int,input().split()))\n\t\n\tif a[1]>0:\n\t\tfor j in range(2,len(a)):\n\t\t\tlist1[i][a[j]-1]=1\n\t\t\t\nprint(list1)\n\n\n", "code2": "\nn=int(input())\nlist1=[[0 for i in range(n)] for j in range(n)]\n\n\nfor i in range(n):\n\ta=list(map(int,input().split()))\n\t\n\tif a[1]>0:\n\t\tfor j in range(2,len(a)):\n\t\t\tlist1[i][a[j]-1]=1\n\t\t\t\nfor i in range(n):\n\tprint(*list1[i])\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1529748522", "date2": "1529748840", "bleu_score": "0.8733475046554567", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "4\n1 2 1 4\n2 1 4\n3 -4\n0 1 4\n", "actual_output": "[[1, 0, 0, 1], [0, 0, 0, 1], [0, 0, 0, 0], [0, 0, 0, 1]]\n", "expected_output": "1 0 0 1\n0 0 0 1\n0 0 0 0\n0 0 0 1\n\n", "anno_code": ["\n\n\n\nn=int(input()) # (0): n=4\nlist1=[[0 for i in range(n)] for j in range(n)] # (1): list1\n\n\nfor i in range(n): # (2): i=0 (10): i=1 ... (25): NO CHANGE\n\ta=list(map(int,input().split())) # (3): a=[1, 2, 1, 4] (11): a=[2, 1, 4] ... (20): a=[0, 1, 4]\n\t\n\tif a[1]>0: # (4): NO CHANGE (12): NO CHANGE ... (21): NO CHANGE\n\t\tfor j in range(2,len(a)): # (5): j=2 (7): j=3 ... (24): NO CHANGE\n\t\t\tlist1[i][a[j]-1]=1 # (6): list1 (8): list1 ... (23): list1\n\t\t\t\nprint(list1)\n\n\n"], "anno_status": [true], "diff_content": " \n-\n-\n-\n n=int(input())\n list1=[[0 for i in range(n)] for j in range(n)]\n \n \n for i in range(n):\n \ta=list(map(int,input().split()))\n \t\n \tif a[1]>0:\n \t\tfor j in range(2,len(a)):\n \t\t\tlist1[i][a[j]-1]=1\n \t\t\t\n-print(list1)\n-\n+for i in range(n):\n+\tprint(*list1[i])\n \n \n", "FL_content": "\n \n \n \n \n n=int(input())\n list1=[[0 for i in range(n)] for j in range(n)]\n \n \n for i in range(n):\n \ta=list(map(int,input().split()))\n \t\n \tif a[1]>0:\n \t\tfor j in range(2,len(a)):\n-\t\t\tlist1[i][a[j]-1]=1\n \t\t\t\n-print(list1)\n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u910426639", "problem_id": "p02702", "submission1_id": "s223157666-FL", "submission2_id": "s360066597", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nN = len(S)\n\nmap_ = [-1] * 2019\nmap_[0] = 0\nans = 0\nnow = 0\nfor i in range(0, N + 1):\n now = (now + int(S[N - i - 1]) * pow(10, i, 2019)) % 2019\n map_[now] += 1\n ans += map_[now]\n\nprint(ans)", "code2": "S = input()\nN = len(S)\n\nmap_ = [-1] * 2019\nmap_[0] = 0\nans = 0\nnow = 0\nfor i in range(0, N):\n now = (now + int(S[N - i - 1]) * pow(10, i, 2019)) % 2019\n map_[now] += 1\n ans += map_[now]\n\nprint(ans)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1588166884", "date2": "1588167090", "bleu_score": "0.973576688957571", "code1_test_status": [0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 61, "total_score": 74, "input": "3054417607960\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["S = input() # (0): S=3054417607960\nN = len(S) # (1): N=13\n\nmap_ = [-1] * 2019 # (2): map_=[-1, -1, ..., -1, -1]\nmap_[0] = 0 # (3): map_=[0, -1, ..., -1, -1]\nans = 0 # (4): ans=0\nnow = 0 # (5): now=0\nfor i in range(0, N + 1): # (6): i=0 (10): i=1 ... (62): NO CHANGE\n now = (now + int(S[N - i - 1]) * pow(10, i, 2019)) % 2019 # (7): NO CHANGE (11): now=60 ... (59): NO CHANGE\n map_[now] += 1 # (8): map_=[1, -1, ..., -1, -1] (12): map_=[1, -1, ..., -1, -1] ... (60): map_=[1, -1, ..., -1, -1]\n ans += map_[now] # (9): ans=1 (13): NO CHANGE ... (61): ans=4\n\nprint(ans)"], "anno_status": [true], "diff_content": " S = input()\n N = len(S)\n \n map_ = [-1] * 2019\n map_[0] = 0\n ans = 0\n now = 0\n-for i in range(0, N + 1):\n+for i in range(0, N):\n now = (now + int(S[N - i - 1]) * pow(10, i, 2019)) % 2019\n map_[now] += 1\n ans += map_[now]\n \n print(ans)\n+\n", "FL_content": "\n S = input()\n N = len(S)\n \n map_ = [-1] * 2019\n map_[0] = 0\n ans = 0\n now = 0\n for i in range(0, N + 1):\n now = (now + int(S[N - i - 1]) * pow(10, i, 2019)) % 2019\n map_[now] += 1\n ans += map_[now]\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u986478725", "problem_id": "p02420", "submission1_id": "s643214879-FL", "submission2_id": "s245245936", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\ndef numinput():\n a = input().split()\n for i in range(len(a)):\n a[i] = int(a[i])\n return a\n\ndef main():\n while True:\n string = input()\n if string == \"-\": break\n n = int(input()) \n for i in range(n):\n h = int(input())\n front = string[0 : h]\n back = string[h : len(string) - h]\n string = back + front\n print(string)\n\nif __name__ == \"__main__\":\n main()\n", "code2": "\n\ndef main():\n while True:\n string = input()\n if string == \"-\": break\n n = int(input()) \n for i in range(n):\n h = int(input())\n front = string[0 : h] \n back = string[h : len(string)] \n string = back + front\n print(string)\n\nif __name__ == \"__main__\":\n main()\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1527343884", "date2": "1527344466", "bleu_score": "0.7211265111950147", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "acaa\n3\n1\n0\n2\nyzxwv\n2\n2\n2\n-\n", "actual_output": "ca\nxy\n", "expected_output": "aaca\nvyzxw\n\n", "anno_code": ["\n\ndef numinput(): # (0): numinput=\n a = input().split()\n for i in range(len(a)):\n a[i] = int(a[i])\n return a\n\ndef main(): # (1): main=\n while True:\n string = input()\n if string == \"-\": break\n n = int(input()) \n for i in range(n):\n h = int(input())\n front = string[0 : h]\n back = string[h : len(string) - h]\n string = back + front\n print(string)\n\nif __name__ == \"__main__\":\n main()\n"], "anno_status": [true], "diff_content": " \n \n-def numinput():\n- a = input().split()\n- for i in range(len(a)):\n- a[i] = int(a[i])\n- return a\n-\n def main():\n while True:\n string = input()\n if string == \"-\": break\n n = int(input()) \n for i in range(n):\n h = int(input())\n- front = string[0 : h]\n- back = string[h : len(string) - h]\n+ front = string[0 : h] \n+ back = string[h : len(string)] \n string = back + front\n print(string)\n \n if __name__ == \"__main__\":\n main()\n \n", "FL_content": "\n \n \n def numinput():\n a = input().split()\n for i in range(len(a)):\n a[i] = int(a[i])\n return a\n \n def main():\n while True:\n string = input()\n if string == \"-\": break\n n = int(input()) \n for i in range(n):\n h = int(input())\n front = string[0 : h]\n back = string[h : len(string) - h]\n string = back + front\n print(string)\n \n if __name__ == \"__main__\":\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 23 }, { "user_id": "u280512618", "problem_id": "p03719", "submission1_id": "s749413787-FL", "submission2_id": "s496988763", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=map(int,input().split())\nprint('Yes' if a<=b and b<=c else 'No')", "code2": "a,b,c=map(int,input().split())\nprint('Yes' if a<=c and c<=b else 'No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553950489", "date2": "1553950506", "bleu_score": "0.9360313564621927", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0], "code1_test_score": 16, "total_score": 21, "input": "-1 3 -1\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["a,b,c=map(int,input().split()) # (0): a=-1, b=3, c=-1\nprint('Yes' if a<=b and b<=c else 'No')"], "anno_status": [true], "diff_content": " a,b,c=map(int,input().split())\n-print('Yes' if a<=b and b<=c else 'No')\n+print('Yes' if a<=c and c<=b else 'No')\n", "FL_content": "\n a,b,c=map(int,input().split())\n-print('Yes' if a<=b and b<=c else 'No')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 2 }, { "user_id": "u940190657", "problem_id": "p00015", "submission1_id": "s656748883-FL", "submission2_id": "s856329787", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n n = int(input())\n\n for i in range(n):\n val1 = int(input())\n val2 = int(input())\n print(str(val1 + val2))\n\nif __name__ == '__main__':\n main()", "code2": "def main():\n n = int(input())\n\n for i in range(n):\n result = str(int(input()) + int(input()))\n\n if len(result) > 80:\n print(\"overflow\")\n else:\n print(result)\n\nif __name__ == '__main__':\n main()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1433666693", "date2": "1433667088", "bleu_score": "0.6315722649505564", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "6\n1000\n38\n38060050512103967751821046555123274986471\n3\n748965102781050937681387220428718693622269067764748925491378558113447551883527603\n0\n14923344184498858993988796745669562170196205905706056613273758587721771662780252\n2\n101000000000100000000000000000000000000000000000000000000001000000000000100001000\n0\n110000000001000000000000000000000000000000001001000000000001000000000000000000000\n110000010000000000000000000000001000000001000000000000000000000000000000000010000\n", "actual_output": "1038\n38060050512103967751821046555123274986474\n748965102781050937681387220428718693622269067764748925491378558113447551883527603\n14923344184498858993988796745669562170196205905706056613273758587721771662780254\n101000000000100000000000000000000000000000000000000000000001000000000000100001000\n220000010001000000000000000000001000000001001001000000000001000000000000000010000\n", "expected_output": "1038\n38060050512103967751821046555123274986474\noverflow\n14923344184498858993988796745669562170196205905706056613273758587721771662780254\noverflow\noverflow\n\n", "anno_code": ["def main(): # (0): main=\n n = int(input())\n\n for i in range(n):\n val1 = int(input())\n val2 = int(input())\n print(str(val1 + val2))\n\nif __name__ == '__main__':\n main()"], "anno_status": [false], "diff_content": " def main():\n n = int(input())\n \n for i in range(n):\n- val1 = int(input())\n- val2 = int(input())\n- print(str(val1 + val2))\n+ result = str(int(input()) + int(input()))\n+\n+ if len(result) > 80:\n+ print(\"overflow\")\n+ else:\n+ print(result)\n \n if __name__ == '__main__':\n main()\n", "FL_content": "\n def main():\n n = int(input())\n \n for i in range(n):\n val1 = int(input())\n val2 = int(input())\n- print(str(val1 + val2))\n \n if __name__ == '__main__':\n main()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u941407962", "problem_id": "p02589", "submission1_id": "s732337450-FL", "submission2_id": "s703959964", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys;input=sys.stdin.readline\nN, = map(int, input().split())\nMOD=998244353\nS = []\nfor _ in range(N):\n s = input().strip()\n S.append(s)\nS.sort(key=lambda x:len(x))\nD = dict()\ndd = set()\nR = 0\nfor s in S:\n l = len(s)\n d = [0]*26\n for c in dd:\n d[c] += 1\n tmp=0\n for i in range(l-1, -1, -1):\n cc = ord(s[i]) - 97\n tmp=(100*tmp+cc)%MOD\n R += d[cc]\n d[cc] = 0\n if tmp in D:\n for c in D[tmp]:\n d[c] += 1\n if i == 1:\n nn = tmp\n if l != 1:\n if nn not in D:\n D[nn] = set()\n D[nn].add(cc)\n else:\n dd.add(cc)\nprint(R)\n", "code2": "import sys;input=sys.stdin.readline\nN, = map(int, input().split())\nMOD=67280421310721\nS = []\nfor _ in range(N):\n s = input().strip()\n S.append(s)\nS.sort(key=lambda x:len(x))\nD = dict()\ndd = set()\nR = 0\nfor s in S:\n l = len(s)\n d = [0]*26\n for c in dd:\n d[c] += 1\n tmp=0\n for i in range(l-1, -1, -1):\n ee = ord(s[i]) - 97\n tmp = 100*tmp+(ee+1)\n tmp %= MOD\n R += d[ee]\n d[ee] = 0\n if tmp in D:\n for c in D[tmp]:\n d[c] += 1\n if i == 1:\n nn = tmp\n if l != 1:\n if nn not in D:\n D[nn] = set()\n D[nn].add(ee)\n else:\n dd.add(ee)\nprint(R)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597028337", "date2": "1597029944", "bleu_score": "0.9131035818434512", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 102, "input": "3\ndayxyb\nycw\naba\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["import sys;input=sys.stdin.readline\nN, = map(int, input().split()) # (0): N=3\nMOD=998244353 # (1): MOD=998244353\nS = [] # (2): S=[]\nfor _ in range(N): # (3): _=0 (6): _=1 ... (12): NO CHANGE\n s = input().strip() # (4): s=dayxyb (7): s=ycw (10): s=aba\n S.append(s) # (5): S=['dayxyb'] (8): S=['dayxyb', 'ycw'] (11): S=['dayxyb', 'ycw', 'aba']\nS.sort(key=lambda x:len(x)) # (13): S=['ycw', 'aba', 'dayxyb']\nD = dict() # (14): D={}\ndd = set() # (15): dd=set()\nR = 0 # (16): R=0\nfor s in S: # (17): s=ycw (49): s=aba ... (137): NO CHANGE\n l = len(s) # (18): l=3 (50): NO CHANGE (82): l=6\n d = [0]*26 # (19): d=[0, 0, ..., 0, 0] (51): NO CHANGE (83): NO CHANGE\n for c in dd: # (20): NO CHANGE (52): NO CHANGE (84): NO CHANGE\n d[c] += 1\n tmp=0 # (21): tmp=0 (53): tmp=0 (85): tmp=0\n for i in range(l-1, -1, -1): # (22): i=2 (29): i=1 ... (132): NO CHANGE\n cc = ord(s[i]) - 97 # (23): cc=22 (30): cc=2 ... (126): cc=3\n tmp=(100*tmp+cc)%MOD # (24): tmp=22 (31): tmp=2202 ... (127): tmp=444307767\n R += d[cc] # (25): NO CHANGE (32): NO CHANGE ... (128): NO CHANGE\n d[cc] = 0 # (26): NO CHANGE (33): NO CHANGE ... (129): NO CHANGE\n if tmp in D: # (27): NO CHANGE (34): NO CHANGE ... (130): NO CHANGE\n for c in D[tmp]: # (92): c=0 (94): NO CHANGE\n d[c] += 1 # (93): d=[1, 0, ..., 0, 0]\n if i == 1: # (28): NO CHANGE (35): NO CHANGE ... (131): NO CHANGE\n nn = tmp # (36): nn=2202 (68): nn=1 (124): nn=124232400\n if l != 1: # (45): NO CHANGE (77): NO CHANGE (133): NO CHANGE\n if nn not in D: # (46): NO CHANGE (78): NO CHANGE (134): NO CHANGE\n D[nn] = set() # (47): D={2202: set()} (79): D={2202: {24}, 1: set()} (135): D={2202: {24}, 1: {0}, 124232400: set()}\n D[nn].add(cc) # (48): D={2202: {24}} (80): D={2202: {24}, 1: {0}} (136): D={2202: {24}, 1: {0}, 124232400: {3}}\n else:\n dd.add(cc)\nprint(R)\n"], "anno_status": [false], "diff_content": " import sys;input=sys.stdin.readline\n N, = map(int, input().split())\n-MOD=998244353\n+MOD=67280421310721\n S = []\n for _ in range(N):\n s = input().strip()\n S.append(s)\n S.sort(key=lambda x:len(x))\n D = dict()\n dd = set()\n R = 0\n for s in S:\n l = len(s)\n d = [0]*26\n for c in dd:\n d[c] += 1\n tmp=0\n for i in range(l-1, -1, -1):\n- cc = ord(s[i]) - 97\n- tmp=(100*tmp+cc)%MOD\n- R += d[cc]\n- d[cc] = 0\n+ ee = ord(s[i]) - 97\n+ tmp = 100*tmp+(ee+1)\n+ tmp %= MOD\n+ R += d[ee]\n+ d[ee] = 0\n if tmp in D:\n for c in D[tmp]:\n d[c] += 1\n if i == 1:\n nn = tmp\n if l != 1:\n if nn not in D:\n D[nn] = set()\n- D[nn].add(cc)\n+ D[nn].add(ee)\n else:\n- dd.add(cc)\n+ dd.add(ee)\n print(R)\n \n", "FL_content": "\n import sys;input=sys.stdin.readline\n N, = map(int, input().split())\n MOD=998244353\n S = []\n for _ in range(N):\n s = input().strip()\n S.append(s)\n S.sort(key=lambda x:len(x))\n D = dict()\n dd = set()\n R = 0\n for s in S:\n l = len(s)\n d = [0]*26\n for c in dd:\n d[c] += 1\n tmp=0\n for i in range(l-1, -1, -1):\n cc = ord(s[i]) - 97\n tmp=(100*tmp+cc)%MOD\n R += d[cc]\n d[cc] = 0\n if tmp in D:\n for c in D[tmp]:\n d[c] += 1\n if i == 1:\n nn = tmp\n if l != 1:\n if nn not in D:\n D[nn] = set()\n D[nn].add(cc)\n else:\n dd.add(cc)\n print(R)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 35 }, { "user_id": "u662430503", "problem_id": "p03338", "submission1_id": "s267440389-FL", "submission2_id": "s145841633", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\ndef main():\n n = int(input())\n s = input()\n ans=0\n for i in range(0,int(n/2)+1):\n sum=0\n x=s[:i+1]\n y=s[i+1:]\n while len(x)>0:\n if x[0] in y :\n sum+=1\n x=x.replace(x[0],'')\n if sum>ans:\n ans=sum\n print(ans)\nmain()\n", "code2": "import math\ndef main():\n n = int(input())\n s = input()\n ans=0\n for i in range(0,n):\n sum=0\n x=s[:i+1]\n y=s[i+1:]\n while len(x)>0:\n if x[0] in y :\n sum+=1\n x=x.replace(x[0],'')\n if sum>ans:\n ans=sum\n print(ans)\nmain()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594341393", "date2": "1594342141", "bleu_score": "0.953503231074013", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 93, "total_score": 103, "input": "10\naaa`abccbb\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["import math\ndef main(): # (0): main=\n n = int(input()) # (2): n=10\n s = input() # (3): s=aaa`abccbb\n ans=0 # (4): ans=0\n for i in range(0,int(n/2)+1): # (5): i=0 (16): i=1 ... (77): NO CHANGE\n sum=0 # (6): sum=0 (17): sum=0 ... (62): NO CHANGE\n x=s[:i+1] # (7): x=a (18): x=aa ... (63): x=aaa`ab\n y=s[i+1:] # (8): y=aa`abccbb (19): y=a`abccbb ... (64): y=ccbb\n while len(x)>0: # (9): NO CHANGE (13): NO CHANGE ... (75): NO CHANGE\n if x[0] in y : # (10): NO CHANGE (21): NO CHANGE ... (72): NO CHANGE\n sum+=1 # (11): sum=1 (22): sum=1 ... (73): sum=1\n x=x.replace(x[0],'') # (12): x= (23): x= ... (74): x=\n if sum>ans: # (14): NO CHANGE (25): NO CHANGE ... (76): NO CHANGE\n ans=sum # (15): ans=1\n print(ans)\nmain() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " import math\n def main():\n n = int(input())\n s = input()\n ans=0\n- for i in range(0,int(n/2)+1):\n+ for i in range(0,n):\n sum=0\n x=s[:i+1]\n y=s[i+1:]\n while len(x)>0:\n if x[0] in y :\n sum+=1\n x=x.replace(x[0],'')\n if sum>ans:\n ans=sum\n print(ans)\n main()\n-\n", "FL_content": "\n import math\n def main():\n n = int(input())\n s = input()\n ans=0\n for i in range(0,int(n/2)+1):\n sum=0\n x=s[:i+1]\n y=s[i+1:]\n while len(x)>0:\n- if x[0] in y :\n sum+=1\n x=x.replace(x[0],'')\n if sum>ans:\n ans=sum\n print(ans)\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u612721349", "problem_id": "p03698", "submission1_id": "s177761346-FL", "submission2_id": "s704816741", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input();print(\"yneos\"[len(set(s))>len(s)::2])", "code2": "s=input();print(\"yneos\"[len(set(s))len(s)::2])"], "anno_status": [true], "diff_content": "-s=input();print(\"yneos\"[len(set(s))>len(s)::2])\n+s=input();print(\"yneos\"[len(set(s))len(s)::2])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 1 }, { "user_id": "u782138812", "problem_id": "p02921", "submission1_id": "s667766225-FL", "submission2_id": "s350633744", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = list(input())\nT = list(input())\ncnt = 0\n\nfor i in range(2):\n if S[i] == T[i]:\n cnt += 1\n else:\n cnt\n\nprint(cnt)\n", "code2": "S = list(input())\nT = list(input())\ncnt = 0\n\nfor i in range(3):\n if S[i] == T[i]:\n cnt += 1\n\nprint(cnt)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567546666", "date2": "1567546893", "bleu_score": "0.8004078315763231", "code1_test_status": [1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 80, "total_score": 103, "input": "QVT\nRST\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["S = list(input()) # (0): S=['Q', 'V', 'T']\nT = list(input()) # (1): T=['R', 'S', 'T']\ncnt = 0 # (2): cnt=0\n\nfor i in range(2): # (3): i=0 (6): i=1 (9): NO CHANGE\n if S[i] == T[i]: # (4): NO CHANGE (7): NO CHANGE\n cnt += 1\n else:\n cnt # (5): NO CHANGE (8): NO CHANGE\n\nprint(cnt)\n"], "anno_status": [true], "diff_content": " S = list(input())\n T = list(input())\n cnt = 0\n \n-for i in range(2):\n+for i in range(3):\n if S[i] == T[i]:\n cnt += 1\n- else:\n- cnt\n \n print(cnt)\n \n", "FL_content": "\n S = list(input())\n T = list(input())\n cnt = 0\n \n-for i in range(2):\n if S[i] == T[i]:\n cnt += 1\n else:\n cnt\n \n print(cnt)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u764600134", "problem_id": "p02948", "submission1_id": "s658620853-FL", "submission2_id": "s150861604", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\n\n\nfrom heapq import heapify, heappop\n\ndef solve(N, M, jobs):\n heapify(jobs)\n ans = 0\n while jobs:\n B, A = heappop(jobs)\n A, B = -A, -B\n if M >= A:\n M -= 1\n ans += B\n return ans\n\n\ndef main(args):\n N, M = map(int, input().split())\n jobs = []\n for _ in range(N):\n A, B = map(int, input().split())\n jobs.append([-B, -A])\n ans = solve(N, M, jobs)\n print(ans)\n\n\nif __name__ == '__main__':\n main(sys.argv[1:])\n", "code2": "\n\nimport sys\n\n\nfrom heapq import heapify, heappop, heappush\n\ndef solve(N, M, jobs):\n heapify(jobs)\n availables = []\n ans = 0\n for day in range(1, M+1):\n while jobs and jobs[0][0] <= day:\n A, B = heappop(jobs)\n heappush(availables, (-B))\n if availables:\n ans -= heappop(availables)\n return ans\n\n\ndef main(args):\n N, M = map(int, input().split())\n jobs = []\n for _ in range(N):\n A, B = map(int, input().split())\n jobs.append((A, B))\n ans = solve(N, M, jobs)\n print(ans)\n\n\nif __name__ == '__main__':\n main(sys.argv[1:])\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1584316205", "date2": "1584317520", "bleu_score": "0.7635762077339971", "code1_test_status": [1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 98, "total_score": 102, "input": "3 4\n4 3\n3 0\n2 4\n", "actual_output": "4\n", "expected_output": "7\n\n", "anno_code": ["\n\nimport sys\n\n\nfrom heapq import heapify, heappop\n\ndef solve(N, M, jobs): # (0): solve=\n heapify(jobs)\n ans = 0\n while jobs:\n B, A = heappop(jobs)\n A, B = -A, -B\n if M >= A:\n M -= 1\n ans += B\n return ans\n\n\ndef main(args): # (1): main=\n N, M = map(int, input().split())\n jobs = []\n for _ in range(N):\n A, B = map(int, input().split())\n jobs.append([-B, -A])\n ans = solve(N, M, jobs)\n print(ans)\n\n\nif __name__ == '__main__':\n main(sys.argv[1:])\n"], "anno_status": [true], "diff_content": " \n \n import sys\n \n \n-from heapq import heapify, heappop\n+from heapq import heapify, heappop, heappush\n \n def solve(N, M, jobs):\n heapify(jobs)\n+ availables = []\n ans = 0\n- while jobs:\n- B, A = heappop(jobs)\n- A, B = -A, -B\n- if M >= A:\n- M -= 1\n- ans += B\n+ for day in range(1, M+1):\n+ while jobs and jobs[0][0] <= day:\n+ A, B = heappop(jobs)\n+ heappush(availables, (-B))\n+ if availables:\n+ ans -= heappop(availables)\n return ans\n \n \n def main(args):\n N, M = map(int, input().split())\n jobs = []\n for _ in range(N):\n A, B = map(int, input().split())\n- jobs.append([-B, -A])\n+ jobs.append((A, B))\n ans = solve(N, M, jobs)\n print(ans)\n \n \n if __name__ == '__main__':\n main(sys.argv[1:])\n \n", "FL_content": "\n \n \n import sys\n \n \n from heapq import heapify, heappop\n \n def solve(N, M, jobs):\n heapify(jobs)\n ans = 0\n while jobs:\n B, A = heappop(jobs)\n A, B = -A, -B\n if M >= A:\n M -= 1\n ans += B\n return ans\n \n \n def main(args):\n N, M = map(int, input().split())\n jobs = []\n for _ in range(N):\n A, B = map(int, input().split())\n jobs.append([-B, -A])\n ans = solve(N, M, jobs)\n print(ans)\n \n \n if __name__ == '__main__':\n main(sys.argv[1:])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 32 }, { "user_id": "u842689614", "problem_id": "p04014", "submission1_id": "s562883548-FL", "submission2_id": "s079261653", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\ns=int(input())\n\nb_ans=1\n\nif n==s:\n b_ans=n+1\nif b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\n\nif b_ans==1:\n for p in range(1,int(n**0.5)):\n b=int(n/p)\n q=n-p*b\n if s==p+q:\n b_ans=b\n break\n\nif b_ans!=1:\n print(b_ans)\nelse:\n print(-1)", "code2": "n=int(input())\ns=int(input())\n\nb_ans=1\n\n\n\nif n==s:\n b_ans=n+1\nif b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\nif b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n\n if b.is_integer() and 0<=s-pn**0.5:\n b_ans=int(b)\n break\n\nif b_ans!=1:\n print(b_ans)\nelse:\n print(-1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566167681", "date2": "1566170554", "bleu_score": "0.8613501683820108", "code1_test_status": [1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 48, "total_score": 105, "input": "87654\n438\n", "actual_output": "369\n", "expected_output": "317\n\n", "anno_code": ["n=int(input()) # (0): n=87654\ns=int(input()) # (1): s=438\n\nb_ans=1 # (2): b_ans=1\n\nif n==s: # (3): NO CHANGE\n b_ans=n+1\nif b_ans==1: # (4): NO CHANGE\n for b in range(2,int(n**0.5)+1): # (5): b=2 (61): b=3 ... (4402): NO CHANGE\n nn=n # (6): nn=87654 (62): nn=87654 ... (4389): nn=87654\n st=[] # (7): st=[] (63): st=[] ... (4390): st=[]\n while(nn>0): # (8): NO CHANGE (11): NO CHANGE ... (4400): NO CHANGE\n st.append(nn%b) # (9): st=[0] (12): st=[0, 1.0] ... (4398): st=[38, 0.0, 1.0]\n nn=(nn-st[-1])/b # (10): nn=43827.0 (13): nn=21913.0 ... (4399): nn=0.0\n \n if sum(st)==s: # (60): NO CHANGE (98): NO CHANGE ... (4401): NO CHANGE\n b_ans=b\n break\n\n\nif b_ans==1: # (4403): NO CHANGE\n for p in range(1,int(n**0.5)): # (4404): p=1 (4408): p=2 ... (5348): p=237\n b=int(n/p) # (4405): b=87654 (4409): b=43827 ... (5349): b=369\n q=n-p*b # (4406): q=0 (4410): NO CHANGE ... (5350): q=201\n if s==p+q: # (4407): NO CHANGE (4411): NO CHANGE ... (5351): NO CHANGE\n b_ans=b # (5352): b_ans=369\n break # (5353): NO CHANGE\n\nif b_ans!=1: # (5354): NO CHANGE\n print(b_ans)\nelse:\n print(-1)"], "anno_status": [true], "diff_content": " n=int(input())\n s=int(input())\n \n b_ans=1\n \n+\n+\n if n==s:\n b_ans=n+1\n if b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n-\n if b_ans==1:\n- for p in range(1,int(n**0.5)):\n- b=int(n/p)\n- q=n-p*b\n- if s==p+q:\n- b_ans=b\n+ for p in range(int(n**0.5),0,-1):\n+ b=(n-s+p)/p\n+\n+ if b.is_integer() and 0<=s-pn**0.5:\n+ b_ans=int(b)\n break\n \n if b_ans!=1:\n print(b_ans)\n else:\n print(-1)\n", "FL_content": "\n n=int(input())\n s=int(input())\n \n b_ans=1\n \n if n==s:\n b_ans=n+1\n if b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n \n if b_ans==1:\n for p in range(1,int(n**0.5)):\n b=int(n/p)\n q=n-p*b\n if s==p+q:\n b_ans=b\n break\n \n if b_ans!=1:\n print(b_ans)\n else:\n print(-1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 32 }, { "user_id": "u633548583", "problem_id": "p03207", "submission1_id": "s619471018-FL", "submission2_id": "s471447564", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\np=[int(input()) for i in range(n)]\nq=max(p)\nprint(int(sum(p))-max(p)/2)\n", "code2": "n=int(input())\np=[int(input()) for i in range(n)]\nq=max(p)\nprint(int(sum(p))-int(max(p)/2))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573602279", "date2": "1573602459", "bleu_score": "0.9222423692142884", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "3\n4\n7980\n615\n", "actual_output": "4609.0\n", "expected_output": "4609\n\n", "anno_code": ["n=int(input()) # (0): n=3\np=[int(input()) for i in range(n)] # (1): p=[4, 7980, 615]\nq=max(p) # (2): q=7980\nprint(int(sum(p))-max(p)/2)\n"], "anno_status": [true], "diff_content": " n=int(input())\n p=[int(input()) for i in range(n)]\n q=max(p)\n-print(int(sum(p))-max(p)/2)\n+print(int(sum(p))-int(max(p)/2))\n \n", "FL_content": "\n n=int(input())\n p=[int(input()) for i in range(n)]\n q=max(p)\n-print(int(sum(p))-max(p)/2)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u375870553", "problem_id": "p03502", "submission1_id": "s504896544-FL", "submission2_id": "s748504815", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n n=input()\n s=sum([int(i) for i in n])\n print(s)\n if int(n)%s==0:\n print(\"Yes\")\n else:\n print(\"No\")\n\nif __name__=='__main__':\n main()\n", "code2": "def main():\n n=input()\n s=sum([int(i) for i in n])\n if int(n)%s==0:\n print(\"Yes\")\n else:\n print(\"No\")\n\nif __name__=='__main__':\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512353218", "date2": "1512353292", "bleu_score": "0.9242359537041557", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 23, "input": "128\n", "actual_output": "11\nNo\n", "expected_output": "No\n\n", "anno_code": ["def main(): # (0): main=\n n=input()\n s=sum([int(i) for i in n])\n print(s)\n if int(n)%s==0:\n print(\"Yes\")\n else:\n print(\"No\")\n\nif __name__=='__main__':\n main()\n"], "anno_status": [true], "diff_content": " def main():\n n=input()\n s=sum([int(i) for i in n])\n- print(s)\n if int(n)%s==0:\n print(\"Yes\")\n else:\n print(\"No\")\n \n if __name__=='__main__':\n main()\n \n", "FL_content": "\n def main():\n n=input()\n s=sum([int(i) for i in n])\n- print(s)\n if int(n)%s==0:\n print(\"Yes\")\n else:\n print(\"No\")\n \n if __name__=='__main__':\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u123687446", "problem_id": "p00015", "submission1_id": "s758682555-FL", "submission2_id": "s596567217", "status1": "Wrong Answer", "status2": "Accepted", "code1": "upper = 10**81\nn = int(input())\nfor i in range(n):\n n1 = int(input())\n if n1 >= upper:\n print(\"overflow\")\n continue\n n2 = int(input())\n if n2 >= upper:\n print(\"overflow\")\n continue\n print( n1 + n2 if n1+n2 < upper else \"overflow\")", "code2": "upper = 10**80\nn = int(input())\nfor i in range(n):\n n1 = int(input())\n n2 = int(input())\n if n1 >= upper or n2 >= upper:\n print(\"overflow\")\n continue\n print( n1 + n2 if n1+n2 < upper else \"overflow\")", "original_language1": "Python3", "original_language2": "Python3", "date1": "1481110598", "date2": "1481110655", "bleu_score": "0.7851418469119057", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "6\n1001\n510\n9999999999999999999999999999999999999999\n8\n406457296153147731569431812193957336633213953097465104312094248394524915238944551\n-2\n58309788833475244131751092110501484455671325624249551256800630673736756882679442\n1\n101000000000100000000000000000000000000000000000000000000001000000000000000001000\n-1\n100000000000000000000000000000000000000000000001000000000001000000000000000000000\n100000010000000000000000000000001000000001000000000000000000000000000000000010000\n", "actual_output": "1511\n10000000000000000000000000000000000000007\n406457296153147731569431812193957336633213953097465104312094248394524915238944549\n58309788833475244131751092110501484455671325624249551256800630673736756882679443\n101000000000100000000000000000000000000000000000000000000001000000000000000000999\n200000010000000000000000000000001000000001000001000000000001000000000000000010000\n", "expected_output": "1511\n10000000000000000000000000000000000000007\noverflow\n58309788833475244131751092110501484455671325624249551256800630673736756882679443\noverflow\noverflow\n\n", "anno_code": ["upper = 10**81 # (0): upper=1000000000000000000000000000000000000000000000000000000000000000000000000000000000\nn = int(input()) # (1): n=6\nfor i in range(n): # (2): i=0 (8): i=1 ... (32): i=5\n n1 = int(input()) # (3): n1=1001 (9): n1=9999999999999999999999999999999999999999 ... (33): n1=100000000000000000000000000000000000000000000001000000000001000000000000000000000\n if n1 >= upper: # (4): NO CHANGE (10): NO CHANGE ... (34): NO CHANGE\n print(\"overflow\")\n continue\n n2 = int(input()) # (5): n2=510 (11): n2=8 ... (35): n2=100000010000000000000000000000001000000001000000000000000000000000000000000010000\n if n2 >= upper: # (6): NO CHANGE (12): NO CHANGE ... (36): NO CHANGE\n print(\"overflow\")\n continue\n print( n1 + n2 if n1+n2 < upper else \"overflow\") # (7): NO CHANGE (13): NO CHANGE ... (37): NO CHANGE\n"], "anno_status": [false], "diff_content": "-upper = 10**81\n+upper = 10**80\n n = int(input())\n for i in range(n):\n n1 = int(input())\n- if n1 >= upper:\n- print(\"overflow\")\n- continue\n n2 = int(input())\n- if n2 >= upper:\n+ if n1 >= upper or n2 >= upper:\n print(\"overflow\")\n continue\n print( n1 + n2 if n1+n2 < upper else \"overflow\")\n", "FL_content": "\n-upper = 10**81\n n = int(input())\n for i in range(n):\n n1 = int(input())\n- if n1 >= upper:\n print(\"overflow\")\n continue\n n2 = int(input())\n- if n2 >= upper:\n print(\"overflow\")\n continue\n- print( n1 + n2 if n1+n2 < upper else \"overflow\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u672220554", "problem_id": "p03172", "submission1_id": "s725054975-FL", "submission2_id": "s521930773", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n for j in range(K):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n dp[i+1][j+1] %= MOD\n\n return dp[N][K]\n\n\nprint(main())\n", "code2": "def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n for j in range(K+1):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n for j in range(K+1):\n dp[i+1][j] = dp[i+1][j] % MOD\n\n return dp[N][K]\n\n\nprint(main())\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1582134794", "date2": "1582148247", "bleu_score": "0.9139247901203591", "code1_test_status": [1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1], "code1_test_score": 5, "total_score": 103, "input": "4 101010\n001000 000001 100100 001010\n", "actual_output": "1195739\n", "expected_output": "1195922\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n- for j in range(K):\n+ for j in range(K+1):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n- dp[i+1][j+1] %= MOD\n+ for j in range(K+1):\n+ dp[i+1][j] = dp[i+1][j] % MOD\n \n return dp[N][K]\n \n \n print(main())\n \n", "FL_content": "\n def main():\n N, K = map(int, input().split())\n if K == 0:\n return 1\n A = list(map(int, input().split()))\n MOD = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)]\n dp[0][0] = 1\n for i in range(N):\n a = A[i]\n for j in range(K):\n dp[i+1][j] += dp[i][j]\n if j+a+1 <= K:\n dp[i+1][j+a+1] -= dp[i][j]\n for j in range(K):\n dp[i+1][j+1] += dp[i+1][j]\n dp[i+1][j+1] %= MOD\n \n return dp[N][K]\n \n \n print(main())\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 23 }, { "user_id": "u374531474", "problem_id": "p03712", "submission1_id": "s124991830-FL", "submission2_id": "s630747545", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H, W = map(int, input().split())\na = [input() for i in range(H)]\n\nprint('*' * (W + 2))\nfor ai in a:\n print('*{}*'.format(ai))\nprint('*' * (W + 2))\n", "code2": "H, W = map(int, input().split())\na = [input() for i in range(H)]\n\nprint('\nfor ai in a:\n print('\nprint('\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1556220825", "date2": "1556220928", "bleu_score": "0.6448972955625993", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "1 4\n|\n", "actual_output": "******\n*|*\n******\n", "expected_output": "######\n#|#\n######\n\n", "anno_code": ["H, W = map(int, input().split()) # (0): H=1, W=4\na = [input() for i in range(H)] # (1): a=['|']\n\nprint('*' * (W + 2)) # (2): NO CHANGE\nfor ai in a: # (3): ai=| (5): NO CHANGE\n print('*{}*'.format(ai)) # (4): NO CHANGE\nprint('*' * (W + 2))\n"], "anno_status": [true], "diff_content": " H, W = map(int, input().split())\n a = [input() for i in range(H)]\n \n-print('*' * (W + 2))\n+print('\n for ai in a:\n- print('*{}*'.format(ai))\n-print('*' * (W + 2))\n+ print('\n+print('\n \n", "FL_content": "\n H, W = map(int, input().split())\n a = [input() for i in range(H)]\n \n-print('*' * (W + 2))\n for ai in a:\n- print('*{}*'.format(ai))\n-print('*' * (W + 2))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u391731808", "problem_id": "p03558", "submission1_id": "s297066833-FL", "submission2_id": "s370694384", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\nK = int(input())\nV = list(range(K))\nE = [[(i*10)%K,(i+1)%K] for i in range(K)] \ndata = [-1] * (K)\ndata[1] = 1\nq = deque([1])\ni = 1\nwhile i != 0:\n i = q.popleft()\n if data[E[i][0]] == -1:\n q.appendleft(E[i][0])\n data[E[i][0]] = data[i]\n if data[E[i][1]] == -1:\n q.append(E[i][1])\n data[E[i][1]] = data[i]+1\nprint(data[i])", "code2": "from collections import deque\nK = int(input())\nE = [[(i*10)%K,(i+1)%K] for i in range(K)] \nINF = K*10\nV = [INF] * (K)\nV[1] = 1\nq = deque([1])\ni = 1\nwhile q:\n i = q.popleft()\n if V[E[i][0]] > V[i]:\n q.appendleft(E[i][0])\n V[E[i][0]] = V[i]\n if V[E[i][1]] > V[i]+1:\n q.append(E[i][1])\n V[E[i][1]] = V[i]+1\nprint(V[0])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1556847546", "date2": "1556849435", "bleu_score": "0.770101549560838", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 18, "total_score": 22, "input": "551\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["from collections import deque\nK = int(input()) # (0): K=551\nV = list(range(K)) # (1): V=[0, 1, ..., 549, 550]\nE = [[(i*10)%K,(i+1)%K] for i in range(K)] # (2): E\ndata = [-1] * (K) # (3): data=[-1, -1, ..., -1, -1]\ndata[1] = 1 # (4): data=[-1, 1, ..., -1, -1]\nq = deque([1]) # (5): q=deque([215, 206, 103, 470, 66, 193, 290, 281, 272, 498, 489, 223, 314, 305, 277, 503, 53, 512, 455, 133, 124, 89, 380, 545, 536, 383, 446, 43, 344, 437, 524, 408, 60, 366, 336, 342, 15, 333, 402, 330, 527, 256, 171, 441, 476, 254, 245, 228, 219, 519, 173, 298, 491, 482, 77, 268, 178, 26, 412, 138, 161])\ni = 1 # (6): i=1\nwhile i != 0: # (7): NO CHANGE (15): NO CHANGE ... (3025): NO CHANGE\n i = q.popleft() # (8): NO CHANGE (16): i=10 ... (3022): i=0\n if data[E[i][0]] == -1: # (9): NO CHANGE (17): NO CHANGE ... (3023): NO CHANGE\n q.appendleft(E[i][0]) # (10): NO CHANGE (18): NO CHANGE ... (3014): NO CHANGE\n data[E[i][0]] = data[i] # (11): data=[-1, 1, ..., -1, -1] (19): data=[-1, 1, ..., -1, -1] ... (3015): data=[4, 1, ..., 2, 3]\n if data[E[i][1]] == -1: # (12): NO CHANGE (20): NO CHANGE ... (3024): NO CHANGE\n q.append(E[i][1]) # (13): NO CHANGE (21): NO CHANGE ... (2937): NO CHANGE\n data[E[i][1]] = data[i]+1 # (14): data=[-1, 1, ..., -1, -1] (22): data=[-1, 1, ..., -1, -1] ... (2938): data=[4, 1, ..., 2, 3]\nprint(data[i])"], "anno_status": [true], "diff_content": " from collections import deque\n K = int(input())\n-V = list(range(K))\n E = [[(i*10)%K,(i+1)%K] for i in range(K)] \n-data = [-1] * (K)\n-data[1] = 1\n+INF = K*10\n+V = [INF] * (K)\n+V[1] = 1\n q = deque([1])\n i = 1\n-while i != 0:\n+while q:\n i = q.popleft()\n- if data[E[i][0]] == -1:\n+ if V[E[i][0]] > V[i]:\n q.appendleft(E[i][0])\n- data[E[i][0]] = data[i]\n- if data[E[i][1]] == -1:\n+ V[E[i][0]] = V[i]\n+ if V[E[i][1]] > V[i]+1:\n q.append(E[i][1])\n- data[E[i][1]] = data[i]+1\n-print(data[i])\n+ V[E[i][1]] = V[i]+1\n+print(V[0])\n", "FL_content": "\n from collections import deque\n K = int(input())\n-V = list(range(K))\n E = [[(i*10)%K,(i+1)%K] for i in range(K)] \n data = [-1] * (K)\n data[1] = 1\n q = deque([1])\n i = 1\n while i != 0:\n i = q.popleft()\n if data[E[i][0]] == -1:\n q.appendleft(E[i][0])\n data[E[i][0]] = data[i]\n if data[E[i][1]] == -1:\n q.append(E[i][1])\n data[E[i][1]] = data[i]+1\n print(data[i])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u683956577", "problem_id": "p02639", "submission1_id": "s965300566-FL", "submission2_id": "s247381250", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nstdin = sys.stdin\n\nni = lambda: int(ns())\nna = lambda: list(map(int, stdin.readline().split()))\nns = lambda: stdin.readline().rstrip() \n\nx = na()\nc = 0\nfor i in x:\n c += 1\n if i == 0:\n c = i\nprint(c+1)\n", "code2": "import sys\n\nstdin = sys.stdin\n\nni = lambda: int(ns())\nna = lambda: list(map(int, stdin.readline().split()))\nns = lambda: stdin.readline().rstrip() \n\nx = na()\n\nfor i in range(5):\n if x[i] == 0:\n print(i+1)\n \n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592183060", "date2": "1592183247", "bleu_score": "0.8706408567973304", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "5\n", "expected_output": "1\n", "anno_code": ["import sys\n\nstdin = sys.stdin # (0): stdin=<_io.TextIOWrapper name='../../test/autoComment2\\\\Dev\\\\p02639\\\\input_s965300566.txt' mode='r' encoding='utf-8'>\n\nni = lambda: int(ns()) # (1): ni= at 0x0000021FF84F9BD0>\nna = lambda: list(map(int, stdin.readline().split())) # (2): na= at 0x0000021FF84F9B40>\nns = lambda: stdin.readline().rstrip() # (3): ns= at 0x0000021FF84F9C60>\n\nx = na() # (4): x=[0, 2, 3, 4, 5]\nc = 0 # (5): c=0\nfor i in x: # (6): i=0 (10): i=2 ... (22): NO CHANGE\n c += 1 # (7): c=1 (11): c=1 ... (20): c=4\n if i == 0: # (8): NO CHANGE (12): NO CHANGE ... (21): NO CHANGE\n c = i # (9): c=0\nprint(c+1)\n"], "anno_status": [true], "diff_content": " import sys\n \n stdin = sys.stdin\n \n ni = lambda: int(ns())\n na = lambda: list(map(int, stdin.readline().split()))\n ns = lambda: stdin.readline().rstrip() \n \n x = na()\n-c = 0\n-for i in x:\n- c += 1\n- if i == 0:\n- c = i\n-print(c+1)\n+\n+for i in range(5):\n+ if x[i] == 0:\n+ print(i+1)\n+ \n \n", "FL_content": "\n import sys\n \n stdin = sys.stdin\n \n ni = lambda: int(ns())\n na = lambda: list(map(int, stdin.readline().split()))\n ns = lambda: stdin.readline().rstrip() \n \n x = na()\n c = 0\n for i in x:\n c += 1\n if i == 0:\n- c = i\n-print(c+1)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u285681431", "problem_id": "p02536", "submission1_id": "s195877644-FL", "submission2_id": "s683929514", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\n\n\n\n\nclass UnionFind:\n\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n\n def find(self, v): \n if self.parents[v] < 0:\n return v\n else:\n self.parents[v] = self.find(self.parents[v])\n return self.parents[v]\n\n def unite(self, u, v): \n u = self.find(u)\n v = self.find(v)\n if u == v:\n return\n if self.parents[u] > self.parents[v]: \n u, v = v, u\n self.parents[u] += self.parents[v]\n self.parents[v] = u\n\n def size(self, v): \n return -self.parents[self.find(v)]\n\n def same(self, u, v): \n return self.find(u) == self.find(v)\n\n\nN, M = map(int, input().split())\nG = [[] for _ in range(N)]\nuf = UnionFind(N)\n\nfor _ in range(M):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n uf.unite(a, b)\n\nroot_list = []\nfor i in range(N):\n r = uf.find(i)\n root_list.append(r)\n\nroot_list = list(set(root_list))\nnum = len(root_list)\n\n\n\n\n\ndef comb(n, r): \n if r < 0 or r > n:\n return 0\n else:\n n1 = math.factorial(n)\n n21 = math.factorial(n - r)\n n22 = math.factorial(r)\n ans = n1 \n return ans\n\n\n\nans = comb(num, 2)\nprint(ans)\n", "code2": "import math\n\n\n\nclass UnionFind:\n\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n\n def find(self, v): \n if self.parents[v] < 0:\n return v\n else:\n self.parents[v] = self.find(self.parents[v])\n return self.parents[v]\n\n def unite(self, u, v): \n u = self.find(u)\n v = self.find(v)\n if u == v:\n return\n if self.parents[u] > self.parents[v]: \n u, v = v, u\n self.parents[u] += self.parents[v]\n self.parents[v] = u\n\n def size(self, v): \n return -self.parents[self.find(v)]\n\n def same(self, u, v): \n return self.find(u) == self.find(v)\n\n\n\n\n\n\ndef comb(n, r): \n if r < 0 or r > n:\n return 0\n else:\n n1 = math.factorial(n)\n n21 = math.factorial(n - r)\n n22 = math.factorial(r)\n ans = n1 \n return ans\n\n\nN, M = map(int, input().split())\nuf = UnionFind(N)\n\nfor _ in range(M):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n uf.unite(a, b)\n\nroot_list = []\nfor i in range(N):\n r = uf.find(i)\n root_list.append(r)\n\nroot_list = list(set(root_list))\nnum = len(root_list)\n\nans = num - 1\nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601169374", "date2": "1601169476", "bleu_score": "0.9657020744705149", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 90, "input": "50 1\n2 5\n", "actual_output": "608281864034267560872252163321295376887552831379210240000000000\n", "expected_output": "48\n\n", "anno_code": ["import math\n\n\n\n\n\nclass UnionFind: # (0): UnionFind=\n\n def __init__(self, n):\n self.n = n # (4): NO CHANGE\n self.parents = [-1] * n # (5): math=, UnionFind=, N=50, M=1, G, uf=\n\n def find(self, v): \n if self.parents[v] < 0: # (12): u=1, v=4 (14): u=1 ... (221): math=, UnionFind=, N=50, M=1, G=[[], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], []], uf=, _=0, a=1, b=4, root_list=[0, 1, ..., 47, 48], i=49, r=49\n return v\n else:\n self.parents[v] = self.find(self.parents[v]) # (40): v=1\n return self.parents[v]\n\n def unite(self, u, v): \n u = self.find(u) # (11): v=1\n v = self.find(v) # (13): NO CHANGE\n if u == v: # (15): NO CHANGE\n return\n if self.parents[u] > self.parents[v]: # (16): NO CHANGE\n u, v = v, u\n self.parents[u] += self.parents[v] # (17): NO CHANGE\n self.parents[v] = u # (18): math=, UnionFind=, N=50, M=1, G, uf=, _=0, a=1, b=4\n\n def size(self, v): \n return -self.parents[self.find(v)]\n\n def same(self, u, v): \n return self.find(u) == self.find(v)\n\n\nN, M = map(int, input().split()) # (1): N=50, M=1\nG = [[] for _ in range(N)] # (2): G\nuf = UnionFind(N) # (3): self=, n=50\n\nfor _ in range(M): # (6): _=0 (19): NO CHANGE\n a, b = map(int, input().split()) # (7): a=2, b=5\n a -= 1 # (8): a=1\n b -= 1 # (9): b=4\n uf.unite(a, b) # (10): self=, u=1, v=4\n\nroot_list = [] # (20): root_list=[]\nfor i in range(N): # (21): i=0 (25): i=1 ... (223): NO CHANGE\n r = uf.find(i) # (22): self=, v=0 (26): self=, v=1 ... (220): self=, v=49\n root_list.append(r) # (24): root_list=[0] (28): root_list=[0, 1] ... (222): root_list=[0, 1, ..., 48, 49]\n\nroot_list = list(set(root_list)) # (224): root_list=[0, 1, ..., 48, 49]\nnum = len(root_list) # (225): num=49\n\n\n\n\n\ndef comb(n, r): # (226): comb=\n if r < 0 or r > n: # (228): NO CHANGE\n return 0\n else:\n n1 = math.factorial(n) # (229): n1=608281864034267560872252163321295376887552831379210240000000000\n n21 = math.factorial(n - r) # (230): n21=258623241511168180642964355153611979969197632389120000000000\n n22 = math.factorial(r) # (231): n22=2\n ans = n1 # (232): math=, UnionFind=, N=50, M=1, G=[[], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], [], []], uf=, _=0, a=1, b=4, root_list=[0, 1, ..., 48, 49], i=49, r=49, num=49, comb=, ans=608281864034267560872252163321295376887552831379210240000000000\n return ans\n\n\n\nans = comb(num, 2) # (227): n=49, r=2\nprint(ans)\n"], "anno_status": [false], "diff_content": " import math\n \n \n \n-\n-\n class UnionFind:\n \n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, v): \n if self.parents[v] < 0:\n return v\n else:\n self.parents[v] = self.find(self.parents[v])\n return self.parents[v]\n \n def unite(self, u, v): \n u = self.find(u)\n v = self.find(v)\n if u == v:\n return\n if self.parents[u] > self.parents[v]: \n u, v = v, u\n self.parents[u] += self.parents[v]\n self.parents[v] = u\n \n def size(self, v): \n return -self.parents[self.find(v)]\n \n def same(self, u, v): \n return self.find(u) == self.find(v)\n \n \n+\n+\n+\n+\n+def comb(n, r): \n+ if r < 0 or r > n:\n+ return 0\n+ else:\n+ n1 = math.factorial(n)\n+ n21 = math.factorial(n - r)\n+ n22 = math.factorial(r)\n+ ans = n1 \n+ return ans\n+\n+\n N, M = map(int, input().split())\n-G = [[] for _ in range(N)]\n uf = UnionFind(N)\n \n for _ in range(M):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n uf.unite(a, b)\n \n root_list = []\n for i in range(N):\n r = uf.find(i)\n root_list.append(r)\n \n root_list = list(set(root_list))\n num = len(root_list)\n \n-\n-\n-\n-\n-def comb(n, r): \n- if r < 0 or r > n:\n- return 0\n- else:\n- n1 = math.factorial(n)\n- n21 = math.factorial(n - r)\n- n22 = math.factorial(r)\n- ans = n1 \n- return ans\n-\n-\n-\n-ans = comb(num, 2)\n+ans = num - 1\n print(ans)\n \n", "FL_content": "\n import math\n \n \n \n \n \n class UnionFind:\n \n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n \n def find(self, v): \n if self.parents[v] < 0:\n return v\n else:\n self.parents[v] = self.find(self.parents[v])\n return self.parents[v]\n \n def unite(self, u, v): \n u = self.find(u)\n v = self.find(v)\n if u == v:\n return\n if self.parents[u] > self.parents[v]: \n u, v = v, u\n self.parents[u] += self.parents[v]\n self.parents[v] = u\n \n def size(self, v): \n return -self.parents[self.find(v)]\n \n def same(self, u, v): \n return self.find(u) == self.find(v)\n \n \n N, M = map(int, input().split())\n G = [[] for _ in range(N)]\n uf = UnionFind(N)\n \n for _ in range(M):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n uf.unite(a, b)\n \n root_list = []\n for i in range(N):\n r = uf.find(i)\n root_list.append(r)\n \n root_list = list(set(root_list))\n num = len(root_list)\n \n \n \n \n \n def comb(n, r): \n if r < 0 or r > n:\n return 0\n else:\n n1 = math.factorial(n)\n n21 = math.factorial(n - r)\n n22 = math.factorial(r)\n- ans = n1 \n return ans\n \n \n \n ans = comb(num, 2)\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 73 }, { "user_id": "u213265973", "problem_id": "p02419", "submission1_id": "s791497843-FL", "submission2_id": "s657180258", "status1": "Wrong Answer", "status2": "Accepted", "code1": "W = input()\ncount = 0\nwhile True:\n T = input()\n if T == \"END_OF_TEXT\":\n break\n if W in T:\n count += 1\n print(count)\n\n \n ", "code2": "W = input().lower()\ncount = 0\nwhile True:\n T = input()\n if T == \"END_OF_TEXT\":\n break\n count += T.lower().split(\" \").count(W)\nprint(count)\n\n \n ", "original_language1": "Python3", "original_language2": "Python3", "date1": "1494374399", "date2": "1494375081", "bleu_score": "0.7670426858927225", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "comquter\nserutruN computer scientists aod highlx-skilled computer engineesr\nwho lliw create and tiolpxe \"knowledge\" for the enw era.\nProvides an sutptandiog ctmpuoer environment.\nEND_OF_TEXT\n", "actual_output": "0\n0\n0\n", "expected_output": "0\n\n", "anno_code": ["W = input() # (0): W=comquter\ncount = 0 # (1): count=0\nwhile True: # (2): NO CHANGE (7): NO CHANGE ... (17): NO CHANGE\n T = input() # (3): T=serutruN computer scientists aod highlx-skilled computer engineesr (8): T=who lliw create and tiolpxe \"knowledge\" for the enw era. ... (18): T=END_OF_TEXT\n if T == \"END_OF_TEXT\": # (4): NO CHANGE (9): NO CHANGE ... (19): NO CHANGE\n break\n if W in T: # (5): NO CHANGE (10): NO CHANGE (15): NO CHANGE\n count += 1\n print(count) # (6): NO CHANGE (11): NO CHANGE (16): NO CHANGE\n\n \n "], "anno_status": [true], "diff_content": "-W = input()\n+W = input().lower()\n count = 0\n while True:\n T = input()\n if T == \"END_OF_TEXT\":\n break\n- if W in T:\n- count += 1\n- print(count)\n+ count += T.lower().split(\" \").count(W)\n+print(count)\n \n \n \n", "FL_content": "\n W = input()\n count = 0\n while True:\n T = input()\n if T == \"END_OF_TEXT\":\n break\n if W in T:\n count += 1\n- print(count)\n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u202641516", "problem_id": "p02595", "submission1_id": "s344894285-FL", "submission2_id": "s386684431", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y=map(int,input().split())\n\nres=0\n\nfor n in range(x):\n a,b=map(int,input().split())\n d=(a*a +b*b)**.5\n if d>=y:res+=1\n\nprint(res)", "code2": "x,y=map(int,input().split())\n\nres=0\n\nfor n in range(x):\n a,b=map(int,input().split())\n d=(a*a +b*b)**.5\n if d<=y:res+=1\n\nprint(res)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596416635", "date2": "1596416664", "bleu_score": "0.9818487054407757", "code1_test_status": [0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0], "code1_test_score": 12, "total_score": 103, "input": "12 3\n1 1\n1 1\n1 1\n1 1\n1 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n3 3\n", "actual_output": "5\n", "expected_output": "7\n", "anno_code": ["x,y=map(int,input().split()) # (0): x=12, y=3\n\nres=0 # (1): res=0\n\nfor n in range(x): # (2): n=0 (6): n=1 ... (50): NO CHANGE\n a,b=map(int,input().split()) # (3): a=1, b=1 (7): NO CHANGE ... (47): b=3\n d=(a*a +b*b)**.5 # (4): d=1.414214 (8): NO CHANGE ... (48): d=4.242641\n if d>=y:res+=1 # (5): NO CHANGE (9): NO CHANGE ... (49): res=5\n\nprint(res)"], "anno_status": [true], "diff_content": " x,y=map(int,input().split())\n \n res=0\n \n for n in range(x):\n a,b=map(int,input().split())\n d=(a*a +b*b)**.5\n- if d>=y:res+=1\n+ if d<=y:res+=1\n \n print(res)\n", "FL_content": "\n x,y=map(int,input().split())\n \n res=0\n \n-for n in range(x):\n a,b=map(int,input().split())\n- d=(a*a +b*b)**.5\n- if d>=y:res+=1\n \n print(res)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u864197622", "problem_id": "p02589", "submission1_id": "s080931170-FL", "submission2_id": "s598476480", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nP = 10 ** 30 + 57\nN = int(input())\nX = sorted([input()[::-1] for _ in range(N)], key = len)\n\nD = {}\nans = 0\nfor x in X:\n L = [0] * 26\n T, a = x[:-1], ord(x[-1]) - 97\n h = 0\n for t in T:\n if h in D:\n for i in range(26):\n L[i] += D[h][i]\n b = ord(t) - 97\n ans += L[b]\n L[b] = 0\n \n h = (h + b) * 7 % P\n ans += L[a]\n if h in D:\n D[h][a] += 1\n else:\n D[h] = [0] * 26\n D[h][a] = 1\n \nprint(ans)", "code2": "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nP = 10 ** 40 + 121\nN = int(input())\nX = sorted([input()[::-1] for _ in range(N)], key = len)\n\nD = {}\nans = 0\nfor x in X:\n L = [0] * 26\n T, a = x[:-1], ord(x[-1]) - 97\n h = 0\n for t in T:\n if h in D:\n for i in range(26):\n L[i] += D[h][i]\n b = ord(t) - 97\n ans += L[b]\n L[b] = 0\n \n h = (h + b + 135) * 71 % P\n ans += L[a]\n if h in D:\n D[h][a] += 1\n else:\n D[h] = [0] * 26\n D[h][a] = 1\n \nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597127897", "date2": "1597129549", "bleu_score": "0.9706566509384696", "code1_test_status": [1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 74, "total_score": 102, "input": "3\ndayxyb\nycw\nbaa\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["import sys\ninput = lambda: sys.stdin.readline().rstrip() # (0): input= at 0x000001C917DE9BD0>\nP = 10 ** 30 + 57 # (1): P=1000000000000000000000000000057\nN = int(input()) # (2): N=3\nX = sorted([input()[::-1] for _ in range(N)], key = len) # (3): X=['wcy', 'aab', 'byxyad']\n\nD = {} # (4): D={}\nans = 0 # (5): ans=0\nfor x in X: # (6): x=wcy (27): x=aab ... (140): NO CHANGE\n L = [0] * 26 # (7): L=[0, 0, ..., 0, 0] (28): NO CHANGE (49): NO CHANGE\n T, a = x[:-1], ord(x[-1]) - 97 # (8): T=wc, a=24 (29): T=aa, a=1 (50): T=byxya, a=3\n h = 0 # (9): h=0 (30): h=0 (51): NO CHANGE\n for t in T: # (10): t=w (16): t=c ... (135): NO CHANGE\n if h in D: # (11): NO CHANGE (17): NO CHANGE ... (130): NO CHANGE\n for i in range(26): # (54): i=0 (56): i=1 ... (106): NO CHANGE\n L[i] += D[h][i] # (55): NO CHANGE (57): L=[0, 1, ..., 0, 0] ... (105): NO CHANGE\n b = ord(t) - 97 # (12): b=22 (18): b=2 ... (131): b=0\n ans += L[b] # (13): NO CHANGE (19): NO CHANGE ... (132): NO CHANGE\n L[b] = 0 # (14): NO CHANGE (20): NO CHANGE ... (133): NO CHANGE\n \n h = (h + b) * 7 % P # (15): h=154 (21): h=1092 ... (134): h=83496\n ans += L[a] # (23): NO CHANGE (44): NO CHANGE (136): NO CHANGE\n if h in D: # (24): NO CHANGE (45): NO CHANGE (137): NO CHANGE\n D[h][a] += 1\n else:\n D[h] = [0] * 26 # (25): D={1092: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (46): D={1092: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 0: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (138): D={1092: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 0: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 83496: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\n D[h][a] = 1 # (26): D={1092: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]} (47): D={1092: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 0: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (139): D={1092: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 0: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 83496: [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\n \nprint(ans)"], "anno_status": [false], "diff_content": " import sys\n input = lambda: sys.stdin.readline().rstrip()\n-P = 10 ** 30 + 57\n+P = 10 ** 40 + 121\n N = int(input())\n X = sorted([input()[::-1] for _ in range(N)], key = len)\n \n D = {}\n ans = 0\n for x in X:\n L = [0] * 26\n T, a = x[:-1], ord(x[-1]) - 97\n h = 0\n for t in T:\n if h in D:\n for i in range(26):\n L[i] += D[h][i]\n b = ord(t) - 97\n ans += L[b]\n L[b] = 0\n \n- h = (h + b) * 7 % P\n+ h = (h + b + 135) * 71 % P\n ans += L[a]\n if h in D:\n D[h][a] += 1\n else:\n D[h] = [0] * 26\n D[h][a] = 1\n \n print(ans)\n", "FL_content": "\n import sys\n input = lambda: sys.stdin.readline().rstrip()\n P = 10 ** 30 + 57\n N = int(input())\n X = sorted([input()[::-1] for _ in range(N)], key = len)\n \n D = {}\n ans = 0\n for x in X:\n L = [0] * 26\n T, a = x[:-1], ord(x[-1]) - 97\n h = 0\n for t in T:\n if h in D:\n for i in range(26):\n L[i] += D[h][i]\n b = ord(t) - 97\n ans += L[b]\n L[b] = 0\n \n h = (h + b) * 7 % P\n ans += L[a]\n if h in D:\n D[h][a] += 1\n else:\n D[h] = [0] * 26\n D[h][a] = 1\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 29 }, { "user_id": "u514401521", "problem_id": "p03164", "submission1_id": "s063832887-FL", "submission2_id": "s071782030", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, W = map(int, input().split())\nwv = []\n\nfor i in range(N):\n w, v = map(int, input().split())\n wv.append([w, v])\nMAX_V = 10**5+100\nINF = 10**9\ndp = [[INF]*MAX_V for _ in range(N+1)]\ndp[0][0] = 0\nfor i in range(N):\n for j in range(MAX_V):\n if j - wv[i][1] >= 0:\n dp[i+1][j] = min(dp[i][j], dp[i][j-wv[i][1]]+wv[i][0])\n else:\n dp[i+1][j] = min(dp[i+1][j], dp[i][j])\nans = 0\nfor i in range(MAX_V):\n if dp[N][i] <= W:\n ans = i\nprint(ans)", "code2": "N, W = map(int, input().split())\nwv = []\n\nfor i in range(N):\n w, v = map(int, input().split())\n wv.append([w, v])\nMAX_V = 10**5+100\nINF = 10**10\ndp = [[INF]*MAX_V for _ in range(N+1)]\ndp[0][0] = 0\nfor i in range(N):\n for j in range(MAX_V):\n if j - wv[i][1] >= 0:\n dp[i+1][j] = min(dp[i][j], dp[i][j-wv[i][1]]+wv[i][0])\n else:\n dp[i+1][j] = min(dp[i+1][j], dp[i][j])\nans = 0\nfor i in range(MAX_V):\n if dp[N][i] <= W:\n ans = i\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1590442704", "date2": "1590443288", "bleu_score": "0.9928272580388546", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 100, "total_score": 103, "input": "1 1000000000\n0000000000 10\n", "actual_output": "100099\n", "expected_output": "10\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N, W = map(int, input().split())\n wv = []\n \n for i in range(N):\n w, v = map(int, input().split())\n wv.append([w, v])\n MAX_V = 10**5+100\n-INF = 10**9\n+INF = 10**10\n dp = [[INF]*MAX_V for _ in range(N+1)]\n dp[0][0] = 0\n for i in range(N):\n for j in range(MAX_V):\n if j - wv[i][1] >= 0:\n dp[i+1][j] = min(dp[i][j], dp[i][j-wv[i][1]]+wv[i][0])\n else:\n dp[i+1][j] = min(dp[i+1][j], dp[i][j])\n ans = 0\n for i in range(MAX_V):\n if dp[N][i] <= W:\n ans = i\n print(ans)\n", "FL_content": "\n N, W = map(int, input().split())\n wv = []\n \n for i in range(N):\n w, v = map(int, input().split())\n wv.append([w, v])\n MAX_V = 10**5+100\n INF = 10**9\n dp = [[INF]*MAX_V for _ in range(N+1)]\n dp[0][0] = 0\n for i in range(N):\n for j in range(MAX_V):\n if j - wv[i][1] >= 0:\n dp[i+1][j] = min(dp[i][j], dp[i][j-wv[i][1]]+wv[i][0])\n else:\n dp[i+1][j] = min(dp[i+1][j], dp[i][j])\n ans = 0\n for i in range(MAX_V):\n- if dp[N][i] <= W:\n ans = i\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 21 }, { "user_id": "u600195339", "problem_id": "p03545", "submission1_id": "s251886501-FL", "submission2_id": "s177851500", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\ns = input()\na = []\n\nfor i in range(len(s)):\n num = int(s[i])\n a.append(num)\n\nprint(a)\nop = ['+', '-']\n\nfor i in range(2):\n for j in range(2):\n for k in range(2):\n temp = 0\n if op[i] == '+':\n temp = a[0] + a[1]\n else:\n temp = a[0] - a[1]\n if op[j] == '+':\n temp += a[2]\n else:\n temp -= a[2]\n if op[k] == '+':\n temp += a[3]\n else:\n temp -= a[3]\n\n if temp == 7:\n n1, n2, n3, n4 = map(str, [a[0], a[1], a[2], a[3]])\n \n print(n1 + op[i] + n2 + op[j] + n3 + op[k] + n4 + '=7')\n sys.exit()\n", "code2": "\nimport sys\ns = input()\na = []\n\nfor i in range(len(s)):\n num = int(s[i])\n a.append(num)\n\n\nop = ['+', '-']\n\nfor i in range(2):\n for j in range(2):\n for k in range(2):\n temp = 0\n if op[i] == '+':\n temp = a[0] + a[1]\n else:\n temp = a[0] - a[1]\n if op[j] == '+':\n temp += a[2]\n else:\n temp -= a[2]\n if op[k] == '+':\n temp += a[3]\n else:\n temp -= a[3]\n\n if temp == 7:\n n1, n2, n3, n4 = map(str, [a[0], a[1], a[2], a[3]])\n \n print(n1 + op[i] + n2 + op[j] + n3 + op[k] + n4 + '=7')\n sys.exit()\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1572035008", "date2": "1572035086", "bleu_score": "0.9872518290241994", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 99, "input": "1170\n", "actual_output": "[1, 1, 7, 0]\n1-1+7+0=7\n", "expected_output": "1-1+7+0=7\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " \n import sys\n s = input()\n a = []\n \n for i in range(len(s)):\n num = int(s[i])\n a.append(num)\n \n-print(a)\n+\n op = ['+', '-']\n \n for i in range(2):\n for j in range(2):\n for k in range(2):\n temp = 0\n if op[i] == '+':\n temp = a[0] + a[1]\n else:\n temp = a[0] - a[1]\n if op[j] == '+':\n temp += a[2]\n else:\n temp -= a[2]\n if op[k] == '+':\n temp += a[3]\n else:\n temp -= a[3]\n \n if temp == 7:\n n1, n2, n3, n4 = map(str, [a[0], a[1], a[2], a[3]])\n \n print(n1 + op[i] + n2 + op[j] + n3 + op[k] + n4 + '=7')\n sys.exit()\n \n", "FL_content": "\n \n import sys\n s = input()\n a = []\n \n for i in range(len(s)):\n num = int(s[i])\n a.append(num)\n \n-print(a)\n op = ['+', '-']\n \n for i in range(2):\n for j in range(2):\n for k in range(2):\n temp = 0\n if op[i] == '+':\n temp = a[0] + a[1]\n else:\n temp = a[0] - a[1]\n if op[j] == '+':\n temp += a[2]\n else:\n temp -= a[2]\n if op[k] == '+':\n temp += a[3]\n else:\n temp -= a[3]\n \n if temp == 7:\n n1, n2, n3, n4 = map(str, [a[0], a[1], a[2], a[3]])\n \n print(n1 + op[i] + n2 + op[j] + n3 + op[k] + n4 + '=7')\n sys.exit()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 35 }, { "user_id": "u453642820", "problem_id": "p02975", "submission1_id": "s308017950-FL", "submission2_id": "s225566121", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nA=list(map(int,input().split()))\nif A.count(0)==N:\n print(\"Yes\")\nelif N%3!=0:\n print(\"No\")\nelif len(set(A))==2:\n if 0 in set(A):\n if A.count(0)==N/3:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n print(\"No\")\nelif len(set(A))==3:\n print(\"Yes\" if all(A.count(a)==N/3 for a in set(A)) else \"No\")\nelse:\n print(\"No\")", "code2": "N=int(input())\nA=list(map(int,input().split()))\nif A.count(0)==N:\n print(\"Yes\")\nelif N%3!=0:\n print(\"No\")\nelif len(set(A))==2:\n if 0 in set(A):\n if A.count(0)==N/3:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n print(\"No\")\nelif len(set(A))==3:\n xor=0\n for a in set(A):\n if A.count(a)==N/3:\n xor^=a\n else:\n print(\"No\")\n exit()\n if xor==0:\n print(\"Yes\")\n else:\n print(\"No\")\nelse:\n print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592578249", "date2": "1592578581", "bleu_score": "0.7161079550295233", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 44, "total_score": 58, "input": "3\n-1 25 0\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["N=int(input()) # (0): N=3\nA=list(map(int,input().split())) # (1): A=[-1, 25, 0]\nif A.count(0)==N: # (2): NO CHANGE\n print(\"Yes\")\nelif N%3!=0: # (3): NO CHANGE\n print(\"No\")\nelif len(set(A))==2: # (4): NO CHANGE\n if 0 in set(A):\n if A.count(0)==N/3:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n print(\"No\")\nelif len(set(A))==3: # (5): NO CHANGE\n print(\"Yes\" if all(A.count(a)==N/3 for a in set(A)) else \"No\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " N=int(input())\n A=list(map(int,input().split()))\n if A.count(0)==N:\n print(\"Yes\")\n elif N%3!=0:\n print(\"No\")\n elif len(set(A))==2:\n if 0 in set(A):\n if A.count(0)==N/3:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n print(\"No\")\n elif len(set(A))==3:\n- print(\"Yes\" if all(A.count(a)==N/3 for a in set(A)) else \"No\")\n+ xor=0\n+ for a in set(A):\n+ if A.count(a)==N/3:\n+ xor^=a\n+ else:\n+ print(\"No\")\n+ exit()\n+ if xor==0:\n+ print(\"Yes\")\n+ else:\n+ print(\"No\")\n else:\n print(\"No\")\n", "FL_content": "\n N=int(input())\n A=list(map(int,input().split()))\n if A.count(0)==N:\n print(\"Yes\")\n elif N%3!=0:\n print(\"No\")\n elif len(set(A))==2:\n if 0 in set(A):\n if A.count(0)==N/3:\n print(\"Yes\")\n else:\n print(\"No\")\n else:\n print(\"No\")\n elif len(set(A))==3:\n- print(\"Yes\" if all(A.count(a)==N/3 for a in set(A)) else \"No\")\n else:\n print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u271063202", "problem_id": "p03856", "submission1_id": "s072710668-FL", "submission2_id": "s494984464", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nn = len(s)\nidx = 0\nwhile idx < n:\n if idx+5 <= n and s[idx:idx+5] == 'dream':\n idx += 5\n elif s[idx:idx+4] == 'eras':\n idx += 4\n else:\n break\n if idx+2 <= n and s[idx:idx+2] == 'er' and (idx+2 == n or s[idx+2:idx+3] != 'a'):\n idx += 2\nif idx == n:\n print('YES')\nelse:\n print('NO')", "code2": "s = input()\nn = len(s)\nidx = 0\nwhile idx < n:\n if idx+5 > n:\n break\n if s[idx:idx+5] == 'dream':\n idx += 5\n if idx+2 <= n and s[idx:idx+2] == 'er' and (idx+2 == n or s[idx+2:idx+3] != 'a'):\n idx += 2\n elif s[idx:idx+5] == 'erase':\n idx += 5\n if idx+1 <= n and s[idx:idx+1] == 'r':\n idx += 1\n else:\n break\n\nif idx == n:\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586454252", "date2": "1586454568", "bleu_score": "0.7611704023111397", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "erasedream\n", "actual_output": "NO\n", "expected_output": "YES\n", "anno_code": ["s = input() # (0): s=erasedream\nn = len(s) # (1): n=10\nidx = 0 # (2): idx=0\nwhile idx < n: # (3): NO CHANGE (8): NO CHANGE\n if idx+5 <= n and s[idx:idx+5] == 'dream': # (4): NO CHANGE (9): NO CHANGE\n idx += 5\n elif s[idx:idx+4] == 'eras': # (5): NO CHANGE (10): NO CHANGE\n idx += 4 # (6): idx=4\n else:\n break # (11): NO CHANGE\n if idx+2 <= n and s[idx:idx+2] == 'er' and (idx+2 == n or s[idx+2:idx+3] != 'a'): # (7): NO CHANGE\n idx += 2\nif idx == n: # (12): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " s = input()\n n = len(s)\n idx = 0\n while idx < n:\n- if idx+5 <= n and s[idx:idx+5] == 'dream':\n+ if idx+5 > n:\n+ break\n+ if s[idx:idx+5] == 'dream':\n+ idx += 5\n+ if idx+2 <= n and s[idx:idx+2] == 'er' and (idx+2 == n or s[idx+2:idx+3] != 'a'):\n+ idx += 2\n+ elif s[idx:idx+5] == 'erase':\n idx += 5\n- elif s[idx:idx+4] == 'eras':\n- idx += 4\n+ if idx+1 <= n and s[idx:idx+1] == 'r':\n+ idx += 1\n else:\n break\n- if idx+2 <= n and s[idx:idx+2] == 'er' and (idx+2 == n or s[idx+2:idx+3] != 'a'):\n- idx += 2\n+\n if idx == n:\n print('YES')\n else:\n print('NO')\n", "FL_content": "\n s = input()\n n = len(s)\n idx = 0\n while idx < n:\n if idx+5 <= n and s[idx:idx+5] == 'dream':\n idx += 5\n elif s[idx:idx+4] == 'eras':\n idx += 4\n else:\n break\n- if idx+2 <= n and s[idx:idx+2] == 'er' and (idx+2 == n or s[idx+2:idx+3] != 'a'):\n idx += 2\n if idx == n:\n print('YES')\n else:\n print('NO')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u846652026", "problem_id": "p02958", "submission1_id": "s063239548-FL", "submission2_id": "s561149442", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nl=list(map(int,input().split()))\nll=sorted(l)\ncnt=0\nfor l1,l2 in zip(l,ll):\n if l1 != l2:\n cnt+=1\n \nprint(\"Yes\" if cnt <= 2 else \"No\")", "code2": "n=int(input())\nl=list(map(int,input().split()))\nll=sorted(l)\ncnt=0\nfor l1,l2 in zip(l,ll):\n if l1 != l2:\n cnt+=1\n \nprint(\"YES\" if cnt <= 2 else \"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1580423751", "date2": "1580423784", "bleu_score": "0.9626089486517121", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "5\n0 20 0 -2 0\n", "actual_output": "No\n", "expected_output": "NO\n\n", "anno_code": ["n=int(input()) # (0): n=5\nl=list(map(int,input().split())) # (1): l=[0, 20, 0, -2, 0]\nll=sorted(l) # (2): ll=[-2, 0, 0, 0, 20]\ncnt=0 # (3): cnt=0\nfor l1,l2 in zip(l,ll): # (4): l1=0, l2=-2 (7): l1=20, l2=0 ... (18): NO CHANGE\n if l1 != l2: # (5): NO CHANGE (8): NO CHANGE ... (16): NO CHANGE\n cnt+=1 # (6): cnt=1 (9): cnt=2 ... (17): cnt=4\n \nprint(\"Yes\" if cnt <= 2 else \"No\")"], "anno_status": [true], "diff_content": " n=int(input())\n l=list(map(int,input().split()))\n ll=sorted(l)\n cnt=0\n for l1,l2 in zip(l,ll):\n if l1 != l2:\n cnt+=1\n \n-print(\"Yes\" if cnt <= 2 else \"No\")\n+print(\"YES\" if cnt <= 2 else \"NO\")\n", "FL_content": "\n n=int(input())\n l=list(map(int,input().split()))\n ll=sorted(l)\n cnt=0\n for l1,l2 in zip(l,ll):\n if l1 != l2:\n cnt+=1\n \n-print(\"Yes\" if cnt <= 2 else \"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u919274345", "problem_id": "p02555", "submission1_id": "s008345070-FL", "submission2_id": "s810728712", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = int(input())\n\na = [0] * 2000\na[0] = 0\na[1] = 0\na[2] = 1\na[3] = 1\na[4] = 1\na[5] = 2\nk = 0\nfor i in range(6, S):\n for l in range(2, i-2):\n k += a[l]\n a[i] = 1 + k\n \np = a[S-1] % (10**9 + 7)\nprint(p)", "code2": "S = int(input())\n\na = [0] * 2000\na[0] = 0\na[1] = 0\na[2] = 1\na[3] = 1\na[4] = 1\na[5] = 2\n\nfor i in range(6, S):\n k = 0\n for l in range(2, i-2):\n k += a[l]\n a[i] = 1 + k\n \np = a[S-1] % (10**9 + 7)\nprint(p)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600160823", "date2": "1600161077", "bleu_score": "0.9746032653923553", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "1175\n", "actual_output": "604218241\n", "expected_output": "531468532\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " S = int(input())\n \n a = [0] * 2000\n a[0] = 0\n a[1] = 0\n a[2] = 1\n a[3] = 1\n a[4] = 1\n a[5] = 2\n-k = 0\n+\n for i in range(6, S):\n+ k = 0\n for l in range(2, i-2):\n k += a[l]\n a[i] = 1 + k\n \n p = a[S-1] % (10**9 + 7)\n print(p)\n", "FL_content": "\n S = int(input())\n \n a = [0] * 2000\n a[0] = 0\n a[1] = 0\n a[2] = 1\n a[3] = 1\n a[4] = 1\n a[5] = 2\n k = 0\n-for i in range(6, S):\n for l in range(2, i-2):\n k += a[l]\n a[i] = 1 + k\n \n p = a[S-1] % (10**9 + 7)\n print(p)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u787456042", "problem_id": "p03086", "submission1_id": "s208501426-FL", "submission2_id": "s880809509", "status1": "Wrong Answer", "status2": "Accepted", "code1": "m = a = 0\nfor c in input():\n if c in \"ATGC\": m+=1\n else: a = max(a, m); m = 0\nelse: print(a)", "code2": "m = a = 0\nfor c in input():\n if c in \"ATGC\": m+=1\n else: a = max(a, m); m = 0\nelse: print(max(a, m))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566315132", "date2": "1566315181", "bleu_score": "0.9113508346069309", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "RDBPCTA\n", "actual_output": "0\n", "expected_output": "3\n\n", "anno_code": ["m = a = 0 # (0): m=0, a=0\nfor c in input(): # (1): c=R (4): c=D ... (19): NO CHANGE\n if c in \"ATGC\": m+=1 # (2): NO CHANGE (5): NO CHANGE ... (18): m=3\n else: a = max(a, m); m = 0 # (3): NO CHANGE (6): NO CHANGE ... (12): NO CHANGE\nelse: print(a)"], "anno_status": [true], "diff_content": " m = a = 0\n for c in input():\n if c in \"ATGC\": m+=1\n else: a = max(a, m); m = 0\n-else: print(a)\n+else: print(max(a, m))\n", "FL_content": "\n m = a = 0\n for c in input():\n- if c in \"ATGC\": m+=1\n else: a = max(a, m); m = 0\n else: print(a)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u016568601", "problem_id": "p02830", "submission1_id": "s260839961-FL", "submission2_id": "s261975024", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ns, t = list(input().split())\nans = []\nfor i in range(n):\n ans += s[i]\n ans += t[i]\n\nprint(ans)\n", "code2": "n = int(input())\ns, t = list(input().split())\nans = \"\"\nfor i in range(n):\n ans += s[i]\n ans += t[i]\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579129082", "date2": "1579129293", "bleu_score": "0.9687328077143024", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "5\nbaaaa aaaaa\n", "actual_output": "['b', 'a', 'a', 'a', 'a', 'a', 'a', 'a', 'a', 'a']\n", "expected_output": "baaaaaaaaa\n\n", "anno_code": ["n = int(input()) # (0): n=5\ns, t = list(input().split()) # (1): s=baaaa, t=aaaaa\nans = [] # (2): ans=[]\nfor i in range(n): # (3): i=0 (6): i=1 ... (18): NO CHANGE\n ans += s[i] # (4): ans=['b'] (7): ans=['b', 'a', 'a'] ... (16): ans=['b', 'a', 'a', 'a', 'a', 'a', 'a', 'a', 'a']\n ans += t[i] # (5): ans=['b', 'a'] (8): ans=['b', 'a', 'a', 'a'] ... (17): ans=['b', 'a', 'a', 'a', 'a', 'a', 'a', 'a', 'a', 'a']\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " n = int(input())\n s, t = list(input().split())\n-ans = []\n+ans = \"\"\n for i in range(n):\n ans += s[i]\n ans += t[i]\n \n print(ans)\n \n", "FL_content": "\n n = int(input())\n s, t = list(input().split())\n ans = []\n for i in range(n):\n ans += s[i]\n ans += t[i]\n \n-print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u400765446", "problem_id": "p02410", "submission1_id": "s595442826-FL", "submission2_id": "s625587857", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n\n m, n = tuple(map(int, input().split()))\n a = [[0 for j in range(n)] for i in range(m)]\n b = [0 for j in range(n)]\n c = [0 for i in range(m)]\n\n for i in range(m):\n tmplst = list(map(int, input().split()))\n for j in range(n):\n a[i][j] = tmplst[j]\n\n for j in range(n):\n b[j] = int(input())\n\n for i in range(m):\n for j in range(n):\n c[i] += a[i][j] * b[j]\n print(c[i])\n\n\n\nif __name__ == '__main__':\n main()\n", "code2": "def main():\n\n m, n = tuple(map(int, input().split()))\n a = [[0 for j in range(n)] for i in range(m)]\n b = [0 for j in range(n)]\n c = [0 for i in range(m)]\n\n for i in range(m):\n tmplst = list(map(int, input().split()))\n for j in range(n):\n a[i][j] = tmplst[j]\n\n for j in range(n):\n b[j] = int(input())\n\n for i in range(m):\n for j in range(n):\n c[i] += a[i][j] * b[j]\n print(c[i])\n\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1530886806", "date2": "1530886850", "bleu_score": "0.9920000428377432", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 4\n1 2 0 1\n0 3 0 1\n4 1 1 0\n1\n2\n3\n0\n", "actual_output": "1\n5\n5\n5\n0\n6\n6\n6\n4\n6\n9\n9\n", "expected_output": "5\n6\n9\n", "anno_code": ["def main(): # (0): main=\n\n m, n = tuple(map(int, input().split()))\n a = [[0 for j in range(n)] for i in range(m)]\n b = [0 for j in range(n)]\n c = [0 for i in range(m)]\n\n for i in range(m):\n tmplst = list(map(int, input().split()))\n for j in range(n):\n a[i][j] = tmplst[j]\n\n for j in range(n):\n b[j] = int(input())\n\n for i in range(m):\n for j in range(n):\n c[i] += a[i][j] * b[j]\n print(c[i])\n\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " def main():\n \n m, n = tuple(map(int, input().split()))\n a = [[0 for j in range(n)] for i in range(m)]\n b = [0 for j in range(n)]\n c = [0 for i in range(m)]\n \n for i in range(m):\n tmplst = list(map(int, input().split()))\n for j in range(n):\n a[i][j] = tmplst[j]\n \n for j in range(n):\n b[j] = int(input())\n \n for i in range(m):\n for j in range(n):\n c[i] += a[i][j] * b[j]\n- print(c[i])\n+ print(c[i])\n \n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": "\n def main():\n \n m, n = tuple(map(int, input().split()))\n a = [[0 for j in range(n)] for i in range(m)]\n b = [0 for j in range(n)]\n c = [0 for i in range(m)]\n \n for i in range(m):\n tmplst = list(map(int, input().split()))\n for j in range(n):\n a[i][j] = tmplst[j]\n \n for j in range(n):\n b[j] = int(input())\n \n for i in range(m):\n for j in range(n):\n c[i] += a[i][j] * b[j]\n- print(c[i])\n \n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 25 }, { "user_id": "u811709035", "problem_id": "p02639", "submission1_id": "s210042147-FL", "submission2_id": "s731940192", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nn = []\n\nn = input().split()\n\nfor i in range(5):\n n[i] = int(n[i])\n\nprint(n)\nfor i in range(5):\n if n[i] == 0:\n print(i+1)", "code2": "\nn = []\n\nn = input().split()\n\nfor i in range(5):\n n[i] = int(n[i])\n\nfor i in range(5):\n if n[i] == 0:\n print(i+1)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592183719", "date2": "1592183869", "bleu_score": "0.9253795267496048", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "[0, 2, 3, 4, 5]\n1\n", "expected_output": "1\n", "anno_code": ["\nn = [] # (0): n=[]\n\nn = input().split() # (1): n=['0', '2', '3', '4', '5']\n\nfor i in range(5): # (2): i=0 (4): i=1 ... (12): NO CHANGE\n n[i] = int(n[i]) # (3): NO CHANGE (5): NO CHANGE ... (11): n=[0, 2, 3, 4, 5]\n\nprint(n) # (13): NO CHANGE\nfor i in range(5): # (14): i=0 (17): i=1 ... (23): i=4\n if n[i] == 0: # (15): NO CHANGE (18): NO CHANGE ... (24): NO CHANGE\n print(i+1) # (16): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n n = []\n \n n = input().split()\n \n for i in range(5):\n n[i] = int(n[i])\n \n-print(n)\n for i in range(5):\n if n[i] == 0:\n print(i+1)\n", "FL_content": "\n \n n = []\n \n n = input().split()\n \n for i in range(5):\n n[i] = int(n[i])\n \n-print(n)\n for i in range(5):\n if n[i] == 0:\n print(i+1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u104171359", "problem_id": "p02419", "submission1_id": "s892935867-FL", "submission2_id": "s645159094", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nimport sys\nimport re\n\n\ndef main():\n w = sys.stdin.readline().lower()\n t = str()\n\n for line in sys.stdin:\n if line == 'END_OF_TEXT':\n break\n t += line.lower()\n\n print(len(re.findall((w), t)))\n\n\nif __name__ == '__main__':\n main()", "code2": "\n\nimport sys\n\n\ndef main():\n w = sys.stdin.readline().lower().strip('\\n')\n s = 0\n\n for line in sys.stdin:\n if line == 'END_OF_TEXT':\n break\n s += line.lower().split().count(w)\n\n print(s)\n\n\nif __name__ == '__main__':\n main()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1487035457", "date2": "1487036188", "bleu_score": "0.8437324211272025", "code1_test_status": [0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0], "code1_test_score": 79, "total_score": 101, "input": "computer\nserutruN computer rcientists and highly-skilled computer engineers\nwho wiml create and exploit \"knowledge\" for the new era-\nProvides n` outstanding computer environment.\nEND_OF_TEXT\n", "actual_output": "0\n", "expected_output": "3\n\n", "anno_code": ["\n\nimport sys\nimport re\n\n\ndef main(): # (0): main=\n w = sys.stdin.readline().lower()\n t = str()\n\n for line in sys.stdin:\n if line == 'END_OF_TEXT':\n break\n t += line.lower()\n\n print(len(re.findall((w), t)))\n\n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " \n \n import sys\n-import re\n \n \n def main():\n- w = sys.stdin.readline().lower()\n- t = str()\n+ w = sys.stdin.readline().lower().strip('\\n')\n+ s = 0\n \n for line in sys.stdin:\n if line == 'END_OF_TEXT':\n break\n- t += line.lower()\n+ s += line.lower().split().count(w)\n \n- print(len(re.findall((w), t)))\n+ print(s)\n \n \n if __name__ == '__main__':\n main()\n", "FL_content": "\n \n \n import sys\n import re\n \n \n def main():\n- w = sys.stdin.readline().lower()\n t = str()\n \n for line in sys.stdin:\n if line == 'END_OF_TEXT':\n break\n- t += line.lower()\n \n- print(len(re.findall((w), t)))\n \n \n if __name__ == '__main__':\n main()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u257162238", "problem_id": "p03139", "submission1_id": "s932118099-FL", "submission2_id": "s101942790", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def read():\n N, A, B = map(int, input().strip().split())\n return N, A, B\n\n\ndef solve(N, A, B):\n intersect_max = min(A, B)\n intersect_min = max(0, A + B - N)\n return intersect_max, intersect_min\n\n\nif __name__ == '__main__':\n inputs = read()\n print(solve(*inputs))\n", "code2": "def read():\n N, A, B = map(int, input().strip().split())\n return N, A, B\n\n\ndef solve(N, A, B):\n intersect_max = min(A, B)\n intersect_min = max(0, A + B - N)\n return intersect_max, intersect_min\n\n\nif __name__ == '__main__':\n inputs = read()\n print(\"%d %d\" % solve(*inputs))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1548641554", "date2": "1548641686", "bleu_score": "0.9606603609978814", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 81, "input": "101 110 000\n", "actual_output": "(0, 9)\n", "expected_output": "0 9\n\n", "anno_code": ["def read(): # (0): read=\n N, A, B = map(int, input().strip().split())\n return N, A, B\n\n\ndef solve(N, A, B): # (1): solve=\n intersect_max = min(A, B)\n intersect_min = max(0, A + B - N)\n return intersect_max, intersect_min\n\n\nif __name__ == '__main__':\n inputs = read()\n print(solve(*inputs))\n"], "anno_status": [true], "diff_content": " def read():\n N, A, B = map(int, input().strip().split())\n return N, A, B\n \n \n def solve(N, A, B):\n intersect_max = min(A, B)\n intersect_min = max(0, A + B - N)\n return intersect_max, intersect_min\n \n \n if __name__ == '__main__':\n inputs = read()\n- print(solve(*inputs))\n+ print(\"%d %d\" % solve(*inputs))\n \n", "FL_content": "\n def read():\n N, A, B = map(int, input().strip().split())\n return N, A, B\n \n \n def solve(N, A, B):\n intersect_max = min(A, B)\n intersect_min = max(0, A + B - N)\n- return intersect_max, intersect_min\n \n \n if __name__ == '__main__':\n inputs = read()\n print(solve(*inputs))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u601235270", "problem_id": "p03207", "submission1_id": "s787473014-FL", "submission2_id": "s793943763", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n =int(input())\np =[]\nfor i in range(n):\n a =int(input())\n p.append(a)\np.sort()\nnew_p =p[n-1]/2\nans =sum(p[:n-1])+new_p\nprint(new_p)\nprint(int(ans))", "code2": "n =int(input())\np =[]\nfor i in range(n):\n a =int(input())\n p.append(a)\np.sort()\nnew_p =p[n-1]/2\nans =sum(p[:n-1])+new_p\nprint(int(ans))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586650429", "date2": "1586650451", "bleu_score": "0.9119240402644279", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "3\n0\n4428\n99\n", "actual_output": "2214.0\n2313\n", "expected_output": "2313\n\n", "anno_code": ["n =int(input()) # (0): n=3\np =[] # (1): p=[]\nfor i in range(n): # (2): i=0 (5): i=1 ... (11): NO CHANGE\n a =int(input()) # (3): a=0 (6): a=4428 (9): a=99\n p.append(a) # (4): p=[0] (7): p=[0, 4428] (10): p=[0, 4428, 99]\np.sort() # (12): p=[0, 99, 4428]\nnew_p =p[n-1]/2 # (13): new_p=2214.0\nans =sum(p[:n-1])+new_p # (14): ans=2313.0\nprint(new_p) # (15): NO CHANGE\nprint(int(ans))"], "anno_status": [true], "diff_content": " n =int(input())\n p =[]\n for i in range(n):\n a =int(input())\n p.append(a)\n p.sort()\n new_p =p[n-1]/2\n ans =sum(p[:n-1])+new_p\n-print(new_p)\n print(int(ans))\n", "FL_content": "\n n =int(input())\n p =[]\n for i in range(n):\n a =int(input())\n p.append(a)\n p.sort()\n new_p =p[n-1]/2\n ans =sum(p[:n-1])+new_p\n-print(new_p)\n print(int(ans))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u268516119", "problem_id": "p03698", "submission1_id": "s701503745-FL", "submission2_id": "s369459278", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import collections\ndic=collections.Counter(list(input()))\nif max((dic.values()))==1:\n\tprint('yes')\nelse:print('No')\t\n", "code2": "import collections\ndic=collections.Counter(list(input()))\nif max((dic.values()))==1:\n\tprint('yes')\nelse:print('no')\t\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554477955", "date2": "1554478026", "bleu_score": "0.9783975498178012", "code1_test_status": [0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0], "code1_test_score": 36, "total_score": 103, "input": "tiffdrgnf\n", "actual_output": "No\n", "expected_output": "no\n\n", "anno_code": ["import collections\ndic=collections.Counter(list(input())) # (0): dic=Counter({'f': 3, 't': 1, 'i': 1, 'd': 1, 'r': 1, 'g': 1, 'n': 1})\nif max((dic.values()))==1: # (1): NO CHANGE\n\tprint('yes')\nelse:print('No')\t\n"], "anno_status": [true], "diff_content": " import collections\n dic=collections.Counter(list(input()))\n if max((dic.values()))==1:\n \tprint('yes')\n-else:print('No')\t\n+else:print('no')\t\n \n", "FL_content": "\n import collections\n dic=collections.Counter(list(input()))\n if max((dic.values()))==1:\n \tprint('yes')\n-else:print('No')\t\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u924828749", "problem_id": "p02595", "submission1_id": "s592006503-FL", "submission2_id": "s629865346", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,d = [int(x) for x in input().split()]\nx = []\ny = []\nfor i in range(n):\n x1,y1 = [int(x) for x in input().split()]\n x.append(x1)\n y.append(y1)\nc = 0\nfor i in range(n):\n s = x[i] ** 2 + y[i] ** 2\n if s < d ** 2:\n c += 1\nprint(c)", "code2": "n,d = [int(x) for x in input().split()]\nx = []\ny = []\nfor i in range(n):\n x1,y1 = [int(x) for x in input().split()]\n x.append(x1)\n y.append(y1)\nc = 0\nfor i in range(n):\n s = x[i] ** 2 + y[i] ** 2\n if s <= d ** 2:\n c += 1\nprint(c)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599343286", "date2": "1599343323", "bleu_score": "0.989349874818781", "code1_test_status": [1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1], "code1_test_score": 72, "total_score": 103, "input": "12 2\n0 1\n2 1\n1 1\n1 2\n0 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n7 3\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["n,d = [int(x) for x in input().split()] # (0): n=12, d=2\nx = [] # (1): x=[]\ny = [] # (2): y=[]\nfor i in range(n): # (3): i=0 (7): i=1 ... (51): NO CHANGE\n x1,y1 = [int(x) for x in input().split()] # (4): x1=0, y1=1 (8): x1=2 ... (48): x1=7, y1=3\n x.append(x1) # (5): x=[0] (9): x=[0, 2] ... (49): x=[0, 2, 1, 1, 0, 1, 2, 2, 2, 3, 3, 7]\n y.append(y1) # (6): y=[1] (10): y=[1, 1] ... (50): y=[1, 1, 1, 2, 2, 3, 1, 2, 3, 1, 2, 3]\nc = 0 # (52): c=0\nfor i in range(n): # (53): i=0 (57): i=1 ... (91): NO CHANGE\n s = x[i] ** 2 + y[i] ** 2 # (54): s=1 (58): s=5 ... (89): s=58\n if s < d ** 2: # (55): NO CHANGE (59): NO CHANGE ... (90): NO CHANGE\n c += 1 # (56): c=1 (63): c=2\nprint(c)"], "anno_status": [true], "diff_content": " n,d = [int(x) for x in input().split()]\n x = []\n y = []\n for i in range(n):\n x1,y1 = [int(x) for x in input().split()]\n x.append(x1)\n y.append(y1)\n c = 0\n for i in range(n):\n s = x[i] ** 2 + y[i] ** 2\n- if s < d ** 2:\n+ if s <= d ** 2:\n c += 1\n print(c)\n", "FL_content": "\n n,d = [int(x) for x in input().split()]\n x = []\n y = []\n for i in range(n):\n x1,y1 = [int(x) for x in input().split()]\n x.append(x1)\n y.append(y1)\n c = 0\n for i in range(n):\n s = x[i] ** 2 + y[i] ** 2\n- if s < d ** 2:\n c += 1\n print(c)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u507116804", "problem_id": "p03643", "submission1_id": "s708651774-FL", "submission2_id": "s699641004", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=input()\n\nprint(\"ABC\"+\"n\")", "code2": "n=input()\n\nprint(\"ABC\"+n)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1557103350", "date2": "1557103494", "bleu_score": "0.8621523069320519", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "186\n", "actual_output": "ABCn\n", "expected_output": "ABC186\n\n", "anno_code": ["n=input() # (0): n=186\n\nprint(\"ABC\"+\"n\")"], "anno_status": [true], "diff_content": " n=input()\n \n-print(\"ABC\"+\"n\")\n+print(\"ABC\"+n)\n", "FL_content": "\n n=input()\n \n-print(\"ABC\"+\"n\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 3 }, { "user_id": "u587193722", "problem_id": "p02420", "submission1_id": "s001213161-FL", "submission2_id": "s135208956", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n s = input()\n if s == '-':\n break\n m = int(input())\n for mi in range(m):\n h = int(input())\n\n s = s[:h] + s[h:]\n print(s)", "code2": "while True:\n s = input()\n if s == '-':\n break\n m = int(input())\n for mi in range(m):\n h = int(input())\n\n s = s[h:] + s[:h]\n print(s)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1470290490", "date2": "1470290690", "bleu_score": "0.990876258870529", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0], "code1_test_score": 7, "total_score": 101, "input": "caaa\n3\n2\n0\n2\nvwxyz\n2\n3\n1\n-\n", "actual_output": "caaa\nvwxyz\n", "expected_output": "caaa\nzvwxy\n\n", "anno_code": ["while True: # (0): NO CHANGE (15): NO CHANGE (27): NO CHANGE\n s = input() # (1): s=caaa (16): s=vwxyz (28): s=-\n if s == '-': # (2): NO CHANGE (17): NO CHANGE (29): NO CHANGE\n break\n m = int(input()) # (3): m=3 (18): m=2\n for mi in range(m): # (4): mi=0 (7): mi=1 ... (25): NO CHANGE\n h = int(input()) # (5): h=2 (8): h=0 ... (23): h=1\n\n s = s[:h] + s[h:] # (6): NO CHANGE (9): NO CHANGE ... (24): NO CHANGE\n print(s) # (14): NO CHANGE (26): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n s = input()\n if s == '-':\n break\n m = int(input())\n for mi in range(m):\n h = int(input())\n \n- s = s[:h] + s[h:]\n+ s = s[h:] + s[:h]\n print(s)\n", "FL_content": "\n while True:\n s = input()\n if s == '-':\n break\n m = int(input())\n for mi in range(m):\n h = int(input())\n \n- s = s[:h] + s[h:]\n print(s)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u364509382", "problem_id": "p00015", "submission1_id": "s823452760-FL", "submission2_id": "s567307563", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nfor i in range(n):\n\ts = int(input())+int(input())\n\tif len(str(s))>=80:\n\t\tprint(\"overflow\")\n\telse:\n\t\tprint(s)", "code2": "n = int(input())\nfor i in range(n):\n\ts = int(input())+int(input())\n\tif len(str(s))>80:\n\t\tprint(\"overflow\")\n\telse:\n\t\tprint(s)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1472282097", "date2": "1472282245", "bleu_score": "0.9796948341262014", "code1_test_status": [0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0], "code1_test_score": 34, "total_score": 101, "input": "6\n1010\n30\n11150581741799452420768643548247021706207\n8\n314411289867618232702241807880438703320781023701160407692239774484611399304275912\n-1\n14923344184498858993988796745669562170196205905706056613273758587721771662780252\n1\n101000000000100000000000000000000000000000000000000000000001000000000000000001000\n1\n100000000001000000000000000000000000000000001001000000000001000000000000000000000\n110000010000000000000000000000001000000001000100000000000000000000000000000010000\n", "actual_output": "1040\n11150581741799452420768643548247021706215\noverflow\noverflow\noverflow\noverflow\n", "expected_output": "1040\n11150581741799452420768643548247021706215\noverflow\n14923344184498858993988796745669562170196205905706056613273758587721771662780253\noverflow\noverflow\n\n", "anno_code": ["n = int(input()) # (0): n=6\nfor i in range(n): # (1): i=0 (5): i=1 ... (21): i=5\n\ts = int(input())+int(input()) # (2): s=1040 (6): s=11150581741799452420768643548247021706215 ... (22): s=210000010001000000000000000000001000000001001101000000000001000000000000000010000\n\tif len(str(s))>=80: # (3): NO CHANGE (7): NO CHANGE ... (23): NO CHANGE\n\t\tprint(\"overflow\") # (12): NO CHANGE (16): NO CHANGE ... (24): NO CHANGE\n\telse:\n\t\tprint(s) # (4): NO CHANGE (8): NO CHANGE\n"], "anno_status": [true], "diff_content": " n = int(input())\n for i in range(n):\n \ts = int(input())+int(input())\n-\tif len(str(s))>=80:\n+\tif len(str(s))>80:\n \t\tprint(\"overflow\")\n \telse:\n \t\tprint(s)\n", "FL_content": "\n n = int(input())\n for i in range(n):\n \ts = int(input())+int(input())\n-\tif len(str(s))>=80:\n \t\tprint(\"overflow\")\n \telse:\n \t\tprint(s)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u888092736", "problem_id": "p03838", "submission1_id": "s701499906-FL", "submission2_id": "s016787760", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x, y = map(int, input().split())\na_cnt = abs(abs(x) - abs(y))\nif y >= x:\n print(a_cnt)\nelif abs(y) == abs(x):\n print(1)\nelse:\n print(a_cnt + 2)\n", "code2": "x, y = map(int, input().split())\na_cnt = abs(abs(x) - abs(y))\n\nif x + a_cnt == y:\n print(a_cnt)\nelif x + a_cnt == -y:\n print(a_cnt + 1)\nelif x - a_cnt == -y:\n print(a_cnt + 1)\nelse:\n print(a_cnt + 2)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591297412", "date2": "1591299044", "bleu_score": "0.6190868865507209", "code1_test_status": [1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 28, "total_score": 90, "input": "100 -1\n", "actual_output": "101\n", "expected_output": "100\n\n", "anno_code": ["x, y = map(int, input().split()) # (0): x=100, y=-1\na_cnt = abs(abs(x) - abs(y)) # (1): a_cnt=99\nif y >= x: # (2): NO CHANGE\n print(a_cnt)\nelif abs(y) == abs(x): # (3): NO CHANGE\n print(1)\nelse:\n print(a_cnt + 2)\n"], "anno_status": [true], "diff_content": " x, y = map(int, input().split())\n a_cnt = abs(abs(x) - abs(y))\n-if y >= x:\n+\n+if x + a_cnt == y:\n print(a_cnt)\n-elif abs(y) == abs(x):\n- print(1)\n+elif x + a_cnt == -y:\n+ print(a_cnt + 1)\n+elif x - a_cnt == -y:\n+ print(a_cnt + 1)\n else:\n print(a_cnt + 2)\n \n", "FL_content": "\n x, y = map(int, input().split())\n-a_cnt = abs(abs(x) - abs(y))\n if y >= x:\n print(a_cnt)\n elif abs(y) == abs(x):\n print(1)\n else:\n print(a_cnt + 2)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u515607273", "problem_id": "p03297", "submission1_id": "s737889091-FL", "submission2_id": "s023195635", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nn=int(input())\nfor _ in range(n):\n a,b,c,d=map(int,input().split())\n if dc:\n print(\"No\")\n continue\n print(\"Yes\")\n", "code2": "import fractions \nn=int(input())\nfor _ in range(n):\n a,b,c,d=map(int,input().split())\n if d=b:\n print(\"Yes\")\n continue\n g=fractions.gcd(b,d)\n h=((b-1-a%b)\n if a%b+h>c:\n print(\"No\")\n continue\n print(\"Yes\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531619409", "date2": "1531619841", "bleu_score": "0.7202402254333741", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "14\n9 7 5 9\n9 7 2 9\n1 10 7 12\n14 10 5 12\n12 10 9 12\n11 11 7 11\n14 10 8 11\n14 10 9 11\n9 10 3 10\n10 11 5 10\n11 10 9 10\n16 7 5 10\n1000000000100000000 17 14 999999999999999985\n0000000000000000000 16 15 959335908062480470\n", "actual_output": "Yes\nYes\nNo\nYes\nYes\nYes\nYes\nYes\nNo\nNo\nYes\nYes\nYes\nNo\n", "expected_output": "No\nNo\nNo\nNo\nYes\nYes\nNo\nYes\nNo\nNo\nYes\nNo\nYes\nNo\n\n", "anno_code": ["import math\nn=int(input()) # (0): n=14\nfor _ in range(n): # (1): _=0 (9): _=1 ... (98): _=13\n a,b,c,d=map(int,input().split()) # (2): a=9, b=7, c=5, d=9 (10): c=2 ... (99): a=0, b=16, c=15, d=959335908062480470\n if dc: # (7): NO CHANGE (15): NO CHANGE ... (96): NO CHANGE\n print(\"No\")\n continue\n print(\"Yes\") # (8): NO CHANGE (16): NO CHANGE ... (97): NO CHANGE\n"], "anno_status": [false], "diff_content": "-import math\n+import fractions \n n=int(input())\n for _ in range(n):\n a,b,c,d=map(int,input().split())\n if dc:\n+ elif c>=b:\n+ print(\"Yes\")\n+ continue\n+ g=fractions.gcd(b,d)\n+ h=((b-1-a%b)\n+ if a%b+h>c:\n print(\"No\")\n continue\n print(\"Yes\")\n-\n", "FL_content": "\n import math\n n=int(input())\n for _ in range(n):\n a,b,c,d=map(int,input().split())\n- if dc:\n print(\"No\")\n continue\n print(\"Yes\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u129749062", "problem_id": "p02837", "submission1_id": "s172500670-FL", "submission2_id": "s337302246", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA = list()\nxy = list()\nflag = True\nnum = 0\noutput=0\nfor i in range(N):\n A.append(int(input()))\n xy.append([list(map(int,input().split())) for _ in range(A[i])])\nfor i in range(2**len(A)):\n flag = True\n num = str(format(i, 'b').zfill(len(A)))\n for j in range(len(A)):\n if ((i>>j)&1) == 1:\n for k in range(len(xy[len(A)-j-1])):\n if int(num[xy[len(A)-1-j][k][0]-1]) != xy[len(A)-1-j][k][1]:\n flag = False\n elif ((i>>j)&1) == 0:\n for k in range(len(xy[len(A)-j-1])):\n if int(num[xy[len(A)-1-j][k][0]-1]) == xy[len(A)-1-j][k][1]:\n flag = False\n if flag == True and output <= str(bin(i)).count('1') :\n output = str(bin(i)).count('1')\nprint(output)\n ", "code2": "N = int(input())\nA = list()\nxy = list()\nflag = True\nnum = 0\noutput=0\nfor i in range(N):\n A.append(int(input()))\n xy.append([list(map(int,input().split())) for _ in range(A[i])])\n \nfor i in range(2**N):\n flag = True\n num = str(format(i, 'b').zfill(N))\n for j in range(N):\n if ((i>>j)&1) == 1:\n for k in range(len(xy[N-j-1])):\n if int(num[xy[N-1-j][k][0]-1]) != xy[N-1-j][k][1]:\n flag = False\n break\n if flag == False:\n break\n if flag == True and output <= str(bin(i)).count('1') :\n output = str(bin(i)).count('1')\nprint(output)\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589150280", "date2": "1589151042", "bleu_score": "0.7466857253527024", "code1_test_status": [1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1], "code1_test_score": 52, "total_score": 103, "input": "3\n2\n2 0\n3 0\n2\n3 1\n1 0\n2\n1 1\n0 0\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["N = int(input()) # (0): N=3\nA = list() # (1): A=[]\nxy = list() # (2): xy=[]\nflag = True # (3): flag=True\nnum = 0 # (4): num=0\noutput=0 # (5): output=0\nfor i in range(N): # (6): i=0 (9): i=1 ... (15): NO CHANGE\n A.append(int(input())) # (7): A=[2] (10): A=[2, 2] (13): A=[2, 2, 2]\n xy.append([list(map(int,input().split())) for _ in range(A[i])]) # (8): xy=[[[2, 0], [3, 0]]] (11): xy (14): xy\nfor i in range(2**len(A)): # (16): i=0 (49): i=1 ... (264): NO CHANGE\n flag = True # (17): NO CHANGE (50): flag=True ... (235): flag=True\n num = str(format(i, 'b').zfill(len(A))) # (18): num=000 (51): num=001 ... (236): num=111\n for j in range(len(A)): # (19): j=0 (28): j=1 ... (262): NO CHANGE\n if ((i>>j)&1) == 1: # (20): NO CHANGE (29): NO CHANGE ... (254): NO CHANGE\n for k in range(len(xy[len(A)-j-1])): # (54): k=0 (57): k=1 ... (261): NO CHANGE\n if int(num[xy[len(A)-1-j][k][0]-1]) != xy[len(A)-1-j][k][1]: # (55): NO CHANGE (58): NO CHANGE ... (259): NO CHANGE\n flag = False # (56): flag=False (59): NO CHANGE ... (260): NO CHANGE\n elif ((i>>j)&1) == 0: # (21): NO CHANGE (30): NO CHANGE ... (207): NO CHANGE\n for k in range(len(xy[len(A)-j-1])): # (22): k=0 (24): k=1 ... (214): NO CHANGE\n if int(num[xy[len(A)-1-j][k][0]-1]) == xy[len(A)-1-j][k][1]: # (23): NO CHANGE (25): NO CHANGE ... (212): NO CHANGE\n flag = False # (26): flag=False (35): NO CHANGE ... (213): NO CHANGE\n if flag == True and output <= str(bin(i)).count('1') : # (48): NO CHANGE (81): NO CHANGE ... (263): NO CHANGE\n output = str(bin(i)).count('1')\nprint(output)\n "], "anno_status": [true], "diff_content": " N = int(input())\n A = list()\n xy = list()\n flag = True\n num = 0\n output=0\n for i in range(N):\n A.append(int(input()))\n xy.append([list(map(int,input().split())) for _ in range(A[i])])\n-for i in range(2**len(A)):\n+ \n+for i in range(2**N):\n flag = True\n- num = str(format(i, 'b').zfill(len(A)))\n- for j in range(len(A)):\n+ num = str(format(i, 'b').zfill(N))\n+ for j in range(N):\n if ((i>>j)&1) == 1:\n- for k in range(len(xy[len(A)-j-1])):\n- if int(num[xy[len(A)-1-j][k][0]-1]) != xy[len(A)-1-j][k][1]:\n- flag = False\n- elif ((i>>j)&1) == 0:\n- for k in range(len(xy[len(A)-j-1])):\n- if int(num[xy[len(A)-1-j][k][0]-1]) == xy[len(A)-1-j][k][1]:\n+ for k in range(len(xy[N-j-1])):\n+ if int(num[xy[N-1-j][k][0]-1]) != xy[N-1-j][k][1]:\n flag = False\n+ break\n+ if flag == False:\n+ break\n if flag == True and output <= str(bin(i)).count('1') :\n output = str(bin(i)).count('1')\n print(output)\n \n", "FL_content": "\n N = int(input())\n A = list()\n xy = list()\n flag = True\n num = 0\n output=0\n for i in range(N):\n A.append(int(input()))\n xy.append([list(map(int,input().split())) for _ in range(A[i])])\n for i in range(2**len(A)):\n flag = True\n num = str(format(i, 'b').zfill(len(A)))\n for j in range(len(A)):\n if ((i>>j)&1) == 1:\n for k in range(len(xy[len(A)-j-1])):\n if int(num[xy[len(A)-1-j][k][0]-1]) != xy[len(A)-1-j][k][1]:\n flag = False\n elif ((i>>j)&1) == 0:\n for k in range(len(xy[len(A)-j-1])):\n if int(num[xy[len(A)-1-j][k][0]-1]) == xy[len(A)-1-j][k][1]:\n flag = False\n if flag == True and output <= str(bin(i)).count('1') :\n- output = str(bin(i)).count('1')\n print(output)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 25 }, { "user_id": "u032484849", "problem_id": "p03086", "submission1_id": "s331553719-FL", "submission2_id": "s267389715", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\na,b=0,0\nfor i in range(len(s)):\n if s[i]==\"A\" or s[i]==\"C\" or s[i]==\"G\" or s[i]==\"T\":\n a+=1\n else:\n b=max(a,b)\n a=0\nprint(b)", "code2": "s=input()\na,b=0,0\nfor i in range(len(s)):\n if s[i]==\"A\" or s[i]==\"C\" or s[i]==\"G\" or s[i]==\"T\":\n a+=1\n else:\n b=max(a,b)\n a=0\nprint(max(a,b))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588156143", "date2": "1588156315", "bleu_score": "0.9504020545817945", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "JUKVMIHT\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["s=input() # (0): s=JUKVMIHT\na,b=0,0 # (1): a=0, b=0\nfor i in range(len(s)): # (2): i=0 (6): i=1 ... (33): NO CHANGE\n if s[i]==\"A\" or s[i]==\"C\" or s[i]==\"G\" or s[i]==\"T\": # (3): NO CHANGE (7): NO CHANGE ... (31): NO CHANGE\n a+=1 # (32): a=1\n else:\n b=max(a,b) # (4): NO CHANGE (8): NO CHANGE ... (28): NO CHANGE\n a=0 # (5): NO CHANGE (9): NO CHANGE ... (29): NO CHANGE\nprint(b)"], "anno_status": [true], "diff_content": " s=input()\n a,b=0,0\n for i in range(len(s)):\n if s[i]==\"A\" or s[i]==\"C\" or s[i]==\"G\" or s[i]==\"T\":\n a+=1\n else:\n b=max(a,b)\n a=0\n-print(b)\n+print(max(a,b))\n", "FL_content": "\n s=input()\n a,b=0,0\n for i in range(len(s)):\n if s[i]==\"A\" or s[i]==\"C\" or s[i]==\"G\" or s[i]==\"T\":\n a+=1\n else:\n b=max(a,b)\n a=0\n print(b)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u190405389", "problem_id": "p03291", "submission1_id": "s407220963-FL", "submission2_id": "s238247839", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\n\nans = 0\n\nrc = [0]\nrq = [0]\nla = [0]\nlq = [0]\nq3 = [1]\nt = 10**9+7\n\nfor i in range(len(s)-1):\n if s[len(s)-i-1]=='C':\n rc.append(rc[-1]+1)\n rq.append(rq[-1])\n elif s[len(s)-i-1]=='?':\n rc.append(rc[-1])\n rq.append(rq[-1]+1)\n else:\n rc.append(rc[-1])\n rq.append(rq[-1])\n if s[i]=='A':\n la.append(la[-1]+1)\n lq.append(lq[-1])\n elif s[i]=='?':\n la.append(la[-1])\n lq.append(lq[-1]+1)\n else:\n la.append(la[-1])\n lq.append(lq[-1])\n q3.append(q3[-1] * 3 % t)\nrc.reverse()\nrq.reverse()\n\nfor i in range(len(s)):\n if s[i]=='B' or s[i]=='?':\n l = q3[lq[i]-1]\n r = q3[rq[i]-1]\n ans += l*r*(3*la[i]+lq[i])*(3*rc[i]+rq[i]) % t\n\nprint(int(ans%t))\n", "code2": "s = input()\n\nans = 0\n\nrc = [0]\nrq = [0]\nla = [0]\nlq = [0]\nq3 = [1]\nt = 10**9+7\n\nfor i in range(len(s)-1):\n if s[len(s)-i-1]=='C':\n rc.append(rc[-1]+1)\n rq.append(rq[-1])\n elif s[len(s)-i-1]=='?':\n rc.append(rc[-1])\n rq.append(rq[-1]+1)\n else:\n rc.append(rc[-1])\n rq.append(rq[-1])\n if s[i]=='A':\n la.append(la[-1]+1)\n lq.append(lq[-1])\n elif s[i]=='?':\n la.append(la[-1])\n lq.append(lq[-1]+1)\n else:\n la.append(la[-1])\n lq.append(lq[-1])\n q3.append(q3[-1] * 3 % t)\nrc.reverse()\nrq.reverse()\n\nq3.append(1/3)\n\nfor i in range(len(s)):\n if s[i]=='B' or s[i]=='?':\n l = q3[lq[i]-1]\n r = q3[rq[i]-1]\n ans += l*r*(3*la[i]+lq[i])*(3*rc[i]+rq[i]) % t\n\nprint(round(ans%t))\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1556733131", "date2": "1556733980", "bleu_score": "0.9718487265146971", "code1_test_status": [0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1], "code1_test_score": 79, "total_score": 103, "input": "@A>C?@B;@AA=???==AA>C?@B;@AA=???==A X:\n break\n res += 1\n X -= a\nif X > 0:\n res -= 1\nprint(max(res, 0))", "code2": "N, X = map(int, input().split())\nA = list(map(int, input().split()))\nA.sort()\nres = 0\nfor a in A:\n if a > X:\n break\n res += 1\n X -= a\nelse:\n if X > 0:\n res -= 1\nprint(max(res, 0))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591755947", "date2": "1591756199", "bleu_score": "0.9237815148444258", "code1_test_status": [1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 60, "total_score": 104, "input": "2 9\n20 1 10\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["N, X = map(int, input().split()) # (0): N=2, X=9\nA = list(map(int, input().split())) # (1): A=[20, 1, 10]\nA.sort() # (2): A=[1, 10, 20]\nres = 0 # (3): res=0\nfor a in A: # (4): a=1 (8): a=10\n if a > X: # (5): NO CHANGE (9): NO CHANGE\n break # (10): NO CHANGE\n res += 1 # (6): res=1\n X -= a # (7): X=8\nif X > 0: # (11): NO CHANGE\n res -= 1 # (12): res=0\nprint(max(res, 0))"], "anno_status": [true], "diff_content": " N, X = map(int, input().split())\n A = list(map(int, input().split()))\n A.sort()\n res = 0\n for a in A:\n if a > X:\n break\n res += 1\n X -= a\n-if X > 0:\n- res -= 1\n+else:\n+ if X > 0:\n+ res -= 1\n print(max(res, 0))\n", "FL_content": "\n N, X = map(int, input().split())\n A = list(map(int, input().split()))\n A.sort()\n res = 0\n for a in A:\n- if a > X:\n- break\n res += 1\n X -= a\n if X > 0:\n res -= 1\n print(max(res, 0))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u581477875", "problem_id": "p02595", "submission1_id": "s266606931-FL", "submission2_id": "s875739462", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, d = map(int, input().split())\nans = 0\nfor i in range(n):\n x, y = map(int, input().split())\n if x * x + y * y < d * d:\n ans += 1\nprint(ans)", "code2": "n, d = map(int, input().split())\nans = 0\nfor i in range(n):\n x, y = map(int, input().split())\n if x * x + y * y <= d * d:\n ans += 1\nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597808264", "date2": "1597808308", "bleu_score": "0.983631575077218", "code1_test_status": [1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1], "code1_test_score": 72, "total_score": 103, "input": "12 4\n0 1\n2 2\n1 1\n1 2\n0 2\n0 4\n2 1\n2 0\n2 0\n3 1\n3 2\n1 3\n", "actual_output": "11\n", "expected_output": "12\n\n", "anno_code": ["n, d = map(int, input().split()) # (0): n=12, d=4\nans = 0 # (1): ans=0\nfor i in range(n): # (2): i=0 (6): i=1 ... (49): NO CHANGE\n x, y = map(int, input().split()) # (3): x=0, y=1 (7): x=2, y=2 ... (46): x=1, y=3\n if x * x + y * y < d * d: # (4): NO CHANGE (8): NO CHANGE ... (47): NO CHANGE\n ans += 1 # (5): ans=1 (9): ans=2 ... (48): ans=11\nprint(ans)"], "anno_status": [true], "diff_content": " n, d = map(int, input().split())\n ans = 0\n for i in range(n):\n x, y = map(int, input().split())\n- if x * x + y * y < d * d:\n+ if x * x + y * y <= d * d:\n ans += 1\n print(ans)\n", "FL_content": "\n n, d = map(int, input().split())\n ans = 0\n for i in range(n):\n x, y = map(int, input().split())\n- if x * x + y * y < d * d:\n ans += 1\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u961674365", "problem_id": "p02702", "submission1_id": "s502964823-FL", "submission2_id": "s419202249", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nn=len(s)\nrst=[0 for j in range(2019)]\nx=0\nans=0\ndrst=1\nfor i in range(n):\n y=int(s[n-1-i])*drst%2019\n drst=(drst*10)%2019\n x+=y\n if x>=2019:\n x%=2019\n \n ans+=rst[x]\n rst[x]+=1\nif rst[0]==1:\n ans+=1\n\nprint(ans)", "code2": "s=input()\nn=len(s)\nrst=[0 for j in range(2019)]\nrst[0]=1\nx=0\nans=0\ndrst=1\nfor i in range(n):\n y=(int(s[n-1-i])*drst)%2019\n drst=(drst*10)%2019\n x+=y\n if x>=2019:\n x%=2019\n \n ans+=rst[x]\n rst[x]+=1\n\n \n\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1587952285", "date2": "1587953506", "bleu_score": "0.9237484068990053", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 73, "total_score": 74, "input": "880430372400\n", "actual_output": "3\n", "expected_output": "5\n\n", "anno_code": ["s=input() # (0): s=880430372400\nn=len(s) # (1): n=12\nrst=[0 for j in range(2019)] # (2): rst=[0, 0, ..., 0, 0]\nx=0 # (3): x=0\nans=0 # (4): ans=0\ndrst=1 # (5): drst=1\nfor i in range(n): # (6): i=0 (13): i=1 ... (94): NO CHANGE\n y=int(s[n-1-i])*drst%2019 # (7): y=0 (14): NO CHANGE ... (88): y=560\n drst=(drst*10)%2019 # (8): drst=10 (15): drst=100 ... (89): drst=700\n x+=y # (9): NO CHANGE (16): NO CHANGE ... (90): x=957\n if x>=2019: # (10): NO CHANGE (17): NO CHANGE ... (91): NO CHANGE\n x%=2019 # (32): x=381 (47): x=904 ... (70): x=341\n \n ans+=rst[x] # (11): NO CHANGE (18): ans=1 ... (92): NO CHANGE\n rst[x]+=1 # (12): rst=[1, 0, ..., 0, 0] (19): rst=[2, 0, ..., 0, 0] ... (93): rst=[2, 0, ..., 0, 0]\nif rst[0]==1: # (95): NO CHANGE\n ans+=1\n\nprint(ans)"], "anno_status": [true], "diff_content": " s=input()\n n=len(s)\n rst=[0 for j in range(2019)]\n+rst[0]=1\n x=0\n ans=0\n drst=1\n for i in range(n):\n- y=int(s[n-1-i])*drst%2019\n+ y=(int(s[n-1-i])*drst)%2019\n drst=(drst*10)%2019\n x+=y\n if x>=2019:\n x%=2019\n \n ans+=rst[x]\n rst[x]+=1\n-if rst[0]==1:\n- ans+=1\n+\n+ \n \n print(ans)\n", "FL_content": "\n s=input()\n n=len(s)\n rst=[0 for j in range(2019)]\n x=0\n ans=0\n drst=1\n for i in range(n):\n y=int(s[n-1-i])*drst%2019\n drst=(drst*10)%2019\n x+=y\n if x>=2019:\n x%=2019\n \n ans+=rst[x]\n rst[x]+=1\n-if rst[0]==1:\n ans+=1\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u678167152", "problem_id": "p03172", "submission1_id": "s749416265-FL", "submission2_id": "s629238795", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nfrom itertools import groupby, accumulate, product, permutations, combinations\n\ndef solve(N,K,A):\n mod = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)] \n dp[0][0] = 1\n for i in range(1,N+1):\n cum = list(map(lambda x:x%mod,accumulate(dp[i-1])))\n for j in range(K+1):\n dp[i][j] = cum[j]\n k = j-A[i-1]-1\n if k>=0:\n dp[i][j] -= cum[k]\n ans = dp[N][K]\n return ans\nprint(solve(N,K,A))", "code2": "N, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nfrom itertools import groupby, accumulate, product, permutations, combinations\n\ndef solve(N,K,A):\n mod = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)] \n dp[0][0] = 1\n for i in range(1,N+1):\n cum = list(map(lambda x:x%mod,accumulate(dp[i-1])))\n for j in range(K+1):\n dp[i][j] = cum[j]\n k = j-A[i-1]\n if k>0:\n dp[i][j] -= cum[k-1]\n ans = dp[N][K]%mod\n return ans\nprint(solve(N,K,A))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587922332", "date2": "1587922596", "bleu_score": "0.9800679750326796", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1], "code1_test_score": 88, "total_score": 103, "input": "4 101100\n101010 101100 101001 001101\n", "actual_output": "-57085876\n", "expected_output": "942914131\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n from itertools import groupby, accumulate, product, permutations, combinations\n \n def solve(N,K,A):\n mod = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)] \n dp[0][0] = 1\n for i in range(1,N+1):\n cum = list(map(lambda x:x%mod,accumulate(dp[i-1])))\n for j in range(K+1):\n dp[i][j] = cum[j]\n- k = j-A[i-1]-1\n- if k>=0:\n- dp[i][j] -= cum[k]\n- ans = dp[N][K]\n+ k = j-A[i-1]\n+ if k>0:\n+ dp[i][j] -= cum[k-1]\n+ ans = dp[N][K]%mod\n return ans\n print(solve(N,K,A))\n", "FL_content": "\n N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n from itertools import groupby, accumulate, product, permutations, combinations\n \n def solve(N,K,A):\n mod = 10**9+7\n dp = [[0]*(K+1) for _ in range(N+1)] \n dp[0][0] = 1\n for i in range(1,N+1):\n- cum = list(map(lambda x:x%mod,accumulate(dp[i-1])))\n for j in range(K+1):\n- dp[i][j] = cum[j]\n k = j-A[i-1]-1\n if k>=0:\n- dp[i][j] -= cum[k]\n ans = dp[N][K]\n return ans\n print(solve(N,K,A))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u011768731", "problem_id": "p03456", "submission1_id": "s231805727-FL", "submission2_id": "s854226690", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\na, b = map(str, input().split())\nc = a + b\nd = math.sqrt(int(c))\nif isinstance(d, int):\n print(\"Yes\")\nelse:\n print(\"No\")\n\n", "code2": "import math\n\na, b = map(str, input().split())\nc = a + b\nd = math.sqrt(int(c))\nif d % 1 == 0:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575261903", "date2": "1575262218", "bleu_score": "0.8508061771644128", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 87, "total_score": 91, "input": "000 100\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["import math\n\na, b = map(str, input().split()) # (0): a=000, b=100\nc = a + b # (1): c=000100\nd = math.sqrt(int(c)) # (2): d=10.0\nif isinstance(d, int): # (3): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")\n\n"], "anno_status": [true], "diff_content": " import math\n \n a, b = map(str, input().split())\n c = a + b\n d = math.sqrt(int(c))\n-if isinstance(d, int):\n+if d % 1 == 0:\n print(\"Yes\")\n else:\n print(\"No\")\n \n-\n", "FL_content": "\n import math\n \n a, b = map(str, input().split())\n c = a + b\n-d = math.sqrt(int(c))\n-if isinstance(d, int):\n print(\"Yes\")\n else:\n print(\"No\")\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u437351386", "problem_id": "p02958", "submission1_id": "s241200693-FL", "submission2_id": "s586296232", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nn=int(input())\np=list(map(int,input().split()))\nq=sorted(p)\nfor i in range(n-1):\n for j in range(i,n):\n s=p[i]\n p[i]=p[j]\n p[j]=s\n if p==q:\n print(\"YES\")\n sys.exit()\n s=p[i]\n p[i]=p[j]\n p[j]=s\n \nprint(\"N0\")\n\n \n \n \n ", "code2": "import sys\nn=int(input())\np=list(map(int,input().split()))\nq=sorted(p)\nfor i in range(n-1):\n for j in range(i,n):\n s=p[i]\n p[i]=p[j]\n p[j]=s\n if p==q:\n print(\"YES\")\n sys.exit()\n s=p[i]\n p[i]=p[j]\n p[j]=s\n \nprint(\"NO\")\n\n \n \n \n ", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596164142", "date2": "1596164174", "bleu_score": "0.9909662727025447", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 1, "total_score": 100, "input": "5\n8 0 3 4 2\n", "actual_output": "N0\n", "expected_output": "NO\n\n", "anno_code": ["import sys\nn=int(input()) # (0): n=5\np=list(map(int,input().split())) # (1): p=[8, 0, 3, 4, 2]\nq=sorted(p) # (2): q=[0, 2, 3, 4, 8]\nfor i in range(n-1): # (3): i=0 (45): i=1 ... (123): NO CHANGE\n for j in range(i,n): # (4): j=0 (12): j=1 ... (122): NO CHANGE\n s=p[i] # (5): s=8 (13): NO CHANGE ... (115): NO CHANGE\n p[i]=p[j] # (6): NO CHANGE (14): p=[0, 0, 3, 4, 2] ... (116): p=[8, 0, 3, 2, 2]\n p[j]=s # (7): NO CHANGE (15): p=[0, 8, 3, 4, 2] ... (117): p=[8, 0, 3, 2, 4]\n if p==q: # (8): NO CHANGE (16): NO CHANGE ... (118): NO CHANGE\n print(\"YES\")\n sys.exit()\n s=p[i] # (9): NO CHANGE (17): s=0 ... (119): s=2\n p[i]=p[j] # (10): NO CHANGE (18): p=[8, 8, 3, 4, 2] ... (120): p=[8, 0, 3, 4, 4]\n p[j]=s # (11): NO CHANGE (19): p=[8, 0, 3, 4, 2] ... (121): p=[8, 0, 3, 4, 2]\n \nprint(\"N0\")\n\n \n \n \n "], "anno_status": [true], "diff_content": " import sys\n n=int(input())\n p=list(map(int,input().split()))\n q=sorted(p)\n for i in range(n-1):\n for j in range(i,n):\n s=p[i]\n p[i]=p[j]\n p[j]=s\n if p==q:\n print(\"YES\")\n sys.exit()\n s=p[i]\n p[i]=p[j]\n p[j]=s\n \n-print(\"N0\")\n+print(\"NO\")\n \n \n \n \n \n", "FL_content": "\n import sys\n n=int(input())\n p=list(map(int,input().split()))\n q=sorted(p)\n for i in range(n-1):\n for j in range(i,n):\n s=p[i]\n p[i]=p[j]\n p[j]=s\n if p==q:\n print(\"YES\")\n sys.exit()\n s=p[i]\n p[i]=p[j]\n p[j]=s\n \n-print(\"N0\")\n \n \n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u078042885", "problem_id": "p00602", "submission1_id": "s199270374-FL", "submission2_id": "s566444461", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while 1:\n try:\n v,d=map(int,input().split())\n f=[0]*(v+1)\n f[0],f[1]=1,2\n for i in range(2,v+1):\n f[i]=f[i-1]+f[i-2]\n f.sort()\n c=1\n for i in range(2,v+1):\n if f[i]-f[i-1]>=d: c+=1\n print(c)\n except:break", "code2": "while 1:\n try:\n v,d=map(int,input().split())\n f=[0]*(v+1)\n f[0],f[1]=1,2\n for i in range(2,v+1):\n f[i]=(f[i-1]+f[i-2])%1001\n f.sort()\n c=1\n for i in range(2,v+1):\n if f[i]-f[i-1]>=d: c+=1\n print(c)\n except:break", "original_language1": "Python3", "original_language2": "Python3", "date1": "1483426603", "date2": "1483426738", "bleu_score": "0.9658678499227835", "code1_test_status": [0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1], "code1_test_score": 18, "total_score": 101, "input": "20 2\n30 2\n22 25\n", "actual_output": "19\n29\n15\n", "expected_output": "19\n29\n12\n\n", "anno_code": ["while 1: # (0): NO CHANGE (86): NO CHANGE ... (306): NO CHANGE\n try: # (1): NO CHANGE (87): NO CHANGE ... (307): NO CHANGE\n v,d=map(int,input().split()) # (2): v=20, d=2 (88): v=30 ... (308): NO CHANGE\n f=[0]*(v+1) # (3): f=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (89): f=[0, 0, ..., 0, 0] (215): f=[0, 0, ..., 0, 0]\n f[0],f[1]=1,2 # (4): f=[1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (90): f=[1, 2, ..., 0, 0] (216): f=[1, 2, ..., 0, 0]\n for i in range(2,v+1): # (5): i=2 (7): i=3 ... (259): NO CHANGE\n f[i]=f[i-1]+f[i-2] # (6): f=[1, 2, ..., 0, 0] (8): f=[1, 2, ..., 0, 0] ... (258): f=[1, 2, ..., 28657, 46368]\n f.sort() # (44): NO CHANGE (150): NO CHANGE (260): NO CHANGE\n c=1 # (45): c=1 (151): c=1 (261): c=1\n for i in range(2,v+1): # (46): i=2 (48): i=3 ... (304): NO CHANGE\n if f[i]-f[i-1]>=d: c+=1 # (47): NO CHANGE (49): c=2 ... (303): c=15\n print(c) # (85): NO CHANGE (211): NO CHANGE (305): NO CHANGE\n except:break"], "anno_status": [true], "diff_content": " while 1:\n try:\n v,d=map(int,input().split())\n f=[0]*(v+1)\n f[0],f[1]=1,2\n for i in range(2,v+1):\n- f[i]=f[i-1]+f[i-2]\n+ f[i]=(f[i-1]+f[i-2])%1001\n f.sort()\n c=1\n for i in range(2,v+1):\n if f[i]-f[i-1]>=d: c+=1\n print(c)\n except:break\n", "FL_content": "\n while 1:\n try:\n v,d=map(int,input().split())\n f=[0]*(v+1)\n f[0],f[1]=1,2\n for i in range(2,v+1):\n f[i]=f[i-1]+f[i-2]\n f.sort()\n c=1\n for i in range(2,v+1):\n- if f[i]-f[i-1]>=d: c+=1\n print(c)\n except:break\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u239721772", "problem_id": "p02419", "submission1_id": "s898936241-FL", "submission2_id": "s358129480", "status1": "Wrong Answer", "status2": "Accepted", "code1": "W = input()\ncount = 0\nT = input().upper()\n\nwhile T != 'END_OF_TEXT':\n for i in T.split():\n if i == W:\n count += 1\n T = input().upper()\n \n\nprint(count)", "code2": "W = input()\ncount = 0\n\n\n\nwhile True:\n T = input()\n if T == 'END_OF_TEXT':\n break\n\n for i in T.lower().split():\n if W == i:\n count += 1\n \n \n\nprint(count)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1463719781", "date2": "1463720166", "bleu_score": "0.7611430284081714", "code1_test_status": [0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0], "code1_test_score": 79, "total_score": 101, "input": "computer\nserutruN computer rcientists and highly-skilled computer engineers\nwho will create and exploit \"knowledge\" for the new era-\nProvides n` outstanding computer environment.\nEND_OF_TEXT\n", "actual_output": "0\n", "expected_output": "3\n\n", "anno_code": ["W = input() # (0): W=computer\ncount = 0 # (1): count=0\nT = input().upper() # (2): T=SERUTRUN COMPUTER RCIENTISTS AND HIGHLY-SKILLED COMPUTER ENGINEERS\n\nwhile T != 'END_OF_TEXT': # (3): NO CHANGE (20): NO CHANGE ... (56): NO CHANGE\n for i in T.split(): # (4): i=SERUTRUN (6): i=COMPUTER ... (54): NO CHANGE\n if i == W: # (5): NO CHANGE (7): NO CHANGE ... (53): NO CHANGE\n count += 1\n T = input().upper() # (19): T=WHO WILL CREATE AND EXPLOIT \"KNOWLEDGE\" FOR THE NEW ERA- (42): T=PROVIDES N` OUTSTANDING COMPUTER ENVIRONMENT. (55): T=END_OF_TEXT\n \n\nprint(count)"], "anno_status": [true], "diff_content": " W = input()\n count = 0\n-T = input().upper()\n \n-while T != 'END_OF_TEXT':\n- for i in T.split():\n- if i == W:\n+\n+\n+while True:\n+ T = input()\n+ if T == 'END_OF_TEXT':\n+ break\n+\n+ for i in T.lower().split():\n+ if W == i:\n count += 1\n- T = input().upper()\n+ \n \n \n print(count)\n", "FL_content": "\n W = input()\n count = 0\n-T = input().upper()\n \n while T != 'END_OF_TEXT':\n- for i in T.split():\n- if i == W:\n count += 1\n- T = input().upper()\n \n \n print(count)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u693716675", "problem_id": "p04008", "submission1_id": "s241468999-FL", "submission2_id": "s728107826", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nsys.setrecursionlimit(2 * 10 ** 5 + 10)\n\nn,k = [int(i) for i in input().split()]\na = [int(i)-1 for i in input().split()]\n\n\ndef dfs(u, d):\n change = 0\n if d>k:\n d = 1\n change += 1\n for v in edges[u]:\n change += dfs(v, d+1)\n return change\n\n\ncnt = 0\nif a[0]!=0:\n cnt += 1\n\nedges = [[] for _ in range(n)]\nfor i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n\ncnt += dfs(0,0) \nprint(cnt)", "code2": "\n\n\n\nimport sys\nsys.setrecursionlimit(2 * 10 ** 5 + 10)\n\nn,k = [int(i) for i in input().split()]\na = [int(i)-1 for i in input().split()]\n\n\n\ndef dfs(u):\n global cnt\n depth = 0 \n \n for v in edges[u]:\n depth = max(depth, (dfs(v)+1)%k) \n \n \n if depth==k-1 and u!=0 and a[u] != 0:\n cnt += 1\n \n return depth\n\n\ncnt = 0\nif a[0]!=0:\n cnt += 1\n\nedges = [[] for _ in range(n)]\nfor i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n\ndfs(0) \nprint(cnt)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1583624721", "date2": "1583629077", "bleu_score": "0.7801365697309435", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 88, "total_score": 97, "input": "8 2\n-1 1 4 5 1 4 5 4\n", "actual_output": "4\n", "expected_output": "2\n\n", "anno_code": ["\nimport sys\nsys.setrecursionlimit(2 * 10 ** 5 + 10) # (0): NO CHANGE\n\nn,k = [int(i) for i in input().split()] # (1): n=8, k=2\na = [int(i)-1 for i in input().split()] # (2): a=[-2, 0, 3, 4, 0, 3, 4, 3]\n\n\ndef dfs(u, d): # (3): dfs=\n change = 0 # (31): change=0 (35): change=0 ... (70): change=0\n if d>k: # (32): NO CHANGE (36): NO CHANGE ... (71): NO CHANGE\n d = 1 # (50): d=1 (57): d=1 (64): d=1\n change += 1 # (51): change=1 (58): change=1 (65): change=1\n for v in edges[u]: # (33): v=1 (37): u=0, d=0, v=1 ... (74): sys=, n=8, k=2, a=[-2, 0, 3, 4, 0, 3, 4, 3], dfs=, cnt=4, edges, i=7, pa=3\n change += dfs(v, d+1) # (34): u=1, d=1 (39): u=4, d=1 ... (69): u=6, d=2\n return change\n\n\ncnt = 0 # (4): cnt=0\nif a[0]!=0: # (5): NO CHANGE\n cnt += 1 # (6): cnt=1\n\nedges = [[] for _ in range(n)] # (7): edges\nfor i in range(1,n): # (8): i=1 (11): edges, i=2 ... (29): edges\n pa = a[i] # (9): pa=0 (12): edges=[[1], [], [], [], [], [], [], []], pa=3 ... (27): edges, pa=3\n edges[a[i]].append(i) # (10): edges (13): edges ... (28): edges\n\ncnt += dfs(0,0) # (30): u=0, d=0\nprint(cnt)"], "anno_status": [true], "diff_content": " \n+\n+\n+\n import sys\n sys.setrecursionlimit(2 * 10 ** 5 + 10)\n \n n,k = [int(i) for i in input().split()]\n a = [int(i)-1 for i in input().split()]\n \n \n-def dfs(u, d):\n- change = 0\n- if d>k:\n- d = 1\n- change += 1\n+\n+def dfs(u):\n+ global cnt\n+ depth = 0 \n+ \n for v in edges[u]:\n- change += dfs(v, d+1)\n- return change\n+ depth = max(depth, (dfs(v)+1)%k) \n+ \n+ \n+ if depth==k-1 and u!=0 and a[u] != 0:\n+ cnt += 1\n+ \n+ return depth\n \n \n cnt = 0\n if a[0]!=0:\n cnt += 1\n \n edges = [[] for _ in range(n)]\n for i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n \n-cnt += dfs(0,0) \n+dfs(0) \n print(cnt)\n", "FL_content": "\n \n import sys\n sys.setrecursionlimit(2 * 10 ** 5 + 10)\n \n n,k = [int(i) for i in input().split()]\n a = [int(i)-1 for i in input().split()]\n \n \n def dfs(u, d):\n change = 0\n if d>k:\n- d = 1\n change += 1\n for v in edges[u]:\n change += dfs(v, d+1)\n return change\n \n \n cnt = 0\n if a[0]!=0:\n cnt += 1\n \n edges = [[] for _ in range(n)]\n for i in range(1,n):\n pa = a[i]\n edges[a[i]].append(i) \n \n cnt += dfs(0,0) \n print(cnt)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 29 }, { "user_id": "u524489226", "problem_id": "p03456", "submission1_id": "s604712395-FL", "submission2_id": "s262283348", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b = input().split()\nn = int(a + b)\nif n == n**0.5 * n**0.5:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "a, b = input().split()\nn = int(a + b)\nif (n**0.5).is_integer():\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567605388", "date2": "1567606029", "bleu_score": "0.8249412939088931", "code1_test_status": [1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1], "code1_test_score": 51, "total_score": 91, "input": "13 87\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["a, b = input().split() # (0): a=13, b=87\nn = int(a + b) # (1): n=1387\nif n == n**0.5 * n**0.5: # (2): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " a, b = input().split()\n n = int(a + b)\n-if n == n**0.5 * n**0.5:\n+if (n**0.5).is_integer():\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": "\n a, b = input().split()\n n = int(a + b)\n-if n == n**0.5 * n**0.5:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u382303205", "problem_id": "p03944", "submission1_id": "s250807186-FL", "submission2_id": "s208498202", "status1": "Wrong Answer", "status2": "Accepted", "code1": "w,h,n = map(int,input().split())\n\nw0 = 0\nh0 = 0\n\nc = [list(map(int,input().split())) for _ in range(n)]\n\nfor i in c:\n if i[2] == 2:\n if i[0] < w:\n w = i[0]\n elif i[2] == 1:\n if i[0] > 0:\n w0 = i[0]\n elif i[2] == 4:\n if i[1] < h:\n h = i[1]\n elif i[2] == 3:\n if i[1] > 0:\n h0 = i[1]\n\nw = w - w0 \nif w < 0:\n w = 0\nh = h - h0\nif h < 0:\n h = 0\nprint(w*h)", "code2": "w,h,n = map(int,input().split())\n\nw0 = 0\nh0 = 0\n\nc = [list(map(int,input().split())) for _ in range(n)]\n\nfor i in c:\n if i[2] == 2:\n if i[0] < w:\n w = i[0]\n elif i[2] == 1:\n if i[0] > w0:\n w0 = i[0]\n elif i[2] == 4:\n if i[1] < h:\n h = i[1]\n elif i[2] == 3:\n if i[1] > h0:\n h0 = i[1]\n\nw = w - w0 \nif w < 0:\n w = 0\nh = h - h0\nif h < 0:\n h = 0\nprint(w*h)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590356415", "date2": "1590356902", "bleu_score": "0.9885971774869299", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "5 4 3\n2 1 2\n6 11 3\n1 2 3\n", "actual_output": "4\n", "expected_output": "0\n\n", "anno_code": ["w,h,n = map(int,input().split()) # (0): w=5, h=4, n=3\n\nw0 = 0 # (1): w0=0\nh0 = 0 # (2): h0=0\n\nc = [list(map(int,input().split())) for _ in range(n)] # (3): c\n\nfor i in c: # (4): i=[2, 1, 2] (8): i=[6, 11, 3] ... (22): NO CHANGE\n if i[2] == 2: # (5): NO CHANGE (9): NO CHANGE (16): NO CHANGE\n if i[0] < w: # (6): NO CHANGE\n w = i[0] # (7): w=2\n elif i[2] == 1: # (10): NO CHANGE (17): NO CHANGE\n if i[0] > 0:\n w0 = i[0]\n elif i[2] == 4: # (11): NO CHANGE (18): NO CHANGE\n if i[1] < h:\n h = i[1]\n elif i[2] == 3: # (12): NO CHANGE (19): NO CHANGE\n if i[1] > 0: # (13): NO CHANGE (20): NO CHANGE\n h0 = i[1] # (14): h0=11 (21): h0=2\n\nw = w - w0 # (23): NO CHANGE\nif w < 0: # (24): NO CHANGE\n w = 0\nh = h - h0 # (25): h=2\nif h < 0: # (26): NO CHANGE\n h = 0\nprint(w*h)"], "anno_status": [true], "diff_content": " w,h,n = map(int,input().split())\n \n w0 = 0\n h0 = 0\n \n c = [list(map(int,input().split())) for _ in range(n)]\n \n for i in c:\n if i[2] == 2:\n if i[0] < w:\n w = i[0]\n elif i[2] == 1:\n- if i[0] > 0:\n+ if i[0] > w0:\n w0 = i[0]\n elif i[2] == 4:\n if i[1] < h:\n h = i[1]\n elif i[2] == 3:\n- if i[1] > 0:\n+ if i[1] > h0:\n h0 = i[1]\n \n w = w - w0 \n if w < 0:\n w = 0\n h = h - h0\n if h < 0:\n h = 0\n print(w*h)\n", "FL_content": "\n w,h,n = map(int,input().split())\n \n w0 = 0\n h0 = 0\n \n c = [list(map(int,input().split())) for _ in range(n)]\n \n for i in c:\n if i[2] == 2:\n if i[0] < w:\n w = i[0]\n elif i[2] == 1:\n- if i[0] > 0:\n w0 = i[0]\n elif i[2] == 4:\n if i[1] < h:\n h = i[1]\n elif i[2] == 3:\n- if i[1] > 0:\n h0 = i[1]\n \n w = w - w0 \n if w < 0:\n w = 0\n h = h - h0\n if h < 0:\n h = 0\n print(w*h)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 28 }, { "user_id": "u319818856", "problem_id": "p03291", "submission1_id": "s676411513-FL", "submission2_id": "s186440312", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def we_love_abc(S: str)->int:\n ABC = 'ABC'\n\n dp = [0, 0, 0, 0]\n dp[3] = 1\n\n for c in reversed(S):\n if c == '?':\n m, m1, m2 = 3, 3, 1\n else:\n m, m1, m2 = 1, 1, 0\n for j in range(3):\n \n \n if c == ABC[j]:\n m2 = 1\n dp[j] = m1 * dp[j] + m2 * dp[j+1]\n \n dp[3] = m * dp[3]\n\n return dp[0] % 1000000007\n\n\nif __name__ == \"__main__\":\n S = input()\n ans = we_love_abc(S)\n print(ans)\n", "code2": "def we_love_abc(S: str)->int:\n ABC = 'ABC'\n MOD = 1000000007\n\n dp = [0, 0, 0, 0]\n dp[3] = 1\n\n for c in reversed(S):\n for j in range(3):\n m1 = 3 if c == '?' else 1\n m2 = 1 if c == '?' or c == ABC[j] else 0\n dp[j] = (m1 * dp[j] + m2 * dp[j+1]) % MOD\n dp[3] = (3 if c == '?' else 1) * dp[3]\n dp[3] %= MOD\n\n return dp[0] % MOD\n\n\nif __name__ == \"__main__\":\n S = input()\n ans = we_love_abc(S)\n print(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1552154500", "date2": "1552155727", "bleu_score": "0.7811320283327741", "code1_test_status": [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 3, "total_score": 103, "input": "?>????>??@??C;?>@B@?@=?>?\n", "actual_output": "36551331\n", "expected_output": "28579716\n\n", "anno_code": ["def we_love_abc(S: str)->int: # (0): we_love_abc=\n ABC = 'ABC'\n\n dp = [0, 0, 0, 0]\n dp[3] = 1\n\n for c in reversed(S):\n if c == '?':\n m, m1, m2 = 3, 3, 1\n else:\n m, m1, m2 = 1, 1, 0\n for j in range(3):\n \n \n if c == ABC[j]:\n m2 = 1\n dp[j] = m1 * dp[j] + m2 * dp[j+1]\n \n dp[3] = m * dp[3]\n\n return dp[0] % 1000000007\n\n\nif __name__ == \"__main__\":\n S = input()\n ans = we_love_abc(S)\n print(ans)\n"], "anno_status": [true], "diff_content": " def we_love_abc(S: str)->int:\n ABC = 'ABC'\n+ MOD = 1000000007\n \n dp = [0, 0, 0, 0]\n dp[3] = 1\n \n for c in reversed(S):\n- if c == '?':\n- m, m1, m2 = 3, 3, 1\n- else:\n- m, m1, m2 = 1, 1, 0\n for j in range(3):\n- \n- \n- if c == ABC[j]:\n- m2 = 1\n- dp[j] = m1 * dp[j] + m2 * dp[j+1]\n- \n- dp[3] = m * dp[3]\n+ m1 = 3 if c == '?' else 1\n+ m2 = 1 if c == '?' or c == ABC[j] else 0\n+ dp[j] = (m1 * dp[j] + m2 * dp[j+1]) % MOD\n+ dp[3] = (3 if c == '?' else 1) * dp[3]\n+ dp[3] %= MOD\n \n- return dp[0] % 1000000007\n+ return dp[0] % MOD\n \n \n if __name__ == \"__main__\":\n S = input()\n ans = we_love_abc(S)\n print(ans)\n \n", "FL_content": "\n def we_love_abc(S: str)->int:\n ABC = 'ABC'\n \n dp = [0, 0, 0, 0]\n dp[3] = 1\n \n for c in reversed(S):\n if c == '?':\n m, m1, m2 = 3, 3, 1\n else:\n m, m1, m2 = 1, 1, 0\n for j in range(3):\n \n \n if c == ABC[j]:\n m2 = 1\n dp[j] = m1 * dp[j] + m2 * dp[j+1]\n \n dp[3] = m * dp[3]\n \n return dp[0] % 1000000007\n \n \n if __name__ == \"__main__\":\n S = input()\n ans = we_love_abc(S)\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 28 }, { "user_id": "u279605379", "problem_id": "p02300", "submission1_id": "s157520417-FL", "submission2_id": "s688186911", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import heapq\n\ndef isCLKWISE(ph):\n a = [ph[-1][0]-ph[-3][0],ph[-1][1]-ph[-3][1]]\n b = [ph[-2][0]-ph[-3][0],ph[-2][1]-ph[-3][1]]\n crs = a[0]*b[1] - a[1]*b[0]\n if crs < 0 :\n return False\n else :\n return True\n \ndef ConvexHullScan(P):\n phU = [P[0],P[1]]\n for p in P[2:]:\n phU.append(p)\n while(True):\n if isCLKWISE(phU) :\n break\n else :\n del phU[-2]\n if len(phU) == 2 :\n break\n phL = [P[-1],P[-2]]\n for p in P[-3::-1]:\n phL.append(p)\n while(True):\n if isCLKWISE(phL) :\n break\n else :\n del phL[-2]\n if len(phL) == 2 :\n break\n ph = phU + phL[1:-1]\n return ph\n\nn = int(input())\nP = []\nfor i in range(n):\n heapq.heappush(P,[int(x) for x in input().split()])\n \nQ = ConvexHullScan(P)\nQ.reverse()\nprint(len(Q))\nfor q in Q:\n idx = min([[x[1][1],x[1][0],x[0]] for x in enumerate(Q)])[2]\n R = Q[idx:] + Q[:idx]\nfor r in R:\n print(r[0],r[1])", "code2": "def isCLKWISE(ph):\n a = [ph[-1][0]-ph[-3][0],ph[-1][1]-ph[-3][1]]\n b = [ph[-2][0]-ph[-3][0],ph[-2][1]-ph[-3][1]]\n crs = a[0]*b[1] - a[1]*b[0]\n if crs < 0 :\n return False\n else :\n return True\n \ndef ConvexHullScan(P):\n P = sorted(P)\n phU = [P[0],P[1]]\n for p in P[2:]:\n phU.append(p)\n while(True):\n if isCLKWISE(phU) :\n break\n else :\n del phU[-2]\n if len(phU) == 2 :\n break\n phL = [P[-1],P[-2]]\n for p in P[-3::-1]:\n phL.append(p)\n while(True):\n if isCLKWISE(phL) :\n break\n else :\n del phL[-2]\n if len(phL) == 2 :\n break\n ph = phU + phL[1:-1]\n return ph\n \nn = int(input())\nP = []\nfor i in range(n):\n P += [[int(x) for x in input().split()]]\n \nQ = ConvexHullScan(P)\nQ.reverse()\nprint(len(Q))\nidx = min([[x[1][1],x[1][0],x[0]] for x in enumerate(Q)])[2]\nR = Q[idx:] + Q[:idx]\nfor r in R:\n print(r[0],r[1])", "original_language1": "Python3", "original_language2": "Python3", "date1": "1504490731", "date2": "1504492209", "bleu_score": "0.9551279937725842", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1], "code1_test_score": 66, "total_score": 102, "input": "7\n2 1\n0 0\n1 0\n2 0\n4 2\n1 3\n3 3\n", "actual_output": "7\n0 0\n2 0\n4 2\n3 3\n1 3\n1 0\n2 0\n", "expected_output": "6\n0 0\n1 0\n2 0\n4 2\n3 3\n1 3\n\n", "anno_code": ["import heapq\n\ndef isCLKWISE(ph): # (0): isCLKWISE=\n a = [ph[-1][0]-ph[-3][0],ph[-1][1]-ph[-3][1]] # (25): a=[1, 0] (34): a=[0, 1] ... (142): a=[-4, -2]\n b = [ph[-2][0]-ph[-3][0],ph[-2][1]-ph[-3][1]] # (26): b=[2, 0] (35): b=[-1, 0] ... (143): b=[-2, -2]\n crs = a[0]*b[1] - a[1]*b[0] # (27): crs=0 (36): crs=1 ... (144): crs=4\n if crs < 0 : # (28): P=[[0, 0], [2, 0], [1, 0], [2, 1], [4, 2], [1, 3], [3, 3]], phU=[[0, 0], [2, 0], [1, 0]], p=[1, 0] (37): P=[[0, 0], [2, 0], [1, 0], [2, 1], [4, 2], [1, 3], [3, 3]], phU=[[0, 0], [2, 0], [1, 0], [2, 1]], p=[2, 1] ... (145): P=[[0, 0], [2, 0], [1, 0], [2, 1], [4, 2], [1, 3], [3, 3]], phU, p=[0, 0], phL\n return False\n else :\n return True\n \ndef ConvexHullScan(P): # (1): ConvexHullScan=\n phU = [P[0],P[1]] # (20): phU\n for p in P[2:]: # (21): p=[1, 0] (30): p=[2, 1] ... (82): NO CHANGE\n phU.append(p) # (22): phU (31): phU ... (74): phU\n while(True): # (23): NO CHANGE (32): NO CHANGE ... (75): NO CHANGE\n if isCLKWISE(phU) : # (24): ph (33): ph ... (76): ph\n break # (29): NO CHANGE (38): NO CHANGE ... (81): NO CHANGE\n else :\n del phU[-2] # (56): phU (64): phU\n if len(phU) == 2 : # (57): NO CHANGE (65): NO CHANGE\n break\n phL = [P[-1],P[-2]] # (83): phL\n for p in P[-3::-1]: # (84): p=[4, 2] (95): p=[2, 1] ... (147): NO CHANGE\n phL.append(p) # (85): phL (96): phL ... (139): phL\n while(True): # (86): NO CHANGE (97): NO CHANGE ... (140): NO CHANGE\n if isCLKWISE(phL) : # (87): ph (98): ph ... (141): ph\n break # (103): NO CHANGE (120): NO CHANGE ... (146): NO CHANGE\n else :\n del phL[-2] # (92): phL=[[3, 3], [4, 2]] (112): phL (129): phL\n if len(phL) == 2 : # (93): NO CHANGE (113): NO CHANGE (130): NO CHANGE\n break # (94): NO CHANGE\n ph = phU + phL[1:-1] # (148): heapq=, isCLKWISE=, ConvexHullScan=, n=7, i=6, Q\n return ph\n\nn = int(input()) # (2): n=7\nP = [] # (3): P=[]\nfor i in range(n): # (4): i=0 (6): i=1 ... (18): NO CHANGE\n heapq.heappush(P,[int(x) for x in input().split()]) # (5): P (7): P ... (17): P\n \nQ = ConvexHullScan(P) # (19): NO CHANGE\nQ.reverse() # (149): Q\nprint(len(Q)) # (150): NO CHANGE\nfor q in Q: # (151): q=[2, 0] (154): q=[4, 2] ... (172): NO CHANGE\n idx = min([[x[1][1],x[1][0],x[0]] for x in enumerate(Q)])[2] # (152): idx=6 (155): NO CHANGE ... (170): NO CHANGE\n R = Q[idx:] + Q[:idx] # (153): R (156): NO CHANGE ... (171): NO CHANGE\nfor r in R: # (173): r=[0, 0] (175): r=[2, 0] ... (185): r=[2, 0]\n print(r[0],r[1]) # (174): NO CHANGE (176): NO CHANGE ... (186): NO CHANGE\n"], "anno_status": [false], "diff_content": "-import heapq\n-\n def isCLKWISE(ph):\n a = [ph[-1][0]-ph[-3][0],ph[-1][1]-ph[-3][1]]\n b = [ph[-2][0]-ph[-3][0],ph[-2][1]-ph[-3][1]]\n crs = a[0]*b[1] - a[1]*b[0]\n if crs < 0 :\n return False\n else :\n return True\n- \n+ \n def ConvexHullScan(P):\n+ P = sorted(P)\n phU = [P[0],P[1]]\n for p in P[2:]:\n phU.append(p)\n while(True):\n if isCLKWISE(phU) :\n break\n else :\n del phU[-2]\n if len(phU) == 2 :\n break\n phL = [P[-1],P[-2]]\n for p in P[-3::-1]:\n phL.append(p)\n while(True):\n if isCLKWISE(phL) :\n break\n else :\n del phL[-2]\n if len(phL) == 2 :\n break\n ph = phU + phL[1:-1]\n return ph\n-\n+ \n n = int(input())\n P = []\n for i in range(n):\n- heapq.heappush(P,[int(x) for x in input().split()])\n- \n+ P += [[int(x) for x in input().split()]]\n+ \n Q = ConvexHullScan(P)\n Q.reverse()\n print(len(Q))\n-for q in Q:\n- idx = min([[x[1][1],x[1][0],x[0]] for x in enumerate(Q)])[2]\n- R = Q[idx:] + Q[:idx]\n+idx = min([[x[1][1],x[1][0],x[0]] for x in enumerate(Q)])[2]\n+R = Q[idx:] + Q[:idx]\n for r in R:\n print(r[0],r[1])\n", "FL_content": "\n import heapq\n \n def isCLKWISE(ph):\n a = [ph[-1][0]-ph[-3][0],ph[-1][1]-ph[-3][1]]\n b = [ph[-2][0]-ph[-3][0],ph[-2][1]-ph[-3][1]]\n crs = a[0]*b[1] - a[1]*b[0]\n if crs < 0 :\n return False\n else :\n return True\n \n def ConvexHullScan(P):\n phU = [P[0],P[1]]\n for p in P[2:]:\n phU.append(p)\n while(True):\n if isCLKWISE(phU) :\n break\n else :\n del phU[-2]\n if len(phU) == 2 :\n break\n phL = [P[-1],P[-2]]\n for p in P[-3::-1]:\n phL.append(p)\n while(True):\n if isCLKWISE(phL) :\n break\n else :\n del phL[-2]\n if len(phL) == 2 :\n break\n ph = phU + phL[1:-1]\n return ph\n \n n = int(input())\n P = []\n for i in range(n):\n heapq.heappush(P,[int(x) for x in input().split()])\n \n Q = ConvexHullScan(P)\n Q.reverse()\n print(len(Q))\n for q in Q:\n- idx = min([[x[1][1],x[1][0],x[0]] for x in enumerate(Q)])[2]\n R = Q[idx:] + Q[:idx]\n for r in R:\n print(r[0],r[1])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 48 }, { "user_id": "u425177436", "problem_id": "p03437", "submission1_id": "s093184521-FL", "submission2_id": "s097971439", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x,y=map(int,input().split())\nprint(x if y%x!=0 else -1)", "code2": "x,y=map(int,input().split())\nprint(x if x%y!=0 else -1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1517717232", "date2": "1517717588", "bleu_score": "0.9280556628566694", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 24, "total_score": 25, "input": "-6 12\n", "actual_output": "-1\n", "expected_output": "-6\n\n", "anno_code": ["x,y=map(int,input().split()) # (0): x=-6, y=12\nprint(x if y%x!=0 else -1)"], "anno_status": [true], "diff_content": " x,y=map(int,input().split())\n-print(x if y%x!=0 else -1)\n+print(x if x%y!=0 else -1)\n", "FL_content": "\n x,y=map(int,input().split())\n-print(x if y%x!=0 else -1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 2 }, { "user_id": "u356832650", "problem_id": "p03505", "submission1_id": "s200634590-FL", "submission2_id": "s393259520", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nimport math\nK, A, B = list(map(int, input().split()))\n\nif A >= K:\n print(1)\n sys.exit()\nelif (A - B) <= 0:\n print(-1)\n sys.exit()\nd = A - B\n\np = K-A\nq = math.ceil(float(p)/d)\n", "code2": "import sys\nimport math\nK, A, B = list(map(int, input().split()))\n \nif (A >= K):\n print('1')\n sys.exit()\nelif (A - B) <= 0:\n print('-1')\n sys.exit()\nd = A-B\np = K-A\nq = int(p\nif ((p % d) != 0):\n q += 1\nprint(str(2*q + 1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512519355", "date2": "1512521288", "bleu_score": "0.699471254243273", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0], "code1_test_score": 3, "total_score": 103, "input": "1101000010100000000 4 0\n", "actual_output": "", "expected_output": "550500005049999999\n\n", "anno_code": ["import sys\nimport math\nK, A, B = list(map(int, input().split())) # (0): K=1101000010100000000, A=4, B=0\n\nif A >= K: # (1): NO CHANGE\n print(1)\n sys.exit()\nelif (A - B) <= 0: # (2): NO CHANGE\n print(-1)\n sys.exit()\nd = A - B # (3): d=4\n\np = K-A # (4): p=1101000010099999996\nq = math.ceil(float(p)/d)\n"], "anno_status": [true], "diff_content": " import sys\n import math\n K, A, B = list(map(int, input().split()))\n-\n-if A >= K:\n- print(1)\n+ \n+if (A >= K):\n+ print('1')\n sys.exit()\n elif (A - B) <= 0:\n- print(-1)\n+ print('-1')\n sys.exit()\n-d = A - B\n-\n+d = A-B\n p = K-A\n-q = math.ceil(float(p)/d)\n-\n+q = int(p\n+if ((p % d) != 0):\n+ q += 1\n+print(str(2*q + 1))\n", "FL_content": "\n import sys\n import math\n K, A, B = list(map(int, input().split()))\n \n if A >= K:\n print(1)\n sys.exit()\n elif (A - B) <= 0:\n print(-1)\n sys.exit()\n d = A - B\n \n p = K-A\n-q = math.ceil(float(p)/d)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u079022116", "problem_id": "p03012", "submission1_id": "s065071812-FL", "submission2_id": "s270523521", "status1": "Wrong Answer", "status2": "Accepted", "code1": "ans = 0\nn = int(input())\nw = list(map(int,input().split()))\nmid = sum(w)\nans = 0\nfor i in w:\n ans += i\n if mid <= ans:\n print(ans-(sum(w)-ans))\n break", "code2": "n = int(input())\nw = list(map(int,input().split()))\nans = []\ns = 0\nfor i in range(n):\n s += w[i]\n ans.append(abs(s-sum(w[i+1:])))\nprint(min(ans))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1579913897", "date2": "1579914794", "bleu_score": "0.6086887302504811", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 100, "input": "8\n1 5 38 0 0 1 235 5\n", "actual_output": "285\n", "expected_output": "195\n\n", "anno_code": ["ans = 0 # (0): ans=0\nn = int(input()) # (1): n=8\nw = list(map(int,input().split())) # (2): w=[1, 5, 38, 0, 0, 1, 235, 5]\nmid = sum(w) # (3): mid=285\nans = 0 # (4): NO CHANGE\nfor i in w: # (5): i=1 (8): i=5 ... (26): i=5\n ans += i # (6): ans=1 (9): ans=6 ... (27): ans=285\n if mid <= ans: # (7): NO CHANGE (10): NO CHANGE ... (28): NO CHANGE\n print(ans-(sum(w)-ans)) # (29): NO CHANGE\n break"], "anno_status": [true], "diff_content": "-ans = 0\n n = int(input())\n w = list(map(int,input().split()))\n-mid = sum(w)\n-ans = 0\n-for i in w:\n- ans += i\n- if mid <= ans:\n- print(ans-(sum(w)-ans))\n- break\n+ans = []\n+s = 0\n+for i in range(n):\n+ s += w[i]\n+ ans.append(abs(s-sum(w[i+1:])))\n+print(min(ans))\n", "FL_content": "\n ans = 0\n n = int(input())\n w = list(map(int,input().split()))\n-mid = sum(w)\n-ans = 0\n-for i in w:\n- ans += i\n- if mid <= ans:\n- print(ans-(sum(w)-ans))\n- break\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u366959492", "problem_id": "p03643", "submission1_id": "s983613509-FL", "submission2_id": "s034829564", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=str(input())\nprint(\"ABC\",n)", "code2": "n=input()\nprint(\"ABC\"+n)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1553189858", "date2": "1553190106", "bleu_score": "0.650412536552969", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "-41\n", "actual_output": "ABC -41\n", "expected_output": "ABC-41\n\n", "anno_code": ["n=str(input()) # (0): n=-41\nprint(\"ABC\",n)"], "anno_status": [true], "diff_content": "-n=str(input())\n-print(\"ABC\",n)\n+n=input()\n+print(\"ABC\"+n)\n+\n", "FL_content": "\n n=str(input())\n-print(\"ABC\",n)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 2 }, { "user_id": "u091051505", "problem_id": "p04000", "submission1_id": "s508859529-FL", "submission2_id": "s972124129", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter, defaultdict\n\nans = defaultdict(lambda: 0)\nh, w, n = map(int, input().split())\nfor _ in range(n):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n for a_i in range(a - 2, a + 1):\n for b_i in range(b - 2, b + 1):\n if (0 <= a_i < h - 2) & (0 <= b_i < w - 2):\n ans[(a_i, b_i)] += 1\n\nk = Counter(ans.values())\nans_0 = (h - 2) * (w - 2) - sum(k.values())\nfor i in range(10):\n if i in k.keys():\n print(k[i])\n else:\n print(0)", "code2": "from collections import Counter, defaultdict\n\nans = defaultdict(lambda: 0)\nh, w, n = map(int, input().split())\nfor _ in range(n):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n for a_i in range(a - 2, a + 1):\n for b_i in range(b - 2, b + 1):\n if (0 <= a_i < h - 2) & (0 <= b_i < w - 2):\n ans[(a_i, b_i)] += 1\n\nk = Counter(ans.values())\nprint((h - 2) * (w - 2) - sum(k.values()))\nfor i in range(1, 10):\n if i in k.keys():\n print(k[i])\n else:\n print(0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567562214", "date2": "1567562289", "bleu_score": "0.9767828132613441", "code1_test_status": [0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 10, "total_score": 103, "input": "10 10 20\n1 1\n1 4\n1 9\n2 5\n3 10\n4 2\n2 7\n5 9\n6 4\n6 6\n6 7\n7 2\n7 3\n7 7\n8 1\n8 5\n8 10\n9 2\n10 4\n10 9\n", "actual_output": "0\n24\n23\n10\n2\n0\n0\n0\n0\n0\n", "expected_output": "5\n24\n23\n10\n2\n0\n0\n0\n0\n0\n\n", "anno_code": ["from collections import Counter, defaultdict\n\nans = defaultdict(lambda: 0) # (0): ans=defaultdict( at 0x0000021C73EA9BD0>, {})\nh, w, n = map(int, input().split()) # (1): h=10, w=10, n=20\nfor _ in range(n): # (2): _=0 (32): _=1 ... (690): NO CHANGE\n a, b = map(int, input().split()) # (3): a=1, b=1 (33): a=1, b=4 ... (660): a=10, b=9\n a -= 1 # (4): a=0 (34): a=0 ... (661): a=9\n b -= 1 # (5): b=0 (35): b=3 ... (662): b=8\n for a_i in range(a - 2, a + 1): # (6): a_i=-2 (14): a_i=-1 ... (689): NO CHANGE\n for b_i in range(b - 2, b + 1): # (7): b_i=-2 (9): b_i=-1 ... (688): NO CHANGE\n if (0 <= a_i < h - 2) & (0 <= b_i < w - 2): # (8): NO CHANGE (10): NO CHANGE ... (687): NO CHANGE\n ans[(a_i, b_i)] += 1 # (29): ans=defaultdict( at 0x0000021C73EA9BD0>, {(0, 0): 1}) (55): ans=defaultdict( at 0x0000021C73EA9BD0>, {(0, 0): 1, (0, 1): 1}) ... (669): ans=defaultdict( at 0x0000021C73EA9BD0>, {(0, 0): 1, (0, 1): 1, (0, 2): 2, (0, 3): 2, (0, 6): 2, (0, 7): 2, (0, 4): 2, (1, 2): 1, (1, 3): 1, (1, 4): 2, (1, 7): 1, (2, 7): 2, (1, 0): 1, (1, 1): 1, (2, 0): 1, (2, 1): 1, (3, 0): 1, (3, 1): 2, (0, 5): 1, (1, 5): 1, (1, 6): 1, (2, 6): 1, (3, 6): 2, (3, 7): 1, (4, 6): 3, (4, 7): 1, (3, 2): 1, (3, 3): 2, (4, 1): 3, (4, 2): 2, (4, 3): 2, (5, 1): 3, (5, 2): 3, (5, 3): 3, (3, 4): 2, (3, 5): 2, (4, 4): 3, (4, 5): 3, (5, 4): 4, (5, 5): 3, (5, 6): 2, (4, 0): 2, (5, 0): 3, (6, 0): 4, (6, 1): 3, (6, 2): 2, (6, 4): 2, (6, 5): 1, (6, 6): 1, (7, 0): 2, (6, 3): 1, (7, 2): 2, (7, 3): 2, (7, 4): 1, (5, 7): 1, (6, 7): 1, (7, 7): 2, (7, 1): 2, (7, 6): 1})\n\nk = Counter(ans.values()) # (691): k=Counter({1: 24, 2: 23, 3: 10, 4: 2})\nans_0 = (h - 2) * (w - 2) - sum(k.values()) # (692): ans_0=5\nfor i in range(10): # (693): i=0 (696): i=1 ... (720): i=9\n if i in k.keys(): # (694): NO CHANGE (697): NO CHANGE ... (721): NO CHANGE\n print(k[i]) # (698): NO CHANGE (701): NO CHANGE ... (707): NO CHANGE\n else:\n print(0) # (695): NO CHANGE (710): NO CHANGE ... (722): NO CHANGE\n"], "anno_status": [false], "diff_content": " from collections import Counter, defaultdict\n \n ans = defaultdict(lambda: 0)\n h, w, n = map(int, input().split())\n for _ in range(n):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n for a_i in range(a - 2, a + 1):\n for b_i in range(b - 2, b + 1):\n if (0 <= a_i < h - 2) & (0 <= b_i < w - 2):\n ans[(a_i, b_i)] += 1\n \n k = Counter(ans.values())\n-ans_0 = (h - 2) * (w - 2) - sum(k.values())\n-for i in range(10):\n+print((h - 2) * (w - 2) - sum(k.values()))\n+for i in range(1, 10):\n if i in k.keys():\n print(k[i])\n else:\n print(0)\n", "FL_content": "\n from collections import Counter, defaultdict\n \n ans = defaultdict(lambda: 0)\n h, w, n = map(int, input().split())\n for _ in range(n):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n for a_i in range(a - 2, a + 1):\n for b_i in range(b - 2, b + 1):\n- if (0 <= a_i < h - 2) & (0 <= b_i < w - 2):\n ans[(a_i, b_i)] += 1\n \n k = Counter(ans.values())\n ans_0 = (h - 2) * (w - 2) - sum(k.values())\n for i in range(10):\n if i in k.keys():\n print(k[i])\n else:\n print(0)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u864197622", "problem_id": "p02589", "submission1_id": "s622554698-FL", "submission2_id": "s598476480", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nP = 10 ** 9 + 7\nN = int(input())\nX = sorted([input()[::-1] for _ in range(N)], key = len)\n\nD = {}\nans = 0\nfor x in X:\n L = [0] * 26\n T, a = x[:-1], ord(x[-1]) - 97\n h = 0\n for t in T:\n if h in D:\n for i in range(26):\n L[i] += D[h][i]\n b = ord(t) - 97\n ans += L[b]\n L[b] = 0\n \n h = (h + b) * 7 % P\n ans += L[a]\n if h in D:\n D[h][a] += 1\n else:\n D[h] = [0] * 26\n D[h][a] = 1\n \nprint(ans)", "code2": "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nP = 10 ** 40 + 121\nN = int(input())\nX = sorted([input()[::-1] for _ in range(N)], key = len)\n\nD = {}\nans = 0\nfor x in X:\n L = [0] * 26\n T, a = x[:-1], ord(x[-1]) - 97\n h = 0\n for t in T:\n if h in D:\n for i in range(26):\n L[i] += D[h][i]\n b = ord(t) - 97\n ans += L[b]\n L[b] = 0\n \n h = (h + b + 135) * 71 % P\n ans += L[a]\n if h in D:\n D[h][a] += 1\n else:\n D[h] = [0] * 26\n D[h][a] = 1\n \nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597127750", "date2": "1597129549", "bleu_score": "0.9680078589118257", "code1_test_status": [1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 74, "total_score": 102, "input": "3\ndabxxy\nczw\nbaa\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["import sys\ninput = lambda: sys.stdin.readline().rstrip() # (0): input= at 0x0000016CE2279BD0>\nP = 10 ** 9 + 7 # (1): P=1000000007\nN = int(input()) # (2): N=3\nX = sorted([input()[::-1] for _ in range(N)], key = len) # (3): X=['wzc', 'aab', 'yxxbad']\n\nD = {} # (4): D={}\nans = 0 # (5): ans=0\nfor x in X: # (6): x=wzc (27): x=aab ... (140): NO CHANGE\n L = [0] * 26 # (7): L=[0, 0, ..., 0, 0] (28): NO CHANGE (49): NO CHANGE\n T, a = x[:-1], ord(x[-1]) - 97 # (8): T=wz, a=2 (29): T=aa, a=1 (50): T=yxxba, a=3\n h = 0 # (9): h=0 (30): h=0 (51): NO CHANGE\n for t in T: # (10): t=w (16): t=z ... (135): NO CHANGE\n if h in D: # (11): NO CHANGE (17): NO CHANGE ... (130): NO CHANGE\n for i in range(26): # (54): i=0 (56): i=1 ... (106): NO CHANGE\n L[i] += D[h][i] # (55): NO CHANGE (57): L=[0, 1, ..., 0, 0] ... (105): NO CHANGE\n b = ord(t) - 97 # (12): b=22 (18): b=25 ... (131): b=0\n ans += L[b] # (13): NO CHANGE (19): NO CHANGE ... (132): NO CHANGE\n L[b] = 0 # (14): NO CHANGE (20): NO CHANGE ... (133): NO CHANGE\n \n h = (h + b) * 7 % P # (15): h=154 (21): h=1253 ... (134): h=466529\n ans += L[a] # (23): NO CHANGE (44): NO CHANGE (136): NO CHANGE\n if h in D: # (24): NO CHANGE (45): NO CHANGE (137): NO CHANGE\n D[h][a] += 1\n else:\n D[h] = [0] * 26 # (25): D={1253: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (46): D={1253: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 0: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (138): D={1253: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 0: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 466529: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\n D[h][a] = 1 # (26): D={1253: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (47): D={1253: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 0: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (139): D={1253: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 0: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 466529: [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\n \nprint(ans)"], "anno_status": [false], "diff_content": " import sys\n input = lambda: sys.stdin.readline().rstrip()\n-P = 10 ** 9 + 7\n+P = 10 ** 40 + 121\n N = int(input())\n X = sorted([input()[::-1] for _ in range(N)], key = len)\n \n D = {}\n ans = 0\n for x in X:\n L = [0] * 26\n T, a = x[:-1], ord(x[-1]) - 97\n h = 0\n for t in T:\n if h in D:\n for i in range(26):\n L[i] += D[h][i]\n b = ord(t) - 97\n ans += L[b]\n L[b] = 0\n \n- h = (h + b) * 7 % P\n+ h = (h + b + 135) * 71 % P\n ans += L[a]\n if h in D:\n D[h][a] += 1\n else:\n D[h] = [0] * 26\n D[h][a] = 1\n \n print(ans)\n", "FL_content": "\n import sys\n input = lambda: sys.stdin.readline().rstrip()\n P = 10 ** 9 + 7\n N = int(input())\n X = sorted([input()[::-1] for _ in range(N)], key = len)\n \n D = {}\n ans = 0\n for x in X:\n L = [0] * 26\n T, a = x[:-1], ord(x[-1]) - 97\n h = 0\n for t in T:\n if h in D:\n for i in range(26):\n L[i] += D[h][i]\n b = ord(t) - 97\n ans += L[b]\n L[b] = 0\n \n h = (h + b) * 7 % P\n ans += L[a]\n if h in D:\n D[h][a] += 1\n else:\n D[h] = [0] * 26\n D[h][a] = 1\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 29 }, { "user_id": "u894258749", "problem_id": "p03003", "submission1_id": "s503440961-FL", "submission2_id": "s427126016", "status1": "Wrong Answer", "status2": "Accepted", "code1": "inpl = lambda: list(map(int,input().split()))\nN, M = inpl()\nS = inpl()\nT = inpl()\n\ntotal = [0]*(N+1)*(M+1)\nfor i in range(N):\n\tfor j in range(M):\n\t\tif S[i] == T[j]:\n\t\t\tn = total[(M+1)*i+j] + 1\n\t\telse:\n\t\t\tn = 0\n\t\ttotal[(M+1)*(i+1)+(j+1)] = n + total[(M+1)*i+(j+1)] + total[(M+1)*(i+1)+j] - total[(M+1)*i+j]\nprint(total[-1]+1)", "code2": "inpl = lambda: list(map(int,input().split()))\nMOD = 10**9 + 7\nN, M = inpl()\nS = inpl()\nT = inpl()\n\ntotal = [0]*(N+1)*(M+1)\nfor i in range(N):\n\tfor j in range(M):\n\t\tif S[i] == T[j]:\n\t\t\tn = total[(M+1)*i+j] + 1\n\t\telse:\n\t\t\tn = 0\n\t\ttotal[(M+1)*(i+1)+(j+1)] = (n + total[(M+1)*i+(j+1)] + total[(M+1)*(i+1)+j] - total[(M+1)*i+j]) % MOD\nprint((total[-1]+1) % MOD)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1560892997", "date2": "1560893239", "bleu_score": "0.8969336114475487", "code1_test_status": [1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0], "code1_test_score": 57, "total_score": 105, "input": "20 20\n1 1 1 1 1 1 1 0 1 1 1 1 2 1 1 1 1 1 1 1\n1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n", "actual_output": "17761869048\n", "expected_output": "761868929\n\n", "anno_code": ["inpl = lambda: list(map(int,input().split())) # (0): inpl= at 0x000001905DDD9BD0>\nN, M = inpl() # (1): N=20, M=20\nS = inpl() # (2): S=[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1]\nT = inpl() # (3): T=[1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]\n\ntotal = [0]*(N+1)*(M+1) # (4): total=[0, 0, ..., 0, 0]\nfor i in range(N): # (5): i=0 (87): i=1 ... (1645): NO CHANGE\n\tfor j in range(M): # (6): j=0 (10): j=1 ... (1644): NO CHANGE\n\t\tif S[i] == T[j]: # (7): NO CHANGE (11): NO CHANGE ... (1641): NO CHANGE\n\t\t\tn = total[(M+1)*i+j] + 1 # (8): n=1 (12): NO CHANGE ... (1642): n=4557319746\n\t\telse:\n\t\t\tn = 0 # (20): n=0 (102): n=0 ... (1578): n=0\n\t\ttotal[(M+1)*(i+1)+(j+1)] = n + total[(M+1)*i+(j+1)] + total[(M+1)*(i+1)+j] - total[(M+1)*i+j] # (9): total=[0, 0, ..., 0, 0] (13): total=[0, 0, ..., 0, 0] ... (1643): total=[0, 0, ..., 9137213315, 17761869047]\nprint(total[-1]+1)"], "anno_status": [true], "diff_content": " inpl = lambda: list(map(int,input().split()))\n+MOD = 10**9 + 7\n N, M = inpl()\n S = inpl()\n T = inpl()\n \n total = [0]*(N+1)*(M+1)\n for i in range(N):\n \tfor j in range(M):\n \t\tif S[i] == T[j]:\n \t\t\tn = total[(M+1)*i+j] + 1\n \t\telse:\n \t\t\tn = 0\n-\t\ttotal[(M+1)*(i+1)+(j+1)] = n + total[(M+1)*i+(j+1)] + total[(M+1)*(i+1)+j] - total[(M+1)*i+j]\n-print(total[-1]+1)\n+\t\ttotal[(M+1)*(i+1)+(j+1)] = (n + total[(M+1)*i+(j+1)] + total[(M+1)*(i+1)+j] - total[(M+1)*i+j]) % MOD\n+print((total[-1]+1) % MOD)\n", "FL_content": "\n inpl = lambda: list(map(int,input().split()))\n N, M = inpl()\n S = inpl()\n T = inpl()\n \n total = [0]*(N+1)*(M+1)\n for i in range(N):\n \tfor j in range(M):\n \t\tif S[i] == T[j]:\n \t\t\tn = total[(M+1)*i+j] + 1\n \t\telse:\n \t\t\tn = 0\n \t\ttotal[(M+1)*(i+1)+(j+1)] = n + total[(M+1)*i+(j+1)] + total[(M+1)*(i+1)+j] - total[(M+1)*i+j]\n-print(total[-1]+1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u519339498", "problem_id": "p03338", "submission1_id": "s678464512-FL", "submission2_id": "s945757543", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N=int(input())\nS=input()\nans=1\nfor i in range(N-2):\n ans=max(ans,len(list(set(list(S[:i+1])) & set(list(S[i+1:])))))\nprint(ans)", "code2": "N=int(input())\nS=input()\nans=0\nfor i in range(N):\n ans=max(ans,len(list(set(list(set(list(S[:i+1])) & set(list(S[i+1:])))))))\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1597283825", "date2": "1597284049", "bleu_score": "0.8889844982360751", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "6\nb`^dca\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["N=int(input()) # (0): N=6\nS=input() # (1): S=b`^dca\nans=1 # (2): ans=1\nfor i in range(N-2): # (3): i=0 (5): i=1 ... (11): NO CHANGE\n ans=max(ans,len(list(set(list(S[:i+1])) & set(list(S[i+1:]))))) # (4): NO CHANGE (6): NO CHANGE ... (10): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " N=int(input())\n S=input()\n-ans=1\n-for i in range(N-2):\n- ans=max(ans,len(list(set(list(S[:i+1])) & set(list(S[i+1:])))))\n+ans=0\n+for i in range(N):\n+ ans=max(ans,len(list(set(list(set(list(S[:i+1])) & set(list(S[i+1:])))))))\n print(ans)\n", "FL_content": "\n N=int(input())\n S=input()\n-ans=1\n-for i in range(N-2):\n- ans=max(ans,len(list(set(list(S[:i+1])) & set(list(S[i+1:])))))\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u639135641", "problem_id": "p02401", "submission1_id": "s093881439-FL", "submission2_id": "s709707125", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nwhile True:\n a,op,b=map(str,input().split())\n if op==\"?\":\n break\n \n if op==\"+\":\n print(int(a)+int(b))\n elif op==\"-\":\n print(int(a)-int(b))\n elif op==\"*\":\n print(int(a)*int(b))\n elif op==\"/\":\n print(\"%.0f\" %(int(a)/int(b)))\n", "code2": "\n\nwhile True:\n a,op,b=map(str,input().split())\n if op==\"?\":\n break\n \n if op==\"+\":\n print(int(a)+int(b))\n elif op==\"-\":\n print(int(a)-int(b))\n elif op==\"*\":\n print(int(a)*int(b))\n elif op==\"/\":\n print((int(a)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1517015665", "date2": "1517015812", "bleu_score": "0.9304503966272267", "code1_test_status": [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 21, "total_score": 101, "input": "1 , 2\n56 - 18\n2 * 2\n100 / 7\n2 , 81\n-1 ? 0\n", "actual_output": "38\n4\n14\n", "expected_output": "(1, 2)\n38\n4\n14\n(2, 81)\n\n", "anno_code": ["\n\nwhile True: # (0): NO CHANGE (7): NO CHANGE ... (35): NO CHANGE\n a,op,b=map(str,input().split()) # (1): a=1, op=,, b=2 (8): a=56, op=-, b=18 ... (36): a=-1, op=?, b=0\n if op==\"?\": # (2): NO CHANGE (9): NO CHANGE ... (37): NO CHANGE\n break\n \n if op==\"+\": # (3): NO CHANGE (10): NO CHANGE ... (31): NO CHANGE\n print(int(a)+int(b))\n elif op==\"-\": # (4): NO CHANGE (11): NO CHANGE ... (32): NO CHANGE\n print(int(a)-int(b)) # (12): NO CHANGE\n elif op==\"*\": # (5): NO CHANGE (18): NO CHANGE ... (33): NO CHANGE\n print(int(a)*int(b)) # (19): NO CHANGE\n elif op==\"/\": # (6): NO CHANGE (26): NO CHANGE (34): NO CHANGE\n print(\"%.0f\" %(int(a)/int(b))) # (27): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n \n while True:\n a,op,b=map(str,input().split())\n if op==\"?\":\n break\n \n if op==\"+\":\n print(int(a)+int(b))\n elif op==\"-\":\n print(int(a)-int(b))\n elif op==\"*\":\n print(int(a)*int(b))\n elif op==\"/\":\n- print(\"%.0f\" %(int(a)/int(b)))\n+ print((int(a)\n \n", "FL_content": "\n \n \n while True:\n a,op,b=map(str,input().split())\n if op==\"?\":\n break\n \n if op==\"+\":\n print(int(a)+int(b))\n elif op==\"-\":\n print(int(a)-int(b))\n elif op==\"*\":\n print(int(a)*int(b))\n- elif op==\"/\":\n- print(\"%.0f\" %(int(a)/int(b)))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u761320129", "problem_id": "p03977", "submission1_id": "s606118522-FL", "submission2_id": "s923840070", "status1": "Wrong Answer", "status2": "Accepted", "code1": "T = int(input())\nts = [tuple(map(int,input().split())) for i in range(T)]\n\ndef solve(n,d):\n if n%2:\n return d + 127*(n-1)\n else:\n return d^127 + 127*(n-1)\n\nfor n,d in ts:\n print(solve(n,d))", "code2": "T = int(input())\nts = [tuple(map(int,input().split())) for i in range(T)]\n\ndef solve(n,d):\n if n%2:\n return d + 127*(n-1)\n else:\n return 127*n - d\n\nfor n,d in ts:\n print(solve(n,d))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1542050710", "date2": "1542051165", "bleu_score": "0.9339702645326505", "code1_test_status": [1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1], "code1_test_score": 43, "total_score": 101, "input": "3\n1 3\n6 25\n1 9\n", "actual_output": "3\n739\n9\n", "expected_output": "3\n737\n9\n\n", "anno_code": ["T = int(input()) # (0): T=3\nts = [tuple(map(int,input().split())) for i in range(T)] # (1): ts=[(1, 3), (6, 25), (1, 9)]\n\ndef solve(n,d): # (2): solve=\n if n%2: # (5): T=3, ts=[(1, 3), (6, 25), (1, 9)], solve= (8): T=3, ts=[(1, 3), (6, 25), (1, 9)], solve= (11): T=3, ts=[(1, 3), (6, 25), (1, 9)], solve=\n return d + 127*(n-1)\n else:\n return d^127 + 127*(n-1)\n\nfor n,d in ts: # (3): n=1, d=3 (6): n=6, d=25 (9): n=1, d=9\n print(solve(n,d)) # (4): NO CHANGE (7): NO CHANGE (10): NO CHANGE\n"], "anno_status": [true], "diff_content": " T = int(input())\n ts = [tuple(map(int,input().split())) for i in range(T)]\n \n def solve(n,d):\n if n%2:\n return d + 127*(n-1)\n else:\n- return d^127 + 127*(n-1)\n+ return 127*n - d\n \n for n,d in ts:\n print(solve(n,d))\n", "FL_content": "\n T = int(input())\n ts = [tuple(map(int,input().split())) for i in range(T)]\n \n def solve(n,d):\n if n%2:\n- return d + 127*(n-1)\n else:\n- return d^127 + 127*(n-1)\n \n for n,d in ts:\n print(solve(n,d))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u263753244", "problem_id": "p03617", "submission1_id": "s043524178-FL", "submission2_id": "s028435468", "status1": "Wrong Answer", "status2": "Accepted", "code1": "q,h,s,d=map(int,input().split())\nn=int(input())\nl=min(q*n*4,h*n*2,s*n,d*n/2)\nif l != d*n/2:\n print(l)\nelse:\n m=min(q*4,h*2,s)\n print((d*(n-1)/2)+m if n%2==1 else l)", "code2": "q,h,s,d=map(int,input().split())\nn=int(input())\nl=min(q*n*4,h*n*2,s*n,d*n\nif l != d*n\n print(l)\nelse:\n m=min(q*4,h*2,s)\n print(int((d*(n-1)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1586123985", "date2": "1586143064", "bleu_score": "0.806790311790577", "code1_test_status": [1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0], "code1_test_score": 70, "total_score": 104, "input": "11100 0010 111 -2\n-1\n", "actual_output": "-44400\n", "expected_output": "22\n\n", "anno_code": ["q,h,s,d=map(int,input().split()) # (0): q=11100, h=10, s=111, d=-2\nn=int(input()) # (1): n=-1\nl=min(q*n*4,h*n*2,s*n,d*n/2) # (2): l=-44400\nif l != d*n/2: # (3): NO CHANGE\n print(l)\nelse:\n m=min(q*4,h*2,s)\n print((d*(n-1)/2)+m if n%2==1 else l)"], "anno_status": [true], "diff_content": " q,h,s,d=map(int,input().split())\n n=int(input())\n-l=min(q*n*4,h*n*2,s*n,d*n/2)\n-if l != d*n/2:\n+l=min(q*n*4,h*n*2,s*n,d*n\n+if l != d*n\n print(l)\n else:\n m=min(q*4,h*2,s)\n- print((d*(n-1)/2)+m if n%2==1 else l)\n+ print(int((d*(n-1)\n", "FL_content": "\n q,h,s,d=map(int,input().split())\n n=int(input())\n-l=min(q*n*4,h*n*2,s*n,d*n/2)\n-if l != d*n/2:\n- print(l)\n-else:\n- m=min(q*4,h*2,s)\n- print((d*(n-1)/2)+m if n%2==1 else l)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u600261652", "problem_id": "p03377", "submission1_id": "s265319896-FL", "submission2_id": "s282923603", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, X= map(int, input().split())\nprint(\"YES\" if A+B>=X else \"NO\")", "code2": "A, B, X= map(int, input().split())\nprint(\"YES\" if A<=X and A+B>=X else \"NO\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588535160", "date2": "1588535280", "bleu_score": "0.8757109943391621", "code1_test_status": [1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0], "code1_test_score": 63, "total_score": 87, "input": "3 0 1\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["A, B, X= map(int, input().split()) # (0): A=3, B=0, X=1\nprint(\"YES\" if A+B>=X else \"NO\")"], "anno_status": [true], "diff_content": " A, B, X= map(int, input().split())\n-print(\"YES\" if A+B>=X else \"NO\")\n+print(\"YES\" if A<=X and A+B>=X else \"NO\")\n", "FL_content": "\n A, B, X= map(int, input().split())\n-print(\"YES\" if A+B>=X else \"NO\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 2 }, { "user_id": "u593590006", "problem_id": "p03353", "submission1_id": "s692799811-FL", "submission2_id": "s072312958", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nk=int(input())\nn=len(s)\nl=[]\nfor i in range(n):\n curr=''\n for j in range(i,n):\n curr+=s[j]\n l.append(curr)\nl.sort()\n\nprint(l[k-1])", "code2": "s=input()\nk=int(input())\nn=len(s)\nl=set()\nfor i in range(n):\n curr=''\n for j in range(i,min(i+7,n)):\n curr+=s[j]\n l.add(curr)\nl=[i for i in l]\nl.sort()\n\nprint(l[k-1])", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1572382071", "date2": "1572382629", "bleu_score": "0.8109290247511138", "code1_test_status": [0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0], "code1_test_score": 58, "total_score": 103, "input": "reedoctadmaredocta\n4\n", "actual_output": "ad\n", "expected_output": "adma\n\n", "anno_code": ["s=input() # (0): s=reedoctadmaredocta\nk=int(input()) # (1): k=4\nn=len(s) # (2): n=18\nl=[] # (3): l=[]\nfor i in range(n): # (4): i=0 (61): i=1 ... (571): NO CHANGE\n curr='' # (5): curr= (62): curr= ... (566): curr=\n for j in range(i,n): # (6): j=0 (9): j=1 ... (570): NO CHANGE\n curr+=s[j] # (7): curr=r (10): curr=re ... (568): curr=a\n l.append(curr) # (8): l=['r'] (11): l=['r', 're'] ... (569): l=[r, re, ..., ta, a]\nl.sort() # (572): l=[a, a, ..., tadmaredoct, tadmaredocta]\n\nprint(l[k-1])"], "anno_status": [true], "diff_content": " s=input()\n k=int(input())\n n=len(s)\n-l=[]\n+l=set()\n for i in range(n):\n curr=''\n- for j in range(i,n):\n+ for j in range(i,min(i+7,n)):\n curr+=s[j]\n- l.append(curr)\n+ l.add(curr)\n+l=[i for i in l]\n l.sort()\n \n print(l[k-1])\n", "FL_content": "\n s=input()\n k=int(input())\n n=len(s)\n l=[]\n for i in range(n):\n curr=''\n for j in range(i,n):\n curr+=s[j]\n- l.append(curr)\n l.sort()\n \n print(l[k-1])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u317710033", "problem_id": "p03502", "submission1_id": "s707070557-FL", "submission2_id": "s552824862", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = (input())\nnumber_2 = [int(s) for s in a]\ntotal = sum(number_2)\nprint(total)\nif int(a) % total == 0:\n print('Yes')\nelse:\n print('No')", "code2": "a = (input())\nnumber_2 = [int(s) for s in a]\ntotal = sum(number_2)\nif int(a) % total == 0:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567469159", "date2": "1567469219", "bleu_score": "0.8993728204180318", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 23, "input": "284\n", "actual_output": "14\nNo\n", "expected_output": "No\n\n", "anno_code": ["a = (input()) # (0): a=284\nnumber_2 = [int(s) for s in a] # (1): number_2=[2, 8, 4]\ntotal = sum(number_2) # (2): total=14\nprint(total) # (3): NO CHANGE\nif int(a) % total == 0: # (4): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " a = (input())\n number_2 = [int(s) for s in a]\n total = sum(number_2)\n-print(total)\n if int(a) % total == 0:\n print('Yes')\n else:\n print('No')\n", "FL_content": "\n a = (input())\n number_2 = [int(s) for s in a]\n total = sum(number_2)\n-print(total)\n if int(a) % total == 0:\n print('Yes')\n else:\n print('No')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u805716376", "problem_id": "p02413", "submission1_id": "s172290525-FL", "submission2_id": "s089662963", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\na = []\nb = []\nfor i in range(n):\n a += [list(map(int, input().split()))]\n print(a)\n a[i] += [sum(a[i])]\nfor i in range(m+1):\n b += [sum(x[i] for x in a)]\na += [b]\nfor i in range(n+1):\n print(*a[i])\n", "code2": "n, m = map(int, input().split())\na = []\nb = []\nfor i in range(n):\n a += [list(map(int, input().split()))]\n a[i] += [sum(a[i])]\nfor i in range(m+1):\n b += [sum(x[i] for x in a)]\na += [b]\nfor i in range(n+1):\n print(*a[i])\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556717723", "date2": "1556717764", "bleu_score": "0.9457339451341047", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 1, "total_score": 101, "input": "4 5\n4 1 3 1 13\n0 2 2 12 5\n3 6 1 1 1\n2 6 3 1 21\n", "actual_output": "[[4, 1, 3, 1, 13]]\n[[4, 1, 3, 1, 13, 22], [0, 2, 2, 12, 5]]\n[[4, 1, 3, 1, 13, 22], [0, 2, 2, 12, 5, 21], [3, 6, 1, 1, 1]]\n[[4, 1, 3, 1, 13, 22], [0, 2, 2, 12, 5, 21], [3, 6, 1, 1, 1, 12], [2, 6, 3, 1, 21]]\n4 1 3 1 13 22\n0 2 2 12 5 21\n3 6 1 1 1 12\n2 6 3 1 21 33\n9 15 9 15 40 88\n", "expected_output": "4 1 3 1 13 22\n0 2 2 12 5 21\n3 6 1 1 1 12\n2 6 3 1 21 33\n9 15 9 15 40 88\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=4, m=5\na = [] # (1): a=[]\nb = [] # (2): b=[]\nfor i in range(n): # (3): i=0 (7): i=1 ... (19): NO CHANGE\n a += [list(map(int, input().split()))] # (4): a (8): a ... (16): a\n print(a) # (5): NO CHANGE (9): a ... (17): a\n a[i] += [sum(a[i])] # (6): a (10): a ... (18): a\nfor i in range(m+1): # (20): i=0 (22): i=1 ... (32): NO CHANGE\n b += [sum(x[i] for x in a)] # (21): b=[9] (23): b=[9, 15] ... (31): b=[9, 15, 9, 15, 40, 88]\na += [b] # (33): a\nfor i in range(n+1): # (34): i=0 (36): i=1 ... (42): i=4\n print(*a[i]) # (35): NO CHANGE (37): NO CHANGE ... (43): NO CHANGE\n"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n a = []\n b = []\n for i in range(n):\n a += [list(map(int, input().split()))]\n- print(a)\n a[i] += [sum(a[i])]\n for i in range(m+1):\n b += [sum(x[i] for x in a)]\n a += [b]\n for i in range(n+1):\n print(*a[i])\n \n", "FL_content": "\n n, m = map(int, input().split())\n a = []\n b = []\n for i in range(n):\n a += [list(map(int, input().split()))]\n- print(a)\n a[i] += [sum(a[i])]\n for i in range(m+1):\n b += [sum(x[i] for x in a)]\n a += [b]\n for i in range(n+1):\n print(*a[i])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u563676207", "problem_id": "p02697", "submission1_id": "s580408397-FL", "submission2_id": "s164410515", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nN, M = map(int, input().split())\n\n\nans = []\nt = 1\nfor i in range(M):\n ans.append((t, N-t))\n t += 1\n\n\n[print(a, b) for a, b in ans]\n", "code2": "\nN, M = map(int, input().split())\n\n\nans = []\n\nt = 1\nfor _ in range(M\n ans.append((t, M-t+1))\n t += 1\n\nt = M+1\nfor _ in range(-(-M\n ans.append((t, M*3+2-t))\n t += 1\n\n\n[print(a, b) for a, b in ans]\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1588472924", "date2": "1588550636", "bleu_score": "0.6191725228284507", "code1_test_status": [0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 6, "input": "20 9\n", "actual_output": "1 19\n2 18\n3 17\n4 16\n5 15\n6 14\n7 13\n8 12\n9 11\n", "expected_output": "1 10\n2 9\n3 8\n4 7\n5 6\n11 19\n12 18\n13 17\n14 16\n\n", "anno_code": ["\nN, M = map(int, input().split()) # (0): N=20, M=9\n\n\nans = [] # (1): ans=[]\nt = 1 # (2): t=1\nfor i in range(M): # (3): i=0 (6): i=1 ... (30): NO CHANGE\n ans.append((t, N-t)) # (4): ans=[(1, 19)] (7): ans=[(1, 19), (2, 18)] ... (28): ans=[(1, 19), (2, 18), (3, 17), (4, 16), (5, 15), (6, 14), (7, 13), (8, 12), (9, 11)]\n t += 1 # (5): t=2 (8): t=3 ... (29): t=10\n\n\n[print(a, b) for a, b in ans]\n"], "anno_status": [true], "diff_content": " \n N, M = map(int, input().split())\n \n \n ans = []\n+\n t = 1\n-for i in range(M):\n- ans.append((t, N-t))\n+for _ in range(M\n+ ans.append((t, M-t+1))\n+ t += 1\n+\n+t = M+1\n+for _ in range(-(-M\n+ ans.append((t, M*3+2-t))\n t += 1\n \n \n [print(a, b) for a, b in ans]\n \n", "FL_content": "\n \n N, M = map(int, input().split())\n \n \n ans = []\n t = 1\n for i in range(M):\n- ans.append((t, N-t))\n t += 1\n \n \n [print(a, b) for a, b in ans]\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u350064373", "problem_id": "p02401", "submission1_id": "s365115423-FL", "submission2_id": "s646817287", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n a, op, b = map(str, input().split())\n if op == \"+\":\n print(int(a) + int(b))\n elif op == \"-\":\n print(int(a) - int(b))\n elif op == \"*\":\n print(int(a) * int(b))\n elif op == \"/\":\n print(int(a) / int(b))\n else:\n break", "code2": "while True:\n a, op, b = map(str, input(\"\").split())\n a = int(a)\n b = int(b)\n if op == \"+\":\n print(a + b)\n elif op == \"-\":\n print(a - b)\n elif op == \"*\":\n print(a * b)\n elif op == \"/\":\n print(a \n elif op == \"?\":\n break", "original_language1": "Python3", "original_language2": "Python3", "date1": "1500472379", "date2": "1500473114", "bleu_score": "0.8138148717498641", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "1 , 2\n56 - 18\n2 * 2\n100 / 7\n1 , 81\n-1 ? 0\n", "actual_output": "", "expected_output": "(1, 2)\n38\n4\n14\n(1, 81)\n\n", "anno_code": ["while True: # (0): NO CHANGE\n a, op, b = map(str, input().split()) # (1): a=1, op=,, b=2\n if op == \"+\": # (2): NO CHANGE\n print(int(a) + int(b))\n elif op == \"-\": # (3): NO CHANGE\n print(int(a) - int(b))\n elif op == \"*\": # (4): NO CHANGE\n print(int(a) * int(b))\n elif op == \"/\": # (5): NO CHANGE\n print(int(a) / int(b))\n else:\n break"], "anno_status": [true], "diff_content": " while True:\n- a, op, b = map(str, input().split())\n+ a, op, b = map(str, input(\"\").split())\n+ a = int(a)\n+ b = int(b)\n if op == \"+\":\n- print(int(a) + int(b))\n+ print(a + b)\n elif op == \"-\":\n- print(int(a) - int(b))\n+ print(a - b)\n elif op == \"*\":\n- print(int(a) * int(b))\n+ print(a * b)\n elif op == \"/\":\n- print(int(a) / int(b))\n- else:\n+ print(a \n+ elif op == \"?\":\n break\n", "FL_content": "\n while True:\n a, op, b = map(str, input().split())\n if op == \"+\":\n print(int(a) + int(b))\n elif op == \"-\":\n print(int(a) - int(b))\n elif op == \"*\":\n print(int(a) * int(b))\n elif op == \"/\":\n- print(int(a) / int(b))\n else:\n break\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u991567869", "problem_id": "p03957", "submission1_id": "s312976838-FL", "submission2_id": "s311844016", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\na = s.find(\"C\")\nb = s.rfind(\"F\")\n\nif 0 < a < b:\n print(\"Yes\")\nelse:\n print(\"No\")", "code2": "s = input()\na = s.find(\"C\")\nb = s.rfind(\"F\")\n\nif -1 < a < b:\n print(\"Yes\")\nelse:\n print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1595012832", "date2": "1595012893", "bleu_score": "0.9638930762749008", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 100, "total_score": 103, "input": "CODDFESTIVAL\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["s = input() # (0): s=CODDFESTIVAL\na = s.find(\"C\") # (1): a=0\nb = s.rfind(\"F\") # (2): b=4\n\nif 0 < a < b: # (3): NO CHANGE\n print(\"Yes\")\nelse:\n print(\"No\")"], "anno_status": [true], "diff_content": " s = input()\n a = s.find(\"C\")\n b = s.rfind(\"F\")\n \n-if 0 < a < b:\n+if -1 < a < b:\n print(\"Yes\")\n else:\n print(\"No\")\n", "FL_content": "\n s = input()\n a = s.find(\"C\")\n b = s.rfind(\"F\")\n \n-if 0 < a < b:\n print(\"Yes\")\n else:\n print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u350093546", "problem_id": "p03730", "submission1_id": "s656550317-FL", "submission2_id": "s062945141", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=map(int,input().split())\nx=0\nfor i in range(b):\n x+=a\n if a%b==c:\n print('YES')\n x='-1'\n break\nif x!='-1':\n print('NO')", "code2": "a,b,c=map(int,input().split())\nx=0\nfor i in range(b):\n x+=a\n if x%b==c:\n print('YES')\n x='-1'\n break\nif x!='-1':\n print('NO')", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1591611761", "date2": "1591612007", "bleu_score": "0.931506892120709", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 3, "total_score": 92, "input": "117 55 1\n", "actual_output": "no output\n", "expected_output": "YES\n\n", "anno_code": ["a,b,c=map(int,input().split()) # (0): a=117, b=55, c=1\nx=0 # (1): x=0\nfor i in range(b): # (2): i=0\n x+=a # (3): x=117\n if a%b==c: # (4): NO CHANGE\n print('YES')\n x='-1' # (5): x=-1\n break # (6): NO CHANGE\nif x!='-1':\n print('NO')"], "anno_status": [true], "diff_content": " a,b,c=map(int,input().split())\n x=0\n for i in range(b):\n x+=a\n- if a%b==c:\n+ if x%b==c:\n print('YES')\n- x='-1'\n- break\n+ x='-1'\n+ break\n if x!='-1':\n print('NO')\n", "FL_content": "\n a,b,c=map(int,input().split())\n x=0\n-for i in range(b):\n x+=a\n- if a%b==c:\n print('YES')\n- x='-1'\n- break\n-if x!='-1':\n- print('NO')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u300946041", "problem_id": "p02276", "submission1_id": "s013477116-FL", "submission2_id": "s667747960", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\ndef partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n A[i + 1], A[r] = A[r], A[i]\n return i + 1\n\n\ndef main():\n n = int(input())\n A = [int(e) for e in input().split()]\n p = 0\n idx = partition(A, p, n - 1)\n A = [str(e) for e in A]\n A[idx] = \"[{}]\".format(A[idx])\n return \" \".join(A)\n\n\nprint(main())", "code2": "\n\n\ndef partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n\n\ndef main():\n n = int(input())\n A = [int(e) for e in input().split()]\n p = 0\n idx = partition(A, p, n - 1)\n A = [str(e) for e in A]\n A[idx] = \"[{}]\".format(A[idx])\n return \" \".join(A)\n\n\nprint(main())", "original_language1": "Python3", "original_language2": "Python3", "date1": "1490582621", "date2": "1490582742", "bleu_score": "0.9871840284436523", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "12\n40 19 6 1 12 8 0 2 21 2 4 22\n", "actual_output": "19 6 1 12 8 0 2 21 2 4 [22] 4\n", "expected_output": "19 6 1 12 8 0 2 21 2 4 [22] 40\n\n", "anno_code": ["\n\n\ndef partition(A, p, r): # (0): partition=\n x = A[r] # (7): x=22\n i = p - 1 # (8): i=-1\n for j in range(p, r): # (9): j=0 (11): j=1 ... (51): NO CHANGE\n if A[j] <= x: # (10): NO CHANGE (12): NO CHANGE ... (48): NO CHANGE\n i += 1 # (13): i=0 (17): i=1 ... (49): i=9\n A[i], A[j] = A[j], A[i] # (14): A=[19, 40, 6, 1, 12, 8, 0, 2, 21, 2, 4, 22] (18): A=[19, 6, 40, 1, 12, 8, 0, 2, 21, 2, 4, 22] ... (50): A=[19, 6, 1, 12, 8, 0, 2, 21, 2, 4, 40, 22]\n A[i + 1], A[r] = A[r], A[i] # (52): n=12, A=[19, 6, 1, 12, 8, 0, 2, 21, 2, 4, 22, 4], idx=10\n return i + 1\n\n\ndef main(): # (1): main=\n n = int(input()) # (3): n=12\n A = [int(e) for e in input().split()] # (4): A=[40, 19, 6, 1, 12, 8, 0, 2, 21, 2, 4, 22]\n p = 0 # (5): p=0\n idx = partition(A, p, n - 1) # (6): r=11\n A = [str(e) for e in A] # (53): A=['19', '6', '1', '12', '8', '0', '2', '21', '2', '4', '22', '4']\n A[idx] = \"[{}]\".format(A[idx])\n return \" \".join(A)\n\n\nprint(main()) # (2): NO CHANGE\n"], "anno_status": [true], "diff_content": " \n \n \n def partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n- A[i + 1], A[r] = A[r], A[i]\n+ A[i + 1], A[r] = A[r], A[i + 1]\n return i + 1\n \n \n def main():\n n = int(input())\n A = [int(e) for e in input().split()]\n p = 0\n idx = partition(A, p, n - 1)\n A = [str(e) for e in A]\n A[idx] = \"[{}]\".format(A[idx])\n return \" \".join(A)\n \n \n print(main())\n", "FL_content": "\n \n \n \n def partition(A, p, r):\n x = A[r]\n i = p - 1\n for j in range(p, r):\n if A[j] <= x:\n i += 1\n A[i], A[j] = A[j], A[i]\n A[i + 1], A[r] = A[r], A[i]\n return i + 1\n \n \n def main():\n n = int(input())\n A = [int(e) for e in input().split()]\n p = 0\n- idx = partition(A, p, n - 1)\n A = [str(e) for e in A]\n A[idx] = \"[{}]\".format(A[idx])\n return \" \".join(A)\n \n \n print(main())\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 25 }, { "user_id": "u802963389", "problem_id": "p04039", "submission1_id": "s351972976-FL", "submission2_id": "s729193441", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int, input().split())\na = list(input().split())\nfor i in range(n+1, 10**6):\n if all([j not in a for j in str(i)]):\n \n print(i)\n exit()", "code2": "n, k = map(int, input().split())\na = list(input().split())\nfor i in range(n, 10**6):\n if all([j not in a for j in str(i)]):\n \n print(i)\n exit()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568089918", "date2": "1568089993", "bleu_score": "0.9767025983530488", "code1_test_status": [0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0], "code1_test_score": 20, "total_score": 94, "input": "18 1\n0\n", "actual_output": "19\n", "expected_output": "18\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " n, k = map(int, input().split())\n a = list(input().split())\n-for i in range(n+1, 10**6):\n+for i in range(n, 10**6):\n if all([j not in a for j in str(i)]):\n \n print(i)\n exit()\n", "FL_content": "\n n, k = map(int, input().split())\n-a = list(input().split())\n for i in range(n+1, 10**6):\n- if all([j not in a for j in str(i)]):\n- \n print(i)\n- exit()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u388297793", "problem_id": "p03556", "submission1_id": "s774527930-FL", "submission2_id": "s338440270", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nprint(int(n**(1/2)**2))\n", "code2": "n=int(input())\nprint(int(n**(1/2))**2)\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596402180", "date2": "1596402253", "bleu_score": "0.9575874584289952", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 83, "input": "89041\n", "actual_output": "17\n", "expected_output": "88804\n\n", "anno_code": ["n=int(input()) # (0): n=89041\nprint(int(n**(1/2)**2))\n"], "anno_status": [true], "diff_content": " n=int(input())\n-print(int(n**(1/2)**2))\n+print(int(n**(1/2))**2)\n \n", "FL_content": "\n n=int(input())\n-print(int(n**(1/2)**2))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 3 }, { "user_id": "u364439209", "problem_id": "p03419", "submission1_id": "s691477707-FL", "submission2_id": "s362603299", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split(\" \"))\n\nif M > N:\n tmp = N\n M = N\n N = tmp\n\nif N == 1 and M == 1: print(1)\nelif M == 1: print(N-2)\nelse: print((N-2)*(M-2))", "code2": "N, M = map(int, input().split(\" \"))\n\nif M > N:\n tmp = M\n M = N\n N = tmp\n\nif N == 1 and M == 1: print(1)\nelif M == 1: print(N-2)\nelse: print((N-2)*(M-2))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1521326015", "date2": "1521326203", "bleu_score": "0.9842503541065485", "code1_test_status": [0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 52, "total_score": 78, "input": "128 131\n", "actual_output": "15876\n", "expected_output": "16254\n\n", "anno_code": ["N, M = map(int, input().split(\" \")) # (0): N=128, M=131\n\nif M > N: # (1): NO CHANGE\n tmp = N # (2): tmp=128\n M = N # (3): M=128\n N = tmp # (4): NO CHANGE\n\nif N == 1 and M == 1: print(1) # (5): NO CHANGE\nelif M == 1: print(N-2) # (6): NO CHANGE\nelse: print((N-2)*(M-2))"], "anno_status": [true], "diff_content": " N, M = map(int, input().split(\" \"))\n \n if M > N:\n- tmp = N\n+ tmp = M\n M = N\n N = tmp\n \n if N == 1 and M == 1: print(1)\n elif M == 1: print(N-2)\n else: print((N-2)*(M-2))\n", "FL_content": "\n N, M = map(int, input().split(\" \"))\n \n if M > N:\n tmp = N\n M = N\n N = tmp\n \n if N == 1 and M == 1: print(1)\n elif M == 1: print(N-2)\n-else: print((N-2)*(M-2))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u261103969", "problem_id": "p02559", "submission1_id": "s372905323-FL", "submission2_id": "s724262106", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\n\nreadline = sys.stdin.readline\nMOD = 10 ** 9 + 7\nINF = float('INF')\nsys.setrecursionlimit(10 ** 5)\n\n\nclass BinaryIndexTree:\n def __init__(self, n):\n self.size = n\n self._container = [0] * (n + 1)\n self.depth = n.bit_length()\n\n def sum(self, i):\n if i == 0:\n return 0\n s = 0\n while i > 0:\n s += self._container[i]\n i -= i & (-i)\n return s\n\n def add(self, i, x):\n if i == 0:\n return\n while i <= self.size:\n self._container[i] += x\n i += i & (-i)\n\n def lower_bound(self, x):\n if x == 0:\n return 0\n\n s = 0\n idx = 0\n for i in range(self.depth, -1, -1):\n k = idx + (1 << i)\n if k <= self.size and s + self._container[k] < x:\n s += self._container[k]\n idx += 1 << i\n return idx + 1\n\n def __repr__(self):\n return str(self._container)\n\n\ndef main():\n N, Q = map(int, readline().split())\n a = list(map(int, readline().split()))\n bit = BinaryIndexTree(N + 1)\n\n for i, x in enumerate(a, 1):\n bit.add(i, x)\n\n for _ in range(Q):\n a, b, c = map(int, readline().split())\n if a == 0:\n bit.add(b, c)\n else:\n b += 1\n c += 1\n print(bit.sum(c - 1) - bit.sum(b - 1))\n\n\nif __name__ == '__main__':\n main()\n", "code2": "import sys\n\nreadline = sys.stdin.readline\nMOD = 10 ** 9 + 7\nINF = float('INF')\nsys.setrecursionlimit(10 ** 5)\n\n\nclass BinaryIndexTree:\n def __init__(self, n):\n self.size = n\n self._container = [0] * (n + 1)\n self.depth = n.bit_length()\n\n def sum(self, i):\n if i == 0:\n return 0\n s = 0\n while i > 0:\n s += self._container[i]\n i -= i & (-i)\n return s\n\n def add(self, i, x):\n if i == 0:\n return\n while i <= self.size:\n self._container[i] += x\n i += i & (-i)\n\n def lower_bound(self, x):\n if x == 0:\n return 0\n\n s = 0\n idx = 0\n for i in range(self.depth, -1, -1):\n k = idx + (1 << i)\n if k <= self.size and s + self._container[k] < x:\n s += self._container[k]\n idx += 1 << i\n return idx + 1\n\n def __repr__(self):\n return str(self._container)\n\n\ndef main():\n N, Q = map(int, readline().split())\n a = list(map(int, readline().split()))\n bit = BinaryIndexTree(N + 1)\n\n for i, x in enumerate(a, 1):\n bit.add(i, x)\n\n for _ in range(Q):\n a, b, c = map(int, readline().split())\n if a == 0:\n b += 1\n bit.add(b, c)\n else:\n b += 1\n c += 1\n print(bit.sum(c - 1) - bit.sum(b - 1))\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1599574596", "date2": "1599604665", "bleu_score": "0.9868829745290159", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 23, "total_score": 101, "input": "5 5\n1 0 5 4 5\n1 1 2\n1 2 4\n0 3 10\n1 0 5\n1 0 3\n", "actual_output": "0\n9\n25\n16\n", "expected_output": "0\n9\n25\n6\n\n", "anno_code": ["import sys\n\nreadline = sys.stdin.readline # (0): readline=\nMOD = 10 ** 9 + 7 # (1): MOD=1000000007\nINF = float('INF') # (2): INF=inf\nsys.setrecursionlimit(10 ** 5) # (3): NO CHANGE\n\n\nclass BinaryIndexTree: # (4): BinaryIndexTree=\n def __init__(self, n):\n self.size = n\n self._container = [0] * (n + 1)\n self.depth = n.bit_length()\n\n def sum(self, i):\n if i == 0:\n return 0\n s = 0\n while i > 0:\n s += self._container[i]\n i -= i & (-i)\n return s\n\n def add(self, i, x):\n if i == 0:\n return\n while i <= self.size:\n self._container[i] += x\n i += i & (-i)\n\n def lower_bound(self, x):\n if x == 0:\n return 0\n\n s = 0\n idx = 0\n for i in range(self.depth, -1, -1):\n k = idx + (1 << i)\n if k <= self.size and s + self._container[k] < x:\n s += self._container[k]\n idx += 1 << i\n return idx + 1\n\n def __repr__(self):\n return str(self._container)\n\n\ndef main(): # (5): main=\n N, Q = map(int, readline().split())\n a = list(map(int, readline().split()))\n bit = BinaryIndexTree(N + 1)\n\n for i, x in enumerate(a, 1):\n bit.add(i, x)\n\n for _ in range(Q):\n a, b, c = map(int, readline().split())\n if a == 0:\n bit.add(b, c)\n else:\n b += 1\n c += 1\n print(bit.sum(c - 1) - bit.sum(b - 1))\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [false], "diff_content": " import sys\n \n readline = sys.stdin.readline\n MOD = 10 ** 9 + 7\n INF = float('INF')\n sys.setrecursionlimit(10 ** 5)\n \n \n class BinaryIndexTree:\n def __init__(self, n):\n self.size = n\n self._container = [0] * (n + 1)\n self.depth = n.bit_length()\n \n def sum(self, i):\n if i == 0:\n return 0\n s = 0\n while i > 0:\n s += self._container[i]\n i -= i & (-i)\n return s\n \n def add(self, i, x):\n if i == 0:\n return\n while i <= self.size:\n self._container[i] += x\n i += i & (-i)\n \n def lower_bound(self, x):\n if x == 0:\n return 0\n \n s = 0\n idx = 0\n for i in range(self.depth, -1, -1):\n k = idx + (1 << i)\n if k <= self.size and s + self._container[k] < x:\n s += self._container[k]\n idx += 1 << i\n return idx + 1\n \n def __repr__(self):\n return str(self._container)\n \n \n def main():\n N, Q = map(int, readline().split())\n a = list(map(int, readline().split()))\n bit = BinaryIndexTree(N + 1)\n \n for i, x in enumerate(a, 1):\n bit.add(i, x)\n \n for _ in range(Q):\n a, b, c = map(int, readline().split())\n if a == 0:\n+ b += 1\n bit.add(b, c)\n else:\n b += 1\n c += 1\n print(bit.sum(c - 1) - bit.sum(b - 1))\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": "\n import sys\n \n readline = sys.stdin.readline\n MOD = 10 ** 9 + 7\n INF = float('INF')\n sys.setrecursionlimit(10 ** 5)\n \n \n class BinaryIndexTree:\n def __init__(self, n):\n self.size = n\n self._container = [0] * (n + 1)\n self.depth = n.bit_length()\n \n def sum(self, i):\n if i == 0:\n return 0\n s = 0\n while i > 0:\n s += self._container[i]\n i -= i & (-i)\n return s\n \n def add(self, i, x):\n if i == 0:\n return\n while i <= self.size:\n self._container[i] += x\n i += i & (-i)\n \n def lower_bound(self, x):\n if x == 0:\n return 0\n \n s = 0\n idx = 0\n for i in range(self.depth, -1, -1):\n k = idx + (1 << i)\n if k <= self.size and s + self._container[k] < x:\n s += self._container[k]\n idx += 1 << i\n return idx + 1\n \n def __repr__(self):\n return str(self._container)\n \n \n def main():\n N, Q = map(int, readline().split())\n a = list(map(int, readline().split()))\n bit = BinaryIndexTree(N + 1)\n \n for i, x in enumerate(a, 1):\n bit.add(i, x)\n \n for _ in range(Q):\n a, b, c = map(int, readline().split())\n if a == 0:\n bit.add(b, c)\n else:\n- b += 1\n- c += 1\n print(bit.sum(c - 1) - bit.sum(b - 1))\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 68 }, { "user_id": "u757827098", "problem_id": "p02401", "submission1_id": "s034053733-FL", "submission2_id": "s016587724", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n a,op,b = input().split()\n a =int(a)\n b =int(b)\n \n if op == '?':\n break\n \n if op == '+':\n print(a+b)\n\n if op == '-':\n print(a-b)\n\n if op == '*':\n print(a*b)\n \n if op == '/':\n print(a/b)", "code2": "while True:\n a,op,b = input().split()\n a =int(a)\n b =int(b)\n \n if op == '?':\n break\n \n if op == '+':\n print(a+b)\n\n if op == '-':\n print(a-b)\n\n if op == '*':\n print(a*b)\n \n if op == '/':\n print(a", "original_language1": "Python3", "original_language2": "Python3", "date1": "1469601167", "date2": "1469601228", "bleu_score": "0.9885278512147743", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "2 + 2\n25 , 18\n10 * 1\n000 / 22\n28 - 6\n0 ? 0\n", "actual_output": "4\n10\n0.0\n22\n", "expected_output": "4\n(25, 18)\n10\n0\n22\n\n", "anno_code": ["while True: # (0): NO CHANGE (10): NO CHANGE ... (49): NO CHANGE\n a,op,b = input().split() # (1): a=2, op=+, b=2 (11): a=25, op=,, b=18 ... (50): a=0, op=?, b=0\n a =int(a) # (2): a=2 (12): a=25 ... (51): a=0\n b =int(b) # (3): b=2 (13): b=18 ... (52): b=0\n \n if op == '?': # (4): NO CHANGE (14): NO CHANGE ... (53): NO CHANGE\n break\n \n if op == '+': # (5): NO CHANGE (15): NO CHANGE ... (44): NO CHANGE\n print(a+b) # (6): NO CHANGE\n\n if op == '-': # (7): NO CHANGE (16): NO CHANGE ... (45): NO CHANGE\n print(a-b) # (46): NO CHANGE\n\n if op == '*': # (8): NO CHANGE (17): NO CHANGE ... (47): NO CHANGE\n print(a*b) # (27): NO CHANGE\n \n if op == '/': # (9): NO CHANGE (18): NO CHANGE ... (48): NO CHANGE\n print(a/b) # (38): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n a,op,b = input().split()\n a =int(a)\n b =int(b)\n \n if op == '?':\n break\n \n if op == '+':\n print(a+b)\n \n if op == '-':\n print(a-b)\n \n if op == '*':\n print(a*b)\n \n if op == '/':\n- print(a/b)\n+ print(a\n", "FL_content": "\n while True:\n a,op,b = input().split()\n a =int(a)\n b =int(b)\n \n if op == '?':\n break\n \n if op == '+':\n print(a+b)\n \n if op == '-':\n print(a-b)\n \n if op == '*':\n print(a*b)\n \n if op == '/':\n- print(a/b)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u874935184", "problem_id": "p03363", "submission1_id": "s013518033-FL", "submission2_id": "s335333994", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = map(int, input().split())\nd = set()\ns = 0\nc = 0\nfor i in a:\n s += i\n if s == 0:\n c+=1\n elif s in d:\n c+=1\n d.add(s)\nprint(c)", "code2": "n = int(input())\na = map(int, input().split())\nd = {}\ns = 0\nc = 0\nfor i in a:\n s += i\n if s == 0:\n c+=1\n if s in d:\n c+=d[s]\n d[s]+=1\n else:\n d[s]=1\n\nprint(c)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1528196143", "date2": "1528196328", "bleu_score": "0.784276203017542", "code1_test_status": [0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1], "code1_test_score": 40, "total_score": 103, "input": "6\n0 0 -4 3 0 -2\n", "actual_output": "3\n", "expected_output": "4\n\n", "anno_code": ["n = int(input()) # (0): n=6\na = map(int, input().split()) # (1): a=\nd = set() # (2): d=set()\ns = 0 # (3): s=0\nc = 0 # (4): c=0\nfor i in a: # (5): i=0 (10): NO CHANGE ... (36): NO CHANGE\n s += i # (6): NO CHANGE (11): NO CHANGE ... (32): s=-3\n if s == 0: # (7): NO CHANGE (12): NO CHANGE ... (33): NO CHANGE\n c+=1 # (8): c=1 (13): c=2\n elif s in d: # (18): NO CHANGE (23): NO CHANGE ... (34): NO CHANGE\n c+=1 # (29): c=3\n d.add(s) # (9): d={0} (14): NO CHANGE ... (35): d={0, -4, -3, -1}\nprint(c)"], "anno_status": [true], "diff_content": " n = int(input())\n a = map(int, input().split())\n-d = set()\n+d = {}\n s = 0\n c = 0\n for i in a:\n s += i\n if s == 0:\n c+=1\n- elif s in d:\n- c+=1\n- d.add(s)\n+ if s in d:\n+ c+=d[s]\n+ d[s]+=1\n+ else:\n+ d[s]=1\n+\n print(c)\n", "FL_content": "\n n = int(input())\n a = map(int, input().split())\n-d = set()\n s = 0\n c = 0\n for i in a:\n s += i\n if s == 0:\n c+=1\n elif s in d:\n c+=1\n d.add(s)\n print(c)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u733738237", "problem_id": "p02837", "submission1_id": "s587380817-FL", "submission2_id": "s568234290", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\ntestimony_list=[[[0,0] for _ in range(n-1)] for i in range(n)]\nfor i in range(n):\n\ta=int(input())\n\tfor j in range(a):\n\t\tx,y=map(int,input().split())\n\t\ttestimony_list[i][j][0]=x-1\n\t\ttestimony_list[i][j][1]=y\nprint(testimony_list)\n\nans=0\nfor i in range(2**n):\n\tkind_l=[0 for _ in range(n)]\n\tfor j in range(n):\n\t\tif ((i>>j) & 1):\n\t\t\tkind_l[j]=1\n\tprint(kind_l)\n\tfor k in range(n):\n\t\tif kind_l[k]==1:\n\t\t\tfor m in range(a):\n\t\t\t\tsubject=testimony_list[k][m][0]\n\t\t\t\tjudge=testimony_list[k][m][1]\n\t\t\t\tif kind_l[subject]!=judge:\n\t\t\t\t\tkind_l=[0 for _ in range(n)]\n\t\t\t\t\tbreak\n\tans=max(ans,sum(kind_l))\nprint(ans)", "code2": "n=int(input())\ntestimony_list=[[[-1,0] for _ in range(n-1)] for i in range(n)]\nfor i in range(n):\n\ta=int(input())\n\tfor j in range(a):\n\t\tx,y=map(int,input().split())\n\t\ttestimony_list[i][j][0]=x-1\n\t\ttestimony_list[i][j][1]=y\n\nans=0\nfor i in range(2**n):\n\tkind_l=[0 for _ in range(n)]\n\tfor j in range(n):\n\t\tif ((i>>j) & 1):\n\t\t\tkind_l[j]=1\n\tflag=True\n\tfor k in range(n):\n\t\tif kind_l[k]:\n\t\t\tfor m in range(n-1):\n\t\t\t\tsubject=testimony_list[k][m][0]\n\t\t\t\tjudge=testimony_list[k][m][1]\n\t\t\t\tif subject==-1:continue\n\t\t\t\tif kind_l[subject]!=judge:\n\t\t\t\t\tflag=False\n\tif flag:\n\t\tans=max(ans,sum(kind_l))\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577327735", "date2": "1577330504", "bleu_score": "0.8792853132352446", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "3\n2\n2 1\n3 1\n2\n3 1\n1 0\n2\n1 0\n1 0\n", "actual_output": "[[[1, 1], [2, 1]], [[2, 1], [0, 0]], [[0, 0], [0, 0]]]\n[0, 0, 0]\n[1, 0, 0]\n[0, 1, 0]\n[1, 1, 0]\n[0, 0, 1]\n[1, 0, 1]\n[0, 1, 1]\n[1, 1, 1]\n2\n", "expected_output": "2\n\n", "anno_code": ["n=int(input()) # (0): n=3\ntestimony_list=[[[0,0] for _ in range(n-1)] for i in range(n)] # (1): testimony_list\nfor i in range(n): # (2): i=0 (13): i=1 ... (35): NO CHANGE\n\ta=int(input()) # (3): a=2 (14): NO CHANGE (25): NO CHANGE\n\tfor j in range(a): # (4): j=0 (8): j=1 ... (34): NO CHANGE\n\t\tx,y=map(int,input().split()) # (5): x=2, y=1 (9): x=3 ... (31): NO CHANGE\n\t\ttestimony_list[i][j][0]=x-1 # (6): testimony_list (10): testimony_list ... (32): NO CHANGE\n\t\ttestimony_list[i][j][1]=y # (7): testimony_list (11): testimony_list ... (33): NO CHANGE\nprint(testimony_list) # (36): NO CHANGE\n\nans=0 # (37): ans=0\nfor i in range(2**n): # (38): i=0 (56): i=1 ... (268): NO CHANGE\n\tkind_l=[0 for _ in range(n)] # (39): kind_l=[0, 0, 0] (57): NO CHANGE ... (229): kind_l=[0, 0, 0]\n\tfor j in range(n): # (40): j=0 (42): j=1 ... (239): NO CHANGE\n\t\tif ((i>>j) & 1): # (41): NO CHANGE (43): NO CHANGE ... (237): NO CHANGE\n\t\t\tkind_l[j]=1 # (60): kind_l=[1, 0, 0] (87): kind_l=[0, 1, 0] ... (238): kind_l=[1, 1, 1]\n\tprint(kind_l) # (47): NO CHANGE (66): NO CHANGE ... (240): NO CHANGE\n\tfor k in range(n): # (48): k=0 (50): k=1 ... (266): NO CHANGE\n\t\tif kind_l[k]==1: # (49): NO CHANGE (51): NO CHANGE ... (265): NO CHANGE\n\t\t\tfor m in range(a): # (69): m=0 (96): NO CHANGE ... (258): m=1\n\t\t\t\tsubject=testimony_list[k][m][0] # (70): subject=1 (97): subject=2 ... (259): subject=0\n\t\t\t\tjudge=testimony_list[k][m][1] # (71): judge=1 (98): NO CHANGE ... (260): judge=0\n\t\t\t\tif kind_l[subject]!=judge: # (72): NO CHANGE (99): NO CHANGE ... (261): NO CHANGE\n\t\t\t\t\tkind_l=[0 for _ in range(n)] # (73): kind_l=[0, 0, 0] (100): kind_l=[0, 0, 0] ... (262): kind_l=[0, 0, 0]\n\t\t\t\t\tbreak # (74): NO CHANGE (101): NO CHANGE ... (263): NO CHANGE\n\tans=max(ans,sum(kind_l)) # (55): NO CHANGE (80): NO CHANGE ... (267): NO CHANGE\nprint(ans)"], "anno_status": [false], "diff_content": " n=int(input())\n-testimony_list=[[[0,0] for _ in range(n-1)] for i in range(n)]\n+testimony_list=[[[-1,0] for _ in range(n-1)] for i in range(n)]\n for i in range(n):\n \ta=int(input())\n \tfor j in range(a):\n \t\tx,y=map(int,input().split())\n \t\ttestimony_list[i][j][0]=x-1\n \t\ttestimony_list[i][j][1]=y\n-print(testimony_list)\n \n ans=0\n for i in range(2**n):\n \tkind_l=[0 for _ in range(n)]\n \tfor j in range(n):\n \t\tif ((i>>j) & 1):\n \t\t\tkind_l[j]=1\n-\tprint(kind_l)\n+\tflag=True\n \tfor k in range(n):\n-\t\tif kind_l[k]==1:\n-\t\t\tfor m in range(a):\n+\t\tif kind_l[k]:\n+\t\t\tfor m in range(n-1):\n \t\t\t\tsubject=testimony_list[k][m][0]\n \t\t\t\tjudge=testimony_list[k][m][1]\n+\t\t\t\tif subject==-1:continue\n \t\t\t\tif kind_l[subject]!=judge:\n-\t\t\t\t\tkind_l=[0 for _ in range(n)]\n-\t\t\t\t\tbreak\n-\tans=max(ans,sum(kind_l))\n+\t\t\t\t\tflag=False\n+\tif flag:\n+\t\tans=max(ans,sum(kind_l))\n print(ans)\n", "FL_content": "\n n=int(input())\n testimony_list=[[[0,0] for _ in range(n-1)] for i in range(n)]\n for i in range(n):\n \ta=int(input())\n \tfor j in range(a):\n \t\tx,y=map(int,input().split())\n \t\ttestimony_list[i][j][0]=x-1\n \t\ttestimony_list[i][j][1]=y\n-print(testimony_list)\n \n ans=0\n for i in range(2**n):\n \tkind_l=[0 for _ in range(n)]\n \tfor j in range(n):\n \t\tif ((i>>j) & 1):\n \t\t\tkind_l[j]=1\n-\tprint(kind_l)\n \tfor k in range(n):\n \t\tif kind_l[k]==1:\n \t\t\tfor m in range(a):\n \t\t\t\tsubject=testimony_list[k][m][0]\n \t\t\t\tjudge=testimony_list[k][m][1]\n \t\t\t\tif kind_l[subject]!=judge:\n \t\t\t\t\tkind_l=[0 for _ in range(n)]\n \t\t\t\t\tbreak\n \tans=max(ans,sum(kind_l))\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u642529859", "problem_id": "p02595", "submission1_id": "s528770544-FL", "submission2_id": "s182220122", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, D = map(int, input().split())\nans = 0\nfor i in range(N):\n X, Y = map(int, input().split())\n if X*X+Y*Y<=D:\n ans += 1\nprint(ans)", "code2": "N, D = map(int, input().split())\nans = 0\nfor i in range(N):\n X, Y = map(int, input().split())\n if X*X+Y*Y<=D*D:\n ans += 1\nprint(ans)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596916943", "date2": "1596917122", "bleu_score": "0.9796353585885051", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 40, "total_score": 103, "input": "4 5\n0 5\n-2 4\n3 4\n4 -2\n", "actual_output": "0\n", "expected_output": "4\n\n", "anno_code": ["N, D = map(int, input().split()) # (0): N=4, D=5\nans = 0 # (1): ans=0\nfor i in range(N): # (2): i=0 (5): i=1 ... (14): NO CHANGE\n X, Y = map(int, input().split()) # (3): X=0, Y=5 (6): X=-2, Y=4 ... (12): X=4, Y=-2\n if X*X+Y*Y<=D: # (4): NO CHANGE (7): NO CHANGE ... (13): NO CHANGE\n ans += 1\nprint(ans)"], "anno_status": [true], "diff_content": " N, D = map(int, input().split())\n ans = 0\n for i in range(N):\n X, Y = map(int, input().split())\n- if X*X+Y*Y<=D:\n+ if X*X+Y*Y<=D*D:\n ans += 1\n print(ans)\n", "FL_content": "\n N, D = map(int, input().split())\n ans = 0\n for i in range(N):\n X, Y = map(int, input().split())\n- if X*X+Y*Y<=D:\n ans += 1\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u201234972", "problem_id": "p02929", "submission1_id": "s188524703-FL", "submission2_id": "s579181870", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\nQ = 10**9+7\ndef main():\n N = int( input())\n S = input()\n left = 0\n ans = 1\n for s in S:\n if s == \"B\":\n if left%2 == 0:\n left += 1\n else:\n if left == 0:\n print(0)\n return\n ans *= left\n left -= 1\n else:\n if left%2 == 1:\n left += 1\n else:\n if left == 0:\n print(0)\n return\n ans *= left\n left -= 1\n ans %= Q\n if left > 0:\n print(0)\n return\n for i in range(1,N+1):\n ans *= i\n ans %= Q\n print(ans)\nif __name__ == '__main__':\n main()\n", "code2": "import sys\ninput = sys.stdin.readline\nQ = 10**9+7\ndef main():\n N = int( input())\n S = input()\n left = 0\n ans = 1\n for i in range(N*2):\n s = S[i]\n if s == \"B\":\n if left%2 == 0:\n left += 1\n else:\n ans *= left\n left -= 1\n else:\n if left%2 == 1:\n left += 1\n else:\n ans *= left\n left -= 1\n ans %= Q\n if left > 0 or ans == 0:\n print(0)\n return\n for i in range(1,N+1):\n ans *= i\n ans %= Q\n print(ans)\nif __name__ == '__main__':\n main()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566778058", "date2": "1566779058", "bleu_score": "0.7782359413163759", "code1_test_status": [1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1], "code1_test_score": 100, "total_score": 103, "input": "2\nBWWB\n", "actual_output": "0\n", "expected_output": "4\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\nQ = 10**9+7 # (1): Q=1000000007\ndef main(): # (2): main=\n N = int( input())\n S = input()\n left = 0\n ans = 1\n for s in S:\n if s == \"B\":\n if left%2 == 0:\n left += 1\n else:\n if left == 0:\n print(0)\n return\n ans *= left\n left -= 1\n else:\n if left%2 == 1:\n left += 1\n else:\n if left == 0:\n print(0)\n return\n ans *= left\n left -= 1\n ans %= Q\n if left > 0:\n print(0)\n return\n for i in range(1,N+1):\n ans *= i\n ans %= Q\n print(ans)\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n Q = 10**9+7\n def main():\n N = int( input())\n S = input()\n left = 0\n ans = 1\n- for s in S:\n+ for i in range(N*2):\n+ s = S[i]\n if s == \"B\":\n if left%2 == 0:\n left += 1\n else:\n- if left == 0:\n- print(0)\n- return\n ans *= left\n left -= 1\n else:\n if left%2 == 1:\n left += 1\n else:\n- if left == 0:\n- print(0)\n- return\n ans *= left\n left -= 1\n ans %= Q\n- if left > 0:\n+ if left > 0 or ans == 0:\n print(0)\n return\n for i in range(1,N+1):\n ans *= i\n ans %= Q\n print(ans)\n if __name__ == '__main__':\n main()\n-\n", "FL_content": "\n import sys\n input = sys.stdin.readline\n Q = 10**9+7\n def main():\n N = int( input())\n S = input()\n left = 0\n ans = 1\n for s in S:\n if s == \"B\":\n if left%2 == 0:\n left += 1\n else:\n if left == 0:\n print(0)\n return\n ans *= left\n left -= 1\n else:\n if left%2 == 1:\n left += 1\n else:\n if left == 0:\n print(0)\n return\n ans *= left\n left -= 1\n ans %= Q\n if left > 0:\n print(0)\n return\n for i in range(1,N+1):\n ans *= i\n ans %= Q\n print(ans)\n if __name__ == '__main__':\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 38 }, { "user_id": "u170201762", "problem_id": "p03297", "submission1_id": "s381736413-FL", "submission2_id": "s547578596", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import floor\ndef gcd(a,b):\n if b == 0:\n return a\n else:\n return gcd(b,a%b)\nT = int(input())\nfor i in range(T):\n A,B,C,D = map(int,input().split())\n if B > D or B > A:\n print(\"No\")\n else:\n if A%B>C:\n print(\"No\")\n else:\n d = gcd(B,D%B)\n r = A%B\n if r%d == 0:\n if B-d > C:\n print(\"No\")\n else:\n print(\"Yes\")\n else:\n if r+floor((B-r)/d) > C:\n print(\"No\")\n else:\n print(\"Yes\")\n", "code2": "from math import floor\ndef gcd(a,b):\n if b == 0:\n return a\n else:\n return gcd(b,a%b)\nT = int(input())\nfor i in range(T):\n A,B,C,D = map(int,input().split())\n if B > D or B > A:\n print(\"No\")\n else:\n if A%B>C:\n print(\"No\")\n else:\n d = gcd(B,D%B)\n r = (A%B)%d\n if B - d + r > C:\n print(\"No\")\n else:\n print(\"Yes\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531625715", "date2": "1531625869", "bleu_score": "0.6502762745409922", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 92, "total_score": 102, "input": "14\n7 7 5 9\n8 7 1 9\n11 10 7 12\n14 10 1 12\n14 14 14 15\n14 11 5 11\n14 10 12 11\n14 10 11 11\n0 10 3 10\n0 13 9 6\n11 18 9 10\n16 22 5 10\n1000010000100000000 17 5 999999999999999985\n1000000000000000000 16 15 2424336645253281229\n", "actual_output": "No\nNo\nYes\nNo\nYes\nYes\nYes\nYes\nNo\nNo\nNo\nNo\nNo\nYes\n", "expected_output": "No\nNo\nNo\nNo\nYes\nYes\nYes\nYes\nNo\nNo\nNo\nNo\nNo\nYes\n\n", "anno_code": ["from math import floor\ndef gcd(a,b): # (0): gcd=\n if b == 0: # (7): a=2, b=1 (8): a=1, b=0 ... (114): floor=, gcd=, T=14, i=13, A=1000000000000000000, B=16, C=15, D=2424336645253281229, d=1, r=4\n return a\n else:\n return gcd(b,a%b)\nT = int(input()) # (1): T=14\nfor i in range(T): # (2): i=0 (14): i=1 ... (106): i=13\n A,B,C,D = map(int,input().split()) # (3): A=7, B=7, C=5, D=9 (15): A=8, C=1 ... (107): A=1000000000000000000, B=16, C=15, D=2424336645253281229\n if B > D or B > A: # (4): NO CHANGE (16): NO CHANGE ... (108): NO CHANGE\n print(\"No\") # (88): NO CHANGE (92): NO CHANGE ... (100): NO CHANGE\n else:\n if A%B>C: # (5): NO CHANGE (17): NO CHANGE ... (109): NO CHANGE\n print(\"No\") # (41): NO CHANGE (105): NO CHANGE\n else:\n d = gcd(B,D%B) # (6): a=7, b=2 (18): a=7, b=2 ... (110): a=16, b=13\n r = A%B # (10): r=0 (22): r=1 ... (115): r=0\n if r%d == 0: # (11): NO CHANGE (23): NO CHANGE ... (116): NO CHANGE\n if B-d > C: # (12): NO CHANGE (24): NO CHANGE ... (117): NO CHANGE\n print(\"No\") # (13): NO CHANGE (25): NO CHANGE\n else:\n print(\"Yes\") # (52): NO CHANGE (73): NO CHANGE ... (118): NO CHANGE\n else:\n if r+floor((B-r)/d) > C: # (35): NO CHANGE (61): NO CHANGE\n print(\"No\")\n else:\n print(\"Yes\") # (36): NO CHANGE (62): NO CHANGE\n"], "anno_status": [false], "diff_content": " from math import floor\n def gcd(a,b):\n if b == 0:\n return a\n else:\n return gcd(b,a%b)\n T = int(input())\n for i in range(T):\n A,B,C,D = map(int,input().split())\n if B > D or B > A:\n print(\"No\")\n else:\n if A%B>C:\n print(\"No\")\n else:\n d = gcd(B,D%B)\n- r = A%B\n- if r%d == 0:\n- if B-d > C:\n- print(\"No\")\n- else:\n- print(\"Yes\")\n+ r = (A%B)%d\n+ if B - d + r > C:\n+ print(\"No\")\n else:\n- if r+floor((B-r)/d) > C:\n- print(\"No\")\n- else:\n- print(\"Yes\")\n-\n+ print(\"Yes\")\n", "FL_content": "\n from math import floor\n def gcd(a,b):\n if b == 0:\n return a\n else:\n return gcd(b,a%b)\n T = int(input())\n for i in range(T):\n A,B,C,D = map(int,input().split())\n if B > D or B > A:\n print(\"No\")\n else:\n if A%B>C:\n print(\"No\")\n else:\n d = gcd(B,D%B)\n r = A%B\n if r%d == 0:\n if B-d > C:\n print(\"No\")\n else:\n print(\"Yes\")\n else:\n- if r+floor((B-r)/d) > C:\n print(\"No\")\n else:\n print(\"Yes\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 28 }, { "user_id": "u991134049", "problem_id": "p02702", "submission1_id": "s783661623-FL", "submission2_id": "s706415755", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\namari = [0]*2019\nans = 0\nfor i in range(len(S)):\n amari[int(S[len(S)-1-i:]) % 2019] += 1\nfor i in amari:\n if i >= 2:\n ans += i*(i-1)/2\nprint(ans)\n ", "code2": "S = input()\namari = [0]*2019\nans = 0\namari[0] = 1\nA = 0\nfor i in range(len(S)):\n A += pow(10, i, 2019)*(int(S[len(S)-1-i]))\n amari[A % 2019] += 1\nfor i in amari:\n if i >= 2:\n ans += i*(i-1)/2\nprint(int(ans))\n \n ", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1589775237", "date2": "1589777149", "bleu_score": "0.7109531459689303", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1], "code1_test_score": 26, "total_score": 74, "input": "8498035987509\n", "actual_output": "2.0\n", "expected_output": "2\n\n", "anno_code": ["S = input() # (0): S=8498035987509\namari = [0]*2019 # (1): amari=[0, 0, ..., 0, 0]\nans = 0 # (2): ans=0\nfor i in range(len(S)): # (3): i=0 (5): i=1 ... (29): NO CHANGE\n amari[int(S[len(S)-1-i:]) % 2019] += 1 # (4): amari=[0, 0, ..., 0, 0] (6): amari=[0, 0, ..., 0, 0] ... (28): amari=[0, 0, ..., 0, 0]\nfor i in amari: # (30): i=0 (32): NO CHANGE ... (4070): NO CHANGE\n if i >= 2: # (31): NO CHANGE (33): NO CHANGE ... (4069): NO CHANGE\n ans += i*(i-1)/2 # (50): ans=1.0 (1739): ans=2.0\nprint(ans)\n "], "anno_status": [true], "diff_content": " S = input()\n amari = [0]*2019\n ans = 0\n+amari[0] = 1\n+A = 0\n for i in range(len(S)):\n- amari[int(S[len(S)-1-i:]) % 2019] += 1\n+ A += pow(10, i, 2019)*(int(S[len(S)-1-i]))\n+ amari[A % 2019] += 1\n for i in amari:\n if i >= 2:\n ans += i*(i-1)/2\n-print(ans)\n+print(int(ans))\n+ \n \n", "FL_content": "\n S = input()\n amari = [0]*2019\n ans = 0\n for i in range(len(S)):\n amari[int(S[len(S)-1-i:]) % 2019] += 1\n for i in amari:\n if i >= 2:\n ans += i*(i-1)/2\n-print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u972416428", "problem_id": "p02843", "submission1_id": "s239672733-FL", "submission2_id": "s267224660", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input().strip())\nvalid = { 0: True }\nfor i in range(1, n+1):\n valid[i] = any(valid.get(i-j, False) for j in range(100, 106))\nprint (valid[n])", "code2": "n = int(input().strip())\nvalid = { 0: True }\nfor i in range(1, n+1):\n valid[i] = any(valid.get(i-j, False) for j in range(100, 106))\nprint (1 if valid[i] else 0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575299765", "date2": "1575299911", "bleu_score": "0.9001457924493163", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 26, "input": "474\n", "actual_output": "False\n", "expected_output": "0\n\n", "anno_code": ["n = int(input().strip()) # (0): n=474\nvalid = { 0: True } # (1): valid={0: True}\nfor i in range(1, n+1): # (2): i=1 (4): i=2 ... (950): NO CHANGE\n valid[i] = any(valid.get(i-j, False) for j in range(100, 106)) # (3): valid={0: True, 1: False} (5): valid={0: True, 1: False, 2: False} ... (949): valid={0: True, 1: False, 2: False, 3: False, 4: False, 5: False, 6: False, 7: False, 8: False, 9: False, 10: False, 11: False, 12: False, 13: False, 14: False, 15: False, 16: False, 17: False, 18: False, 19: False, 20: False, 21: False, 22: False, 23: False, 24: False, 25: False, 26: False, 27: False, 28: False, 29: False, 30: False, 31: False, 32: False, 33: False, 34: False, 35: False, 36: False, 37: False, 38: False, 39: False, 40: False, 41: False, 42: False, 43: False, 44: False, 45: False, 46: False, 47: False, 48: False, 49: False, 50: False, 51: False, 52: False, 53: False, 54: False, 55: False, 56: False, 57: False, 58: False, 59: False, 60: False, 61: False, 62: False, 63: False, 64: False, 65: False, 66: False, 67: False, 68: False, 69: False, 70: False, 71: False, 72: False, 73: False, 74: False, 75: False, 76: False, 77: False, 78: False, 79: False, 80: False, 81: False, 82: False, 83: False, 84: False, 85: False, 86: False, 87: False, 88: False, 89: False, 90: False, 91: False, 92: False, 93: False, 94: False, 95: False, 96: False, 97: False, 98: False, 99: False, 100: True, 101: True, 102: True, 103: True, 104: True, 105: True, 106: False, 107: False, 108: False, 109: False, 110: False, 111: False, 112: False, 113: False, 114: False, 115: False, 116: False, 117: False, 118: False, 119: False, 120: False, 121: False, 122: False, 123: False, 124: False, 125: False, 126: False, 127: False, 128: False, 129: False, 130: False, 131: False, 132: False, 133: False, 134: False, 135: False, 136: False, 137: False, 138: False, 139: False, 140: False, 141: False, 142: False, 143: False, 144: False, 145: False, 146: False, 147: False, 148: False, 149: False, 150: False, 151: False, 152: False, 153: False, 154: False, 155: False, 156: False, 157: False, 158: False, 159: False, 160: False, 161: False, 162: False, 163: False, 164: False, 165: False, 166: False, 167: False, 168: False, 169: False, 170: False, 171: False, 172: False, 173: False, 174: False, 175: False, 176: False, 177: False, 178: False, 179: False, 180: False, 181: False, 182: False, 183: False, 184: False, 185: False, 186: False, 187: False, 188: False, 189: False, 190: False, 191: False, 192: False, 193: False, 194: False, 195: False, 196: False, 197: False, 198: False, 199: False, 200: True, 201: True, 202: True, 203: True, 204: True, 205: True, 206: True, 207: True, 208: True, 209: True, 210: True, 211: False, 212: False, 213: False, 214: False, 215: False, 216: False, 217: False, 218: False, 219: False, 220: False, 221: False, 222: False, 223: False, 224: False, 225: False, 226: False, 227: False, 228: False, 229: False, 230: False, 231: False, 232: False, 233: False, 234: False, 235: False, 236: False, 237: False, 238: False, 239: False, 240: False, 241: False, 242: False, 243: False, 244: False, 245: False, 246: False, 247: False, 248: False, 249: False, 250: False, 251: False, 252: False, 253: False, 254: False, 255: False, 256: False, 257: False, 258: False, 259: False, 260: False, 261: False, 262: False, 263: False, 264: False, 265: False, 266: False, 267: False, 268: False, 269: False, 270: False, 271: False, 272: False, 273: False, 274: False, 275: False, 276: False, 277: False, 278: False, 279: False, 280: False, 281: False, 282: False, 283: False, 284: False, 285: False, 286: False, 287: False, 288: False, 289: False, 290: False, 291: False, 292: False, 293: False, 294: False, 295: False, 296: False, 297: False, 298: False, 299: False, 300: True, 301: True, 302: True, 303: True, 304: True, 305: True, 306: True, 307: True, 308: True, 309: True, 310: True, 311: True, 312: True, 313: True, 314: True, 315: True, 316: False, 317: False, 318: False, 319: False, 320: False, 321: False, 322: False, 323: False, 324: False, 325: False, 326: False, 327: False, 328: False, 329: False, 330: False, 331: False, 332: False, 333: False, 334: False, 335: False, 336: False, 337: False, 338: False, 339: False, 340: False, 341: False, 342: False, 343: False, 344: False, 345: False, 346: False, 347: False, 348: False, 349: False, 350: False, 351: False, 352: False, 353: False, 354: False, 355: False, 356: False, 357: False, 358: False, 359: False, 360: False, 361: False, 362: False, 363: False, 364: False, 365: False, 366: False, 367: False, 368: False, 369: False, 370: False, 371: False, 372: False, 373: False, 374: False, 375: False, 376: False, 377: False, 378: False, 379: False, 380: False, 381: False, 382: False, 383: False, 384: False, 385: False, 386: False, 387: False, 388: False, 389: False, 390: False, 391: False, 392: False, 393: False, 394: False, 395: False, 396: False, 397: False, 398: False, 399: False, 400: True, 401: True, 402: True, 403: True, 404: True, 405: True, 406: True, 407: True, 408: True, 409: True, 410: True, 411: True, 412: True, 413: True, 414: True, 415: True, 416: True, 417: True, 418: True, 419: True, 420: True, 421: False, 422: False, 423: False, 424: False, 425: False, 426: False, 427: False, 428: False, 429: False, 430: False, 431: False, 432: False, 433: False, 434: False, 435: False, 436: False, 437: False, 438: False, 439: False, 440: False, 441: False, 442: False, 443: False, 444: False, 445: False, 446: False, 447: False, 448: False, 449: False, 450: False, 451: False, 452: False, 453: False, 454: False, 455: False, 456: False, 457: False, 458: False, 459: False, 460: False, 461: False, 462: False, 463: False, 464: False, 465: False, 466: False, 467: False, 468: False, 469: False, 470: False, 471: False, 472: False, 473: False, 474: False}\nprint (valid[n])"], "anno_status": [false], "diff_content": " n = int(input().strip())\n valid = { 0: True }\n for i in range(1, n+1):\n valid[i] = any(valid.get(i-j, False) for j in range(100, 106))\n-print (valid[n])\n+print (1 if valid[i] else 0)\n", "FL_content": "\n n = int(input().strip())\n valid = { 0: True }\n for i in range(1, n+1):\n valid[i] = any(valid.get(i-j, False) for j in range(100, 106))\n-print (valid[n])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u340781749", "problem_id": "p04000", "submission1_id": "s386177295-FL", "submission2_id": "s558836662", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import Counter, defaultdict\n\nh, w, n = map(int, input().split())\ndd = defaultdict(int)\n\nfor a, b in (map(int, input().split()) for _ in range(n)):\n for y in range(max(0, a - 3), min(a, h - 2)):\n for x in range(max(0, b - 3), min(b, w - 2)):\n dd[(y, x)] += 1\n\nc = Counter(dd.values())\nfor i in range(10):\n print(c[i] if i in c else 0)\n", "code2": "from collections import Counter, defaultdict\n\nh, w, n = map(int, input().split())\nhs, ws = h - 2, w - 2\ndd = defaultdict(int)\n\nfor a, b in (map(int, input().split()) for _ in range(n)):\n for y in range(max(0, a - 3), min(a, hs)):\n for x in range(max(0, b - 3), min(b, ws)):\n dd[(y, x)] += 1\n\nprint(hs * ws - len(dd))\n\nc = Counter(dd.values())\nfor i in range(1, 10):\n print(c[i] if i in c else 0)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1476598840", "date2": "1476599220", "bleu_score": "0.8804238132809915", "code1_test_status": [0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 10, "total_score": 103, "input": "1000000000 1001001010 0\n", "actual_output": "0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n", "expected_output": "1001001005997997984\n0\n0\n0\n0\n0\n0\n0\n0\n0\n\n", "anno_code": ["from collections import Counter, defaultdict\n\nh, w, n = map(int, input().split()) # (0): h=1000000000, w=1001001010, n=0\ndd = defaultdict(int) # (1): dd=defaultdict(, {})\n\nfor a, b in (map(int, input().split()) for _ in range(n)): # (2): NO CHANGE\n for y in range(max(0, a - 3), min(a, h - 2)):\n for x in range(max(0, b - 3), min(b, w - 2)):\n dd[(y, x)] += 1\n\nc = Counter(dd.values()) # (3): c=Counter()\nfor i in range(10): # (4): i=0 (6): i=1 ... (22): i=9\n print(c[i] if i in c else 0) # (5): NO CHANGE (7): NO CHANGE ... (23): NO CHANGE\n"], "anno_status": [true], "diff_content": " from collections import Counter, defaultdict\n \n h, w, n = map(int, input().split())\n+hs, ws = h - 2, w - 2\n dd = defaultdict(int)\n \n for a, b in (map(int, input().split()) for _ in range(n)):\n- for y in range(max(0, a - 3), min(a, h - 2)):\n- for x in range(max(0, b - 3), min(b, w - 2)):\n+ for y in range(max(0, a - 3), min(a, hs)):\n+ for x in range(max(0, b - 3), min(b, ws)):\n dd[(y, x)] += 1\n \n+print(hs * ws - len(dd))\n+\n c = Counter(dd.values())\n-for i in range(10):\n+for i in range(1, 10):\n print(c[i] if i in c else 0)\n \n", "FL_content": "\n from collections import Counter, defaultdict\n \n h, w, n = map(int, input().split())\n dd = defaultdict(int)\n \n for a, b in (map(int, input().split()) for _ in range(n)):\n- for y in range(max(0, a - 3), min(a, h - 2)):\n- for x in range(max(0, b - 3), min(b, w - 2)):\n- dd[(y, x)] += 1\n \n c = Counter(dd.values())\n for i in range(10):\n print(c[i] if i in c else 0)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u488401358", "problem_id": "p03689", "submission1_id": "s563543767-FL", "submission2_id": "s136151189", "status1": "Wrong Answer", "status2": "Accepted", "code1": "H,W,h,w=map(int,input().split())\nif H%h==0 and W%w==0:\n print(\"No\")\nelse:\n print(\"Yes\")\n ans=[[1 for i in range(W)] for j in range(H)]\n for i in range(H):\n for j in range(W):\n if (i+1)%h==0 and (j+1)%w==0:\n ans[i][j]=-h*w\n for i in range(H):\n print(*ans[i])", "code2": "H,W,h,w=map(int,input().split())\nif H%h==0 and W%w==0:\n print(\"No\")\nelse:\n c=10**9\n ans=[[(c-1)\n for i in range(H):\n for j in range(W):\n if (i+1)%h==0 and (j+1)%w==0:\n ans[i][j]=-c\n if sum(ans[i][j] for i in range(H) for j in range(W))>0:\n print(\"Yes\")\n for i in range(H):\n print(*ans[i])\n else:\n print(\"No\")\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589660437", "date2": "1589661397", "bleu_score": "0.7687014958753743", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], "code1_test_score": 3, "total_score": 96, "input": "2 8 4 1\n", "actual_output": "Yes\n1 1 1 1 1 1 1 1\n1 1 1 1 1 1 1 1\n", "expected_output": "Yes\n1000 1000 1000 1000 1000 1000 1000 1000\n1000 1000 1000 1000 1000 1000 1000 1000\n\n", "anno_code": ["H,W,h,w=map(int,input().split()) # (0): H=2, W=8, h=4, w=1\nif H%h==0 and W%w==0: # (1): NO CHANGE\n print(\"No\")\nelse:\n print(\"Yes\") # (2): NO CHANGE\n ans=[[1 for i in range(W)] for j in range(H)] # (3): ans\n for i in range(H): # (4): i=0 (22): i=1 (40): NO CHANGE\n for j in range(W): # (5): j=0 (7): j=1 ... (39): NO CHANGE\n if (i+1)%h==0 and (j+1)%w==0: # (6): NO CHANGE (8): NO CHANGE ... (38): NO CHANGE\n ans[i][j]=-h*w\n for i in range(H): # (41): i=0 (43): i=1\n print(*ans[i]) # (42): NO CHANGE (44): NO CHANGE\n"], "anno_status": [true], "diff_content": " H,W,h,w=map(int,input().split())\n if H%h==0 and W%w==0:\n print(\"No\")\n else:\n- print(\"Yes\")\n- ans=[[1 for i in range(W)] for j in range(H)]\n+ c=10**9\n+ ans=[[(c-1)\n for i in range(H):\n for j in range(W):\n if (i+1)%h==0 and (j+1)%w==0:\n- ans[i][j]=-h*w\n- for i in range(H):\n- print(*ans[i])\n+ ans[i][j]=-c\n+ if sum(ans[i][j] for i in range(H) for j in range(W))>0:\n+ print(\"Yes\")\n+ for i in range(H):\n+ print(*ans[i])\n+ else:\n+ print(\"No\")\n+\n", "FL_content": "\n H,W,h,w=map(int,input().split())\n if H%h==0 and W%w==0:\n print(\"No\")\n else:\n print(\"Yes\")\n ans=[[1 for i in range(W)] for j in range(H)]\n for i in range(H):\n for j in range(W):\n- if (i+1)%h==0 and (j+1)%w==0:\n- ans[i][j]=-h*w\n for i in range(H):\n print(*ans[i])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u276050131", "problem_id": "p02396", "submission1_id": "s415233956-FL", "submission2_id": "s303475134", "status1": "Wrong Answer", "status2": "Accepted", "code1": "i = 0\nlis = []\nwhile True:\n s = input()\n i += 1\n s = int(s)\n lis.append(s)\n if s == 0:\n break\n\nfor j in range(i):\n fmt = \"case {a}: {b}\"\n s = fmt.format(a = j + 1,b = lis[j])\n print(s)", "code2": "i = 0\nlis = []\nwhile True:\n s = input()\n i += 1\n s = int(s)\n lis.append(s)\n if s == 0:\n break\n\nfor j in range(i - 1):\n fmt = \"Case {a}: {b}\"\n s = fmt.format(a = j + 1,b = lis[j])\n print(s)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1484783199", "date2": "1484783328", "bleu_score": "0.9631076506966323", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3\n5\n11\n9\n24\n0\n0\n", "actual_output": "case 1: 3\ncase 2: 5\ncase 3: 11\ncase 4: 9\ncase 5: 24\ncase 6: 0\n", "expected_output": "Case 1: 3\nCase 2: 5\nCase 3: 11\nCase 4: 9\nCase 5: 24\n\n", "anno_code": ["i = 0 # (0): i=0\nlis = [] # (1): lis=[]\nwhile True: # (2): NO CHANGE (8): NO CHANGE ... (32): NO CHANGE\n s = input() # (3): s=3 (9): s=5 ... (33): s=0\n i += 1 # (4): i=1 (10): i=2 ... (34): i=6\n s = int(s) # (5): s=3 (11): s=5 ... (35): s=0\n lis.append(s) # (6): lis=[3] (12): lis=[3, 5] ... (36): lis=[3, 5, 11, 9, 24, 0]\n if s == 0: # (7): NO CHANGE (13): NO CHANGE ... (37): NO CHANGE\n break # (38): NO CHANGE\n\nfor j in range(i): # (39): j=0 (43): j=1 ... (59): j=5\n fmt = \"case {a}: {b}\" # (40): fmt=case {a}: {b} (44): NO CHANGE ... (60): NO CHANGE\n s = fmt.format(a = j + 1,b = lis[j]) # (41): s=case 1: 3 (45): s=case 2: 5 ... (61): s=case 6: 0\n print(s) # (42): NO CHANGE (46): NO CHANGE ... (62): NO CHANGE\n"], "anno_status": [true], "diff_content": " i = 0\n lis = []\n while True:\n s = input()\n i += 1\n s = int(s)\n lis.append(s)\n if s == 0:\n break\n \n-for j in range(i):\n- fmt = \"case {a}: {b}\"\n+for j in range(i - 1):\n+ fmt = \"Case {a}: {b}\"\n s = fmt.format(a = j + 1,b = lis[j])\n print(s)\n", "FL_content": "\n i = 0\n lis = []\n while True:\n s = input()\n i += 1\n s = int(s)\n lis.append(s)\n if s == 0:\n break\n \n for j in range(i):\n- fmt = \"case {a}: {b}\"\n s = fmt.format(a = j + 1,b = lis[j])\n print(s)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u711539583", "problem_id": "p02549", "submission1_id": "s126836723-FL", "submission2_id": "s064455256", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, k = map(int, input().split())\ncum = [0, 1]\ndp = [0, 1]\n\nlr = [list(map(int, input().split())) for _ in range(k)] \nmod = 998244353\n\ndef check(i):\n res = 0\n for l, r in lr:\n if i - l < 1:\n break\n res += cum[i-l] - cum[max(i-r-1,0)]\n res %= mod\n return res\n\n\nfor i in range(2,n+1):\n dp.append(check(i))\n cum.append((cum[-1]+dp[-1])%mod)\n\nprint(dp[-1])", "code2": "n, k = map(int, input().split())\ncum = [0, 1]\ndp = [0, 1]\n\nlr = [list(map(int, input().split())) for _ in range(k)] \nmod = 998244353\n\ndef check(i):\n res = 0\n for l, r in lr:\n if i - l < 1:\n continue\n res += cum[i-l] - cum[max(i-r-1,0)]\n res %= mod\n return res\n\n\nfor i in range(2,n+1):\n dp.append(check(i))\n cum.append((cum[-1]+dp[-1])%mod)\n\nprint(dp[-1])", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1600549459", "date2": "1600550833", "bleu_score": "0.9770012996119488", "code1_test_status": [1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 63, "total_score": 102, "input": "84 3\n5 4\n1 2\n1 27\n", "actual_output": "75035283\n", "expected_output": "282478460\n\n", "anno_code": ["n, k = map(int, input().split()) # (0): n=84, k=3\ncum = [0, 1] # (1): cum=[0, 1]\ndp = [0, 1] # (2): dp=[0, 1]\n\nlr = [list(map(int, input().split())) for _ in range(k)] # (3): lr\nmod = 998244353 # (4): mod=998244353\n\ndef check(i): # (5): check=\n res = 0 # (8): res=0 (15): res=0 ... (1362): res=0\n for l, r in lr: # (9): l=5, r=4 (16): l=5, r=4 ... (1375): n=84, k=3, cum=[0, 1, 1, 1, 1, 1, 2, 5, 14, 40, 115, 331, 953, 2744, 7901, 22750, 65506, 188617, 543101, 1563797, 4502774, 12965221, 37331866, 107492824, 309513251, 891207887, 569642131, 401168789, 312298480, 367253308, 700591134, 791230568, 9949689, 327502285, 191276285, 563879161, 365890831, 906396168, 158820522, 110570404, 423558444, 113607713, 230244834, 267153308, 687786705, 834682311, 239861818, 30234952, 249764124, 496465333, 423584828, 913497536, 936269671, 495771945, 4176168, 671578750, 208421472, 253834940, 387579289, 163085827, 225472852, 959581335, 527893187, 794327548, 59266125, 739997726, 268600755, 635965736, 744341038, 852570293, 693255956, 70029169, 666219215, 470719378, 104022794, 613858568, 122847849, 766299773, 263211570, 751533678, 552031590, 897111255, 937379566, 590284005], dp=[0, 1, 0, 0, 0, 0, 1, 3, 9, 26, 75, 216, 622, 1791, 5157, 14849, 42756, 123111, 354484, 1020696, 2938977, 8462447, 24366645, 70160958, 202020427, 581694636, 676678597, 829771011, 909374044, 54954828, 333337826, 90639434, 216963474, 317552596, 862018353, 372602876, 800256023, 540505337, 250668707, 949994235, 312988040, 688293622, 116637121, 36908474, 420633397, 146895606, 403423860, 788617487, 219529172, 246701209, 925363848, 489912708, 22772135, 557746627, 506648576, 667402582, 535087075, 45413468, 133744349, 773750891, 62387025, 734108483, 566556205, 266434361, 263182930, 680731601, 526847382, 367364981, 108375302, 108229255, 838930016, 375017566, 596190046, 802744516, 631547769, 509835774, 507233634, 643451924, 495156150, 488322108, 798742265, 345079665, 40268311, 651148792, 75035283], lr, mod=998244353, check=\n if i - l < 1: # (10): NO CHANGE (17): NO CHANGE ... (1372): NO CHANGE\n break # (11): n=84, k=3, cum=[0, 1], dp=[0, 1, 0], lr, mod=998244353, check= (18): n=84, k=3, cum=[0, 1, 1], dp=[0, 1, 0, 0], lr, mod=998244353, check= ... (32): n=84, k=3, cum=[0, 1, 1, 1, 1], dp=[0, 1, 0, 0, 0, 0], lr, mod=998244353, check=\n res += cum[i-l] - cum[max(i-r-1,0)] # (39): NO CHANGE (43): NO CHANGE ... (1373): res=1073279636\n res %= mod # (40): NO CHANGE (44): NO CHANGE ... (1374): res=75035283\n return res\n\n\nfor i in range(2,n+1): # (6): i=2 (13): i=3 ... (1377): NO CHANGE\n dp.append(check(i)) # (7): NO CHANGE (14): NO CHANGE ... (1361): NO CHANGE\n cum.append((cum[-1]+dp[-1])%mod) # (12): cum=[0, 1, 1] (19): cum=[0, 1, 1, 1] ... (1376): cum=[0, 1, ..., 590284005, 665319288]\n\nprint(dp[-1])"], "anno_status": [false], "diff_content": " n, k = map(int, input().split())\n cum = [0, 1]\n dp = [0, 1]\n \n lr = [list(map(int, input().split())) for _ in range(k)] \n mod = 998244353\n \n def check(i):\n res = 0\n for l, r in lr:\n if i - l < 1:\n- break\n+ continue\n res += cum[i-l] - cum[max(i-r-1,0)]\n res %= mod\n return res\n \n \n for i in range(2,n+1):\n dp.append(check(i))\n cum.append((cum[-1]+dp[-1])%mod)\n \n print(dp[-1])\n", "FL_content": "\n n, k = map(int, input().split())\n cum = [0, 1]\n dp = [0, 1]\n \n lr = [list(map(int, input().split())) for _ in range(k)] \n mod = 998244353\n \n def check(i):\n res = 0\n for l, r in lr:\n- if i - l < 1:\n- break\n- res += cum[i-l] - cum[max(i-r-1,0)]\n res %= mod\n return res\n \n \n for i in range(2,n+1):\n dp.append(check(i))\n cum.append((cum[-1]+dp[-1])%mod)\n \n print(dp[-1])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u241923784", "problem_id": "p02345", "submission1_id": "s365723564-FL", "submission2_id": "s414431023", "status1": "Wrong Answer", "status2": "Accepted", "code1": "M = 2147483647\na = [M for i in range(100000)]\n\ndef find(x,y,i,l,r):\n if r<=x or y<=l:return M\n if x<=l and r<=y: return a[i]\n return min(find(x,y,i*2,l,(l+r)/2),find(x,y,i*2+1,(l+r)/2,r))\n\nif __name__=='__main__':\n n, m = (int(x) for x in input().split())\n t=1\n while t= 2:\n a[int(x/2)]=j_min(a[int(x)],a[int(x)^1])\n x/=2\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556180270", "date2": "1556443722", "bleu_score": "0.8728051794823368", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 81, "total_score": 102, "input": "3 5\n0 0 1\n0 1 2\n1 0 3\n1 0 2\n1 1 4\n", "actual_output": "2147483647\n1\n2\n", "expected_output": "1\n1\n2\n\n", "anno_code": ["M = 2147483647 # (0): M=2147483647\na = [M for i in range(100000)] # (1): a=[2147483647, 2147483647, ..., 2147483647, 2147483647]\n\ndef find(x,y,i,l,r): # (2): find=\n if r<=x or y<=l:return M\n if x<=l and r<=y: return a[i]\n return min(find(x,y,i*2,l,(l+r)/2),find(x,y,i*2+1,(l+r)/2,r))\n\nif __name__=='__main__':\n n, m = (int(x) for x in input().split())\n t=1\n while t= 2:\n+ a[int(x/2)]=j_min(a[int(x)],a[int(x)^1])\n x/=2\n \n \n", "FL_content": "\n M = 2147483647\n a = [M for i in range(100000)]\n \n def find(x,y,i,l,r):\n if r<=x or y<=l:return M\n if x<=l and r<=y: return a[i]\n return min(find(x,y,i*2,l,(l+r)/2),find(x,y,i*2+1,(l+r)/2,r))\n \n if __name__=='__main__':\n n, m = (int(x) for x in input().split())\n t=1\n while t>= 1\n\t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n\n\tdef query(self,a,b):\n\t\treturn self.query_(a,b,1,0,self.datSize)\n\n\tdef query_(self,a,b,i,l,r):\n\t\t\n\t\tret = self.UNDEFINED_VAL\n\n\t\ta += self.datSize\n\t\tb += self.datSize\n\t\twhile a < b:\n\t\t\tif b & 1:\n\t\t\t\tb -= 1\n\t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n\n\t\t\tif a & 1:\n\t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n\t\t\t\ta += 1\n\n\t\t\ta >>= 1; b >>= 1\n\n\t\treturn ret\n\n\tdef printTree(self):\n\t\tprint(self.datTree)\n\n\ndef LongestSeaquence(A,K):\n\tN = len(A)\n\tlis = 0\n\n\t\n\tMAX_A = max(A)\n\ttree = SegTree(MAX_A+1,max,0,-1e18)\n\t\n\n\tfor n in range(N):\n\t\tx = A[n]\n\t\tl = max(1,x-K)\n\t\tr = min(MAX_A,x+K)\n\t\ttree.update( x, tree.query(l,r+1)+1 )\n\n\t\n\tlis = tree.query(0,MAX_A+1)\n\n\treturn lis\n\ndef main():\n\tN,K = map(int,input().split())\n\tA = [ int(input()) for _ in range(N)]\n\n\tprint(LongestSeaquence(A,K))\n\n\n\nif __name__ == \"__main__\":\n\tmain()", "code2": "class SegTree:\n\t\n\tdef __init__(self,size,func,init_val,undef):\n\t\tself.specSize = size\n\t\tself.datSize = 1\n\t\tself.compareFunc = func\t\t\n\t\tself.INIT_VAL = init_val\t\n\t\tself.UNDEFINED_VAL = undef\t\n\t\t\n\t\tself.datSize = 2**size.bit_length()\n\n\t\t\n\t\t\n\t\tself.datTree = [self.INIT_VAL for _ in range(2*self.datSize+1)]\n\n\tdef update(self, i, val ):\n\t\t\n\t\t\n\t\t\n\t\ti += self.datSize\n\t\tself.datTree[i] = val\n\t\twhile 1 < i:\n\t\t\ti >>= 1\n\t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n\n\tdef query(self,a,b):\n\t\treturn self.query_(a,b,0,0,self.datSize)\n\n\tdef query_(self,a,b,i,l,r):\n\t\t\n\t\tret = self.UNDEFINED_VAL\n\n\t\ta += self.datSize\n\t\tb += self.datSize\n\t\twhile a < b:\n\t\t\tif b & 1:\n\t\t\t\tb -= 1\n\t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n\n\t\t\tif a & 1:\n\t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n\t\t\t\ta += 1\n\n\t\t\ta >>= 1; b >>= 1\n\n\t\treturn ret\n\n\tdef printTree(self):\n\t\tprint(self.datTree)\n\n\ndef LongestSeaquence(A,K):\n\tN = len(A)\n\tlis = 0\n\n\t\n\tMAX_A = max(A)\n\ttree = SegTree(MAX_A+1,max,0,-1e18)\n\t\n\n\tfor n in range(N):\n\t\tx = A[n]\n\t\tl = max(0,x-K)\n\t\tr = min(MAX_A,x+K)\n\t\ttmp = tree.query(l,r+1)+1\n\t\ttree.update( x, tmp )\n\t\tlis = max(lis, tmp)\n\n\treturn lis\n\ndef main():\n\tN,K = map(int,input().split())\n\tA = [ int(input()) for _ in range(N)]\n\n\tprint(LongestSeaquence(A,K))\n\n\n\nif __name__ == \"__main__\":\n\tmain()", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601183504", "date2": "1601183918", "bleu_score": "0.9765198019877849", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 81, "total_score": 101, "input": "8 0\n0\n2\n4\n0\n5\n6\n13\n7\n4\n4\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["class SegTree: # (0): SegTree=\n\t\n\tdef __init__(self,size,func,init_val,undef):\n\t\tself.specSize = size\n\t\tself.datSize = 1\n\t\tself.compareFunc = func\t\t\n\t\tself.INIT_VAL = init_val\t\n\t\tself.UNDEFINED_VAL = undef\t\n\t\t\n\t\tself.datSize = 2**size.bit_length()\n\n\t\t\n\t\t\n\t\tself.datTree = [self.INIT_VAL for _ in range(2*self.datSize+1)]\n\n\tdef update(self, i, val ):\n\t\t\n\t\t\n\t\t\n\t\ti += self.datSize\n\t\tself.datTree[i] = val\n\t\twhile 1 < i:\n\t\t\ti >>= 1\n\t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n\n\tdef query(self,a,b):\n\t\treturn self.query_(a,b,1,0,self.datSize)\n\n\tdef query_(self,a,b,i,l,r):\n\t\t\n\t\tret = self.UNDEFINED_VAL\n\n\t\ta += self.datSize\n\t\tb += self.datSize\n\t\twhile a < b:\n\t\t\tif b & 1:\n\t\t\t\tb -= 1\n\t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n\n\t\t\tif a & 1:\n\t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n\t\t\t\ta += 1\n\n\t\t\ta >>= 1; b >>= 1\n\n\t\treturn ret\n\n\tdef printTree(self):\n\t\tprint(self.datTree)\n\n\ndef LongestSeaquence(A,K): # (1): LongestSeaquence=\n\tN = len(A)\n\tlis = 0\n\n\t\n\tMAX_A = max(A)\n\ttree = SegTree(MAX_A+1,max,0,-1e18)\n\t\n\n\tfor n in range(N):\n\t\tx = A[n]\n\t\tl = max(1,x-K)\n\t\tr = min(MAX_A,x+K)\n\t\ttree.update( x, tree.query(l,r+1)+1 )\n\n\t\n\tlis = tree.query(0,MAX_A+1)\n\n\treturn lis\n\ndef main(): # (2): main=\n\tN,K = map(int,input().split())\n\tA = [ int(input()) for _ in range(N)]\n\n\tprint(LongestSeaquence(A,K))\n\n\n\nif __name__ == \"__main__\":\n\tmain()"], "anno_status": [false], "diff_content": " class SegTree:\n \t\n \tdef __init__(self,size,func,init_val,undef):\n \t\tself.specSize = size\n \t\tself.datSize = 1\n \t\tself.compareFunc = func\t\t\n \t\tself.INIT_VAL = init_val\t\n \t\tself.UNDEFINED_VAL = undef\t\n \t\t\n \t\tself.datSize = 2**size.bit_length()\n \n \t\t\n \t\t\n \t\tself.datTree = [self.INIT_VAL for _ in range(2*self.datSize+1)]\n \n \tdef update(self, i, val ):\n \t\t\n \t\t\n \t\t\n \t\ti += self.datSize\n \t\tself.datTree[i] = val\n \t\twhile 1 < i:\n \t\t\ti >>= 1\n \t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n \n \tdef query(self,a,b):\n-\t\treturn self.query_(a,b,1,0,self.datSize)\n+\t\treturn self.query_(a,b,0,0,self.datSize)\n \n \tdef query_(self,a,b,i,l,r):\n \t\t\n \t\tret = self.UNDEFINED_VAL\n \n \t\ta += self.datSize\n \t\tb += self.datSize\n \t\twhile a < b:\n \t\t\tif b & 1:\n \t\t\t\tb -= 1\n \t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n \n \t\t\tif a & 1:\n \t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n \t\t\t\ta += 1\n \n \t\t\ta >>= 1; b >>= 1\n \n \t\treturn ret\n \n \tdef printTree(self):\n \t\tprint(self.datTree)\n \n \n def LongestSeaquence(A,K):\n \tN = len(A)\n \tlis = 0\n \n \t\n \tMAX_A = max(A)\n \ttree = SegTree(MAX_A+1,max,0,-1e18)\n \t\n \n \tfor n in range(N):\n \t\tx = A[n]\n-\t\tl = max(1,x-K)\n+\t\tl = max(0,x-K)\n \t\tr = min(MAX_A,x+K)\n-\t\ttree.update( x, tree.query(l,r+1)+1 )\n-\n-\t\n-\tlis = tree.query(0,MAX_A+1)\n+\t\ttmp = tree.query(l,r+1)+1\n+\t\ttree.update( x, tmp )\n+\t\tlis = max(lis, tmp)\n \n \treturn lis\n \n def main():\n \tN,K = map(int,input().split())\n \tA = [ int(input()) for _ in range(N)]\n \n \tprint(LongestSeaquence(A,K))\n \n \n \n if __name__ == \"__main__\":\n \tmain()\n", "FL_content": "\n class SegTree:\n \t\n \tdef __init__(self,size,func,init_val,undef):\n \t\tself.specSize = size\n \t\tself.datSize = 1\n \t\tself.compareFunc = func\t\t\n \t\tself.INIT_VAL = init_val\t\n \t\tself.UNDEFINED_VAL = undef\t\n \t\t\n \t\tself.datSize = 2**size.bit_length()\n \n \t\t\n \t\t\n \t\tself.datTree = [self.INIT_VAL for _ in range(2*self.datSize+1)]\n \n \tdef update(self, i, val ):\n \t\t\n \t\t\n \t\t\n \t\ti += self.datSize\n \t\tself.datTree[i] = val\n \t\twhile 1 < i:\n \t\t\ti >>= 1\n \t\t\tself.datTree[i] = self.compareFunc( self.datTree[i<<1|0], self.datTree[i<<1|1] )\n \n \tdef query(self,a,b):\n \t\treturn self.query_(a,b,1,0,self.datSize)\n \n \tdef query_(self,a,b,i,l,r):\n \t\t\n \t\tret = self.UNDEFINED_VAL\n \n \t\ta += self.datSize\n \t\tb += self.datSize\n \t\twhile a < b:\n \t\t\tif b & 1:\n \t\t\t\tb -= 1\n \t\t\t\tret = self.compareFunc(ret, self.datTree[b])\n \n \t\t\tif a & 1:\n \t\t\t\tret = self.compareFunc(ret, self.datTree[a])\n \t\t\t\ta += 1\n \n \t\t\ta >>= 1; b >>= 1\n \n \t\treturn ret\n \n \tdef printTree(self):\n \t\tprint(self.datTree)\n \n \n def LongestSeaquence(A,K):\n \tN = len(A)\n \tlis = 0\n \n \n \tMAX_A = max(A)\n \ttree = SegTree(MAX_A+1,max,0,-1e18)\n \t\n \n \tfor n in range(N):\n \t\tx = A[n]\n \t\tl = max(1,x-K)\n \t\tr = min(MAX_A,x+K)\n \t\ttree.update( x, tree.query(l,r+1)+1 )\n \n \t\n \tlis = tree.query(0,MAX_A+1)\n \n \treturn lis\n \n def main():\n \tN,K = map(int,input().split())\n \tA = [ int(input()) for _ in range(N)]\n \n \tprint(LongestSeaquence(A,K))\n \n \n \n if __name__ == \"__main__\":\n \tmain()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 81 }, { "user_id": "u546842199", "problem_id": "p03377", "submission1_id": "s294940781-FL", "submission2_id": "s611572006", "status1": "Wrong Answer", "status2": "Accepted", "code1": "A, B, X= map(int,input().split())\nif A <= X:\n print('YES')\nelse: \n print('NO')\n", "code2": "A, B, X= map(int,input().split())\nif A <= X and A + B >=X:\n print('YES')\nelse: \n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1527881273", "date2": "1527881592", "bleu_score": "0.8469723058518124", "code1_test_status": [0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1], "code1_test_score": 37, "total_score": 87, "input": "-28 -1 4\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["A, B, X= map(int,input().split()) # (0): A=-28, B=-1, X=4\nif A <= X: # (1): NO CHANGE\n print('YES')\nelse: \n print('NO')\n"], "anno_status": [true], "diff_content": " A, B, X= map(int,input().split())\n-if A <= X:\n+if A <= X and A + B >=X:\n print('YES')\n else: \n print('NO')\n-\n", "FL_content": "\n A, B, X= map(int,input().split())\n-if A <= X:\n print('YES')\n else: \n print('NO')\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u497158316", "problem_id": "p02639", "submission1_id": "s961880649-FL", "submission2_id": "s752436382", "status1": "Wrong Answer", "status2": "Accepted", "code1": "num = input().split()\nfor i in range(0,len(num)):\n if num[i] == 0:\n print(i+1)\n ", "code2": "num = input().split()\nfor i in range(0,len(num)):\n if int(num[i]) == 0:\n print(i+1)\n \n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1592182914", "date2": "1592182967", "bleu_score": "0.898729961522176", "code1_test_status": [0], "code1_test_score": 0, "total_score": 1, "input": "0 2 3 4 5\n", "actual_output": "", "expected_output": "1\n", "anno_code": ["num = input().split() # (0): num=['0', '2', '3', '4', '5']\nfor i in range(0,len(num)): # (1): i=0 (3): i=1 ... (9): i=4\n if num[i] == 0: # (2): NO CHANGE (4): NO CHANGE ... (10): NO CHANGE\n print(i+1)\n "], "anno_status": [true], "diff_content": " num = input().split()\n for i in range(0,len(num)):\n- if num[i] == 0:\n+ if int(num[i]) == 0:\n print(i+1)\n \n+\n", "FL_content": "\n num = input().split()\n for i in range(0,len(num)):\n- if num[i] == 0:\n print(i+1)\n- \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u192042624", "problem_id": "p02722", "submission1_id": "s421111450-FL", "submission2_id": "s516180711", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\n\nN = int(input())\n\nnn = int(math.sqrt(N))\n\nans = 0\nfor x in range(2,nn+1):\n\n if N % x > 1:\n continue\n\n if N % x == 1:\n ans += 1\n continue\n \n tmp = N\n while True:\n tmp = tmp / x\n if tmp % x == 1:\n ans += 1\n break\n elif tmp == x :\n ans += 1\n break\n elif tmp % x >= 1:\n break\n\nprint(ans+2)\n\n\n\n\n", "code2": "import math\n\n\nN = int(input())\n\nnn = int(math.sqrt(N))\n\n\nans = 1\nfor x in range(2,nn+1):\n\n if N % x == 1:\n ans += 1\n continue\n \n if N % x > 1:\n continue\n\n tmp = N\n while tmp > x:\n tmp = tmp / x\n if tmp % x == 1 :\n ans += 1\n break\n elif tmp % x > 1 :\n break\n elif tmp == x:\n ans += 1\n break\n\nx = 1\ntmp = N - 1\nwhile tmp / x > nn:\n if tmp % x == 0:\n ans += 1\n x += 1\n\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586054395", "date2": "1586111920", "bleu_score": "0.7936412039577081", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0], "code1_test_score": 2, "total_score": 81, "input": "237274827109\n", "actual_output": "13\n", "expected_output": "24\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import math\n \n \n N = int(input())\n \n nn = int(math.sqrt(N))\n \n-ans = 0\n-for x in range(2,nn+1):\n \n- if N % x > 1:\n- continue\n+ans = 1\n+for x in range(2,nn+1):\n \n if N % x == 1:\n ans += 1\n continue\n \n+ if N % x > 1:\n+ continue\n+\n tmp = N\n- while True:\n+ while tmp > x:\n tmp = tmp / x\n- if tmp % x == 1:\n+ if tmp % x == 1 :\n ans += 1\n break\n- elif tmp == x :\n- ans += 1\n+ elif tmp % x > 1 :\n break\n- elif tmp % x >= 1:\n+ elif tmp == x:\n+ ans += 1\n break\n \n-print(ans+2)\n-\n-\n-\n+x = 1\n+tmp = N - 1\n+while tmp / x > nn:\n+ if tmp % x == 0:\n+ ans += 1\n+ x += 1\n \n+print(ans)\n \n", "FL_content": "\n import math\n \n \n N = int(input())\n \n nn = int(math.sqrt(N))\n \n ans = 0\n for x in range(2,nn+1):\n \n if N % x > 1:\n continue\n \n if N % x == 1:\n ans += 1\n continue\n \n tmp = N\n while True:\n tmp = tmp / x\n if tmp % x == 1:\n ans += 1\n break\n elif tmp == x :\n ans += 1\n break\n elif tmp % x >= 1:\n break\n \n-print(ans+2)\n \n \n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 35 }, { "user_id": "u215743476", "problem_id": "p03617", "submission1_id": "s183952961-FL", "submission2_id": "s483533822", "status1": "Wrong Answer", "status2": "Accepted", "code1": "q, h, s, d = map(int, input().split())\nn = int(input())\n\nif n % 2 == 0:\n l = [4*q*n, 2*h*n, s*n, d*n/2]\n l.sort()\n print(int(l[0]))\nelse:\n l = [4*q*(n-1), 2*h*(n-1), s*(n-1), d*(n-1)/2]\n l_rest = [4*q, 2*h, s]\n l.sort()\n l_rest.sort()\n print(int(l[0]+l_rest[0]))\n", "code2": "q, h, s, d = map(int, input().split())\nn = int(input())\n\nif n % 2 == 0:\n l = [4*q*n, 2*h*n, s*n, d*(n\n l.sort()\n print(int(l[0]))\nelse:\n l = [4*q*(n-1), 2*h*(n-1), s*(n-1), d*((n-1)\n l_rest = [4*q, 2*h, s]\n l.sort()\n l_rest.sort()\n if n > 1:\n print(int(l[0]+l_rest[0]))\n elif n == 1:\n print(l_rest[0])", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1571783197", "date2": "1571783572", "bleu_score": "0.8102982920554523", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 80, "total_score": 104, "input": "01100 0111 000 -5\n-6\n", "actual_output": "-26400\n", "expected_output": "15\n\n", "anno_code": ["q, h, s, d = map(int, input().split()) # (0): q=1100, h=111, s=0, d=-5\nn = int(input()) # (1): n=-6\n\nif n % 2 == 0: # (2): NO CHANGE\n l = [4*q*n, 2*h*n, s*n, d*n/2] # (3): l=[-26400, -1332, 0, 15.0]\n l.sort() # (4): NO CHANGE\n print(int(l[0]))\nelse:\n l = [4*q*(n-1), 2*h*(n-1), s*(n-1), d*(n-1)/2]\n l_rest = [4*q, 2*h, s]\n l.sort()\n l_rest.sort()\n print(int(l[0]+l_rest[0]))\n"], "anno_status": [true], "diff_content": " q, h, s, d = map(int, input().split())\n n = int(input())\n \n if n % 2 == 0:\n- l = [4*q*n, 2*h*n, s*n, d*n/2]\n+ l = [4*q*n, 2*h*n, s*n, d*(n\n l.sort()\n print(int(l[0]))\n else:\n- l = [4*q*(n-1), 2*h*(n-1), s*(n-1), d*(n-1)/2]\n+ l = [4*q*(n-1), 2*h*(n-1), s*(n-1), d*((n-1)\n l_rest = [4*q, 2*h, s]\n l.sort()\n l_rest.sort()\n- print(int(l[0]+l_rest[0]))\n-\n+ if n > 1:\n+ print(int(l[0]+l_rest[0]))\n+ elif n == 1:\n+ print(l_rest[0])\n", "FL_content": "\n q, h, s, d = map(int, input().split())\n n = int(input())\n \n-if n % 2 == 0:\n- l = [4*q*n, 2*h*n, s*n, d*n/2]\n- l.sort()\n- print(int(l[0]))\n else:\n- l = [4*q*(n-1), 2*h*(n-1), s*(n-1), d*(n-1)/2]\n- l_rest = [4*q, 2*h, s]\n- l.sort()\n- l_rest.sort()\n- print(int(l[0]+l_rest[0]))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u088337682", "problem_id": "p02420", "submission1_id": "s660259242-FL", "submission2_id": "s892620699", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n S = input()\n if S == \"-\":break\n m = int(input())\n sum = 0\n for i in range(m):sum+=int(input())\n if sum%len(S)==0:print(S)\n else:\n print(S[len(S)-sum%len(S)-1:]+S[:len(S)-sum%len(S)-1])\n", "code2": "while True:\n S = input()\n if S == \"-\":break\n m = int(input())\n sum = 0\n for i in range(m):sum+=int(input())\n if sum%len(S)==0:print(S)\n else:\n print(S[sum%len(S):]+S[:sum%len(S)])\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1545579311", "date2": "1545622715", "bleu_score": "0.8901200860814824", "code1_test_status": [1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1], "code1_test_score": 16, "total_score": 101, "input": "ca`a\n3\n1\n3\n2\nvwxyz\n2\n2\n4\n-\n", "actual_output": "a`ac\nyzvwx\n", "expected_output": "`aca\nwxyzv\n\n", "anno_code": ["while True: # (0): NO CHANGE (11): NO CHANGE (21): NO CHANGE\n S = input() # (1): S=ca`a (12): S=vwxyz (22): S=-\n if S == \"-\":break # (2): NO CHANGE (13): NO CHANGE\n m = int(input()) # (3): m=3 (14): m=2\n sum = 0 # (4): sum=0 (15): sum=0\n for i in range(m):sum+=int(input()) # (5): sum=1, i=0 (6): sum=4, i=1 ... (18): NO CHANGE\n if sum%len(S)==0:print(S) # (9): NO CHANGE (19): NO CHANGE\n else:\n print(S[len(S)-sum%len(S)-1:]+S[:len(S)-sum%len(S)-1]) # (10): NO CHANGE (20): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n S = input()\n if S == \"-\":break\n m = int(input())\n sum = 0\n for i in range(m):sum+=int(input())\n if sum%len(S)==0:print(S)\n else:\n- print(S[len(S)-sum%len(S)-1:]+S[:len(S)-sum%len(S)-1])\n+ print(S[sum%len(S):]+S[:sum%len(S)])\n \n", "FL_content": "\n while True:\n S = input()\n if S == \"-\":break\n m = int(input())\n sum = 0\n for i in range(m):sum+=int(input())\n- if sum%len(S)==0:print(S)\n else:\n- print(S[len(S)-sum%len(S)-1:]+S[:len(S)-sum%len(S)-1])\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u825528847", "problem_id": "p03338", "submission1_id": "s144551127-FL", "submission2_id": "s997227657", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nS = input()\nans = 0\nfor i in range(1, N):\n x, y = set(S[:i+1]), set(S[i:])\n cnt = 0\n for c in x:\n if c in y:\n cnt += 1\n ans = max(ans, cnt)\nprint(ans)\n", "code2": "N = int(input())\nS = input()\nans = 0\nfor i in range(1, N):\n x, y = set(S[:i]), set(S[i:])\n cnt = 0\n for c in x:\n if c in y:\n cnt += 1\n ans = max(ans, cnt)\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1528400998", "date2": "1528401101", "bleu_score": "0.9821643152834509", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 69, "total_score": 103, "input": "45\notyczfqfmgbjrfblyrtrupdiplldjktuzxhejykqthxmb\n", "actual_output": "12\n", "expected_output": "11\n\n", "anno_code": ["N = int(input()) # (0): N=45\nS = input() # (1): S=otyczfqfmgbjrfblyrtrupdiplldjktuzxhejykqthxmb\nans = 0 # (2): ans=0\nfor i in range(1, N): # (3): i=1 (13): i=2 ... (1824): NO CHANGE\n x, y = set(S[:i+1]), set(S[i:]) # (4): x={'t', 'o'}, y={'r', 'i', 'p', 'c', 'f', 'd', 'z', 't', 'g', 'j', 'u', 'l', 'k', 'h', 'y', 'b', 'x', 'm', 'q', 'e'} (14): x={'t', 'y', 'o'} ... (1777): y={'b'}\n cnt = 0 # (5): cnt=0 (15): cnt=0 ... (1778): cnt=0\n for c in x: # (6): c=t (9): c=o ... (1822): NO CHANGE\n if c in y: # (7): NO CHANGE (10): NO CHANGE ... (1821): NO CHANGE\n cnt += 1 # (8): cnt=1 (18): cnt=1 ... (1811): cnt=1\n ans = max(ans, cnt) # (12): ans=1 (25): ans=2 ... (1823): NO CHANGE\nprint(ans)\n"], "anno_status": [true], "diff_content": " N = int(input())\n S = input()\n ans = 0\n for i in range(1, N):\n- x, y = set(S[:i+1]), set(S[i:])\n+ x, y = set(S[:i]), set(S[i:])\n cnt = 0\n for c in x:\n if c in y:\n cnt += 1\n ans = max(ans, cnt)\n print(ans)\n \n", "FL_content": "\n N = int(input())\n S = input()\n ans = 0\n for i in range(1, N):\n x, y = set(S[:i+1]), set(S[i:])\n cnt = 0\n for c in x:\n if c in y:\n cnt += 1\n ans = max(ans, cnt)\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u366886346", "problem_id": "p03957", "submission1_id": "s229111696-FL", "submission2_id": "s953881804", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()\nc=0\nf=0\nfor i in range(len(s)):\n if s[i]==\"C\":\n if c==0:\n c=i+1\n if s[i]==\"F\":\n f=i+1\nif c= 0:\n x -= i\n ans += 1\n else:\n break\nprint(ans)", "code2": "n,x = map(int,input().split())\na = list(map(int,input().split()))\na.sort()\nans = 0\nif sum(a) == x:\n ans = n\nelif sum(a) < x:\n ans = n - 1\nelse:\n for i in range(n):\n if a[i] <= x:\n ans += 1\n x -= a[i]\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1551156223", "date2": "1551157118", "bleu_score": "0.6332989452981678", "code1_test_status": [0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0], "code1_test_score": 70, "total_score": 104, "input": "3 66\n20 30 9\n", "actual_output": "3\n", "expected_output": "2\n\n", "anno_code": ["n,x = map(int,input().split()) # (0): n=3, x=66\na = list(map(int,input().split())) # (1): a=[20, 30, 9]\na.sort() # (2): a=[9, 20, 30]\nans = 0 # (3): ans=0\nfor i in a: # (4): i=9 (8): i=20 ... (16): NO CHANGE\n if x - i >= 0: # (5): NO CHANGE (9): NO CHANGE (13): NO CHANGE\n x -= i # (6): x=57 (10): x=37 (14): x=7\n ans += 1 # (7): ans=1 (11): ans=2 (15): ans=3\n else:\n break\nprint(ans)"], "anno_status": [true], "diff_content": " n,x = map(int,input().split())\n a = list(map(int,input().split()))\n a.sort()\n ans = 0\n-for i in a:\n- if x - i >= 0:\n- x -= i\n- ans += 1\n- else:\n- break\n+if sum(a) == x:\n+ ans = n\n+elif sum(a) < x:\n+ ans = n - 1\n+else:\n+ for i in range(n):\n+ if a[i] <= x:\n+ ans += 1\n+ x -= a[i]\n print(ans)\n+\n", "FL_content": "\n n,x = map(int,input().split())\n a = list(map(int,input().split()))\n a.sort()\n ans = 0\n for i in a:\n if x - i >= 0:\n x -= i\n ans += 1\n else:\n break\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u140251125", "problem_id": "p03556", "submission1_id": "s690132614-FL", "submission2_id": "s280822688", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nN = int(input())\n\ni = 1\n\nwhile i ** 2 <= N:\n i += 1\n\nprint(i ** 2)", "code2": "\nN = int(input())\n\ni = 1\n\nwhile i ** 2 <= N:\n i += 1\n\nprint((i - 1) ** 2)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1528335934", "date2": "1528335982", "bleu_score": "0.8986706229119412", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 83, "input": "85859\n", "actual_output": "86436\n", "expected_output": "85849\n\n", "anno_code": ["\nN = int(input()) # (0): N=85859\n\ni = 1 # (1): i=1\n\nwhile i ** 2 <= N: # (2): NO CHANGE (4): NO CHANGE ... (588): NO CHANGE\n i += 1 # (3): i=2 (5): i=3 ... (587): i=294\n\nprint(i ** 2)"], "anno_status": [true], "diff_content": " \n N = int(input())\n \n i = 1\n \n while i ** 2 <= N:\n i += 1\n \n-print(i ** 2)\n+print((i - 1) ** 2)\n", "FL_content": "\n \n N = int(input())\n \n i = 1\n \n-while i ** 2 <= N:\n i += 1\n \n print(i ** 2)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u860702592", "problem_id": "p02595", "submission1_id": "s521229763-FL", "submission2_id": "s951115219", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,d = map(int,input().split())\ncount = 0\nfor _ in range(n):\n x, y = map(int,input().split())\n if (x**2 + y**2)**(0.5) >= d:\n count += 1\n\nprint(count)", "code2": "n,d = map(int,input().split())\ncount = 0\nfor _ in range(n):\n x, y = map(int,input().split())\n if (x**2 + y**2)**(0.5) <= d:\n count += 1\n\nprint(count)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596657081", "date2": "1596657226", "bleu_score": "0.9843489635453336", "code1_test_status": [0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0], "code1_test_score": 12, "total_score": 103, "input": "12 2\n0 1\n2 2\n1 1\n1 2\n0 2\n0 4\n2 1\n2 0\n2 0\n3 1\n3 2\n1 3\n", "actual_output": "10\n", "expected_output": "5\n\n", "anno_code": ["n,d = map(int,input().split()) # (0): n=12, d=2\ncount = 0 # (1): count=0\nfor _ in range(n): # (2): _=0 (5): _=1 ... (48): NO CHANGE\n x, y = map(int,input().split()) # (3): x=0, y=1 (6): x=2, y=2 ... (45): x=1, y=3\n if (x**2 + y**2)**(0.5) >= d: # (4): NO CHANGE (7): NO CHANGE ... (46): NO CHANGE\n count += 1 # (8): count=1 (15): count=2 ... (47): count=10\n\nprint(count)"], "anno_status": [true], "diff_content": " n,d = map(int,input().split())\n count = 0\n for _ in range(n):\n x, y = map(int,input().split())\n- if (x**2 + y**2)**(0.5) >= d:\n+ if (x**2 + y**2)**(0.5) <= d:\n count += 1\n \n print(count)\n", "FL_content": "\n n,d = map(int,input().split())\n count = 0\n for _ in range(n):\n x, y = map(int,input().split())\n- if (x**2 + y**2)**(0.5) >= d:\n count += 1\n \n print(count)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u410118019", "problem_id": "p03164", "submission1_id": "s390773354-FL", "submission2_id": "s578271857", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,W = map(int,input().split())\ndp = [[10**12] * (10**5+1) for i in range(n+1)]\ndp[0][0] = 0\nma = 0\nfor i in range(1,n+1):\n w,v = map(int,input().split())\n ma += v\n for j in range(v,ma+1):\n dp[i][j] = min(dp[i-1][j-v]+w,dp[i-1][j])\nm = 0\nfor i in range(ma+1):\n if dp[-1][i] <= W:\n m = i\nprint(m)", "code2": "n,W = map(int,input().split())\ndp = [[10**12] * (10**5+1) for i in range(n+1)]\ndp[0][0] = 0\nma = 0\nfor i in range(1,n+1):\n w,v = map(int,input().split())\n ma += v\n for j in range(v):\n dp[i][j] = dp[i-1][j]\n for j in range(v,ma+1):\n dp[i][j] = min(dp[i-1][j-v]+w,dp[i-1][j])\nm = 0\nfor i in range(ma+1):\n if dp[-1][i] <= W:\n m = i\nprint(m)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1572036890", "date2": "1572037220", "bleu_score": "0.8655206914478428", "code1_test_status": [1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0], "code1_test_score": 59, "total_score": 103, "input": "3 8\n3 30\n4 35\n5 60\n", "actual_output": "65\n", "expected_output": "90\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n,W = map(int,input().split())\n dp = [[10**12] * (10**5+1) for i in range(n+1)]\n dp[0][0] = 0\n ma = 0\n for i in range(1,n+1):\n w,v = map(int,input().split())\n ma += v\n+ for j in range(v):\n+ dp[i][j] = dp[i-1][j]\n for j in range(v,ma+1):\n dp[i][j] = min(dp[i-1][j-v]+w,dp[i-1][j])\n m = 0\n for i in range(ma+1):\n if dp[-1][i] <= W:\n m = i\n print(m)\n", "FL_content": "\n n,W = map(int,input().split())\n dp = [[10**12] * (10**5+1) for i in range(n+1)]\n dp[0][0] = 0\n ma = 0\n for i in range(1,n+1):\n w,v = map(int,input().split())\n ma += v\n- for j in range(v,ma+1):\n dp[i][j] = min(dp[i-1][j-v]+w,dp[i-1][j])\n m = 0\n for i in range(ma+1):\n if dp[-1][i] <= W:\n m = i\n print(m)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u535719732", "problem_id": "p02396", "submission1_id": "s236539006-FL", "submission2_id": "s510513650", "status1": "Wrong Answer", "status2": "Accepted", "code1": "list = []\nwhile True:\n if(int(input()) == 0): break\n else: list.append(int(input()))\n \n\nfor i in range(len(list)):\n print(\"Case %d: %d\" %(i,list[i]))\n", "code2": "list = []\nwhile True:\n a = int(input())\n if(a == 0): break\n else: list.append(a)\n \n\nfor i in range(len(list)):\n print(\"Case %d: %d\" %(i+1,list[i]))\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1559194386", "date2": "1559195299", "bleu_score": "0.8848959372584251", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3\n4\n11\n7\n2\n34\n0\n", "actual_output": "Case 0: 4\nCase 1: 7\nCase 2: 34\n", "expected_output": "Case 1: 3\nCase 2: 4\nCase 3: 11\nCase 4: 7\nCase 5: 2\nCase 6: 34\n\n", "anno_code": ["list = [] # (0): list=[]\nwhile True: # (1): NO CHANGE (4): NO CHANGE ... (10): NO CHANGE\n if(int(input()) == 0): break # (2): NO CHANGE (5): NO CHANGE ... (11): NO CHANGE\n else: list.append(int(input())) # (3): list=[4] (6): list=[4, 7] (9): list=[4, 7, 34]\n \n\nfor i in range(len(list)): # (12): i=0 (14): i=1 (16): i=2\n print(\"Case %d: %d\" %(i,list[i])) # (13): NO CHANGE (15): NO CHANGE (17): NO CHANGE\n"], "anno_status": [true], "diff_content": " list = []\n while True:\n- if(int(input()) == 0): break\n- else: list.append(int(input()))\n+ a = int(input())\n+ if(a == 0): break\n+ else: list.append(a)\n \n \n for i in range(len(list)):\n- print(\"Case %d: %d\" %(i,list[i]))\n+ print(\"Case %d: %d\" %(i+1,list[i]))\n \n", "FL_content": "\n list = []\n while True:\n if(int(input()) == 0): break\n else: list.append(int(input()))\n \n \n for i in range(len(list)):\n- print(\"Case %d: %d\" %(i,list[i]))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u507611905", "problem_id": "p03505", "submission1_id": "s502070222-FL", "submission2_id": "s353423691", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\nfrom decimal import *\n\nnumbers = [int(i) for i in input().split()]\n\ndiff = numbers[1] - numbers[2]\n\nif diff <= 0:\n print(\"-1\")\nelif numbers[0] <= numbers[1]:\n print(\"1\")\nelse:\n rating = 0\n count = 0\n print(math.ceil(Decimal(numbers[0] - numbers[1]) / diff) * 2 + 1)", "code2": "import math\nfrom decimal import *\n\nnumbers = [int(i) for i in input().split()]\n\ndiff = numbers[1] - numbers[2]\n\nif numbers[0] <= numbers[1]:\n print(\"1\")\nelif diff <= 0:\n print(\"-1\")\nelse:\n print(math.ceil(Decimal(numbers[0] - numbers[1]) / diff) * 2 + 1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1512590846", "date2": "1512591699", "bleu_score": "0.8955957320836455", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "31 144 600\n", "actual_output": "-1\n", "expected_output": "1\n\n", "anno_code": ["import math\nfrom decimal import *\n\nnumbers = [int(i) for i in input().split()] # (0): numbers=[31, 144, 600]\n\ndiff = numbers[1] - numbers[2] # (1): diff=-456\n\nif diff <= 0: # (2): NO CHANGE\n print(\"-1\")\nelif numbers[0] <= numbers[1]:\n print(\"1\")\nelse:\n rating = 0\n count = 0\n print(math.ceil(Decimal(numbers[0] - numbers[1]) / diff) * 2 + 1)"], "anno_status": [true], "diff_content": " import math\n from decimal import *\n \n numbers = [int(i) for i in input().split()]\n \n diff = numbers[1] - numbers[2]\n \n-if diff <= 0:\n- print(\"-1\")\n-elif numbers[0] <= numbers[1]:\n+if numbers[0] <= numbers[1]:\n print(\"1\")\n+elif diff <= 0:\n+ print(\"-1\")\n else:\n- rating = 0\n- count = 0\n print(math.ceil(Decimal(numbers[0] - numbers[1]) / diff) * 2 + 1)\n", "FL_content": "\n import math\n from decimal import *\n \n numbers = [int(i) for i in input().split()]\n \n diff = numbers[1] - numbers[2]\n \n if diff <= 0:\n print(\"-1\")\n-elif numbers[0] <= numbers[1]:\n- print(\"1\")\n else:\n rating = 0\n count = 0\n- print(math.ceil(Decimal(numbers[0] - numbers[1]) / diff) * 2 + 1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u439009525", "problem_id": "p03086", "submission1_id": "s882222990-FL", "submission2_id": "s997963485", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nans = 0\ncnt = 0\nfor s in S:\n if (s in 'ATCG'):\n cnt += 1\n else:\n ans = max(ans, cnt)\n cnt = 0\nprint(ans)\n", "code2": "S = input()\nans = 0\ncnt = 0\nfor s in S:\n if (s in 'ATCG'):\n cnt += 1\n else:\n ans = max(ans, cnt)\n cnt = 0\nprint(max(ans, cnt))\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1571658186", "date2": "1571658262", "bleu_score": "0.9211670167507197", "code1_test_status": [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "JUKVNIHT\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["S = input() # (0): S=JUKVNIHT\nans = 0 # (1): ans=0\ncnt = 0 # (2): cnt=0\nfor s in S: # (3): s=J (7): s=U ... (34): NO CHANGE\n if (s in 'ATCG'): # (4): NO CHANGE (8): NO CHANGE ... (32): NO CHANGE\n cnt += 1 # (33): cnt=1\n else:\n ans = max(ans, cnt) # (5): NO CHANGE (9): NO CHANGE ... (29): NO CHANGE\n cnt = 0 # (6): NO CHANGE (10): NO CHANGE ... (30): NO CHANGE\nprint(ans)\n"], "anno_status": [true], "diff_content": " S = input()\n ans = 0\n cnt = 0\n for s in S:\n if (s in 'ATCG'):\n cnt += 1\n else:\n ans = max(ans, cnt)\n cnt = 0\n-print(ans)\n+print(max(ans, cnt))\n \n", "FL_content": "\n S = input()\n ans = 0\n cnt = 0\n for s in S:\n- if (s in 'ATCG'):\n cnt += 1\n else:\n ans = max(ans, cnt)\n cnt = 0\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u268210555", "problem_id": "p03363", "submission1_id": "s740876841-FL", "submission2_id": "s266466411", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import *\nfrom itertools import *\nn = int(input())\na = list(map(int, input().split()))\nb = list(accumulate(a))\nc = Counter(b)\nr = 0\nfor i in range(n):\n c[b[i]] -= 1\n r += c[b[i]-a[i]]\nprint(r)", "code2": "from collections import *\nfrom itertools import *\nn = int(input())\na = list(map(int, input().split()))\nb = list(accumulate(a))\nc = Counter(b)\nr = 0\nfor i in range(n):\n r += c[b[i]-a[i]]\n c[b[i]] -= 1\nprint(r)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1525007808", "date2": "1525012045", "bleu_score": "0.9928710116167552", "code1_test_status": [0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1], "code1_test_score": 26, "total_score": 103, "input": "7\n0 -1 1 -4 -1 0 -3\n", "actual_output": "2\n", "expected_output": "4\n\n", "anno_code": ["from collections import *\nfrom itertools import *\nn = int(input()) # (0): n=7\na = list(map(int, input().split())) # (1): a=[0, -1, 1, -4, -1, 0, -3]\nb = list(accumulate(a)) # (2): b=[0, -1, 0, -4, -5, -5, -8]\nc = Counter(b) # (3): c=Counter({0: 2, -5: 2, -1: 1, -4: 1, -8: 1})\nr = 0 # (4): r=0\nfor i in range(n): # (5): i=0 (8): i=1 ... (26): NO CHANGE\n c[b[i]] -= 1 # (6): c=Counter({-5: 2, 0: 1, -1: 1, -4: 1, -8: 1}) (9): c=Counter({-5: 2, 0: 1, -4: 1, -8: 1, -1: 0}) ... (24): c=Counter({0: 0, -1: 0, -4: 0, -5: 0, -8: 0})\n r += c[b[i]-a[i]] # (7): r=1 (10): r=2 ... (25): NO CHANGE\nprint(r)"], "anno_status": [true], "diff_content": " from collections import *\n from itertools import *\n n = int(input())\n a = list(map(int, input().split()))\n b = list(accumulate(a))\n c = Counter(b)\n r = 0\n for i in range(n):\n- c[b[i]] -= 1\n r += c[b[i]-a[i]]\n+ c[b[i]] -= 1\n print(r)\n", "FL_content": "\n from collections import *\n from itertools import *\n n = int(input())\n a = list(map(int, input().split()))\n b = list(accumulate(a))\n c = Counter(b)\n r = 0\n for i in range(n):\n c[b[i]] -= 1\n r += c[b[i]-a[i]]\n print(r)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u763550415", "problem_id": "p02549", "submission1_id": "s296378125-FL", "submission2_id": "s058759485", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, K = map(int, input().split())\n\nL = []\nR = []\n\nfor _ in range(K):\n l, r = map(int, input().split())\n L.append(l)\n R.append(r)\n \ndp = [0]*(N+5)\ndp[1] = 1\n\nfor i in range(2, N+1):\n dp[i] = dp[i-1]\n for j in range(K):\n if i-L[j] >= 0:\n dp[i] += dp[i-L[j]]\n if i-R[j]-1 >= 0:\n dp[i] -= dp[i-R[j]-1]\n dp[i] %= 998244353\n \nprint(dp[N]-dp[N-1])", "code2": "N, K = map(int, input().split())\n\nL = []\nR = []\n\nfor _ in range(K):\n l, r = map(int, input().split())\n L.append(l)\n R.append(r)\n \ndp = [0]*(N+5)\ndp[1] = 1\n\nfor i in range(2, N+1):\n dp[i] = dp[i-1]\n for j in range(K):\n if i-L[j] >= 0:\n dp[i] += dp[i-L[j]]\n if i-R[j]-1 >= 0:\n dp[i] -= dp[i-R[j]-1]\n dp[i] %= 998244353\n \nprint((dp[N]-dp[N-1])%998244353)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600583813", "date2": "1600583902", "bleu_score": "0.9662159996377548", "code1_test_status": [1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 81, "total_score": 102, "input": "93 3\n4 4\n3 4\n1 5\n", "actual_output": "-243342204\n", "expected_output": "754902149\n\n", "anno_code": ["N, K = map(int, input().split()) # (0): N=93, K=3\n\nL = [] # (1): L=[]\nR = [] # (2): R=[]\n\nfor _ in range(K): # (3): _=0 (7): _=1 ... (15): NO CHANGE\n l, r = map(int, input().split()) # (4): l=4, r=4 (8): l=3 (12): l=1, r=5\n L.append(l) # (5): L=[4] (9): L=[4, 3] (13): L=[4, 3, 1]\n R.append(r) # (6): R=[4] (10): R=[4, 4] (14): R=[4, 4, 5]\n \ndp = [0]*(N+5) # (16): dp=[0, 0, ..., 0, 0]\ndp[1] = 1 # (17): dp=[0, 1, ..., 0, 0]\n\nfor i in range(2, N+1): # (18): i=2 (34): i=3 ... (1937): NO CHANGE\n dp[i] = dp[i-1] # (19): dp=[0, 1, ..., 0, 0] (35): dp=[0, 1, ..., 0, 0] ... (1917): dp=[0, 1, ..., 0, 0]\n for j in range(K): # (20): j=0 (24): j=1 ... (1936): NO CHANGE\n if i-L[j] >= 0: # (21): NO CHANGE (25): NO CHANGE ... (1931): NO CHANGE\n dp[i] += dp[i-L[j]] # (30): dp=[0, 1, ..., 0, 0] (42): NO CHANGE ... (1932): dp=[0, 1, ..., 0, 0]\n if i-R[j]-1 >= 0: # (22): NO CHANGE (26): NO CHANGE ... (1933): NO CHANGE\n dp[i] -= dp[i-R[j]-1] # (75): NO CHANGE (81): NO CHANGE ... (1934): dp=[0, 1, ..., 0, 0]\n dp[i] %= 998244353 # (23): NO CHANGE (27): NO CHANGE ... (1935): NO CHANGE\n \nprint(dp[N]-dp[N-1])"], "anno_status": [true], "diff_content": " N, K = map(int, input().split())\n \n L = []\n R = []\n \n for _ in range(K):\n l, r = map(int, input().split())\n L.append(l)\n R.append(r)\n \n dp = [0]*(N+5)\n dp[1] = 1\n \n for i in range(2, N+1):\n dp[i] = dp[i-1]\n for j in range(K):\n if i-L[j] >= 0:\n dp[i] += dp[i-L[j]]\n if i-R[j]-1 >= 0:\n dp[i] -= dp[i-R[j]-1]\n dp[i] %= 998244353\n \n-print(dp[N]-dp[N-1])\n+print((dp[N]-dp[N-1])%998244353)\n", "FL_content": "\n N, K = map(int, input().split())\n \n L = []\n R = []\n \n for _ in range(K):\n l, r = map(int, input().split())\n L.append(l)\n R.append(r)\n \n dp = [0]*(N+5)\n dp[1] = 1\n \n for i in range(2, N+1):\n dp[i] = dp[i-1]\n for j in range(K):\n if i-L[j] >= 0:\n dp[i] += dp[i-L[j]]\n if i-R[j]-1 >= 0:\n dp[i] -= dp[i-R[j]-1]\n dp[i] %= 998244353\n \n-print(dp[N]-dp[N-1])\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 23 }, { "user_id": "u919521780", "problem_id": "p03556", "submission1_id": "s559398377-FL", "submission2_id": "s949508386", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nans = 0\n\nwhile True:\n\tif ans * ans >= n:\n\t\tbreak\n\tans += 1\n\t\nprint(ans*ans)\n\t", "code2": "n = int(input())\nans = 0\n\nwhile True:\n\tif ans * ans > n:\n\t\tbreak\n\tans += 1\n\t\nprint((ans-1)*(ans-1))\n\t", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1542063706", "date2": "1542063845", "bleu_score": "0.8575094561872634", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 83, "input": "385753315\n", "actual_output": "385768881\n", "expected_output": "385729600\n\n", "anno_code": ["n = int(input()) # (0): n=385753315\nans = 0 # (1): ans=0\n\nwhile True: # (2): NO CHANGE (5): NO CHANGE ... (58925): NO CHANGE\n\tif ans * ans >= n: # (3): NO CHANGE (6): NO CHANGE ... (58926): NO CHANGE\n\t\tbreak # (58927): NO CHANGE\n\tans += 1 # (4): ans=1 (7): ans=2 ... (58924): ans=19641\n\t\nprint(ans*ans)\n\t"], "anno_status": [true], "diff_content": " n = int(input())\n ans = 0\n \n while True:\n-\tif ans * ans >= n:\n+\tif ans * ans > n:\n \t\tbreak\n \tans += 1\n \t\n-print(ans*ans)\n+print((ans-1)*(ans-1))\n \t\n", "FL_content": "\n n = int(input())\n ans = 0\n \n while True:\n-\tif ans * ans >= n:\n \t\tbreak\n \tans += 1\n \t\n print(ans*ans)\n \t\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u181431922", "problem_id": "p03957", "submission1_id": "s361774488-FL", "submission2_id": "s825248107", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\na = s.find('C')\n\nif a == -1:\n print(\"No\")\nelse:\n if s[a:].find('F') == -1:\n print(\"Yes\")", "code2": "s = input()\na = s.find('C')\n\nif a == -1:\n print(\"No\")\nelse:\n if s[a:].find('F') == -1:\n print(\"No\")\n else: print(\"Yes\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1546481525", "date2": "1546481950", "bleu_score": "0.8351932923957912", "code1_test_status": [0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0], "code1_test_score": 57, "total_score": 103, "input": "FCD\n", "actual_output": "Yes\n", "expected_output": "No\n\n", "anno_code": ["s = input() # (0): s=FCD\na = s.find('C') # (1): a=1\n\nif a == -1: # (2): NO CHANGE\n print(\"No\")\nelse:\n if s[a:].find('F') == -1: # (3): NO CHANGE\n print(\"Yes\")"], "anno_status": [true], "diff_content": " s = input()\n a = s.find('C')\n \n if a == -1:\n print(\"No\")\n else:\n if s[a:].find('F') == -1:\n- print(\"Yes\")\n+ print(\"No\")\n+ else: print(\"Yes\")\n", "FL_content": "\n s = input()\n a = s.find('C')\n \n if a == -1:\n print(\"No\")\n else:\n- if s[a:].find('F') == -1:\n- print(\"Yes\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u653041271", "problem_id": "p02537", "submission1_id": "s090588966-FL", "submission2_id": "s385750415", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys, bisect, math, itertools, string, queue, copy\n\n\n\n\n\n\n\nmod = 10**9+7\ndef inp(): return int(input())\ndef inpm(): return map(int,input().split())\ndef inpl(): return list(map(int, input().split()))\ndef inpls(): return list(input().split())\ndef inplm(n): return list(int(input()) for _ in range(n))\ndef inplL(n): return [list(input()) for _ in range(n)]\ndef inplT(n): return [tuple(input()) for _ in range(n)]\ndef inpll(n): return [list(map(int, input().split())) for _ in range(n)]\ndef inplt(n): return [tuple(map(int, input().split())) for _ in range(n)]\ndef inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])\n\n\ndef segfunc(x, y):\n return max(x,y)\n\n\n\nide_ele = 0\n\n\nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n\n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n\n def query(self, l, r):\n \n res = self.ide_ele\n\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\nn,k = inpm()\nA = inplm(n)\n\nseg = SegTree([0]*300001, segfunc, ide_ele)\n\nfor a in A:\n seg.update(a-1,seg.query(max(0,a-k-1),min(300001,a+k)) + 1)\n\nprint(seg.query(0,n))", "code2": "import sys, bisect, math, itertools, string, queue, copy\n\n\n\n\n\n\n\nmod = 10**9+7\ndef inp(): return int(input())\ndef inpm(): return map(int,input().split())\ndef inpl(): return list(map(int, input().split()))\ndef inpls(): return list(input().split())\ndef inplm(n): return list(int(input()) for _ in range(n))\ndef inplL(n): return [list(input()) for _ in range(n)]\ndef inplT(n): return [tuple(input()) for _ in range(n)]\ndef inpll(n): return [list(map(int, input().split())) for _ in range(n)]\ndef inplt(n): return [tuple(map(int, input().split())) for _ in range(n)]\ndef inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])\n\n\ndef segfunc(x, y):\n return max(x,y)\n\n\n\nide_ele = 0\n\n\nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n\n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n\n def query(self, l, r):\n \n res = self.ide_ele\n\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\nn,k = inpm()\nA = inplm(n)\n\nseg = SegTree([0]*300001, segfunc, ide_ele)\n\nfor a in A:\n seg.update(a,seg.query(max(0,a-k),min(300001,a+k+1)) + 1)\n\nprint(seg.query(0,300001))", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601444628", "date2": "1601445502", "bleu_score": "0.9933698813974005", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 81, "total_score": 101, "input": "10 3\n0\n1\n4\n0\n6\n6\n9\n7\n4\n4\n", "actual_output": "8\n", "expected_output": "9\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " import sys, bisect, math, itertools, string, queue, copy\n \n \n \n \n \n \n \n mod = 10**9+7\n def inp(): return int(input())\n def inpm(): return map(int,input().split())\n def inpl(): return list(map(int, input().split()))\n def inpls(): return list(input().split())\n def inplm(n): return list(int(input()) for _ in range(n))\n def inplL(n): return [list(input()) for _ in range(n)]\n def inplT(n): return [tuple(input()) for _ in range(n)]\n def inpll(n): return [list(map(int, input().split())) for _ in range(n)]\n def inplt(n): return [tuple(map(int, input().split())) for _ in range(n)]\n def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])\n \n \n def segfunc(x, y):\n return max(x,y)\n \n \n \n ide_ele = 0\n \n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n n,k = inpm()\n A = inplm(n)\n \n seg = SegTree([0]*300001, segfunc, ide_ele)\n \n for a in A:\n- seg.update(a-1,seg.query(max(0,a-k-1),min(300001,a+k)) + 1)\n+ seg.update(a,seg.query(max(0,a-k),min(300001,a+k+1)) + 1)\n \n-print(seg.query(0,n))\n+print(seg.query(0,300001))\n", "FL_content": "\n import sys, bisect, math, itertools, string, queue, copy\n \n \n \n \n \n \n \n mod = 10**9+7\n def inp(): return int(input())\n def inpm(): return map(int,input().split())\n def inpl(): return list(map(int, input().split()))\n def inpls(): return list(input().split())\n def inplm(n): return list(int(input()) for _ in range(n))\n def inplL(n): return list(map(int, input().split()))\n def inplT(n): return [tuple(input()) for _ in range(n)]\n def inpll(n): return [list(map(int, input().split())) for _ in range(n)]\n def inplt(n): return [tuple(map(int, input().split())) for _ in range(n)]\n def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])\n \n \n def segfunc(x, y):\n return max(x,y)\n \n \n \n ide_ele = 0\n \n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n n,k = inpm()\n A = inplm(n)\n \n seg = SegTree([0]*300001, segfunc, ide_ele)\n \n for a in A:\n seg.update(a-1,seg.query(max(0,a-k-1),min(300001,a+k)) + 1)\n \n-print(seg.query(0,n))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 78 }, { "user_id": "u218843509", "problem_id": "p03880", "submission1_id": "s195349635-FL", "submission2_id": "s308005181", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = [int(input()) for _ in range(n)]\ngr = 0\nfor x in a:\n\tgr ^= x\nexist = set()\nfor i in range(n):\n\tcnt = 0\n\twhile (a[i]>>cnt)&1 == 0:\n\t\tcnt += 1\n\texist.add(cnt)\nok = True\nans = 0\nfor i in range(35, -1, -1):\n\tif (gr>>i)&1:\n\t\tif i not in exist:\n\t\t\tok = False\n\t\telse:\n\t\t\tgr %= (1<<(i+1))\n\t\t\tgr = (1<<(i+1)) - gr\n\t\t\tans += 1\n\telse:\n\t\tgr %= (1<<(i+1))\nif ok:\n\tprint(ans)\nelse:\n\tprint(-1)", "code2": "n = int(input())\na = [int(input()) for _ in range(n)]\ngr = 0\nfor x in a:\n\tgr ^= x\nexist = set()\nfor i in range(n):\n\tcnt = 0\n\twhile (a[i]>>cnt)&1 == 0:\n\t\tcnt += 1\n\texist.add(cnt)\nok = True\nans = 0\nfor i in range(35, -1, -1):\n\tif (gr>>i)&1:\n\t\tif i not in exist:\n\t\t\tok = False\n\t\telse:\n\t\t\tgr %= (1<<(i+1))\n\t\t\tgr = (1<<(i+1)) - gr - 1\n\t\t\tans += 1\n\telse:\n\t\tgr %= (1<<(i+1))\nif ok:\n\tprint(ans)\nelse:\n\tprint(-1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563858600", "date2": "1563858706", "bleu_score": "0.9862894696901123", "code1_test_status": [0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 77, "total_score": 89, "input": "3\n2\n3\n3\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["n = int(input()) # (0): n=3\na = [int(input()) for _ in range(n)] # (1): a=[2, 3, 3]\ngr = 0 # (2): gr=0\nfor x in a: # (3): x=2 (5): x=3 ... (9): NO CHANGE\n\tgr ^= x # (4): gr=2 (6): gr=1 (8): gr=2\nexist = set() # (10): exist=set()\nfor i in range(n): # (11): i=0 (17): i=1 ... (25): NO CHANGE\n\tcnt = 0 # (12): cnt=0 (18): cnt=0 (22): NO CHANGE\n\twhile (a[i]>>cnt)&1 == 0: # (13): NO CHANGE (15): NO CHANGE ... (23): NO CHANGE\n\t\tcnt += 1 # (14): cnt=1\n\texist.add(cnt) # (16): exist={1} (20): exist={0, 1} (24): NO CHANGE\nok = True # (26): ok=True\nans = 0 # (27): ans=0\nfor i in range(35, -1, -1): # (28): i=35 (31): i=34 ... (139): NO CHANGE\n\tif (gr>>i)&1: # (29): NO CHANGE (32): NO CHANGE ... (137): NO CHANGE\n\t\tif i not in exist: # (132): NO CHANGE\n\t\t\tok = False\n\t\telse:\n\t\t\tgr %= (1<<(i+1)) # (133): NO CHANGE\n\t\t\tgr = (1<<(i+1)) - gr # (134): NO CHANGE\n\t\t\tans += 1 # (135): ans=1\n\telse:\n\t\tgr %= (1<<(i+1)) # (30): NO CHANGE (33): NO CHANGE ... (138): gr=0\nif ok: # (140): NO CHANGE\n\tprint(ans)\nelse:\n\tprint(-1)"], "anno_status": [true], "diff_content": " n = int(input())\n a = [int(input()) for _ in range(n)]\n gr = 0\n for x in a:\n \tgr ^= x\n exist = set()\n for i in range(n):\n \tcnt = 0\n \twhile (a[i]>>cnt)&1 == 0:\n \t\tcnt += 1\n \texist.add(cnt)\n ok = True\n ans = 0\n for i in range(35, -1, -1):\n \tif (gr>>i)&1:\n \t\tif i not in exist:\n \t\t\tok = False\n \t\telse:\n \t\t\tgr %= (1<<(i+1))\n-\t\t\tgr = (1<<(i+1)) - gr\n+\t\t\tgr = (1<<(i+1)) - gr - 1\n \t\t\tans += 1\n \telse:\n \t\tgr %= (1<<(i+1))\n if ok:\n \tprint(ans)\n else:\n \tprint(-1)\n", "FL_content": "\n n = int(input())\n a = [int(input()) for _ in range(n)]\n gr = 0\n for x in a:\n \tgr ^= x\n exist = set()\n for i in range(n):\n \tcnt = 0\n \twhile (a[i]>>cnt)&1 == 0:\n \t\tcnt += 1\n \texist.add(cnt)\n ok = True\n ans = 0\n for i in range(35, -1, -1):\n \tif (gr>>i)&1:\n \t\tif i not in exist:\n \t\t\tok = False\n \t\telse:\n \t\t\tgr %= (1<<(i+1))\n \t\t\tgr = (1<<(i+1)) - gr\n \t\t\tans += 1\n \telse:\n \t\tgr %= (1<<(i+1))\n if ok:\n \tprint(ans)\n else:\n \tprint(-1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u842689614", "problem_id": "p04014", "submission1_id": "s888394153-FL", "submission2_id": "s079261653", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\ns=int(input())\n\nb_ans=1\n\n\n\nif n==s:\n b_ans=n+1\nif b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\n\nif b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n\n if b.is_integer():\n b_ans=int(b)\n break\n\nif b_ans!=1:\n print(b_ans)\nelse:\n print(-1)", "code2": "n=int(input())\ns=int(input())\n\nb_ans=1\n\n\n\nif n==s:\n b_ans=n+1\nif b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n\nif b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n\n if b.is_integer() and 0<=s-pn**0.5:\n b_ans=int(b)\n break\n\nif b_ans!=1:\n print(b_ans)\nelse:\n print(-1)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566169737", "date2": "1566170554", "bleu_score": "0.9356733828404437", "code1_test_status": [1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 71, "total_score": 105, "input": "31415926535\n3\n", "actual_output": "7853981634\n", "expected_output": "15707963267\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " n=int(input())\n s=int(input())\n \n b_ans=1\n \n \n \n if n==s:\n b_ans=n+1\n if b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n-\n if b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n \n- if b.is_integer():\n+ if b.is_integer() and 0<=s-pn**0.5:\n b_ans=int(b)\n break\n \n if b_ans!=1:\n print(b_ans)\n else:\n print(-1)\n", "FL_content": "\n n=int(input())\n s=int(input())\n \n b_ans=1\n \n \n \n if n==s:\n b_ans=n+1\n if b_ans==1:\n for b in range(2,int(n**0.5)+1):\n nn=n\n st=[]\n while(nn>0):\n st.append(nn%b)\n nn=(nn-st[-1])/b\n \n if sum(st)==s:\n b_ans=b\n break\n \n \n if b_ans==1:\n for p in range(int(n**0.5),0,-1):\n b=(n-s+p)/p\n \n if b.is_integer():\n b_ans=int(b)\n break\n \n if b_ans!=1:\n print(b_ans)\n else:\n print(-1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 34 }, { "user_id": "u052499405", "problem_id": "p02589", "submission1_id": "s515862916-FL", "submission2_id": "s381614935", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\ninput = sys.stdin.readline\n\nclass RollingHash():\n def __init__(self, s):\n length = len(s)\n base = 1009\n self.mod = (1 << 61) - 1\n self.hash = [0] * (length + 2)\n self.pow = [1] * (length + 2)\n\n for i in range(length):\n self.hash[i+1] = (self.hash[i] + s[i]) * base % self.mod\n self.pow[i+1] = self.pow[i] * base % self.mod\n self.pow[length+1] = self.pow[length] * base % self.mod \n\n def get(self, l, r):\n t = self.hash[r] - self.hash[l] * self.pow[r-l] % self.mod\n return t % self.mod\n\nss = []\norda = ord(\"a\")\nn = int(input())\nfor _ in range(n):\n ss.append([ord(item) - orda for item in input().rstrip()])\nss.sort(key=lambda x: len(x), reverse=True)\n\nwords = dict()\nans = 0\nfor s in ss:\n word_len = len(s)\n s_rev = s[::-1]\n RH = RollingHash(s_rev)\n rh = RH.get(0, word_len-1)\n if rh in words:\n ans += words[rh][s_rev[-1]]\n initial = set()\n for i, ch in enumerate(s):\n initial.add(ch)\n for key in initial:\n rh = RH.get(0, word_len-i-1)\n if rh in words:\n words[rh][key] += 1\n else:\n words[rh] = [0] * 26\n words[rh][key] += 1\nprint(ans)", "code2": "\nimport sys\ninput = sys.stdin.readline\nfrom collections import defaultdict\n\ndef empty_list():\n return [0] * 26\n\nclass RollingHash():\n def __init__(self, s):\n length = len(s)\n base = 1009\n \n self.mod = 67280421310721\n self.hash = [0] * (length + 2)\n self.pow = [1] * (length + 2)\n\n for i in range(length):\n self.hash[i+1] = (self.hash[i] + s[i]) * base % self.mod\n self.pow[i+1] = self.pow[i] * base % self.mod\n self.pow[length+1] = self.pow[length] * base % self.mod \n\n def get(self, l, r):\n t = self.hash[r] - self.hash[l] * self.pow[r-l] % self.mod\n return t % self.mod\n\nss = []\nn = int(input())\nfor _ in range(n):\n ss.append([ord(item) for item in input().rstrip()])\nss.sort(key=lambda x: len(x), reverse=True)\n\norda = ord(\"a\")\nwords = defaultdict(empty_list)\nans = 0\nfor s in ss:\n word_len = len(s)\n s_rev = s[::-1]\n RH = RollingHash(s_rev)\n rh = RH.get(0, word_len-1)\n ans += words[rh][s_rev[-1] - orda]\n initial = [0] * 26 \n for i, ch in enumerate(s):\n initial[ch - orda] = 1\n for j, is_initial in enumerate(initial):\n if is_initial:\n rh = RH.get(0, word_len-i-1)\n words[rh][j] += 1\nprint(ans)", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597050790", "date2": "1597051675", "bleu_score": "0.8856665624999156", "code1_test_status": [1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1], "code1_test_score": 72, "total_score": 102, "input": "3\nayxyad\nbyw\nbaa\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["\nimport sys\ninput = sys.stdin.readline # (0): input=\n\nclass RollingHash(): # (1): RollingHash=\n def __init__(self, s):\n length = len(s) # (19): length=6 (157): length=3 (223): length=3\n base = 1009 # (20): base=1009 (158): base=1009 (224): base=1009\n self.mod = (1 << 61) - 1 # (21): NO CHANGE (159): NO CHANGE (225): NO CHANGE\n self.hash = [0] * (length + 2) # (22): NO CHANGE (160): NO CHANGE (226): NO CHANGE\n self.pow = [1] * (length + 2) # (23): NO CHANGE (161): NO CHANGE (227): NO CHANGE\n\n for i in range(length): # (24): i=0 (27): i=1 ... (237): NO CHANGE\n self.hash[i+1] = (self.hash[i] + s[i]) * base % self.mod # (25): NO CHANGE (28): NO CHANGE ... (235): NO CHANGE\n self.pow[i+1] = self.pow[i] * base % self.mod # (26): NO CHANGE (29): NO CHANGE ... (236): NO CHANGE\n self.pow[length+1] = self.pow[length] * base % self.mod # (43): sys=, input=, RollingHash=, ss=[[0, 24, 23, 24, 0, 3], [1, 24, 22], [1, 0, 0]], orda=97, n=3, _=2, words={}, ans=0, s=[0, 24, 23, 24, 0, 3], word_len=6, s_rev=[3, 0, 24, 23, 24, 0], RH= (172): sys=, input=, RollingHash=, ss=[[0, 24, 23, 24, 0, 3], [1, 24, 22], [1, 0, 0]], orda=97, n=3, _=2, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 3081755403: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3054243: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3027: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 0: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0]}, ans=0, s=[1, 24, 22], word_len=3, s_rev=[22, 24, 1], RH=, rh=0, initial={0, 24, 3, 23}, i=5, ch=3, key=23 (238): sys=, input=, RollingHash=, ss=[[0, 24, 23, 24, 0, 3], [1, 24, 22], [1, 0, 0]], orda=97, n=3, _=2, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 3081755403: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3054243: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3027: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 0: [1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 0], 22421998: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 22198: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]}, ans=0, s=[1, 0, 0], word_len=3, s_rev=[0, 0, 1], RH=, rh=0, initial={24, 1, 22}, ch=22, key=22\n\n def get(self, l, r):\n t = self.hash[r] - self.hash[l] * self.pow[r-l] % self.mod # (45): sys=, input=, RollingHash=, ss=[[0, 24, 23, 24, 0, 3], [1, 24, 22], [1, 0, 0]], orda=97, n=3, _=2, words={}, ans=0, s=[0, 24, 23, 24, 0, 3], word_len=6, s_rev=[3, 0, 24, 23, 24, 0], RH=, rh=3137476645881722 (52): sys=, input=, RollingHash=, ss=[[0, 24, 23, 24, 0, 3], [1, 24, 22], [1, 0, 0]], orda=97, n=3, _=2, words={}, ans=0, s=[0, 24, 23, 24, 0, 3], word_len=6, s_rev=[3, 0, 24, 23, 24, 0], RH=, rh=3137476645881722, initial={0}, i=0, ch=0, key=0 ... (274): sys=, input=, RollingHash=, ss=[[0, 24, 23, 24, 0, 3], [1, 24, 22], [1, 0, 0]], orda=97, n=3, _=2, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 3081755403: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3054243: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3027: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 0: [3, 3, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 0], 22421998: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 22198: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]}, ans=1, s=[1, 0, 0], word_len=3, s_rev=[0, 0, 1], RH=, rh=0, initial={0, 1}, i=2, ch=0, key=1\n return t % self.mod\n\nss = [] # (2): ss=[]\norda = ord(\"a\") # (3): orda=97\nn = int(input()) # (4): n=3\nfor _ in range(n): # (5): _=0 (7): _=1 ... (11): ss\n ss.append([ord(item) - orda for item in input().rstrip()]) # (6): ss=[[0, 24, 23, 24, 0, 3]] (8): ss (10): ss\nss.sort(key=lambda x: len(x), reverse=True) # (12): ss\n\nwords = dict() # (13): ss, words={}\nans = 0 # (14): ss, ans=0\nfor s in ss: # (15): ss, s=[0, 24, 23, 24, 0, 3] (153): ss, s=[1, 24, 22] ... (279): ss\n word_len = len(s) # (16): ss, word_len=6 (154): ss, word_len=3 (220): ss\n s_rev = s[::-1] # (17): ss, s_rev=[3, 0, 24, 23, 24, 0] (155): ss, s_rev=[22, 24, 1] (221): ss, s_rev=[0, 0, 1]\n RH = RollingHash(s_rev) # (18): self=, s=[3, 0, 24, 23, 24, 0] (156): self=, s=[22, 24, 1] (222): self=, s=[0, 0, 1]\n rh = RH.get(0, word_len-1) # (44): self=, l=0, r=5 (173): self=, l=0, r=2 (239): self=, l=0, r=2\n if rh in words: # (46): ss (175): ss (241): ss\n ans += words[rh][s_rev[-1]] # (242): ss, ans=1\n initial = set() # (47): ss, initial=set() (176): ss, initial=set() (243): ss, initial=set()\n for i, ch in enumerate(s): # (48): ss, i=0, ch=0 (57): ss, i=1, ch=24 ... (278): ss\n initial.add(ch) # (49): ss, initial={0} (58): ss, initial={0, 24} ... (266): ss\n for key in initial: # (50): ss, key=0 (56): ss ... (277): ss\n rh = RH.get(0, word_len-i-1) # (51): self=, l=0, r=5 (60): self=, l=0, r=4 ... (273): self=, l=0, r=0\n if rh in words: # (53): ss (62): ss ... (275): ss\n words[rh][key] += 1 # (69): ss, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]} (83): ss, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 3081755403: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]} ... (276): ss, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 3081755403: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3054243: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3027: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 0: [3, 4, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 0], 22421998: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 22198: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]}\n else:\n words[rh] = [0] * 26 # (54): ss, words={3137476645881722: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (63): ss, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} ... (192): ss, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 3081755403: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3054243: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3027: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 0: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 22421998: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 22198: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\n words[rh][key] += 1 # (55): ss, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (64): ss, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} ... (193): ss, words={3137476645881722: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 3109491224834: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 3081755403: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3054243: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 3027: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 0: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 22421998: [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 22198: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]}\nprint(ans)"], "anno_status": [false], "diff_content": " \n import sys\n input = sys.stdin.readline\n+from collections import defaultdict\n+\n+def empty_list():\n+ return [0] * 26\n \n class RollingHash():\n def __init__(self, s):\n length = len(s)\n base = 1009\n- self.mod = (1 << 61) - 1\n+ \n+ self.mod = 67280421310721\n self.hash = [0] * (length + 2)\n self.pow = [1] * (length + 2)\n \n for i in range(length):\n self.hash[i+1] = (self.hash[i] + s[i]) * base % self.mod\n self.pow[i+1] = self.pow[i] * base % self.mod\n self.pow[length+1] = self.pow[length] * base % self.mod \n \n def get(self, l, r):\n t = self.hash[r] - self.hash[l] * self.pow[r-l] % self.mod\n return t % self.mod\n \n ss = []\n-orda = ord(\"a\")\n n = int(input())\n for _ in range(n):\n- ss.append([ord(item) - orda for item in input().rstrip()])\n+ ss.append([ord(item) for item in input().rstrip()])\n ss.sort(key=lambda x: len(x), reverse=True)\n \n-words = dict()\n+orda = ord(\"a\")\n+words = defaultdict(empty_list)\n ans = 0\n for s in ss:\n word_len = len(s)\n s_rev = s[::-1]\n RH = RollingHash(s_rev)\n rh = RH.get(0, word_len-1)\n- if rh in words:\n- ans += words[rh][s_rev[-1]]\n- initial = set()\n+ ans += words[rh][s_rev[-1] - orda]\n+ initial = [0] * 26 \n for i, ch in enumerate(s):\n- initial.add(ch)\n- for key in initial:\n- rh = RH.get(0, word_len-i-1)\n- if rh in words:\n- words[rh][key] += 1\n- else:\n- words[rh] = [0] * 26\n- words[rh][key] += 1\n+ initial[ch - orda] = 1\n+ for j, is_initial in enumerate(initial):\n+ if is_initial:\n+ rh = RH.get(0, word_len-i-1)\n+ words[rh][j] += 1\n print(ans)\n", "FL_content": "\n \n import sys\n input = sys.stdin.readline\n \n class RollingHash():\n def __init__(self, s):\n length = len(s)\n base = 1009\n self.mod = (1 << 61) - 1\n self.hash = [0] * (length + 2)\n self.pow = [1] * (length + 2)\n \n for i in range(length):\n self.hash[i+1] = (self.hash[i] + s[i]) * base % self.mod\n self.pow[i+1] = self.pow[i] * base % self.mod\n self.pow[length+1] = self.pow[length] * base % self.mod \n \n def get(self, l, r):\n t = self.hash[r] - self.hash[l] * self.pow[r-l] % self.mod\n return t % self.mod\n \n ss = []\n orda = ord(\"a\")\n n = int(input())\n for _ in range(n):\n ss.append([ord(item) - orda for item in input().rstrip()])\n ss.sort(key=lambda x: len(x), reverse=True)\n \n words = dict()\n ans = 0\n for s in ss:\n word_len = len(s)\n s_rev = s[::-1]\n RH = RollingHash(s_rev)\n rh = RH.get(0, word_len-1)\n if rh in words:\n- ans += words[rh][s_rev[-1]]\n initial = set()\n for i, ch in enumerate(s):\n initial.add(ch)\n for key in initial:\n rh = RH.get(0, word_len-i-1)\n if rh in words:\n words[rh][key] += 1\n else:\n words[rh] = [0] * 26\n words[rh][key] += 1\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 48 }, { "user_id": "u802977614", "problem_id": "p02697", "submission1_id": "s998145176-FL", "submission2_id": "s383026422", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict,deque\nimport sys, heapq, bisect, math, itertools, string, queue, copy, time\nsys.setrecursionlimit(10**8)\ninput = sys.stdin.readline\nINF = float('inf')\nmod = 10**9+7\neps = 10**-7\ndef inp():\n \n return int(input())\ndef inpl():\n \n return list(map(int, input().split()))\n\n\nn, m = inpl()\nj_list = [1]\ni=3\nwhile len(j_list) < m:\n if n%i!=0:\n j_list.append(i)\n i += 2\n\nfor i in range(m):\n print(\"{} {}\".format(i+1,i+j_list[-i-1]+1))\n", "code2": "from collections import defaultdict,deque\nimport sys, heapq, bisect, math, itertools, string, queue, copy, time\nsys.setrecursionlimit(10**8)\ninput = sys.stdin.readline\nINF = float('inf')\nmod = 10**9+7\neps = 10**-7\ndef inp():\n \n return int(input())\ndef inpl():\n \n return list(map(int, input().split()))\n\n\nn, m = inpl()\nn = 2 * m + 1\n\nfor i in range(m\n print(i + 1, m - i)\n\nbase=m+1\nfor i in range((n-m)\n print(base + i, n - i)\n\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1588472718", "date2": "1588475259", "bleu_score": "0.7779479091805099", "code1_test_status": [0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 6, "input": "12 5\n", "actual_output": "1 12\n2 11\n3 10\n4 9\n5 6\n", "expected_output": "1 6\n2 5\n3 4\n7 11\n8 10\n\n", "anno_code": ["from collections import defaultdict,deque\nimport sys, heapq, bisect, math, itertools, string, queue, copy, time\nsys.setrecursionlimit(10**8) # (0): NO CHANGE\ninput = sys.stdin.readline # (1): input=\nINF = float('inf') # (2): INF=inf\nmod = 10**9+7 # (3): mod=1000000007\neps = 10**-7 # (4): eps=1e-07\ndef inp(): # (5): inp=\n \n return int(input())\ndef inpl(): # (6): inpl=\n \n return list(map(int, input().split()))\n\n\nn, m = inpl() # (7): n=12, m=5\nj_list = [1] # (8): j_list=[1]\ni=3 # (9): i=3\nwhile len(j_list) < m: # (10): NO CHANGE (13): NO CHANGE ... (29): NO CHANGE\n if n%i!=0: # (11): NO CHANGE (14): NO CHANGE ... (26): NO CHANGE\n j_list.append(i) # (15): j_list=[1, 5] (19): j_list=[1, 5, 7] ... (27): j_list=[1, 5, 7, 9, 11]\n i += 2 # (12): i=5 (16): i=7 ... (28): i=13\n\nfor i in range(m): # (30): i=0 (32): i=1 ... (38): i=4\n print(\"{} {}\".format(i+1,i+j_list[-i-1]+1)) # (31): NO CHANGE (33): NO CHANGE ... (39): NO CHANGE\n"], "anno_status": [true], "diff_content": " from collections import defaultdict,deque\n import sys, heapq, bisect, math, itertools, string, queue, copy, time\n sys.setrecursionlimit(10**8)\n input = sys.stdin.readline\n INF = float('inf')\n mod = 10**9+7\n eps = 10**-7\n def inp():\n \n return int(input())\n def inpl():\n \n return list(map(int, input().split()))\n \n \n n, m = inpl()\n-j_list = [1]\n-i=3\n-while len(j_list) < m:\n- if n%i!=0:\n- j_list.append(i)\n- i += 2\n+n = 2 * m + 1\n+\n+for i in range(m\n+ print(i + 1, m - i)\n+\n+base=m+1\n+for i in range((n-m)\n+ print(base + i, n - i)\n \n-for i in range(m):\n- print(\"{} {}\".format(i+1,i+j_list[-i-1]+1))\n \n", "FL_content": "\n from collections import defaultdict,deque\n import sys, heapq, bisect, math, itertools, string, queue, copy, time\n sys.setrecursionlimit(10**8)\n input = sys.stdin.readline\n INF = float('inf')\n mod = 10**9+7\n eps = 10**-7\n def inp():\n \n return int(input())\n def inpl():\n \n return list(map(int, input().split()))\n \n \n n, m = inpl()\n j_list = [1]\n i=3\n while len(j_list) < m:\n- if n%i!=0:\n j_list.append(i)\n i += 2\n \n for i in range(m):\n print(\"{} {}\".format(i+1,i+j_list[-i-1]+1))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 26 }, { "user_id": "u053220793", "problem_id": "p03363", "submission1_id": "s294802906-FL", "submission2_id": "s034375082", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\nn = int(input())\ns = list(map(int, input().split()))\nfor i in range(1, n):\n s[i] += s[i-1]\n\nans = 0\nprint(s)\ns = sorted(s)\nprint(s)\ni = 0\nwhile True:\n mid = 0\n for j in range(i+1, n):\n if s[j] == s[i]:\n mid += 1\n ans += mid\n else:\n break\n if s[i] == 0:\n ans += mid+1\n i += mid\n i += 1\n if i >= n:\n break\nprint(ans)", "code2": "\n\nn = int(input())\ns = list(map(int, input().split()))\nfor i in range(1, n):\n s[i] += s[i-1]\n\nans = 0\ns = sorted(s)\ni = 0\nwhile True:\n mid = 0\n for j in range(i+1, n):\n if s[j] == s[i]:\n mid += 1\n ans += mid\n else:\n break\n if s[i] == 0:\n ans += mid+1\n i += mid\n i += 1\n if i >= n:\n break\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1525013724", "date2": "1525013825", "bleu_score": "0.953827952250936", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "5\n0 0 3 1 8\n", "actual_output": "[0, 0, 3, 4, 12]\n[0, 0, 3, 4, 12]\n3\n", "expected_output": "3\n\n", "anno_code": ["\n\nn = int(input()) # (0): n=5\ns = list(map(int, input().split())) # (1): s=[0, 0, 3, 1, 8]\nfor i in range(1, n): # (2): i=1 (4): i=2 ... (10): NO CHANGE\n s[i] += s[i-1] # (3): NO CHANGE (5): NO CHANGE ... (9): s=[0, 0, 3, 4, 12]\n\nans = 0 # (11): ans=0\nprint(s) # (12): NO CHANGE\ns = sorted(s) # (13): NO CHANGE\nprint(s) # (14): NO CHANGE\ni = 0 # (15): i=0\nwhile True: # (16): NO CHANGE (30): NO CHANGE ... (48): NO CHANGE\n mid = 0 # (17): mid=0 (31): mid=0 ... (49): NO CHANGE\n for j in range(i+1, n): # (18): j=1 (22): j=2 ... (50): NO CHANGE\n if s[j] == s[i]: # (19): NO CHANGE (23): NO CHANGE ... (42): NO CHANGE\n mid += 1 # (20): mid=1\n ans += mid # (21): ans=1\n else:\n break # (24): NO CHANGE (34): NO CHANGE (43): NO CHANGE\n if s[i] == 0: # (25): NO CHANGE (35): NO CHANGE ... (51): NO CHANGE\n ans += mid+1 # (26): ans=3\n i += mid # (27): i=1 (36): NO CHANGE ... (52): NO CHANGE\n i += 1 # (28): i=2 (37): i=3 ... (53): i=5\n if i >= n: # (29): NO CHANGE (38): NO CHANGE ... (54): NO CHANGE\n break # (55): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " \n \n n = int(input())\n s = list(map(int, input().split()))\n for i in range(1, n):\n s[i] += s[i-1]\n \n ans = 0\n-print(s)\n s = sorted(s)\n-print(s)\n i = 0\n while True:\n mid = 0\n for j in range(i+1, n):\n if s[j] == s[i]:\n mid += 1\n ans += mid\n else:\n break\n if s[i] == 0:\n ans += mid+1\n i += mid\n i += 1\n if i >= n:\n break\n print(ans)\n+\n", "FL_content": "\n \n \n n = int(input())\n s = list(map(int, input().split()))\n for i in range(1, n):\n s[i] += s[i-1]\n \n ans = 0\n-print(s)\n s = sorted(s)\n-print(s)\n i = 0\n while True:\n mid = 0\n for j in range(i+1, n):\n if s[j] == s[i]:\n mid += 1\n ans += mid\n else:\n break\n if s[i] == 0:\n ans += mid+1\n i += mid\n i += 1\n if i >= n:\n break\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u510829608", "problem_id": "p02410", "submission1_id": "s305059089-FL", "submission2_id": "s972809458", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a = []; b = []; c = []\nn, m = map(int, input().split())\n\nfor i in range(n):\n\trow = map(int, input().split())\n\ta.append(list(row))\n\nfor j in range(m):\n\tcol = int(input())\n\tb.append(col)\n\nfor k in range(n):\n\ttemp = 0\n\tfor l in range(m):\n\t\ttemp += a[k][l] * b[l] \n\tc.append(temp)\n\nprint(c)", "code2": "a = []; b = []; c = []\nn, m = map(int, input().split())\n\nfor i in range(n):\n\trow = map(int, input().split())\n\ta.append(list(row))\n\nfor j in range(m):\n\tcol = int(input())\n\tb.append(col)\n\nfor k in range(n):\n\ttemp = 0\n\tfor l in range(m):\n\t\ttemp += a[k][l] * b[l] \n\tc.append(temp)\n\nfor ind in range(n):\n\tprint(c[ind])", "original_language1": "Python3", "original_language2": "Python3", "date1": "1470112881", "date2": "1470113083", "bleu_score": "0.9060673779578519", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "3 4\n1 4 -2 1\n0 3 0 1\n4 2 1 0\n1\n1\n3\n-1\n", "actual_output": "[-2, 2, 9]\n", "expected_output": "-2\n2\n9\n\n", "anno_code": ["a = []; b = []; c = [] # (0): a=[], b=[], c=[]\nn, m = map(int, input().split()) # (1): n=3, m=4\n\nfor i in range(n): # (2): i=0 (5): i=1 ... (11): NO CHANGE\n\trow = map(int, input().split()) # (3): row= (6): row= (9): row=\n\ta.append(list(row)) # (4): a=[[1, 4, -2, 1]] (7): a (10): a\n\nfor j in range(m): # (12): j=0 (15): j=1 ... (24): NO CHANGE\n\tcol = int(input()) # (13): col=1 (16): NO CHANGE ... (22): col=-1\n\tb.append(col) # (14): b=[1] (17): b=[1, 1] ... (23): b=[1, 1, 3, -1]\n\nfor k in range(n): # (25): k=0 (37): k=1 ... (61): NO CHANGE\n\ttemp = 0 # (26): temp=0 (38): temp=0 (50): temp=0\n\tfor l in range(m): # (27): l=0 (29): l=1 ... (59): NO CHANGE\n\t\ttemp += a[k][l] * b[l] # (28): temp=1 (30): temp=5 ... (58): NO CHANGE\n\tc.append(temp) # (36): c=[-2] (48): c=[-2, 2] (60): c=[-2, 2, 9]\n\nprint(c)"], "anno_status": [true], "diff_content": " a = []; b = []; c = []\n n, m = map(int, input().split())\n \n for i in range(n):\n \trow = map(int, input().split())\n \ta.append(list(row))\n \n for j in range(m):\n \tcol = int(input())\n \tb.append(col)\n \n for k in range(n):\n \ttemp = 0\n \tfor l in range(m):\n \t\ttemp += a[k][l] * b[l] \n \tc.append(temp)\n \n-print(c)\n+for ind in range(n):\n+\tprint(c[ind])\n", "FL_content": "\n a = []; b = []; c = []\n n, m = map(int, input().split())\n \n for i in range(n):\n \trow = map(int, input().split())\n \ta.append(list(row))\n \n for j in range(m):\n \tcol = int(input())\n \tb.append(col)\n \n for k in range(n):\n \ttemp = 0\n \tfor l in range(m):\n \t\ttemp += a[k][l] * b[l] \n \tc.append(temp)\n \n-print(c)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u097317219", "problem_id": "p03139", "submission1_id": "s636054427-FL", "submission2_id": "s481512740", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,a,b = map(int,input().split())\nprint(min(a,b))", "code2": "n,a,b = map(int,input().split())\nprint(min(a,b),max(a+b-n,0))", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589481800", "date2": "1589481850", "bleu_score": "0.7727887635299474", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 81, "input": "101 110 000\n", "actual_output": "0\n", "expected_output": "0 9\n\n", "anno_code": ["n,a,b = map(int,input().split()) # (0): n=101, a=110, b=0\nprint(min(a,b))"], "anno_status": [true], "diff_content": " n,a,b = map(int,input().split())\n-print(min(a,b))\n+print(min(a,b),max(a+b-n,0))\n", "FL_content": "\n n,a,b = map(int,input().split())\n-print(min(a,b))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 2 }, { "user_id": "u066455063", "problem_id": "p03456", "submission1_id": "s163200263-FL", "submission2_id": "s902588119", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b = input().split()\nc = int(a+b)\n\nfor i in range(1, 101):\n if i ** 2 == c:\n print(\"Yes\")\n exit()\n\nprint(\"No\")\n", "code2": "a, b = map(int, input().split())\nnum = str(a) + str(b)\nnum = int(num)\n\nfor i in range(200000):\n if i ** 2 == num:\n print(\"Yes\")\n exit()\n\nprint(\"No\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569464919", "date2": "1570673937", "bleu_score": "0.683210260239465", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 90, "total_score": 91, "input": "000 000\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["a, b = input().split() # (0): a=000, b=000\nc = int(a+b) # (1): c=0\n\nfor i in range(1, 101): # (2): i=1 (4): i=2 ... (202): NO CHANGE\n if i ** 2 == c: # (3): NO CHANGE (5): NO CHANGE ... (201): NO CHANGE\n print(\"Yes\")\n exit()\n\nprint(\"No\")\n"], "anno_status": [true], "diff_content": "-a, b = input().split()\n-c = int(a+b)\n+a, b = map(int, input().split())\n+num = str(a) + str(b)\n+num = int(num)\n \n-for i in range(1, 101):\n- if i ** 2 == c:\n+for i in range(200000):\n+ if i ** 2 == num:\n print(\"Yes\")\n exit()\n \n print(\"No\")\n \n", "FL_content": "\n a, b = input().split()\n c = int(a+b)\n \n-for i in range(1, 101):\n if i ** 2 == c:\n print(\"Yes\")\n exit()\n \n print(\"No\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u788137651", "problem_id": "p03558", "submission1_id": "s264637381-FL", "submission2_id": "s810790393", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\n\n\n\n\n\n\nimport sys\ninput=sys.stdin.readline\ninf=float('inf')\nmod = 10**9+7\ndef INT_(n): return int(n)-1\ndef MI(): return map(int,input().split())\ndef MF(): return map(float, input().split())\ndef MI_(): return map(INT_,input().split())\ndef LI(): return list(MI())\ndef LI_(): return [int(x) - 1 for x in input().split()]\ndef LF(): return list(MF())\ndef LIN(n:int): return [input() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\ndef LLIN_(n: int): return [LI_() for _ in range(n)]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef I(): return int(input())\ndef F(): return float(input())\ndef ST(): return input().replace('\\n', '')\ndef main():\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n zero_one_deque = deque([1])\n node = [inf] * K\n \n node[1] = 1\n while zero_one_deque:\n from_ = zero_one_deque.popleft()\n for i, to in enumerate(edge[from_]):\n if node[to] != inf:\n continue\n node[to] = node[from_]\n if i == 0:\n zero_one_deque.appendleft(to)\n else: \n node[to] += 1\n zero_one_deque.append(to)\n print(node[0])\n \n\nif __name__ == '__main__':\n main()", "code2": "\n\n\n\n\n\n\n\n\n\n\nimport sys\ninput=sys.stdin.readline\ninf=float('inf')\nmod = 10**9+7\ndef INT_(n): return int(n)-1\ndef MI(): return map(int,input().split())\ndef MF(): return map(float, input().split())\ndef MI_(): return map(INT_,input().split())\ndef LI(): return list(MI())\ndef LI_(): return [int(x) - 1 for x in input().split()]\ndef LF(): return list(MF())\ndef LIN(n:int): return [input() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\ndef LLIN_(n: int): return [LI_() for _ in range(n)]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef I(): return int(input())\ndef F(): return float(input())\ndef ST(): return input().replace('\\n', '')\ndef main():\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n zero_one_deque = deque([(1, 1)])\n node = [inf] * K\n \n node[1] = 1\n searched = set()\n while zero_one_deque:\n from_ , digit_sum = zero_one_deque.popleft()\n if from_ in searched:\n continue\n else:\n searched.add(from_)\n node[from_] = digit_sum\n \n for i, to in enumerate(edge[from_]):\n if i == 0:\n zero_one_deque.appendleft((to,node[from_]))\n else: \n zero_one_deque.append((to, node[from_] + 1))\n print(node[0])\n \n\nif __name__ == '__main__':\n main()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1559593577", "date2": "1559594990", "bleu_score": "0.9126329906890182", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 18, "total_score": 22, "input": "1246\n", "actual_output": "4\n", "expected_output": "3\n\n", "anno_code": ["\n\n\n\n\n\n\n\n\n\n\nimport sys\ninput=sys.stdin.readline # (0): input=\ninf=float('inf') # (1): inf=inf\nmod = 10**9+7 # (2): mod=1000000007, INT_=, MI=, MF=, MI_=, LI=, LI_=, LF=, LIN=, LLIN=, LLIN_=, LLI=, I=, F=, ST=\ndef INT_(n): return int(n)-1\ndef MI(): return map(int,input().split())\ndef MF(): return map(float, input().split())\ndef MI_(): return map(INT_,input().split())\ndef LI(): return list(MI())\ndef LI_(): return [int(x) - 1 for x in input().split()]\ndef LF(): return list(MF())\ndef LIN(n:int): return [input() for _ in range(n)]\ndef LLIN(n: int): return [LI() for _ in range(n)]\ndef LLIN_(n: int): return [LI_() for _ in range(n)]\ndef LLI(): return [list(map(int, l.split() )) for l in input()]\ndef I(): return int(input())\ndef F(): return float(input())\ndef ST(): return input().replace('\\n', '')\ndef main(): # (3): main=\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n zero_one_deque = deque([1])\n node = [inf] * K\n \n node[1] = 1\n while zero_one_deque:\n from_ = zero_one_deque.popleft()\n for i, to in enumerate(edge[from_]):\n if node[to] != inf:\n continue\n node[to] = node[from_]\n if i == 0:\n zero_one_deque.appendleft(to)\n else: \n node[to] += 1\n zero_one_deque.append(to)\n print(node[0])\n \n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " \n \n \n \n \n \n \n \n \n \n \n import sys\n input=sys.stdin.readline\n inf=float('inf')\n mod = 10**9+7\n def INT_(n): return int(n)-1\n def MI(): return map(int,input().split())\n def MF(): return map(float, input().split())\n def MI_(): return map(INT_,input().split())\n def LI(): return list(MI())\n def LI_(): return [int(x) - 1 for x in input().split()]\n def LF(): return list(MF())\n def LIN(n:int): return [input() for _ in range(n)]\n def LLIN(n: int): return [LI() for _ in range(n)]\n def LLIN_(n: int): return [LI_() for _ in range(n)]\n def LLI(): return [list(map(int, l.split() )) for l in input()]\n def I(): return int(input())\n def F(): return float(input())\n def ST(): return input().replace('\\n', '')\n def main():\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n- zero_one_deque = deque([1])\n+ zero_one_deque = deque([(1, 1)])\n node = [inf] * K\n \n node[1] = 1\n+ searched = set()\n while zero_one_deque:\n- from_ = zero_one_deque.popleft()\n+ from_ , digit_sum = zero_one_deque.popleft()\n+ if from_ in searched:\n+ continue\n+ else:\n+ searched.add(from_)\n+ node[from_] = digit_sum\n+ \n for i, to in enumerate(edge[from_]):\n- if node[to] != inf:\n- continue\n- node[to] = node[from_]\n if i == 0:\n- zero_one_deque.appendleft(to)\n+ zero_one_deque.appendleft((to,node[from_]))\n else: \n- node[to] += 1\n- zero_one_deque.append(to)\n+ zero_one_deque.append((to, node[from_] + 1))\n print(node[0])\n \n \n if __name__ == '__main__':\n main()\n", "FL_content": "\n \n \n \n \n \n \n \n \n \n \n \n import sys\n input=sys.stdin.readline\n inf=float('inf')\n mod = 10**9+7\n def INT_(n): return int(n)-1\n def MI(): return map(int,input().split())\n def MF(): return map(float, input().split())\n def MI_(): return map(INT_,input().split())\n def LI(): return list(MI())\n def LI_(): return [int(x) - 1 for x in input().split()]\n def LF(): return list(MF())\n def LIN(n:int): return [input() for _ in range(n)]\n def LLIN(n: int): return [LI() for _ in range(n)]\n def LLIN_(n: int): return [LI_() for _ in range(n)]\n def LLI(): return [list(map(int, l.split() )) for l in input()]\n def I(): return int(input())\n def F(): return float(input())\n def ST(): return input().replace('\\n', '')\n def main():\n from collections import deque\n K = I()\n edge = [[]for _ in range(K)]\n for i in range(K):\n edge[i].append((i * 10) % K)\n edge[i].append((i + 1)%K)\n \n zero_one_deque = deque([1])\n node = [inf] * K\n \n node[1] = 1\n while zero_one_deque:\n from_ = zero_one_deque.popleft()\n for i, to in enumerate(edge[from_]):\n if node[to] != inf:\n continue\n node[to] = node[from_]\n if i == 0:\n zero_one_deque.appendleft(to)\n else: \n node[to] += 1\n zero_one_deque.append(to)\n print(node[0])\n \n \n if __name__ == '__main__':\n main()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 57 }, { "user_id": "u921773161", "problem_id": "p03377", "submission1_id": "s965403885-FL", "submission2_id": "s866782527", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c = map(int,input().split())\nif c-a<=b:\n print('YES')\nelse:\n print('NO')", "code2": "a,b,c = map(int,input().split())\nif c>= a:\n if c-a<=b:\n print('YES')\n else:\n print('NO')\nelse :\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1563756088", "date2": "1563756165", "bleu_score": "0.660079164358409", "code1_test_status": [1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0], "code1_test_score": 63, "total_score": 87, "input": "-1 4 -5\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["a,b,c = map(int,input().split()) # (0): a=-1, b=4, c=-5\nif c-a<=b: # (1): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " a,b,c = map(int,input().split())\n-if c-a<=b:\n- print('YES')\n-else:\n+if c>= a:\n+ if c-a<=b:\n+ print('YES')\n+ else:\n+ print('NO')\n+else :\n print('NO')\n", "FL_content": "\n a,b,c = map(int,input().split())\n-if c-a<=b:\n print('YES')\n else:\n print('NO')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u737758066", "problem_id": "p02720", "submission1_id": "s961250487-FL", "submission2_id": "s708254484", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import collections\n\nk = int(input())\nli = [str(i) for i in range(1,10)]\nstr_li = li[:]\nq = collections.deque(li)\ncount = 0\nn = 10**10\n\nfor i in range(1,n):\n a = q.popleft()\n num = int(a[-1])\n if num != 0:\n aa = a + str(num-1)\n str_li.append(aa)\n count+=1\n aa = a + str(num)\n str_li.append(aa)\n q.append(aa)\n count+=1\n if num != 9:\n aa = a + str(num+1)\n str_li.append(aa)\n q.append(aa)\n count+=1\n if count > k:\n print(str_li[k-1])\n break\n\n", "code2": "import collections\nk = int(input())\nli = [str(i) for i in range(1,10)]\nst_li = li[:]\n\nq = collections.deque(li)\ncount = 0\nn = 10 ** 10\n\nfor i in range(1,n):\n \n a = q.popleft()\n num = int(a[-1])\n \n if num != 0:\n aa = a + str(num-1)\n st_li.append(aa)\n q.append(aa)\n count += 1\n aa = a + str(num)\n st_li.append(aa)\n q.append(aa)\n count += 1\n if num != 9:\n aa = a + str(num+1)\n st_li.append(aa)\n q.append(aa)\n count += 1\n if count > k:\n print(st_li[k-1])\n exit(0)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587125594", "date2": "1587343765", "bleu_score": "0.8810054304115738", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "333\n", "actual_output": "78889\n", "expected_output": "10100\n\n", "anno_code": ["import collections\n\nk = int(input()) # (0): k=333\nli = [str(i) for i in range(1,10)] # (1): li=['1', '2', '3', '4', '5', '6', '7', '8', '9']\nstr_li = li[:] # (2): str_li=['1', '2', '3', '4', '5', '6', '7', '8', '9']\nq = collections.deque(li) # (3): q=deque(['8999', '9999', '11111', '11112', '11122', '11123', '11222', '11223', '11233', '11234', '12222', '12223', '12233', '12234', '12333', '12334', '12344', '12345', '22222', '22223', '22233', '22234', '22333', '22334', '22344', '22345', '23333', '23334', '23344', '23345', '23444', '23445', '23455', '23456', '33333', '33334', '33344', '33345', '33444', '33445', '33455', '33456', '34444', '34445', '34455', '34456', '34555', '34556', '34566', '34567', '44444', '44445', '44455', '44456', '44555', '44556', '44566', '44567', '45555', '45556', '45566', '45567', '45666', '45667', '45677', '45678', '55555', '55556', '55566', '55567', '55666', '55667', '55677', '55678', '56666', '56667', '56677', '56678', '56777', '56778', '56788', '56789', '66666', '66667', '66677', '66678', '66777', '66778', '66788', '66789', '67777', '67778', '67788', '67789', '67888', '67889', '67899', '77777', '77778', '77788', '77789', '77888', '77889', '77899', '78888', '78889', '78899', '78999', '88888', '88889', '88899', '88999'])\ncount = 0 # (4): count=0\nn = 10**10 # (5): n=10000000000\n\nfor i in range(1,n): # (6): i=1 (23): i=2 ... (1913): i=116\n a = q.popleft() # (7): a=1 (24): a=2 ... (1914): a=8899\n num = int(a[-1]) # (8): num=1 (25): num=2 ... (1915): NO CHANGE\n if num != 0: # (9): NO CHANGE (26): NO CHANGE ... (1916): NO CHANGE\n aa = a + str(num-1) # (10): aa=10 (27): aa=21 ... (1917): aa=88998\n str_li.append(aa) # (11): str_li=['1', '2', '3', '4', '5', '6', '7', '8', '9', '10'] (28): str_li=['1', '2', '3', '4', '5', '6', '7', '8', '9', '10', '11', '12', '21'] ... (1918): str_li=[1, 2, ..., 88899, 88998]\n count+=1 # (12): count=1 (29): count=4 ... (1919): count=334\n aa = a + str(num) # (13): aa=11 (30): aa=22 ... (1920): aa=88999\n str_li.append(aa) # (14): str_li=['1', '2', '3', '4', '5', '6', '7', '8', '9', '10', '11'] (31): str_li=['1', '2', '3', '4', '5', '6', '7', '8', '9', '10', '11', '12', '21', '22'] ... (1921): str_li=[1, 2, ..., 88998, 88999]\n q.append(aa) # (15): NO CHANGE (32): NO CHANGE ... (1922): NO CHANGE\n count+=1 # (16): count=2 (33): count=5 ... (1923): count=335\n if num != 9: # (17): NO CHANGE (34): NO CHANGE ... (1924): NO CHANGE\n aa = a + str(num+1) # (18): aa=12 (35): aa=23 ... (1895): aa=88889\n str_li.append(aa) # (19): str_li=['1', '2', '3', '4', '5', '6', '7', '8', '9', '10', '11', '12'] (36): str_li=['1', '2', '3', '4', '5', '6', '7', '8', '9', '10', '11', '12', '21', '22', '23'] ... (1896): str_li=[1, 2, ..., 88888, 88889]\n q.append(aa) # (20): NO CHANGE (37): NO CHANGE ... (1897): NO CHANGE\n count+=1 # (21): count=3 (38): count=6 ... (1898): count=331\n if count > k: # (22): NO CHANGE (39): NO CHANGE ... (1925): NO CHANGE\n print(str_li[k-1]) # (1926): NO CHANGE\n break\n\n"], "anno_status": [false], "diff_content": " import collections\n-\n k = int(input())\n li = [str(i) for i in range(1,10)]\n-str_li = li[:]\n+st_li = li[:]\n+\n q = collections.deque(li)\n count = 0\n-n = 10**10\n+n = 10 ** 10\n \n for i in range(1,n):\n+ \n a = q.popleft()\n num = int(a[-1])\n+ \n if num != 0:\n aa = a + str(num-1)\n- str_li.append(aa)\n- count+=1\n+ st_li.append(aa)\n+ q.append(aa)\n+ count += 1\n aa = a + str(num)\n- str_li.append(aa)\n+ st_li.append(aa)\n q.append(aa)\n- count+=1\n+ count += 1\n if num != 9:\n aa = a + str(num+1)\n- str_li.append(aa)\n+ st_li.append(aa)\n q.append(aa)\n- count+=1\n+ count += 1\n if count > k:\n- print(str_li[k-1])\n- break\n-\n+ print(st_li[k-1])\n+ exit(0)\n \n", "FL_content": "\n import collections\n \n k = int(input())\n-li = [str(i) for i in range(1,10)]\n str_li = li[:]\n q = collections.deque(li)\n count = 0\n n = 10**10\n \n for i in range(1,n):\n a = q.popleft()\n num = int(a[-1])\n if num != 0:\n aa = a + str(num-1)\n str_li.append(aa)\n count+=1\n aa = a + str(num)\n str_li.append(aa)\n q.append(aa)\n count+=1\n if num != 9:\n aa = a + str(num+1)\n str_li.append(aa)\n q.append(aa)\n count+=1\n if count > k:\n print(str_li[k-1])\n break\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 30 }, { "user_id": "u022407960", "problem_id": "p02300", "submission1_id": "s096994043-FL", "submission2_id": "s230011031", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) != -1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) != -1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n lower.reverse()\n lower.sort(key=attrgetter('imag', 'real'))\n \n\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "code2": "\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9\n\n\ndef cross(a, b):\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b):\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n \n lower.reverse()\n \n lower_min = min(lower, key=attrgetter('imag', 'real'))\n \n min_index = lower.index(lower_min)\n lower_right = lower[min_index:]\n lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n lower_right.append(upper[k])\n return lower_right + lower_left\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))", "original_language1": "Python3", "original_language2": "Python3", "date1": "1480727401", "date2": "1480734264", "bleu_score": "0.9042930828817721", "code1_test_status": [0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0], "code1_test_score": 32, "total_score": 102, "input": "4\n0 0\n2 3\n1 2\n0 1\n", "actual_output": "3\n0 0\n2 3\n0 1\n", "expected_output": "4\n0 0\n2 3\n1 2\n0 1\n\n", "anno_code": ["\n\n\n\n\nimport sys\nfrom operator import attrgetter\n\nEPS = 1e-9 # (0): EPS=1e-09\n\n\ndef cross(a, b): # (1): cross=\n return a.real * b.imag - a.imag * b.real\n\n\ndef dot(a, b): # (2): dot=\n return a.real * b.real + a.imag * b.imag\n\n\ndef check_ccw(p0, p1, p2): # (3): check_ccw=\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n\n\ndef convex_check_Andrew(_polygon): # (4): convex_check_Andrew=\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n\n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n\n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) != -1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n\n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) != -1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n\n lower.reverse()\n lower.sort(key=attrgetter('imag', 'real'))\n \n\n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n\n return lower\n\n\nif __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n\n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))"], "anno_status": [false], "diff_content": " \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n- while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) != -1:\n+ while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) == 1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n- while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) != -1:\n+ while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) == 1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n+ \n lower.reverse()\n- lower.sort(key=attrgetter('imag', 'real'))\n \n-\n+ lower_min = min(lower, key=attrgetter('imag', 'real'))\n+ \n+ min_index = lower.index(lower_min)\n+ lower_right = lower[min_index:]\n+ lower_left = lower[:min_index]\n for k in range(len(upper) - 2, 0, -1):\n- lower.append(upper[k])\n-\n- return lower\n+ lower_right.append(upper[k])\n+ return lower_right + lower_left\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "FL_content": "\n \n \n \n \n \n import sys\n from operator import attrgetter\n \n EPS = 1e-9\n \n \n def cross(a, b):\n return a.real * b.imag - a.imag * b.real\n \n \n def dot(a, b):\n return a.real * b.real + a.imag * b.imag\n \n \n def check_ccw(p0, p1, p2):\n a, b = p1 - p0, p2 - p0\n if cross(a, b) > EPS:\n \n flag = 1\n elif cross(a, b) < -1 * EPS:\n \n flag = -1\n elif dot(a, b) < -1 * EPS:\n \n flag = 2\n- elif abs(a) < abs(b):\n \n flag = -2\n else:\n \n flag = 0\n return flag\n \n \n def convex_check_Andrew(_polygon):\n upper, lower = list(), list()\n _polygon.sort(key=attrgetter('real', 'imag'))\n \n upper.extend((_polygon[0], _polygon[1]))\n lower.extend((_polygon[-1], _polygon[-2]))\n \n for i in range(2, points):\n n1 = len(upper)\n while n1 >= 2 and check_ccw(upper[n1 - 2], upper[n1 - 1], _polygon[i]) != -1:\n n1 -= 1\n upper.pop()\n upper.append(_polygon[i])\n \n for j in range(points - 3, -1, -1):\n n2 = len(lower)\n while n2 >= 2 and check_ccw(lower[n2 - 2], lower[n2 - 1], _polygon[j]) != -1:\n n2 -= 1\n lower.pop()\n lower.append(_polygon[j])\n \n lower.reverse()\n lower.sort(key=attrgetter('imag', 'real'))\n \n \n for k in range(len(upper) - 2, 0, -1):\n lower.append(upper[k])\n \n return lower\n \n \n if __name__ == '__main__':\n _input = sys.stdin.readlines()\n points = int(_input[0])\n p_info = map(lambda x: x.split(), _input[1:])\n \n polygon = [int(x) + int(y) * 1j for x, y in p_info]\n ans = convex_check_Andrew(polygon)\n print(len(ans))\n for ele in ans:\n print(int(ele.real), int(ele.imag))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 80 }, { "user_id": "u424776185", "problem_id": "p02948", "submission1_id": "s484708961-FL", "submission2_id": "s452880572", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n [N, M] = [int(number) for number in input().split()]\n part_times = []\n for i in range(N):\n [a, b] = [int(number) for number in input().split()]\n \n part_times.append([b, a])\n \n part_times = sorted(part_times, key = lambda x: (x[0], x[1]))\n print(part_times)\n money = 0\n day = 0\n\n \n\n for part_time in part_times:\n [b,a] = part_time\n if a + day <= M:\n day += a\n money += b\n else:\n continue\n print(money)\n\nif __name__ == '__main__':\n main()\n", "code2": "import heapq\n\ndef main():\n [N, M] = [int(number) for number in input().split()]\n part_times = []\n for i in range(N):\n job= [int(number) for number in input().split()]\n part_times.append(job)\n part_times = [part_time for part_time in sorted(part_times, key = lambda x: x[0])] \n money = 0\n hp = []\n for day in range(M):\n while part_times != [] and part_times[0][0] <= day + 1:\n part_time = part_times[0]\n heapq.heappush(hp, - part_time[1])\n part_times.pop(0)\n if hp != []:\n money -= heapq.heappop(hp)\n\n print(money)\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1565491180", "date2": "1567993692", "bleu_score": "0.731066815371781", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "3 0\n4 1\n3 1\n2 3\n", "actual_output": "[[1, 3], [1, 4], [3, 2]]\n0\n", "expected_output": "0\n\n", "anno_code": ["def main(): # (0): main=\n [N, M] = [int(number) for number in input().split()]\n part_times = []\n for i in range(N):\n [a, b] = [int(number) for number in input().split()]\n \n part_times.append([b, a])\n \n part_times = sorted(part_times, key = lambda x: (x[0], x[1]))\n print(part_times)\n money = 0\n day = 0\n\n \n\n for part_time in part_times:\n [b,a] = part_time\n if a + day <= M:\n day += a\n money += b\n else:\n continue\n print(money)\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": "+import heapq\n+\n def main():\n [N, M] = [int(number) for number in input().split()]\n part_times = []\n for i in range(N):\n- [a, b] = [int(number) for number in input().split()]\n- \n- part_times.append([b, a])\n- \n- part_times = sorted(part_times, key = lambda x: (x[0], x[1]))\n- print(part_times)\n+ job= [int(number) for number in input().split()]\n+ part_times.append(job)\n+ part_times = [part_time for part_time in sorted(part_times, key = lambda x: x[0])] \n money = 0\n- day = 0\n-\n- \n+ hp = []\n+ for day in range(M):\n+ while part_times != [] and part_times[0][0] <= day + 1:\n+ part_time = part_times[0]\n+ heapq.heappush(hp, - part_time[1])\n+ part_times.pop(0)\n+ if hp != []:\n+ money -= heapq.heappop(hp)\n \n- for part_time in part_times:\n- [b,a] = part_time\n- if a + day <= M:\n- day += a\n- money += b\n- else:\n- continue\n print(money)\n \n if __name__ == '__main__':\n main()\n \n", "FL_content": "\n def main():\n [N, M] = [int(number) for number in input().split()]\n part_times = []\n for i in range(N):\n [a, b] = [int(number) for number in input().split()]\n \n part_times.append([b, a])\n \n part_times = sorted(part_times, key = lambda x: (x[0], x[1]))\n- print(part_times)\n money = 0\n day = 0\n \n \n \n for part_time in part_times:\n [b,a] = part_time\n if a + day <= M:\n day += a\n money += b\n else:\n continue\n print(money)\n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 27 }, { "user_id": "u749491107", "problem_id": "p03456", "submission1_id": "s100811022-FL", "submission2_id": "s149046724", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a, b = input().split()\nx = int(a+b)\nno = 0\nfor i in range(1, 101):\n if x == i**2:\n print(\"Yes\")\n else:\n no += 1\n if no == 100:\n print(\"No\")", "code2": "a, b = input().split()\nx = int(a+b)\nno = 0\nfor i in range(1000):\n if x == i**2:\n print(\"Yes\")\n else:\n no += 1\n if no == 1000:\n print(\"No\")", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1599492146", "date2": "1599492271", "bleu_score": "0.9642835556348837", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 90, "total_score": 91, "input": "000 000\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["a, b = input().split() # (0): a=000, b=000\nx = int(a+b) # (1): x=0\nno = 0 # (2): no=0\nfor i in range(1, 101): # (3): i=1 (7): i=2 ... (399): i=100\n if x == i**2: # (4): NO CHANGE (8): NO CHANGE ... (400): NO CHANGE\n print(\"Yes\")\n else:\n no += 1 # (5): no=1 (9): no=2 ... (401): no=100\n if no == 100: # (6): NO CHANGE (10): NO CHANGE ... (402): NO CHANGE\n print(\"No\") # (403): NO CHANGE\n"], "anno_status": [true], "diff_content": " a, b = input().split()\n x = int(a+b)\n no = 0\n-for i in range(1, 101):\n+for i in range(1000):\n if x == i**2:\n print(\"Yes\")\n else:\n no += 1\n- if no == 100:\n+ if no == 1000:\n print(\"No\")\n", "FL_content": "\n a, b = input().split()\n x = int(a+b)\n no = 0\n-for i in range(1, 101):\n if x == i**2:\n print(\"Yes\")\n else:\n no += 1\n if no == 100:\n print(\"No\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u419686324", "problem_id": "p04000", "submission1_id": "s898699391-FL", "submission2_id": "s439030455", "status1": "Wrong Answer", "status2": "Accepted", "code1": "h, w, n = map(int, input().split())\nab = [list(map(int, input().split())) for _ in range(n)]\n\nsa = {}\nfor a,b in ab:\n for i in range(3):\n aa = a + i\n if aa < 3 or h < aa:\n continue\n for j in range(3):\n bb = b + j\n if bb < 3 or w < bb:\n continue\n id = \"%d,%d\" % (aa, bb)\n sa[id] = sa.get(id, 0) + 1\n\ns = {}\nfor x in sa.values():\n s[x] = s.setdefault(x, 0) + 1\nprint((w - 2) * (h - 2) - len(sa.keys()))\nfor i in range(10):\n print(s.get(i, 0))", "code2": "h, w, n = map(int, input().split())\nab = [list(map(int, input().split())) for _ in range(n)]\n\nsa = {}\nfor a,b in ab:\n for i in range(3):\n aa = a + i\n if aa < 3 or h < aa:\n continue\n for j in range(3):\n bb = b + j\n if bb < 3 or w < bb:\n continue\n id = \"%d,%d\" % (aa, bb)\n sa[id] = sa.get(id, 0) + 1\n\ns = {}\nfor x in sa.values():\n s[x] = s.setdefault(x, 0) + 1\nprint((w - 2) * (h - 2) - len(sa.keys()))\nfor i in range(1, 10):\n print(s.get(i, 0))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531797498", "date2": "1531798053", "bleu_score": "0.9930705729924024", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "10 10 20\n1 1\n1 4\n1 9\n2 5\n3 10\n4 2\n4 7\n5 9\n6 4\n6 6\n6 7\n7 2\n7 3\n7 7\n8 1\n8 5\n8 10\n9 2\n10 4\n10 9\n", "actual_output": "4\n0\n26\n19\n13\n2\n0\n0\n0\n0\n0\n", "expected_output": "4\n26\n19\n13\n2\n0\n0\n0\n0\n0\n\n", "anno_code": ["h, w, n = map(int, input().split()) # (0): h=10, w=10, n=20\nab = [list(map(int, input().split())) for _ in range(n)] # (1): ab\n\nsa = {} # (2): sa={}\nfor a,b in ab: # (3): a=1, b=1 (30): b=4 ... (970): NO CHANGE\n for i in range(3): # (4): i=0 (8): i=1 ... (969): NO CHANGE\n aa = a + i # (5): aa=1 (9): aa=2 ... (966): aa=12\n if aa < 3 or h < aa: # (6): NO CHANGE (10): NO CHANGE ... (967): NO CHANGE\n continue # (7): NO CHANGE (11): NO CHANGE ... (968): NO CHANGE\n for j in range(3): # (15): j=0 (19): j=1 ... (960): NO CHANGE\n bb = b + j # (16): bb=1 (20): bb=2 ... (957): bb=11\n if bb < 3 or w < bb: # (17): NO CHANGE (21): NO CHANGE ... (958): NO CHANGE\n continue # (18): NO CHANGE (22): NO CHANGE ... (959): NO CHANGE\n id = \"%d,%d\" % (aa, bb) # (26): id=3,3 (45): id=3,4 ... (954): id=10,10\n sa[id] = sa.get(id, 0) + 1 # (27): sa={'3,3': 1} (46): sa={'3,3': 1, '3,4': 1} ... (955): sa={'3,3': 1, '3,4': 1, '3,5': 2, '3,6': 2, '3,9': 1, '3,10': 2, '3,7': 1, '4,5': 1, '4,6': 1, '4,7': 2, '4,10': 1, '5,10': 2, '4,3': 1, '4,4': 1, '5,3': 1, '5,4': 1, '6,3': 1, '6,4': 2, '4,8': 1, '4,9': 1, '5,7': 1, '5,8': 1, '5,9': 2, '6,7': 3, '6,8': 3, '6,9': 3, '6,10': 1, '7,9': 3, '7,10': 1, '6,5': 1, '6,6': 2, '7,4': 3, '7,5': 2, '7,6': 2, '8,4': 3, '8,5': 3, '8,6': 3, '7,7': 3, '7,8': 3, '8,7': 4, '8,8': 3, '8,9': 2, '7,3': 2, '8,3': 3, '9,3': 4, '9,4': 3, '9,5': 2, '9,7': 2, '9,8': 1, '9,9': 1, '10,3': 2, '9,6': 1, '10,5': 2, '10,6': 2, '10,7': 1, '8,10': 1, '9,10': 1, '10,10': 2, '10,4': 2, '10,9': 1}\n\ns = {} # (971): s={}\nfor x in sa.values(): # (972): x=1 (974): NO CHANGE ... (1092): NO CHANGE\n s[x] = s.setdefault(x, 0) + 1 # (973): s={1: 1} (975): s={1: 2} ... (1091): s={1: 26, 2: 19, 3: 13, 4: 2}\nprint((w - 2) * (h - 2) - len(sa.keys())) # (1093): NO CHANGE\nfor i in range(10): # (1094): i=0 (1096): i=1 ... (1112): i=9\n print(s.get(i, 0)) # (1095): NO CHANGE (1097): NO CHANGE ... (1113): NO CHANGE\n"], "anno_status": [false], "diff_content": " h, w, n = map(int, input().split())\n ab = [list(map(int, input().split())) for _ in range(n)]\n \n sa = {}\n for a,b in ab:\n for i in range(3):\n aa = a + i\n if aa < 3 or h < aa:\n continue\n for j in range(3):\n bb = b + j\n if bb < 3 or w < bb:\n continue\n id = \"%d,%d\" % (aa, bb)\n sa[id] = sa.get(id, 0) + 1\n \n s = {}\n for x in sa.values():\n s[x] = s.setdefault(x, 0) + 1\n print((w - 2) * (h - 2) - len(sa.keys()))\n-for i in range(10):\n+for i in range(1, 10):\n print(s.get(i, 0))\n", "FL_content": "\n h, w, n = map(int, input().split())\n ab = [list(map(int, input().split())) for _ in range(n)]\n \n sa = {}\n for a,b in ab:\n for i in range(3):\n aa = a + i\n if aa < 3 or h < aa:\n continue\n for j in range(3):\n bb = b + j\n if bb < 3 or w < bb:\n continue\n id = \"%d,%d\" % (aa, bb)\n sa[id] = sa.get(id, 0) + 1\n \n s = {}\n for x in sa.values():\n s[x] = s.setdefault(x, 0) + 1\n-print((w - 2) * (h - 2) - len(sa.keys()))\n for i in range(10):\n print(s.get(i, 0))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u200887663", "problem_id": "p03730", "submission1_id": "s944910793-FL", "submission2_id": "s283828367", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,c=map(int,input().split())\nst=\"NO\"\nfor i in range(a,b*a+1):\n if i%b==0:\n st=\"YES\"\n break\n\nprint(st)\n\n\n", "code2": "a,b,c=map(int,input().split())\nst=\"NO\"\nfor i in range(1,b+1):\n temp=i*a\n if temp % b ==c:\n st=\"YES\"\n break\n\nprint(st)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1572925573", "date2": "1572926512", "bleu_score": "0.7911132239710585", "code1_test_status": [0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 74, "total_score": 92, "input": "33 42 5\n", "actual_output": "YES\n", "expected_output": "NO\n\n", "anno_code": ["a,b,c=map(int,input().split()) # (0): a=33, b=42, c=5\nst=\"NO\" # (1): st=NO\nfor i in range(a,b*a+1): # (2): i=33 (4): i=34 ... (20): i=42\n if i%b==0: # (3): NO CHANGE (5): NO CHANGE ... (21): NO CHANGE\n st=\"YES\" # (22): st=YES\n break # (23): NO CHANGE\n\nprint(st)\n\n\n"], "anno_status": [true], "diff_content": " a,b,c=map(int,input().split())\n st=\"NO\"\n-for i in range(a,b*a+1):\n- if i%b==0:\n+for i in range(1,b+1):\n+ temp=i*a\n+ if temp % b ==c:\n st=\"YES\"\n break\n \n print(st)\n \n-\n-\n", "FL_content": "\n a,b,c=map(int,input().split())\n st=\"NO\"\n-for i in range(a,b*a+1):\n if i%b==0:\n st=\"YES\"\n break\n \n print(st)\n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u117193815", "problem_id": "p03254", "submission1_id": "s174929946-FL", "submission2_id": "s448897511", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n,x=map(int, input().split())\nl=sorted(list(map(int, input().split())))\nans=0\nif x==sum(l):\n print(n)\nelif x>sum(l):\n print(n-1)\nelse:\n for i in range(n):\n if x-l[i]>=0:\n ans+=1\n else:\n print(ans)\n exit()\n print(ans-1) \n ", "code2": "n,x=map(int, input().split())\nl=sorted(list(map(int, input().split())))\nans=0\nif x==sum(l):\n print(n)\nelif x>sum(l):\n print(n-1)\nelse:\n for i in range(n):\n if x>=l[i]:\n ans+=1\n x=x-l[i]\n else:\n print(ans)\n exit()", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577551137", "date2": "1577552786", "bleu_score": "0.9134798573599737", "code1_test_status": [1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 104, "input": "3 10\n20 4 10\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " n,x=map(int, input().split())\n l=sorted(list(map(int, input().split())))\n ans=0\n if x==sum(l):\n print(n)\n elif x>sum(l):\n print(n-1)\n else:\n for i in range(n):\n- if x-l[i]>=0:\n+ if x>=l[i]:\n ans+=1\n+ x=x-l[i]\n else:\n print(ans)\n exit()\n- print(ans-1) \n- \n", "FL_content": "\n n,x=map(int, input().split())\n l=sorted(list(map(int, input().split())))\n ans=0\n if x==sum(l):\n print(n)\n elif x>sum(l):\n print(n-1)\n else:\n for i in range(n):\n if x-l[i]>=0:\n ans+=1\n else:\n print(ans)\n exit()\n- print(ans-1) \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u198574985", "problem_id": "p02420", "submission1_id": "s591516738-FL", "submission2_id": "s305785355", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while True:\n\n string = str(input())\n box = \"\"\n \n \n if string == \"-\":\n break\n \n shuffle = int(input())\n\n h = [0]*shuffle\n\n for a in range(shuffle):\n h[a] = int(input())\n\n for b in range(shuffle):\n box = string[0:h[b]]\n string = string[h[b]:]\n string = string+box\n box = \"\"\n print(string)\n\n print(string)\n", "code2": "while True:\n\n string = str(input())\n box = \"\"\n \n \n if string == \"-\":\n break\n \n shuffle = int(input())\n\n h = [0]*shuffle\n\n for a in range(shuffle):\n h[a] = int(input())\n\n for b in range(shuffle):\n box = string[0:h[b]]\n string = string[h[b]:]\n string = string+box\n box = \"\"\n\n print(string)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1545337568", "date2": "1545337595", "bleu_score": "0.939232427678793", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "aaac\n3\n1\n2\n1\nvwxyz\n2\n2\n4\n-\n", "actual_output": "aaca\ncaaa\naaac\naaac\nxyzvw\nwxyzv\nwxyzv\n", "expected_output": "aaac\nwxyzv\n\n", "anno_code": ["while True: # (0): NO CHANGE (33): NO CHANGE (58): NO CHANGE\n\n string = str(input()) # (1): string=aaac (34): string=vwxyz (59): string=-\n box = \"\" # (2): box= (35): NO CHANGE (60): NO CHANGE\n \n \n if string == \"-\": # (3): NO CHANGE (36): NO CHANGE (61): NO CHANGE\n break\n \n shuffle = int(input()) # (4): shuffle=3 (37): shuffle=2\n\n h = [0]*shuffle # (5): h=[0, 0, 0] (38): h=[0, 0]\n\n for a in range(shuffle): # (6): a=0 (8): a=1 ... (43): NO CHANGE\n h[a] = int(input()) # (7): h=[1, 0, 0] (9): h=[1, 2, 0] ... (42): h=[2, 4]\n\n for b in range(shuffle): # (13): b=0 (19): b=1 ... (56): NO CHANGE\n box = string[0:h[b]] # (14): box=a (20): box=aa ... (51): box=xyzv\n string = string[h[b]:] # (15): string=aac (21): string=ca ... (52): string=w\n string = string+box # (16): string=aaca (22): string=caaa ... (53): string=wxyzv\n box = \"\" # (17): box= (23): box= ... (54): box=\n print(string) # (18): NO CHANGE (24): NO CHANGE ... (55): NO CHANGE\n\n print(string) # (32): NO CHANGE (57): NO CHANGE\n"], "anno_status": [true], "diff_content": " while True:\n \n string = str(input())\n box = \"\"\n \n \n if string == \"-\":\n break\n \n shuffle = int(input())\n \n h = [0]*shuffle\n \n for a in range(shuffle):\n h[a] = int(input())\n \n for b in range(shuffle):\n box = string[0:h[b]]\n string = string[h[b]:]\n string = string+box\n box = \"\"\n- print(string)\n \n print(string)\n \n", "FL_content": "\n while True:\n \n string = str(input())\n box = \"\"\n \n \n if string == \"-\":\n break\n \n shuffle = int(input())\n \n h = [0]*shuffle\n \n for a in range(shuffle):\n h[a] = int(input())\n \n for b in range(shuffle):\n box = string[0:h[b]]\n string = string[h[b]:]\n string = string+box\n box = \"\"\n- print(string)\n \n print(string)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 25 }, { "user_id": "u203748490", "problem_id": "p03380", "submission1_id": "s253476083-FL", "submission2_id": "s229683811", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nan = [int(i) for i in input().split()]\nai = max(an)\nprint(\"%d %d\"%(ai, min(an, key=lambda i:abs(ai-i**2))))", "code2": "n = int(input())\nan = [int(i) for i in input().split()]\nan.sort()\nai = an[-1]\nprint(\"%d %d\"%(ai, min(an, key=lambda i:abs(ai-i*2))))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1523827556", "date2": "1523828021", "bleu_score": "0.8707489443940448", "code1_test_status": [0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1], "code1_test_score": 51, "total_score": 100, "input": "5\n10 9 1 4 20\n", "actual_output": "20 4\n", "expected_output": "20 10\n\n", "anno_code": ["n = int(input()) # (0): n=5\nan = [int(i) for i in input().split()] # (1): an=[10, 9, 1, 4, 20]\nai = max(an) # (2): ai=20\nprint(\"%d %d\"%(ai, min(an, key=lambda i:abs(ai-i**2))))"], "anno_status": [true], "diff_content": " n = int(input())\n an = [int(i) for i in input().split()]\n-ai = max(an)\n-print(\"%d %d\"%(ai, min(an, key=lambda i:abs(ai-i**2))))\n+an.sort()\n+ai = an[-1]\n+print(\"%d %d\"%(ai, min(an, key=lambda i:abs(ai-i*2))))\n", "FL_content": "\n n = int(input())\n an = [int(i) for i in input().split()]\n ai = max(an)\n-print(\"%d %d\"%(ai, min(an, key=lambda i:abs(ai-i**2))))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 4 }, { "user_id": "u581187895", "problem_id": "p03698", "submission1_id": "s089152251-FL", "submission2_id": "s629017860", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\ns = input().rstrip()\nprint(\"yes\" if set(s) == s else \"no\")", "code2": "import sys\ninput = sys.stdin.readline\n\ns = input().rstrip()\nprint(\"yes\" if len(set(s)) == len(s) else \"no\")", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1557787588", "date2": "1557787730", "bleu_score": "0.8665045360686334", "code1_test_status": [1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1], "code1_test_score": 67, "total_score": 103, "input": "mq\n", "actual_output": "no\n", "expected_output": "yes\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\ns = input().rstrip() # (1): s=mq\nprint(\"yes\" if set(s) == s else \"no\")"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n \n s = input().rstrip()\n-print(\"yes\" if set(s) == s else \"no\")\n+print(\"yes\" if len(set(s)) == len(s) else \"no\")\n", "FL_content": "\n import sys\n input = sys.stdin.readline\n \n s = input().rstrip()\n-print(\"yes\" if set(s) == s else \"no\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u449555432", "problem_id": "p03698", "submission1_id": "s486904540-FL", "submission2_id": "s894245965", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(input())\nt = set(s)\nprint(s)\nprint(t)\nif len(s) == len(t):\n\tprint('yes')\nelse:\n\tprint('no')", "code2": "s = list(input())\nt = set(s)\nif len(s) == len(t):\n\tprint('yes')\nelse:\n\tprint('no')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554342842", "date2": "1554342886", "bleu_score": "0.8003573595907328", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "uxrmg`cjdhpspme\n", "actual_output": "['u', 'x', 'r', 'm', 'g', '`', 'c', 'j', 'd', 'h', 'p', 's', 'p', 'm', 'e']\n{'m', 'u', 'c', 'p', 's', 'g', 'h', '`', 'd', 'j', 'x', 'e', 'r'}\nno\n", "expected_output": "no\n\n", "anno_code": ["s = list(input()) # (0): s=['u', 'x', 'r', 'm', 'g', '`', 'c', 'j', 'd', 'h', 'p', 's', 'p', 'm', 'e']\nt = set(s) # (1): t={'m', 'd', 'g', 'h', 'c', '`', 'j', 'r', 'p', 'e', 'x', 's', 'u'}\nprint(s) # (2): NO CHANGE\nprint(t) # (3): NO CHANGE\nif len(s) == len(t): # (4): NO CHANGE\n\tprint('yes')\nelse:\n\tprint('no')"], "anno_status": [true], "diff_content": " s = list(input())\n t = set(s)\n-print(s)\n-print(t)\n if len(s) == len(t):\n \tprint('yes')\n else:\n \tprint('no')\n", "FL_content": "\n s = list(input())\n t = set(s)\n-print(s)\n-print(t)\n if len(s) == len(t):\n \tprint('yes')\n else:\n \tprint('no')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u148551245", "problem_id": "p02865", "submission1_id": "s245785026-FL", "submission2_id": "s406527640", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nif n % 2 == 0:\n print((n - 1) / 2)\nelse:\n print((n - 1) / 2 - 1)", "code2": "n = int(input())\nif n % 2 == 1:\n print(int((n - 1) / 2))\nelse:\n print(int(n / 2 - 1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573351437", "date2": "1573352078", "bleu_score": "0.8440051448445851", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 46, "input": "27115\n", "actual_output": "13556.0\n", "expected_output": "13557\n\n", "anno_code": ["n = int(input()) # (0): n=27115\nif n % 2 == 0: # (1): NO CHANGE\n print((n - 1) / 2)\nelse:\n print((n - 1) / 2 - 1)"], "anno_status": [true], "diff_content": " n = int(input())\n-if n % 2 == 0:\n- print((n - 1) / 2)\n+if n % 2 == 1:\n+ print(int((n - 1) / 2))\n else:\n- print((n - 1) / 2 - 1)\n+ print(int(n / 2 - 1))\n", "FL_content": "\n n = int(input())\n if n % 2 == 0:\n- print((n - 1) / 2)\n else:\n- print((n - 1) / 2 - 1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u818655004", "problem_id": "p03380", "submission1_id": "s078330461-FL", "submission2_id": "s685100409", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na_n = list(map(int, input().split()))\nresult1 = max(a_n)\nmin_delta = max(a_n)\nresult2 = max(a_n)\nfor num in a_n:\n if abs(num-n/2)=0:\n v+=(a*r*pow(3,l+r-1,mod))+(l*c*pow(3,l+r-1,mod))\n if l+r-2>=0:\n v+=(l*r*pow(3,l+r-2,mod))\n v%=mod", "code2": "from itertools import accumulate as ac\ns=input()\nn=len(s)\nmod=int(1e9)+7\n\n*aca,=ac([0]+[1 if i==\"A\" else 0 for i in s])\n*acc,=ac([0]+[1 if i==\"C\" else 0 for i in s])\n*acq,=ac([0]+[1 if i==\"?\" else 0 for i in s])\n\nv=0\nfor i in range(1,n-1):\n if s[i]==\"B\" or s[i]==\"?\":\n a=aca[i]\n l=acq[i]\n c=acc[n]-acc[i+1]\n r=acq[n]-acq[i+1]\n v+=(a*c*pow(3,l+r,mod))\n if l+r-1>=0:\n v+=(a*r*pow(3,l+r-1,mod))+(l*c*pow(3,l+r-1,mod))\n if l+r-2>=0:\n v+=(l*r*pow(3,l+r-2,mod))\n v%=mod\nprint(v)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1535811919", "date2": "1535811956", "bleu_score": "0.9821957578130807", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "@>A>=???A?@>;@A=C@@<==@?>\n", "actual_output": "", "expected_output": "954\n\n", "anno_code": ["from itertools import accumulate as ac\ns=input() # (0): s=@>A>=???A?@>;@A=C@@<==@?>\nn=len(s) # (1): n=25\nmod=int(1e9)+7 # (2): mod=1000000007\n\n*aca,=ac([0]+[1 if i==\"A\" else 0 for i in s]) # (3): aca=[0, 0, ..., 3, 3]\n*acc,=ac([0]+[1 if i==\"C\" else 0 for i in s]) # (4): acc=[0, 0, ..., 1, 1]\n*acq,=ac([0]+[1 if i==\"?\" else 0 for i in s]) # (5): acq=[0, 0, ..., 5, 5]\n\nv=0 # (6): v=0\nfor i in range(1,n-1): # (7): i=1 (9): i=2 ... (91): i=23\n if s[i]==\"B\" or s[i]==\"?\": # (8): NO CHANGE (10): NO CHANGE ... (92): NO CHANGE\n a=aca[i] # (17): a=1 (29): NO CHANGE ... (93): a=3\n l=acq[i] # (18): l=0 (30): l=1 ... (94): l=4\n c=acc[n]-acc[i+1] # (19): c=1 (31): NO CHANGE ... (95): c=0\n r=acq[n]-acq[i+1] # (20): r=4 (32): r=3 ... (96): r=0\n v+=(a*c*pow(3,l+r,mod)) # (21): v=81 (33): v=270 ... (97): NO CHANGE\n if l+r-1>=0: # (22): NO CHANGE (34): NO CHANGE ... (98): NO CHANGE\n v+=(a*r*pow(3,l+r-1,mod))+(l*c*pow(3,l+r-1,mod)) # (23): v=189 (35): v=378 ... (99): NO CHANGE\n if l+r-2>=0: # (24): NO CHANGE (36): NO CHANGE ... (100): NO CHANGE\n v+=(l*r*pow(3,l+r-2,mod)) # (25): NO CHANGE (37): v=405 ... (101): NO CHANGE\n v%=mod # (26): NO CHANGE (38): NO CHANGE ... (102): NO CHANGE\n"], "anno_status": [false], "diff_content": " from itertools import accumulate as ac\n s=input()\n n=len(s)\n mod=int(1e9)+7\n \n *aca,=ac([0]+[1 if i==\"A\" else 0 for i in s])\n *acc,=ac([0]+[1 if i==\"C\" else 0 for i in s])\n *acq,=ac([0]+[1 if i==\"?\" else 0 for i in s])\n \n v=0\n for i in range(1,n-1):\n if s[i]==\"B\" or s[i]==\"?\":\n a=aca[i]\n l=acq[i]\n c=acc[n]-acc[i+1]\n r=acq[n]-acq[i+1]\n v+=(a*c*pow(3,l+r,mod))\n if l+r-1>=0:\n v+=(a*r*pow(3,l+r-1,mod))+(l*c*pow(3,l+r-1,mod))\n if l+r-2>=0:\n v+=(l*r*pow(3,l+r-2,mod))\n v%=mod\n+print(v)\n", "FL_content": "\n from itertools import accumulate as ac\n s=input()\n n=len(s)\n mod=int(1e9)+7\n \n *aca,=ac([0]+[1 if i==\"A\" else 0 for i in s])\n *acc,=ac([0]+[1 if i==\"C\" else 0 for i in s])\n *acq,=ac([0]+[1 if i==\"?\" else 0 for i in s])\n \n v=0\n for i in range(1,n-1):\n if s[i]==\"B\" or s[i]==\"?\":\n a=aca[i]\n l=acq[i]\n c=acc[n]-acc[i+1]\n r=acq[n]-acq[i+1]\n v+=(a*c*pow(3,l+r,mod))\n if l+r-1>=0:\n v+=(a*r*pow(3,l+r-1,mod))+(l*c*pow(3,l+r-1,mod))\n if l+r-2>=0:\n v+=(l*r*pow(3,l+r-2,mod))\n v%=mod\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 22 }, { "user_id": "u761529120", "problem_id": "p03353", "submission1_id": "s080597082-FL", "submission2_id": "s289930994", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n s = input()\n K = int(input())\n\n S = set()\n\n for i in range(len(s)):\n for j in range(1, K+1):\n print(s[i:i+j])\n S.add(s[i:i+j])\n \n sort_S = sorted(list(S))\n\n print(sort_S[K-1])\nmain()", "code2": "def main():\n s = input()\n K = int(input())\n\n S = set()\n\n for i in range(len(s)):\n for j in range(1, K+1):\n S.add(s[i:i+j])\n \n sort_S = sorted(list(S))\n\n print(sort_S[K-1])\nmain()", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1565784381", "date2": "1565784413", "bleu_score": "0.8789456120040121", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "``d\n2\n", "actual_output": "`\n``\n`\n`d\nd\nd\n``\n", "expected_output": "``\n\n", "anno_code": ["def main(): # (0): main=\n s = input() # (2): s=``d\n K = int(input()) # (3): K=2\n\n S = set() # (4): S=set()\n\n for i in range(len(s)): # (5): i=0 (13): i=1 ... (29): NO CHANGE\n for j in range(1, K+1): # (6): j=1 (9): j=2 ... (28): NO CHANGE\n print(s[i:i+j]) # (7): NO CHANGE (10): NO CHANGE ... (26): NO CHANGE\n S.add(s[i:i+j]) # (8): S={'`'} (11): S={'``', '`'} ... (27): NO CHANGE\n \n sort_S = sorted(list(S)) # (30): sort_S=['`', '``', '`d', 'd']\n\n print(sort_S[K-1])\nmain() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " def main():\n s = input()\n K = int(input())\n \n S = set()\n \n for i in range(len(s)):\n for j in range(1, K+1):\n- print(s[i:i+j])\n S.add(s[i:i+j])\n \n sort_S = sorted(list(S))\n \n print(sort_S[K-1])\n main()\n", "FL_content": "\n def main():\n s = input()\n K = int(input())\n \n S = set()\n \n for i in range(len(s)):\n for j in range(1, K+1):\n- print(s[i:i+j])\n S.add(s[i:i+j])\n \n sort_S = sorted(list(S))\n \n print(sort_S[K-1])\n main()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u024245528", "problem_id": "p02843", "submission1_id": "s238522810-FL", "submission2_id": "s580569756", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from itertools import permutations, combinations,combinations_with_replacement,product\n\nX =int(input())\n\ns =str(X/100)\n\ns_list =s.split('.')\n\nA =[0,1,2,3,4,5]\n\nfor h in range(1,int(s_list[0])+1):\n for i in combinations_with_replacement(A,h):\n if sum(i) == int(s_list[1]):\n print(i)\n \n \n\nprint(\"0\")\n", "code2": "from itertools import permutations, combinations,combinations_with_replacement,product\n\nX =int(input())\n\ns =str(X/100)\n\ns_list =s.split('.')\n\nA =[0,1,2,3,4,5]\n\nfor h in range(1,int(s_list[0])+1):\n for i in combinations_with_replacement(A,h):\n if sum(i) == int(s_list[1]):\n \n print(\"1\")\n exit()\n\nprint(\"0\")\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575255278", "date2": "1575255357", "bleu_score": "0.9661334616565417", "code1_test_status": [1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1], "code1_test_score": 21, "total_score": 26, "input": "420\n", "actual_output": "(2,)\n(0, 2)\n(1, 1)\n(0, 0, 2)\n(0, 1, 1)\n(0, 0, 0, 2)\n(0, 0, 1, 1)\n0\n", "expected_output": "1\n\n", "anno_code": ["from itertools import permutations, combinations,combinations_with_replacement,product\n\nX =int(input()) # (0): X=420\n\ns =str(X/100) # (1): s=4.2\n\ns_list =s.split('.') # (2): s_list=['4', '2']\n\nA =[0,1,2,3,4,5] # (3): A=[0, 1, 2, 3, 4, 5]\n\nfor h in range(1,int(s_list[0])+1): # (4): h=1 (19): h=2 ... (437): NO CHANGE\n for i in combinations_with_replacement(A,h): # (5): i=(0,) (7): i=(1,) ... (436): NO CHANGE\n if sum(i) == int(s_list[1]): # (6): NO CHANGE (8): NO CHANGE ... (435): NO CHANGE\n print(i) # (11): NO CHANGE (26): NO CHANGE ... (197): NO CHANGE\n \n \n\nprint(\"0\")\n"], "anno_status": [true], "diff_content": " from itertools import permutations, combinations,combinations_with_replacement,product\n \n X =int(input())\n \n s =str(X/100)\n \n s_list =s.split('.')\n \n A =[0,1,2,3,4,5]\n \n for h in range(1,int(s_list[0])+1):\n for i in combinations_with_replacement(A,h):\n if sum(i) == int(s_list[1]):\n- print(i)\n- \n \n+ print(\"1\")\n+ exit()\n \n print(\"0\")\n \n", "FL_content": "\n from itertools import permutations, combinations,combinations_with_replacement,product\n \n X =int(input())\n \n s =str(X/100)\n \n s_list =s.split('.')\n \n A =[0,1,2,3,4,5]\n \n for h in range(1,int(s_list[0])+1):\n for i in combinations_with_replacement(A,h):\n if sum(i) == int(s_list[1]):\n- print(i)\n \n \n \n print(\"0\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 19 }, { "user_id": "u915763824", "problem_id": "p03448", "submission1_id": "s801940214-FL", "submission2_id": "s084890270", "status1": "Wrong Answer", "status2": "Accepted", "code1": "c500 = int(input())\nc100 = int(input())\nc50 = int(input())\nx = int(input())\ncount = 0\n \nfor c500_n in range(1, c500):\n for c100_n in range(1, c100):\n for c50_n in range(1, c50):\n if c500_n*500 + c100_n*100 + c50_n*50 == x:\n count += 1\n \nprint(count)", "code2": "c500 = int(input())\nc100 = int(input())\nc50 = int(input())\nx = int(input())\ncount = 0\n \nfor c500_n in range(c500+1):\n for c100_n in range(c100+1):\n for c50_n in range(c50+1):\n if c500_n*500 + c100_n*100 + c50_n*50 == x:\n count += 1\n \nprint(count)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1594917365", "date2": "1594917579", "bleu_score": "0.9339400930508972", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0], "code1_test_score": 86, "total_score": 103, "input": "2\n0\n1\n000\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["c500 = int(input()) # (0): c500=2\nc100 = int(input()) # (1): c100=0\nc50 = int(input()) # (2): c50=1\nx = int(input()) # (3): x=0\ncount = 0 # (4): count=0\n \nfor c500_n in range(1, c500): # (5): c500_n=1 (7): NO CHANGE\n for c100_n in range(1, c100): # (6): NO CHANGE\n for c50_n in range(1, c50):\n if c500_n*500 + c100_n*100 + c50_n*50 == x:\n count += 1\n \nprint(count)"], "anno_status": [true], "diff_content": " c500 = int(input())\n c100 = int(input())\n c50 = int(input())\n x = int(input())\n count = 0\n \n-for c500_n in range(1, c500):\n- for c100_n in range(1, c100):\n- for c50_n in range(1, c50):\n+for c500_n in range(c500+1):\n+ for c100_n in range(c100+1):\n+ for c50_n in range(c50+1):\n if c500_n*500 + c100_n*100 + c50_n*50 == x:\n count += 1\n \n print(count)\n", "FL_content": "\n c500 = int(input())\n c100 = int(input())\n c50 = int(input())\n x = int(input())\n count = 0\n \n-for c500_n in range(1, c500):\n- for c100_n in range(1, c100):\n- for c50_n in range(1, c50):\n if c500_n*500 + c100_n*100 + c50_n*50 == x:\n count += 1\n \n print(count)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u858670323", "problem_id": "p02865", "submission1_id": "s472749224-FL", "submission2_id": "s930941616", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nif N % 2 == 0:\n print(N/2 -1)\nelse:\n print((N+1)/2-1)", "code2": "N = int(input())\nif N % 2 == 0:\n print(int(N/2 -1))\nelse:\n print(int((N+1)/2-1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573353506", "date2": "1573353564", "bleu_score": "0.8725600545514082", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 46, "input": "23008\n", "actual_output": "11503.0\n", "expected_output": "11503\n\n", "anno_code": ["N = int(input()) # (0): N=23008\nif N % 2 == 0: # (1): NO CHANGE\n print(N/2 -1)\nelse:\n print((N+1)/2-1)"], "anno_status": [true], "diff_content": " N = int(input())\n if N % 2 == 0:\n- print(N/2 -1)\n+ print(int(N/2 -1))\n else:\n- print((N+1)/2-1)\n+ print(int((N+1)/2-1))\n", "FL_content": "\n N = int(input())\n if N % 2 == 0:\n- print(N/2 -1)\n else:\n- print((N+1)/2-1)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u280512618", "problem_id": "p03297", "submission1_id": "s298673787-FL", "submission2_id": "s802848106", "status1": "Wrong Answer", "status2": "Accepted", "code1": "class query:\n def __init__(self, a, b, c, d):\n self.a = a\n self.b = b\n self.c = c\n self.d = d\n def isEternal(self):\n if self.a < self.b:\n return \"No\"\n ab = self.a % self.b\n if ab > self.c:\n return \"No\"\n if self.d < self.b:\n return \"No\"\n d = self.b - self.c\n if d <= 0:\n return \"Yes\"\n if self.b % d == 0 and self.d % d == 0:\n return \"Yes\"\n db = self.d % self.b\n if db == 0:\n return \"Yes\"\n q, r = divmod((self.c - ab), db)\n q += 1 if r != 0 else 0\n if q * db < self.b - ab:\n return \"No\"\n return \"Yes\"\n\nif __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n", "code2": "def gcd(a, b):\n r = a % b\n while r != 0:\n a, b, r = b, r, b % r\n return b\n\nclass query:\n def __init__(self, a, b, c, d):\n self.a = a\n self.b = b\n self.c = c\n self.d = d\n def isEternal(self):\n if self.a < self.b:\n return \"No\"\n if self.d < self.b:\n return \"No\"\n if self.b <= self.c:\n return \"Yes\"\n g = gcd(self.d, self.b)\n if self.b - g + self.a % g > self.c:\n return \"No\"\n return \"Yes\"\n\nif __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1531624258", "date2": "1531631102", "bleu_score": "0.7101017761836365", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 102, "input": "14\n9 7 9 9\n9 7 6 9\n14 10 7 12\n14 10 8 12\n14 10 9 12\n14 10 7 11\n14 10 8 11\n14 10 9 11\n11 19 3 10\n10 11 5 10\n11 10 5 10\n16 10 5 10\n1000000000100000000 17 14 999999999999999985\n1000000000000000000 27 15 999999999999999985\n", "actual_output": "Yes\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nNo\nYes\nNo\nYes\nYes\n", "expected_output": "Yes\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nNo\nYes\nNo\nYes\nNo\n\n", "anno_code": ["class query: # (0): query=\n def __init__(self, a, b, c, d):\n self.a = a\n self.b = b\n self.c = c\n self.d = d\n def isEternal(self):\n if self.a < self.b:\n return \"No\"\n ab = self.a % self.b\n if ab > self.c:\n return \"No\"\n if self.d < self.b:\n return \"No\"\n d = self.b - self.c\n if d <= 0:\n return \"Yes\"\n if self.b % d == 0 and self.d % d == 0:\n return \"Yes\"\n db = self.d % self.b\n if db == 0:\n return \"Yes\"\n q, r = divmod((self.c - ab), db)\n q += 1 if r != 0 else 0\n if q * db < self.b - ab:\n return \"No\"\n return \"Yes\"\n\nif __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n"], "anno_status": [false], "diff_content": "+def gcd(a, b):\n+ r = a % b\n+ while r != 0:\n+ a, b, r = b, r, b % r\n+ return b\n+\n class query:\n def __init__(self, a, b, c, d):\n self.a = a\n self.b = b\n self.c = c\n self.d = d\n def isEternal(self):\n if self.a < self.b:\n return \"No\"\n- ab = self.a % self.b\n- if ab > self.c:\n- return \"No\"\n if self.d < self.b:\n return \"No\"\n- d = self.b - self.c\n- if d <= 0:\n- return \"Yes\"\n- if self.b % d == 0 and self.d % d == 0:\n- return \"Yes\"\n- db = self.d % self.b\n- if db == 0:\n+ if self.b <= self.c:\n return \"Yes\"\n- q, r = divmod((self.c - ab), db)\n- q += 1 if r != 0 else 0\n- if q * db < self.b - ab:\n+ g = gcd(self.d, self.b)\n+ if self.b - g + self.a % g > self.c:\n return \"No\"\n return \"Yes\"\n \n if __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n \n", "FL_content": "\n class query:\n def __init__(self, a, b, c, d):\n self.a = a\n self.b = b\n self.c = c\n self.d = d\n def isEternal(self):\n if self.a < self.b:\n return \"No\"\n ab = self.a % self.b\n if ab > self.c:\n return \"No\"\n if self.d < self.b:\n return \"No\"\n d = self.b - self.c\n if d <= 0:\n return \"Yes\"\n if self.b % d == 0 and self.d % d == 0:\n return \"Yes\"\n db = self.d % self.b\n if db == 0:\n return \"Yes\"\n q, r = divmod((self.c - ab), db)\n q += 1 if r != 0 else 0\n- if q * db < self.b - ab:\n return \"No\"\n return \"Yes\"\n \n if __name__ == \"__main__\":\n t = int(input())\n querys = [query(*[int(s) for s in input().split()]) for _ in range(t)]\n for q in querys:\n print(q.isEternal())\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 34 }, { "user_id": "u629540524", "problem_id": "p02916", "submission1_id": "s140948200-FL", "submission2_id": "s330736304", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na,b,c = [list(map(int,input().split())) for i in range(3)]\nx = 0\nd = -10\nfor i in range(n):\n x += b[a[i]-1]\n if i-1 == d:\n x+= c[d]\n if d != 0:\n d=i\nprint(x)", "code2": "n = int(input())\na,b,c = [list(map(int,input().split())) for i in range(3)]\nx = 0\nd = -10\nfor i in range(n):\n y = b[a[i]-1]\n x += y\n if a[i]-1 == d:\n x+= c[d-1]\n d = a[i]\nprint(x)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598563292", "date2": "1598564285", "bleu_score": "0.8894821634820492", "code1_test_status": [0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0], "code1_test_score": 21, "total_score": 103, "input": "4\n2 3 4 1\n20 5 1 24\n45 9 16\n", "actual_output": "95\n", "expected_output": "75\n\n", "anno_code": ["n = int(input()) # (0): n=4\na,b,c = [list(map(int,input().split())) for i in range(3)] # (1): a=[2, 3, 4, 1], b=[20, 5, 1, 24], c=[45, 9, 16]\nx = 0 # (2): x=0\nd = -10 # (3): d=-10\nfor i in range(n): # (4): i=0 (9): i=1 ... (22): NO CHANGE\n x += b[a[i]-1] # (5): x=5 (10): x=6 ... (19): x=95\n if i-1 == d: # (6): NO CHANGE (11): NO CHANGE ... (20): NO CHANGE\n x+= c[d] # (12): x=51\n if d != 0: # (7): NO CHANGE (13): NO CHANGE ... (21): NO CHANGE\n d=i # (8): d=0\nprint(x)"], "anno_status": [true], "diff_content": " n = int(input())\n a,b,c = [list(map(int,input().split())) for i in range(3)]\n x = 0\n d = -10\n for i in range(n):\n- x += b[a[i]-1]\n- if i-1 == d:\n- x+= c[d]\n- if d != 0:\n- d=i\n+ y = b[a[i]-1]\n+ x += y\n+ if a[i]-1 == d:\n+ x+= c[d-1]\n+ d = a[i]\n print(x)\n", "FL_content": "\n n = int(input())\n a,b,c = [list(map(int,input().split())) for i in range(3)]\n x = 0\n-d = -10\n for i in range(n):\n x += b[a[i]-1]\n if i-1 == d:\n x+= c[d]\n- if d != 0:\n- d=i\n print(x)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u585391547", "problem_id": "p00015", "submission1_id": "s692007952-FL", "submission2_id": "s980917527", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nfor n in range(n):\n\ta=int(input())\n\tb=int(input())\n\tc=a+b\n\tif a>=int(1e80) or b>=int(1e80) or c>=int(1e80):\n\t\tprint(\"overflow\")\n\telse:\n\t\tprint(c)", "code2": "n=int(input())\nfor i in range(n):\n\ta=int(input())\n\tb=int(input())\n\tc=a+b\n\tc=str(c)\n\tif len(c)>80:\n\t\tprint(\"overflow\")\n\telse:\n\t\tprint(c)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1412872829", "date2": "1413205987", "bleu_score": "0.707424422410111", "code1_test_status": [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0], "code1_test_score": 98, "total_score": 101, "input": "6\n1000\n800\n9999999999999999999999999999999999999999\n1\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n1\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n0\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n1\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n", "actual_output": "1800\n10000000000000000000000000000000000000000\n100000000000000000000000000000000000000000000000000000000000000000000000000000000\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\n100000000000000000000000000000000000000000000000000000000000000000000000000000001\noverflow\n", "expected_output": "1800\n10000000000000000000000000000000000000000\noverflow\n99999999999999999999999999999999999999999999999999999999999999999999999999999999\noverflow\noverflow\n", "anno_code": ["n=int(input()) # (0): n=6\nfor n in range(n): # (1): n=0 (7): n=1 ... (31): n=5\n\ta=int(input()) # (2): a=1000 (8): a=9999999999999999999999999999999999999999 ... (32): NO CHANGE\n\tb=int(input()) # (3): b=800 (9): b=1 ... (33): b=100000000000000000000000000000000000000000000000000000000000000000000000000000000\n\tc=a+b # (4): c=1800 (10): c=10000000000000000000000000000000000000000 ... (34): c=200000000000000000000000000000000000000000000000000000000000000000000000000000000\n\tif a>=int(1e80) or b>=int(1e80) or c>=int(1e80): # (5): NO CHANGE (11): NO CHANGE ... (35): NO CHANGE\n\t\tprint(\"overflow\") # (36): NO CHANGE\n\telse:\n\t\tprint(c) # (6): NO CHANGE (12): NO CHANGE ... (30): NO CHANGE\n"], "anno_status": [false], "diff_content": " n=int(input())\n-for n in range(n):\n+for i in range(n):\n \ta=int(input())\n \tb=int(input())\n \tc=a+b\n-\tif a>=int(1e80) or b>=int(1e80) or c>=int(1e80):\n+\tc=str(c)\n+\tif len(c)>80:\n \t\tprint(\"overflow\")\n \telse:\n \t\tprint(c)\n", "FL_content": "\n-n=int(input())\n-for n in range(n):\n-\ta=int(input())\n-\tb=int(input())\n-\tc=a+b\n-\tif a>=int(1e80) or b>=int(1e80) or c>=int(1e80):\n \t\tprint(\"overflow\")\n \telse:\n \t\tprint(c)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u193453446", "problem_id": "p02237", "submission1_id": "s181000092-FL", "submission2_id": "s677680318", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def main():\n num = int(input())\n T = [[0] * num for i in range(num)]\n for n in range(num):\n a = list(map(int,input().split()))\n u = a[0] - 1\n if a[1] > 0:\n for i in a[2:]:\n print(i)\n T[u][i-1] = 1\n\n for i in range(num):\n print(\" \".join(map(str,T[i])))\n\nif __name__ == '__main__':\n main()", "code2": "def main():\n num = int(input())\n T = [[0] * num for i in range(num)]\n for n in range(num):\n a = list(map(int,input().split()))\n u = a[0] - 1\n if a[1] > 0:\n for i in a[2:]:\n T[u][i-1] = 1\n\n for i in range(num):\n print(\" \".join(map(str,T[i])))\n\nif __name__ == '__main__':\n main()", "original_language1": "Python3", "original_language2": "Python3", "date1": "1504760494", "date2": "1504760536", "bleu_score": "0.930294259087581", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "4\n1 2 1 4\n2 1 4\n1 -1\n4 1 3\n", "actual_output": "1\n4\n4\n3\n1 0 0 1\n0 0 0 1\n0 0 0 0\n0 0 1 0\n", "expected_output": "1 0 0 1\n0 0 0 1\n0 0 0 0\n0 0 1 0\n\n", "anno_code": ["def main(): # (0): main=\n num = int(input())\n T = [[0] * num for i in range(num)]\n for n in range(num):\n a = list(map(int,input().split()))\n u = a[0] - 1\n if a[1] > 0:\n for i in a[2:]:\n print(i)\n T[u][i-1] = 1\n\n for i in range(num):\n print(\" \".join(map(str,T[i])))\n\nif __name__ == '__main__':\n main()"], "anno_status": [true], "diff_content": " def main():\n num = int(input())\n T = [[0] * num for i in range(num)]\n for n in range(num):\n a = list(map(int,input().split()))\n u = a[0] - 1\n if a[1] > 0:\n for i in a[2:]:\n- print(i)\n T[u][i-1] = 1\n \n for i in range(num):\n print(\" \".join(map(str,T[i])))\n \n if __name__ == '__main__':\n main()\n", "FL_content": "\n def main():\n num = int(input())\n T = [[0] * num for i in range(num)]\n for n in range(num):\n a = list(map(int,input().split()))\n u = a[0] - 1\n if a[1] > 0:\n for i in a[2:]:\n- print(i)\n T[u][i-1] = 1\n \n for i in range(num):\n print(\" \".join(map(str,T[i])))\n \n if __name__ == '__main__':\n main()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 16 }, { "user_id": "u528045862", "problem_id": "p02537", "submission1_id": "s929575671-FL", "submission2_id": "s371162922", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\ndef segfunc(x, y):\n return max(x, y)\n\n\n\nide_ele = 0\n\n\n\nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n\n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n\n def query(self, l, r):\n \n res = self.ide_ele\n\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\nn, k = map(int, input().split())\nst = SegTree([0] * 300001, segfunc, ide_ele)\nfor _ in range(n):\n a = int(input())\n v = st.query(a - 3, a + 4) + 1\n st.update(a, v)\nprint(st.query(0, 300001))\n", "code2": "\ndef segfunc(x, y):\n return max(x, y)\n\n\n\nide_ele = 0\n\n\n\nclass SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n\n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n\n def query(self, l, r):\n \n res = self.ide_ele\n\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\nn, k = map(int, input().split())\nst = SegTree([0] * 300001, segfunc, ide_ele)\nfor _ in range(n):\n a = int(input())\n v = st.query(max(0, a - k), min(300001, a + k + 1)) + 1\n st.update(a, v)\nprint(st.query(0, 300001))\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601169674", "date2": "1601170219", "bleu_score": "0.9765590983063759", "code1_test_status": [1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1], "code1_test_score": 77, "total_score": 101, "input": "10 1\n1\n8\n0\n3\n8\n11\n9\n7\n6\n1\n", "actual_output": "6\n", "expected_output": "4\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " \n def segfunc(x, y):\n return max(x, y)\n \n \n \n ide_ele = 0\n \n \n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n n, k = map(int, input().split())\n st = SegTree([0] * 300001, segfunc, ide_ele)\n for _ in range(n):\n a = int(input())\n- v = st.query(a - 3, a + 4) + 1\n+ v = st.query(max(0, a - k), min(300001, a + k + 1)) + 1\n st.update(a, v)\n print(st.query(0, 300001))\n \n", "FL_content": "\n \n def segfunc(x, y):\n return max(x, y)\n \n \n \n ide_ele = 0\n \n \n \n class SegTree:\n \n def __init__(self, init_val, segfunc, ide_ele):\n \n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n \n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n \n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n \n def update(self, k, x):\n \n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n \n def query(self, l, r):\n \n res = self.ide_ele\n \n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n \n n, k = map(int, input().split())\n st = SegTree([0] * 300001, segfunc, ide_ele)\n for _ in range(n):\n a = int(input())\n- v = st.query(a - 3, a + 4) + 1\n st.update(a, v)\n print(st.query(0, 300001))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 58 }, { "user_id": "u790710233", "problem_id": "p02929", "submission1_id": "s283463193-FL", "submission2_id": "s361945382", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import factorial\n\nn = int(input())\ns = input()\n\n\nMOD = 10**9+7\n\n\nlr = ''\nfor i, x in enumerate(s):\n if i % 2 == 0:\n if x == 'B':\n lr += 'L'\n else:\n lr += 'R'\n else:\n if x == 'B':\n lr += 'R'\n else:\n lr += 'L'\n\ncnt = 0\npoint = 1\nfor x in lr:\n if x == 'L':\n cnt += 1\n else:\n point *= cnt\n cnt -= 1\n\n\nprint(point*factorial(n) % MOD)", "code2": "import sys\ninput = sys.stdin.readline\nsys.setrecursionlimit(10**7)\n\n\nn = int(input())\ns = input().rstrip()\nMOD = 10**9+7\n\ncnt = 0\npoint = 1\nfor i, x in enumerate(s):\n if (x == 'B' and i % 2 == 0) or (x == 'W' and i % 2 != 0):\n cnt += 1\n else:\n point *= cnt\n cnt -= 1\n point %= MOD\n\n\nif cnt != 0:\n print(0)\nelse:\n \n for x in range(1, n+1):\n point *= x\n point %= MOD\n\n print(point)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566780085", "date2": "1566783534", "bleu_score": "0.6193220892540849", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 102, "total_score": 103, "input": "4\nBWBBWCWW\n", "actual_output": "288\n", "expected_output": "0\n\n", "anno_code": ["from math import factorial\n\nn = int(input()) # (0): n=4\ns = input() # (1): s=BWBBWCWW\n\n\nMOD = 10**9+7 # (2): MOD=1000000007\n\n\nlr = '' # (3): lr=\nfor i, x in enumerate(s): # (4): i=0, x=B (8): i=1, x=W ... (36): NO CHANGE\n if i % 2 == 0: # (5): NO CHANGE (9): NO CHANGE ... (33): NO CHANGE\n if x == 'B': # (6): NO CHANGE (14): NO CHANGE ... (30): NO CHANGE\n lr += 'L' # (7): lr=L (15): lr=LLL\n else:\n lr += 'R' # (23): lr=LLLRR (31): lr=LLLRRLR\n else:\n if x == 'B': # (10): NO CHANGE (18): NO CHANGE ... (34): NO CHANGE\n lr += 'R' # (19): lr=LLLR\n else:\n lr += 'L' # (11): lr=LL (27): lr=LLLRRL (35): lr=LLLRRLRL\n\ncnt = 0 # (37): cnt=0\npoint = 1 # (38): point=1\nfor x in lr: # (39): x=L (42): NO CHANGE ... (66): NO CHANGE\n if x == 'L': # (40): NO CHANGE (43): NO CHANGE ... (64): NO CHANGE\n cnt += 1 # (41): cnt=1 (44): cnt=2 ... (65): cnt=2\n else:\n point *= cnt # (50): point=3 (54): point=6 (61): point=12\n cnt -= 1 # (51): cnt=2 (55): cnt=1 (62): cnt=1\n\n\nprint(point*factorial(n) % MOD)"], "anno_status": [true], "diff_content": "-from math import factorial\n-\n-n = int(input())\n-s = input()\n+import sys\n+input = sys.stdin.readline\n+sys.setrecursionlimit(10**7)\n \n \n+n = int(input())\n+s = input().rstrip()\n MOD = 10**9+7\n \n-\n-lr = ''\n-for i, x in enumerate(s):\n- if i % 2 == 0:\n- if x == 'B':\n- lr += 'L'\n- else:\n- lr += 'R'\n- else:\n- if x == 'B':\n- lr += 'R'\n- else:\n- lr += 'L'\n-\n cnt = 0\n point = 1\n-for x in lr:\n- if x == 'L':\n+for i, x in enumerate(s):\n+ if (x == 'B' and i % 2 == 0) or (x == 'W' and i % 2 != 0):\n cnt += 1\n else:\n point *= cnt\n cnt -= 1\n+ point %= MOD\n+\n \n+if cnt != 0:\n+ print(0)\n+else:\n+ \n+ for x in range(1, n+1):\n+ point *= x\n+ point %= MOD\n \n-print(point*factorial(n) % MOD)\n+ print(point)\n", "FL_content": "\n from math import factorial\n \n n = int(input())\n s = input()\n \n \n MOD = 10**9+7\n \n \n lr = ''\n for i, x in enumerate(s):\n if i % 2 == 0:\n if x == 'B':\n lr += 'L'\n else:\n lr += 'R'\n else:\n if x == 'B':\n lr += 'R'\n else:\n lr += 'L'\n \n cnt = 0\n point = 1\n for x in lr:\n if x == 'L':\n cnt += 1\n else:\n point *= cnt\n cnt -= 1\n \n \n-print(point*factorial(n) % MOD)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 33 }, { "user_id": "u939198091", "problem_id": "p04014", "submission1_id": "s650053127-FL", "submission2_id": "s125763601", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import math\n\ndef func(b,n):\n if b > n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n\ndef _func(b,n):\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n\ndef solve(n,s):\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n\n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n b = int((n-s)/p)+1\n if b < 2:\n continue\n if _func(b, n) == s:\n return b\n\n return -1\n\nif __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n", "code2": "import math\n\ndef func(b,n):\n if b > n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n\ndef _func(b,n):\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n\ndef solve(n,s):\n if n == s:\n return n+1\n ans = float('inf')\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n\n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n b = int((n-s)/p)+1\n if b < 2:\n continue\n if _func(b, n) == s:\n ans = min(ans, b)\n\n if ans < float('inf'):\n return ans\n else:\n return -1\n\nif __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586403275", "date2": "1586403830", "bleu_score": "0.8515063254529821", "code1_test_status": [1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 54, "total_score": 105, "input": "87654\n241\n", "actual_output": "87414\n", "expected_output": "1434\n\n", "anno_code": ["import math\n\ndef func(b,n): # (0): func=\n if b > n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n\ndef _func(b,n): # (1): _func=\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n\ndef solve(n,s): # (2): solve=\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n\n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n b = int((n-s)/p)+1\n if b < 2:\n continue\n if _func(b, n) == s:\n return b\n\n return -1\n\nif __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n"], "anno_status": [true], "diff_content": " import math\n \n def func(b,n):\n if b > n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n \n def _func(b,n):\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n \n def solve(n,s):\n+ if n == s:\n+ return n+1\n+ ans = float('inf')\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n \n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n b = int((n-s)/p)+1\n if b < 2:\n continue\n if _func(b, n) == s:\n- return b\n+ ans = min(ans, b)\n \n- return -1\n+ if ans < float('inf'):\n+ return ans\n+ else:\n+ return -1\n \n if __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n \n", "FL_content": "\n import math\n \n def func(b,n):\n if b > n:\n return n\n else:\n return func(b, math.floor(n/b)) + (n % b)\n \n def _func(b,n):\n x = n\n ret = 0\n while True:\n if b > x:\n return ret + x\n else:\n ret += x % b\n x = math.floor(x/b)\n \n def solve(n,s):\n for b in range(2,math.floor(math.sqrt(n))+1):\n if _func(b,n) == s:\n return b\n \n for p in range(1,math.floor(math.sqrt(n))+1):\n if (n-s) % p == 0:\n- b = int((n-s)/p)+1\n- if b < 2:\n- continue\n- if _func(b, n) == s:\n- return b\n \n return -1\n \n if __name__ == \"__main__\":\n n = int(input())\n s = int(input())\n ans = solve(n,s)\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 39 }, { "user_id": "u596276291", "problem_id": "p04000", "submission1_id": "s810952650-FL", "submission2_id": "s614720651", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import defaultdict\n\n\ndef main():\n H, W, N = map(int, input().split())\n\n d = defaultdict(int)\n for _ in range(N):\n a, b = map(int, input().split())\n for y in range(-2, 1):\n for x in range(-2, 1):\n n_y, n_x = y + a, x + b\n if 0 < n_y <= H - 2 and 0 < n_x <= W - 2:\n d[(n_y, n_x)] += 1\n\n ans = [0] * 10\n for k, v in d.items():\n ans[v] += 1\n\n print(*ans, sep=\"\\n\")\n\nif __name__ == '__main__':\n main()\n", "code2": "from collections import defaultdict\n\n\ndef main():\n H, W, N = map(int, input().split())\n\n d = defaultdict(int)\n for _ in range(N):\n a, b = map(int, input().split())\n for y in range(-2, 1):\n for x in range(-2, 1):\n n_y, n_x = y + a, x + b\n if 0 < n_y <= H - 2 and 0 < n_x <= W - 2:\n d[(n_y, n_x)] += 1\n\n ans = [0] * 10\n for k, v in d.items():\n ans[v] += 1\n ans[0] = (H - 2) * (W - 2) - sum(ans)\n\n print(*ans, sep=\"\\n\")\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1476138338", "date2": "1476138892", "bleu_score": "0.9231760026804908", "code1_test_status": [0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0], "code1_test_score": 10, "total_score": 103, "input": "10 10 20\n0 1\n1 4\n1 9\n2 7\n3 5\n4 2\n1 7\n5 9\n6 4\n6 6\n6 7\n2 2\n7 3\n7 5\n16 1\n8 5\n8 10\n9 4\n10 4\n10 9\n", "actual_output": "0\n25\n21\n8\n4\n0\n0\n0\n0\n0\n", "expected_output": "6\n25\n21\n8\n4\n0\n0\n0\n0\n0\n\n", "anno_code": ["from collections import defaultdict\n\n\ndef main(): # (0): main=\n H, W, N = map(int, input().split())\n\n d = defaultdict(int)\n for _ in range(N):\n a, b = map(int, input().split())\n for y in range(-2, 1):\n for x in range(-2, 1):\n n_y, n_x = y + a, x + b\n if 0 < n_y <= H - 2 and 0 < n_x <= W - 2:\n d[(n_y, n_x)] += 1\n\n ans = [0] * 10\n for k, v in d.items():\n ans[v] += 1\n\n print(*ans, sep=\"\\n\")\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " from collections import defaultdict\n \n \n def main():\n H, W, N = map(int, input().split())\n \n d = defaultdict(int)\n for _ in range(N):\n a, b = map(int, input().split())\n for y in range(-2, 1):\n for x in range(-2, 1):\n n_y, n_x = y + a, x + b\n if 0 < n_y <= H - 2 and 0 < n_x <= W - 2:\n d[(n_y, n_x)] += 1\n \n ans = [0] * 10\n for k, v in d.items():\n ans[v] += 1\n+ ans[0] = (H - 2) * (W - 2) - sum(ans)\n \n print(*ans, sep=\"\\n\")\n \n if __name__ == '__main__':\n main()\n \n", "FL_content": "\n from collections import defaultdict\n \n \n def main():\n H, W, N = map(int, input().split())\n \n d = defaultdict(int)\n for _ in range(N):\n a, b = map(int, input().split())\n for y in range(-2, 1):\n for x in range(-2, 1):\n n_y, n_x = y + a, x + b\n if 0 < n_y <= H - 2 and 0 < n_x <= W - 2:\n d[(n_y, n_x)] += 1\n \n ans = [0] * 10\n for k, v in d.items():\n ans[v] += 1\n \n print(*ans, sep=\"\\n\")\n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u767664985", "problem_id": "p03164", "submission1_id": "s155169478-FL", "submission2_id": "s398793481", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, W = map(int, input().split())\nw, v = [0] * N, [0] * N\nfor i in range(N):\n\tw[i], v[i] = map(int, input().split())\n\nV = sum(v)\ndp = [[float(\"inf\")] * (V + 1) for _ in range(N + 1)]\n\ndp[0][0] = 0\n\nfor i in range(N):\n\tfor j in range(V + 1):\n\t\t\n\t\tif j - v[i] >= 0:\n\t\t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j - v[i]] + w[i])\n\t\t\n\t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j])\n\n\n\n\nans = 0\nfor j in range(V):\n\tif dp[N][j] <= W:\n\t\tans = j\n\nprint(ans)\n", "code2": "N, W = map(int, input().split())\nw, v = [0] * N, [0] * N\nfor i in range(N):\n\tw[i], v[i] = map(int, input().split())\n\nV = sum(v)\ndp = [[float(\"inf\")] * (V + 1) for _ in range(N + 1)]\n\ndp[0][0] = 0\n\nfor i in range(N):\n\tfor j in range(V + 1):\n\t\t\n\t\tif j - v[i] >= 0:\n\t\t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j - v[i]] + w[i])\n\t\t\n\t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j])\n\n\n\n\nans = 0\nfor j in range(V + 1):\n\tif dp[N][j] <= W:\n\t\tans = j\n\nprint(ans)\n", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1560385271", "date2": "1560385367", "bleu_score": "0.9876446771890272", "code1_test_status": [0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1], "code1_test_score": 57, "total_score": 103, "input": "5 31\n4 0\n0 11\n9 6\n16 20\n4 9\n0 4\n", "actual_output": "40\n", "expected_output": "46\n\n", "anno_code": ["N, W = map(int, input().split()) # (0): N=5, W=31\nw, v = [0] * N, [0] * N # (1): w=[0, 0, 0, 0, 0], v=[0, 0, 0, 0, 0]\nfor i in range(N): # (2): i=0 (4): i=1 ... (12): NO CHANGE\n\tw[i], v[i] = map(int, input().split()) # (3): w=[4, 0, 0, 0, 0] (5): v=[0, 11, 0, 0, 0] ... (11): w=[4, 0, 9, 16, 4], v=[0, 11, 6, 20, 9]\n\nV = sum(v) # (13): V=46\ndp = [[float(\"inf\")] * (V + 1) for _ in range(N + 1)] # (14): dp\n\ndp[0][0] = 0 # (15): dp\n\nfor i in range(N): # (16): i=0 (206): i=1 ... (920): NO CHANGE\n\tfor j in range(V + 1): # (17): j=0 (21): j=1 ... (919): NO CHANGE\n\t\t\n\t\tif j - v[i] >= 0: # (18): NO CHANGE (22): NO CHANGE ... (916): NO CHANGE\n\t\t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j - v[i]] + w[i]) # (19): dp (23): NO CHANGE ... (917): dp\n\t\t\n\t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j]) # (20): dp (24): NO CHANGE ... (918): NO CHANGE\n\n\n\n\nans = 0 # (921): ans=0\nfor j in range(V): # (922): j=0 (925): j=1 ... (1027): NO CHANGE\n\tif dp[N][j] <= W: # (923): NO CHANGE (926): NO CHANGE ... (1026): NO CHANGE\n\t\tans = j # (924): NO CHANGE (937): ans=6 ... (1016): ans=40\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " N, W = map(int, input().split())\n w, v = [0] * N, [0] * N\n for i in range(N):\n \tw[i], v[i] = map(int, input().split())\n \n V = sum(v)\n dp = [[float(\"inf\")] * (V + 1) for _ in range(N + 1)]\n \n dp[0][0] = 0\n \n for i in range(N):\n \tfor j in range(V + 1):\n \t\t\n \t\tif j - v[i] >= 0:\n \t\t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j - v[i]] + w[i])\n \t\t\n \t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j])\n \n \n \n \n ans = 0\n-for j in range(V):\n+for j in range(V + 1):\n \tif dp[N][j] <= W:\n \t\tans = j\n \n print(ans)\n \n", "FL_content": "\n N, W = map(int, input().split())\n w, v = [0] * N, [0] * N\n for i in range(N):\n \tw[i], v[i] = map(int, input().split())\n \n V = sum(v)\n dp = [[float(\"inf\")] * (V + 1) for _ in range(N + 1)]\n \n dp[0][0] = 0\n \n for i in range(N):\n \tfor j in range(V + 1):\n \t\t\n \t\tif j - v[i] >= 0:\n \t\t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j - v[i]] + w[i])\n \t\t\n \t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j])\n \n \n \n \n-ans = 0\n for j in range(V):\n \tif dp[N][j] <= W:\n-\t\tans = j\n \n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 28 }, { "user_id": "u344813796", "problem_id": "p03698", "submission1_id": "s862063741-FL", "submission2_id": "s401895158", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=list(str(input()))\n\nprint('Yes' if len(list(set(s)))==len(s) else 'No')\n", "code2": "s=list(str(input()))\n\nprint('yes' if len(list(set(s)))==len(s) else 'no')\n", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596770328", "date2": "1596770371", "bleu_score": "0.9299940324325051", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "enereffit\n", "actual_output": "No\n", "expected_output": "no\n\n", "anno_code": ["s=list(str(input())) # (0): s=['e', 'n', 'e', 'r', 'e', 'f', 'f', 'i', 't']\n\nprint('Yes' if len(list(set(s)))==len(s) else 'No')\n"], "anno_status": [true], "diff_content": " s=list(str(input()))\n \n-print('Yes' if len(list(set(s)))==len(s) else 'No')\n+print('yes' if len(list(set(s)))==len(s) else 'no')\n \n", "FL_content": "\n s=list(str(input()))\n \n-print('Yes' if len(list(set(s)))==len(s) else 'No')\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 4 }, { "user_id": "u736470924", "problem_id": "p02549", "submission1_id": "s866113129-FL", "submission2_id": "s064404608", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def resolve():\n n, k = map(int, input().split())\n S = []\n for _ in range(k):\n l1, r1 = map(int, input().split())\n S.append(l1)\n S.append(r1)\n S = list(set(S))\n\n dp = [[0 for i in range(n + 1)] for j in range(len(S) + 1)]\n for i in range(len(S) + 1):\n dp[i][1] = 1\n for i in range(1, len(S) + 1):\n for j in range(2, n + 1):\n if j - S[i - 1] >= 0 and dp[i][j - S[i - 1]] > 0:\n dp[i][j] = dp[i][j - S[i - 1]] + dp[i - 1][j]\n else:\n dp[i][j] = dp[i - 1][j]\n\n print(dp[-1][n] % 998244353)\n\nresolve()\n", "code2": "def resolve():\n n, k = map(int, input().split())\n S = []\n L, R = [], []\n for _ in range(k):\n l1, r1 = map(int, input().split())\n L.append(l1)\n R.append(r1)\n\n dp = [0 for i in range(n + 1)]\n dpsum = [0 for i in range(n + 1)]\n dp[1] = 1\n dpsum[1] = 1\n for i in range(2, n + 1):\n for j in range(k):\n Li = i - R[j]\n Ri = i - L[j]\n if Ri < 0:\n continue\n Li = max(1, Li)\n dp[i] += dpsum[Ri] - dpsum[Li - 1] \n dp[i] %= 998244353\n\n dpsum[i] = (dpsum[i - 1] + dp[i]) % 998244353\n\n print(dp[n])\n\nresolve()", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1600548185", "date2": "1600700981", "bleu_score": "0.7205831128517812", "code1_test_status": [1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0], "code1_test_score": 11, "total_score": 102, "input": "10 1\n1 0\n7 17\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["def resolve(): # (0): resolve=\n n, k = map(int, input().split()) # (2): k=1, n=10\n S = [] # (3): S=[]\n for _ in range(k): # (4): _=0 (8): NO CHANGE\n l1, r1 = map(int, input().split()) # (5): l1=1, r1=0\n S.append(l1) # (6): S=[1]\n S.append(r1) # (7): S=[1, 0]\n S = list(set(S)) # (9): S=[0, 1]\n\n dp = [[0 for i in range(n + 1)] for j in range(len(S) + 1)] # (10): dp\n for i in range(len(S) + 1): # (11): i=0 (13): i=1 ... (17): NO CHANGE\n dp[i][1] = 1 # (12): dp=[[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]] (14): dp (16): dp\n for i in range(1, len(S) + 1): # (18): i=1 (47): i=2 (76): NO CHANGE\n for j in range(2, n + 1): # (19): j=2 (22): j=3 ... (75): NO CHANGE\n if j - S[i - 1] >= 0 and dp[i][j - S[i - 1]] > 0: # (20): NO CHANGE (23): NO CHANGE ... (73): NO CHANGE\n dp[i][j] = dp[i][j - S[i - 1]] + dp[i - 1][j] # (50): dp (53): dp ... (74): dp\n else:\n dp[i][j] = dp[i - 1][j] # (21): NO CHANGE (24): NO CHANGE ... (45): NO CHANGE\n\n print(dp[-1][n] % 998244353)\n\nresolve() # (1): NO CHANGE\n"], "anno_status": [true], "diff_content": " def resolve():\n n, k = map(int, input().split())\n S = []\n+ L, R = [], []\n for _ in range(k):\n l1, r1 = map(int, input().split())\n- S.append(l1)\n- S.append(r1)\n- S = list(set(S))\n+ L.append(l1)\n+ R.append(r1)\n \n- dp = [[0 for i in range(n + 1)] for j in range(len(S) + 1)]\n- for i in range(len(S) + 1):\n- dp[i][1] = 1\n- for i in range(1, len(S) + 1):\n- for j in range(2, n + 1):\n- if j - S[i - 1] >= 0 and dp[i][j - S[i - 1]] > 0:\n- dp[i][j] = dp[i][j - S[i - 1]] + dp[i - 1][j]\n- else:\n- dp[i][j] = dp[i - 1][j]\n+ dp = [0 for i in range(n + 1)]\n+ dpsum = [0 for i in range(n + 1)]\n+ dp[1] = 1\n+ dpsum[1] = 1\n+ for i in range(2, n + 1):\n+ for j in range(k):\n+ Li = i - R[j]\n+ Ri = i - L[j]\n+ if Ri < 0:\n+ continue\n+ Li = max(1, Li)\n+ dp[i] += dpsum[Ri] - dpsum[Li - 1] \n+ dp[i] %= 998244353\n \n- print(dp[-1][n] % 998244353)\n+ dpsum[i] = (dpsum[i - 1] + dp[i]) % 998244353\n \n-resolve()\n+ print(dp[n])\n \n+resolve()\n", "FL_content": "\n def resolve():\n n, k = map(int, input().split())\n S = []\n for _ in range(k):\n l1, r1 = map(int, input().split())\n S.append(l1)\n S.append(r1)\n S = list(set(S))\n \n dp = [[0 for i in range(n + 1)] for j in range(len(S) + 1)]\n for i in range(len(S) + 1):\n dp[i][1] = 1\n for i in range(1, len(S) + 1):\n for j in range(2, n + 1):\n if j - S[i - 1] >= 0 and dp[i][j - S[i - 1]] > 0:\n dp[i][j] = dp[i][j - S[i - 1]] + dp[i - 1][j]\n else:\n dp[i][j] = dp[i - 1][j]\n \n print(dp[-1][n] % 998244353)\n \n resolve()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 23 }, { "user_id": "u099918199", "problem_id": "p03363", "submission1_id": "s842704676-FL", "submission2_id": "s011506512", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nlist_a = list((map(int, input().split())))\nmemo = 0\nmemo_list = [0]\nmemo_dict = {}\nfor i in range(0,n):\n memo += list_a[i]\n memo_list.append(memo)\n if memo in memo_dict:\n memo_dict[memo] += 1\n else:\n memo_dict[memo] = 1\nans = 0\nfor number in memo_dict.values():\n ans += number * (number-1) / 2\nprint(int(ans))\n", "code2": "n = int(input())\nlist_a = list((map(int, input().split())))\nmemo = 0\nmemo_dict = {0:1}\nfor i in range(0,n):\n memo += list_a[i]\n if memo in memo_dict:\n memo_dict[memo] += 1\n else:\n memo_dict[memo] = 1\nans = 0\nfor number in memo_dict.values():\n ans += number * (number-1) / 2\nprint(int(ans))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1537939779", "date2": "1537940032", "bleu_score": "0.8691702091557438", "code1_test_status": [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1], "code1_test_score": 29, "total_score": 103, "input": "7\n0 -2 2 -4 0 0 1\n", "actual_output": "4\n", "expected_output": "6\n\n", "anno_code": ["n = int(input()) # (0): n=7\nlist_a = list((map(int, input().split()))) # (1): list_a=[0, -2, 2, -4, 0, 0, 1]\nmemo = 0 # (2): memo=0\nmemo_list = [0] # (3): memo_list=[0]\nmemo_dict = {} # (4): memo_dict={}\nfor i in range(0,n): # (5): i=0 (10): i=1 ... (40): NO CHANGE\n memo += list_a[i] # (6): NO CHANGE (11): memo=-2 ... (36): memo=-3\n memo_list.append(memo) # (7): memo_list=[0, 0] (12): memo_list=[0, 0, -2] ... (37): memo_list=[0, 0, -2, 0, -4, -4, -4, -3]\n if memo in memo_dict: # (8): NO CHANGE (13): NO CHANGE ... (38): NO CHANGE\n memo_dict[memo] += 1 # (19): memo_dict={0: 2, -2: 1} (29): memo_dict={0: 2, -2: 1, -4: 2} (34): memo_dict={0: 2, -2: 1, -4: 3}\n else:\n memo_dict[memo] = 1 # (9): memo_dict={0: 1} (14): memo_dict={0: 1, -2: 1} ... (39): memo_dict={0: 2, -2: 1, -4: 3, -3: 1}\nans = 0 # (41): ans=0\nfor number in memo_dict.values(): # (42): number=2 (44): number=1 ... (50): NO CHANGE\n ans += number * (number-1) / 2 # (43): ans=1.0 (45): NO CHANGE ... (49): NO CHANGE\nprint(int(ans))\n"], "anno_status": [true], "diff_content": " n = int(input())\n list_a = list((map(int, input().split())))\n memo = 0\n-memo_list = [0]\n-memo_dict = {}\n+memo_dict = {0:1}\n for i in range(0,n):\n memo += list_a[i]\n- memo_list.append(memo)\n if memo in memo_dict:\n memo_dict[memo] += 1\n else:\n memo_dict[memo] = 1\n ans = 0\n for number in memo_dict.values():\n ans += number * (number-1) / 2\n print(int(ans))\n \n", "FL_content": "\n n = int(input())\n list_a = list((map(int, input().split())))\n memo = 0\n memo_list = [0]\n memo_dict = {}\n for i in range(0,n):\n memo += list_a[i]\n memo_list.append(memo)\n if memo in memo_dict:\n memo_dict[memo] += 1\n else:\n memo_dict[memo] = 1\n ans = 0\n for number in memo_dict.values():\n ans += number * (number-1) / 2\n print(int(ans))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u150664457", "problem_id": "p02702", "submission1_id": "s421312200-FL", "submission2_id": "s027164434", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\n\nn = len(S)\n\nmodlist = [0] * 2019\nnum = 0\nmods = 1\n\nfor i in range(n):\n fig = int(S[n - i - 1])\n mods = mods % 2019\n num = (num + fig * mods) % 2019\n modlist[num] = modlist[num] + 1\n mods = mods * 10\n\nresult = 0\nif modlist[0] > 0:\n result += 1\n\nfor i in range(2019):\n m = modlist[i]\n if n != 0:\n result += m * (m - 1) / 2\n\nprint(int(result))", "code2": "S = input()\n\nn = len(S)\n\nmedalist = [0] * 2019\nmedalist[0] = 1\nnum = 0\nmods = 1\n\nfor i in range(n):\n fig = int(S[n - i - 1])\n num = (num + fig * mods) % 2019\n medalist[num] = medalist[num] + 1\n mods = (mods * 10) % 2019\n\nresult = 0\n\nfor i in range(2019):\n m = medalist[i]\n if m != 0:\n result += m * (m - 1) / 2\n\nprint(int(result))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1588548243", "date2": "1588548893", "bleu_score": "0.8390863240394524", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 73, "total_score": 74, "input": "880430372400\n", "actual_output": "4\n", "expected_output": "5\n\n", "anno_code": ["S = input() # (0): S=880430372400\n\nn = len(S) # (1): n=12\n\nmodlist = [0] * 2019 # (2): modlist=[0, 0, ..., 0, 0]\nnum = 0 # (3): num=0\nmods = 1 # (4): mods=1\n\nfor i in range(n): # (5): i=0 (11): i=1 ... (77): NO CHANGE\n fig = int(S[n - i - 1]) # (6): fig=0 (12): NO CHANGE ... (72): NO CHANGE\n mods = mods % 2019 # (7): NO CHANGE (13): NO CHANGE ... (73): NO CHANGE\n num = (num + fig * mods) % 2019 # (8): NO CHANGE (14): NO CHANGE ... (74): num=957\n modlist[num] = modlist[num] + 1 # (9): modlist=[1, 0, ..., 0, 0] (15): modlist=[2, 0, ..., 0, 0] ... (75): modlist=[2, 0, ..., 0, 0]\n mods = mods * 10 # (10): mods=10 (16): mods=100 ... (76): mods=700\n\nresult = 0 # (78): result=0\nif modlist[0] > 0: # (79): NO CHANGE\n result += 1 # (80): result=1\n\nfor i in range(2019): # (81): i=0 (85): i=1 ... (8157): NO CHANGE\n m = modlist[i] # (82): m=2 (86): m=0 ... (8154): NO CHANGE\n if n != 0: # (83): NO CHANGE (87): NO CHANGE ... (8155): NO CHANGE\n result += m * (m - 1) / 2 # (84): result=2.0 (88): NO CHANGE ... (8156): NO CHANGE\n\nprint(int(result))"], "anno_status": [true], "diff_content": " S = input()\n \n n = len(S)\n \n-modlist = [0] * 2019\n+medalist = [0] * 2019\n+medalist[0] = 1\n num = 0\n mods = 1\n \n for i in range(n):\n fig = int(S[n - i - 1])\n- mods = mods % 2019\n num = (num + fig * mods) % 2019\n- modlist[num] = modlist[num] + 1\n- mods = mods * 10\n+ medalist[num] = medalist[num] + 1\n+ mods = (mods * 10) % 2019\n \n result = 0\n-if modlist[0] > 0:\n- result += 1\n \n for i in range(2019):\n- m = modlist[i]\n- if n != 0:\n+ m = medalist[i]\n+ if m != 0:\n result += m * (m - 1) / 2\n \n print(int(result))\n", "FL_content": "\n S = input()\n \n n = len(S)\n \n modlist = [0] * 2019\n num = 0\n mods = 1\n \n for i in range(n):\n fig = int(S[n - i - 1])\n mods = mods % 2019\n num = (num + fig * mods) % 2019\n modlist[num] = modlist[num] + 1\n mods = mods * 10\n \n result = 0\n if modlist[0] > 0:\n result += 1\n \n for i in range(2019):\n m = modlist[i]\n- if n != 0:\n result += m * (m - 1) / 2\n \n print(int(result))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 25 }, { "user_id": "u247830763", "problem_id": "p02899", "submission1_id": "s175189208-FL", "submission2_id": "s618210499", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nls = list(map(str,input().split()))\na = [0 for j in range(n)]\nfor i in range(n):\n a[i] = ls[i] + str(i+1)\na.sort()\nfor k in range(n):\n print(a[k][int(len(a[k]))-1],end=' ')", "code2": "n = int(input())\nls = list(map(int,input().split()))\na = [0 for j in range(n)]\nfor i in range(n):\n a[i] = [ls[i],str(i+1)]\na.sort()\nfor k in range(n):\n print(a[k][1],end=' ')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588530903", "date2": "1588531864", "bleu_score": "0.8596717011242501", "code1_test_status": [1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1], "code1_test_score": 8, "total_score": 11, "input": "3\n-2 0 -1\n", "actual_output": "3 1 2 ", "expected_output": "1 3 2 \n\n", "anno_code": ["n = int(input()) # (0): n=3\nls = list(map(str,input().split())) # (1): ls=['-2', '0', '-1']\na = [0 for j in range(n)] # (2): a=[0, 0, 0]\nfor i in range(n): # (3): i=0 (5): i=1 ... (9): NO CHANGE\n a[i] = ls[i] + str(i+1) # (4): a=['-21', 0, 0] (6): a=['-21', '02', 0] (8): a=['-21', '02', '-13']\na.sort() # (10): a=['-13', '-21', '02']\nfor k in range(n): # (11): k=0 (13): k=1 (15): k=2\n print(a[k][int(len(a[k]))-1],end=' ') # (12): NO CHANGE (14): NO CHANGE (16): NO CHANGE\n"], "anno_status": [true], "diff_content": " n = int(input())\n-ls = list(map(str,input().split()))\n+ls = list(map(int,input().split()))\n a = [0 for j in range(n)]\n for i in range(n):\n- a[i] = ls[i] + str(i+1)\n+ a[i] = [ls[i],str(i+1)]\n a.sort()\n for k in range(n):\n- print(a[k][int(len(a[k]))-1],end=' ')\n+ print(a[k][1],end=' ')\n", "FL_content": "\n n = int(input())\n ls = list(map(str,input().split()))\n a = [0 for j in range(n)]\n for i in range(n):\n a[i] = ls[i] + str(i+1)\n a.sort()\n for k in range(n):\n- print(a[k][int(len(a[k]))-1],end=' ')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u334904929", "problem_id": "p02720", "submission1_id": "s955053441-FL", "submission2_id": "s594649038", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\nK = int(input())\n\nd = deque()\n\nfor i in range(1,10):\n\td.append(i)\n\nfor i in range(K):\n\tx = d.popleft()\n\tif x % 10 != 0:\n\t\td.append(10*x+x-1)\n\td.append(10*x+x)\n\tif x % 10 != 9:\n\t\td.append(10*x+x+1)\n\nprint(x)\n", "code2": "from collections import deque\nK = int(input())\n\nd = deque()\n\nfor i in range(1,10):\n\td.append(i)\n\nfor i in range(K):\n\tx = d.popleft()\n\tif x % 10 != 0:\n\t\td.append(10*x+(x%10)-1)\n\td.append(10*x+(x%10))\n\tif x % 10 != 9:\n\t\td.append(10*x+(x%10)+1)\n\nprint(x)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1588518051", "date2": "1588518171", "bleu_score": "0.9129163693286184", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "333\n", "actual_output": "13420\n", "expected_output": "10100\n\n", "anno_code": ["from collections import deque\nK = int(input()) # (0): K=333\n\nd = deque() # (1): d=deque([13421, 13430, 13431, 13432, 13441, 13442, 13443, 14520, 14521, 14530, 14531, 14532, 14630, 14631, 14640, 14641, 14642, 14651, 14652, 14653, 14750, 14751, 14752, 14761, 14762, 14763, 14772, 14773, 14774, 15840, 15841, 15850, 15851, 15852, 15861, 15862, 15863, 15960, 15961, 15962, 15971, 15972, 15973, 15982, 15983, 15984, 16081, 16082, 16083, 16092, 16093, 16094, 16103, 16104, 16105, 27830, 27831, 27840, 27841, 27842, 27940, 27941, 27950, 27951, 27952, 27961, 27962, 27963, 28060, 28061, 28062, 28071, 28072, 28073, 28082, 28083, 28084, 29150, 29151, 29160, 29161, 29162, 29171, 29172, 29173, 29270, 29271, 29272, 29281, 29282, 29283, 29292, 29293, 29294, 29391, 29392, 29393, 29402, 29403, 29404, 29413, 29414, 29415, 30480, 30481, 30482, 30491, 30492, 30493, 30502, 30503, 30504, 30601, 30602, 30603, 30612, 30613, 30614, 30623, 30624, 30625, 30722, 30723, 30724, 30733, 30734, 30735, 30744, 30745, 30746, 42460, 42461, 42470, 42471, 42472, 42481, 42482, 42483, 42580, 42581, 42582, 42591, 42592, 42593, 42602, 42603, 42604, 42701, 42702, 42703, 42712, 42713, 42714, 42723, 42724, 42725, 43790, 43791, 43792, 43801, 43802, 43803, 43812, 43813, 43814, 43911, 43912, 43913, 43922, 43923, 43924, 43933, 43934, 43935, 44032, 44033, 44034, 44043, 44044, 44045, 44054, 44055, 44056, 45121, 45122, 45123, 45132, 45133, 45134, 45143, 45144, 45145, 45242, 45243, 45244, 45253, 45254, 45255, 45264, 45265, 45266, 45363, 45364, 45365, 45374, 45375, 45376, 45385, 45386, 45387, 57100, 57101, 57102, 57111, 57112, 57113, 57122, 57123, 57124, 57221, 57222, 57223, 57232, 57233, 57234, 57243, 57244, 57245, 57342, 57343, 57344, 57353, 57354, 57355, 57364, 57365, 57366, 58431, 58432, 58433, 58442, 58443, 58444, 58453, 58454, 58455, 58552, 58553, 58554, 58563, 58564, 58565, 58574, 58575, 58576, 58673, 58674, 58675, 58684, 58685, 58686, 58695, 58696, 58697, 59762, 59763, 59764, 59773, 59774, 59775, 59784, 59785, 59786, 59883, 59884, 59885, 59894, 59895, 59896, 59905, 59906, 59907, 60004, 60005, 60006, 60015, 60016, 60017, 60026, 60027, 60028, 71741, 71742, 71743, 71752, 71753, 71754, 71763, 71764, 71765, 71862, 71863, 71864, 71873, 71874, 71875, 71884, 71885, 71886, 71983, 71984, 71985, 71994, 71995, 71996, 72005, 72006, 72007, 73072, 73073, 73074, 73083, 73084, 73085, 73094, 73095, 73096, 73193, 73194, 73195, 73204, 73205, 73206, 73215, 73216, 73217, 73314, 73315, 73316, 73325, 73326, 73327, 73336, 73337, 73338, 74403, 74404, 74405, 74414, 74415, 74416, 74425, 74426, 74427, 74524, 74525, 74526, 74535, 74536, 74537, 74546, 74547, 74548, 74645, 74646, 74647, 74656, 74657, 74658, 74667, 74668, 74669, 86382, 86383, 86384, 86393, 86394, 86395, 86404, 86405, 86406, 86503, 86504, 86505, 86514, 86515, 86516, 86525, 86526, 86527, 86624, 86625, 86626, 86635, 86636, 86637, 86646, 86647, 86648, 87713, 87714, 87715, 87724, 87725, 87726, 87735, 87736, 87737, 87834, 87835, 87836, 87845, 87846, 87847, 87856, 87857, 87858, 87955, 87956, 87957, 87966, 87967, 87968, 87977, 87978, 87979, 89044, 89045, 89046, 89055, 89056, 89057, 89066, 89067, 89068, 89165, 89166, 89167, 89176, 89177, 89178, 89187, 89188, 89189, 89286, 89287, 89288, 89297, 89298, 89299, 89308, 89309, 101023, 101024, 101025, 101034, 101035, 101036, 101045, 101046, 101047, 101144, 101145, 101146, 101155, 101156, 101157, 101166, 101167, 101168, 101265, 101266, 101267, 101276, 101277, 101278, 101287, 101288, 101289, 102354, 102355, 102356, 102365, 102366, 102367, 102376, 102377, 102378, 102475, 102476, 102477, 102486, 102487, 102488, 102497, 102498, 102499, 102596, 102597, 102598, 102607, 102608, 102609, 102618, 102619, 103685, 103686, 103687, 103696, 103697, 103698, 103707, 103708, 103709, 103806, 103807, 103808, 103817, 103818, 103819, 103828, 103829, 103927, 103928, 103929, 103938, 103939, 115664, 115665, 115666, 115675, 115676, 115677, 115686, 115687, 115688, 115785, 115786, 115787, 115796, 115797, 115798, 115807, 115808, 115809, 115906, 115907, 115908, 115917, 115918, 115919, 115928, 115929, 116995, 116996, 116997, 117006, 117007, 117008, 117017, 117018, 117019, 117116, 117117, 117118, 117127, 117128, 117129, 117138, 117139, 117237, 117238, 117239, 117248, 117249, 118326, 118327, 118328, 118337, 118338, 118339, 118348, 118349, 118447, 118448, 118449, 118458, 118459, 130305, 130306, 130307, 130316, 130317, 130318, 130327, 130328, 130329, 130426, 130427, 130428, 130437, 130438, 130439, 130448, 130449, 130547, 130548, 130549, 130558, 130559, 131636, 131637, 131638, 131647, 131648, 131649, 131658, 131659, 131757, 131758, 131759, 131768, 131769, 146410, 146411, 146420, 146421, 146422, 146520, 146521, 146530, 146531, 146532, 146541, 146542, 146543, 147620, 147621])\n\nfor i in range(1,10): # (2): i=1 (4): i=2 ... (20): NO CHANGE\n\td.append(i) # (3): NO CHANGE (5): NO CHANGE ... (19): NO CHANGE\n\nfor i in range(K): # (21): i=0 (28): i=1 ... (2315): NO CHANGE\n\tx = d.popleft() # (22): x=1 (29): x=2 ... (2310): x=13420\n\tif x % 10 != 0: # (23): NO CHANGE (30): NO CHANGE ... (2311): NO CHANGE\n\t\td.append(10*x+x-1) # (24): NO CHANGE (31): NO CHANGE ... (2305): NO CHANGE\n\td.append(10*x+x) # (25): NO CHANGE (32): NO CHANGE ... (2312): NO CHANGE\n\tif x % 10 != 9: # (26): NO CHANGE (33): NO CHANGE ... (2313): NO CHANGE\n\t\td.append(10*x+x+1) # (27): NO CHANGE (34): NO CHANGE ... (2314): NO CHANGE\n\nprint(x)\n"], "anno_status": [false], "diff_content": " from collections import deque\n K = int(input())\n \n d = deque()\n \n for i in range(1,10):\n \td.append(i)\n \n for i in range(K):\n \tx = d.popleft()\n \tif x % 10 != 0:\n-\t\td.append(10*x+x-1)\n-\td.append(10*x+x)\n+\t\td.append(10*x+(x%10)-1)\n+\td.append(10*x+(x%10))\n \tif x % 10 != 9:\n-\t\td.append(10*x+x+1)\n+\t\td.append(10*x+(x%10)+1)\n \n print(x)\n \n", "FL_content": "\n from collections import deque\n K = int(input())\n \n d = deque()\n \n-for i in range(1,10):\n \td.append(i)\n \n for i in range(K):\n \tx = d.popleft()\n \tif x % 10 != 0:\n \t\td.append(10*x+x-1)\n \td.append(10*x+x)\n \tif x % 10 != 9:\n \t\td.append(10*x+x+1)\n \n print(x)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u143903328", "problem_id": "p03957", "submission1_id": "s942404028-FL", "submission2_id": "s844979285", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = input()\nn = 0\nm = 0\nfor i in range(0, len(s)):\n if s[i] == 'C':\n n = 1\n break\nfor j in range (0, len(s)):\n if s[j] == 'F':\n m = 1\n break\nif n == 1 and m == 1 and i < j:\n print('Yes')\nelse:\n print('No')", "code2": "s = input()\nn = 0\nm = 0\nfor i in range(0, len(s)):\n if s[i] == 'C':\n n = 1\n break\nfor j in range (i, len(s)):\n if s[j] == 'F':\n m = 1\n break\nif n == 1 and m == 1:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567478785", "date2": "1567478919", "bleu_score": "0.9428373513679569", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 94, "total_score": 103, "input": "KIFCQDDAPVSF\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["s = input() # (0): s=KIFCQDDAPVSF\nn = 0 # (1): n=0\nm = 0 # (2): m=0\nfor i in range(0, len(s)): # (3): i=0 (5): i=1 ... (9): i=3\n if s[i] == 'C': # (4): NO CHANGE (6): NO CHANGE ... (10): NO CHANGE\n n = 1 # (11): n=1\n break # (12): NO CHANGE\nfor j in range (0, len(s)): # (13): j=0 (15): j=1 (17): j=2\n if s[j] == 'F': # (14): NO CHANGE (16): NO CHANGE (18): NO CHANGE\n m = 1 # (19): m=1\n break # (20): NO CHANGE\nif n == 1 and m == 1 and i < j: # (21): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " s = input()\n n = 0\n m = 0\n for i in range(0, len(s)):\n if s[i] == 'C':\n n = 1\n break\n-for j in range (0, len(s)):\n+for j in range (i, len(s)):\n if s[j] == 'F':\n m = 1\n break\n-if n == 1 and m == 1 and i < j:\n+if n == 1 and m == 1:\n print('Yes')\n else:\n print('No')\n", "FL_content": "\n s = input()\n n = 0\n m = 0\n for i in range(0, len(s)):\n if s[i] == 'C':\n n = 1\n break\n for j in range (0, len(s)):\n if s[j] == 'F':\n m = 1\n break\n-if n == 1 and m == 1 and i < j:\n print('Yes')\n else:\n print('No')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u252054808", "problem_id": "p02408", "submission1_id": "s028186379-FL", "submission2_id": "s826277009", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\ncards = []\nfor _ in range(n):\n suit, num = input().split()\n num = int(num)\n cards.append((suit, num))\n\nfor suit in ('S', 'H', 'C', 'D'):\n for num in range(13):\n if (suit, num + 1) in cards:\n print(suit, '', num)\n", "code2": "n = int(input())\ncards = []\nfor _ in range(n):\n suit, num = input().split()\n num = int(num)\n cards.append((suit, num))\n\nfor suit in ('S', 'H', 'C', 'D'):\n for num in range(13):\n if not((suit, num + 1) in cards):\n print(suit, num + 1)\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1556183605", "date2": "1556184513", "bleu_score": "0.9457525441618242", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 98, "input": "47\nS 10\nS 11\nS 12\nS 13\nH 1\nH 2\nS 6\nS 7\nS 8\nS 9\nH 6\nH 8\nH 9\nH 3\nH 11\nH 4\nH 5\nS 2\nS 3\nS 4\nS 5\nH 12\nH 13\nC 1\nC 2\nD 1\nD 2\nD 3\nD 4\nD 5\nD 6\nD 7\nC 3\nC 4\nC 5\nC 6\nC 7\nC 8\nC 9\nC 10\nC 11\nC 13\nD 9\nD 10\nD 11\nD 12\nD 13\n", "actual_output": "S 1\nS 2\nS 3\nS 4\nS 5\nS 6\nS 7\nS 8\nS 9\nS 10\nS 11\nS 12\nH 0\nH 1\nH 2\nH 3\nH 4\nH 5\nH 7\nH 8\nH 10\nH 11\nH 12\nC 0\nC 1\nC 2\nC 3\nC 4\nC 5\nC 6\nC 7\nC 8\nC 9\nC 10\nC 12\nD 0\nD 1\nD 2\nD 3\nD 4\nD 5\nD 6\nD 8\nD 9\nD 10\nD 11\nD 12\n", "expected_output": "S 1\nH 7\nH 10\nC 12\nD 8\n\n", "anno_code": ["n = int(input()) # (0): n=47\ncards = [] # (1): cards=[]\nfor _ in range(n): # (2): _=0 (6): _=1 ... (190): NO CHANGE\n suit, num = input().split() # (3): suit=S, num=10 (7): num=11 ... (187): num=13\n num = int(num) # (4): num=10 (8): num=11 ... (188): num=13\n cards.append((suit, num)) # (5): cards=[('S', 10)] (9): cards=[('S', 10), ('S', 11)] ... (189): cards=[('S', 10), ('S', 11), ..., ('D', 12), ('D', 13)]\n\nfor suit in ('S', 'H', 'C', 'D'): # (191): suit=S (231): suit=H ... (310): suit=D\n for num in range(13): # (192): num=0 (194): num=1 ... (349): NO CHANGE\n if (suit, num + 1) in cards: # (193): NO CHANGE (195): NO CHANGE ... (347): NO CHANGE\n print(suit, '', num) # (196): NO CHANGE (199): NO CHANGE ... (348): NO CHANGE\n"], "anno_status": [true], "diff_content": " n = int(input())\n cards = []\n for _ in range(n):\n suit, num = input().split()\n num = int(num)\n cards.append((suit, num))\n \n for suit in ('S', 'H', 'C', 'D'):\n for num in range(13):\n- if (suit, num + 1) in cards:\n- print(suit, '', num)\n+ if not((suit, num + 1) in cards):\n+ print(suit, num + 1)\n+\n \n", "FL_content": "\n n = int(input())\n cards = []\n for _ in range(n):\n suit, num = input().split()\n num = int(num)\n cards.append((suit, num))\n \n for suit in ('S', 'H', 'C', 'D'):\n for num in range(13):\n if (suit, num + 1) in cards:\n- print(suit, '', num)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u370331385", "problem_id": "p03617", "submission1_id": "s841911943-FL", "submission2_id": "s529915919", "status1": "Wrong Answer", "status2": "Accepted", "code1": "Q,H,R,S = map(int,input().split())\nN = int(input())\n\nefficient_num,efficient_cost = 0,8*Q\nif(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H\nif(efficient_cost > 2*R): efficient_num,efficient_cost = 2,2*R\nif(efficient_cost > S): efficient_num,efficient_cost = 3,S\n\n\nmin_cost = 0\nn = N\nif(efficient_num == 0): min_cost = int(n/0.25)*2*Q\nelif(efficient_num == 1): min_cost = int(n/0.50)*2*H\nelif(efficient_num == 2): min_cost = n*2*R\nelif(efficient_num == 3): min_cost = int((n/2)*2*S)\n\n\nif(N%2 == 0):\n print(min_cost)\n\nelse:\n \n efficient_num,efficient_cost = 0,8*Q\n if(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H\n if(efficient_cost > 2*R): efficient_num,efficient_cost = 2,2*R\n \n if(efficient_num == 0): min_cost += int(1/0.25)*Q\n elif(efficient_num == 1): min_cost += int(1/0.50)*H\n elif(efficient_num == 2): min_cost += 1*R\n print(min_cost)", "code2": "Q,H,S,D = map(int,input().split())\nN = int(input())\n\nefficient_num,efficient_cost = 0,8*Q\nif(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H\nif(efficient_cost > 2*S): efficient_num,efficient_cost = 2,2*S\nif(efficient_cost > D): efficient_num,efficient_cost = 3,D\n\n\nmin_cost = 0\n\nif(N%2 == 0):\n if(efficient_num == 0): min_cost = int(N/0.25)*Q\n elif(efficient_num == 1): min_cost = int(N/0.50)*H\n elif(efficient_num == 2): min_cost = N*S\n elif(efficient_num == 3): min_cost = (N\n \n\nelse:\n N = 2*(N\n if(efficient_num == 0): min_cost = int(N/0.25)*Q\n elif(efficient_num == 1): min_cost = int(N/0.50)*H\n elif(efficient_num == 2): min_cost = N*S\n elif(efficient_num == 3): min_cost = (N\n \n \n efficient_num,efficient_cost = 0,8*Q\n if(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H\n if(efficient_cost > 2*S): efficient_num,efficient_cost = 2,2*S\n \n if(efficient_num == 0): min_cost += int(1/0.25)*Q\n elif(efficient_num == 1): min_cost += int(1/0.50)*H\n elif(efficient_num == 2): min_cost += 1*S\n \nprint(min_cost)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1554872680", "date2": "1554873246", "bleu_score": "0.7800524045292728", "code1_test_status": [0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 14, "total_score": 104, "input": "91259 3187 23088 2979879\n16689\n", "actual_output": "212757746\n", "expected_output": "106375686\n\n", "anno_code": ["Q,H,R,S = map(int,input().split()) # (0): Q=91259, H=3187, R=23088, S=2979879\nN = int(input()) # (1): N=16689\n\nefficient_num,efficient_cost = 0,8*Q # (2): efficient_num=0, efficient_cost=730072\nif(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H # (3): efficient_num=1, efficient_cost=12748\nif(efficient_cost > 2*R): efficient_num,efficient_cost = 2,2*R # (4): NO CHANGE\nif(efficient_cost > S): efficient_num,efficient_cost = 3,S # (5): NO CHANGE\n\n\nmin_cost = 0 # (6): min_cost=0\nn = N # (7): n=16689\nif(efficient_num == 0): min_cost = int(n/0.25)*2*Q # (8): NO CHANGE\nelif(efficient_num == 1): min_cost = int(n/0.50)*2*H # (9): min_cost=212751372\nelif(efficient_num == 2): min_cost = n*2*R\nelif(efficient_num == 3): min_cost = int((n/2)*2*S)\n\n\nif(N%2 == 0): # (10): NO CHANGE\n print(min_cost)\n\nelse:\n \n efficient_num,efficient_cost = 0,8*Q # (11): efficient_num=0, efficient_cost=730072\n if(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H # (12): efficient_num=1, efficient_cost=12748\n if(efficient_cost > 2*R): efficient_num,efficient_cost = 2,2*R # (13): NO CHANGE\n \n if(efficient_num == 0): min_cost += int(1/0.25)*Q # (14): NO CHANGE\n elif(efficient_num == 1): min_cost += int(1/0.50)*H # (15): min_cost=212757746\n elif(efficient_num == 2): min_cost += 1*R\n print(min_cost)"], "anno_status": [false], "diff_content": "-Q,H,R,S = map(int,input().split())\n+Q,H,S,D = map(int,input().split())\n N = int(input())\n \n efficient_num,efficient_cost = 0,8*Q\n if(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H\n-if(efficient_cost > 2*R): efficient_num,efficient_cost = 2,2*R\n-if(efficient_cost > S): efficient_num,efficient_cost = 3,S\n+if(efficient_cost > 2*S): efficient_num,efficient_cost = 2,2*S\n+if(efficient_cost > D): efficient_num,efficient_cost = 3,D\n \n \n min_cost = 0\n-n = N\n-if(efficient_num == 0): min_cost = int(n/0.25)*2*Q\n-elif(efficient_num == 1): min_cost = int(n/0.50)*2*H\n-elif(efficient_num == 2): min_cost = n*2*R\n-elif(efficient_num == 3): min_cost = int((n/2)*2*S)\n-\n \n if(N%2 == 0):\n- print(min_cost)\n+ if(efficient_num == 0): min_cost = int(N/0.25)*Q\n+ elif(efficient_num == 1): min_cost = int(N/0.50)*H\n+ elif(efficient_num == 2): min_cost = N*S\n+ elif(efficient_num == 3): min_cost = (N\n+ \n \n else:\n+ N = 2*(N\n+ if(efficient_num == 0): min_cost = int(N/0.25)*Q\n+ elif(efficient_num == 1): min_cost = int(N/0.50)*H\n+ elif(efficient_num == 2): min_cost = N*S\n+ elif(efficient_num == 3): min_cost = (N\n+ \n+ \n+ efficient_num,efficient_cost = 0,8*Q\n+ if(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H\n+ if(efficient_cost > 2*S): efficient_num,efficient_cost = 2,2*S\n \n- efficient_num,efficient_cost = 0,8*Q\n- if(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H\n- if(efficient_cost > 2*R): efficient_num,efficient_cost = 2,2*R\n- \n- if(efficient_num == 0): min_cost += int(1/0.25)*Q\n- elif(efficient_num == 1): min_cost += int(1/0.50)*H\n- elif(efficient_num == 2): min_cost += 1*R\n- print(min_cost)\n+ if(efficient_num == 0): min_cost += int(1/0.25)*Q\n+ elif(efficient_num == 1): min_cost += int(1/0.50)*H\n+ elif(efficient_num == 2): min_cost += 1*S\n+ \n+print(min_cost)\n", "FL_content": "\n Q,H,R,S = map(int,input().split())\n N = int(input())\n \n efficient_num,efficient_cost = 0,8*Q\n if(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H\n if(efficient_cost > 2*R): efficient_num,efficient_cost = 2,2*R\n if(efficient_cost > S): efficient_num,efficient_cost = 3,S\n \n \n min_cost = 0\n n = N\n if(efficient_num == 0): min_cost = int(n/0.25)*2*Q\n elif(efficient_num == 1): min_cost = int(n/0.50)*2*H\n elif(efficient_num == 2): min_cost = n*2*R\n elif(efficient_num == 3): min_cost = int((n/2)*2*S)\n \n \n if(N%2 == 0):\n print(min_cost)\n \n else:\n \n efficient_num,efficient_cost = 0,8*Q\n if(efficient_cost > 4*H): efficient_num,efficient_cost = 1,4*H\n if(efficient_cost > 2*R): efficient_num,efficient_cost = 2,2*R\n \n- if(efficient_num == 0): min_cost += int(1/0.25)*Q\n elif(efficient_num == 1): min_cost += int(1/0.50)*H\n elif(efficient_num == 2): min_cost += 1*R\n print(min_cost)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 30 }, { "user_id": "u994521204", "problem_id": "p03377", "submission1_id": "s959852071-FL", "submission2_id": "s337917275", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a,b,x=map(int,input().split())\nif a<=x and x<=b:\n print('YES')\nelse:\n print('NO')", "code2": "a,b,x=map(int,input().split())\nif a<=x and x<=a+b:\n print('YES')\nelse:\n print('NO')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1576245773", "date2": "1576245832", "bleu_score": "0.9577952806172931", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 83, "total_score": 87, "input": "3 1 3\n", "actual_output": "NO\n", "expected_output": "YES\n\n", "anno_code": ["a,b,x=map(int,input().split()) # (0): a=3, b=1, x=3\nif a<=x and x<=b: # (1): NO CHANGE\n print('YES')\nelse:\n print('NO')"], "anno_status": [true], "diff_content": " a,b,x=map(int,input().split())\n-if a<=x and x<=b:\n+if a<=x and x<=a+b:\n print('YES')\n else:\n print('NO')\n", "FL_content": "\n a,b,x=map(int,input().split())\n-if a<=x and x<=b:\n print('YES')\n else:\n print('NO')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u144913062", "problem_id": "p02589", "submission1_id": "s833281854-FL", "submission2_id": "s639607482", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nbase = 26\nmod = (1 << 61) - 1\n\nN = int(input())\nS = [input().rstrip()[::-1] for _ in range(N)]\nS.sort(key=lambda s: -len(s))\ncnt = {}\nans = 0\none = [0] * 26\nfor s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n hashes[0] = ord(s[0]) - ord('a')\n for i in range(1, n - 1):\n hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\nprint(ans)\n", "code2": "import sys\ninput = sys.stdin.readline\n\nbase = 1999849216943526259\nmod = (1 << 61) - 1\n\nN = int(input())\nS = [input().rstrip()[::-1] for _ in range(N)]\nS.sort(key=lambda s: -len(s))\ncnt = {}\nans = 0\none = [0] * 26\nfor s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n hashes[0] = ord(s[0])\n for i in range(1, n - 1):\n hashes[i] = (hashes[i-1] * base + ord(s[i])) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597042305", "date2": "1597042563", "bleu_score": "0.9713090385906991", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 102, "input": "3\ncybxxa\ncyw\nbaa\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\nbase = 26 # (1): base=26\nmod = (1 << 61) - 1 # (2): mod=2305843009213693951\n\nN = int(input()) # (3): N=3\nS = [input().rstrip()[::-1] for _ in range(N)] # (4): S=['axxbyc', 'wyc', 'aab']\nS.sort(key=lambda s: -len(s)) # (5): NO CHANGE\ncnt = {} # (6): cnt={}\nans = 0 # (7): ans=0\none = [0] * 26 # (8): one=[0, 0, ..., 0, 0]\nfor s in S: # (9): s=axxbyc (309): s=wyc ... (555): NO CHANGE\n n = len(s) # (10): n=6 (310): n=3 (433): NO CHANGE\n if n == 1: # (11): NO CHANGE (311): NO CHANGE (434): NO CHANGE\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1) # (12): hashes=[0, 0, 0, 0, 0] (312): hashes=[0, 0] (435): hashes=[0, 0]\n hashes[0] = ord(s[0]) - ord('a') # (13): NO CHANGE (313): hashes=[22, 0] (436): NO CHANGE\n for i in range(1, n - 1): # (14): i=1 (16): i=2 ... (439): NO CHANGE\n hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod # (15): hashes=[0, 23, 0, 0, 0] (17): hashes=[0, 23, 621, 0, 0] ... (438): NO CHANGE\n if hashes[-1] in cnt: # (23): NO CHANGE (317): NO CHANGE (440): NO CHANGE\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')] # (441): ans=1\n found = [0] * 26 # (24): found=[0, 0, ..., 0, 0] (318): found=[0, 0, ..., 0, 0] (442): found=[0, 0, ..., 0, 0]\n found[ord(s[-1]) - ord('a')] = 1 # (25): found=[0, 0, ..., 0, 0] (319): found=[0, 0, ..., 0, 0] (443): found=[0, 1, ..., 0, 0]\n for i in range(n - 2, 0, -1): # (26): NO CHANGE (83): i=3 ... (500): NO CHANGE\n found[ord(s[i]) - ord('a')] = 1 # (27): found=[0, 0, ..., 1, 0] (84): found=[0, 1, ..., 1, 0] ... (445): found=[1, 1, ..., 0, 0]\n if hashes[i-1] not in cnt: # (28): NO CHANGE (85): NO CHANGE ... (446): NO CHANGE\n cnt[hashes[i-1]] = [0] * 26 # (29): cnt={16147: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (86): cnt={16147: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 621: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} ... (323): cnt={16147: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 621: [0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 23: [0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 0: [0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 22: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\n for c in range(26): # (30): c=0 (32): c=1 ... (499): NO CHANGE\n cnt[hashes[i-1]][c] += found[c] # (31): NO CHANGE (33): NO CHANGE ... (498): NO CHANGE\n found[ord(s[0]) - ord('a')] = 1 # (255): found=[1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0] (378): found=[0, 0, ..., 1, 0] (501): NO CHANGE\n for c in range(26): # (256): c=0 (258): c=1 ... (554): NO CHANGE\n one[c] += found[c] # (257): one=[1, 0, ..., 0, 0] (259): one=[1, 1, ..., 0, 0] ... (553): NO CHANGE\nprint(ans)\n"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n \n-base = 26\n+base = 1999849216943526259\n mod = (1 << 61) - 1\n \n N = int(input())\n S = [input().rstrip()[::-1] for _ in range(N)]\n S.sort(key=lambda s: -len(s))\n cnt = {}\n ans = 0\n one = [0] * 26\n for s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n- hashes[0] = ord(s[0]) - ord('a')\n+ hashes[0] = ord(s[0])\n for i in range(1, n - 1):\n- hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod\n+ hashes[i] = (hashes[i-1] * base + ord(s[i])) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\n print(ans)\n \n", "FL_content": "\n import sys\n input = sys.stdin.readline\n \n base = 26\n mod = (1 << 61) - 1\n \n N = int(input())\n S = [input().rstrip()[::-1] for _ in range(N)]\n S.sort(key=lambda s: -len(s))\n cnt = {}\n ans = 0\n one = [0] * 26\n for s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n hashes[0] = ord(s[0]) - ord('a')\n for i in range(1, n - 1):\n hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 36 }, { "user_id": "u318430977", "problem_id": "p02276", "submission1_id": "s664651014-FL", "submission2_id": "s719249076", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def partition(a, p, r):\n x = a[r]\n i = p - 1\n for j in range(p, r):\n if a[j] <= x:\n i += 1\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n tmp = a[i+1]\n a[i+1] = a[r]\n a[r] = tmp\n return i + 1, x\n\n\ndef print_list_split_whitespace(a, x):\n flag = False\n for y in a[:-1]:\n if x != y:\n print(y, end=\" \")\n else:\n print(\"[\" + str(y) + \"]\", end=\" \")\n flag = True\n if flag:\n print(a[-1])\n else:\n print(\"[\" + str(a[-1]) + \"]\", end=\" \")\n\n\nn = int(input())\na = [int(x) for x in input().split()]\n\nq, x = partition(a, 0, n - 1)\n\nprint_list_split_whitespace(a, x)\n", "code2": "def partition(a, p, r):\n x = a[r]\n i = p - 1\n for j in range(p, r):\n if a[j] <= x:\n i += 1\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n tmp = a[i+1]\n a[i+1] = a[r]\n a[r] = tmp\n return i + 1, x\n\n\ndef print_list_split_whitespace(a, x):\n ind = 0\n for i, y in enumerate(a):\n if x == y:\n ind = i\n for i in range(len(a) - 1):\n if i == ind:\n print(\"[\" + str(a[i]) + \"]\", end=\" \")\n else:\n print(a[i], end=\" \")\n if ind == len(a) - 1:\n print(\"[\" + str(a[-1]) + \"]\")\n else:\n print(a[-1])\n\n\nn = int(input())\na = [int(x) for x in input().split()]\n\nq, x = partition(a, 0, n - 1)\n\nprint_list_split_whitespace(a, x)\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1528728308", "date2": "1528728798", "bleu_score": "0.8537891592479787", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 100, "total_score": 101, "input": "12\n40 19 9 1 12 8 8 6 21 0 10 1\n", "actual_output": "[1] 0 [1] 40 12 8 8 6 21 19 10 9\n", "expected_output": "1 0 [1] 40 12 8 8 6 21 19 10 9\n\n", "anno_code": ["def partition(a, p, r): # (0): partition=\n x = a[r] # (5): x=1\n i = p - 1 # (6): i=-1\n for j in range(p, r): # (7): j=0 (9): j=1 ... (37): NO CHANGE\n if a[j] <= x: # (8): NO CHANGE (10): NO CHANGE ... (36): NO CHANGE\n i += 1 # (15): i=0 (31): i=1\n tmp = a[i] # (16): tmp=40 (32): tmp=19\n a[i] = a[j] # (17): a=[1, 19, 9, 1, 12, 8, 8, 6, 21, 0, 10, 1] (33): a=[1, 0, 9, 40, 12, 8, 8, 6, 21, 0, 10, 1]\n a[j] = tmp # (18): a=[1, 19, 9, 40, 12, 8, 8, 6, 21, 0, 10, 1] (34): a=[1, 0, 9, 40, 12, 8, 8, 6, 21, 19, 10, 1]\n tmp = a[i+1] # (38): tmp=9\n a[i+1] = a[r] # (39): a=[1, 0, 1, 40, 12, 8, 8, 6, 21, 19, 10, 1]\n a[r] = tmp # (40): partition=, print_list_split_whitespace=, n=12, a=[1, 0, 1, 40, 12, 8, 8, 6, 21, 19, 10, 9], q=2\n return i + 1, x\n\n\ndef print_list_split_whitespace(a, x): # (1): print_list_split_whitespace=\n flag = False # (42): flag=False\n for y in a[:-1]: # (43): y=1 (47): y=0 ... (78): NO CHANGE\n if x != y: # (44): NO CHANGE (48): NO CHANGE ... (76): NO CHANGE\n print(y, end=\" \") # (49): NO CHANGE (56): NO CHANGE ... (77): NO CHANGE\n else:\n print(\"[\" + str(y) + \"]\", end=\" \") # (45): NO CHANGE (52): NO CHANGE\n flag = True # (46): flag=True (53): NO CHANGE\n if flag: # (79): NO CHANGE\n print(a[-1])\n else:\n print(\"[\" + str(a[-1]) + \"]\", end=\" \")\n\n\nn = int(input()) # (2): n=12\na = [int(x) for x in input().split()] # (3): a=[40, 19, 9, 1, 12, 8, 8, 6, 21, 0, 10, 1]\n\nq, x = partition(a, 0, n - 1) # (4): p=0, r=11\n\nprint_list_split_whitespace(a, x) # (41): NO CHANGE\n"], "anno_status": [false], "diff_content": " def partition(a, p, r):\n x = a[r]\n i = p - 1\n for j in range(p, r):\n if a[j] <= x:\n i += 1\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n tmp = a[i+1]\n a[i+1] = a[r]\n a[r] = tmp\n return i + 1, x\n \n \n def print_list_split_whitespace(a, x):\n- flag = False\n- for y in a[:-1]:\n- if x != y:\n- print(y, end=\" \")\n+ ind = 0\n+ for i, y in enumerate(a):\n+ if x == y:\n+ ind = i\n+ for i in range(len(a) - 1):\n+ if i == ind:\n+ print(\"[\" + str(a[i]) + \"]\", end=\" \")\n else:\n- print(\"[\" + str(y) + \"]\", end=\" \")\n- flag = True\n- if flag:\n- print(a[-1])\n+ print(a[i], end=\" \")\n+ if ind == len(a) - 1:\n+ print(\"[\" + str(a[-1]) + \"]\")\n else:\n- print(\"[\" + str(a[-1]) + \"]\", end=\" \")\n+ print(a[-1])\n \n \n n = int(input())\n a = [int(x) for x in input().split()]\n \n q, x = partition(a, 0, n - 1)\n \n print_list_split_whitespace(a, x)\n \n", "FL_content": "\n def partition(a, p, r):\n x = a[r]\n i = p - 1\n for j in range(p, r):\n if a[j] <= x:\n i += 1\n tmp = a[i]\n a[i] = a[j]\n a[j] = tmp\n tmp = a[i+1]\n a[i+1] = a[r]\n a[r] = tmp\n return i + 1, x\n \n \n def print_list_split_whitespace(a, x):\n flag = False\n for y in a[:-1]:\n if x != y:\n print(y, end=\" \")\n else:\n print(\"[\" + str(y) + \"]\", end=\" \")\n flag = True\n if flag:\n print(a[-1])\n else:\n print(\"[\" + str(a[-1]) + \"]\", end=\" \")\n \n \n n = int(input())\n a = [int(x) for x in input().split()]\n \n-q, x = partition(a, 0, n - 1)\n \n print_list_split_whitespace(a, x)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 36 }, { "user_id": "u090729464", "problem_id": "p02921", "submission1_id": "s633277623-FL", "submission2_id": "s971959979", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(input())\nt = list(input())\nnum = 0\nfor i in range(2):\n if s[i] == t[i]:\n num += 1\nprint(num)\n", "code2": "s = list(input())\nt = list(input())\nnum = 0\nfor i in range(3):\n if s[i] == t[i]:\n num += 1\nprint(num)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567591772", "date2": "1567592378", "bleu_score": "0.9772160520895917", "code1_test_status": [1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1], "code1_test_score": 80, "total_score": 103, "input": "RTS\nSTS\n", "actual_output": "1\n", "expected_output": "2\n\n", "anno_code": ["s = list(input()) # (0): s=['R', 'T', 'S']\nt = list(input()) # (1): t=['S', 'T', 'S']\nnum = 0 # (2): num=0\nfor i in range(2): # (3): i=0 (5): i=1 (8): NO CHANGE\n if s[i] == t[i]: # (4): NO CHANGE (6): NO CHANGE\n num += 1 # (7): num=1\nprint(num)\n"], "anno_status": [true], "diff_content": " s = list(input())\n t = list(input())\n num = 0\n-for i in range(2):\n+for i in range(3):\n if s[i] == t[i]:\n num += 1\n print(num)\n \n", "FL_content": "\n s = list(input())\n t = list(input())\n num = 0\n-for i in range(2):\n if s[i] == t[i]:\n num += 1\n print(num)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u571445182", "problem_id": "p02909", "submission1_id": "s896354228-FL", "submission2_id": "s294125752", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nW = [ \"Sunny\", \"Cloudy\", \"Rainy\" ]\n\nS = input()\n\nif S==W[0]:\n print(S[1])\nelif S==W[1]:\n print(S[2])\nelse:\n print(S[0])\n\n", "code2": "W = [ \"Sunny\", \"Cloudy\", \"Rainy\" ]\n \nS = input()\n \nif S==W[0]:\n print(W[1])\nelif S==W[1]:\n print(W[2])\nelse:\n print(W[0])\n ", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1568595978", "date2": "1568596281", "bleu_score": "0.8899706152166207", "code1_test_status": [0, 0], "code1_test_score": 0, "total_score": 2, "input": "Sunny\n", "actual_output": "u\n", "expected_output": "Cloudy\n", "anno_code": ["\nW = [ \"Sunny\", \"Cloudy\", \"Rainy\" ] # (0): W=['Sunny', 'Cloudy', 'Rainy']\n\nS = input() # (1): S=Sunny\n\nif S==W[0]: # (2): NO CHANGE\n print(S[1])\nelif S==W[1]:\n print(S[2])\nelse:\n print(S[0])\n\n"], "anno_status": [true], "diff_content": "-\n W = [ \"Sunny\", \"Cloudy\", \"Rainy\" ]\n-\n+ \n S = input()\n-\n+ \n if S==W[0]:\n- print(S[1])\n+ print(W[1])\n elif S==W[1]:\n- print(S[2])\n+ print(W[2])\n else:\n- print(S[0])\n-\n-\n+ print(W[0])\n+ \n", "FL_content": "\n \n W = [ \"Sunny\", \"Cloudy\", \"Rainy\" ]\n \n S = input()\n \n if S==W[0]:\n- print(S[1])\n elif S==W[1]:\n- print(S[2])\n else:\n- print(S[0])\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u923464546", "problem_id": "p02595", "submission1_id": "s146612740-FL", "submission2_id": "s561120206", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from math import sqrt\nn,d = map(int,input().strip().split())\ncnt = 0\nfor i in range(n):\n\tx,y = map(int,input().strip().split())\n\tif sqrt(x*x+y*y) >= d:\n\t\tcnt+=1\nprint(cnt)", "code2": "from math import sqrt\nn,d = map(int,input().strip().split())\ncnt = 0\nfor i in range(n):\n\tx,y = map(int,input().strip().split())\n\t\n\tif x*x+y*y <= d*d:\n\t\t\n\t\tcnt+=1\nprint(cnt)", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1596522731", "date2": "1596523000", "bleu_score": "0.9248074044614499", "code1_test_status": [0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0], "code1_test_score": 12, "total_score": 103, "input": "12 3\n2 1\n1 1\n1 1\n1 2\n0 2\n1 3\n2 1\n2 2\n2 3\n0 1\n3 2\n3 3\n", "actual_output": "4\n", "expected_output": "8\n\n", "anno_code": ["from math import sqrt\nn,d = map(int,input().strip().split()) # (0): n=12, d=3\ncnt = 0 # (1): cnt=0\nfor i in range(n): # (2): i=0 (5): i=1 ... (42): NO CHANGE\n\tx,y = map(int,input().strip().split()) # (3): x=2, y=1 (6): x=1 ... (39): y=3\n\tif sqrt(x*x+y*y) >= d: # (4): NO CHANGE (7): NO CHANGE ... (40): NO CHANGE\n\t\tcnt+=1 # (20): cnt=1 (30): cnt=2 ... (41): cnt=4\nprint(cnt)"], "anno_status": [true], "diff_content": " from math import sqrt\n n,d = map(int,input().strip().split())\n cnt = 0\n for i in range(n):\n \tx,y = map(int,input().strip().split())\n-\tif sqrt(x*x+y*y) >= d:\n+\t\n+\tif x*x+y*y <= d*d:\n+\t\t\n \t\tcnt+=1\n print(cnt)\n", "FL_content": "\n from math import sqrt\n n,d = map(int,input().strip().split())\n cnt = 0\n for i in range(n):\n \tx,y = map(int,input().strip().split())\n-\tif sqrt(x*x+y*y) >= d:\n-\t\tcnt+=1\n print(cnt)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u581040514", "problem_id": "p02921", "submission1_id": "s351309635-FL", "submission2_id": "s519177391", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = list(input())\nT = list(input()) \n\nans = 0\nprint(S)\nfor i in range(3):\n if S[i] == T[i]:\n ans += 1\n\nprint(ans)", "code2": "S = list(input())\nT = list(input()) \n\nans = 0\nfor i in range(3):\n if S[i] == T[i]:\n ans += 1\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1567364703", "date2": "1567364739", "bleu_score": "0.9185235520488739", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "UTR\nSTS\n", "actual_output": "['U', 'T', 'R']\n1\n", "expected_output": "1\n\n", "anno_code": ["S = list(input()) # (0): S=['U', 'T', 'R']\nT = list(input()) # (1): T=['S', 'T', 'S']\n\nans = 0 # (2): ans=0\nprint(S) # (3): NO CHANGE\nfor i in range(3): # (4): i=0 (6): i=1 ... (11): NO CHANGE\n if S[i] == T[i]: # (5): NO CHANGE (7): NO CHANGE (10): NO CHANGE\n ans += 1 # (8): ans=1\n\nprint(ans)"], "anno_status": [true], "diff_content": " S = list(input())\n T = list(input()) \n \n ans = 0\n-print(S)\n for i in range(3):\n if S[i] == T[i]:\n ans += 1\n \n print(ans)\n", "FL_content": "\n S = list(input())\n T = list(input()) \n \n ans = 0\n-print(S)\n for i in range(3):\n if S[i] == T[i]:\n ans += 1\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u698919163", "problem_id": "p03502", "submission1_id": "s008358329-FL", "submission2_id": "s590607008", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = input()\n\ntmp = 0\n\nfor i in range(len(N)):\n tmp += int(N[i])\n \nif tmp % int(N) == 0:\n print('Yes')\nelse:\n print('No')", "code2": "N = input()\n\ntmp = 0\n\nfor i in range(len(N)):\n tmp += int(N[i])\n \nif int(N) % tmp == 0:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1586651229", "date2": "1586651291", "bleu_score": "0.9764628234955328", "code1_test_status": [1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 20, "total_score": 23, "input": "190\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["N = input() # (0): N=190\n\ntmp = 0 # (1): tmp=0\n\nfor i in range(len(N)): # (2): i=0 (4): i=1 ... (8): NO CHANGE\n tmp += int(N[i]) # (3): tmp=1 (5): tmp=10 (7): NO CHANGE\n \nif tmp % int(N) == 0: # (9): NO CHANGE\n print('Yes')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " N = input()\n \n tmp = 0\n \n for i in range(len(N)):\n tmp += int(N[i])\n \n-if tmp % int(N) == 0:\n+if int(N) % tmp == 0:\n print('Yes')\n else:\n print('No')\n", "FL_content": "\n N = input()\n \n tmp = 0\n \n for i in range(len(N)):\n tmp += int(N[i])\n \n-if tmp % int(N) == 0:\n print('Yes')\n else:\n print('No')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 11 }, { "user_id": "u914330401", "problem_id": "p03448", "submission1_id": "s904405654-FL", "submission2_id": "s737386825", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a500 = int(input())\nb100 = int(input())\nc50 = int(input())\nX = int(input())\nans = 0\ngoukei = 0\nis_over = False\nfor i in range(a500):\n for j in range(b100):\n for k in range(c50):\n goukei = i * 500 + j * 100 + k * 50\n if goukei == X:\n ans += 1\nprint(ans)", "code2": "a500 = int(input())\nb100 = int(input())\nc50 = int(input())\nX = int(input())\nans = 0\ngoukei = 0\nis_over = False\nfor i in range(a500+1):\n for j in range(b100+1):\n for k in range(c50+1):\n goukei = i * 500 + j * 100 + k * 50\n if goukei == X:\n ans += 1\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1555278826", "date2": "1555279058", "bleu_score": "0.9620349823097949", "code1_test_status": [1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0], "code1_test_score": 92, "total_score": 103, "input": "2\n0\n1\n000\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["a500 = int(input()) # (0): a500=2\nb100 = int(input()) # (1): b100=0\nc50 = int(input()) # (2): c50=1\nX = int(input()) # (3): X=0\nans = 0 # (4): ans=0\ngoukei = 0 # (5): goukei=0\nis_over = False # (6): is_over=False\nfor i in range(a500): # (7): i=0 (9): i=1 (11): NO CHANGE\n for j in range(b100): # (8): NO CHANGE (10): NO CHANGE\n for k in range(c50):\n goukei = i * 500 + j * 100 + k * 50\n if goukei == X:\n ans += 1\nprint(ans)"], "anno_status": [true], "diff_content": " a500 = int(input())\n b100 = int(input())\n c50 = int(input())\n X = int(input())\n ans = 0\n goukei = 0\n is_over = False\n-for i in range(a500):\n- for j in range(b100):\n- for k in range(c50):\n+for i in range(a500+1):\n+ for j in range(b100+1):\n+ for k in range(c50+1):\n goukei = i * 500 + j * 100 + k * 50\n if goukei == X:\n ans += 1\n print(ans)\n", "FL_content": "\n a500 = int(input())\n b100 = int(input())\n c50 = int(input())\n X = int(input())\n ans = 0\n goukei = 0\n is_over = False\n-for i in range(a500):\n- for j in range(b100):\n- for k in range(c50):\n goukei = i * 500 + j * 100 + k * 50\n if goukei == X:\n ans += 1\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 14 }, { "user_id": "u954774382", "problem_id": "p03419", "submission1_id": "s892458369-FL", "submission2_id": "s082272209", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop, heappush\nfrom math import *\nfrom collections import defaultdict as dd, deque, Counter as C\nfrom itertools import combinations as comb, permutations as perm\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nfrom time import perf_counter\nfrom fractions import Fraction\n\n\n\nmod = int(pow(10, 9) + 7)\nmod2 = 998244353\ndef data(): return sys.stdin.readline().strip()\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\ndef l(): return list(sp())\ndef sl(): return list(ssp())\ndef sp(): return map(int, data().split())\ndef ssp(): return map(str, data().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n\n\n\n\n\n\n\n\n\nn,m=l()\nif(n==1 and m==1):\n print(1)\n exit()\nif(n<=2 and m<=2):\n print(0)\n exit()\nif(n==2):\n print((m-2)*2)\n exit()\nif(m==2):\n print((n-2)*2)\n exit()\nprint(max(1,n-2)*max(1,m-2))\n\n", "code2": "import sys\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop, heappush\nfrom math import *\nfrom collections import defaultdict as dd, deque, Counter as C\nfrom itertools import combinations as comb, permutations as perm\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nfrom time import perf_counter\nfrom fractions import Fraction\n\n\n\nmod = int(pow(10, 9) + 7)\nmod2 = 998244353\ndef data(): return sys.stdin.readline().strip()\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\ndef l(): return list(sp())\ndef sl(): return list(ssp())\ndef sp(): return map(int, data().split())\ndef ssp(): return map(str, data().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n\n\n\n\n\n\n\n\n\nn,m=l()\nif(n>m):\n n,m=m,n\nif(n==1 and m==1):\n print(1)\n exit()\nif(n==1 and m!=1):\n print(m-2)\n exit()\nprint((n-2)*(m-2))\n\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1591043438", "date2": "1591043724", "bleu_score": "0.9135326464354874", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1], "code1_test_score": 69, "total_score": 78, "input": "40 -1\n", "actual_output": "38\n", "expected_output": "-114\n\n", "anno_code": ["import sys\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop, heappush\nfrom math import *\nfrom collections import defaultdict as dd, deque, Counter as C\nfrom itertools import combinations as comb, permutations as perm\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nfrom time import perf_counter\nfrom fractions import Fraction\n\n\n\nmod = int(pow(10, 9) + 7) # (0): nan=nan, mod=1000000007\nmod2 = 998244353 # (1): nan=nan, mod2=998244353, data=\ndef data(): return sys.stdin.readline().strip()\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end) # (2): nan=nan, out=, l=, sl=, sp=, ssp=, l1d=, l2d=\ndef l(): return list(sp())\ndef sl(): return list(ssp())\ndef sp(): return map(int, data().split())\ndef ssp(): return map(str, data().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n\n\n\n\n\n\n\n\n\nn,m=l() # (3): nan=nan, n=40, m=-1\nif(n==1 and m==1): # (4): nan=nan\n print(1)\n exit()\nif(n<=2 and m<=2): # (5): nan=nan\n print(0)\n exit()\nif(n==2): # (6): nan=nan\n print((m-2)*2)\n exit()\nif(m==2): # (7): nan=nan\n print((n-2)*2)\n exit()\nprint(max(1,n-2)*max(1,m-2))\n\n"], "anno_status": [true], "diff_content": " import sys\n from functools import lru_cache, cmp_to_key\n from heapq import merge, heapify, heappop, heappush\n from math import *\n from collections import defaultdict as dd, deque, Counter as C\n from itertools import combinations as comb, permutations as perm\n from bisect import bisect_left as bl, bisect_right as br, bisect\n from time import perf_counter\n from fractions import Fraction\n \n \n \n mod = int(pow(10, 9) + 7)\n mod2 = 998244353\n def data(): return sys.stdin.readline().strip()\n def out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\n def l(): return list(sp())\n def sl(): return list(ssp())\n def sp(): return map(int, data().split())\n def ssp(): return map(str, data().split())\n def l1d(n, val=0): return [val for i in range(n)]\n def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n \n \n \n \n \n \n \n \n \n n,m=l()\n+if(n>m):\n+ n,m=m,n\n if(n==1 and m==1):\n print(1)\n exit()\n-if(n<=2 and m<=2):\n- print(0)\n+if(n==1 and m!=1):\n+ print(m-2)\n exit()\n-if(n==2):\n- print((m-2)*2)\n- exit()\n-if(m==2):\n- print((n-2)*2)\n- exit()\n-print(max(1,n-2)*max(1,m-2))\n+print((n-2)*(m-2))\n \n \n", "FL_content": "\n import sys\n from functools import lru_cache, cmp_to_key\n from heapq import merge, heapify, heappop, heappush\n from math import *\n from collections import defaultdict as dd, deque, Counter as C\n from itertools import combinations as comb, permutations as perm\n from bisect import bisect_left as bl, bisect_right as br, bisect\n from time import perf_counter\n from fractions import Fraction\n \n \n \n mod = int(pow(10, 9) + 7)\n mod2 = 998244353\n def data(): return sys.stdin.readline().strip()\n def out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\n def l(): return list(sp())\n def sl(): return list(ssp())\n def sp(): return map(int, data().split())\n def ssp(): return map(str, data().split())\n def l1d(n, val=0): return [val for i in range(n)]\n def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\n \n \n \n \n \n \n \n \n \n n,m=l()\n if(n==1 and m==1):\n print(1)\n exit()\n if(n<=2 and m<=2):\n print(0)\n exit()\n if(n==2):\n print((m-2)*2)\n exit()\n if(m==2):\n print((n-2)*2)\n exit()\n-print(max(1,n-2)*max(1,m-2))\n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 47 }, { "user_id": "u309141201", "problem_id": "p03164", "submission1_id": "s912453719-FL", "submission2_id": "s622208833", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, W = map(int, input().split())\nw = [0]\nv = [0]\nfor _ in range(N):\n x, y = map(int, input().split())\n w.append(x)\n v.append(y)\ndp = [[0 for _ in range(10**5 + 1)] for _ in range(N+1)]\nfor i in range(1, 10**5 + 1):\n dp[0][i] = float('inf')\n\nfor i in range(1, N+1):\n for j in range(10**5 + 1):\n dp[i][j] = dp[i-1][j]\n if j - v[i-1] >= 0:\n dp[i][j] = min(dp[i][j], dp[i-1][j-v[i]] + w[i])\n\nans = 0\nfor k in range(10**5 + 1):\n if dp[N][k] <= W:\n ans = max(ans, k)\n\n\nprint(ans)", "code2": "N, W = map(int, input().split())\nw = [0]\nv = [0]\nfor _ in range(N):\n x, y = map(int, input().split())\n w.append(x)\n v.append(y)\n\ndp = [[0 for _ in range(10**5 + 1)] for _ in range(N+1)]\nfor i in range(1, 10**5 + 1):\n dp[0][i] = float('inf')\n\nfor i in range(1, N+1):\n for j in range(10**5 + 1):\n dp[i][j] = dp[i-1][j]\n if j - v[i] >= 0:\n dp[i][j] = min(dp[i][j], dp[i-1][j-v[i]] + w[i])\n\nans = 0\nfor k in range(10**5 + 1):\n if dp[N][k] <= W:\n ans = max(ans, k)\n\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1587657179", "date2": "1587657453", "bleu_score": "0.9903908038982491", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 103, "input": "6 7\n6 5\n5 6\n3 3\n6 6\n3 5\n7 2\n", "actual_output": "6\n", "expected_output": "8\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N, W = map(int, input().split())\n w = [0]\n v = [0]\n for _ in range(N):\n x, y = map(int, input().split())\n w.append(x)\n v.append(y)\n+\n dp = [[0 for _ in range(10**5 + 1)] for _ in range(N+1)]\n for i in range(1, 10**5 + 1):\n dp[0][i] = float('inf')\n \n for i in range(1, N+1):\n for j in range(10**5 + 1):\n dp[i][j] = dp[i-1][j]\n- if j - v[i-1] >= 0:\n+ if j - v[i] >= 0:\n dp[i][j] = min(dp[i][j], dp[i-1][j-v[i]] + w[i])\n \n ans = 0\n for k in range(10**5 + 1):\n if dp[N][k] <= W:\n ans = max(ans, k)\n \n-\n print(ans)\n", "FL_content": "\n N, W = map(int, input().split())\n w = [0]\n v = [0]\n for _ in range(N):\n x, y = map(int, input().split())\n w.append(x)\n v.append(y)\n dp = [[0 for _ in range(10**5 + 1)] for _ in range(N+1)]\n for i in range(1, 10**5 + 1):\n dp[0][i] = float('inf')\n \n for i in range(1, N+1):\n for j in range(10**5 + 1):\n dp[i][j] = dp[i-1][j]\n if j - v[i-1] >= 0:\n dp[i][j] = min(dp[i][j], dp[i-1][j-v[i]] + w[i])\n \n ans = 0\n for k in range(10**5 + 1):\n if dp[N][k] <= W:\n ans = max(ans, k)\n \n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u285628294", "problem_id": "p02921", "submission1_id": "s106762821-FL", "submission2_id": "s826024261", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S=list(str(input()))\nT=list(str(input()))\ni=0\n\nfor i in range(3):\n\tif S[i]==T[i]:\n\t\ti+=1\nprint(i)", "code2": "S=list(str(input()))\nT=list(str(input()))\np=0\n\nfor i in range(3):\n\tif (S[i]==T[i]):\n\t\tp+=1\nprint(p)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1575312249", "date2": "1575313056", "bleu_score": "0.8774446812976884", "code1_test_status": [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], "code1_test_score": 4, "total_score": 103, "input": "TSR\nSTS\n", "actual_output": "2\n", "expected_output": "0\n\n", "anno_code": ["S=list(str(input())) # (0): S=['T', 'S', 'R']\nT=list(str(input())) # (1): T=['S', 'T', 'S']\ni=0 # (2): i=0\n\nfor i in range(3): # (3): NO CHANGE (5): i=1 ... (9): NO CHANGE\n\tif S[i]==T[i]: # (4): NO CHANGE (6): NO CHANGE (8): NO CHANGE\n\t\ti+=1\nprint(i)"], "anno_status": [true], "diff_content": " S=list(str(input()))\n T=list(str(input()))\n-i=0\n+p=0\n \n for i in range(3):\n-\tif S[i]==T[i]:\n-\t\ti+=1\n-print(i)\n+\tif (S[i]==T[i]):\n+\t\tp+=1\n+print(p)\n", "FL_content": "\n S=list(str(input()))\n T=list(str(input()))\n i=0\n \n for i in range(3):\n \tif S[i]==T[i]:\n-\t\ti+=1\n print(i)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 8 }, { "user_id": "u584093205", "problem_id": "p02318", "submission1_id": "s628110434-FL", "submission2_id": "s058002525", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def ans(n, m):\n ln = len(n)\n lm = len(m)\n dp = [list(range(lm+1)) for i in range(ln+1)]\n \n for i in range(ln+1):\n dp[i][0] = i\n for j in range(lm+1):\n dp[0][j] = j\n for i in range(1,ln+1):\n for j in range(1,lm+1):\n if n[i-1] == m[j-1]:\n dp[i][j] = dp[i-1][j-1]\n else:\n dp[i][j] = min(dp[i][j-1]+1, dp[i-1][j]+1, dp[i][j]+1, dp[i-1][j-1]+1)\n return dp[-1][-1]\nn = input()\nm = input()\nprint(ans(n, m))\n", "code2": "def ans(n, m):\n ln = len(n)\n lm = len(m)\n dp = [[0] * (lm+1) for _ in range(ln+1)]\n \n for i in range(ln+1):\n dp[i][0] = i\n for j in range(lm+1):\n dp[0][j] = j\n for i in range(1,ln+1):\n for j in range(1,lm+1):\n if n[i-1] == m[j-1]:\n dp[i][j] = dp[i-1][j-1]\n else:\n dp[i][j] = min(dp[i][j-1]+1, dp[i-1][j]+1, dp[i-1][j-1]+1)\n return dp[-1][-1]\nn = input()\nm = input()\nprint(ans(n, m))\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1527746718", "date2": "1527747322", "bleu_score": "0.9449768214984167", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 100, "total_score": 102, "input": "bd`c\nncd\n", "actual_output": "3\n", "expected_output": "4\n\n", "anno_code": ["def ans(n, m): # (0): ans=\n ln = len(n) # (4): ln=4\n lm = len(m) # (5): lm=3\n dp = [list(range(lm+1)) for i in range(ln+1)] # (6): dp\n \n for i in range(ln+1): # (7): i=0 (9): i=1 ... (17): NO CHANGE\n dp[i][0] = i # (8): NO CHANGE (10): dp ... (16): dp\n for j in range(lm+1): # (18): j=0 (20): j=1 ... (26): NO CHANGE\n dp[0][j] = j # (19): NO CHANGE (21): NO CHANGE ... (25): NO CHANGE\n for i in range(1,ln+1): # (27): i=1 (38): i=2 ... (60): i=4\n for j in range(1,lm+1): # (28): j=1 (31): j=2 ... (70): NO CHANGE\n if n[i-1] == m[j-1]: # (29): NO CHANGE (32): NO CHANGE ... (68): NO CHANGE\n dp[i][j] = dp[i-1][j-1] # (47): dp (66): NO CHANGE\n else:\n dp[i][j] = min(dp[i][j-1]+1, dp[i-1][j]+1, dp[i][j]+1, dp[i-1][j-1]+1) # (30): NO CHANGE (33): NO CHANGE ... (69): NO CHANGE\n return dp[-1][-1]\nn = input() # (1): n=bd`c\nm = input() # (2): m=ncd\nprint(ans(n, m)) # (3): NO CHANGE\n"], "anno_status": [true], "diff_content": " def ans(n, m):\n ln = len(n)\n lm = len(m)\n- dp = [list(range(lm+1)) for i in range(ln+1)]\n+ dp = [[0] * (lm+1) for _ in range(ln+1)]\n \n for i in range(ln+1):\n dp[i][0] = i\n for j in range(lm+1):\n dp[0][j] = j\n for i in range(1,ln+1):\n for j in range(1,lm+1):\n if n[i-1] == m[j-1]:\n dp[i][j] = dp[i-1][j-1]\n else:\n- dp[i][j] = min(dp[i][j-1]+1, dp[i-1][j]+1, dp[i][j]+1, dp[i-1][j-1]+1)\n+ dp[i][j] = min(dp[i][j-1]+1, dp[i-1][j]+1, dp[i-1][j-1]+1)\n return dp[-1][-1]\n n = input()\n m = input()\n print(ans(n, m))\n \n", "FL_content": "\n def ans(n, m):\n ln = len(n)\n lm = len(m)\n dp = [list(range(lm+1)) for i in range(ln+1)]\n \n for i in range(ln+1):\n dp[i][0] = i\n for j in range(lm+1):\n dp[0][j] = j\n for i in range(1,ln+1):\n for j in range(1,lm+1):\n if n[i-1] == m[j-1]:\n dp[i][j] = dp[i-1][j-1]\n else:\n- dp[i][j] = min(dp[i][j-1]+1, dp[i-1][j]+1, dp[i][j]+1, dp[i-1][j-1]+1)\n return dp[-1][-1]\n n = input()\n m = input()\n print(ans(n, m))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u102960641", "problem_id": "p03291", "submission1_id": "s715592501-FL", "submission2_id": "s509903005", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s = list(input())\nmod = 10**9 + 7\nabc = 0\nbc = 0\nc = 0\nq = 0\nprint(s[::-1])\nfor i in s[::-1]:\n if i == \"A\":\n abc = (abc + bc) % mod\n if i == \"B\":\n bc = (bc + c) % mod\n if i == \"C\":\n c = (3**q+c) % mod\n if i == \"?\":\n abc = (abc*3 + bc) % mod\n bc = (bc*3 + c) % mod \n c = (3**q + c*3) % mod\n q += 1\nprint(abc)", "code2": "s = input()\nmod = 10**9 + 7\nabc = 0\nbc = 0\nc = 0\nq = 0\nfor i in s[::-1]:\n if i == \"A\":\n abc = (abc + bc) % mod\n if i == \"B\":\n bc = (bc + c) % mod\n if i == \"C\":\n c = (pow(3,q,mod) + c) % mod\n if i == \"?\":\n abc = (abc*3 + bc) % mod\n bc = (bc*3 + c) % mod \n c = (pow(3,q,mod) + c*3) % mod\n q += 1\nprint(int(abc))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1546470484", "date2": "1546472321", "bleu_score": "0.9042655042630222", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "ABDBC\n", "actual_output": "['C', 'B', 'D', 'B', 'A']\n2\n", "expected_output": "2\n\n", "anno_code": ["s = list(input()) # (0): s=['A', 'B', 'D', 'B', 'C']\nmod = 10**9 + 7 # (1): mod=1000000007\nabc = 0 # (2): abc=0\nbc = 0 # (3): bc=0\nc = 0 # (4): c=0\nq = 0 # (5): q=0\nprint(s[::-1]) # (6): NO CHANGE\nfor i in s[::-1]: # (7): i=C (13): i=B ... (36): NO CHANGE\n if i == \"A\": # (8): NO CHANGE (14): NO CHANGE ... (31): NO CHANGE\n abc = (abc + bc) % mod # (32): abc=2\n if i == \"B\": # (9): NO CHANGE (15): NO CHANGE ... (33): NO CHANGE\n bc = (bc + c) % mod # (16): bc=1 (27): bc=2\n if i == \"C\": # (10): NO CHANGE (17): NO CHANGE ... (34): NO CHANGE\n c = (3**q+c) % mod # (11): c=1\n if i == \"?\": # (12): NO CHANGE (18): NO CHANGE ... (35): NO CHANGE\n abc = (abc*3 + bc) % mod\n bc = (bc*3 + c) % mod \n c = (3**q + c*3) % mod\n q += 1\nprint(abc)"], "anno_status": [true], "diff_content": "-s = list(input())\n+s = input()\n mod = 10**9 + 7\n abc = 0\n bc = 0\n c = 0\n q = 0\n-print(s[::-1])\n for i in s[::-1]:\n if i == \"A\":\n abc = (abc + bc) % mod\n if i == \"B\":\n bc = (bc + c) % mod\n if i == \"C\":\n- c = (3**q+c) % mod\n+ c = (pow(3,q,mod) + c) % mod\n if i == \"?\":\n abc = (abc*3 + bc) % mod\n bc = (bc*3 + c) % mod \n- c = (3**q + c*3) % mod\n+ c = (pow(3,q,mod) + c*3) % mod\n q += 1\n-print(abc)\n+print(int(abc))\n+\n", "FL_content": "\n s = list(input())\n mod = 10**9 + 7\n abc = 0\n bc = 0\n c = 0\n q = 0\n-print(s[::-1])\n for i in s[::-1]:\n if i == \"A\":\n abc = (abc + bc) % mod\n if i == \"B\":\n bc = (bc + c) % mod\n if i == \"C\":\n c = (3**q+c) % mod\n if i == \"?\":\n abc = (abc*3 + bc) % mod\n bc = (bc*3 + c) % mod \n c = (3**q + c*3) % mod\n q += 1\n-print(abc)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u703499662", "problem_id": "p03012", "submission1_id": "s119931274-FL", "submission2_id": "s936418809", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n=int(input())\nd=input().split()\nd=list(map(int,d))\ns1=[]\ns2=0\ndifn=10000000000000000000\ndif=0\ni=0\nwhile i<=len(d):\n s1.append(d[0])\n d.remove(d[0])\n s2=sum(d)\n if sum(s1)>=s2:\n dif=sum(s1)-s2\n elif s2>sum(s1):\n dif=s2-sum(s1)\n if dif=s2:\n dif=sum(s1)-s2\n elif s2>sum(s1):\n dif=s2-sum(s1)\n if dif<=difn:\n difn=dif\n else:\n break\n i+=1\nprint(difn)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560131014", "date2": "1560133770", "bleu_score": "0.9661472048489393", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1], "code1_test_score": 34, "total_score": 100, "input": "8\n56 0 33 7 1 11 140 4\n", "actual_output": "140\n", "expected_output": "36\n\n", "anno_code": ["n=int(input()) # (0): n=8\nd=input().split() # (1): d=['56', '0', '33', '7', '1', '11', '140', '4']\nd=list(map(int,d)) # (2): d=[56, 0, 33, 7, 1, 11, 140, 4]\ns1=[] # (3): s1=[]\ns2=0 # (4): s2=0\ndifn=10000000000000000000 # (5): difn=10000000000000000000\ndif=0 # (6): dif=0\ni=0 # (7): i=0\nwhile i<=len(d): # (8): NO CHANGE (18): NO CHANGE\n s1.append(d[0]) # (9): s1=[56] (19): s1=[56, 0]\n d.remove(d[0]) # (10): d=[0, 33, 7, 1, 11, 140, 4] (20): d=[33, 7, 1, 11, 140, 4]\n s2=sum(d) # (11): s2=196 (21): NO CHANGE\n if sum(s1)>=s2: # (12): NO CHANGE (22): NO CHANGE\n dif=sum(s1)-s2\n elif s2>sum(s1): # (13): NO CHANGE (23): NO CHANGE\n dif=s2-sum(s1) # (14): dif=140 (24): NO CHANGE\n if dif=s2:\n dif=sum(s1)-s2\n elif s2>sum(s1):\n dif=s2-sum(s1)\n- if dif=s2:\n dif=sum(s1)-s2\n elif s2>sum(s1):\n dif=s2-sum(s1)\n if dif\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)] # (4): f\n for i in range(len(X)+1): # (5): i=0 (19): i=1 ... (61): i=4\n for j in range(len(Y)+1): # (6): j=0 (9): j=1 ... (74): NO CHANGE\n if X[i-1]==Y[j-1]: # (7): NO CHANGE (10): NO CHANGE ... (72): NO CHANGE\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]) # (11): NO CHANGE (67): f\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1) # (8): f (14): f ... (73): f\n return f[len(X)][len(Y)]\n\nX=input() # (1): X=_dac\nY=input() # (2): Y=cmb\n\nprint(levenshtein(X,Y)) # (3): NO CHANGE\n"], "anno_status": [true], "diff_content": " def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n for i in range(len(X)+1):\n- for j in range(len(Y)+1):\n+ f[i][0]=i\n+ for j in range(len(Y)+1):\n+ f[0][j]=j\n+ for i in range(1,len(X)+1):\n+ for j in range(1,len(Y)+1):\n if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n \n X=input()\n Y=input()\n \n print(levenshtein(X,Y))\n \n+\n", "FL_content": "\n def levenshtein(X,Y):\n f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]\n for i in range(len(X)+1):\n for j in range(len(Y)+1):\n- if X[i-1]==Y[j-1]:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])\n else:\n f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)\n return f[len(X)][len(Y)]\n \n X=input()\n Y=input()\n \n print(levenshtein(X,Y))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 15 }, { "user_id": "u947883560", "problem_id": "p03739", "submission1_id": "s640704856-FL", "submission2_id": "s579665083", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\nimport sys\nINF = float(\"inf\")\n\n\ndef solve(n: int, a: \"List[int]\"):\n\n \n tot = 0\n countA = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 0:\n if tot <= 0:\n countA += -tot+1\n tot = 1\n elif i % 2 == 1:\n if tot >= 0:\n countA += tot+1\n tot = -1\n\n tot = 0\n countB = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 1:\n if tot <= 0:\n countB += -tot+1\n tot = 1\n elif i % 2 == 0:\n if tot >= 1:\n countB += tot+1\n tot = -1\n print(min(countA, countB))\n\n return\n\n\ndef main():\n\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n n = int(next(tokens)) \n a = [int(next(tokens)) for _ in range(n)] \n solve(n, a)\n\n\nif __name__ == '__main__':\n main()\n", "code2": "\nimport sys\nINF = float(\"inf\")\n\n\ndef solve(n: int, a: \"List[int]\"):\n\n \n tot = 0\n countA = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 0:\n if tot <= 0:\n countA += -tot+1\n tot = 1\n else:\n if tot >= 0:\n countA += tot+1\n tot = -1\n\n tot = 0\n countB = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 1:\n if tot <= 0:\n countB += -tot+1\n tot = 1\n else:\n if tot >= 0:\n countB += tot+1\n tot = -1\n print(min(countA, countB))\n\n return\n\n\ndef main():\n\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n n = int(next(tokens)) \n a = [int(next(tokens)) for _ in range(n)] \n solve(n, a)\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1566039050", "date2": "1566056730", "bleu_score": "0.97015933396301", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 80, "total_score": 94, "input": "5\n55 -1 -1 1 -6\n", "actual_output": "59\n", "expected_output": "61\n\n", "anno_code": ["\nimport sys\nINF = float(\"inf\") # (0): INF=inf\n\n\ndef solve(n: int, a: \"List[int]\"): # (1): solve=\n\n \n tot = 0\n countA = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 0:\n if tot <= 0:\n countA += -tot+1\n tot = 1\n elif i % 2 == 1:\n if tot >= 0:\n countA += tot+1\n tot = -1\n\n tot = 0\n countB = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 1:\n if tot <= 0:\n countB += -tot+1\n tot = 1\n elif i % 2 == 0:\n if tot >= 1:\n countB += tot+1\n tot = -1\n print(min(countA, countB))\n\n return\n\n\ndef main(): # (2): main=\n\n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n n = int(next(tokens)) \n a = [int(next(tokens)) for _ in range(n)] \n solve(n, a)\n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " \n import sys\n INF = float(\"inf\")\n \n \n def solve(n: int, a: \"List[int]\"):\n \n \n tot = 0\n countA = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 0:\n if tot <= 0:\n countA += -tot+1\n tot = 1\n- elif i % 2 == 1:\n+ else:\n if tot >= 0:\n countA += tot+1\n tot = -1\n \n tot = 0\n countB = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 1:\n if tot <= 0:\n countB += -tot+1\n tot = 1\n- elif i % 2 == 0:\n- if tot >= 1:\n+ else:\n+ if tot >= 0:\n countB += tot+1\n tot = -1\n print(min(countA, countB))\n \n return\n \n \n def main():\n \n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n n = int(next(tokens)) \n a = [int(next(tokens)) for _ in range(n)] \n solve(n, a)\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": "\n \n import sys\n INF = float(\"inf\")\n \n \n def solve(n: int, a: \"List[int]\"):\n \n \n tot = 0\n countA = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 0:\n if tot <= 0:\n countA += -tot+1\n tot = 1\n elif i % 2 == 1:\n if tot >= 0:\n countA += tot+1\n tot = -1\n \n tot = 0\n countB = 0\n for i, x in enumerate(a):\n tot += x\n if i % 2 == 1:\n if tot <= 0:\n countB += -tot+1\n tot = 1\n elif i % 2 == 0:\n- if tot >= 1:\n countB += tot+1\n tot = -1\n print(min(countA, countB))\n \n return\n \n \n def main():\n \n def iterate_tokens():\n for line in sys.stdin:\n for word in line.split():\n yield word\n tokens = iterate_tokens()\n n = int(next(tokens)) \n a = [int(next(tokens)) for _ in range(n)] \n solve(n, a)\n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 53 }, { "user_id": "u754022296", "problem_id": "p02867", "submission1_id": "s604282560-FL", "submission2_id": "s806074670", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nn = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = sorted(zip(B, A))\nB, A = zip(*C)\nD = sorted((a, i) for i, a in enumerate(A))\nfor i, (d, idx) in enumerate(D):\n if idx <= i and d <= B[idx]:\n s, t = i, idx\n break\nelse:\n print(\"No\")\n exit()\nA, indices = zip(*D)\nA = list(A)\nA[s], A[t] = A[t], A[s]\nfor a, b in zip(A, B):\n if a > b:\n print(\"No\")\n exit()\nprint(\"Yes\")", "code2": "import sys\ninput = sys.stdin.readline\n\nn = int(input())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = sorted(zip(B, A))\nB, A = zip(*C)\nD = sorted((a, i) for i, a in enumerate(A))\nE, indices = zip(*D)\nfor e, b in zip(E, B):\n if e > b:\n print(\"No\")\n exit()\nS = {0}\nnow = 0\nfor _ in range(n-1):\n if indices[now] in S:\n print(\"Yes\")\n exit()\n now = indices[now]\n S.add(now)\nfor i in range(n-1):\n if E[i+1] <= B[i]:\n print(\"Yes\")\n exit()\nprint(\"No\")", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1594067635", "date2": "1594075496", "bleu_score": "0.7354264518494363", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 97, "total_score": 103, "input": "3\n1 3 2\n3 2 3\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["追踪器未生成相应代码"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n \n n = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n C = sorted(zip(B, A))\n B, A = zip(*C)\n D = sorted((a, i) for i, a in enumerate(A))\n-for i, (d, idx) in enumerate(D):\n- if idx <= i and d <= B[idx]:\n- s, t = i, idx\n- break\n-else:\n- print(\"No\")\n- exit()\n-A, indices = zip(*D)\n-A = list(A)\n-A[s], A[t] = A[t], A[s]\n-for a, b in zip(A, B):\n- if a > b:\n+E, indices = zip(*D)\n+for e, b in zip(E, B):\n+ if e > b:\n print(\"No\")\n exit()\n-print(\"Yes\")\n+S = {0}\n+now = 0\n+for _ in range(n-1):\n+ if indices[now] in S:\n+ print(\"Yes\")\n+ exit()\n+ now = indices[now]\n+ S.add(now)\n+for i in range(n-1):\n+ if E[i+1] <= B[i]:\n+ print(\"Yes\")\n+ exit()\n+print(\"No\")\n", "FL_content": "\n import sys\n input = sys.stdin.readline\n \n n = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n C = sorted(zip(B, A))\n B, A = zip(*C)\n D = sorted((a, i) for i, a in enumerate(A))\n for i, (d, idx) in enumerate(D):\n if idx <= i and d <= B[idx]:\n s, t = i, idx\n break\n else:\n print(\"No\")\n exit()\n A, indices = zip(*D)\n A = list(A)\n A[s], A[t] = A[t], A[s]\n for a, b in zip(A, B):\n if a > b:\n print(\"No\")\n exit()\n print(\"Yes\")\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 24 }, { "user_id": "u062147869", "problem_id": "p03313", "submission1_id": "s179002735-FL", "submission2_id": "s793967945", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from copy import deepcopy\nN=int(input())\nA=[int(i) for i in input().split()]\n\ndef chmax(a,b):\n if a[0]\n if a[0], N=3, A=[2, 312, 111, 33, 0, 9, 17, 82], chmax=, dp=[(2, 0), (312, 2), (111, 2), (312, 111), (2, 0), (312, 9), (111, 17), (312, 111)], i=2, j=7\n return b\n elif a[0], N=3, A=[2, 312, 111, 33, 0, 9, 17, 82], chmax=, dp=[(2, 0), (312, 2), (111, 0), (111, 33), (0, 0), (9, 0), (17, 0), (82, 0)], i=0, j=3 (54): deepcopy=, N=3, A=[2, 312, 111, 33, 0, 9, 17, 82], chmax=, dp=[(2, 0), (312, 2), (111, 2), (312, 111), (0, 0), (9, 0), (17, 0), (82, 17)], i=1, j=3 ... (98): deepcopy=, N=3, A=[2, 312, 111, 33, 0, 9, 17, 82], chmax=, dp=[(2, 0), (312, 2), (111, 2), (312, 111), (2, 0), (312, 9), (111, 17), (82, 17)], i=2, j=6\n elif a[1], N=3, A=[2, 312, 111, 33, 0, 9, 17, 82], chmax=, dp=[(2, 0), (312, 2), (111, 0), (33, 0), (0, 0), (9, 0), (17, 0), (82, 0)], i=0, j=1 (28): deepcopy=, N=3, A=[2, 312, 111, 33, 0, 9, 17, 82], chmax=, dp=[(2, 0), (312, 2), (111, 0), (111, 33), (0, 0), (9, 0), (17, 0), (82, 0)], i=0, j=5 ... (70): deepcopy=, N=3, A=[2, 312, 111, 33, 0, 9, 17, 82], chmax=, dp=[(2, 0), (312, 2), (111, 2), (312, 111), (0, 0), (9, 0), (17, 0), (82, 17)], i=1, j=7\n return (a[0],b[0])\n else:\n return a\ndp=[(A[i],0) for i in range(1<, hp=\nimport heapq as hp\n\nN, K = map(int, input().split()) # (1): N=8, K=1\nA = list(map(int, input().split())) # (2): A=[-1, 1, 4, 5, 1, 1, 5, 4]\n\nans = 0 # (3): ans=0\ngraph = [[] for _ in range(N)] # (4): graph\nPar = [-1]*N # (5): Par=[-1, -1, -1, -1, -1, -1, -1, -1]\nfor i, a in enumerate(A): # (6): i=0, a=-1 (11): i=1, a=1 ... (39): graph\n if i == 0: # (7): NO CHANGE (12): NO CHANGE ... (36): graph\n if a != 1: # (8): NO CHANGE\n ans += 1 # (9): ans=1\n continue # (10): NO CHANGE\n Par[i] = a-1 # (13): Par=[-1, 0, -1, -1, -1, -1, -1, -1] (17): graph=[[1], [], [], [], [], [], [], []], Par=[-1, 0, 3, -1, -1, -1, -1, -1] ... (37): graph, Par=[-1, 0, 3, 4, 0, 0, 4, 3]\n graph[a-1].append(i) # (14): graph (18): graph ... (38): graph\n\nq = [] # (40): graph, q=[]\n\nstack = [0] # (41): graph, stack=[0]\nDepth = [-1]*N # (42): graph, Depth=[-1, -1, -1, -1, -1, -1, -1, -1]\nDepth[0] = 0 # (43): graph, Depth=[0, -1, -1, -1, -1, -1, -1, -1]\nwhile stack: # (44): graph (57): graph ... (102): graph\n p = stack.pop() # (45): graph=[[1, 4, 5], [], [], [2, 7], [3, 6], [], [], []], stack=[], p=0 (58): graph=[[1, 4, 5], [], [], [2, 7], [3, 6], [], [], []], stack=[1, 4], p=5 ... (98): graph=[[1, 4, 5], [], [], [2, 7], [3, 6], [], [], []], stack=[], p=1\n for np in graph[p]: # (46): graph, np=1 (49): graph, np=4 ... (99): graph\n Depth[np] = Depth[p] + 1 # (47): graph, Depth=[0, 1, -1, -1, -1, -1, -1, -1] (50): graph, Depth=[0, 1, -1, -1, 1, -1, -1, -1] ... (83): graph, Depth=[0, 1, 3, 2, 1, 1, 2, 3]\n stack.append(np) # (48): graph, stack=[1] (51): graph, stack=[1, 4] ... (84): graph, stack=[1, 2, 7]\n if len(graph[p]) == 0: # (56): graph (60): graph ... (100): graph\n hp.heappush(q, (-Depth[p], p)) # (61): graph, q=[(-1, 5)] (76): graph, q=[(-2, 6), (-1, 5)] ... (101): graph, q=[(-3, 2), (-3, 7), (-2, 6), (-1, 5), (-1, 1)]\n\nchecked = [False]*N # (103): graph, checked=[False, False, False, False, False, False, False, False]\n\nwhile q: # (104): graph (120): graph ... (204): graph\n d, s = hp.heappop(q) # (105): graph=[[1, 4, 5], [], [], [2, 7], [3, 6], [], [], []], q=[(-3, 7), (-1, 1), (-2, 6), (-1, 5)], d=-3, s=2 (121): graph=[[1, 4, 5], [], [], [2, 7], [3, 6], [], [], []], q=[(-2, 3), (-1, 1), (-2, 6), (-1, 5)], d=-3, s=7 ... (205): graph=[[1, 4, 5], [], [], [2, 7], [3, 6], [], [], []], q=[(-1, 4), (-1, 4), (-1, 4), (-1, 5)], d=-1, s=1\n d = -d # (106): graph, d=3 (122): graph, d=3 ... (206): graph, d=1\n if d <= K: break # (107): graph (123): graph ... (207): graph\n if checked[s]: continue # (108): graph (124): graph ... (192): graph\n \n \n for _ in range(K-1): # (109): graph (125): graph ... (193): graph\n s = Par[s]\n \n que = [s] # (110): graph, que=[2] (126): graph, que=[7] ... (194): graph, que=[6]\n while que: # (111): graph (117): graph ... (201): graph\n qq = [] # (112): graph, qq=[] (128): graph ... (196): graph\n for p in que: # (113): graph, p=2 (115): graph ... (199): graph\n for np in graph[p]: # (114): graph (130): graph ... (198): graph\n if not checked[np]: # (147): graph (151): graph ... (181): graph\n checked[np] = True # (148): graph, checked=[False, False, True, False, False, False, False, False] (152): graph, checked=[False, False, True, False, False, False, False, True]\n qq.append(np) # (149): graph, qq=[2] (153): graph, qq=[2, 7]\n que = qq # (116): graph, que=[] (132): graph, que=[] ... (200): graph, que=[]\n \n hp.heappush(q, (-Depth[Par[s]], Par[s])) # (118): graph, q=[(-3, 7), (-2, 3), (-2, 6), (-1, 5), (-1, 1)] (134): graph, q=[(-2, 3), (-2, 3), (-2, 6), (-1, 5), (-1, 1)] ... (202): graph, q=[(-1, 1), (-1, 4), (-1, 4), (-1, 5), (-1, 4)]\n ans += 1 # (119): ans=2, graph (135): ans=3, graph ... (203): ans=6, graph\n\nprint(ans)"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n-import heapq as hp\n+\n \n N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n ans = 0\n graph = [[] for _ in range(N)]\n Par = [-1]*N\n for i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n Par[i] = a-1\n graph[a-1].append(i)\n \n-q = []\n+qs = []\n \n stack = [0]\n Depth = [-1]*N\n Depth[0] = 0\n while stack:\n p = stack.pop()\n for np in graph[p]:\n Depth[np] = Depth[p] + 1\n stack.append(np)\n- if len(graph[p]) == 0:\n- hp.heappush(q, (-Depth[p], p))\n+ qs.append((Depth[p], p))\n \n+qs.sort(reverse=True)\n checked = [False]*N\n \n-while q:\n- d, s = hp.heappop(q)\n- d = -d\n+for d, s in qs:\n if d <= K: break\n if checked[s]: continue\n- \n- \n+\n for _ in range(K-1):\n s = Par[s]\n \n que = [s]\n+ checked[s] = True\n while que:\n qq = []\n for p in que:\n for np in graph[p]:\n if not checked[np]:\n checked[np] = True\n qq.append(np)\n que = qq\n \n- hp.heappush(q, (-Depth[Par[s]], Par[s]))\n ans += 1\n \n print(ans)\n", "FL_content": "\n import sys\n input = sys.stdin.readline\n import heapq as hp\n \n N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n ans = 0\n graph = [[] for _ in range(N)]\n Par = [-1]*N\n for i, a in enumerate(A):\n if i == 0:\n if a != 1:\n ans += 1\n continue\n Par[i] = a-1\n graph[a-1].append(i)\n \n q = []\n \n stack = [0]\n Depth = [-1]*N\n Depth[0] = 0\n while stack:\n p = stack.pop()\n for np in graph[p]:\n Depth[np] = Depth[p] + 1\n stack.append(np)\n if len(graph[p]) == 0:\n hp.heappush(q, (-Depth[p], p))\n \n checked = [False]*N\n \n while q:\n d, s = hp.heappop(q)\n d = -d\n if d <= K: break\n if checked[s]: continue\n \n \n for _ in range(K-1):\n s = Par[s]\n \n que = [s]\n while que:\n qq = []\n for p in que:\n for np in graph[p]:\n if not checked[np]:\n checked[np] = True\n qq.append(np)\n que = qq\n \n hp.heappush(q, (-Depth[Par[s]], Par[s]))\n ans += 1\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 57 }, { "user_id": "u202385788", "problem_id": "p02830", "submission1_id": "s672978153-FL", "submission2_id": "s872168533", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nS, T = input().split()\npart = [None for n in range(N)]\nfor i in range(N):\n part[i] = (S[i] + T[i])\n print(part[i])\nprint(\"\".join(part))", "code2": "N = int(input())\nS, T = input().split()\npart = [None for n in range(N)]\nfor i in range(N):\n part[i] = (S[i] + T[i])\nprint(\"\".join(part))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577068678", "date2": "1577068725", "bleu_score": "0.8722400140448053", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "5\nac_b` abb_b\n", "actual_output": "aa\ncb\n_b\nb_\n`b\naacb_bb_`b\n", "expected_output": "aacb_bb_`b\n\n", "anno_code": ["N = int(input()) # (0): N=5\nS, T = input().split() # (1): S=ac_b`, T=abb_b\npart = [None for n in range(N)] # (2): part=[None, None, None, None, None]\nfor i in range(N): # (3): i=0 (6): i=1 ... (18): NO CHANGE\n part[i] = (S[i] + T[i]) # (4): part=['aa', None, None, None, None] (7): part=['aa', 'cb', None, None, None] ... (16): part=['aa', 'cb', '_b', 'b_', '`b']\n print(part[i]) # (5): NO CHANGE (8): NO CHANGE ... (17): NO CHANGE\nprint(\"\".join(part))"], "anno_status": [true], "diff_content": " N = int(input())\n S, T = input().split()\n part = [None for n in range(N)]\n for i in range(N):\n part[i] = (S[i] + T[i])\n- print(part[i])\n print(\"\".join(part))\n", "FL_content": "\n N = int(input())\n S, T = input().split()\n part = [None for n in range(N)]\n for i in range(N):\n part[i] = (S[i] + T[i])\n- print(part[i])\n print(\"\".join(part))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u385244248", "problem_id": "p03207", "submission1_id": "s185408008-FL", "submission2_id": "s162473556", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,*p = map(int,open(0).read().split())\np.sort()\np[-1] /= 2\nprint(sum(p))\n", "code2": "N,*p = map(int,open(0).read().split())\np.sort()\np[-1] /= 2\nprint(int(sum(p)))\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1569736789", "date2": "1569736834", "bleu_score": "0.9312700864853667", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 102, "input": "4\n798\n582\n8452\n4320\n", "actual_output": "9926.0\n", "expected_output": "9926\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " N,*p = map(int,open(0).read().split())\n p.sort()\n p[-1] /= 2\n-print(sum(p))\n+print(int(sum(p)))\n \n", "FL_content": "\n N,*p = map(int,open(0).read().split())\n p.sort()\n p[-1] /= 2\n-print(sum(p))\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 5 }, { "user_id": "u380174947", "problem_id": "p02909", "submission1_id": "s902970368-FL", "submission2_id": "s532729964", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s=input()[:1]\nif s=='S':\n print('cloudy')\nelif s=='C':\n print('Rainy')\nelse:\n print('Sunny')", "code2": "s=input()[:1]\nif s=='S':\n print('Cloudy')\nelif s=='C':\n print('Rainy')\nelse:\n print('Sunny')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1574036768", "date2": "1574036808", "bleu_score": "0.9746768017625027", "code1_test_status": [1, 0], "code1_test_score": 1, "total_score": 2, "input": "Sunny\n", "actual_output": "cloudy\n", "expected_output": "Cloudy\n", "anno_code": ["s=input()[:1] # (0): s=S\nif s=='S': # (1): NO CHANGE\n print('cloudy')\nelif s=='C':\n print('Rainy')\nelse:\n print('Sunny')"], "anno_status": [true], "diff_content": " s=input()[:1]\n if s=='S':\n- print('cloudy')\n+ print('Cloudy')\n elif s=='C':\n print('Rainy')\n else:\n print('Sunny')\n", "FL_content": "\n s=input()[:1]\n if s=='S':\n- print('cloudy')\n elif s=='C':\n print('Rainy')\n else:\n print('Sunny')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 7 }, { "user_id": "u063056051", "problem_id": "p01102", "submission1_id": "s727619822-FL", "submission2_id": "s127406693", "status1": "Wrong Answer", "status2": "Accepted", "code1": "while 1:\n s1=input().split('\"')\n if s1[0]==\".\":\n break\n s2=input().split('\"')\n \n flag2=0\n cnt2=0\n flag=0\n \n if len(s1)!=len(s2):\n print(\"DIFFERENT\")\n else:\n i=0\n while i1:\n print(\"DIFFERENT\")\n break\n i+=1\n \n if flag==0 and cnt2==1:\n print(\"CLOSE\")\n if flag2==1:\n print(\"IDENTICAL\")\n", "code2": "while 1:\n s1=input().split('\"')\n if s1[0]==\".\":\n break\n s2=input().split('\"')\n \n cnt1=0\n cnt2=0\n flag=0\n \n if len(s1)!=len(s2):\n print(\"DIFFERENT\")\n else:\n i=0\n while i1:\n print(\"DIFFERENT\")\n break\n i+=1\n \n if flag==0 and cnt2==1:\n print(\"CLOSE\")\n if cnt1==len(s1):\n print(\"IDENTICAL\")\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1526985377", "date2": "1526985390", "bleu_score": "0.9628015617383371", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "print\"hello\";print123\nprint\"hello\";print123\nread\"B1input\";solve;output;\nread\"B2\";stlve;ovtpuo;\nread\"C1\";solve;output\"C1ans\";\nread\"C2\";solve;output\"C2ans\";\n\"\"\"\"\"\"\"\"\n\"\"\"\"\"24\"\"\"\nslwo\"program\"\nfast\"code\"\n\"super\"fast\"program\"\n\"super\"faster\"program\"\n\"\"X\nX\nI\"S\"\"CREAM\"\nI\"CE\"\"CREAM\"\n11\"22\"11\n1\"33\"111\n.\n", "actual_output": "IDENTICAL\nDIFFERENT\nIDENTICAL\nDIFFERENT\nIDENTICAL\nCLOSE\nIDENTICAL\nDIFFERENT\nDIFFERENT\nIDENTICAL\nDIFFERENT\nCLOSE\nIDENTICAL\nDIFFERENT\n", "expected_output": "IDENTICAL\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\nDIFFERENT\nDIFFERENT\nCLOSE\nDIFFERENT\n\n", "anno_code": ["while 1: # (0): NO CHANGE (25): NO CHANGE ... (243): NO CHANGE\n s1=input().split('\"') # (1): s1=['print', 'hello', ';print123'] (26): s1=['read', 'B1input', ';solve;output;'] ... (244): s1=['.']\n if s1[0]==\".\": # (2): NO CHANGE (27): NO CHANGE ... (245): NO CHANGE\n break\n s2=input().split('\"') # (3): s2=['print', 'hello', ';print123'] (28): s2=['read', 'B2', ';stlve;ovtpuo;'] ... (229): s2=['1', '33', '111']\n \n flag2=0 # (4): flag2=0 (29): flag2=0 ... (230): flag2=0\n cnt2=0 # (5): cnt2=0 (30): NO CHANGE ... (231): cnt2=0\n flag=0 # (6): flag=0 (31): NO CHANGE ... (232): NO CHANGE\n \n if len(s1)!=len(s2): # (7): NO CHANGE (32): NO CHANGE ... (233): NO CHANGE\n print(\"DIFFERENT\") # (189): NO CHANGE\n else:\n i=0 # (8): i=0 (33): i=0 ... (234): i=0\n while i1: # (42): NO CHANGE (70): NO CHANGE ... (207): NO CHANGE\n print(\"DIFFERENT\") # (81): NO CHANGE\n break # (82): NO CHANGE\n i+=1 # (12): i=1 (16): i=2 ... (220): i=5\n \n if flag==0 and cnt2==1: # (22): NO CHANGE (50): NO CHANGE ... (241): NO CHANGE\n print(\"CLOSE\") # (135): NO CHANGE (223): NO CHANGE\n if flag2==1: # (23): NO CHANGE (51): NO CHANGE ... (242): NO CHANGE\n print(\"IDENTICAL\") # (24): NO CHANGE (52): NO CHANGE ... (225): NO CHANGE\n"], "anno_status": [false], "diff_content": " while 1:\n s1=input().split('\"')\n if s1[0]==\".\":\n break\n s2=input().split('\"')\n \n- flag2=0\n+ cnt1=0\n cnt2=0\n flag=0\n \n if len(s1)!=len(s2):\n print(\"DIFFERENT\")\n else:\n i=0\n while i1:\n print(\"DIFFERENT\")\n break\n i+=1\n \n if flag==0 and cnt2==1:\n print(\"CLOSE\")\n- if flag2==1:\n+ if cnt1==len(s1):\n print(\"IDENTICAL\")\n \n", "FL_content": "\n while 1:\n s1=input().split('\"')\n if s1[0]==\".\":\n break\n s2=input().split('\"')\n \n flag2=0\n cnt2=0\n flag=0\n \n if len(s1)!=len(s2):\n print(\"DIFFERENT\")\n else:\n i=0\n while i1:\n print(\"DIFFERENT\")\n break\n i+=1\n \n if flag==0 and cnt2==1:\n print(\"CLOSE\")\n if flag2==1:\n print(\"IDENTICAL\")\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 33 }, { "user_id": "u391059484", "problem_id": "p03698", "submission1_id": "s497358719-FL", "submission2_id": "s580304013", "status1": "Wrong Answer", "status2": "Accepted", "code1": "S = input()\nfor i in range(len(S)):\n if i == len(S)-1:\n print('yes')\n break\n for p in range(i+1,len(S)):\n if S[i] == S[p]:\n print('no')\n break", "code2": "S = input()\nn = []\nfor i in range(len(S)):\n for p in range(i+1,len(S)):\n if S[i] == S[p]:\n n.append(0)\n if i == len(S)-1:\n n.append(1)\nfor i in range(len(n)):\n if n[i] == 0:\n print('no')\n break\n if i == len(n)-1:\n print('yes')", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1574956831", "date2": "1574957316", "bleu_score": "0.6276052184278417", "code1_test_status": [0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0], "code1_test_score": 36, "total_score": 103, "input": "dnereffit\n", "actual_output": "no\nno\nyes\n", "expected_output": "no\n\n", "anno_code": ["S = input() # (0): S=dnereffit\nfor i in range(len(S)): # (1): i=0 (20): i=1 ... (87): i=8\n if i == len(S)-1: # (2): NO CHANGE (21): NO CHANGE ... (88): NO CHANGE\n print('yes') # (89): NO CHANGE\n break\n for p in range(i+1,len(S)): # (3): p=1 (5): p=2 ... (86): NO CHANGE\n if S[i] == S[p]: # (4): NO CHANGE (6): NO CHANGE ... (85): NO CHANGE\n print('no') # (43): NO CHANGE (73): NO CHANGE\n break # (44): NO CHANGE (74): NO CHANGE\n"], "anno_status": [true], "diff_content": " S = input()\n+n = []\n for i in range(len(S)):\n- if i == len(S)-1:\n- print('yes')\n- break\n for p in range(i+1,len(S)):\n if S[i] == S[p]:\n- print('no')\n- break\n+ n.append(0)\n+ if i == len(S)-1:\n+ n.append(1)\n+for i in range(len(n)):\n+ if n[i] == 0:\n+ print('no')\n+ break\n+ if i == len(n)-1:\n+ print('yes')\n", "FL_content": "\n S = input()\n for i in range(len(S)):\n- if i == len(S)-1:\n- print('yes')\n- break\n for p in range(i+1,len(S)):\n if S[i] == S[p]:\n print('no')\n- break\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 9 }, { "user_id": "u619819312", "problem_id": "p03558", "submission1_id": "s474748392-FL", "submission2_id": "s096592750", "status1": "Wrong Answer", "status2": "Accepted", "code1": "from collections import deque\nk=int(input())\nt=[0]*k\nt[1]=1\nq=deque()\nq.append(1)\nwhile q:\n p=q.popleft()\n if p==0:\n print(t[0])\n break\n if not t[(p*10)%k]:\n t[(p*10)%k]=t[p]\n q.appendleft((p*10)%k)\n if not t[(p+1)%k]:\n t[(p+1)%k]=t[p]+1\n q.append((p+1)%k)", "code2": "from collections import deque\nk=int(input())\nt=[1]*k\nq=deque()\nq.append((1,1))\nwhile q:\n p,r=q.popleft()\n if p==0:\n print(r)\n break\n if t[p]:\n t[p]=0\n q.appendleft(((p*10)%k,r))\n q.append(((p+1)%k,r+1))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577909776", "date2": "1577909906", "bleu_score": "0.6790013495944845", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1], "code1_test_score": 18, "total_score": 22, "input": "3197\n", "actual_output": "4\n", "expected_output": "2\n\n", "anno_code": ["注释代码执行超时"], "anno_status": [false], "diff_content": " from collections import deque\n k=int(input())\n-t=[0]*k\n-t[1]=1\n+t=[1]*k\n q=deque()\n-q.append(1)\n+q.append((1,1))\n while q:\n- p=q.popleft()\n+ p,r=q.popleft()\n if p==0:\n- print(t[0])\n+ print(r)\n break\n- if not t[(p*10)%k]:\n- t[(p*10)%k]=t[p]\n- q.appendleft((p*10)%k)\n- if not t[(p+1)%k]:\n- t[(p+1)%k]=t[p]+1\n- q.append((p+1)%k)\n+ if t[p]:\n+ t[p]=0\n+ q.appendleft(((p*10)%k,r))\n+ q.append(((p+1)%k,r+1))\n", "FL_content": "\n from collections import deque\n k=int(input())\n t=[0]*k\n t[1]=1\n q=deque()\n q.append(1)\n while q:\n p=q.popleft()\n if p==0:\n print(t[0])\n break\n if not t[(p*10)%k]:\n t[(p*10)%k]=t[p]\n q.appendleft((p*10)%k)\n if not t[(p+1)%k]:\n t[(p+1)%k]=t[p]+1\n q.append((p+1)%k)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u144913062", "problem_id": "p02589", "submission1_id": "s759764213-FL", "submission2_id": "s639607482", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\nbase = 100\nmod = (1 << 61) - 1\n\nN = int(input())\nS = [input().rstrip()[::-1] for _ in range(N)]\nS.sort(key=lambda s: -len(s))\ncnt = {}\nans = 0\none = [0] * 26\nfor s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n hashes[0] = ord(s[0]) - ord('a')\n for i in range(1, n - 1):\n hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\nprint(ans)\n", "code2": "import sys\ninput = sys.stdin.readline\n\nbase = 1999849216943526259\nmod = (1 << 61) - 1\n\nN = int(input())\nS = [input().rstrip()[::-1] for _ in range(N)]\nS.sort(key=lambda s: -len(s))\ncnt = {}\nans = 0\none = [0] * 26\nfor s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n hashes[0] = ord(s[0])\n for i in range(1, n - 1):\n hashes[i] = (hashes[i-1] * base + ord(s[i])) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\nprint(ans)\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1597042383", "date2": "1597042563", "bleu_score": "0.9705213144470762", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 99, "total_score": 102, "input": "3\ndayxyb\nycw\naba\n", "actual_output": "1\n", "expected_output": "0\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\nbase = 100 # (1): base=100\nmod = (1 << 61) - 1 # (2): mod=2305843009213693951\n\nN = int(input()) # (3): N=3\nS = [input().rstrip()[::-1] for _ in range(N)] # (4): S=['byxyad', 'wcy', 'aba']\nS.sort(key=lambda s: -len(s)) # (5): NO CHANGE\ncnt = {} # (6): cnt={}\nans = 0 # (7): ans=0\none = [0] * 26 # (8): one=[0, 0, ..., 0, 0]\nfor s in S: # (9): s=byxyad (309): s=wcy ... (556): NO CHANGE\n n = len(s) # (10): n=6 (310): n=3 (433): NO CHANGE\n if n == 1: # (11): NO CHANGE (311): NO CHANGE (434): NO CHANGE\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1) # (12): hashes=[0, 0, 0, 0, 0] (312): hashes=[0, 0] (435): hashes=[0, 0]\n hashes[0] = ord(s[0]) - ord('a') # (13): hashes=[1, 0, 0, 0, 0] (313): hashes=[22, 0] (436): NO CHANGE\n for i in range(1, n - 1): # (14): i=1 (16): i=2 ... (439): NO CHANGE\n hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod # (15): hashes=[1, 124, 0, 0, 0] (17): hashes=[1, 124, 12423, 0, 0] ... (438): hashes=[0, 1]\n if hashes[-1] in cnt: # (23): NO CHANGE (317): NO CHANGE (440): NO CHANGE\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')] # (441): ans=1\n found = [0] * 26 # (24): found=[0, 0, ..., 0, 0] (318): found=[0, 0, ..., 0, 0] (442): found=[0, 0, ..., 0, 0]\n found[ord(s[-1]) - ord('a')] = 1 # (25): found=[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] (319): found=[0, 0, ..., 1, 0] (443): found=[1, 0, ..., 0, 0]\n for i in range(n - 2, 0, -1): # (26): NO CHANGE (83): i=3 ... (501): NO CHANGE\n found[ord(s[i]) - ord('a')] = 1 # (27): found=[1, 0, ..., 0, 0] (84): found=[1, 0, ..., 1, 0] ... (445): found=[1, 1, ..., 0, 0]\n if hashes[i-1] not in cnt: # (28): NO CHANGE (85): NO CHANGE ... (446): NO CHANGE\n cnt[hashes[i-1]] = [0] * 26 # (29): cnt={1242324: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (86): cnt={1242324: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 12423: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} ... (447): cnt={1242324: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 12423: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 124: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 1: [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0], 22: [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], 0: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]}\n for c in range(26): # (30): c=0 (32): c=1 ... (500): NO CHANGE\n cnt[hashes[i-1]][c] += found[c] # (31): cnt={1242324: [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]} (33): NO CHANGE ... (499): NO CHANGE\n found[ord(s[0]) - ord('a')] = 1 # (255): found=[1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0] (378): found=[0, 0, ..., 1, 0] (502): NO CHANGE\n for c in range(26): # (256): c=0 (258): c=1 ... (555): NO CHANGE\n one[c] += found[c] # (257): one=[1, 0, ..., 0, 0] (259): one=[1, 1, ..., 0, 0] ... (554): NO CHANGE\nprint(ans)\n"], "anno_status": [false], "diff_content": " import sys\n input = sys.stdin.readline\n \n-base = 100\n+base = 1999849216943526259\n mod = (1 << 61) - 1\n \n N = int(input())\n S = [input().rstrip()[::-1] for _ in range(N)]\n S.sort(key=lambda s: -len(s))\n cnt = {}\n ans = 0\n one = [0] * 26\n for s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n- hashes[0] = ord(s[0]) - ord('a')\n+ hashes[0] = ord(s[0])\n for i in range(1, n - 1):\n- hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod\n+ hashes[i] = (hashes[i-1] * base + ord(s[i])) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\n print(ans)\n \n", "FL_content": "\n import sys\n input = sys.stdin.readline\n \n base = 100\n mod = (1 << 61) - 1\n \n N = int(input())\n S = [input().rstrip()[::-1] for _ in range(N)]\n S.sort(key=lambda s: -len(s))\n cnt = {}\n ans = 0\n one = [0] * 26\n for s in S:\n n = len(s)\n if n == 1:\n ans += one[ord(s[0]) - ord('a')]\n continue\n hashes = [0] * (n - 1)\n hashes[0] = ord(s[0]) - ord('a')\n for i in range(1, n - 1):\n hashes[i] = (hashes[i-1] * base + ord(s[i]) - ord('a')) % mod\n if hashes[-1] in cnt:\n ans += cnt[hashes[-1]][ord(s[-1]) - ord('a')]\n found = [0] * 26\n found[ord(s[-1]) - ord('a')] = 1\n for i in range(n - 2, 0, -1):\n found[ord(s[i]) - ord('a')] = 1\n if hashes[i-1] not in cnt:\n cnt[hashes[i-1]] = [0] * 26\n for c in range(26):\n cnt[hashes[i-1]][c] += found[c]\n found[ord(s[0]) - ord('a')] = 1\n for c in range(26):\n one[c] += found[c]\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 36 }, { "user_id": "u298945776", "problem_id": "p02958", "submission1_id": "s054699481-FL", "submission2_id": "s944331472", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import copy\n\nN = int(input())\nP = list(map(int, input().split()))\nX = copy.copy(P)\nY = copy.copy(P)\nX.sort()\n\ndef f(P):\n for i in range(N):\n for j in range(N):\n P = copy.copy(Y)\n P[i],P[j] = P[j],P[i]\n\n if X == P:\n return \"Yes\"\n return \"NO\"\n\nans = f(P)\nprint(ans)", "code2": "import copy\n\nN = int(input())\nP = list(map(int, input().split()))\nX = copy.copy(P)\n\nX.sort()\nans = \"NO\"\n\n\nfor i in range(N):\n for j in range(N):\n Y = copy.copy(P)\n a = copy.copy(P[i])\n b = copy.copy(P[j])\n Y[i] = b\n Y[j] = a\n \n if Y == X:\n ans = \"YES\"\n\n\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1564276814", "date2": "1564280437", "bleu_score": "0.8017645682074367", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], "code1_test_score": 99, "total_score": 100, "input": "5\n5 2 3 4 1\n", "actual_output": "Yes\n", "expected_output": "YES\n", "anno_code": ["import copy\n\nN = int(input()) # (0): N=5\nP = list(map(int, input().split())) # (1): P=[5, 2, 3, 4, 1]\nX = copy.copy(P) # (2): X=[5, 2, 3, 4, 1]\nY = copy.copy(P) # (3): Y=[5, 2, 3, 4, 1]\nX.sort() # (4): X=[1, 2, 3, 4, 5]\n\ndef f(P): # (5): f=\n for i in range(N): # (7): i=0\n for j in range(N): # (8): j=0 (12): j=1 ... (24): j=4\n P = copy.copy(Y) # (9): NO CHANGE (13): NO CHANGE ... (25): P=[5, 2, 3, 4, 1]\n P[i],P[j] = P[j],P[i] # (10): NO CHANGE (14): P=[2, 5, 3, 4, 1] ... (26): P=[1, 2, 3, 4, 5]\n\n if X == P: # (11): NO CHANGE (15): NO CHANGE ... (27): copy=, N=5, P=[5, 2, 3, 4, 1], X=[1, 2, 3, 4, 5], Y=[5, 2, 3, 4, 1], f=, ans=Yes\n return \"Yes\"\n return \"NO\"\n\nans = f(P) # (6): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " import copy\n \n N = int(input())\n P = list(map(int, input().split()))\n X = copy.copy(P)\n-Y = copy.copy(P)\n+\n X.sort()\n+ans = \"NO\"\n+\n \n-def f(P):\n- for i in range(N):\n- for j in range(N):\n- P = copy.copy(Y)\n- P[i],P[j] = P[j],P[i]\n+for i in range(N):\n+ for j in range(N):\n+ Y = copy.copy(P)\n+ a = copy.copy(P[i])\n+ b = copy.copy(P[j])\n+ Y[i] = b\n+ Y[j] = a\n+ \n+ if Y == X:\n+ ans = \"YES\"\n \n- if X == P:\n- return \"Yes\"\n- return \"NO\"\n \n-ans = f(P)\n print(ans)\n", "FL_content": "\n import copy\n \n N = int(input())\n P = list(map(int, input().split()))\n X = copy.copy(P)\n Y = copy.copy(P)\n X.sort()\n \n def f(P):\n for i in range(N):\n for j in range(N):\n P = copy.copy(Y)\n P[i],P[j] = P[j],P[i]\n \n if X == P:\n- return \"Yes\"\n- return \"NO\"\n \n ans = f(P)\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 20 }, { "user_id": "u667024514", "problem_id": "p03012", "submission1_id": "s839561645-FL", "submission2_id": "s835736588", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\nlis = list(map(int,input().split()))\nans = 10 ** 9\nle = sum(lis)\nri = sum(lis)\nfor num in lis:\n le += num\n ri -= num\n ans = min(ans,abs(ri-le))\nprint(ans)", "code2": "n = int(input())\nlis = list(map(int,input().split()))\nans = 10 ** 9\nle = 0\nri = sum(lis)\nans = sum(lis)\nfor num in lis:\n le += num\n ri -= num\n ans = min(ans,abs(ri-le))\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1560128746", "date2": "1560129526", "bleu_score": "0.9462396717342345", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], "code1_test_score": 1, "total_score": 100, "input": "8\n47 30 99 2 5 2 102 4\n", "actual_output": "94\n", "expected_output": "61\n\n", "anno_code": ["n = int(input()) # (0): n=8\nlis = list(map(int,input().split())) # (1): lis=[47, 30, 99, 2, 5, 2, 102, 4]\nans = 10 ** 9 # (2): ans=1000000000\nle = sum(lis) # (3): le=291\nri = sum(lis) # (4): ri=291\nfor num in lis: # (5): num=47 (9): num=30 ... (37): NO CHANGE\n le += num # (6): le=338 (10): le=368 ... (34): le=582\n ri -= num # (7): ri=244 (11): ri=214 ... (35): ri=0\n ans = min(ans,abs(ri-le)) # (8): ans=94 (12): NO CHANGE ... (36): NO CHANGE\nprint(ans)"], "anno_status": [true], "diff_content": " n = int(input())\n lis = list(map(int,input().split()))\n ans = 10 ** 9\n-le = sum(lis)\n+le = 0\n ri = sum(lis)\n+ans = sum(lis)\n for num in lis:\n le += num\n ri -= num\n ans = min(ans,abs(ri-le))\n print(ans)\n+\n", "FL_content": "\n n = int(input())\n lis = list(map(int,input().split()))\n ans = 10 ** 9\n le = sum(lis)\n ri = sum(lis)\n for num in lis:\n le += num\n ri -= num\n ans = min(ans,abs(ri-le))\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u735460540", "problem_id": "p03031", "submission1_id": "s178870194-FL", "submission2_id": "s362638042", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n, m = map(int, input().split())\n\nk = []\n\nfor i in range(m):\n k.append(list(map(int, input().split())))\n\np = list(map(int, input().split()))\n\nans = 0\n\nfor i in range(2**n):\n switch = [0] * n\n for j in range(n):\n if i >> j & 1 == 1:\n switch[j] += 1\n cntt = 0\n for j in range(m):\n cnt = 0\n for s in range(1, k[j][0]+1):\n if switch[s-1] == 1:\n cnt += 1\n if cnt%2 != p[j]:\n cntt += 1\n break\n if cntt == 0:\n ans += 1\n\nprint(ans)", "code2": "n, m = map(int, input().split())\n\nk = []\n\nfor i in range(m):\n k.append(list(map(int, input().split())))\n\np = list(map(int, input().split()))\n\nans = 0\n\nfor i in range(2**n):\n switch = [0] * n\n for j in range(n):\n if i >> j & 1 == 1:\n switch[j] += 1\n cntt = 0\n for j in range(m):\n cnt = 0\n for s in range(1, k[j][0]+1):\n if switch[k[j][s]-1] == 1:\n cnt += 1\n if cnt%2 == p[j]:\n cntt += 1\n if cntt == m:\n ans += 1\n\nprint(ans)", "original_language1": "PyPy3 (2.4.0)", "original_language2": "PyPy3 (2.4.0)", "date1": "1589018370", "date2": "1589019788", "bleu_score": "0.9533737774646955", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 101, "total_score": 103, "input": "2 2\n1 1 2\n1 2\n0 0\n", "actual_output": "2\n", "expected_output": "1\n\n", "anno_code": ["n, m = map(int, input().split()) # (0): n=2, m=2\n\nk = [] # (1): k=[]\n\nfor i in range(m): # (2): i=0 (4): i=1 (6): k\n k.append(list(map(int, input().split()))) # (3): k (5): k\n\np = list(map(int, input().split())) # (7): k, p=[0, 0]\n\nans = 0 # (8): k, ans=0\n\nfor i in range(2**n): # (9): k, i=0 (32): k, i=1 ... (95): k\n switch = [0] * n # (10): k, switch=[0, 0] (33): k ... (76): k, switch=[0, 0]\n for j in range(n): # (11): k, j=0 (13): k, j=1 ... (83): k\n if i >> j & 1 == 1: # (12): k (14): k ... (81): k\n switch[j] += 1 # (36): k, switch=[1, 0] (57): k, switch=[0, 1] ... (82): k, switch=[1, 1]\n cntt = 0 # (16): k, cntt=0 (40): k ... (84): k\n for j in range(m): # (17): k, j=0 (23): k, j=1 ... (85): k, j=0\n cnt = 0 # (18): k, cnt=0 (24): k ... (86): k\n for s in range(1, k[j][0]+1): # (19): k, s=1 (21): k ... (90): k\n if switch[s-1] == 1: # (20): k (26): k ... (88): k\n cnt += 1 # (45): k, cnt=1 (89): k, cnt=1\n if cnt%2 != p[j]: # (22): k (28): k ... (91): k\n cntt += 1 # (48): k, cntt=1 (92): k, cntt=1\n break # (49): k (93): k\n if cntt == 0: # (30): k (50): k ... (94): k\n ans += 1 # (31): k, ans=1 (74): k, ans=2\n\nprint(ans)"], "anno_status": [true], "diff_content": " n, m = map(int, input().split())\n \n k = []\n \n for i in range(m):\n k.append(list(map(int, input().split())))\n \n p = list(map(int, input().split()))\n \n ans = 0\n \n for i in range(2**n):\n switch = [0] * n\n for j in range(n):\n if i >> j & 1 == 1:\n switch[j] += 1\n cntt = 0\n for j in range(m):\n cnt = 0\n for s in range(1, k[j][0]+1):\n- if switch[s-1] == 1:\n+ if switch[k[j][s]-1] == 1:\n cnt += 1\n- if cnt%2 != p[j]:\n+ if cnt%2 == p[j]:\n cntt += 1\n- break\n- if cntt == 0:\n+ if cntt == m:\n ans += 1\n \n print(ans)\n", "FL_content": "\n n, m = map(int, input().split())\n \n k = []\n \n for i in range(m):\n k.append(list(map(int, input().split())))\n \n p = list(map(int, input().split()))\n \n ans = 0\n \n for i in range(2**n):\n switch = [0] * n\n for j in range(n):\n if i >> j & 1 == 1:\n switch[j] += 1\n cntt = 0\n for j in range(m):\n cnt = 0\n for s in range(1, k[j][0]+1):\n if switch[s-1] == 1:\n cnt += 1\n if cnt%2 != p[j]:\n cntt += 1\n break\n if cntt == 0:\n ans += 1\n \n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 29 }, { "user_id": "u537905693", "problem_id": "p02867", "submission1_id": "s302886937-FL", "submission2_id": "s723600503", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\n\n\nfrom collections import Counter\ndef ri():\n return int(input())\n\ndef rl():\n return list(input().split())\n\ndef rli():\n return list(map(int, input().split()))\n\ndef main():\n n = ri()\n la = rli()\n lb = rli()\n ll = []\n pb = []\n for i in range(n):\n ll.append([la[i], lb[i]])\n ll.sort()\n for i in range(n):\n pb.append([ll[i][1], i])\n pb.sort()\n pc = [0 for _ in range(n)]\n for i in range(n):\n pc[pb[i][1]] = i\n \n \n\n la.sort()\n lb.sort()\n for i in range(n):\n if la[i] > lb[i]:\n print(\"No\")\n return\n\n cnt = 0\n \n for i in range(n):\n j = pc[i]\n if i == j:\n continue\n while i != j:\n if ll[i][0] != ll[j][0] and ll[i][1] != ll[j][1]:\n cnt += 1\n ll[i][1], ll[j][1] = ll[j][1], ll[i][1]\n pc[i], pc[j] = pc[j], pc[i]\n \n j = pc[i]\n \n if cnt <= n-2:\n print(\"Yes\")\n else:\n print(\"No\")\n \n\n \n\n\nif __name__ == '__main__':\n main()\n", "code2": "\n\n\nfrom collections import Counter\ndef ri():\n return int(input())\n\ndef rl():\n return list(input().split())\n\ndef rli():\n return list(map(int, input().split()))\n\ndef main():\n n = ri()\n la = rli()\n lb = rli()\n lab = []\n for i in range(n):\n lab.append([la[i], lb[i]])\n\n la.sort()\n lb.sort()\n for i in range(n):\n if la[i] > lb[i]:\n print(\"No\")\n return\n\n \n lab.sort()\n \n for i in range(n):\n lab[i].append(i)\n \n lab.sort(key=lambda x: x[1])\n \n length = 1\n fr = 0\n to = lab[0][2]\n while to != 0:\n fr = to\n to = lab[fr][2]\n length += 1\n \n if length < n:\n print(\"Yes\")\n return\n\n \n for i in range(n-1):\n if lb[i] >= la[i+1]:\n print(\"Yes\")\n return\n \n \n print(\"No\")\n\n\nif __name__ == '__main__':\n main()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1573355526", "date2": "1573436465", "bleu_score": "0.69873512123484", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1], "code1_test_score": 98, "total_score": 103, "input": "3\n1 -3 2\n-1 18 8\n", "actual_output": "No\n", "expected_output": "Yes\n\n", "anno_code": ["\n\n\nfrom collections import Counter\ndef ri(): # (0): ri=\n return int(input())\n\ndef rl(): # (1): rl=\n return list(input().split())\n\ndef rli(): # (2): rli=\n return list(map(int, input().split()))\n\ndef main(): # (3): main=\n n = ri()\n la = rli()\n lb = rli()\n ll = []\n pb = []\n for i in range(n):\n ll.append([la[i], lb[i]])\n ll.sort()\n for i in range(n):\n pb.append([ll[i][1], i])\n pb.sort()\n pc = [0 for _ in range(n)]\n for i in range(n):\n pc[pb[i][1]] = i\n \n \n\n la.sort()\n lb.sort()\n for i in range(n):\n if la[i] > lb[i]:\n print(\"No\")\n return\n\n cnt = 0\n \n for i in range(n):\n j = pc[i]\n if i == j:\n continue\n while i != j:\n if ll[i][0] != ll[j][0] and ll[i][1] != ll[j][1]:\n cnt += 1\n ll[i][1], ll[j][1] = ll[j][1], ll[i][1]\n pc[i], pc[j] = pc[j], pc[i]\n \n j = pc[i]\n \n if cnt <= n-2:\n print(\"Yes\")\n else:\n print(\"No\")\n \n\n \n\n\nif __name__ == '__main__':\n main()\n"], "anno_status": [true], "diff_content": " \n \n \n from collections import Counter\n def ri():\n return int(input())\n \n def rl():\n return list(input().split())\n \n def rli():\n return list(map(int, input().split()))\n \n def main():\n n = ri()\n la = rli()\n lb = rli()\n- ll = []\n- pb = []\n+ lab = []\n for i in range(n):\n- ll.append([la[i], lb[i]])\n- ll.sort()\n- for i in range(n):\n- pb.append([ll[i][1], i])\n- pb.sort()\n- pc = [0 for _ in range(n)]\n- for i in range(n):\n- pc[pb[i][1]] = i\n- \n- \n+ lab.append([la[i], lb[i]])\n \n la.sort()\n lb.sort()\n for i in range(n):\n if la[i] > lb[i]:\n print(\"No\")\n return\n \n- cnt = 0\n+ \n+ lab.sort()\n \n for i in range(n):\n- j = pc[i]\n- if i == j:\n- continue\n- while i != j:\n- if ll[i][0] != ll[j][0] and ll[i][1] != ll[j][1]:\n- cnt += 1\n- ll[i][1], ll[j][1] = ll[j][1], ll[i][1]\n- pc[i], pc[j] = pc[j], pc[i]\n- \n- j = pc[i]\n+ lab[i].append(i)\n \n- if cnt <= n-2:\n- print(\"Yes\")\n- else:\n- print(\"No\")\n+ lab.sort(key=lambda x: x[1])\n \n+ length = 1\n+ fr = 0\n+ to = lab[0][2]\n+ while to != 0:\n+ fr = to\n+ to = lab[fr][2]\n+ length += 1\n+ \n+ if length < n:\n+ print(\"Yes\")\n+ return\n \n \n+ for i in range(n-1):\n+ if lb[i] >= la[i+1]:\n+ print(\"Yes\")\n+ return\n+ \n+ \n+ print(\"No\")\n \n \n if __name__ == '__main__':\n main()\n \n", "FL_content": "\n \n \n \n from collections import Counter\n def ri():\n return int(input())\n \n def rl():\n return list(input().split())\n \n def rli():\n return list(map(int, input().split()))\n \n def main():\n n = ri()\n la = rli()\n lb = rli()\n ll = []\n pb = []\n for i in range(n):\n ll.append([la[i], lb[i]])\n ll.sort()\n for i in range(n):\n pb.append([ll[i][1], i])\n pb.sort()\n pc = [0 for _ in range(n)]\n for i in range(n):\n pc[pb[i][1]] = i\n \n \n \n la.sort()\n lb.sort()\n for i in range(n):\n if la[i] > lb[i]:\n print(\"No\")\n return\n \n cnt = 0\n \n for i in range(n):\n j = pc[i]\n if i == j:\n continue\n while i != j:\n if ll[i][0] != ll[j][0] and ll[i][1] != ll[j][1]:\n cnt += 1\n ll[i][1], ll[j][1] = ll[j][1], ll[i][1]\n pc[i], pc[j] = pc[j], pc[i]\n \n j = pc[i]\n \n if cnt <= n-2:\n print(\"Yes\")\n else:\n print(\"No\")\n \n \n \n \n \n if __name__ == '__main__':\n main()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 64 }, { "user_id": "u133038626", "problem_id": "p03643", "submission1_id": "s429929886-FL", "submission2_id": "s881624034", "status1": "Wrong Answer", "status2": "Accepted", "code1": "\"ABC\"+input()", "code2": "print(\"ABC\"+input())", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1550032028", "date2": "1550032103", "bleu_score": "0.6198021310128995", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 24, "input": "186\n", "actual_output": "no output\n", "expected_output": "ABC186\n\n", "anno_code": ["\"ABC\"+input()"], "anno_status": [true], "diff_content": "-\"ABC\"+input()\n+print(\"ABC\"+input())\n", "FL_content": "\n-\"ABC\"+input()\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 1 }, { "user_id": "u785578220", "problem_id": "p02843", "submission1_id": "s389383945-FL", "submission2_id": "s080235693", "status1": "Wrong Answer", "status2": "Accepted", "code1": "x = input()\nx = '000'+x\nz = x[:-2]\ny = x[-2:]\ns = 0\nz = int(z)\ny = int(y)\nL = []\nfor i in range(1,15):\n s +=i\n if s>=y and z>=i:\n print(1)\n exit()\nif z>=14:\n print(1)\n exit()\nprint(0)", "code2": "x = input()\nx = '000'+x\nz = x[:-2]\ny = x[-2:]\ns = 0\nz = int(z)\ny = int(y)\nL = []\nfor i in range(1,21):\n s +=5\n if s>=y and z>=i:\n print(1)\n exit()\nif z>=20:\n print(1)\n exit()\nprint(0)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1589414510", "date2": "1589414693", "bleu_score": "0.9563169035602996", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], "code1_test_score": 23, "total_score": 26, "input": "420\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["x = input() # (0): x=420\nx = '000'+x # (1): x=000420\nz = x[:-2] # (2): z=0004\ny = x[-2:] # (3): y=20\ns = 0 # (4): s=0\nz = int(z) # (5): z=4\ny = int(y) # (6): y=20\nL = [] # (7): L=[]\nfor i in range(1,15): # (8): i=1 (11): i=2 ... (50): NO CHANGE\n s +=i # (9): s=1 (12): s=3 ... (48): s=105\n if s>=y and z>=i: # (10): NO CHANGE (13): NO CHANGE ... (49): NO CHANGE\n print(1)\n exit()\nif z>=14: # (51): NO CHANGE\n print(1)\n exit()\nprint(0)"], "anno_status": [true], "diff_content": " x = input()\n x = '000'+x\n z = x[:-2]\n y = x[-2:]\n s = 0\n z = int(z)\n y = int(y)\n L = []\n-for i in range(1,15):\n- s +=i\n+for i in range(1,21):\n+ s +=5\n if s>=y and z>=i:\n print(1)\n exit()\n-if z>=14:\n+if z>=20:\n print(1)\n exit()\n print(0)\n", "FL_content": "\n x = input()\n x = '000'+x\n z = x[:-2]\n y = x[-2:]\n s = 0\n z = int(z)\n y = int(y)\n L = []\n for i in range(1,15):\n- s +=i\n if s>=y and z>=i:\n print(1)\n exit()\n if z>=14:\n print(1)\n exit()\n print(0)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 17 }, { "user_id": "u763968347", "problem_id": "p02830", "submission1_id": "s956202113-FL", "submission2_id": "s815813831", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nS,T = input().split()\n\nprint(S)\nprint(T)\n\ns = ''\nfor i in range(N):\n s += S[i]\n s += T[i]\n\nprint(s)", "code2": "N = int(input())\nS,T = input().split()\n\ns = ''\nfor i in range(N):\n s += S[i]\n s += T[i]\n\nprint(s)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577066941", "date2": "1577066972", "bleu_score": "0.8315481959114176", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "2\nkq cf\n", "actual_output": "kq\ncf\nkcqf\n", "expected_output": "kcqf\n\n", "anno_code": ["N = int(input()) # (0): N=2\nS,T = input().split() # (1): S=kq, T=cf\n\nprint(S) # (2): NO CHANGE\nprint(T) # (3): NO CHANGE\n\ns = '' # (4): s=\nfor i in range(N): # (5): i=0 (8): i=1 (11): NO CHANGE\n s += S[i] # (6): s=k (9): s=kcq\n s += T[i] # (7): s=kc (10): s=kcqf\n\nprint(s)"], "anno_status": [true], "diff_content": " N = int(input())\n S,T = input().split()\n \n-print(S)\n-print(T)\n-\n s = ''\n for i in range(N):\n s += S[i]\n s += T[i]\n \n print(s)\n", "FL_content": "\n N = int(input())\n S,T = input().split()\n \n-print(S)\n-print(T)\n-\n s = ''\n for i in range(N):\n s += S[i]\n s += T[i]\n \n print(s)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u047816928", "problem_id": "p02697", "submission1_id": "s416594463-FL", "submission2_id": "s203014953", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N, M = map(int, input().split())\nl = N\nr = 1\nd = 1\nfor i in range(M):\n print(l, r)\n l-=1\n r+=1\n if min(l-r, N-l+r)==d: \n r+=1\n d = min(l-r, N-l+r)\n", "code2": "N, M = map(int, input().split())\nl = N\nr = 1\nfor i in range(M):\n if N%4==0 and i*4==N: r+=1\n if N%2==0 and l-r==N\n print(l, r)\n l-=1\n r+=1", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1588473484", "date2": "1588475266", "bleu_score": "0.6982926221849795", "code1_test_status": [0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 6, "input": "20 9\n", "actual_output": "20 1\n19 2\n18 3\n17 4\n16 5\n15 7\n14 8\n13 9\n12 10\n", "expected_output": "1 10\n2 9\n3 8\n4 7\n5 6\n11 19\n12 18\n13 17\n14 16\n\n", "anno_code": ["N, M = map(int, input().split()) # (0): N=20, M=9\nl = N # (1): l=20\nr = 1 # (2): r=1\nd = 1 # (3): d=1\nfor i in range(M): # (4): i=0 (10): i=1 ... (53): i=8\n print(l, r) # (5): NO CHANGE (11): NO CHANGE ... (54): NO CHANGE\n l-=1 # (6): l=19 (12): l=18 ... (55): l=11\n r+=1 # (7): r=2 (13): r=3 ... (56): r=11\n if min(l-r, N-l+r)==d: # (8): NO CHANGE (14): NO CHANGE ... (57): NO CHANGE\n r+=1 # (33): r=7\n d = min(l-r, N-l+r) # (9): d=3 (15): d=5 ... (58): d=0\n"], "anno_status": [true], "diff_content": " N, M = map(int, input().split())\n l = N\n r = 1\n-d = 1\n for i in range(M):\n+ if N%4==0 and i*4==N: r+=1\n+ if N%2==0 and l-r==N\n print(l, r)\n l-=1\n r+=1\n- if min(l-r, N-l+r)==d: \n- r+=1\n- d = min(l-r, N-l+r)\n-\n", "FL_content": "\n N, M = map(int, input().split())\n l = N\n r = 1\n-d = 1\n for i in range(M):\n print(l, r)\n l-=1\n r+=1\n- if min(l-r, N-l+r)==d: \n r+=1\n- d = min(l-r, N-l+r)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 12 }, { "user_id": "u663910047", "problem_id": "p02419", "submission1_id": "s620557338-FL", "submission2_id": "s197377905", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = 0\nT=\"\"\ns= input()\nwhile True:\n t=input()\n T += t + \" \"\n if T.count(\"END_OF_TEXT\")>0:\n break\n\nTL = T.split(\" \")\nprint (TL)\nfor i in TL:\n if i == str(s):\n n +=1\n else:\n pass\nprint (n)\n ", "code2": "n = 0\nT=\"\"\ns= input().lower()\nwhile True:\n t=input()\n T += t + \" \"\n if T.count(\"END_OF_TEXT\")>0:\n break\n\nTL = T.split(\" \")\n\nfor i in TL:\n i = i.replace('\"','')\n i= i.replace(\".\",\"\")\n if i.lower() == str(s):\n n += 1\n else:\n pass\nprint (n)", "original_language1": "Python3", "original_language2": "Python3", "date1": "1500270875", "date2": "1500272620", "bleu_score": "0.7714844981419642", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 101, "input": "comquter\nNurtures computer scientists and highly-skilked computer engineers\nwho wilk create and tiolpxe \"knowledge\" for the enw era.\nProvides an sutotanding computer environment.\nEND_OF_TEXT\n", "actual_output": "['Nurtures', 'computer', 'scientists', 'and', 'highly-skilked', 'computer', 'engineers', 'who', 'wilk', 'create', 'and', 'tiolpxe', '\"knowledge\"', 'for', 'the', 'enw', 'era.', 'Provides', 'an', 'sutotanding', 'computer', 'environment.', 'END_OF_TEXT', '']\n0\n", "expected_output": "0\n\n", "anno_code": ["n = 0 # (0): n=0\nT=\"\" # (1): T=\ns= input() # (2): s=comquter\nwhile True: # (3): NO CHANGE (7): NO CHANGE ... (15): NO CHANGE\n t=input() # (4): t=Nurtures computer scientists and highly-skilked computer engineers (8): t=who wilk create and tiolpxe \"knowledge\" for the enw era. ... (16): t=END_OF_TEXT\n T += t + \" \" # (5): T=Nurtures computer scientists and highly-skilked computer engineers (9): T=Nurtures computer scientists and highly-skilked computer engineers who wilk create and tiolpxe \"knowledge\" for the enw era. ... (17): T=Nurtures computer scientists and highly-skilked computer engineers who wilk create and tiolpxe \"knowledge\" for the enw era. Provides an sutotanding computer environment. END_OF_TEXT \n if T.count(\"END_OF_TEXT\")>0: # (6): NO CHANGE (10): NO CHANGE ... (18): NO CHANGE\n break # (19): NO CHANGE\n\nTL = T.split(\" \") # (20): TL=[Nurtures, computer, ..., END_OF_TEXT, ]\nprint (TL) # (21): NO CHANGE\nfor i in TL: # (22): i=Nurtures (25): i=computer ... (94): NO CHANGE\n if i == str(s): # (23): NO CHANGE (26): NO CHANGE ... (92): NO CHANGE\n n +=1\n else:\n pass # (24): NO CHANGE (27): NO CHANGE ... (93): NO CHANGE\nprint (n)\n "], "anno_status": [true], "diff_content": " n = 0\n T=\"\"\n-s= input()\n+s= input().lower()\n while True:\n t=input()\n T += t + \" \"\n if T.count(\"END_OF_TEXT\")>0:\n break\n \n TL = T.split(\" \")\n-print (TL)\n+\n for i in TL:\n- if i == str(s):\n- n +=1\n+ i = i.replace('\"','')\n+ i= i.replace(\".\",\"\")\n+ if i.lower() == str(s):\n+ n += 1\n else:\n pass\n print (n)\n- \n", "FL_content": "\n n = 0\n T=\"\"\n s= input()\n while True:\n t=input()\n T += t + \" \"\n if T.count(\"END_OF_TEXT\")>0:\n break\n \n TL = T.split(\" \")\n-print (TL)\n for i in TL:\n if i == str(s):\n n +=1\n else:\n pass\n print (n)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 18 }, { "user_id": "u473666214", "problem_id": "p02318", "submission1_id": "s744611382-FL", "submission2_id": "s986289136", "status1": "Wrong Answer", "status2": "Accepted", "code1": "s_1 = input()\ns_2 = input()\n\nmemo = [[0 for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)]\nflag = [[False for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)]\n\nfor i in range(1, len(s_1)+1):\n for j in range(1, len(s_2)+1):\n if not flag[i][j]:\n flag[i][j] = True\n if s_1[i-1] == s_2[j-1]:\n memo[i][j] = min(memo[i-1][j-1], memo[i][j-1]+1)\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1)\n else:\n memo[i][j] = min(memo[i-1][j-1]+1, memo[i][j-1]+1)\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1)\n\nprint(memo[len(s_1)][len(s_2)])\n\n\n\n\n", "code2": "s_1 = input()\ns_2 = input()\n\nmemo = [[0 for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)]\nflag = [[False for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)]\n\nfor i in range(1, len(s_1)+1):\n memo[i][0] = i\nfor j in range(1, len(s_2)+1):\n memo[0][j] = j\n\nfor i in range(1, len(s_1)+1):\n for j in range(1, len(s_2)+1):\n if not flag[i][j]:\n flag[i][j] = True\n if s_1[i-1] == s_2[j-1]:\n memo[i][j] = min(memo[i-1][j-1], memo[i][j-1]+1)\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1)\n else:\n memo[i][j] = min(memo[i-1][j-1]+1, memo[i][j-1]+1)\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1)\n\nprint(memo[len(s_1)][len(s_2)])\n\n", "original_language1": "Python3", "original_language2": "Python3", "date1": "1540527595", "date2": "1540528060", "bleu_score": "0.8644021963197996", "code1_test_status": [1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0], "code1_test_score": 36, "total_score": 102, "input": "bd`c\ndcn\n", "actual_output": "2\n", "expected_output": "3\n\n", "anno_code": ["s_1 = input() # (0): s_1=bd`c\ns_2 = input() # (1): s_2=dcn\n\nmemo = [[0 for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)] # (2): memo\nflag = [[False for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)] # (3): flag\n\nfor i in range(1, len(s_1)+1): # (4): i=1 (24): i=2 ... (84): NO CHANGE\n for j in range(1, len(s_2)+1): # (5): j=1 (11): j=2 ... (83): NO CHANGE\n if not flag[i][j]: # (6): NO CHANGE (12): NO CHANGE ... (78): NO CHANGE\n flag[i][j] = True # (7): flag (13): flag ... (79): flag\n if s_1[i-1] == s_2[j-1]: # (8): NO CHANGE (14): NO CHANGE ... (80): NO CHANGE\n memo[i][j] = min(memo[i-1][j-1], memo[i][j-1]+1) # (29): NO CHANGE (75): memo\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1) # (30): NO CHANGE (76): NO CHANGE\n else:\n memo[i][j] = min(memo[i-1][j-1]+1, memo[i][j-1]+1) # (9): memo (15): memo ... (81): memo\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1) # (10): NO CHANGE (16): NO CHANGE ... (82): NO CHANGE\n\nprint(memo[len(s_1)][len(s_2)])\n\n\n\n\n"], "anno_status": [true], "diff_content": " s_1 = input()\n s_2 = input()\n \n memo = [[0 for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)]\n flag = [[False for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)]\n \n+for i in range(1, len(s_1)+1):\n+ memo[i][0] = i\n+for j in range(1, len(s_2)+1):\n+ memo[0][j] = j\n+\n for i in range(1, len(s_1)+1):\n for j in range(1, len(s_2)+1):\n if not flag[i][j]:\n flag[i][j] = True\n if s_1[i-1] == s_2[j-1]:\n memo[i][j] = min(memo[i-1][j-1], memo[i][j-1]+1)\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1)\n else:\n memo[i][j] = min(memo[i-1][j-1]+1, memo[i][j-1]+1)\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1)\n \n print(memo[len(s_1)][len(s_2)])\n \n \n-\n-\n-\n", "FL_content": "\n s_1 = input()\n s_2 = input()\n \n memo = [[0 for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)]\n flag = [[False for i in range(len(s_2)+1)] for j in range(len(s_1) + 1)]\n \n for i in range(1, len(s_1)+1):\n for j in range(1, len(s_2)+1):\n if not flag[i][j]:\n flag[i][j] = True\n if s_1[i-1] == s_2[j-1]:\n memo[i][j] = min(memo[i-1][j-1], memo[i][j-1]+1)\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1)\n else:\n memo[i][j] = min(memo[i-1][j-1]+1, memo[i][j-1]+1)\n memo[i][j] = min(memo[i][j], memo[i-1][j]+1)\n \n print(memo[len(s_1)][len(s_2)])\n \n \n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 23 }, { "user_id": "u297574184", "problem_id": "p03183", "submission1_id": "s118517210-FL", "submission2_id": "s818390121", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys\ninput = sys.stdin.readline\n\ndef solve():\n N = int(input())\n items = [tuple(map(int, input().split())) for _ in range(N)]\n\n capW = max([w+s for w, s, v in items])\n items.sort(key=lambda x: x[0]+x[1])\n\n def knapsack01(items, capW):\n dp = [0] * (capW+1)\n for wi, si, vi in items:\n for w in reversed(range(wi, si+wi+1)):\n v0 = dp[w-wi] + vi\n if v0 > dp[w]:\n dp[w] = v0\n return dp[-1]\n\n ans = knapsack01(items, capW)\n print(ans)\n\n\nsolve()\n", "code2": "import sys\ninput = sys.stdin.readline\n\ndef solve():\n N = int(input())\n items = [tuple(map(int, input().split())) for _ in range(N)]\n\n capW = max([w+s for w, s, v in items])\n items.sort(key=lambda x: x[0]+x[1])\n\n def knapsack01(items, capW):\n dp = [0] * (capW+1)\n for wi, si, vi in items:\n for w in reversed(range(wi, si+wi+1)):\n v0 = dp[w-wi] + vi\n if v0 > dp[w]:\n dp[w] = v0\n return max(dp)\n\n ans = knapsack01(items, capW)\n print(ans)\n\n\nsolve()\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1592089925", "date2": "1592090531", "bleu_score": "0.9858053183960847", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1], "code1_test_score": 33, "total_score": 104, "input": "3\n3 5 20\n1 1 7\n3 1 40\n", "actual_output": "20\n", "expected_output": "67\n\n", "anno_code": ["import sys\ninput = sys.stdin.readline # (0): input=\n\ndef solve(): # (1): solve=\n N = int(input()) # (3): N=3\n items = [tuple(map(int, input().split())) for _ in range(N)] # (4): items=[(3, 5, 20), (1, 1, 7), (3, 1, 40)]\n\n capW = max([w+s for w, s, v in items]) # (5): capW=8\n items.sort(key=lambda x: x[0]+x[1]) # (6): items=[(1, 1, 7), (3, 1, 40), (3, 5, 20)]\n\n def knapsack01(items, capW): # (7): knapsack01=.knapsack01 at 0x0000029C23EE9B40>\n dp = [0] * (capW+1) # (9): dp=[0, 0, 0, 0, 0, 0, 0, 0, 0]\n for wi, si, vi in items: # (10): wi=1, si=1, vi=7 (20): wi=3, vi=40 ... (54): N=3, knapsack01=.knapsack01 at 0x0000029C23EE9B40>, ans=20\n for w in reversed(range(wi, si+wi+1)): # (11): w=2 (15): w=1 ... (53): NO CHANGE\n v0 = dp[w-wi] + vi # (12): v0=7 (16): NO CHANGE ... (51): v0=20\n if v0 > dp[w]: # (13): NO CHANGE (17): NO CHANGE ... (52): NO CHANGE\n dp[w] = v0 # (14): dp=[0, 0, 7, 0, 0, 0, 0, 0, 0] (18): dp=[0, 7, 7, 0, 0, 0, 0, 0, 0] ... (46): dp=[0, 7, 7, 40, 47, 27, 60, 67, 20]\n return dp[-1]\n\n ans = knapsack01(items, capW) # (8): NO CHANGE\n print(ans)\n\n\nsolve() # (2): NO CHANGE\n"], "anno_status": [true], "diff_content": " import sys\n input = sys.stdin.readline\n \n def solve():\n N = int(input())\n items = [tuple(map(int, input().split())) for _ in range(N)]\n \n capW = max([w+s for w, s, v in items])\n items.sort(key=lambda x: x[0]+x[1])\n \n def knapsack01(items, capW):\n dp = [0] * (capW+1)\n for wi, si, vi in items:\n for w in reversed(range(wi, si+wi+1)):\n v0 = dp[w-wi] + vi\n if v0 > dp[w]:\n dp[w] = v0\n- return dp[-1]\n+ return max(dp)\n \n ans = knapsack01(items, capW)\n print(ans)\n \n \n solve()\n \n", "FL_content": "\n import sys\n input = sys.stdin.readline\n \n def solve():\n N = int(input())\n items = [tuple(map(int, input().split())) for _ in range(N)]\n \n capW = max([w+s for w, s, v in items])\n items.sort(key=lambda x: x[0]+x[1])\n \n def knapsack01(items, capW):\n dp = [0] * (capW+1)\n for wi, si, vi in items:\n- for w in reversed(range(wi, si+wi+1)):\n v0 = dp[w-wi] + vi\n if v0 > dp[w]:\n dp[w] = v0\n return dp[-1]\n \n ans = knapsack01(items, capW)\n print(ans)\n \n \n solve()\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 25 }, { "user_id": "u097121858", "problem_id": "p03147", "submission1_id": "s253769738-FL", "submission2_id": "s774131122", "status1": "Wrong Answer", "status2": "Accepted", "code1": "def min_other_than_zero(seq):\n seq = set(seq)\n if 0 in seq: seq.remove(0)\n return min(seq)\n\n\ndef water(H, start, stop):\n if max(H) == 0:\n return\n\n \n valley = min_other_than_zero(H[start:stop])\n for i in range(start, stop):\n H[i] -= valley\n global ans\n ans += valley\n\n \n valley_indices = [start + i for i, h in enumerate(H[start:stop]) if h == 0]\n if len(valley_indices) == 0:\n return\n if valley_indices[0] != start:\n valley_indices = [start - 1] + valley_indices\n if valley_indices[-1] != stop - 1:\n valley_indices += [stop]\n for i in range(len(valley_indices) - 1):\n if valley_indices[i + 1] - valley_indices[i] > 1:\n water(H, valley_indices[i] + 1, valley_indices[i + 1])\n\n\nN = int(input())\nH = [int(s) for s in input().split()]\n\nans = 0\nwater(H, 0, N)\nprint(ans)\n", "code2": "def water(H, start, stop):\n if max(H) == 0:\n return\n\n \n valley = min(H[start:stop])\n for i in range(start, stop):\n H[i] -= valley\n global ans\n ans += valley\n\n \n valley_indices = [start + i for i, h in enumerate(H[start:stop]) if h == 0]\n if valley_indices[0] != start:\n valley_indices = [start - 1] + valley_indices\n if valley_indices[-1] != stop - 1:\n valley_indices += [stop]\n for i in range(len(valley_indices) - 1):\n if valley_indices[i + 1] - valley_indices[i] > 1:\n water(H, valley_indices[i] + 1, valley_indices[i + 1])\n\n\nN = int(input())\nH = [int(s) for s in input().split()]\n\nans = 0\nwater(H, 0, N)\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1558267719", "date2": "1558268221", "bleu_score": "0.7874918442402232", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "code1_test_score": 95, "total_score": 99, "input": "5\n2 0 8 3 0\n", "actual_output": "8\n", "expected_output": "10\n\n", "anno_code": ["def min_other_than_zero(seq): # (0): min_other_than_zero=\n seq = set(seq) # (8): seq={0, 8, 2, 3} (32): seq={1, -2, 6} ... (71): seq={5}\n if 0 in seq: seq.remove(0) # (9): H=[2, 0, 8, 3, 0], stop=5, start=0, valley=2 (33): H=[0, -2, 6, 1, -2], stop=5, start=1, valley=-2 ... (72): H=[0, 0, 5, 0, 0], stop=3, start=2, valley=5\n return min(seq)\n\n\ndef water(H, start, stop): # (1): water=\n if max(H) == 0: # (6): NO CHANGE (30): NO CHANGE ... (69): NO CHANGE\n return\n\n \n valley = min_other_than_zero(H[start:stop]) # (7): seq=[2, 0, 8, 3, 0] (31): seq=[-2, 6, 1, -2] ... (70): seq=[5]\n for i in range(start, stop): # (10): i=0 (12): i=1 ... (75): NO CHANGE\n H[i] -= valley # (11): H=[0, 0, 8, 3, 0] (13): H=[0, -2, 8, 3, 0] ... (74): H=[0, 0, 0, 0, 0]\n global ans\n ans += valley # (21): NO CHANGE (43): NO CHANGE ... (76): NO CHANGE\n\n \n valley_indices = [start + i for i, h in enumerate(H[start:stop]) if h == 0] # (22): valley_indices=[0] (44): valley_indices=[1, 4] ... (77): valley_indices=[2]\n if len(valley_indices) == 0: # (23): NO CHANGE (45): NO CHANGE ... (78): NO CHANGE\n return\n if valley_indices[0] != start: # (24): NO CHANGE (46): NO CHANGE ... (79): NO CHANGE\n valley_indices = [start - 1] + valley_indices # (64): valley_indices=[1, 3]\n if valley_indices[-1] != stop - 1: # (25): NO CHANGE (47): NO CHANGE ... (80): NO CHANGE\n valley_indices += [stop] # (26): valley_indices=[0, 5]\n for i in range(len(valley_indices) - 1): # (27): i=0 (48): i=0 ... (84): min_other_than_zero=, water=, N=5, ans=8\n if valley_indices[i + 1] - valley_indices[i] > 1: # (28): NO CHANGE (49): NO CHANGE (67): NO CHANGE\n water(H, valley_indices[i] + 1, valley_indices[i + 1]) # (29): start=1 (50): stop=4, start=2 (68): stop=3\n\n\nN = int(input()) # (2): N=5\nH = [int(s) for s in input().split()] # (3): H=[2, 0, 8, 3, 0]\n\nans = 0 # (4): ans=0\nwater(H, 0, N) # (5): stop=5, start=0\nprint(ans)\n"], "anno_status": [false], "diff_content": "-def min_other_than_zero(seq):\n- seq = set(seq)\n- if 0 in seq: seq.remove(0)\n- return min(seq)\n-\n-\n def water(H, start, stop):\n if max(H) == 0:\n return\n \n \n- valley = min_other_than_zero(H[start:stop])\n+ valley = min(H[start:stop])\n for i in range(start, stop):\n H[i] -= valley\n global ans\n ans += valley\n \n \n valley_indices = [start + i for i, h in enumerate(H[start:stop]) if h == 0]\n- if len(valley_indices) == 0:\n- return\n if valley_indices[0] != start:\n valley_indices = [start - 1] + valley_indices\n if valley_indices[-1] != stop - 1:\n valley_indices += [stop]\n for i in range(len(valley_indices) - 1):\n if valley_indices[i + 1] - valley_indices[i] > 1:\n water(H, valley_indices[i] + 1, valley_indices[i + 1])\n \n \n N = int(input())\n H = [int(s) for s in input().split()]\n \n ans = 0\n water(H, 0, N)\n print(ans)\n \n", "FL_content": "\n def min_other_than_zero(seq):\n seq = set(seq)\n if 0 in seq: seq.remove(0)\n return min(seq)\n \n \n def water(H, start, stop):\n if max(H) == 0:\n return\n \n \n valley = min_other_than_zero(H[start:stop])\n for i in range(start, stop):\n H[i] -= valley\n global ans\n ans += valley\n \n \n valley_indices = [start + i for i, h in enumerate(H[start:stop]) if h == 0]\n if len(valley_indices) == 0:\n return\n if valley_indices[0] != start:\n valley_indices = [start - 1] + valley_indices\n if valley_indices[-1] != stop - 1:\n valley_indices += [stop]\n for i in range(len(valley_indices) - 1):\n if valley_indices[i + 1] - valley_indices[i] > 1:\n water(H, valley_indices[i] + 1, valley_indices[i + 1])\n \n \n N = int(input())\n H = [int(s) for s in input().split()]\n \n ans = 0\n water(H, 0, N)\n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 37 }, { "user_id": "u476225888", "problem_id": "p02537", "submission1_id": "s860783189-FL", "submission2_id": "s794928131", "status1": "Wrong Answer", "status2": "Accepted", "code1": "import sys, math\nimport io, os\n\nfrom bisect import bisect_left as bl, bisect_right as br, insort\nfrom heapq import heapify, heappush, heappop\nfrom collections import defaultdict as dd, deque, Counter\n\ndef data(): return sys.stdin.readline().strip()\ndef mdata(): return list(map(int, data().split()))\ndef outl(var): sys.stdout.write('\\n'.join(map(str, var)) + '\\n')\ndef out(var): sys.stdout.write(str(var) + '\\n')\nfrom decimal import Decimal\n\n\nmod = 998244353\nINF=float('inf')\n\n\ndef construct_sum(segtree,a,n,func=max):\n for i in range(n):\n segtree[n + i] = a[i]\n for i in range(n - 1, 0, -1):\n segtree[i] = func(segtree[2 * i], segtree[2 * i + 1])\n\ndef update(pos, x, func=max):\n pos += n-1\n segtree[pos] = x\n while (pos>1):\n pos>>=1\n segtree[pos] = func(segtree[2 * pos], segtree[2 * pos + 1])\n\ndef get(l, r, func=max):\n l += n-1\n r += n-1\n s = 0\n while (l <= r):\n if l & 1:\n s = func(segtree[l],s)\n l+=1\n if (r+1) & 1:\n s = func(segtree[r],s)\n r-=1\n l >>= 1\n r >>= 1\n return s\n\nn,k=mdata()\na=[int(data()) for i in range(n)]\nn=max(a)+1\nsegtree = [0]*(2*n)\nconstruct_sum(segtree,[0]*n,n)\nans=0\nfor i in a:\n a1=get(max(i-k,0),min(i+k,n))+1\n update(i,a1)\n ans=max(ans,a1)\nout(ans)\n\n\n\n\n\n\n", "code2": "import sys, math\nimport io, os\n\nfrom bisect import bisect_left as bl, bisect_right as br, insort\nfrom heapq import heapify, heappush, heappop\nfrom collections import defaultdict as dd, deque, Counter\n\ndef data(): return sys.stdin.readline().strip()\ndef mdata(): return list(map(int, data().split()))\ndef outl(var): sys.stdout.write('\\n'.join(map(str, var)) + '\\n')\ndef out(var): sys.stdout.write(str(var) + '\\n')\nfrom decimal import Decimal\n\n\nmod = 998244353\nINF=float('inf')\n\n\ndef construct_sum(segtree,a,n,func=max):\n for i in range(n):\n segtree[n + i] = a[i]\n for i in range(n - 1, 0, -1):\n segtree[i] = func(segtree[2 * i], segtree[2 * i + 1])\n\ndef update(pos, x, func=max):\n pos += n-1\n segtree[pos] = x\n while (pos>1):\n pos>>=1\n segtree[pos] = func(segtree[2 * pos], segtree[2 * pos + 1])\n\ndef get(l, r, func=max):\n l += n-1\n r += n-1\n s = 0\n while (l <= r):\n if l & 1:\n s = func(segtree[l],s)\n l+=1\n if (r+1) & 1:\n s = func(segtree[r],s)\n r-=1\n l >>= 1\n r >>= 1\n return s\n\nn,k=mdata()\na=[int(data()) for i in range(n)]\nn=max(a)+1\nsegtree = [0]*(2*n)\nconstruct_sum(segtree,[0]*n,n)\nans=0\nfor i in a:\n a1=get(max(i-k+1,1),min(i+k+1,n))+1\n update(i+1,a1)\n ans=max(ans,a1)\nout(ans)\n\n\n\n\n\n\n", "original_language1": "PyPy3 (7.3.0)", "original_language2": "PyPy3 (7.3.0)", "date1": "1601230190", "date2": "1601232550", "bleu_score": "0.9907727968664121", "code1_test_status": [1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], "code1_test_score": 81, "total_score": 101, "input": "10 3\n0\n1\n3\n0\n5\n9\n9\n7\n4\n4\n", "actual_output": "9\n", "expected_output": "7\n\n", "anno_code": ["import sys, math\nimport io, os\n\nfrom bisect import bisect_left as bl, bisect_right as br, insort\nfrom heapq import heapify, heappush, heappop\nfrom collections import defaultdict as dd, deque, Counter\n\ndef data(): return sys.stdin.readline().strip()\ndef mdata(): return list(map(int, data().split()))\ndef outl(var): sys.stdout.write('\\n'.join(map(str, var)) + '\\n') # (0): outl=\ndef out(var): sys.stdout.write(str(var) + '\\n') # (1): out=, Decimal=\nfrom decimal import Decimal\n\n\nmod = 998244353 # (2): mod=998244353\nINF=float('inf') # (3): INF=inf\n\n\ndef construct_sum(segtree,a,n,func=max): # (4): construct_sum=\n for i in range(n): # (12): i=0 (14): i=1 ... (32): NO CHANGE\n segtree[n + i] = a[i] # (13): NO CHANGE (15): NO CHANGE ... (31): NO CHANGE\n for i in range(n - 1, 0, -1): # (33): NO CHANGE (35): i=8 ... (51): sys=, math=, io=, os=, bl=, br=, insort=, heapify=, heappush=, heappop=, dd=, deque=, Counter=, data=, mdata=, outl=, out=, Decimal=, mod=998244353, INF=inf, construct_sum=, update=, get=, k=3, a=[0, 1, 3, 0, 5, 9, 9, 7, 4, 4]\n segtree[i] = func(segtree[2 * i], segtree[2 * i + 1]) # (34): NO CHANGE (36): NO CHANGE ... (50): NO CHANGE\n\ndef update(pos, x, func=max): # (5): update=\n pos += n-1 # (76): pos=9 (112): pos=10 ... (440): pos=13\n segtree[pos] = x # (77): NO CHANGE (113): NO CHANGE ... (441): NO CHANGE\n while (pos>1): # (78): NO CHANGE (81): NO CHANGE ... (451): sys=, math=, io=, os=, bl=, br=, insort=, heapify=, heappush=, heappop=, dd=, deque=, Counter=, data=, mdata=, outl=, out=, Decimal=, mod=998244353, INF=inf, construct_sum=, update=, get=, n=10, k=3, a=[0, 1, 3, 0, 5, 9, 9, 7, 4, 4], segtree=[0, 9, 7, 9, 7, 2, 9, 4, 7, 6, 2, 0, 3, 9, 4, 0, 7, 0, 6, 0], ans=8, i=4, a1=9\n pos>>=1 # (79): pos=4 (82): pos=2 ... (449): pos=1\n segtree[pos] = func(segtree[2 * pos], segtree[2 * pos + 1]) # (80): NO CHANGE (83): NO CHANGE ... (450): NO CHANGE\n\ndef get(l, r, func=max): # (6): get=\n l += n-1 # (55): l=9 (91): l=9 ... (414): l=10\n r += n-1 # (56): r=12 (92): r=13 ... (415): r=16\n s = 0 # (57): s=0 (93): s=0 ... (416): s=0\n while (l <= r): # (58): NO CHANGE (67): NO CHANGE ... (438): sys=, math=, io=, os=, bl=, br=, insort=, heapify=, heappush=, heappop=, dd=, deque=, Counter=, data=, mdata=, outl=, out=, Decimal=, mod=998244353, INF=inf, construct_sum=, update=, get=, n=10, k=3, a=[0, 1, 3, 0, 5, 9, 9, 7, 4, 4], segtree=[0, 8, 7, 8, 7, 2, 8, 4, 7, 6, 2, 0, 3, 8, 4, 0, 7, 0, 6, 0], ans=8, i=4, a1=9\n if l & 1: # (59): NO CHANGE (68): NO CHANGE ... (432): NO CHANGE\n s = func(segtree[l],s) # (60): NO CHANGE (69): NO CHANGE ... (433): s=8\n l+=1 # (61): l=10 (70): l=6 ... (434): l=4\n if (r+1) & 1: # (62): NO CHANGE (71): NO CHANGE ... (435): NO CHANGE\n s = func(segtree[r],s) # (63): NO CHANGE (106): NO CHANGE ... (420): s=7\n r-=1 # (64): r=11 (107): r=5 ... (421): r=15\n l >>= 1 # (65): l=5 (72): l=3 ... (436): l=2\n r >>= 1 # (66): r=5 (73): r=2 ... (437): r=1\n return s\n\nn,k=mdata() # (7): n=10, k=3\na=[int(data()) for i in range(n)] # (8): a=[0, 1, 3, 0, 5, 9, 9, 7, 4, 4]\nn=max(a)+1 # (9): NO CHANGE\nsegtree = [0]*(2*n) # (10): segtree=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nconstruct_sum(segtree,[0]*n,n) # (11): a=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0], func=\nans=0 # (52): ans=0\nfor i in a: # (53): i=0 (89): i=1 ... (453): NO CHANGE\n a1=get(max(i-k,0),min(i+k,n))+1 # (54): l=0, r=3, func= (90): l=0, r=4, func= ... (413): l=1, r=7, func=\n update(i,a1) # (75): pos=0, x=1, func= (111): pos=1, x=2, func= ... (439): pos=4, x=9, func=\n ans=max(ans,a1) # (88): ans=1 (124): ans=2 ... (452): ans=9\nout(ans) # (454): var=9\n\n\n\n\n\n\n"], "anno_status": [false], "diff_content": " import sys, math\n import io, os\n \n from bisect import bisect_left as bl, bisect_right as br, insort\n from heapq import heapify, heappush, heappop\n from collections import defaultdict as dd, deque, Counter\n \n def data(): return sys.stdin.readline().strip()\n def mdata(): return list(map(int, data().split()))\n def outl(var): sys.stdout.write('\\n'.join(map(str, var)) + '\\n')\n def out(var): sys.stdout.write(str(var) + '\\n')\n from decimal import Decimal\n \n \n mod = 998244353\n INF=float('inf')\n \n \n def construct_sum(segtree,a,n,func=max):\n for i in range(n):\n segtree[n + i] = a[i]\n for i in range(n - 1, 0, -1):\n segtree[i] = func(segtree[2 * i], segtree[2 * i + 1])\n \n def update(pos, x, func=max):\n pos += n-1\n segtree[pos] = x\n while (pos>1):\n pos>>=1\n segtree[pos] = func(segtree[2 * pos], segtree[2 * pos + 1])\n \n def get(l, r, func=max):\n l += n-1\n r += n-1\n s = 0\n while (l <= r):\n if l & 1:\n s = func(segtree[l],s)\n l+=1\n if (r+1) & 1:\n s = func(segtree[r],s)\n r-=1\n l >>= 1\n r >>= 1\n return s\n \n n,k=mdata()\n a=[int(data()) for i in range(n)]\n n=max(a)+1\n segtree = [0]*(2*n)\n construct_sum(segtree,[0]*n,n)\n ans=0\n for i in a:\n- a1=get(max(i-k,0),min(i+k,n))+1\n- update(i,a1)\n+ a1=get(max(i-k+1,1),min(i+k+1,n))+1\n+ update(i+1,a1)\n ans=max(ans,a1)\n out(ans)\n \n \n \n \n \n \n \n", "FL_content": "\n import sys, math\n import io, os\n \n from bisect import bisect_left as bl, bisect_right as br, insort\n from heapq import heapify, heappush, heappop\n from collections import defaultdict as dd, deque, Counter\n \n def data(): return sys.stdin.readline().strip()\n def mdata(): return list(map(int, data().split()))\n def outl(var): sys.stdout.write('\\n'.join(map(str, var)) + '\\n')\n def out(var): sys.stdout.write(str(var) + '\\n')\n from decimal import Decimal\n \n \n mod = 998244353\n INF=float('inf')\n \n \n def construct_sum(segtree,a,n,func=max):\n for i in range(n):\n segtree[n + i] = a[i]\n for i in range(n - 1, 0, -1):\n segtree[i] = func(segtree[2 * i], segtree[2 * i + 1])\n \n def update(pos, x, func=max):\n pos += n-1\n segtree[pos] = x\n while (pos>1):\n pos>>=1\n segtree[pos] = func(segtree[2 * pos], segtree[2 * pos + 1])\n \n def get(l, r, func=max):\n l += n-1\n r += n-1\n s = 0\n while (l <= r):\n if l & 1:\n s = func(segtree[l],s)\n l+=1\n if (r+1) & 1:\n s = func(segtree[r],s)\n r-=1\n l >>= 1\n r >>= 1\n return s\n \n n,k=mdata()\n a=[int(data()) for i in range(n)]\n n=max(a)+1\n segtree = [0]*(2*n)\n construct_sum(segtree,[0]*n,n)\n ans=0\n for i in a:\n- a1=get(max(i-k,0),min(i+k,n))+1\n update(i,a1)\n ans=max(ans,a1)\n out(ans)\n \n \n \n \n \n \n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 64 }, { "user_id": "u181195295", "problem_id": "p03031", "submission1_id": "s847489380-FL", "submission2_id": "s866895797", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N,M = map(int,input().split())\nswis = [list(map(int,input().split()))[1:] for _ in range(M)]\nneed = list(map(int,input().split()))\n\nans = 0\nfor i in range(1<= A and C <= B:\n print('YES')\nelse:\n print('No')", "code2": "A, B, C = map(int, input().split())\n\nif C >= A and C <= B:\n print('Yes')\nelse:\n print('No')", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1494723870", "date2": "1494724130", "bleu_score": "0.9631321533466505", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0], "code1_test_score": 16, "total_score": 21, "input": "-1 3 -1\n", "actual_output": "YES\n", "expected_output": "Yes\n\n", "anno_code": ["A, B, C = map(int, input().split()) # (0): A=-1, B=3, C=-1\n\nif C >= A and C <= B: # (1): NO CHANGE\n print('YES')\nelse:\n print('No')"], "anno_status": [true], "diff_content": " A, B, C = map(int, input().split())\n \n if C >= A and C <= B:\n- print('YES')\n+ print('Yes')\n else:\n print('No')\n", "FL_content": "\n A, B, C = map(int, input().split())\n \n if C >= A and C <= B:\n- print('YES')\n else:\n print('No')\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 6 }, { "user_id": "u296463304", "problem_id": "p03448", "submission1_id": "s059415823-FL", "submission2_id": "s585526726", "status1": "Wrong Answer", "status2": "Accepted", "code1": "a=int(input(\"\"))\nb=int(input(\"\"))\nc=int(input(\"\"))\nx=int(input(\"\"))\ndef countcourse(r,t,y,u):\n cnt=0\n for h in range(r):\n for l in range(t):\n for o in range(y):\n if 500*h+100*l+50*o==u:\n cnt+=1\n return cnt\nprint(countcourse(a,b,c,x))", "code2": "a=int(input(\"\"))\nb=int(input(\"\"))\nc=int(input(\"\"))\nx=int(input(\"\"))\ndef countcourse(r,t,y,u):\n cnt=0\n n=0\n for h in range(r+1):\n for l in range(t+1):\n for o in range(y+1):\n if 500*h+100*l+50*o==u:\n cnt+=1\n return cnt\nprint(countcourse(a,b,c,x))", "original_language1": "Python (3.8.2)", "original_language2": "Python (3.8.2)", "date1": "1598272604", "date2": "1598275022", "bleu_score": "0.9395340583075859", "code1_test_status": [1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0], "code1_test_score": 92, "total_score": 103, "input": "5\n0\n0\n0\n", "actual_output": "0\n", "expected_output": "1\n\n", "anno_code": ["a=int(input(\"\")) # (0): a=5\nb=int(input(\"\")) # (1): b=0\nc=int(input(\"\")) # (2): c=0\nx=int(input(\"\")) # (3): x=0\ndef countcourse(r,t,y,u): # (4): countcourse=\n cnt=0 # (6): cnt=0\n for h in range(r): # (7): h=0 (9): h=1 ... (15): h=4\n for l in range(t): # (8): NO CHANGE (10): NO CHANGE ... (16): NO CHANGE\n for o in range(y):\n if 500*h+100*l+50*o==u:\n cnt+=1\n return cnt\nprint(countcourse(a,b,c,x)) # (5): r=5, t=0, y=0, u=0\n"], "anno_status": [true], "diff_content": " a=int(input(\"\"))\n b=int(input(\"\"))\n c=int(input(\"\"))\n x=int(input(\"\"))\n def countcourse(r,t,y,u):\n cnt=0\n- for h in range(r):\n- for l in range(t):\n- for o in range(y):\n+ n=0\n+ for h in range(r+1):\n+ for l in range(t+1):\n+ for o in range(y+1):\n if 500*h+100*l+50*o==u:\n cnt+=1\n return cnt\n print(countcourse(a,b,c,x))\n", "FL_content": "\n a=int(input(\"\"))\n b=int(input(\"\"))\n c=int(input(\"\"))\n x=int(input(\"\"))\n def countcourse(r,t,y,u):\n cnt=0\n- for h in range(r):\n- for l in range(t):\n- for o in range(y):\n if 500*h+100*l+50*o==u:\n cnt+=1\n return cnt\n print(countcourse(a,b,c,x))\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 13 }, { "user_id": "u230117534", "problem_id": "p03739", "submission1_id": "s983423472-FL", "submission2_id": "s536225946", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input().strip())\nA = list(map(int, input().strip().split(\" \")))\n\ns = A[0]\ncount = 0\n\nif s == 0:\n if n == 1:\n count += 1\n else:\n count += 1\n if A[1] > 0:\n s = -1\n else:\n s = 1\n\nfor a in A[1:]:\n prev = s\n sign = prev > 0\n s += a\n if s == 0:\n count += 1\n if sign: \n s = -1\n else: \n s = 1\n elif sign == (s > 0): \n count += abs(s)+1\n if s > 0:\n s = -1\n else:\n s = 1\n else:\n pass\n\nprint(count)\n", "code2": "n = int(input().strip())\nA = list(map(int, input().strip().split(\" \")))\n\ndef solver(_sign):\n s = A[0]\n count = 0\n\n if _sign:\n if s <= 0: \n count += abs(s) + 1\n s = 1\n else:\n if s >= 0: \n count += abs(s) + 1\n s = -1\n\n for a in A[1:]:\n prev = s\n sign = prev > 0\n s += a\n if s == 0:\n count += 1\n if sign: \n s = -1\n else: \n s = 1\n elif sign == (s > 0): \n count += abs(s)+1\n if s > 0:\n s = -1\n else:\n s = 1\n else:\n pass\n return count\n\nprint(min(solver(True), solver(False)))", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1590633503", "date2": "1590635015", "bleu_score": "0.7302420023893698", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], "code1_test_score": 79, "total_score": 94, "input": "5\n40 -1 -1 1 -5\n", "actual_output": "53\n", "expected_output": "46\n\n", "anno_code": ["n = int(input().strip()) # (0): n=5\nA = list(map(int, input().strip().split(\" \"))) # (1): A=[40, -1, -1, 1, -5]\n\ns = A[0] # (2): s=40\ncount = 0 # (3): count=0\n\nif s == 0: # (4): NO CHANGE\n if n == 1:\n count += 1\n else:\n count += 1\n if A[1] > 0:\n s = -1\n else:\n s = 1\n\nfor a in A[1:]: # (5): a=-1 (14): NO CHANGE ... (41): NO CHANGE\n prev = s # (6): prev=40 (15): prev=-1 ... (33): prev=-1\n sign = prev > 0 # (7): sign=True (16): sign=False ... (34): sign=False\n s += a # (8): s=39 (17): s=-2 ... (35): s=-6\n if s == 0: # (9): NO CHANGE (18): NO CHANGE ... (36): NO CHANGE\n count += 1\n if sign: \n s = -1\n else: \n s = 1\n elif sign == (s > 0): # (10): NO CHANGE (19): NO CHANGE ... (37): NO CHANGE\n count += abs(s)+1 # (11): count=40 (20): count=43 ... (38): count=53\n if s > 0: # (12): NO CHANGE (21): NO CHANGE ... (39): NO CHANGE\n s = -1 # (13): s=-1 (31): s=-1\n else:\n s = 1 # (22): s=1 (40): s=1\n else:\n pass\n\nprint(count)\n"], "anno_status": [true], "diff_content": " n = int(input().strip())\n A = list(map(int, input().strip().split(\" \")))\n \n-s = A[0]\n-count = 0\n+def solver(_sign):\n+ s = A[0]\n+ count = 0\n \n-if s == 0:\n- if n == 1:\n- count += 1\n+ if _sign:\n+ if s <= 0: \n+ count += abs(s) + 1\n+ s = 1\n else:\n- count += 1\n- if A[1] > 0:\n+ if s >= 0: \n+ count += abs(s) + 1\n s = -1\n- else:\n- s = 1\n \n-for a in A[1:]:\n- prev = s\n- sign = prev > 0\n- s += a\n- if s == 0:\n- count += 1\n- if sign: \n- s = -1\n- else: \n- s = 1\n- elif sign == (s > 0): \n- count += abs(s)+1\n- if s > 0:\n- s = -1\n+ for a in A[1:]:\n+ prev = s\n+ sign = prev > 0\n+ s += a\n+ if s == 0:\n+ count += 1\n+ if sign: \n+ s = -1\n+ else: \n+ s = 1\n+ elif sign == (s > 0): \n+ count += abs(s)+1\n+ if s > 0:\n+ s = -1\n+ else:\n+ s = 1\n else:\n- s = 1\n- else:\n- pass\n-\n-print(count)\n+ pass\n+ return count\n \n+print(min(solver(True), solver(False)))\n", "FL_content": "\n n = int(input().strip())\n A = list(map(int, input().strip().split(\" \")))\n \n s = A[0]\n count = 0\n \n if s == 0:\n if n == 1:\n count += 1\n else:\n count += 1\n if A[1] > 0:\n s = -1\n else:\n s = 1\n \n for a in A[1:]:\n prev = s\n sign = prev > 0\n s += a\n if s == 0:\n count += 1\n if sign: \n s = -1\n else: \n s = 1\n elif sign == (s > 0): \n count += abs(s)+1\n if s > 0:\n s = -1\n else:\n s = 1\n else:\n pass\n \n print(count)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 37 }, { "user_id": "u527993431", "problem_id": "p02830", "submission1_id": "s390667721-FL", "submission2_id": "s961997028", "status1": "Wrong Answer", "status2": "Accepted", "code1": "N = int(input())\nA,B = input().split()\ntmp = [[] for _ in range(N*2)]\nprint(A)\nM = 2*N\nfor i in range(0,N):\n\ttmp[2*i]=A[i]\n\ttmp[2*i+1]=B[i]\nans = \"\".join(tmp)\nprint(ans)", "code2": "N = int(input())\nA,B = input().split()\ntmp = [[] for _ in range(N*2)]\nM = 2*N\nfor i in range(0,N):\n\ttmp[2*i]=A[i]\n\ttmp[2*i+1]=B[i]\nans = \"\".join(tmp)\nprint(ans)", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1577067453", "date2": "1577067481", "bleu_score": "0.9407832753691012", "code1_test_status": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], "code1_test_score": 0, "total_score": 103, "input": "5\naaaaa aaaaa\n", "actual_output": "aaaaa\naaaaaaaaaa\n", "expected_output": "aaaaaaaaaa\n", "anno_code": ["N = int(input()) # (0): N=5\nA,B = input().split() # (1): A=aaaaa, B=aaaaa\ntmp = [[] for _ in range(N*2)] # (2): tmp\nprint(A) # (3): NO CHANGE\nM = 2*N # (4): M=10\nfor i in range(0,N): # (5): i=0 (8): tmp=['a', 'a', [], [], [], [], [], [], [], []], i=1 ... (20): NO CHANGE\n\ttmp[2*i]=A[i] # (6): tmp=['a', [], [], [], [], [], [], [], [], []] (9): tmp=['a', 'a', 'a', [], [], [], [], [], [], []] ... (18): tmp=['a', 'a', 'a', 'a', 'a', 'a', 'a', 'a', 'a', []]\n\ttmp[2*i+1]=B[i] # (7): tmp=['a', 'a', [], [], [], [], [], [], [], []] (10): tmp=['a', 'a', 'a', 'a', [], [], [], [], [], []] ... (19): tmp=['a', 'a', 'a', 'a', 'a', 'a', 'a', 'a', 'a', 'a']\nans = \"\".join(tmp) # (21): ans=aaaaaaaaaa\nprint(ans)"], "anno_status": [true], "diff_content": " N = int(input())\n A,B = input().split()\n tmp = [[] for _ in range(N*2)]\n-print(A)\n M = 2*N\n for i in range(0,N):\n \ttmp[2*i]=A[i]\n \ttmp[2*i+1]=B[i]\n ans = \"\".join(tmp)\n print(ans)\n", "FL_content": "\n N = int(input())\n A,B = input().split()\n tmp = [[] for _ in range(N*2)]\n-print(A)\n M = 2*N\n for i in range(0,N):\n \ttmp[2*i]=A[i]\n \ttmp[2*i+1]=B[i]\n ans = \"\".join(tmp)\n print(ans)\n", "added_lines": 0, "removed_lines": 0, "code1_lines": 10 }, { "user_id": "u379559362", "problem_id": "p03739", "submission1_id": "s297569404-FL", "submission2_id": "s455800683", "status1": "Wrong Answer", "status2": "Accepted", "code1": "n = int(input())\na = list(map(int, input().split()))\nans = 0\n\nwhile a[0] == 0:\n if a[1] > 0:\n a[0] = -1\n elif a[1] < 0:\n a[0] = 1\n else:\n a.pop(0)\n ans += 1\n\nif a[0] < 0:\n a = list(map(lambda x: x * (-1), a))\n\nproduct = 0\n\nfor i in range(len(a)):\n product += a[i]\n\n if i % 2 == 0:\n if product <= 0:\n ans += abs(product) + 1\n product = 1\n\n elif i % 2 == 1:\n if product >= 0:\n ans += abs(product) + 1\n product = -1\n\nprint(ans)\n", "code2": "n = int(input())\na = list(map(int, input().split()))\n_a = list(map(lambda x: x * (-1), a))\n\n\ndef func(l: list):\n _ans = 0\n product = 0\n for i in range(n):\n product += l[i]\n\n if i % 2 == 0:\n if product <= 0:\n _ans += abs(product) + 1\n product = 1\n\n elif i % 2 == 1:\n if product >= 0:\n _ans += abs(product) + 1\n product = -1\n return _ans\n\nans = min(func(a), func(_a))\nprint(ans)\n", "original_language1": "Python (3.4.3)", "original_language2": "Python (3.4.3)", "date1": "1493676542", "date2": "1493677585", "bleu_score": "0.7768195102037689", "code1_test_status": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1], "code1_test_score": 77, "total_score": 94, "input": "5\n113 -1 -1 1 -2\n", "actual_output": "123\n", "expected_output": "119\n\n", "anno_code": ["n = int(input()) # (0): n=5\na = list(map(int, input().split())) # (1): a=[113, -1, -1, 1, -2]\nans = 0 # (2): ans=0\n\nwhile a[0] == 0: # (3): NO CHANGE\n if a[1] > 0:\n a[0] = -1\n elif a[1] < 0:\n a[0] = 1\n else:\n a.pop(0)\n ans += 1\n\nif a[0] < 0: # (4): NO CHANGE\n a = list(map(lambda x: x * (-1), a))\n\nproduct = 0 # (5): product=0\n\nfor i in range(len(a)): # (6): i=0 (10): i=1 ... (36): NO CHANGE\n product += a[i] # (7): product=113 (11): product=112 ... (31): product=-3\n\n if i % 2 == 0: # (8): NO CHANGE (12): NO CHANGE ... (32): NO CHANGE\n if product <= 0: # (9): NO CHANGE (20): NO CHANGE (33): NO CHANGE\n ans += abs(product) + 1 # (21): ans=116 (34): ans=123\n product = 1 # (22): product=1 (35): product=1\n\n elif i % 2 == 1: # (13): NO CHANGE (26): NO CHANGE\n if product >= 0: # (14): NO CHANGE (27): NO CHANGE\n ans += abs(product) + 1 # (15): ans=113 (28): ans=119\n product = -1 # (16): product=-1 (29): product=-1\n\nprint(ans)\n"], "anno_status": [true], "diff_content": " n = int(input())\n a = list(map(int, input().split()))\n-ans = 0\n+_a = list(map(lambda x: x * (-1), a))\n \n-while a[0] == 0:\n- if a[1] > 0:\n- a[0] = -1\n- elif a[1] < 0:\n- a[0] = 1\n- else:\n- a.pop(0)\n- ans += 1\n \n-if a[0] < 0:\n- a = list(map(lambda x: x * (-1), a))\n+def func(l: list):\n+ _ans = 0\n+ product = 0\n+ for i in range(n):\n+ product += l[i]\n \n-product = 0\n+ if i % 2 == 0:\n+ if product <= 0:\n+ _ans += abs(product) + 1\n+ product = 1\n \n-for i in range(len(a)):\n- product += a[i]\n-\n- if i % 2 == 0:\n- if product <= 0:\n- ans += abs(product) + 1\n- product = 1\n-\n- elif i % 2 == 1:\n- if product >= 0:\n- ans += abs(product) + 1\n- product = -1\n+ elif i % 2 == 1:\n+ if product >= 0:\n+ _ans += abs(product) + 1\n+ product = -1\n+ return _ans\n \n+ans = min(func(a), func(_a))\n print(ans)\n \n", "FL_content": "\n n = int(input())\n a = list(map(int, input().split()))\n ans = 0\n \n while a[0] == 0:\n if a[1] > 0:\n a[0] = -1\n elif a[1] < 0:\n a[0] = 1\n else:\n a.pop(0)\n ans += 1\n \n if a[0] < 0:\n a = list(map(lambda x: x * (-1), a))\n \n product = 0\n \n for i in range(len(a)):\n product += a[i]\n \n if i % 2 == 0:\n if product <= 0:\n ans += abs(product) + 1\n product = 1\n \n elif i % 2 == 1:\n if product >= 0:\n ans += abs(product) + 1\n product = -1\n \n print(ans)\n \n", "added_lines": 0, "removed_lines": 0, "code1_lines": 33 } ]